{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:31:11Z","timestamp":1781105471751,"version":"3.54.1"},"reference-count":26,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,1,1]]},"abstract":"<p>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.<\/p>","DOI":"10.4018\/jertcs.2012010102","type":"journal-article","created":{"date-parts":[[2012,4,3]],"date-time":"2012-04-03T11:25:04Z","timestamp":1333452304000},"page":"31-48","source":"Crossref","is-referenced-by-count":1,"title":["Design and Implementation of a Low-Complexity Multiuser Vector Precoder"],"prefix":"10.4018","volume":"3","author":[{"given":"Maitane","family":"Barrenechea","sequence":"first","affiliation":[{"name":"University of Mondrag\u00f3n, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luis","family":"Barbero","sequence":"additional","affiliation":[{"name":"Queen\u2019s University Belfast, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikel","family":"Mendicute","sequence":"additional","affiliation":[{"name":"University of Mondrag\u00f3n, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John S.","family":"Thompson","sequence":"additional","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jertcs.2012010102-0","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096023"},{"key":"jertcs.2012010102-1","doi-asserted-by":"crossref","unstructured":"Barbero, L. (2006). Rapid prototyping of a fixed-complexity sphere decoder and its application to iterative decoding of turbo-MIMO systems (Unpublished doctoral dissertation). University of Edinburgh, Edinburgh, UK.","DOI":"10.1109\/ICC.2006.255278"},{"key":"jertcs.2012010102-2","doi-asserted-by":"crossref","unstructured":"Barrenechea, M., Barbero, L., Jim\u00e9nez, I., Arruti, E., & Mendicute, M. (2011). High-throughput implementation of tree-search algorithms for vector precoding. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (pp. 1689-1692).","DOI":"10.1109\/ICASSP.2011.5946825"},{"key":"jertcs.2012010102-3","doi-asserted-by":"crossref","unstructured":"Barrenechea, M., Mendicute, M., Del Ser, J., & Thompson, J. S. (2009). Wiener filter-based fixed-complexity vector precoding for the MIMO downlink channel. In Proceedings of the IEEE Signal Processing Advances in Wireless Communications (pp. 216-220).","DOI":"10.1109\/SPAWC.2009.5161778"},{"key":"jertcs.2012010102-4","doi-asserted-by":"crossref","unstructured":"Bhagawat, P., Wang, P., Uppal, M., Choi, G., Xiong, Z., Yeary, M., & Harris, A. (2008). An FPGA implementation of dirty paper precoder. In Proceedings of the IEEE International Conference on Communications (pp. 2761-2766).","DOI":"10.1109\/ICC.2007.459"},{"key":"jertcs.2012010102-5","doi-asserted-by":"crossref","unstructured":"Burg, A., Seethaler, D., & Matz, G. (2007). VLSI implementation of a lattice-reduction algorithm for multi-antenna broadcast precoding. In Proceedings of the IEEE International Symposium on Circuits and Systems (pp. 673-676).","DOI":"10.1109\/ISCAS.2007.377898"},{"key":"jertcs.2012010102-6","unstructured":"Burg, A. P. (2006). VLSI Circuits for MIMO Communication Systems (Unpublished doctoral dissertation). ETH Zurich, Zurich, Switzerland."},{"key":"jertcs.2012010102-7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056659"},{"key":"jertcs.2012010102-8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.817444"},{"key":"jertcs.2012010102-9","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1985-0777278-8"},{"key":"jertcs.2012010102-10","unstructured":"Fischer, R. F. H., Windpassinger, C., Lampe, A., & Huber, J. B. (2002). Space-time transmission using Tomlinson-Harashima precoding. In Proceedings of the 4th ITG Conference on Source and Channel Coding (Vol. 170, pp. 139-147)."},{"key":"jertcs.2012010102-11","doi-asserted-by":"crossref","unstructured":"Habendorf, R., & Fettweis, G. (2007). Vector precoding with bounded complexity. In Proceedings of the IEEE Workshop on Signal Processing Advances in Wireless Communications (pp. 186-190).","DOI":"10.1109\/SPAWC.2007.4401310"},{"key":"jertcs.2012010102-12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1972.1091221"},{"key":"jertcs.2012010102-13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.841997"},{"key":"jertcs.2012010102-14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.850331"},{"issue":"4","key":"jertcs.2012010102-15","first-page":"513","article-title":"Factoring polynomials with rational coefficients.","volume":"216","author":"A. K.Lenstra","year":"1982","journal-title":"Mathematische Annalen"},{"key":"jertcs.2012010102-16","doi-asserted-by":"crossref","unstructured":"Mondal, S., Ali, W., & Salama, K. (2008). A novel approach for K-Best MIMO detection and its VLSI implementation. In Proceedings of the IEEE International Symposium on Circuits and Systems (pp. 936-939).","DOI":"10.1109\/ISCAS.2008.4541573"},{"key":"jertcs.2012010102-17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.840638"},{"key":"jertcs.2012010102-18","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1192"},{"key":"jertcs.2012010102-19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581144"},{"key":"jertcs.2012010102-20","doi-asserted-by":"publisher","DOI":"10.1049\/el:19710089"},{"key":"jertcs.2012010102-21","doi-asserted-by":"publisher","DOI":"10.1109\/18.771234"},{"key":"jertcs.2012010102-22","doi-asserted-by":"crossref","unstructured":"Wenk, M., Zellweger, M., Burg, A., Felber, N., & Fichtner, W. (2006). K-Best MIMO detection VLSI architectures achieving up to 424 Mbps. In Proceedings of the IEEE International Symposium on Circuits and Systems (pp. 1150-1154).","DOI":"10.1109\/ISCAS.2006.1692794"},{"key":"jertcs.2012010102-23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.838732"},{"key":"jertcs.2012010102-24","doi-asserted-by":"publisher","DOI":"10.1049\/el:20010899"},{"key":"jertcs.2012010102-25","unstructured":"Zhang, J., & Kim, K. J. (2005). Near-capacity MIMO multiuser precoding with QRD-M algorithm. In Proceedings of the Asilomar Conference on Signals, Systems, and Computers (Vol. 1, pp. 1498-1502)."}],"container-title":["International Journal of Embedded and Real-Time Communication Systems"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=62991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:15:28Z","timestamp":1654092928000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jertcs.2012010102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,1,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jertcs.2012010102","relation":{},"ISSN":["1947-3176","1947-3184"],"issn-type":[{"value":"1947-3176","type":"print"},{"value":"1947-3184","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,1]]}}}