Reference Hub1
Design and Implementation of a Low-Complexity Multiuser Vector Precoder

Design and Implementation of a Low-Complexity Multiuser Vector Precoder

Maitane Barrenechea, Luis Barbero, Mikel Mendicute, John S. Thompson
Copyright: © 2012 |Volume: 3 |Issue: 1 |Pages: 18
ISSN: 1947-3176|EISSN: 1947-3184|EISBN13: 9781466611993|DOI: 10.4018/jertcs.2012010102
Cite Article Cite Article

MLA

Barrenechea, Maitane, et al. "Design and Implementation of a Low-Complexity Multiuser Vector Precoder." IJERTCS vol.3, no.1 2012: pp.31-48. http://doi.org/10.4018/jertcs.2012010102

APA

Barrenechea, M., Barbero, L., Mendicute, M., & Thompson, J. S. (2012). Design and Implementation of a Low-Complexity Multiuser Vector Precoder. International Journal of Embedded and Real-Time Communication Systems (IJERTCS), 3(1), 31-48. http://doi.org/10.4018/jertcs.2012010102

Chicago

Barrenechea, Maitane, et al. "Design and Implementation of a Low-Complexity Multiuser Vector Precoder," International Journal of Embedded and Real-Time Communication Systems (IJERTCS) 3, no.1: 31-48. http://doi.org/10.4018/jertcs.2012010102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Precoding techniques are used in the downlink of multiuser multiple-input multiple-output (MIMO) systems in order to separate the information data streams aimed at scattered user terminals. Vector precoding (VP) is one of the most promising non-linear precoding schemes, which achieves a performance close to the optimum albeit impractical dirty paper coding (DPC) with a feasible complexity. This contribution presents a novel design for the hardware implementation of a high-throughput vector precoder based on the Fixed Sphere Encoder (FSE) algorithm. The proposed fixed-complexity scheme greatly reduces the complexity of the most intricate part of VP, namely the search for the perturbing signal in an infinite lattice. Additionally, an optimized reduced-complexity implementation is presented which considerably reduces the resource usage at the cost of a small performance loss. Provided simulation results show the better performance of the proposed vector precoder in comparison to other fixed-complexity approaches, such as the K-Best precoder, under similar complexity constraints.

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.