Universal decoding for memoryless Gaussian channels with a deterministic interference

Author

Merhav, Neri

Author_Institution

Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel

Volume

39

Issue

4

fYear

1993

fDate

7/1/1993 12:00:00 AM

Firstpage

1261

Lastpage

1269

Abstract

A universal decoding procedure is proposed for memoryless Gaussian channels with deterministic interfering signals from a certain class. The proposed decoder is universal in the sense that it is independent of the channel parameters and the unknown interfering signal, and, at the same time, attains the same random coding error exponent as the optimal maximum likelihood (ML) decoder, which utilizes full knowledge of the channel parameters and the interfering signal. The proposed decoding rule can be regarded as a continuous-alphabet version of the universal maximum mutual information decoder

Keywords

coding errors; decoding; interference (signal); telecommunication channels; channel parameters; continuous-alphabet version; deterministic interference; interfering signals; memoryless Gaussian channels; random coding error exponent; universal decoding; universal maximum mutual information decoder; Block codes; Channel capacity; Entropy; Gaussian channels; Intersymbol interference; Maximum likelihood decoding; Maximum likelihood estimation; Memoryless systems; Mutual information; Statistics;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.243443

Filename

243443