{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T12:05:29Z","timestamp":1761566729301,"version":"build-2065373602"},"reference-count":28,"publisher":"Institution of Engineering and Technology (IET)","issue":"12","license":[{"start":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T00:00:00Z","timestamp":1616716800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Communications"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Sorted QR decomposition (SQRD) has been extensively adopted for various multiple\u2010input\u2010multiple\u2010output (MIMO) detectors, in which the sorting process incurs severe latency when it comes to larger\u2010scale MIMO situations. This paper proposes a group\u2010SQRD (GSQRD) algorithm to alleviate the latency problem of general SQRD architectures for larger\u2010scale MIMO systems. Via predictively sorting a group of 4 columns at one stage, the GSQRD could eliminate the processing latency by 41% for decomposing 1616 complex\u2010valued matrices. Additionally, this percentage even rises up to 68% for decomposing 128128 matrices. To analyse the side effects, the GSQRD is applied in various MIMO detectors in a simulation link, which exhibits a negligible performance degradation for MIMO detection. Moreover, GSQRD is a hardware\u2010friendly algorithm because the division and square root operations in GSQRD are converted to multiplications for simplifying the hardware implementation. Based on this algorithm, two corresponding hardware architectures, which contains 2 and 4 columns respectively in a sorting group, are also implemented with 65\u2010nm CMOS technology. These architectures can work at 513 MHz to decompose 1616 complex\u2010valued matrices. The processing latencies are respectively 0.32 and 0.26 s, superior to the state\u2010of\u2010art\u00a0designs.<\/jats:p>","DOI":"10.1049\/cmu2.12168","type":"journal-article","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T03:31:59Z","timestamp":1616729519000},"page":"1548-1560","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Low latency group\u2010sorted QR decomposition algorithm for larger\u2010scale MIMO systems"],"prefix":"10.1049","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5972-1812","authenticated-orcid":false,"given":"Lirui","family":"Chen","sequence":"first","affiliation":[{"name":"National Laboratory for Parallel and Distributed Processing National University of Defense Technology  Changsha 410005 China"}]},{"given":"Yu","family":"Wang","sequence":"additional","affiliation":[{"name":"National Laboratory for Parallel and Distributed Processing National University of Defense Technology  Changsha 410005 China"}]},{"given":"Zuocheng","family":"Xing","sequence":"additional","affiliation":[{"name":"National Laboratory for Parallel and Distributed Processing National University of Defense Technology  Changsha 410005 China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6376-5268","authenticated-orcid":false,"given":"Shikai","family":"Qiu","sequence":"additional","affiliation":[{"name":"National Laboratory for Parallel and Distributed Processing National University of Defense Technology  Changsha 410005 China"}]},{"given":"Qinglin","family":"Wang","sequence":"additional","affiliation":[{"name":"National Laboratory for Parallel and Distributed Processing National University of Defense Technology  Changsha 410005 China"}]},{"given":"Yongzhong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science Changsha University  Changsha 410005 China"}]}],"member":"265","published-online":{"date-parts":[[2021,3,26]]},"reference":[{"key":"e_1_2_8_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.784"},{"key":"e_1_2_8_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6736761"},{"key":"e_1_2_8_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.900533"},{"key":"e_1_2_8_5_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2013.0694"},{"key":"e_1_2_8_6_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:20057074"},{"key":"e_1_2_8_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2013.2297435"},{"key":"e_1_2_8_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2799191"},{"key":"e_1_2_8_9_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:20010899"},{"key":"e_1_2_8_10_1","doi-asserted-by":"crossref","unstructured":"Wubben D.et\u00a0al.:MMSE\u2010based lattice\u2010reduction for near\u2010ML detection of MIMO systems. In:ITG Workshop on Smart Antennas pp.106\u2013113.IEEE Piscataway NJ(2004)","DOI":"10.1109\/WSA.2004.1407656"},{"key":"e_1_2_8_11_1","doi-asserted-by":"crossref","unstructured":"Di Wu D. Eilert J.:Lattice\u2010reduction aided multi\u2010user STBC decoding with resource constraints. In:2007 IEEE 18th International Symposium on Personal Indoor and Mobile Radio Communications pp.1\u20135.IEEE Piscataway NJ(2007)","DOI":"10.1109\/PIMRC.2007.4394554"},{"key":"e_1_2_8_12_1","doi-asserted-by":"crossref","unstructured":"Kurniawan I.H. Yoon J. Park J.:Multidimensional householder based high\u2010speed QR decomposition architecture for MIMO receivers. In:2013 IEEE International Symposium on Circuits and Systems pp.2159\u20132162.IEEE Piscataway NJ(2013)","DOI":"10.1109\/ISCAS.2013.6572302"},{"key":"e_1_2_8_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.403715"},{"issue":"3","key":"e_1_2_8_14_1","first-page":"1281","article-title":"Low\u2010complexity sorted QR decomposition for MIMO systems based on pairwise column symmetrization","volume":"13","author":"Kim T.H.","year":"2014","journal-title":"IEEE Wireless Communications and Networking Conference"},{"key":"e_1_2_8_15_1","doi-asserted-by":"crossref","unstructured":"Miyaoka Y.et\u00a0al.:Sorted QR decomposition for high\u2010speed MMSE MIMO detection based wireless communication systems. In:2012 IEEE International Symposium on Circuits and Systems pp.2857\u20132860.IEEE Piscataway NJ(2012)","DOI":"10.1109\/ISCAS.2012.6271909"},{"key":"e_1_2_8_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPHOT.2016.2580938"},{"key":"e_1_2_8_17_1","doi-asserted-by":"crossref","unstructured":"Ren Y. He G. Ma J.:High\u2010throughput sorted MMSE QR decomposition for MIMO detection. In:2012 IEEE International Symposium on Circuits and Systems pp.2845\u20132848.IEEE Piscataway NJ(2012)","DOI":"10.1109\/ISCAS.2012.6271904"},{"key":"e_1_2_8_18_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2016.0789"},{"key":"e_1_2_8_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2011.2123770"},{"key":"e_1_2_8_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-017-1231-0"},{"key":"e_1_2_8_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2357991"},{"issue":"1","key":"e_1_2_8_22_1","first-page":"21","article-title":"Elementary functions: algorithms and implementation","volume":"34","author":"Jean\u2010Michel M.","year":"2006","journal-title":"Mathematics & Computer Education"},{"key":"e_1_2_8_23_1","doi-asserted-by":"crossref","unstructured":"Shabany M. Gulak P.G.:The application of lattice\u2010reduction to the K\u2010Best algorithm for near\u2010optimal MIMO detection. In:2008 IEEE International Symposium on Circuits and Systems pp.316\u2013319.IEEE Piscataway NJ(2008)","DOI":"10.1109\/ISCAS.2008.4541418"},{"key":"e_1_2_8_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2475242"},{"key":"e_1_2_8_25_1","doi-asserted-by":"crossref","unstructured":"Bruderer L.et\u00a0al.:VLSI implementation of a low\u2010complexity LLL lattice reduction algorithm for MIMO detection. In:Proceedings of 2010 IEEE International Symposium on Circuits and Systems pp.3745\u20133748.IEEE Piscataway NJ(2010)","DOI":"10.1109\/ISCAS.2010.5537742"},{"key":"e_1_2_8_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/APCCAS.2016.7803953"},{"key":"e_1_2_8_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2015.2479055"},{"key":"e_1_2_8_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2017.2658729"},{"key":"e_1_2_8_29_1","doi-asserted-by":"crossref","unstructured":"Luethi P.et\u00a0al.:VLSI implementation of a high\u2010speed iterative sorted MMSE QR decomposition. In:2007 IEEE International Symposium on Circuits and Systems pp.1421\u20131424.IEEE Piscataway NJ(2007)","DOI":"10.1109\/ISCAS.2007.378495"}],"container-title":["IET Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/cmu2.12168","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1049\/cmu2.12168","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/cmu2.12168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:50:11Z","timestamp":1761562211000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/cmu2.12168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,26]]},"references-count":28,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["10.1049\/cmu2.12168"],"URL":"https:\/\/doi.org\/10.1049\/cmu2.12168","archive":["Portico"],"relation":{},"ISSN":["1751-8628","1751-8636"],"issn-type":[{"type":"print","value":"1751-8628"},{"type":"electronic","value":"1751-8636"}],"subject":[],"published":{"date-parts":[[2021,3,26]]},"assertion":[{"value":"2020-03-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-03","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}