DocumentCode :
3279755
Title :
Suboptimal SISO decoding of systematic binary algebraic block codes
Author :
Tee, James S K ; Taylor, Desmond P.
Author_Institution :
Technol. Dev., Vodafone New Zealnd Ltd., Auckland, New Zealand
fYear :
2001
fDate :
2001
Firstpage :
332
Abstract :
In a previous paper (see Proc. IEEE GLOBECOM Conference, vol.2, p.842-6, Nov. 2000) we applied the MAP-SPC decoding technique to the decoding of short Hamming codes. In this paper, further results are presented for longer Hamming codes. This technique achieves performance gains of approximately 1 dB and 7 dB over hard algebraic decoding in the AWGN and fading channel respectively. Although this decoding strategy is suboptimal compared to ML soft decision decoding, its complexity is relatively low and grows linearly with increasing block length. In addition, the decoder is simple to implement
Keywords :
AWGN channels; Hamming codes; algebraic codes; binary codes; block codes; fading channels; iterative decoding; AWGN channel; Hamming codes; MAP-SPC decoding technique; block length; complexity; fading channel; suboptimal SISO decoding; systematic binary algebraic block codes; AWGN; Block codes; Computational complexity; Convolutional codes; Fading; Iterative decoding; Maximum likelihood decoding; Parity check codes; Performance gain; USA Councils;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
Type :
conf
DOI :
10.1109/ISIT.2001.936195
Filename :
936195
Link To Document :
بازگشت