论文信息 - A comparison of bounds on the capacity of a binary channel

A comparison of bounds on the capacity of a binary channel

This article considers the analysis of the capacity of a discrete-input continuous-output Gaussian channel. A lower bound on the information rate is obtained and compared with previous results in the literature. The bound is shown to be very tight and amenable for computation in place of the actual formula for the system capacity, which involves a time consuming numerical integration.

M.S. Alencar

[1] R. Gallager. Information Theory and Reliable Communication , 1968 .

[2] Ian F. Blake,et al. The capacity for a discrete-state code division multiple-access channel , 1994, IEEE J. Sel. Areas Commun..

[3] D. F. Hays,et al. Table of Integrals, Series, and Products , 1966 .

[4] Aaron D. Wyner,et al. On the capacity of the Gaussian channel with a finite number of input levels , 1990, IEEE Trans. Inf. Theory.

[5] Shlomo Shamai,et al. Information rates for a discrete-time Gaussian channel with intersymbol interference and stationary inputs , 1991, IEEE Trans. Inf. Theory.

[6] I. S. Gradshteyn,et al. Table of Integrals, Series, and Products , 1976 .

[7] James L. Massey,et al. Optimum sequence multisets for synchronous code-division multiple-access channels , 1994, IEEE Trans. Inf. Theory.

[8] Andrew J. Viterbi,et al. Principles of Digital Communication and Coding , 1979 .