Title :
On the performance of recursive decoding schemes
Author :
Soljanin, Emina ; Urbanke, Rüdiger
Author_Institution :
Lucent Technl., AT&T Bell Labs., Murray Hill, NJ, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
We analyse the loss in performance incurred by the suboptimum turbo decoder versus the maximum likelihood decoder for the case of several block codes. Simulation results show that, for random systematic linear block codes, a recursive suboptimum decoding scheme typically results in only a small loss in performance. On the other hand, for highly structured codes such as Hamming codes or the (24, 12) Golay code, the performance loss is much more severe
Keywords :
Golay codes; Hamming codes; block codes; linear codes; maximum likelihood decoding; random processes; recursive functions; (24, 12) Golay code; Hamming codes; block codes; highly structured codes; maximum likelihood decoder; performance; random systematic linear block codes; recursive decoding schemes; simulation; suboptimum turbo decoder; Block codes; Communication system control; Maximum likelihood decoding; Partitioning algorithms; Performance analysis; Performance loss; Turbo codes;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.612924
