On identification capacity of infinite alphabets or continuous-time channels

Author

Burnashev, Marat V.

Author_Institution

Inst. of Inf. Transmission Problems, Acad. of Sci., Moscow, Russia

Volume

46

Issue

7

fYear

2000

fDate

11/1/2000 12:00:00 AM

Firstpage

2407

Lastpage

2414

Abstract

Two kinds of channels are considered: (1) discrete-time channel with additive noise, and (2) Poisson and white Gaussian (i.e., continuous-time) channels. For the type (1) channel there are given some sufficient conditions when the Shannon and identification capacities coincide. It is shown that the identification capacity of Poisson and Gaussian channels without bandwidth constraint is infinite. Conversely, for a white Gaussian channel with bandwidth constraint, the identification capacity coincides with the Shannon capacity

Keywords

AWGN channels; channel capacity; continuous time systems; discrete time systems; identification; stochastic processes; Poisson channel; Shannon capacity; additive noise; bandwidth constraint; continuous-time channel; continuous-time channels; discrete-time channel; identification capacity; infinite alphabets; sufficient conditions; white Gaussian noise channel; Additive noise; Bandwidth; Codes; Density measurement; Gaussian channels; Memoryless systems; Noise measurement; Random variables; Signal generators; Sufficient conditions;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.887853

Filename

887853