2026-04-21T16:20:31Zhttps://ebiltegia.mondragon.edu/oai/request

oai:ebiltegia.mondragon.edu:20.500.11984/55472024-03-04T12:18:56Zcom_20.500.11984_473col_20.500.11984_478

00925njm 22002777a 4500 dc Barrenechea, Maitane author Mendicute, Mikel author Arruti, Egoitz author 2013 The nonlinear vector precoding (VP) technique has been proven to achieve close-to-capacity performance in multiuser multipleinput multiple-output (MIMO) downlink channels. The performance benefit with respect to its linear counterparts stems from the incorporation of a perturbation signal that reduces the power of the precoded signal. The computation of this perturbation element, which is known to belong in the class of NP-hard problems, is the main aspect that hinders the hardware implementation of VP systems. To this respect, several tree-search algorithms have been proposed for the closest-point lattice search problem in VP systems hitherto. Nevertheless, the optimality of these algorithms has been assessed mainly in terms of error-rate performance and computational complexity, leaving the hardware cost of their implementation an open issue.The parallel data-processing capabilities of field-programmable gate arrays (FPGA) and the loopless nature of the proposed tree-search algorithms have enabled an efficient hardware implementation of a VP system that provides a very high data-processing throughput. 1687-7209 https://katalogoa.mondragon.edu/janium-bin/janium_login_opac.pl?find&ficha_no=102712 https://hdl.handle.net/20.500.11984/5547 Fully pipelined implementation of tree-search algorithms for vector precoding