Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
678 IEEE COMMUNICATIONS LETTERS, VOL. 12, NO. 9, SEPTEMBER 2008 LP Decoding for Joint Source-Channel Codes and for the
 

Summary: 678 IEEE COMMUNICATIONS LETTERS, VOL. 12, NO. 9, SEPTEMBER 2008
LP Decoding for Joint Source-Channel Codes and for the
Non-Ergodic Polya Channel
Adam Cohen, Fady Alajaji, Navin Kashyap, Glen Takahara
Abstract--Linear programming (LP) decoding of low-density
parity-check codes over discrete memoryless symmetric channels
was introduced by Feldman et al. in [1]. 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 -capacity limit.
Index Terms--LP decoding, joint source-channel coding, non-
ergodic Polya channel, systematic and non-systematic codes.
I. INTRODUCTION
IN [1], Feldman et al. introduce the notion of decoding
low-density parity-check (LDPC) codes over memoryless
channels using linear programming (LP).1

  

Source: Alajaji, Fady - Department of Mathematics and Statistics, Queen's University (Kingston)

 

Collections: Engineering