Reduced Complexity K-Best Decoder via Adaptive Symbol Constellation for Uncoded MIMO Wireless Systems

Juan Francisco CASTILLO-LEON  Marco CARDENAS-JUAREZ  Victor M. GARCIA-MOLLA  Enrique STEVENS-NAVARRO  Ulises PINEDA-RICO  

Publication
IEICE TRANSACTIONS on Communications   Vol.E100-B   No.2   pp.336-343
Publication Date: 2017/02/01
Online ISSN: 1745-1345
Type of Manuscript: PAPER
Category: Wireless Communication Technologies
Keyword: 
K-Best decoder,  MIMO wireless communications,  maximum likelihood,  complexity,  

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


Summary: 
In this paper, we present a low and variable computation complexity decoder based on K-Best for uncoded detection in spatially multiplexed MIMO systems. In the variable complexity K-Best (VKB), the detection of each symbol is carried out using only a symbol constellation of variable size. This symbol constellation is obtained by considering the channel properties and a given target SNR. Simulations show that the proposed technique almost matches the performance of the original K-Best decoder. Moreover, it is able to reduce the average computation complexity by at least 75% in terms of the number of visited nodes.