{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:55:27Z","timestamp":1730206527515,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/cicc.2010.5617463","type":"proceedings-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T20:53:49Z","timestamp":1289422429000},"page":"1-4","source":"Crossref","is-referenced-by-count":2,"title":["A 2.6Gb\/s 1.56mm&lt;sup&gt;2&lt;\/sup&gt; near-optimal MIMO detector in 0.18&amp;#x00B5;m CMOS"],"prefix":"10.1109","author":[{"family":"Tae-Hwan Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"In-Cheol Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/ISIT.2008.4595340"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/JSSC.2005.847505"},{"key":"ref10","first-page":"307","article-title":"Sorting networks and their applications","volume":"32","author":"batcher","year":"1968","journal-title":"Proc AFIPS Spring Joint Computer Conf"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/JSAC.2005.862402"},{"key":"ref5","first-page":"1151","article-title":"K-best MIMO detection VLSI architectures achieving up to 424Mbps","author":"wenk","year":"2006","journal-title":"Proc Intl Symp Circuits and Systems"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/ICC.2003.1204433"},{"key":"ref7","first-page":"256","article-title":"A 0.13? CMOS 655Mb\/S 4&#x00D7;4 16-QAM K-best MIMO detector","author":"shabany","year":"2009","journal-title":"Proc Intl Solid-State Circuits Conf"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TSP.2005.850352"},{"key":"ref9","first-page":"2022","article-title":"Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels","author":"okawado","year":"2008","journal-title":"Proc IEEE Int Symp Inf Theory"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/MCOM.2002.1031841"}],"event":{"name":"2010 IEEE Custom Integrated Circuits Conference -CICC 2010","start":{"date-parts":[[2010,9,19]]},"location":"San Jose, CA, USA","end":{"date-parts":[[2010,9,22]]}},"container-title":["IEEE Custom Integrated Circuits Conference 2010"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5605059\/5617377\/05617463.pdf?arnumber=5617463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,19]],"date-time":"2017-03-19T04:01:56Z","timestamp":1489896116000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5617463\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/cicc.2010.5617463","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}