Constrained Capacities for Faster-Than-Nyquist Signaling

This paper deals with capacity computations of faster-than-Nyquist (FTN) signaling. It shows that the capacity of FTN is higher than the orthogonal pulse linear modulation capacity for all pulse shapes except the sinc. FTN signals can in fact achieve the ultimate capacity for the signal power spectral density (PSD). The paper lower- and upper-bounds the FTN capacity under the constraint of finite input alphabet. It is often higher than the capacity for comparable orthogonal pulse systems; sometimes it is superior to all forms of orthogonal signaling with the same PSD.

[1]  Shlomo Shamai,et al.  Bounds on the symmetric binary cutoff rate for dispersive Gaussian channels , 1994, IEEE Trans. Commun..

[2]  John B. Anderson,et al.  Bandwidth-Efficient Coded Modulation with Optimized Linear Partial-Response Signals , 1998, IEEE Trans. Inf. Theory.

[3]  Fredrik Rusek,et al.  CTH04-1: On Information Rates for Faster than Nyquist Signaling , 2006, IEEE Globecom 2006.

[4]  G. David Forney,et al.  Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.

[5]  John B. Anderson,et al.  Coded Modulation Systems , 2003 .

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

[7]  Paul H. Siegel,et al.  On the achievable information rates of finite state ISI channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[8]  Shlomo Shamai.  Information rates by oversampling the sign of a bandlimited process , 1994, IEEE Trans. Inf. Theory.

[9]  Shlomo Shamai,et al.  The intersymbol interference channel: lower bounds on capacity and channel precoding loss , 1996, IEEE Trans. Inf. Theory.

[10]  Angelos D. Liveris,et al.  On distributed coding, quantization of channel measurements and faster-than-Nyquist signaling , 2006 .

[11]  Dan Hajela.  On computing the minimum distance for faster than Nyquist signaling , 1990, IEEE Trans. Inf. Theory.

[12]  G. Ungerboeck,et al.  Adaptive Maximum-Likelihood Receiver for Carrier-Modulated Data-Transmission Systems , 1974, IEEE Trans. Commun..

[13]  Costas N. Georghiades,et al.  Exploiting faster-than-Nyquist signaling , 2003, IEEE Trans. Commun..

[14]  Giulio Colavolpe,et al.  On MAP symbol detection for ISI channels using the Ungerboeck observation model , 2005, IEEE Communications Letters.

[15]  O. R. D. Koe,et al.  On some extensions of Nyquist's telegraph transmission theory , 1969 .

[16]  B. Floch,et al.  Coded orthogonal frequency division multiplex , 1995 .

[17]  Wei Zeng,et al.  Simulation-Based Computation of Information Rates for Channels With Memory , 2006, IEEE Transactions on Information Theory.

[18]  Fredrik Rusek,et al.  The effect of symbol rate on constrained capacity for linear modulation , 2008, 2008 IEEE International Symposium on Information Theory.

[19]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[20]  Henry J. Landau,et al.  On the minimum distance problem for faster-than-Nyquist signaling , 1988, IEEE Trans. Inf. Theory.

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

[22]  Fredrik Rusek,et al.  Non Binary and Precoded Faster Than Nyquist Signaling , 2008, IEEE Transactions on Communications.

[23]  Fredrik Rusek,et al.  Serial and Parallel Concatenations Based on Faster Than Nyquist Signaling , 2006, 2006 IEEE International Symposium on Information Theory.

[24]  Claude Berrou,et al.  Coded orthogonal frequency division multiplex [TV broadcasting] , 1995, Proc. IEEE.

[25]  G. J. Foschini,et al.  Contrasting performance of faster binary signaling with QAM , 1984, AT&T Bell Laboratories Technical Journal.

[26]  Edgar N. Gilbert.  Increased information rate by oversampling , 1993, IEEE Trans. Inf. Theory.