DocumentCode
1359086
Title
Simplified trellis decoder
Author
Parizhsky, Vladimir ; Walsh, Dale M.
Author_Institution
Personal Commun. Div., US Robotics Inc., Skokie, IL, USA
Volume
44
Issue
8
fYear
1996
fDate
8/1/1996 12:00:00 AM
Firstpage
909
Lastpage
912
Abstract
A new simplified trellis decoder (STD) Viterbi-type algorithm is proposed for fast trellis decoding of rate K/K+1 binary convolutional codes. Viterbi algorithm (VA) computation is dominated by add-compare-select (ACS) operations when k⩾2. The STD can substantially reduce the number of ACS operations and allow for a trade-off between the computational load and the performance of the decoder, The STD is analyzed and simulated for a four-dimensional (4-D) rate 4/5 64-state convolutional encoder specified by the ITU-T V.34 modem recommendation
Keywords
Viterbi decoding; convolutional codes; trellis coded modulation; ITU-T V.34 modem recommendation; Viterbi-type algorithm; add-compare-select operations; binary convolutional codes; fast trellis decoding; four-dimensional rate 4/5 64-state convolutional encoder; simplified trellis decoder; trellis codes; Analytical models; Communications Society; Computational modeling; Convolution; Convolutional codes; Decoding; Euclidean distance; Modems; Two dimensional displays; Viterbi algorithm;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/26.535428
Filename
535428
Link To Document