Implementation Strategies for High-Performance Multiuser MIMO Precoders

Implementation Strategies for High-Performance Multiuser MIMO Precoders

Maitane Barrenechea, Mikel Mendicute, Andreas Burg, John S. Thompson
ISBN13: 9781466660342|ISBN10: 1466660341|EISBN13: 9781466660359
DOI: 10.4018/978-1-4666-6034-2.ch006
Cite Chapter Cite Chapter

MLA

Barrenechea, Maitane, et al. "Implementation Strategies for High-Performance Multiuser MIMO Precoders." Advancing Embedded Systems and Real-Time Communications with Emerging Technologies, edited by Seppo Virtanen, IGI Global, 2014, pp. 135-161. https://doi.org/10.4018/978-1-4666-6034-2.ch006

APA

Barrenechea, M., Mendicute, M., Burg, A., & Thompson, J. S. (2014). Implementation Strategies for High-Performance Multiuser MIMO Precoders. In S. Virtanen (Ed.), Advancing Embedded Systems and Real-Time Communications with Emerging Technologies (pp. 135-161). IGI Global. https://doi.org/10.4018/978-1-4666-6034-2.ch006

Chicago

Barrenechea, Maitane, et al. "Implementation Strategies for High-Performance Multiuser MIMO Precoders." In Advancing Embedded Systems and Real-Time Communications with Emerging Technologies, edited by Seppo Virtanen, 135-161. Hershey, PA: IGI Global, 2014. https://doi.org/10.4018/978-1-4666-6034-2.ch006

Export Reference

Mendeley
Favorite

Abstract

The multiuser MIMO environment enables the communication between a base-station and multiple users with several antennas. In such a scenario, the use of precoding techniques is required in order to detect the signal at the users' terminals without any cooperation between them. This contribution presents various designs and hardware implementations of a high-capacity precoder based on vector perturbation. To this aim, three tree-search techniques and their associated user-ordering schemes are investigated in this chapter: the well-known K-Best precoder, the fixed-complexity Fixed Sphere Encoder (FSE), and the variable complexity Single Best-Node Expansion (SBE). All of the aforementioned techniques aim at finding the most suitable perturbation vector within an infinite lattice without the high computational complexity of an exhaustive search.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.