Approaching Shannon's capacity limit by 0.27 dB using Hamming codes in a 'turbo'-decoding scheme

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1997, Pages 12-

  Nickl, Helmut ^a   Hagenauer, Joachim ^a   Burkert, Frank ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; BLOCK CODES; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; MATRIX ALGEBRA; NEURAL NETWORKS;

HAMMING CODES; SHANNON CAPACITY LIMIT;

SIGNAL ENCODING;

EID: 0030658144     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1997.612927     Document Type: Conference Paper

References (3)

1. C. Berrou, A. Glavieux and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes (1): Proc. IEEE Internotionol Conference on Communication (ICC), Geneva, Switzerland, May 1993, pp. 1064-1070.
2. J. Hagenauer, E. Offer and L. Papke, "Iterative Decoding of Binary Block and Convolutional Codes," IEEE Trans. On IT, vol. 42, no.2, pp. 429-445, March 1996
3. "SYNAPSE1 N110, Software User's Guide," Siemens Nixdorf Informotionssysteme AG, April 1995.