Abstract
In this paper, we consider the detection of faster-than-Nyquist (FTN) signaling. By noticing that the whitening filter for FTN signaling cannot be directly derived when the symbol rate exceeds the signal bandwidth, we propose a new reduced-complexity M-algorithm BCJR (M-BCJR) algorithm based on the Ungerboeck observation model. By taking some “future” symbols into account, the proposed algorithm is able to select the $M$ best states in the maximum a posteriori sense. We further simplify the above algorithm by choosing the key path from each possible state, which successfully reduces the complexity while maintaining a good bit error rate performance. Simulation results show that, with the use of the proposed methods, great gains can be obtained in terms of spectral efficiency (up to 186%) or signal-to-noise ratio (up to 4.5 dB) compared with the Nyquist signaling.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
