Open AccessLow‐complexity graph‐based turbo equalisation for single‐carrier and multi‐carrier FTN signalling
Author(s) -
Yu Tianhang,
Zhao Minjian,
Zhong Jie,
Zhang Jian,
Xiao Pei
Publication year - 2017
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
ISSN - 1751-9683
DOI - 10.1049/iet-spr.2016.0251
Subject(s) - fading , factor graph , computer science , turbo , algorithm , intersymbol interference , additive white gaussian noise , turbo code , low density parity check code , multiuser detection , single antenna interference cancellation , nyquist–shannon sampling theorem , computational complexity theory , decoding methods , telecommunications , channel (broadcasting) , code division multiple access , automotive engineering , engineering , computer vision
The authors propose a novel turbo detection scheme based on the factor graph (FG) serial‐schedule belief propagation equalisation algorithm with low complexity for single‐carrier faster‐than‐Nyquist (SC‐FTN) and multi‐carrier FTN (MC‐FTN) signalling. In this work, the additive white Gaussian noise channel and multi‐path fading channels are both considered. The iterative FG‐based equalisation algorithm can deal with severe intersymbol interference and intercarrier interference introduced by the generation of SC and MC‐FTN signals, as well as the effect of multi‐path fading. With the application of Gaussian approximation, the complexity of the proposed equalisation algorithm is significantly reduced. In the turbo detection, low‐density parity check code is employed. The simulation results demonstrate that the FG‐based turbo detection method can achieve satisfactory performance with low complexity.