A LOW-COMPLEXITY NEAR-ML DECODING TECHNIQUE VIA REDUCED DIMENSION LIST STACK ALGORITHM

In this paper, we propose a near maximum likelihood (ML) decoding technique, which reduces the computational complexity of the exact ML decoding algorithm. The computations needed for the tree search in the ML decoding is simplified by reducing the dimension of the search space prior to the tree search. In order to compensate performance loss due to the dimension reduction, a list stack algorithm (LSA) is considered, which produces a list of the top K closest points. The combination of both approaches, called reduced dimension list stack algorithm (RD-LSA), is shown to provide flexibility and offers a performance-complexity trade-off. Simulations performed for V-BLAST transmission demonstrate that significant complexity reduction can be achieved compared to the sphere decoding algorithm (SDA) while keeping the performance loss below an acceptable level.