Improved algorithms for high rate turbo code weight distribution calculation

10th International Conference on Telecommunications, ICT 2003

Volumn 1, Issue , 2003, Pages 104-111

  Rosnes, Eirik ^a   Ytrehus, Øyvind ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Costs; Encoding; Equations; Hamming weight; Scattering; Testing; Turbo codes; Viterbi algorithm

Indexed keywords

CODES (SYMBOLS); COSTS; ENCODING (SYMBOLS); SCATTERING; TESTING; TURBO CODES; VITERBI ALGORITHM;

ASYMPTOTIC COMPLEXITY; CODE WEIGHT; EQUATIONS; HAMMING WEIGHTS; HIGH RATE; MINIMAL INFORMATION; WEIGHT DISTRIBUTIONS;

ALGORITHMS;

EID: 11244343698     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTEL.2003.1191190     Document Type: Conference Paper

References (22)

1. L. C. Perez, J. Seghers, and D. J. Costello, Jr., "A distance spectrum interpretation of turbo codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1698-1709, Nov. 1996.
2. M. Breiling and J. Huber, "A method for determining the distance profile of turbo codes," in Proc. 3rd ITG Conf. on Source and Channel Coding, (Munich, Germany), Jan. 2000.
3. C. Berrou and S. Vaton, "Computing the minimum distances of linear codes by the error impulse method," in Proc. IEEE Int. Symp. on Inform. Theory (ISIT), (Lausanne, Switzerland), p. 5, July 2002.
4. R. Garello, P. Pierleoni, and S. Benedetto, "Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications," IEEE J. Select. Areas Commun., vol. 19, pp. 800-812, May 2001.
5. 3rd Generation Partnership Project, Multiplexing and channel coding (FDD), June 1999. 3G TS 25.212.
6. www1.tlc.polito.it/∼garello/turbodistance.html.
7. O. F. Acikel and W. E. Ryan, "Punctured turbo-codes for BPSK/QPSK channels," IEEE Trans. Commun., vol. 47, pp. 1315-1323, Sept. 1999.
8. T. Minowa and H. Imai, "Reduced-complexity iterative decoding of high-rate turbo codes," in Proc. IEEE GLOBECOM, (San Francisco, CA), pp. 193-197, Nov. 2000.
9. A. Graell i Amat, G. Montorsi, and S. Benedetto, "A new approach to the construction of high-rate convolutional codes," IEEE Commun. Lett., vol. 5, pp. 453-455, Nov. 2001.
10. S. Riedel, "Symbol-by-symbol MAP decoding algorithm for high-rate convolutional codes that use reciprocal dual codes," IEEE J. Select. Areas Commun., vol. 16, pp. 175-185, Feb. 1998.
11. S. Riedel, "MAP decoding of convolutional codes using reciprocal dual codes," IEEE Trans. Inform. Theory, vol. 44, pp. 1176-1187, May 1998.
12. G. Montorsi and S. Benedetto, "An additive version of the SISO algorithm for the dual code," in Proc. IEEE Int. Symp. on Inform. Theory (ISIT), (Washington DC, USA), p. 27, June 2001.
13. R. J. McElieca, "The algebraic theory of convolutional codes," in Handbook of Coding Theory (V. S. Pless and W. C. Huffman, eds.), ch. 12, pp. 1065-1138, North-Holland, Amsterdam: Elsevier, 1998.
14. Ø. Ytrehus "A note on high rate binary convolutional codes," Tech. Report no. 68, Department of Informatics, University of Bergen, Norway, Aug. 1992.
15. P. CharnKeitKong, H. Imai, and K. Yamaguchi, "On classes of rate k/(k+1) convolutional codes and their decoding techniques," IEEE Trans. Inform. Theory, vol. 42, pp. 2181-2193, Nov. 1996.
16. K. J. Hole, "On classes of convolutional codes that are not asymptotically catastrophic," IEEE Trans. Inform. Theory, vol. 46, pp. 663-669, Mar. 2000.
17. G. D. Forney, Jr., "Convolutional codes I: Algebraic structure," IEEE Trans. Inform. Theory, vol. IT-16, pp. 720-738, Nov. 1970.
18. V. Sidorenko and V. Zyablov, "Decoding of convolutional codes using a syndrome trellis," IEEE Trans. Inform. Theory, vol. 40, pp. 1663-1666, Sept. 1994.
19. R. McEliece and W. Lin, "The trellis complexity of convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1855-1864, Nov. 1996.
20. S. Benedetto and G. Montorsi, "Unveiling turbo codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inform. Theory, vol. 42, pp. 409-428, Mar. 1996.
21. M. Breiling, S. Peeters, and J. Huber, "Interleaver design using back-tracking and spreading methods," in Proc. IEEE Int. Symp. on Inform. Theory (ISIT), (Sorrento, Italy), p. 451, June 2000.
22. D. Divsalar, S. Dolinar, and F. Pollara, "Iterative turbo decoder analysis based on density evolution," IEEE J. Select. Areas Commun., vol. 19, pp. 891-907, May 2001.