{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:50:24Z","timestamp":1760205024346,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ftirma Kurumu","doi-asserted-by":"publisher","award":["1160206"],"award-info":[{"award-number":["1160206"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Circuits Syst. II"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1109\/tcsii.2019.2922009","type":"journal-article","created":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T19:26:21Z","timestamp":1560194781000},"page":"655-659","source":"Crossref","is-referenced-by-count":4,"title":["A Complexity Reduction Method for Successive Cancellation List Decoding"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5849-6887","authenticated-orcid":false,"given":"Onur","family":"Dizdar","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2018.2847441"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2013.2291065"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541412"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2018.2811378"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.23919\/FPL.2017.8056843"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841865"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2016.2619324"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2740204"},{"article-title":"An FPGA implementation of successive cancellation list decoding for polar codes","year":"2016","author":"s\u00fcral","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSP.2016.7868549"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2016.2546904"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2014.6865102"},{"key":"ref16","first-page":"2378","article-title":"A high throughput list decoder architecture for polar codes","volume":"24","author":"lin","year":"2016","journal-title":"IEEE Trans Very Large Scale Integr (VLSI) Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2016.2557806"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2018.8351462"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS.2016.34"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2223693"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2439211"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2016.2530093"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2014.2359793"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2319773"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2014.2327336"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504318"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178128"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033904"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7471817"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2014.2378992"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2014.7094505"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2486750"},{"key":"ref24","first-page":"307","article-title":"Sorting networks and their applications","author":"batcher","year":"1968","journal-title":"Proc Spring Joint Comput Conf"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2011.2174166"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2015.7169066"},{"journal-title":"Multiplexer Design Techniques for Datapath Performance With Minimized Routing Resources","year":"2014","author":"chapman","key":"ref25"}],"container-title":["IEEE Transactions on Circuits and Systems II: Express Briefs"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8920\/9048013\/08734087.pdf?arnumber=8734087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T16:50:49Z","timestamp":1651078249000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8734087\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":35,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcsii.2019.2922009","relation":{},"ISSN":["1549-7747","1558-3791"],"issn-type":[{"type":"print","value":"1549-7747"},{"type":"electronic","value":"1558-3791"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}