By Topic

First-order approximation of the ordered binary-symmetric channel

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

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

Soft-decision decoding algorithms of binary linear block codes require reordering of the received symbols within each block in decreasing reliability. Efficient decoding algorithms based on reordering have been devised. This paper presents different results related to the ordering of a sequence of N received symbols with respect to their reliability measure, for BPSK transmission over the AWGN channel model. First, a tight approximation of Pe(i; N), the probability that the hard decision associated with the ith symbol of the ordered sequence is in error, is derived. Then, it is shown that despite the fact that the random variables representing the noise at positions n1, n2,...,nj of the ordering are no longer independent, the events of having a hard decision decoding error at these positions remain almost independent. Pe(n1,n2 ,...,nj; N), the probability that the hard decisions associated with the symbols at positions n1, n2,...nj in the ordered sequence are in error, is thus well approximated from each of the Pe (ni; N), for i∈[1,j]. Finally, based on the independence of these events, the fully connected 2N-state BSC representing the channel after ordering is simplified by N independent time-shared 2-state BSCss. This new model allows one to easily and tightly approximate the capacity of the channel after ordering

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 5 )