z-logo
open-access-imgOpen Access
Generalised expression for the symbol error floor of M ‐ary phase shift keying in the presence of phase noise, I/Q imbalance and DC‐offset
Author(s) -
Jafari Hamid,
MiarNaimi Hossein,
Kazemitabar Javad
Publication year - 2020
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.2020.0001
Subject(s) - demodulation , transmitter , keying , gaussian noise , offset (computer science) , phase shift keying , gaussian , algorithm , phase noise , mathematics , noise (video) , dc bias , computer science , minimum shift keying , control theory (sociology) , bit error rate , electronic engineering , telecommunications , physics , decoding methods , artificial intelligence , quantum mechanics , engineering , channel (broadcasting) , control (management) , image (mathematics) , programming language , voltage
This study, for the first time, presents an exact expression for the symbol error floor (SEF) of M ‐ary phase shift keying in the presence of phase noise, in‐phase/quadrature (I/Q) gain and phase imbalances, and DC‐offsets altogether. Accurate calculation of symbol error probability, and also the SEF, in the presence of transmitter and receiver impairments is usually a cumbersome task. In this study, the symbol decision boundaries are moved from the demodulator output to the demodulator input as a means to simplify the SEF calculation. In other words, the effect of the receiver I/Q imbalance and DC‐offset is applied on the symbol decision boundaries. Using the decision boundaries at the demodulator input facilitates the exact SEF calculation. The proposed exact expression consists of single integrals. These integrals can be accurately approximated by Gaussian one‐dimensional Q ‐functions assuming a Gaussian distribution for the phase noise. Computer simulations with Gaussian phase noise validate the exactness of the proposed analysis.

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