Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 8, AUGUST 2007 2815 A Binary Communication Channel With Memory
 

Summary: IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 8, AUGUST 2007 2815
A Binary Communication Channel With Memory
Based on a Finite Queue
Libo Zhong, Fady Alajaji, Senior Member, IEEE, and Glen Takahara, Member, IEEE
Abstract--A model for a binary additive noise communication
channel with memory is introduced. The channel noise process,
which is generated according to a ball sampling mechanism
involving a queue of finite length M, is a stationary ergodic
Mth-order Markov source. The channel properties are analyzed
and several of its statistical and information-theoretical quanti-
ties (e.g., block transition distribution, autocorrelation function
(ACF), capacity, and error exponent) are derived in either closed
or easily computable form in terms of its four parameters. The
capacity of the queue-based channel (QBC) is also analytically
and numerically compared for a variety of channel conditions
with the capacity of other binary models, such as the well-known
Gilbert­Elliott channel (GEC), the Fritchman channel, and the
finite-memory contagion channel. We also investigate the modeling
of the traditional GEC using this QBC model. The QBC parame-
ters are estimated by minimizing the Kullback­Leibler divergence

  

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

 

Collections: Engineering