{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T00:16:28Z","timestamp":1715300188961},"reference-count":30,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Electron. Express"],"published-print":{"date-parts":[[2022,1,25]]},"DOI":"10.1587\/elex.18.20210503","type":"journal-article","created":{"date-parts":[[2021,12,20]],"date-time":"2021-12-20T23:25:33Z","timestamp":1640042733000},"page":"20210503-20210503","source":"Crossref","is-referenced-by-count":0,"title":["An implementation of fast polar codes decoder with reducing internal memory and supporting flexible code rate"],"prefix":"10.1587","volume":"19","author":[{"given":"Ping","family":"Luo","sequence":"first","affiliation":[{"name":"Institute of Microelectronics of Chinese Academy of Sciences"},{"name":"University of Chinese Academy of Sciences"}]},{"given":"Wu","family":"Guan","sequence":"additional","affiliation":[{"name":"University of Posts and Telecommunications"}]},{"given":"Liping","family":"Liang","sequence":"additional","affiliation":[{"name":"University of Posts and Telecommunications"}]},{"given":"Xin","family":"Qiu","sequence":"additional","affiliation":[{"name":"Institute of Microelectronics of Chinese Academy of Sciences"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] E. Arikan: \u201cChannel polarization: a method for constructing capacity achieving codes for symmetric binary-input memoryless channels,\u201d IEEE Trans. Inf. Theory <b>55<\/b> (2009) 3051 (DOI: 10.1109\/TIT.2009.2021379).","DOI":"10.1109\/TIT.2009.2021379"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] C. Leroux, <i>et al.<\/i>: \u201cA semi-parallel successive-cancellation decoder for polar codes,\u201d IEEE Trans. Signal Process. <b>61<\/b> (2013) 289 (DOI: 10.1109\/TSP.2012.2223693).","DOI":"10.1109\/TSP.2012.2223693"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] A.J. Raymond and W.J. Gross: \u201cA scalable successive-cancellation decoder for polar codes,\u201d IEEE Trans. Signal Process. <b>62<\/b> (2014) 5339 (DOI: 10.1109\/TSP.2014.2347262).","DOI":"10.1109\/TSP.2014.2347262"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] B. Yuan and K.K. Parhi: \u201cLow-latency successive-cancellation polar decoder architectures using 2-bit decoding,\u201d IEEE Trans. Circuits Syst. I, Reg. Papers <b>61<\/b> (2014) 1241 (DOI: 10.1109\/TCSI.2013.2283779).","DOI":"10.1109\/TCSI.2013.2283779"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] R. Shrestha and A. Sahoo: \u201cHigh-speed and hardware-efficient successive cancellation polar-decoder,\u201d IEEE Trans. Circuits Syst. II, Exp. Briefs <b>66<\/b> (2019) 1144 (DOI: 10.1007\/s11265-018-1413-4).","DOI":"10.1109\/TCSII.2018.2877140"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] C. Zhag and K.K. Parhi: \u201cLatency analysis and architecture design of simplified SC polar decoders,\u201d IEEE Trans. Circuits Syst. II, Exp. Briefs. <b>61<\/b> (2014) 115 (DOI: 10.1109\/TCSII.2013.2291065).","DOI":"10.1109\/TCSII.2013.2291065"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] A. Alamdar-Yazdi and F.R. Kschischang: \u201cA simplified successive-cancellation decoder for polar codes,\u201d IEEE Commun. Lett. <b>15<\/b> (2011) 1378 (DOI: 10.1109\/LCOMM.2011.101811.111480).","DOI":"10.1109\/LCOMM.2011.101811.111480"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] G. Sarkis, <i>et al.<\/i>: \u201cFast polar decoders: algorithm and implementation,\u201d IEEE J. Sel. Areas Commun. <b>32<\/b> (2014) 946 (DOI: 10.1109\/JSAC.2014.140514).","DOI":"10.1109\/JSAC.2014.140514"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Y. Ren, <i>et al.<\/i>: \u201cEfficient belief propagation list decoding of polar codes,\u201d 2019 IEEE 13th International Conference on ASIC (ASICON) (2019) 1 (DOI: 10.1109\/ASICON47005.2019.8983597).","DOI":"10.1109\/ASICON47005.2019.8983597"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] S.M. Abbas, <i>et al.<\/i>: \u201cHigh-throughput andenergy-efficient belief propagation polar code decoder,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst. <b>25<\/b> (2017) 1098 (DOI: 10.1109\/TVLSI.2016.2620998).","DOI":"10.1109\/TVLSI.2016.2620998"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Y. Yan, <i>et al.<\/i>: \u201cAn implementation of belief propagation decoder with combinational logic reduced for polar codes,\u201d IEICE Electron. Express <b>16<\/b> (2019) 15 (DOI: 10.1587\/elex.16.20190382).","DOI":"10.1587\/elex.16.20190382"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] H. Ji, <i>et al.<\/i>: \u201cHardware implementation for belief propagation flip decoding of polar codes,\u201d IEEE Trans. Circuits Syst. I, Reg. Papers <b>68<\/b> (2021) 1330 (DOI: 10.1109\/TCSI.2020.3042597).","DOI":"10.1109\/TCSI.2020.3042597"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] J. Liu and J. Sha: \u201cFrozen bits selection for polar codes based on simulation and BP decoding,\u201d IEICE Electron. Express <b>14<\/b> (2017) 20170026 (DOI: 10.1587\/elex.14.20170026).","DOI":"10.1587\/elex.14.20170026"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Y. Shen, <i>et al.<\/i>: \u201cEnhanced belief propagation decoder for 5G polar codes with bit-flipping,\u201d IEEE Trans. Circuits Syst. II, Exp. Briefs <b>67<\/b> (2020) 901 (DOI: 10.1109\/TCSII.2020.2984536).","DOI":"10.1109\/TCSII.2020.2984536"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] L. Xiang, <i>et al.<\/i>: \u201cSoft list decoding of polar codes,\u201d IEEE Trans. Veh. Technol. <b>69<\/b> (2020) 13921 (DOI: 10.1109\/TVT.2020.3021258).","DOI":"10.1109\/TVT.2020.3021258"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] K. Wang, <i>et al.<\/i>: \u201cOptimized sorting network for successive cancellation list decoding of polar codes,\u201d IEICE Electron. Express <b>14<\/b> (2017) 18 (DOI: 10.1587\/elex.14.20170735).","DOI":"10.1587\/elex.14.20170735"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] I. Tal and A. Vardy: \u201cList decoding of polar codes,\u201d IEEE Trans. Inf. Theory <b>61<\/b> (2015) 2213 (DOI: 10.1109\/TIT.2015.2410251).","DOI":"10.1109\/TIT.2015.2410251"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] K. Niu and K. Chen: \u201cCRC-aided decoding of polar codes,\u201d IEEE Commun. Lett. <b>16<\/b> (2012) 1668 (DOI: 10.1109\/LCOMM.2012.090312.121501).","DOI":"10.1109\/LCOMM.2012.090312.121501"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] K. Niu and K. Chen: \u201cStack decoding of polar codes,\u201d Electron. Lett. <b>48<\/b> (2012) 695 (DOI: 10.1049\/el.2012.1459).","DOI":"10.1049\/el.2012.1459"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] Y. Yu, <i>et al.<\/i>: \u201cBelief propagation bit-flip decoder for polar codes,\u201d IEEE Access <b>7<\/b> (2019) 10937 (DOI: 10.1109\/ACCESS.2019.2891951).","DOI":"10.1109\/ACCESS.2019.2891951"},{"key":"21","unstructured":"[21] L. Dai, <i>et al.<\/i>: \u201cArchitecture optimizations for BP polar decoders,\u201d IEEE 3rd International Conference on Electronic Information and Communication Technology (ICEICT) (2020) 445 (DOI: 10.1109\/ICEICT51264.2020.9334270)."},{"key":"22","unstructured":"[22] Y. Yang, <i>et al.<\/i>: \u201cNoise-aided belief propagation list bit-flip decoder for polar codes,\u201d International Conference on Wireless Communications and Signal Processing (WCSP) (2020) 807 (DOI: 10.1109\/WCSP49889.2020.9299849)."},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] A. Elkelesh, <i>et al.<\/i>: \u201cBelief propagation list decoding of polar codes,\u201d IEEE Commun. Lett. <b>22<\/b> (2018) 1536 (DOI: 10.1109\/LCOMM.2018.2850772).","DOI":"10.1109\/LCOMM.2018.2850772"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] F. Ercan, <i>et al.<\/i>: \u201cEnergy-efficient hardware architectures for fast polar decoders,\u201d IEEE Trans. Circuits Syst. I, Reg. Papers <b>67<\/b> (2020) 322 (DOI: 10.1109\/TCSI.2019.2942833).","DOI":"10.1109\/TCSI.2019.2942833"},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] S.A. Hashemi, <i>et al.<\/i>: \u201cRate-flexible fast polar decoders,\u201d IEEE Trans. Signal Process. <b>67<\/b> (2019) 5689 (DOI: 10.1109\/TSP.2019.2944738).","DOI":"10.1109\/TSP.2019.2944738"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] S.A. Hashemi, <i>et al.<\/i>: \u201cRate-flexible fast polar decoders,\u201d 2019 IEEE Information Theory Workshop (ITW) (2019) 1 (DOI: 10.1109\/ITW44776.2019.8989275).","DOI":"10.1109\/ITW44776.2019.8989275"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] Y. Zhou, <i>et al.<\/i>: \u201cHigh-speed and hardware-efficient successive cancellation polar-decoder,\u201d IEEE Trans. Circuits Syst. II, Exp. Briefs <b>66<\/b> (2019) 227 (DOI: 10.1109\/TCSII.2018.2877140).","DOI":"10.1109\/TCSII.2018.2847441"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] F. Ercan, <i>et al.<\/i>: \u201cReduced-memory high-throughput fast-ssc polar code decoder architecture,\u201d Proc. IEEE Int. Workshop Signal Process. Syst. (SiPS) (2017) 1 (DOI: 10.1109\/SiPS.2017.8110014).","DOI":"10.1109\/SiPS.2017.8110014"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] F. Ercan, <i>et al.<\/i>: \u201cOperation merging for hardware implementations of fast polar decoders,\u201d J. Signal Process. Syst. <b>91<\/b> (2019) 995 (DOI: 10.1007\/s11265-018-1413-4).","DOI":"10.1007\/s11265-018-1413-4"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] G. Pascal, <i>et al.<\/i>: \u201cFast low-complexity decoders for low-rate polar codes,\u201d J. Signal Process. Syst. <b>90<\/b> (2018) 675 (DOI: 10.1007\/s11265-016-1173-y).","DOI":"10.1007\/s11265-016-1173-y"}],"container-title":["IEICE Electronics Express"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/elex\/19\/2\/19_18.20210503\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T05:01:27Z","timestamp":1715230887000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/elex\/19\/2\/19_18.20210503\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,25]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/elex.18.20210503","relation":{},"ISSN":["1349-2543"],"issn-type":[{"value":"1349-2543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,25]]},"article-number":"18.20210503"}}