Optimal detection of discrete Markov sources over discrete memoryless channels. Applications to combined source-channel coding

Nam Phamdo, Nariman Farvardin

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

4 Scopus citations

Abstract

It is hypothesized that the source is in the form of a discrete Markov chain and that the channel is a discrete memoryless channel. The receiver is a maximum a posteriori (MAP) receiver (detector). The redundancy between successive symbols of the Markov source is used by the MAP detector to provide some protection against channel errors. In this paper, the authors consider two variations of a given problem: (i) sequence MAP detection which is to determine the most probable transmitted sequence given an observed sequence and (ii) instantaneous MAP detection which is to determine the most probable transmitted symbol at a particular time given all the observations up to that time.

Original languageEnglish
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory
Pages425
Number of pages1
StatePublished - 1993
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: 17 Jan 199322 Jan 1993

Publication series

NameProceedings of the 1993 IEEE International Symposium on Information Theory

Conference

ConferenceProceedings of the 1993 IEEE International Symposium on Information Theory
CitySan Antonio, TX, USA
Period17/01/9322/01/93

Fingerprint

Dive into the research topics of 'Optimal detection of discrete Markov sources over discrete memoryless channels. Applications to combined source-channel coding'. Together they form a unique fingerprint.

Cite this