IEEE Access · 2019 · 24 citations · 19 references
EngineeringComputer ScienceElectrical EngineeringAlgorithmsDigital CommunicationWireless CommunicationsChannel EstimationCommunication ComplexityDigital Signal ProcessingError DetectionError-correcting CodesSignal Detection TheoryBit Error RateBreadth-first SearchChannel State InformationComputational Complexity Of AlgorithmsMimoMimo SystemsTree SearchTree Search Algorithms
In this paper, a novel efficient algorithm for MIMO detection in MIMO-OFDM systems has been proposed. This paper also shows that the complexity can be greatly reduced by applying the threshold in the breadth-first tree search algorithm step to eliminating paths. That is, this algorithm derives thresholds based on the LR-aided nonlinear algorithm and performs a simple tree search detection algorithm. This algorithm requires a lower computational complexity than the conventional QRD-M detection algorithm and achieves the same bit error performance. After the novel detection algorithm is proposed, this paper applies this algorithm to the MIMO-OFDM system for performance comparison in terms of error performance and complexity. In many cases of MIMO-OFDM receivers, the proposed method will be an excellent option for implementation.
19
Jeffrey G. Andrews, Stefano Buzzi, Wan Choi et al. · IEEE Journal on Selected Areas in Communications · 2014 · 8.2K citations · Full text
Factoring polynomials with rational coefficients
A. K. Lenstra, H. W. Lenstra, László Lovász · Mathematische Annalen · 1982 · 4K citations · Full text