Skip to main content
Article thumbnail
Location of Repository

Soft Sphere Detection with Bounded Search for High-Throughput MIMO Receivers

By et al. Pedrag Radosavljevic

Abstract

We propose a soft sphere detection algorithm where search-bounds are determined based on the distribution of candidates found inside the sphere for different search levels. Detection accuracy of unbounded search is preserved while significant saving of memory space and reduction of latency is achieved. This probabilistic search algorithm provides significantly better frame-error rate performance than the soft K-best solution and has comparable performance and smaller computational complexity than the bounded depth-first search method. Techniques for efficient and flexible architecture design of soft sphere detectors are also presented. The estimated hardware cost is lower than the hardware cost of other soft sphere detectors from the literature, while high detection throughput per channel use is achieved

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.5536
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ece.rice.edu/~rpred... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.