MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams.

The maximum a posterioriprobability (MAP) algorithm is a trellis-based MAP decoding algorithm. It is the heart of turbo (or iterative) decoding that achieves an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furth...

תיאור מלא

מידע ביבליוגרפי
הוצא לאור ב:	IEEE Transactions on communications 48, 4 (2000).
מחבר ראשי:	Ye Liu
פורמט:	Article
שפה:	English
נושאים:	Shannon limit. Backward recursions. Bidirectional MAP decoding. Decoding algorithm. Decoding complexity reduction. Decoding delay reduction. Error performance. Forward recursions. Linear block codes decoding. Log-MAP algorithm. Max-log-MAP algorithm. Maximum a posteriori probability. Parallel MAP decoding. Sectionalized trellis diagrams. Structural properties. Trellis-based MAP decoding algorithm. Turbo iterative decoding. Two-stage decoding.