By Topic

Soft-input soft-output decoding of linear block codes based on ordered statistics

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
$33 $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

2 Author(s)
M. P. C. Fossorier ; Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA ; Shu Lin

In this paper, reduced-complexity soft-input soft-output decoding of linear block codes is considered. The near-optimum low complexity soft decision decoding algorithm based on ordered statistics of Fossorier and Lin (1995) is modified so that soft outputs are delivered by the decoder. This algorithm performs nearly as well as the max-log-MAP decoding algorithm since in most cases, only the soft outputs corresponding to the least reliable bits may differ. For good (N,K,dH) block codes of length N⩽128, dimension K and minimum Hamming distance dH⩽4K, the corresponding decoding complexity is O((N-K)(K+1)n(dH,K)) real operations with n(d H,K)=Σi=0([dH/4])(i K). Consequently, this algorithm allows to achieve practically the same error performance as the max-log-MAP decoding algorithm in iterative or concatenated systems with block codes for which the associated trellis complexity is simply too large for implementation of trellis based decoding algorithms

Published in:

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

Date of Conference:

1998