Constrained capacities for faster-than-Nyquist signaling

Authors:
Fredrik Rusek;John B. Anderson
Affiliations:
Department of Electrical and Information Technology, Lund University, Lund, Sweden;Department of Electrical and Information Technology, Lund University, Lund, Sweden
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 4
Cited 2

Coded Modulation Systems

Coded Modulation Systems
The intersymbol interference channel: lower bounds on capacity and channel precoding loss

IEEE Transactions on Information Theory
Bandwidth-efficient coded modulation with optimized linear partial-response signals

IEEE Transactions on Information Theory
Simulation-Based Computation of Information Rates for Channels With Memory

IEEE Transactions on Information Theory

New reduced state space BCJR algorithms for the ISI channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Asymptotic optimality of binary faster-than-nyquist signaling

IEEE Communications Letters

Quantified Score

Hi-index	754.84

Visualization

Abstract

This paper deals with capacity computations of fasterthan-Nyquist (FTN) signaling. It shows that the capacity of FTN 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.