By Topic

Bit-error probability for maximum-likelihood decoding of linear block codes and related soft-decision decoding methods

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)
Fossorier, M.P.C. ; Dept. of Electr. Eng., Hawaii Univ., Honolulu, HI, USA ; Shu Lin ; DoJun Rhee

In this correspondence, the bit-error probability Pb for maximum-likelihood decoding of binary linear block codes is investigated. The contribution Pb(j) of each information bit j to Pb is considered and an upper bound on Pb(j) is derived. For randomly generated codes, it is shown that the conventional approximation at high SNR Pb≈(dH/N).Ps, where Ps represents the block error probability, holds for systematic encoding only. Also systematic encoding provides the minimum Pb when the inverse mapping corresponding to the generator matrix of the code is used to retrieve the information sequence. The bit-error performances corresponding to other generator matrix forms are also evaluated. Although derived for codes with a generator matrix randomly generated, these results are shown to provide good approximations for codes used in practice. Finally, for soft-decision decoding methods which require a generator matrix with a particular structure such as trellis decoding, multistage decoding, or algebraic-based soft-decision decoding, equivalent schemes that reduce the bit-error probability are discussed. Although the gains achieved at practical bit-error rates are only a fraction of a decibel, they remain meaningful as they are of the same orders as the error performance differences between optimum and suboptimum decodings. Most importantly, these gains are free as they are achieved with no or little additional circuitry which is transparent to the conventional implementation

Published in:

Information Theory, IEEE Transactions on  (Volume:44 ,  Issue: 7 )