z-logo
open-access-imgOpen Access
Low‐complexity BER computation for coherent detection of orthogonal signals
Author(s) -
Rugini L.,
Baruffa G.
Publication year - 2021
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/ell2.12163
Subject(s) - bit error rate , computation , computational complexity theory , algorithm , additive white gaussian noise , computer science , gaussian , word error rate , mathematics , theoretical computer science , white noise , decoding methods , telecommunications , speech recognition , physics , quantum mechanics
The bit error rate (BER) computation for coherently detected orthogonal signals in additive white Gaussian noise requires numerical integration, which can be cumbersome in low‐complexity devices. Here, a BER computation approach that circumvents the need for repeated numerical integration is proposed. First, a low‐complexity BER approximation formula is selected, with unknown parameters to be determined. Second, this letter determines the unknown parameters by fitting the BER approximation to a few BER values known in advance. The BER comparison with the exact results shows that the accuracy of the proposed low‐complexity approach is satisfactory for several constellation sizes of interest. This enables the possibility of BER self‐computation in low‐complexity devices that use orthogonal signals, like those used in the Internet of Things (IoT).

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