Multicore implementation of a fixed-complexity tree-search detector for MIMO communications

Authors:
Carla Ramiro;Sandra Roger;Alberto Gonzalez;Vicenc Almenar;Antonio M. Vidal
Affiliations:
Department of Information Systems and Computation, Universidad Politecnica de Valencia, Valencia, Spain;Institute of Telecommunications and Multimedia Applications, Universidad Politecnica de Valencia, Valencia, Spain;Institute of Telecommunications and Multimedia Applications, Universidad Politecnica de Valencia, Valencia, Spain;Institute of Telecommunications and Multimedia Applications, Universidad Politecnica de Valencia, Valencia, Spain;Department of Information Systems and Computation, Universidad Politecnica de Valencia, Valencia, Spain
Venue:
The Journal of Supercomputing
Year:
2013

Citing 6
Cited 0

SODA: A High-Performance DSP Architecture for Software-Defined Radio

IEEE Micro
Sora: high-performance software radio using general-purpose multi-core processors

Communications of the ACM
Implementation of a High-Speed MIMO Soft-Output Symbol Detector for Software Defined Radio

Journal of Signal Processing Systems
On the sphere-decoding algorithm I. Expected complexity

IEEE Transactions on Signal Processing - Part I
Fixing the Complexity of the Sphere Decoder for MIMO Detection

IEEE Transactions on Wireless Communications
Closest point search in lattices

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multicore systems allow the efficient implementation of signal processing algorithms for communication systems due to their high parallel processing capabilities. In this paper, we present a high-throughput multicore implementation of a fixed-complexity tree-search-based detector interesting for MIMO wireless communication systems. Experimental results confirm that this implementation allows to accelerate the data detection stage for different constellation sizes and number of subcarriers.