Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
DECODING LDPC CODES OVER BINARY CHANNELS WITH ADDITIVE MARKOV NOISE
 

Summary: DECODING LDPC CODES OVER BINARY CHANNELS
WITH ADDITIVE MARKOV NOISE
Chris Nicola, Fady Alajaji and Tamás Linder
Department of Mathematics and Statistics
Queen's University, Kingston, ON K7L 3N6, Canada
{nicola, fady, linder}@mast.queensu.ca
ABSTRACT
We study the design of a belief propagation decoder for low­
density parity check (LDPC) codes over binary channels with
additive M th ­order Markov noise, specifically the queue­
based channel (QBC) [1]. The decoder is an extension of
the sum product algorithm (SPA) for the case of memoryless
channels and is similar to the one developed for the Gilbert­
Elliot channel [2, 3, 4]. Simulation results of randomly gener­
ated LDPC codes over the QBC show a significant improve­
ment over the standard decoding method for the ``equiva­
lent memoryless'' channel (resulting from ideal interleaving).
We also compare with the decoding method for the GEC for
cases where the QBC and GEC are statistically close.
1. INTRODUCTION

  

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

 

Collections: Engineering