Work

Reduced complexity sphere decoding

Year: 2011
Type: article
Abstract: ABSTRACT In multiple‐input multiple‐output (MIMO) systems, sphere decoding (SD) can achieve a performance equivalent to a full‐search maximum likelihood decoding, with reduced complexity. Several researchers reported techniques that reduce the complexity of SD further. In this paper, a new technique that decreases the computational complexity of SD substantially, without sacrificing performance, is introduced. The reduction is accomplished by deconstructing the decoding metric to decrease the number of computations and by exploiting the structure of a lattice representation. Furthermore, an application of SD employing a proposed smart implementation with very low computational complexity is introduced. This application calculates the soft bit metrics of a bit‐interleaved convolutional‐coded MIMO system in an efficient manner. On the basis of the reduced complexity SD, the proposed smart implementation employs the initial radius acquired by zero‐forcing decision feedback equalization, which ensures no empty spheres. Other than that, a technique of a particular data structure is also incorporated to efficiently reduce the number of executions carried out by SD. Simulation results show that these approaches achieve substantial gains in terms of the computational complexity for both uncoded and coded MIMO systems. Copyright © 2011 John Wiley & Sons, Ltd.
Authors: Boyu Li, Ender Ayanoglu
Language: English
Open Access status: green
OpenAlex ID: W2949174839
FWCI: 0.978
Cites: 28
Cited by: 8
Related to: 10