Performance analysis of turbo-SPC codes

IEEE Transactions on Information Theory

Volumn 50, Issue 10, 2004, Pages 2490-2494

  Wu, Keying ^a   Ping, Li ^a   Huang, Xiaoling ^b   Phamdo, Nam ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b STONY BROOK UNIVERSITY   (United States)

^c JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIT ERROR RATE; COMPUTER SIMULATION; CONVOLUTIONAL CODES; DECODING; FUNCTIONS; TRELLIS CODES;

FREE DISTANCE; PARALLEL CONCATENATED CODES; SINGLE PARITY CHECK (SPC) CODES; UNION BOUND; WEIGHT DISTRIBUTION FUNCTION;

TURBO CODES;

EID: 5144231244     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.834850     Document Type: Article

References (14)

1. C. Berrou and A. Glavieux, "Near Shannon limit error correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, Oct. 1996.
2. L. Ping, "Turbo-SPC codes," IEEE Trans. Commun., vol. 49, pp. 754-759, May 2001.
3. 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.
4. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Analysis, design, and iterative decoding of double serially concatenated codes with interleavers," IEEE J. Select. Areas Commun., vol. 16, pp. 231-244, Feb. 1998.
5. A. G. Burr and G. P. White, "Comparison of iterative decoder performance with union bounds for short frame turbo codes," Ann. Telecommun., vol. 54, no. 3-4, pp. 201-207, Mar.-Apr. 1999.
6. E. Telatar and R. Urbanke, "On the ensemble performance of turbo codes," in Proc. IEEE int. Symp. Information Theory (ISIT'97), Ulm, Germany, June 1997, p. 105.
7. G. Poltyrev, "Bounds on the decoding error probability of binary linear codes via their spectra," IEEE Trans. Inform. Theory, vol. 40, pp. 1284-1292, July 1994.
8. I. Sason and S. Shamai (Shitz), "Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum," IEEE Trans. Inform. Theory, vol. 46, pp. 24-47, Jan. 2000.
9. I. Sason, and S. Shamai (Shitz), "Bounds on the error probability of ML decoding for block and turbo-block codes," Ann. Telecommun., vol. 54, no. 3-4, pp. 183-201, Mar.-Apr. 1999.
10. L. Ping and K. Y. Wu, "Concatenated tree codes: A low complexity, high performance approach," IEEE Trans. Inform. Theory, vol. 47, pp. 791-799, Feb. 2001.
11. A. J. Viterbi, A. M. Viterbi, J. Nicolas, and N. T. Sindhushayana, "Perspectives on interleaved concatenated codes with iterative soft output decoding," in Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, Sept. 3-5, 1997, pp. 47-54.
12. S. Benedetto, R. Garello, and G. Montorsi, "A search for good convolutional codes to be used in the construction of turbo codes," IEEE Trans. Commun., vol. 46, pp. 1101-1105, Sept. 1998.
13. 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.
14. X. L. Huang, N. Phamdo, and L. Ping, "BER bounds on parallel concatenated single parity check arrays and zigzag codes," in Proc. GLOBECOM'99, Rio de Janeiro, Brazil, Dec. 1999, pp. 2436-2440.