Group Trellis Codes Over Multidimensional Unbalanced PSK and Their Optimality

IEEE Transactions on Communications

Volumn 43, Issue 12, 1995, Pages 2922-2932

  Benedetto, Sergio ^a   Mondin, Marina ^a   Garello, Roberto ^b  

^a POLITECNICO DI TORINO   (Italy)

^b Marconi Communications   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CODING ERRORS; PERFORMANCE; PHASE SHIFT KEYING; PROBABILITY; SIGNAL PROCESSING; SIGNAL THEORY;

ABELIAN QUOTIENT; CONSTELLATIONS; FREE DISTANCE; OPTIMALITY; SIMPLEX BOUND; UPPER BOUND;

TRELLIS CODES;

EID: 0029541031     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.477494     Document Type: Article

References (15)

1. G. D. Forney Jr. and M. D. Trott, “The dynamics of group codes: State spaces, trellis diagrams, and canonical encoders,” IEEE Trans. Inform. Theory, vol. IT-39, pp. 1491–1513, Sept. 1993.
2. G. D. Forney Jr., “Geometrically uniform codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 1241–1260, Sept. 1991.
3. S. Benedetto, M. Mondin, and G. Montorsi, “Performance evaluation of trellis-coded modulation schemes,” in Proc. IEEE, vol. 82, pp. 833–855, June 1994.
4. S. Benedetto, R. Garello, M. Mondin, and G. Montorsi, “Geometrically uniform partitions of L X MPSK constellations and related binary trellis codes,” IEEE Trans. Inform. Theory, vol. 39, pp 1773–1798, Nov. 1993.
5. S. Benedetto, R. Garello, M. Mondin, and G. Montorsi, “Geometrically uniform TCM codes over groups based on L X MPSK constellations,” IEEE Trans. Inform. Theory, vol. 40, pp. 137–152, Jan. 1994.
6. A. R. Calderbank, J. E. Mazo, and V. K. Wei, “Asymptotic upper bounds on the minimum distance of trellis codes,” IEEE Trans. Commun., vol. COM-33, pp. 305–309, Apr. 1985.
7. D. Divsalar, M. K. Simon, and J. H. Yuen, “Trellis coding with asymmetric modulations,” IEEE Trans. Commun., vol. COM-35, pp. 130–141, Feb. 1987.
8. M. A. Armstrong, Groups and Symmetry. New York: Springer-Verlag, 1988.
9. G. J. Pottie and D. P. Taylor, “Sphere-packing upper bounds on the free distance of trellis codes,” IEEE Trans. Inform. Theory, vol. IT-34, pp. 435–447, May 1988.
10. M. Burnashev and E. Biglieri, “Bounds on the minimum distance of treillis codes,” IEEE Trans. Inform. Theory, vol. 35, pp. 659–662, May 1989.
11. V. I. Levenstein, “On bounds for packings in n-dimenstional Euclidean space,” Sov. Math. Dokl., vol. 20, pp. 417–421, 1979.
12. S. S. Pietrobon, R. H. Deng, A. Lafanechére, G. Ungerboeck, and D. J. Costello, “Trellis-coded multidimenstional phase modulation,” IEEE Trans. Inform. Theory, vol. 36, pp. 63–89, Jan. 1990.
13. Y. Levy and D. J. Costello, Jr., “Optimum constellation design for geometrically uniform trellis codes,” IEEE Trans. Inform. Theory, to be published.
14. R. Garello and S. Benedetto, “Multilevel construction of block and trellis group codes,” IEEE Trans. Inform. Theory, to be published.
15. A. R. Calderbank, J. E. Mazo, and H. M. Shapiro, “Upper bounds on the minimyum distance of trellis codes,” Bell Syst Tech. J., vol. 62, pp. 2617–2646, Oct. 1983.