The design of binary shaping filter of binary code
Name
Zheng_The design of binary.pdf
Size
646.45 KB
Format
Adobe PDF
Checksum (MD5)
9fb881d1b7bce410e702f5b2099b6a5b
Author(s)
Zheng, Lizhong
Huang, Shao-Lun
Blankenship, Yufei
Date Issued
August 2010
Journal
Proceedings of the 2010 IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Zheng, Lizhong et al. "The design of binary shaping filter of binary code." Proceedings of the 2010 IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS): 228-232. © 2010 IEEE.
Version
Final published version
Abstract
In information theory, in order to maximize the total throughput, it is required that the codebook has an empirical distribution that maximizes the mutual information over the channel. In coding theory, however, most codes we can generate have Bernoulli (1 over 2) distribution. In this paper, we present a new coding scheme to efficiently generate binary codes with different distributions. Our main approach is to first encode the information bits by a linear code C, and then quantized the codeword to the closest codeword in another linear code Cs. The quantization error is then treated as the encoded codeword in our coding scheme. We discuss the practicality and advantage of such codes and give a design example.
Description
Proceedings of a meeting held 25-27 June 2010, Beijing, China.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/WCINS.2010.5541727
