An efficiency-complexity controllable rate adaptive lossy source coding-hybrid majority voting code

Lin, Wensheng; Matsumoto, Tad (2018-10-08)
 
Avaa tiedosto
Lataukset: 

URL:
https://doi.org/10.1109/LCOMM.2018.2874220

Lin, Wensheng
Matsumoto, Tad
Institute of Electrical and Electronics Engineers
08.10.2018

W. Lin and T. Matsumoto, "An Efficiency-Complexity Controllable Rate Adaptive Lossy Source Coding—Hybrid Majority Voting Code," in IEEE Communications Letters, vol. 22, no. 12, pp. 2419-2422, Dec. 2018. doi: 10.1109/LCOMM.2018.2874220

https://rightsstatements.org/vocab/InC/1.0/
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1109/LCOMM.2018.2874220
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2019052416988
Tiivistelmä

Abstract

This letter proposes a practical source coding scheme, so-called hybrid majority voting (HMV) code, for lossy compression with a discrete memoryless source. Inspired by the coding scheme used in the classic rate-distortion theorem, we find a series of basic MV codes and analyze their rate-distortion performance. We then present an algorithm to find two component MV codes and apply them to lossy compression, group by group, to construct HMV codes. Finally, we show an example of joint source-channel coding based on the HMV code. The performance evaluation indicates that the HMV code makes it possible to easily control efficiency and complexity.

Kokoelmat