LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel
Cohen, A.
Alajaji, F.
Kashyap, N.
Takahara, G.
Dept. of Math. & Stat., Queen's Univ., Kingston, ON;
This paper appears in: Communications Letters, IEEE
Publication Date: September 2008
Volume: 12,
Issue: 9
On page(s): 678-680
ISSN: 1089-7798
INSPEC Accession Number: 10208069
Digital Object Identifier: 10.1109/LCOMM.2008.080713
Current Version Published: 2008-09-12
Abstract
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
