The design of binary shaping filter of binary code
Name
681763441-MIT.pdf
Description
Full printable version
Size
1.59 MB
Format
Adobe PDF
Checksum (MD5)
84193bec49c9fbf64ba9b87e88d11f45
Author(s)
Huang, Shao-Lun, Ph. D. Massachusetts Institute of Technology
Advisor(s)
Lizhong Zheng.
Date Issued
2010
Publisher
Massachusetts Institute of Technology
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/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.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.
Includes bibliographical references (p. 35).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
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.
Persistent DSpace Link
