A general formula for the mismatch capacity

Research output: Contribution to journalArticlepeer-review

Abstract

The fundamental limits of channels with mismatched decoding are addressed. A general formula is established for the mismatch capacity of a general channel, defined as a sequence of conditional distributions with a general decoding metrics sequence. We deduce an identity between the Verdú-Han general channel capacity formula, and the mismatch capacity formula applied to maximum likelihood decoding metric. Furthermore, several upper bounds on the capacity are provided, and a simpler expression for a lower bound is derived for the case of a non-negative decoding metric. The general formula is specialized to the case of finite input and output alphabet channels with a type-dependent metric. The closely related problem of threshold mismatched decoding is also studied, and a general expression for the threshold mismatch capacity is obtained. As an example of threshold mismatch capacity, we state a general expression for the erasures-only capacity of the finite input and output alphabet channel. We observe that for every channel, there exists a (matched) threshold decoder, which is capacity achieving. In addition, necessary and sufficient conditions are stated for a channel to have a strong converse.

Original languageEnglish
Article number7134788
Pages (from-to)4554-4568
Number of pages15
JournalIEEE Transactions on Information Theory
Volume61
Issue number9
DOIs
StatePublished - 1 Sep 2015

Keywords

  • Channel coding
  • mismatch capacity
  • mismatched decoding
  • threshold decoding

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'A general formula for the mismatch capacity'. Together they form a unique fingerprint.

Cite this