Abstract
In this work, 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. Inform. 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 pseudo-codeword. We will show that the PEP of decoding to a pseudo-codeword omega when the all-zero codeword is transmitted on an independent Rayleigh flat-fading channel with coherent detection and perfect CSI at the receiver, behaves asymptotically as K(omega)ldr(Es/NO)-chi(omega), where chi(omega) is the support set of omega, i.e., the set of non-zero coordinates, Es/NO is the average signal-to-noise ratio (SNR), and K(omega) is a constant independent of the SNR. Thus, the asymptotic decay rate of the error probability with the average SNR is determined by the size of the smallest non-empty stopping set in the Tanner graph of H.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
