{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T16:29:20Z","timestamp":1779380960589,"version":"3.53.1"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 107-2221-E007-017-MY3"],"award-info":[{"award-number":["MOST 107-2221-E007-017-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Chip Implementation Center, Taiwan"},{"name":"NOVATEK Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2896012","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T20:36:20Z","timestamp":1548794180000},"page":"20302-20315","source":"Crossref","is-referenced-by-count":18,"title":["An Efficient High-Rate Non-Binary LDPC Decoder Architecture With Early Termination"],"prefix":"10.1109","volume":"7","author":[{"given":"Mao-Ruei","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei-Xiang","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huang-Chang","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3438-0385","authenticated-orcid":false,"given":"Yeong-Luh","family":"Ueng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2017.2677518"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595129"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.050813.120489"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2014.2344113"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2014.2377194"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2016.2514484"},{"key":"ref16","article-title":"Algorithm and architecture designs for efficient layered LDPC decoder","author":"li","year":"2018"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1109\/TVLSI.2017.2775646","article-title":"Basic-set trellis Min–Max decoder architecture for nonbinary LDPC codes with high-order Galois fields","volume":"26","author":"thi","year":"2018","journal-title":"IEEE Trans Very Large Scale Integr (VLSI) Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.070313"},{"key":"ref19","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":"ref4","first-page":"70","article-title":"Fast decoding algorithm for LDPC over GF(\n$2^{q}$\n)","author":"barnault","year":"2003","journal-title":"Proc IEEE Inf Theory Workshop"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.09.070644"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2256905"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312606"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.894088"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2012.2190668"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/4234.681360"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2014.2362854"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2010.2071830"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08629018.pdf?arnumber=8629018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T06:53:02Z","timestamp":1643266382000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8629018\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2896012","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}