Skip to main navigation Skip to search Skip to main content

Bayesian sequential detection for the BSC with unknown crossover probability

  • George Mason University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We propose a novel scheme for detecting coded data transmitted over a communication channel that is either partially or entirely unknown. Viewing the unknown channel parameters as stochastic quantities drawn from a known probability distribution, the likelihood of a sequence of data is derived using Bayesian techniques. A stack-like tree search algorithm is proposed for implementation of maximum likelihood (ML) sequence detection under the Bayesian metric. We apply the Bayesian scheme to the binary symmetric channel (BSC) with unknown crossover probability. The structure of the resulting metric is compared to both the conventional Fano metric and a universal metric presented in (Lapidoth and Ziv, IEEE Trans. IT 1999). Based on its relationship to the metric developed by Lapidoth and Ziv, the newly-derived metric is shown to be pairwise universal over the ensemble of random uniform codes.

Original languageEnglish
Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages640-644
Number of pages5
DOIs
StatePublished - 2006
Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
Duration: Jul 9 2006Jul 14 2006

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/TerritoryUnited States
CitySeattle, WA
Period07/9/0607/14/06

Fingerprint

Dive into the research topics of 'Bayesian sequential detection for the BSC with unknown crossover probability'. Together they form a unique fingerprint.

Cite this