Constrained Capacity Analysis for Faster-than-Nyquist Signaling

This paper studies the constrained-capacity for precoded faster-than-Nyquist (FTN) signaling with finite-alphabet inputs.

Despite the promise of accelerated transmission, the fundamental rate limit of precoded FTN signaling under practical finite-alphabet constraints remains unclear.

By introducing cyclic prefix (CP) and cyclic suffix (CS), the FTN channel is decomposed into a set of parallel eigenchannels by the discrete Fourier transform (DFT) matrix, based on which the constrained capacity is derived.

The results demonstrate that time acceleration can improve spectral efficiency over Nyquist signaling even when a fixed modulation order is employed.

Moreover, in the low and moderate signal-to-noise ratio (SNR) regimes, a smaller constellation combined with stronger time acceleration can outperform a larger constellation with weaker acceleration.

Next, the asymptotic behavior of the constrained capacity is analyzed as the acceleration factor tends to zero under both fixed transmit-SNR and fixed receive-SNR definitions.

It is shown that the constrained capacity for DFT-precoded FTN is fundamentally limited by the constellation size.

In addition, the constrained capacity under channel mismatch is studied and a mismatched achievable information rate (AIR) formulation is developed to show the effects of practical constraints on the performance degradation.

Finally, adaptive bit loading across eigenchannels is investigated to exploit the higher-quality eigenchannels.