Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Linear Programming Decoding for Non-Uniform Sources and for Binary Channels With Memory
 

Summary: Linear Programming Decoding for Non-Uniform
Sources and for Binary Channels With Memory
by
Adam Cohen
A thesis submitted to the
Department of Mathematics and Statistics
in conformity with the requirements for
the degree of Master of Science (Engineering)
Queen's University
Kingston, Ontario, Canada
December 2008
Copyright c Adam Cohen, 2008
Abstract
Linear programming (LP) decoding of low-density parity-check codes was intro-
duced by Feldman et al. in [1]. In his formulation it is assumed that communication
takes place over a memoryless channel and that the source is uniform. Here, we extend
the LP decoding paradigm by studying its application to scenarios with source non-
uniformity and to decoding over channels with memory. We develop two decoders for
the scenario of non-uniform memoryless sources transmitted over memoryless chan-
nels. The first decoder uses a modified linear cost function which incorporates the

  

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

 

Collections: Engineering