{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:09:22Z","timestamp":1774966162348,"version":"3.50.1"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"IT R&D Program of MOTIE\/KEIT","award":["10035202"],"award-info":[{"award-number":["10035202"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Circuits Syst. II"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1109\/tcsii.2014.2362663","type":"journal-article","created":{"date-parts":[[2014,10,14]],"date-time":"2014-10-14T18:34:01Z","timestamp":1413311641000},"page":"61-64","source":"Crossref","is-referenced-by-count":37,"title":["Low-Complexity Tree Architecture for Finding the First Two Minima"],"prefix":"10.1109","volume":"62","author":[{"given":"Youngjoo","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bongjin","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaehwan","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"In-Cheol","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2013.2265314"},{"key":"ref3","year":"2009"},{"key":"ref10","first-page":"95","article-title":"A sorting-based architecture of finding the first two minimum values for LDPC decoding","author":"xie","year":"0","journal-title":"Proc IEEE CSPA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2220388"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"3430","DOI":"10.1109\/TCSI.2008.924892","article-title":"Algorithms of finding the first two minimum values and their hardware implementation","volume":"55","author":"wey","year":"2008","journal-title":"IEEE Trans Circuits Syst I Reg Papers"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2012.6364973"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2011.2174166"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2012.2215746"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2014.2304660"},{"key":"ref2","year":"2009"},{"key":"ref9","author":"knuth","year":"1998","journal-title":"The art of computer programming"},{"key":"ref1","year":"2009"}],"container-title":["IEEE Transactions on Circuits and Systems II: Express Briefs"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8920\/7001113\/06922514.pdf?arnumber=6922514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:59:30Z","timestamp":1642003170000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6922514\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":12,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcsii.2014.2362663","relation":{},"ISSN":["1549-7747","1558-3791"],"issn-type":[{"value":"1549-7747","type":"print"},{"value":"1558-3791","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}