Title :
AWGN channel convolutional decoding is less complex than BSC decoding
Author :
Anderson, John B.
Author_Institution :
Dept. of Inf. Technol., Lund Univ., Sweden
Abstract :
The storage complexity of bounded distance decoding for binary-channel convolutional codes over the binary symmetric channel (BSC) is ≈(21-R-1)-t, where up to t errors are corrected. We show that the path storage becomes ≈22Rt over the AWGN channel, which is significantly lower. Thus Gaussian convolutional coding is not only 3 dB more energy efficient, but its decoding is simpler as well
Keywords :
AWGN channels; channel coding; computational complexity; convolutional codes; decoding; error correction codes; AWGN channel; BSC decoding; Gaussian convolutional coding; binary symmetric channel; binary-channel convolutional codes; bounded distance decoding; convolutional decoding; error correction; storage complexity; AWGN channels; Additive white noise; Binary decision diagrams; Computer errors; Convolutional codes; Decoding; Error correction codes; Euclidean distance; Hypercubes; Information technology;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866698
