Regular Section
Adaptive K-Best BFTS Signal Detection Algorithm Based on the Channel Condition for MIMO-OFDM Signal Detector
2017 Volume E100.A Issue 10 Pages 2207-2211
Details
2017 Volume E100.A Issue 10 Pages 2207-2211
The breadth-first tree searching (BFTS) detection algorithm such as the QR decomposition with M algorithm (QRD-M) which is the generally K-best detection algorithm is suboptimal, but has high complexity. In this letter, the K-best BFTS detection algorithm having reduced complexity is proposed. The proposed detection algorithm calculates the channel condition to decide the thresholds for regulating complexity and performance and from the simulation results, it has good error performance with very low complexity.
