DocumentCode
2268942
Title
Generalised minimum distance decoding of Reed-Muller codes and Barnes-Wall lattices
Author
Wang, Chun ; Shen, Bazhong ; Tzeng, K.K.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Lehigh Univ., Bethlehem, PA, USA
fYear
1995
fDate
17-22 Sep 1995
Firstpage
186
Abstract
Low complexity soft decision decoding algorithms for Reed-Muller codes and Barnes-Wall lattices are presented. These algorithms are constructed based on the usage of generalised minimum distance (GMD) decoding recursively. Evaluation of the algorithms on AWGN channel through computer simulation indicates a slight degradation in performance, compared to maximum likelihood decoding, but with considerable reduction in complexity
Keywords
Gaussian channels; Reed-Muller codes; decoding; AWGN channel; Barnes-Wall lattices; Reed-Muller codes; complexity reduction; computer simulation; generalised minimum distance decoding; low complexity soft decision decoding algorithms; maximum likelihood decoding; performance degradation; AWGN channels; Application software; Bit error rate; Computer simulation; Concatenated codes; Degradation; Lattices; Logic; Maximum likelihood decoding; Modulation coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.531535
Filename
531535
Link To Document