By Topic

LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya 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
$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

4 Author(s)
Adam Cohen ; Dept. of Math. & Stat., Queen's Univ., Kingston, ON ; Fady Alajaji ; Navin Kashyap ; Glen Takahara

Linear programming (LP) decoding of low-density parity-check codes over discrete memoryless symmetric channels was introduced by Feldman et al. Here, we extend the LP decoding paradigm by applying it to two additional scenarios: joint source-channel (JSC) coding and decoding over the infinite-memory non-ergodic binary Polya-contagion channel. Simulation results indicate that the JSC LP decoder yields significant gains over the standard LP decoder for non-uniform sources. Simulations also show that the LP decoder for the Polya channel performs moderately well in relation to the epsiv-capacity limit.

Published in:

IEEE Communications Letters  (Volume:12 ,  Issue: 9 )