High-throughput implementation of tree-search algorithms for vector precoding
High-throughput implementation of tree-search algorithms for vector precoding
复制标题
用于矢量预编码的树搜索算法的高吞吐量实现
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
M. Mendicute
中科院分区：
文献类型：
--
作者：
M. Barrenechea;L. G. Barbero;I. Jimenez;Egoitz Arruti;M. Mendicute
该贡献分析了高通量多源矢量预编码器的体系结构设计和FPGA实现。此类预编码器的最复杂任务，即在无限晶格上搜索扰动向量编码器（FSE）。这两种设计均已在VirTex-6设备中实现，从而导致使用16 QAM调制的预言吞吐量高达2.4 Gbps。
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.