Capacity and decoding rules for the Poisson arbitrarily varying channel

Author

Bross, Shraga I. ; Shamai, Shlomo

Author_Institution

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

Volume

49

Issue

11

fYear

2003

Firstpage

3076

Lastpage

3093

Abstract

The single-user and two-user (multiple-access) Poisson arbitrarily varying channel (AVC) with input and state (peak and average power) constraints, but unlimited in bandwidth, are considered. For both cases, the deterministic and random code capacity with the average probability of error criterion is obtained. In the single-user case, A.D. Wyner\´s decoder (see ibid., vol.34, p.1449-61, 1988) attains the deterministic-code capacity whereas for the two-user case, a "nearest neighbor" decoder that belongs to the class of β-decoders introduced by I. Csiszar and J. Korner (see Proc. 3rd Czechoslovak-Soviet-Hungarian Seminar on Information Theory, p.25-44, 1980) is shown to attain the deterministic-code capacity region as claimed.

Keywords

channel capacity; decoding; error statistics; multi-access systems; random codes; stochastic processes; time-varying channels; Poisson channel; arbitrarily varying channel; average error probability; communication scenario; deterministic code capacity; input constraints; multiple-access channel; nearest neighbor decoder; power constraints; random code capacity; state constraints; time varying channel; unlimited bandwidth; Automatic voltage control; Bandwidth; Capacity planning; Decoding; Geometrical optics; Notice of Violation; Upper bound;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2003.818385

Filename

1246035