Adaptive K-Best BFTS Signal Detection Algorithm Based on the Channel Condition for MIMO-OFDM Signal Detector

Jong-Kwang KIM  Seung-Jin CHOI  Jae-Hyun RO  Hyoung-Kyu SONG  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E100-A   No.10   pp.2207-2211
Publication Date: 2017/10/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E100.A.2207
Type of Manuscript: LETTER
Category: Communication Theory and Signals
MIMO,  OFDM,  lattice reduction,  BFTS,  K-Best,  channel condition,  interference cancellation,  

Full Text: PDF(516.8KB)>>
Buy this Article

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.