Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

On the Pairwise Error Probability of Linear Programming Decoding on Independent Rayleigh Flat-Fading Channels

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

1 Author(s)
Rosnes, E. ; Dept. of Inf., Univ. of Bergen, Bergen

In this paper, we consider the pairwise error probability (PEP) of a linear programming (LP) decoder for a general binary linear code as formulated by Feldman et al. (IEEE Trans. Inf. Theory, Mar. 2005) on an independent (or memoryless) Rayleigh flat-fading channel with coherent detection and perfect channel state information (CSI) at the receiver. Let H be a parity-check matrix of a binary linear code and consider LP decoding based on H. The output of the LP decoder is always a pseudocode-word. We will show that the PEP of decoding to a pseudocodeword w when the all-zero codeword is transmitted on the above-mentioned channel, behaves asymptotically as K(omega) ldr (Es/N0)-|chi(omega)|, where chi(omega) is the support set of omega, i.e., the set of nonzero coordinates, Es/N0 is the average signal-to-noise ratio (SNR), and K(omega) is a constant independent of the SNR. Note that the support set chi(omega) of omega is a stopping set. Thus, the asymptotic decay rate of the error probability with the average SNR is determined by the size of the smallest nonempty stopping set in the Tanner graph of H. As an example, we analyze the well-known (155,64) Tanner code and present performance curves on the independent Rayleigh flat-fading channel.

Published in:

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