DocumentCode :
934422
Title :
Reduced-search soft-decision trellis coding of linear block codes (Corresp.)
Author :
Matis, K.R. ; Modestino, James W.
Volume :
28
Issue :
2
fYear :
1982
fDate :
3/1/1982 12:00:00 AM
Firstpage :
349
Lastpage :
355
Abstract :
Algorithms for the soft-decision decoding of linear block codes are presented. These algorithms perform a reduced complexity search through a trellis derived from the parity check matrix of an 
linear block code. The computational complexity of the algorithms is considerably reduced from that of a full maximum-likelihood algorithm. We demonstrate the trade-off between complexity and efficiency of the algorithms through computer simulation.
linear block code. The computational complexity of the algorithms is considerably reduced from that of a full maximum-likelihood algorithm. We demonstrate the trade-off between complexity and efficiency of the algorithms through computer simulation.Keywords :
Trellis coding; Block codes; Decoding; Entropy; Information theory; Random variables; Tagging;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1982.1056468
Filename :
1056468
Link To Document :
