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

doi:10.1587/transcom.2015EBP3521

Regular Section

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

Author information

Keywords: K-Best decoder, MIMO wireless communications, maximum likelihood, complexity

JOURNAL RESTRICTED ACCESS

2017 Volume E100.B Issue 2 Pages 336-343

DOI https://doi.org/10.1587/transcom.2015EBP3521

Browse “Advance online publication” version

Details

Abstract

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.

Corresponding author

Register with J-STAGE for free!