A Reduced-Complexity Maximum-Likelihood Detection with a sub-optimal BER Requirement
Abstract
Maximum likelihood (ML) detection is an optimal signal detection scheme, which is often difficult to implement due to its high computational complexity, especially in a multiple-input multiple-output (MIMO) scenario. In a system with transmit antennas employing -ary modulation, the ML-MIMO detector requires cost function (CF) evaluations followed by a search operation for detecting the symbol with the minimum CF value. However, a practical system needs the bit-error ratio (BER) to be application-dependent which could be sub-optimal. This implies that it may not be necessary to have the minimal CF solution all the time. Rather it is desirable to search for a solution that meets the required sub-optimal BER. In this work, we propose a new detector design for a SISO/MIMO system by obtaining the relation between BER and CF which also improves the computational complexity of the ML detector for a sub-optimal BER.
Keywords
Cite
@article{arxiv.2208.05194,
title = {A Reduced-Complexity Maximum-Likelihood Detection with a sub-optimal BER Requirement},
author = {Sharan Mourya and Amit Kumar Dutta},
journal= {arXiv preprint arXiv:2208.05194},
year = {2022}
}