Copyright information: personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the publisher.
Low-Complexity BER Computation for Coherent Detection of Orthogonal Signals
|Year of publication
|Luca Rugini and Giuseppe Baruffa
|Low-Complexity BER Computation for Coherent Detection of Orthogonal Signals
|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 we propose a BER computation approach that circumvents the need for repeated numerical integration. First, we select a low-complexity BER approximation formula, with unknown parameters to be determined. Second, we determine 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).
|(portable document format, 372350 Bytes)