Iterative-Detection-Aided Tomlinson-Harashima Precoding for Faster-Than-Nyquist Signaling

Abstract

Faster-than-Nyquist(FTN) is a promising technique due to higher spectral efficiency, but at a cost of introducing the inter-symbol interference (ISI) which usually requires the computationally demanding detection algorithms. In order to reduce the detection complexity at the receiver, in this paper, a novel Tomlinson-Harashima precoding (THP) scheme is proposed for FTN system. In the conventional THP (CTHP) scheme, the ISI introduced by time-packing can only be diminished from several preceding information symbols, which results in large residual ISI and an unattractive bit-error-rate (BER) performance. Moreover, due to the suboptimal receiver - a simple modulo operation which ignores the correlation between received symbols, CTHP faces obvious capacity loss and is ineffective to execute interference cancellation for FTNS. In this paper, residual ISI of FTNS in CTHP is formulated in detail and modeled mathematically. Further more, an improved THP method with an optimized receiver based on the soft interference cancelation (SIC) algorithm and iterative turbo process is proposed to combat residual ISI for FTNS. Computational complexity analysis and numerical simulation results show that the proposed scheme not only has inexpensive computational cost but also greatly outperforms CTHP and other cited schemes. Moreover, for moderate time-packing, it can approach the ISI-free BER performance boundary and is also competitive to the MAP equalization technique.

Keywords

• Faster-than-Nyquist (FTN)
• precoding
• inter-symbol interference (ISI)
• Tomlinson-Harashima precoding (THP)
• iterative detection