A VLSI decoder for a new type of constellations adapted to the Rayleigh Fading Channel
Wireless Networks - Special issue VLSI in wireless networks
Multilevel Reed-Solomon Coding in Asymmetric Digital Subscriber Lines
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Detection of signals in correlated interference using a predictive VA
Signal Processing
Coding schemes for chip-to-chip interconnect applications
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Improving multi-level NAND flash memory storage reliability using concatenated TCM-BCH coding
Proceedings of the 19th ACM Great Lakes symposium on VLSI
Fundamental performance limits of communications systems impaired by impulse noise
IEEE Transactions on Communications
IEEE Transactions on Information Theory
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Constellation subset selection: theories and algorithms
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Constellation subset selection: theories and algorithms
IEEE Transactions on Wireless Communications
Linear-time nearest point algorithms for coxeter lattices
IEEE Transactions on Information Theory
On the dimensionality of multilevel coded modulation in the high SNR regime
IEEE Communications Letters
Improving multi-level NAND flash memory storage reliability using concatenated BCH-TCM coding
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A hardware-efficient technique to implement a trellis code modulation decoder
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Linear Block Codes for Four-Dimensional Signals
Finite Fields and Their Applications
| Hi-index | 754.96 |
Trellis-coded modulation schemes using four-, eight-, or16-dimensional constellations have a number of potential advantages over the usual two-dimensional schemes: a smaller constituent two-dimensional constellation, easier tolerance to phase ambiguities, and a better trade-off between complexity and coding gain. A number of such schemes are presented and evaluated. Starting with a variety of multidimensional lattices, we show how to select multidimensional constellations, how to partition them into subsets, how to construct trellis codes using those subsets, and how to map hits to constellation points. Simplifications of the Viterbi decoding algorithm are presented. We conclude that there are multidimensional trellis-coded modulation schemes that perform better for the same complexity than do two-dimensional schemes.