By Topic

On the complexity of bounded distance decoding for the AWGN channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Anderson, J.B. ; Inf. Technol. Dept., Lund Univ., Sweden

Earlier work has derived the storage complexity of the bounded distance decoder (BDD) for binary channel convolutional codes. We extend this work to the Gaussian noise channel and to partial-response codes. We show that the storage requirement ~(21-R - 1)-t paths for rate-R convolutional codes over the binary channel becomes ~2 2Rt over the Gaussian channel, where the decoder must correct t errors. Thus, convolutional coding over the Gaussian channel is not only 3 dB more energy efficient, but its decoding is simpler as well. Next, we estimate the path storage for partial-response codes, i.e., real-number convolutional codes, over the Gaussian channel. The growth rate depends primarily on the bandwidth of the code. A new optimization procedure is devised to measure the maximum storage requirement in Gaussian noise for these two code types. An analysis based on difference equations predicts the asymptotic storage growth for partial response codes

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 5 )