MAP detection of binary sources over discrete Markov channels

Fady Alajaji, Nam Phamdo, Nariman Farvardin, Tom Fuja

Research output: Contribution to conferencePaperpeer-review

2 Scopus citations

Abstract

We consider a binary source with an inherent redundancy that we make no attempt to eliminate. The source is directly transmitted over a discrete noisy channel. Our objective is therefore to design an optimum receiver which fully uses the source redundancy in order to combat the impairments introduced by the channel noise. We first investigate the problem of detecting a binary iid non-uniform source transmitted across the contagion Markov channel of order one (M = 1). We then analyze the same detection problem with the variation that the source is a binary symmetric Markov source. Finally, we generalize the detection problem for the case a binary non-symmetric Markov source.

Original languageEnglish
StatePublished - 1994
EventProceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw
Duration: 27 Jun 19941 Jul 1994

Conference

ConferenceProceedings of the 1994 IEEE International Symposium on Information Theory
CityTrodheim, Norw
Period27/06/941/07/94

Fingerprint

Dive into the research topics of 'MAP detection of binary sources over discrete Markov channels'. Together they form a unique fingerprint.

Cite this