Abstract
Huffman shaping represents an alternative to trellis shaping and shell mapping. Shaping gains within 0.1 dB of the ultimate limit of 1.53 dB are achieved at low complexity. In the transmitter, the sequence of scrambled binary data bits is parsed into Huffman codewords, which are then mapped into modulation symbols. The Huffman code is designed to let the modulation symbols assume approximately a Gaussian distribution. The effectiveness of this technique is studied for uncoded PAM and QAM modulation. In a practical system, Huffman shaping would be combined with other coding techniques to achieve shaping gain and coding gain. Unlike trellis shaping or shell mapping, Huffman shaping is not a constant-rate-encoding scheme and decoding errors can lead to bit insertions and deletions. This can be acceptable for transmission of variable-length packets in burst mode. Transmission at constant rate requires some method of buffering and flow control. A simple framing scheme is presented and analyzed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. D. Forney and G. Ungerboeck, “Modulation and Coding for Linear Gaussian Channels,” IEEE Transactions on Information Theory, vol. 44, pp. 2384–2415, Oct. 1998.
G. D. Forney, Jr., “Trellis shaping,” IEEE Transactions on Information Theory, vol. 38, pp. 281–300, Mar. 1992.
P. Fortier, A. Ruiz, and J. M. Cioffi, “Multidimensional Signal Sets Through the Shell Construction for Parallel Channels,” IEEE Transactions on Communications, vol. 40, pp. 500–512, Mar. 1992.
A. K. Khandani and P. Kabal, “Shaping Multidimensional Signal Spaces- Part I: Optimum Shaping, Shell Mapping,” IEEE Transactions on Information Theory, vol. 39, pp. 1799–1808, Nov. 1993.
F. R. Kschischang and S. Pasupathy, “Optimal Nonuniform Signaling for Gaussian Channels,” IEEE Transactions on Information Theory, vol. 39, pp. 913–929, May 1993.
G. R. Lang and F. M. Longstaff, “A Leech Lattice Modem,” IEEE Journal on Selected Areas in Communications, vol. 7, pp. 968–973, Aug. 1989.
R. Laroia, N. Farvardin and S. Tretter, “On Optimal Shaping of Multidimensional Constellations,” IEEE Transactions on Information Theory, vol. 40, pp. 1044–1056, July 1994.
G. Ungerboeck and Haixiang Liang, “Coding for V.92 Issue 2,” Contribution TR-30.1/99-11-064R1, TIA TR30 meeting, Clearwater, Nov. 29, 1999.
G. D. Forney and L.- F. Wei, “Multidimensional Constellations — Part I: Introduction, Figures of Merit, and Generalized Cross Constellations,” IEEE Journal on Selected Areas in Communications, vol. 7, pp. 877–892, Aug. 1989.
T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, 1991.
[11] J. M. Wozencraft and I. M. Jacobs, Principles of Communication Engineering, John Wiley & Sons, 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ungerboeck, G. (2002). Huffman Shaping. In: Blahut, R.E., Koetter, R. (eds) Codes, Graphs, and Systems. The Kluwer International Series in Engineering and Computer Science, vol 670. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0895-3_17
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0895-3_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5292-1
Online ISBN: 978-1-4615-0895-3
eBook Packages: Springer Book Archive