An Algorithm For Computing the Distance Spectrum of Trellis Codes

IEEE Journal on Selected Areas in Communications

Volumn 7, Issue 6, 1989, Pages 929-940

  Rouanne, Marc ^a   Costello, Daniel J ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL COMMUNICATION SYSTEMS; PROBABILITY; SPECTRUM ANALYSIS;

BIDIRECTIONAL STACK ALGORITHM; LINEAR CODES; QUASIREGULAR CODES; TRELLIS CODED MODULATION; TRELLIS CODES DISTANCE SPECTRUM;

CODES, SYMBOLIC;

EID: 0024719046     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.29615     Document Type: Article

References (20)

1. L.R. Bahl and F. Jelinek, “Rate 1/2 convolutional codes with complementary generators,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 718–727, Nov. 1971.
2. S. Benedetto, M. Ajmone Marsan, G. Albertengo, and E. Giachin, “Combined coding and modulation: Theory and applications,” IEEE Trans. Inform. Theory, vol. 34, pp. 223–236, Mar. 1988.
3. E. Biglieri, “High-level modulation and coding for nonlinear satellite channels,” IEEE Trans. Commun., vol. COM-32, pp. 616–626, May 1984.
4. A.R. Calderbank and N.J.A. Sloane, “New trellis codes,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 177–195, Mar. 1987.
5. M. Cedervall and R. Johannesson, “A fast algorithm for computing distance spectrum of convolutional codes,” IEEE Trans. Inform. Theory, to be published.
6. P.R. Chevillat, “Fast sequential decoding and a new complete decoding algorithm,” Ph.D. dissertation, Dep. Elec. Eng., Illinois Inst. Technol., Chicago, IL, 1976.
7. G.D. Forney, Jr., “Coset codes I: Geometry and classification,” IEEE Trans. Inform. Theory, vol. 34, Sept. 1988.
8. G.D. Forney, Jr., R.G. Gallager, G.R. Lang, F.M. Longstaff, and S.U. Qureshi, “Efficient modulation for band-limited channels,” IEEE J. Select. Areas Commun., vol. SAC-2, pp. 632–647, Sept. 1984.
9. D. Haccoun and P. Montreuil, “Algorithms for the spectrum determination of convolutional codes,” IEEE Int. Symp. Inform. Theory, Kobe, Japan, June 1988.
10. H. Imai and S. Hirakawa, “A new multilevel coding method using error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 371–377, May 1977.
11. K.J. Larsen, “Comments on ‘An efficient algorithm for computing free distance’,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 577–579, July 1973.
12. S. Lin and D.J. Costello, Jr., Error Control Coding. Englewood Cliffs, NJ: Prentice-Hall, 1983.
13. M. Rouanne, “Distance bounds and construction algorithms for trellis codes,” Ph.D. dissertation, Dep. Elec. Eng., Univ. Notre Dame, Notre Dame, IN, 1988.
14. M. Rouanne, “On the regularity of bandwidth efficient trellis codes,” IEEE Trans. Inform. Theory, to be published.
15. J.M. Tennant and N. Kingsbury, “Use of the Viterbi algorithm to compute error events of trellis phase coding in order of increasing distance,” IEEE Trans. Commun., vol. 36, pp. 1166–1170, Oct. 1988.
16. G. Ungerboeck, “Channel coding with multilevel phase signals,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 55–67, Jan. 1982.
17. G. Ungerboeck, “Trellis coded modulation with redundant signal sets-Part I: introduction and part II: State of the art,” IEEE Commun. Mag., vol. 25, pp. 5–21, Feb. 1987.
18. A.J. Viterbi and J.K. Omura, Principles of Digital Communications and Coding. New York: McGraw-Hill, 1979.
19. L.F. Wei, “Trellis-coded modulation with multidimensional constellations,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 483–501, July 1987.
20. E. Zehavi and J.K. Wolf, “On the performance evaluation of trellis codes,” IEEE Trans. Inform. Theory., vol. IT-33, pp. 196–202, Mar. 1987.