FPGA Implementation of Dynamic Threshold Sphere Detection for MIMO Systems

1 January 2006

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

No. 10586393,p. 94-98
https://doi.org/10.1109/acssc.2006.356591

Abstract

In this paper, we consider the FPGA implementation of a modified sphere detection algorithm. We analyze breadth-first and depth-first search in sphere detection, and compare the relative performance and complexity. Based on these comparisons, we propose a more efficient and less complex scheme, dynamic threshold sphere detection (DTSD), which can effectively increase the throughput and reduce the error rate. We, then, propose a novel architecture for this scheme, and discuss the complexity reduction techniques that we utilized. These techniques do not compromise the overall performance. Finally, the high throughput FPGA implementation results of this algorithm will be presented.

Keywords

This publication has 7 references indexed in Scilit:

A threshold-based algorithm and VLSI architecture of a K-best Lattice Decoder for MIMO Systems
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
VLSI implementation of MIMO detection using the sphere decoding algorithm
IEEE Journal of Solid-State Circuits, 2005
Efficient statistical pruning for maximum likelihood decoding
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2004
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory, 2003
Achieving near-capacity on a multiple-antenna channel
IEEE Transactions on Communications, 2003
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory, 1999
Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
Mathematics of Computation, 1985