By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ye Liu ; Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA ; Fossorier, M. ; Shu Lin

The MAP algorithm is a trellis-based maximum a posteriori probability decoding algorithm. It is the heart of the turbo decoding or iterative decoding which can achieve an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furthermore, its forward and backward recursions cause long decoding delay. For practical applications, this decoding algorithm must be simplified and its decoding complexity and delay must be reduced. In this paper, the MAP and max-log-MAP algorithms are first applied to sectionalized trellises for linear block codes. Using the structural properties of properly sectionalized trellises, the decoding complexity and delay of the MAP algorithms can be reduced. Also presented in this paper are bi-directional and parallel MAP decoding

Published in:

Global Telecommunications Conference, 1998. GLOBECOM 1998. The Bridge to Global Integration. IEEE  (Volume:1 )

Date of Conference:

1998