z-logo
open-access-imgOpen Access
Tomlinson–Harashima precoding for transmitter‐side inter‐symbol interference cancellation in PSK modulation
Author(s) -
Sheikhzadeh Somayeh,
Forouzan Amir R.,
Parvaresh Farzad
Publication year - 2019
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2018.5437
Subject(s) - precoding , transmitter , computer science , equaliser , phase shift keying , algorithm , bit error rate , modulation (music) , single antenna interference cancellation , control theory (sociology) , interference (communication) , coding gain , telecommunications , mimo , mathematics , decoding methods , physics , channel (broadcasting) , artificial intelligence , control (management) , acoustics
Dirty paper coding (DPC) is a non‐linear transmit scheme in presence of known interference, which is capacity achieving. Unfortunately, the implementation complexity of DPC is usually prohibitive. A sub‐optimal yet practical method to implement DPC in inter‐symbol interference channels is Tomlinson–Harashima precoding (THP). However, THP is not applicable to the constant‐envelope phase shift keying (PSK) modulation. In this study, a modified Tomlinson–Harashima precoder is proposed to implement DPC for PSK modulation. The technique involves design of decision region at the receiver side and an algorithm to select the phase of transmitted symbol optimally at the transmitter side accordingly. Various patterns, namely, striped, checked, hexagonal, and radial are proposed and examined. Simulation results show that by using the proposed equaliser, the error floor is eliminated and significantly smaller bit‐error rate is achieved. Numerical and simulation results show that the striped pattern outperforms other decision region designs. Moreover, its implementation and computational complexities is almost the same as the Tomlinson–Harashima precoder.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here