Information rates for a discrete-time Gaussian channel with intersymbol interference and stationary inputs

Bounds are presented on I/sub i.i.d./-the achievable information rate for a discrete Gaussian Channel with intersymbol interference (ISI) present and i.i.d. channel input symbols governed by an arbitrary predetermined distribution p/sub x/(x). The lower and upper bounds on I/sub i.i.d./ and I are formulated. The bounds on I/sub i.i.d./ are calculated for independent equiprobably binary channel symbols and for causal channels with ISI memory of degree one and two. The bounds on I/sub i.i.d./ are compared to the approximated (by Monte Carlo methods) known value of I/sub i.i.d./ and their tightness is considered. An application of the new lower bound on I/sub i.i.d./ yields an improvement on previously reported lower bounds for the capacity of the continuous-time strictly bandlimited (or bandpass) Gaussian channel with either peak or simultaneously peak power and bandlimiting constraints imposed on the channel's input waveform. >

[1]  I. M. Jacobs,et al.  Principles of Communication Engineering , 1965 .

[2]  Joseph W. Lechleider The optimum combination of block codes and receivers for arbitrary channels , 1990, IEEE Trans. Commun..

[3]  John M. Cioffi,et al.  Vector coding for partial response channels , 1990, IEEE Trans. Inf. Theory.

[4]  R W Lucky,et al.  Principles of data communication , 1968 .

[5]  Masao Kasahara,et al.  Evaluation of the exponent function E(R) for channels with intersymbol interference , 1982 .

[6]  Nelson M. Blachman,et al.  The convolution inequality for entropy powers , 1965, IEEE Trans. Inf. Theory.

[7]  Aaron D. Wyner,et al.  Achievable rates for a constrained Gaussian channel , 1988, IEEE Trans. Inf. Theory.

[8]  James L. Massey,et al.  Capacity of the discrete-time Gaussian channel with intersymbol interference , 1988, IEEE Trans. Inf. Theory.

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

[10]  U. Grenander,et al.  Toeplitz Forms And Their Applications , 1958 .

[11]  Toby Berger,et al.  Capacity and error exponents of a channel modeled as a linear dynamic system (Corresp.) , 1973, IEEE Trans. Inf. Theory.

[12]  Shlomo Shamai,et al.  On the capacity of a gaussian channel with peak power and brand limited input signals , 1988 .

[13]  Shlomo Shamai,et al.  Information rates for magnetic recording channels with peak- and slope-limited magnetization , 1989, IEEE Trans. Inf. Theory.

[14]  Shlomo Shamai,et al.  A lower bound on the cutoff rate for Gaussian channels with peak-limited inputs , 1991, IEEE Trans. Commun..

[15]  Joel G. Smith,et al.  The Information Capacity of Amplitude- and Variance-Constrained Scalar Gaussian Channels , 1971, Inf. Control..

[16]  Shlomo Shamai,et al.  Upper bounds on capacity for a constrained Gaussian channel , 1989, IEEE Trans. Inf. Theory.

[17]  V.W.S. Chan,et al.  Principles of Digital Communication and Coding , 1979 .

[18]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[19]  G. David Forney,et al.  Trellis precoding: Combined coding, precoding and shaping for intersymbol interference channels , 1992, IEEE Trans. Inf. Theory.

[20]  John G. Proakis,et al.  Digital Communications , 1983 .

[21]  J. Crank Tables of Integrals , 1962 .

[22]  A. Robert Calderbank,et al.  Coset codes for partial response channels; or, coset codes with spectral nulls , 1989, IEEE Trans. Inf. Theory.

[23]  Walter Hirt Capacity and information rates of discrete-time channels with memory , 1988 .

[24]  Kees A. Schouhamer Immink Coding techniques for the noisy magnetic recording channel: a state-of-the-art report , 1989, IEEE Trans. Commun..

[25]  Richard E. Blahut,et al.  Principles and practice of information theory , 1987 .

[26]  A. Robert Calderbank,et al.  Binary convolutional codes with application to magnetic recording , 1986, IEEE Trans. Inf. Theory.

[27]  Jack K. Wolf,et al.  Trellis Coding for Partial-Response Channels , 1986, IEEE Trans. Commun..

[28]  L. H. Brandenburg,et al.  Capacity of the Gaussian channel with memory: The multivariate case , 1974 .

[29]  A. Robert Calderbank,et al.  Nonequiprobable signaling on the Gaussian channel , 1990, IEEE Trans. Inf. Theory.

[30]  Ib N. Andersen,et al.  Sample-whitened matched filters , 1973, IEEE Trans. Inf. Theory.

[31]  M. Vedat Eyuboglu,et al.  Detection of coded modulation signals on linear, severely distorted channels using decision-feedback noise prediction with interleaving , 1988, IEEE Trans. Commun..

[32]  A. D. Wyner,et al.  Bounds on communication with polyphase coding , 1966 .

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