DocumentCode
1552781
Title
Reduced-tree-based soft decoding for block-coded modulation
Author
Jadhav, A. ; Siddiqi, M.
Author_Institution
Dept. of Electr. Eng., Indian Inst. of Technol., Kanpur, India
Volume
144
Issue
2
fYear
1997
fDate
4/1/1997 12:00:00 AM
Firstpage
79
Lastpage
83
Abstract
It is shown that soft maximum-likelihood decoding for block-coded modulation (BCM) can be performed using the code tree. It is easy to generate the code tree for any type of block code, linear as well as nonlinear. A reduced tree is obtained from the code tree. The trellis for a block code can be obtained from the reduced tree. Using this structure to perform computations in parallel, a scheme is proposed for the implementation of the soft decoder. Back tracking, necessary in a soft decoder using the Viterbi algorithm on a trellis, is eliminated
Keywords
block codes; linear codes; maximum likelihood decoding; modulation coding; trees (mathematics); Viterbi algorithm; block code trellis; block-coded modulation; code tree; linear code; nonlinear code; reduced tree based soft decoding; soft maximum-likelihood decoding;
fLanguage
English
Journal_Title
Communications, IEE Proceedings-
Publisher
iet
ISSN
1350-2425
Type
jour
DOI
10.1049/ip-com:19970981
Filename
587431
Link To Document