The design of binary shaping filter of binary code

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/2) distribution. In this thesis, 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 C,. 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.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2010

Author dc:creator

• Huang, Shao-Lun, Ph. D. Massachusetts Institute of Technology

Advisor dc:contributor.advisor

• Lizhong Zheng.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/60166

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/60166