{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:27:48Z","timestamp":1781886468458,"version":"3.54.5"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NEWCOM# NoE"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Circuits Syst. II"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/tcsii.2014.2350333","type":"journal-article","created":{"date-parts":[[2014,8,21]],"date-time":"2014-08-21T18:44:58Z","timestamp":1408646698000},"page":"890-894","source":"Crossref","is-referenced-by-count":9,"title":["A Parallel Radix-Sort-Based VLSI Architecture for Finding the First <inline-formula> <tex-math notation=\"TeX\">$W$<\/tex-math><\/inline-formula> Maximum\/Minimum Values"],"prefix":"10.1109","volume":"61","author":[{"given":"Guoping","family":"Xiao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maurizio","family":"Martina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guido","family":"Masera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gianluca","family":"Piccinini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/26.705396"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/VLSID.2007.19"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/TCSI.2009.2016171","article-title":"Min-sum decoder architectures with reduced word length for LDPC codes","volume":"57","author":"oh","year":"2010","journal-title":"IEEE Trans Circuits Syst I Reg Papers"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2012.2221216"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/26.768759"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.050813.120489"},{"key":"ref16","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":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2011.2174166"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2010.2090367"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2011.0310"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2013.2281554"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2013.2279186"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2010.2046249"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1049\/iet-com.2011.0217"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"ref5","first-page":"451","article-title":"$\\lambda$-min decoding algorithm of regular and irregular LDPC codes","author":"guilloud","year":"0","journal-title":"Proc Int Symp Turbo Codes Relat Topics"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2011.2148183"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.862402"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2012.2209292"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01267888"},{"key":"ref1","volume":"3","author":"knuth","year":"1998","journal-title":"The art of computer programming"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894088"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1049\/el.2010.0566"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SIPS.2008.4671728"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2010.2047956"},{"key":"ref24","author":"gunnam","year":"2007","journal-title":"Parallel VLSI architecture for layered decoding"},{"key":"ref23","first-page":"3953","article-title":"A 44 64-QAM reduced-complexity K-best MIMO detector up to 1.5 Gbps","author":"tsai","year":"0","journal-title":"Proc IEEE Int Symp Circuits Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2010.5537524"},{"key":"ref25","first-page":"3398","article-title":"Low-complexity and high-performance soft MIMO detecion based on distributed M-algorithm through trellis-diagram","author":"sun","year":"0","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"}],"container-title":["IEEE Transactions on Circuits and Systems II: Express Briefs"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8920\/6945398\/06881635.pdf?arnumber=6881635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:06:14Z","timestamp":1642003574000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6881635\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":29,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcsii.2014.2350333","relation":{},"ISSN":["1549-7747","1558-3791"],"issn-type":[{"value":"1549-7747","type":"print"},{"value":"1558-3791","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}