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
An efficiency-complexity controllable rate adaptive lossy source coding-hybrid majority voting code
|Author:||Lin, Wensheng1; Matsumoto, Tad1,2|
1School of Information Science, Japan Advanced Institute of Science and Technology, Nomi 923-1292, Japan
2Centre for Wireless Communications, University of Oulu, 90014 Oulu, Finland
|Online Access:||PDF Full Text (PDF, 0.4 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe2019052416988
Institute of Electrical and Electronics Engineers,
|Publish Date:|| 2019-05-24
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.
IEEE communications letters
|Pages:||2419 - 2422|
|Type of Publication:||
A1 Journal article – refereed
|Field of Science:||
213 Electronic, automation and communications engineering, electronics
This work is funded in part by China Scholarship Council (CSC) and in part by Japan Advanced Institute of Science and Technology (JAIST) Core-to-Core Program.
© 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.