Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit

Author

Ganti, Anand ; Lapidoth, Amos ; Telatar, I. Emre

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA

Volume

46

Issue

7

fYear

2000

fDate

11/1/2000 12:00:00 AM

Firstpage

2315

Lastpage

2328

Abstract

The mismatch capacity of a channel is the highest rate at which reliable communication is possible over the channel with a given (possibly suboptimal) decoding rule. This quantity has been studied extensively for single-letter decoding rules over discrete memoryless channels (DMCs). Here we extend the study to memoryless channels with general alphabets and to channels with memory with possibly non-single-letter decoding rules. We also study the wide-band limit, and, in particular, the mismatch capacity per unit cost, and the achievable rates on an additive-noise spread-spectrum system with single-letter decoding and binary signaling

Keywords

channel capacity; decoding; memoryless systems; noise; spread spectrum communication; telecommunication signalling; achievable rates; additive-noise spread-spectrum system; binary signaling; discrete memoryless channels; general alphabets; mismatch capacity per unit cost; mismatch channel capacity; mismatched decoding; nonsingle-letter decoding rules; reliable communication; single-letter decoding rules; suboptimal decoding rule; wide-band limit; Channel capacity; Costs; Materials science and technology; Maximum likelihood decoding; Memoryless systems; Monte Carlo methods; Nearest neighbor searches; Performance evaluation; Spread spectrum communication; Wideband;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.887846

Filename

887846