Search sequence determination for tree search based detection algorithms

Authors:
Björn Mennenga;Gerhard Fettweis
Affiliations:
Vodafone Chair Mobile Communication Systems, Technische Universität Dresden, Dresden, Germany;Vodafone Chair Mobile Communication Systems, Technische Universität Dresden, Dresden, Germany
Venue:
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Year:
2009

Citing 7
Cited 3

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

Mathematical Programming: Series A and B
Complexity reduced soft-in soft-out sphere detection based on search tuples

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A universal lattice code decoder for fading channels

IEEE Transactions on Information Theory
Closest point search in lattices

IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point

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

IEEE Journal on Selected Areas in Communications
Soft-output sphere decoding: algorithms and VLSI implementation

IEEE Journal on Selected Areas in Communications

A scalable VLSI architecture for soft-input soft-output depth-first sphere decoding

IEEE Transactions on Circuits and Systems II: Express Briefs
A system view on iterative MIMO detection: dynamic sphere detection versus fixed effort list detection

VLSI Design - Special issue on Flexible Radio Design: Trends and Challenges in Digital Baseband Implementation
VLSI Architecture for MIMO Soft-Input Soft-Output Sphere Detection

Journal of Signal Processing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tree search based detection algorithms provide a promising approach to solve the detection problems in MIMO systems. Depth-first, Breadth-first or Metric-first search strategies provide near max-log detection at reduced but still significant complexity. In this paper we show how the incurred complexity can be reduced substantially. In order to reduce the number of metric calculations to a minimum, we propose a novel relative determination of search sequences for QAM constellations, usable inexpensively independent of the underlying constellation size and search strategy and moreover also usable for soft-in soft-out detection. Based on its application to a sphere detector, we will demonstrate the impact on complexity and performance of the detection as well as on the detector structure. Building on the results, we propose refinements of the resulting detector providing a very good performance at minimized complexity, making the resulting detector particularly favorable for implementation.