A pipelined VLSI architecture for a list sphere decoder

Since finding the nearest point in a lattice for multi-input multi-output (MIMO) channels is NP-hard, simplified algorithms such as a sphere decoder (SD) have been proposed. With simple modification of SD, a list sphere decoder (LSD), soft information can be extracted for channel decoding and iterative detection/decoding. However, generating such information increases the computational complexity for selecting a specific number of candidate lattice points. In this paper an efficient pipelined VLSI architecture for LSD is presented and its complexity is analyzed. The architecture is constructed with three pipeline stages, two stages for metric calculation units (MCU) and one stage for metric enumeration unit (MEU). It also has three storage units and list units for three successive input MIMO vectors. The pipeline can increase the operating clock frequency and keep one-node-per-cycle policy, so that the average throughput can enhance according to the increment of the clock frequency

[1]  Graeme Woodward,et al.  A highly-parallel VLSI architecture for a list sphere detector , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[2]  Jin Lee,et al.  Performance Evaluation of Various LDPC Coded MIMO-OFDM Receiver Architectures , 2005 .

[3]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

[4]  A. Burg,et al.  VLSI implementation of MIMO detection using the sphere decoding algorithm , 2005, IEEE Journal of Solid-State Circuits.

[5]  Zhan Guo,et al.  A VLSI architecture of the Schnorr-Euchner decoder for MIMO systems , 2004, Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710).

[6]  B. Hochwald,et al.  Silicon complexity for maximum likelihood MIMO detection using spherical decoding , 2004, IEEE Journal of Solid-State Circuits.