Probabilistic spherical detection and VLSI implementation for multiple-antenna systems

Authors:
Chester Sungchung Park;Keshab K. Parhi;Sin-Chong Park
Affiliations:
Ericsson Research, Research Triangle Park, NC and Samsung Advanced Institute of Technology, Yongin, Korea;Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN;School of Engineering, Information and Communications University, Daejeon, Korea
Venue:
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Year:
2009

Citing 8
Cited 5

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

Mathematical Programming: Series A and B
Advanced receiver algorithms for MIMO wireless communications

Proceedings of the conference on Design, automation and test in Europe: Proceedings
Relaxed K-best MIMO signal detector design and VLSI implementation

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On the sphere-decoding algorithm I. Expected complexity

IEEE Transactions on Signal Processing - Part I
Iterative decoding for MIMO channels via modified sphere decoding

IEEE Transactions on Wireless Communications
Reduced complexity closest point decoding algorithms for random lattices

IEEE Transactions on Wireless Communications
A unified framework for tree search decoding: rediscovering the sequential decoder

IEEE Transactions on Information Theory
From theory to practice: an overview of MIMO space-time coded wireless systems

IEEE Journal on Selected Areas in Communications

Iterative QR decomposition architecture using the modified gram-schmidt algorithm for MIMO systems

IEEE Transactions on Circuits and Systems Part I: Regular Papers - Special issue on ISCAS 2009
Small-area and low-energy K-best MIMO detector using relaxed tree expansion and early forwarding

Proceedings of the 16th ACM/IEEE international symposium on Low power electronics and design
High-throughput and area-efficient MIMO symbol detection based on modified Dijkstra's search

IEEE Transactions on Circuits and Systems Part I: Regular Papers
Small-area and low-energy K-best MIMO detector using relaxed tree expansion and early forwarding

IEEE Transactions on Circuits and Systems Part I: Regular Papers
A radius adaptive K-Best decoder with early termination: algorithm and VLSI architecture

IEEE Transactions on Circuits and Systems Part I: Regular Papers - Special section on 2009 IEEE custom integrated circuits conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel probabilistic spherical-detection (P-SD) method which applies the probabilistic-search algorithm to conventional depth-first SD (DF-SD). By confining the tree search into candidates which can be selected in an adaptive manner, a large number of promising candidates can be evaluated before termination. Consequently, the proposed P-SD improves the error performance of DF-SD with early termination, while retaining the hardware efficiency. An efficient VLSI architecture is proposed for implementation of the P-SD algorithm, and the results of the synthesized architecture are presented. The main advantage of P-SD is that it can fully exploit the state-of-the-art architectures of DF-SD, since it can be implemented by simply adding two functional blocks to conventional DF-SD. By analyzing the performance-complexity tradeoffs, it is concluded that our proposed P-SD is advantageous over conventional DF-SD and K-best algorithm, when the maximum-likelihood error performance is desired.