{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:40:00Z","timestamp":1773376800431,"version":"3.50.1"},"reference-count":40,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10207002","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"316-321","source":"Crossref","is-referenced-by-count":6,"title":["Achieving Maximum-likelihood Detection Performance with Square-order Complexity in Large Quasi-Symmetric MIMO Systems"],"prefix":"10.1109","author":[{"given":"Jiuyu","family":"Liu","sequence":"first","affiliation":[{"name":"University of Surrey,5GIC and 6GIC, Institute for Communication Systems,Guildford,UK,GU2 7XH"}]},{"given":"Yi","family":"Ma","sequence":"additional","affiliation":[{"name":"University of Surrey,5GIC and 6GIC, Institute for Communication Systems,Guildford,UK,GU2 7XH"}]},{"given":"Rahim","family":"Tafazolli","sequence":"additional","affiliation":[{"name":"University of Surrey,5GIC and 6GIC, Institute for Communication Systems,Guildford,UK,GU2 7XH"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3124927"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2019.06.007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.817444"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.08.070153"},{"key":"ref5","first-page":"273","article-title":"A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels","volume-title":"Proc. IEEE Int. Symp. Circuits Sys. (ISCAS)","volume":"3","author":"wai Wong"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/springerreference_72440"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2618959"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2021.3056946"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414211"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3170510"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2475242"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2935810"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3121445"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2653119"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916359"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518123"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3077471"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3186166"},{"key":"ref20","article-title":"On orthogonal approximate message passing","author":"Liu","year":"2022"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/26.380095"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/26.950339"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/glocom.2005.1578473"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833345"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2018.8644126"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCWorkshops49005.2020.9145378"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3114380"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3235919"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.1900157"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841965"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.010413.120620"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2414413"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2699381"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3180552"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/VETECF.2009.5378677"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0227-2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.21236\/ADA633832"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511807213"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1049\/el.2018.6507"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM46510.2021.9685536"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10207002.pdf?arnumber=10207002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:24Z","timestamp":1773347304000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10207002\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10207002","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}