Probabilistically bounded soft sphere detection for MIMO-OFDM receivers: algorithm and system architecture

Authors:
Predrag Radosavljevic;Yuanbin Guo;Joseph R. Cavallaro
Affiliations:
Patterson & Sheridan, LLP, Houston, TX;Huawei, San Diego, CA;Department of Electrical and Computer Engineering, Rice University, Houston, TX
Venue:
IEEE Journal on Selected Areas in Communications - Special issue on realizing GBPS wireless personal area networks
Year:
2009

Citing 6
Cited 2

Lattice basis reduction: improved practical algorithms and solving subset sum problems

Mathematical Programming: Series A and B
Configurable, High Throughput, Irregular LDPC Decoder Architecture: Tradeoff Analysis and Implementation

ASAP '06 Proceedings of the IEEE 17th International Conference on Application-specific Systems, Architectures and Processors
High-throughput LDPC decoders

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Minimum mean squared error equalization using a priori information

IEEE Transactions on Signal Processing
Performance analysis and design optimization of LDPC-coded MIMO OFDM systems

IEEE Transactions on Signal Processing
Algorithm and implementation of the K-best sphere decoding for MIMO detection

IEEE Journal on Selected Areas in Communications

Algorithm and hardware complexity reduction techniques for k-best sphere decoders

Proceedings of the 20th symposium on Great lakes symposium on VLSI
Area-Efficient Antenna-Scalable MIMO Detector for K-best Sphere Decoding

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Iterative soft detection and channel decoding for MIMO OFDM downlink receivers is studied in this work. Proposed inner soft sphere detection employs a variable upper bound for number of candidates per transmit antenna and utilizes the breath-first candidate-search algorithm. Upper bounds are based on probability distribution of the number of candidates found inside the spherical region formed around the received symbol-vector. Detection accuracy of unbounded breadth-first candidate-search is preserved while significant reduction of the search latency and area cost is achieved. This probabilistically bounded candidate-search algorithm improves error-rate performance of non-probabilistically bounded soft sphere detection algorithms, while providing smaller detection latency with same hardware resources. Prototype architecture of soft sphere detector is synthesized on Xilinx FPGA and for an ASIC design. Using area-cost of a single soft sphere detector, a level of processing parallelism required to achieve targeted high data rates for future wireless systems (for example, 1 Gbps data rate) is determined.