Trellis shaping
- 1 March 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 38 (2) , 281-300
- https://doi.org/10.1109/18.119687
Abstract
The author discusses trellis shaping, a method of selecting a minimum-weight sequence from an equivalence class of possible transmitted sequences by a search through the trellis diagram of a shaping convolutional code C/sub s/. Shaping gains on the order of 1 dB may be obtained with simple four-state shaping codes and with moderate constellation expansion. The shaping gains obtained with more complicated codes approach the ultimate shaping gain of 1.53 dB. With a feedback-free syndrome-former for C/sub s/, transmitted data can be recovered without catastrophic error propagation. Constellation expansion and peak-to-average energy ratio may be effectively limited by peak constraints. With lattice-theoretic constellations, the shaping operation may be characterized as a decoding of an initial sequence in a channel trellis code by a minimum-distance decoder for a shaping trellis code based on the shaping convolutional code, and the set of possible transmitted sequences is then the set of code sequences in the channel trellis code that lie in the Voronoi region of the trellis shaping code.<>Keywords
This publication has 20 references indexed in Scilit:
- Shaping gains using non-equiprobable signalingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal nonuniform signaling for Gaussian channelsIEEE Transactions on Information Theory, 1993
- Nonequiprobable signaling on the Gaussian channelIEEE Transactions on Information Theory, 1990
- Trellis coded quantization of memoryless and Gauss-Markov sourcesIEEE Transactions on Communications, 1990
- Multidimensional constellations. II. Voronoi constellationsIEEE Journal on Selected Areas in Communications, 1989
- Coset codes. I. Introduction and geometrical classificationIEEE Transactions on Information Theory, 1988
- A fast encoding method for lattice codes and quantizersIEEE Transactions on Information Theory, 1983
- Structural analysis of convolutional codes via dual codesIEEE Transactions on Information Theory, 1973
- The viterbi algorithmProceedings of the IEEE, 1973
- Convolutional codes I: Algebraic structureIEEE Transactions on Information Theory, 1970