Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding
The nonlinear vector precoding (VP) technique has been proven to achieve close-to-capacity performance in multiuser multiple-input multiple-output (MIMO) downlink channels. The performance benefit with respect to its linear counterparts stems from the incorporation of a perturbation signal that redu...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | International Journal of Reconfigurable Computing |
| Online Access: | http://dx.doi.org/10.1155/2013/496013 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832560893064380416 |
|---|---|
| author | Maitane Barrenechea Mikel Mendicute Egoitz Arruti |
| author_facet | Maitane Barrenechea Mikel Mendicute Egoitz Arruti |
| author_sort | Maitane Barrenechea |
| collection | DOAJ |
| description | The nonlinear vector precoding (VP) technique has been proven to achieve close-to-capacity performance in multiuser multiple-input 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. |
| format | Article |
| id | doaj-art-b0dc33c3937d4a2f819c3883cb7c49b0 |
| institution | Kabale University |
| issn | 1687-7195 1687-7209 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Reconfigurable Computing |
| spelling | doaj-art-b0dc33c3937d4a2f819c3883cb7c49b02025-02-03T01:26:34ZengWileyInternational Journal of Reconfigurable Computing1687-71951687-72092013-01-01201310.1155/2013/496013496013Fully Pipelined Implementation of Tree-Search Algorithms for Vector PrecodingMaitane Barrenechea0Mikel Mendicute1Egoitz Arruti2Department of Electronics and Computer Science, University of Mondragon, 20500 Mondragon, SpainDepartment of Electronics and Computer Science, University of Mondragon, 20500 Mondragon, SpainDepartment of Electronics and Computer Science, University of Mondragon, 20500 Mondragon, SpainThe nonlinear vector precoding (VP) technique has been proven to achieve close-to-capacity performance in multiuser multiple-input 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.http://dx.doi.org/10.1155/2013/496013 |
| spellingShingle | Maitane Barrenechea Mikel Mendicute Egoitz Arruti Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding International Journal of Reconfigurable Computing |
| title | Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding |
| title_full | Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding |
| title_fullStr | Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding |
| title_full_unstemmed | Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding |
| title_short | Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding |
| title_sort | fully pipelined implementation of tree search algorithms for vector precoding |
| url | http://dx.doi.org/10.1155/2013/496013 |
| work_keys_str_mv | AT maitanebarrenechea fullypipelinedimplementationoftreesearchalgorithmsforvectorprecoding AT mikelmendicute fullypipelinedimplementationoftreesearchalgorithmsforvectorprecoding AT egoitzarruti fullypipelinedimplementationoftreesearchalgorithmsforvectorprecoding |