AWGN channel convolutional decoding is less complex than BSC decoding

The storage complexity of bounded distance decoding for binary-channel convolutional codes over the binary symmetric channel (BSC) is /spl ap/(2/sup 1-R/-1)/sup -t/, where up to t errors are corrected. We show that the path storage becomes /spl ap/2/sup 2Rt/ 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.