Iterative maximum-likelihood trellis decoding for block codes

An iterative trellis search technique is described for the maximum-likelihood (ML) soft decision decoding of block codes. The proposed technique derives its motivation from the fact that a given block code may be a subcode for a parent code whose associated trellis has substantially fewer edges. Thr...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 1999-03, Vol.47 (3), p.338-342
Main Authors: Luna, A.A., Fontaine, F.M., Wicker, S.B.
Format: Article
Language:English
Subjects:
Block codes
Complexity
Decision analysis
Decoding
Fading
Impedance
Iterative algorithms
Iterative decoding
Maximum likelihood decoding
Paging strategies
Parents
Performance analysis
Reduction
Searching
Soft decision decoding
Testing
Viterbi algorithm
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An iterative trellis search technique is described for the maximum-likelihood (ML) soft decision decoding of block codes. The proposed technique derives its motivation from the fact that a given block code may be a subcode for a parent code whose associated trellis has substantially fewer edges. Through the use of list-Viterbi (1967) decoding and an iterative algorithm, the proposed technique allows for the use of a trellis for the parent code in the ML decoding of the desired subcode. Complexity and performance analyses, as well as details of potential implementations, indicate a substantial reduction in decoding complexity for linear block codes of practical length while achieving ML or near-ML soft decision performance.
ISSN:0090-6778
1558-0857
DOI:10.1109/26.752810