High-throughput implementation of tree-search algorithms for vector precoding

Author

Barrenechea, Maitane ; Barbero, Luis ; Jiménez, Idoia ; Arruti, Egoitz ; Mendicute, Mikel

Author_Institution

Dept. of Electron. & Comput. Sci., Univ. of Mondragon, Mondragon, Spain

fYear

2011

fDate

22-27 May 2011

Firstpage

1689

Lastpage

1692

Abstract

This contribution analyzes the architecture design and FPGA implementation of high-throughput multiuser vector precoders. The most complex task of such precoders, i.e. the search of the perturbing vector over an infinite lattice, has been carried out by means of two tree search algorithms: a novel fully-pipelined complex-valued K-Best scheme and a fixed-sphere encoder (FSE). Both designs have been implemented in a Virtex-6 device, leading to precoding throughputs of up to 2.4 Gbps with 16-QAM modulation.

Keywords

field programmable gate arrays; pipeline processing; precoding; quadrature amplitude modulation; search problems; 16-QAM modulation; FPGA implementation; Virtex-6 device; architecture design; fixed-sphere encoder; fully-pipelined complex valued K-Best scheme; high-throughput multiuser vector precoder; infinite lattice; tree-search algorithm; Bit error rate; Complexity theory; Hardware; Lattices; MIMO; Sorting; Throughput; FSE; Implementation; K-Best; Vector Precoding;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on

Conference_Location

Prague

ISSN

1520-6149

Print_ISBN

978-1-4577-0538-0

Electronic_ISBN

1520-6149

Type

conf

DOI

10.1109/ICASSP.2011.5946825

Filename

5946825