{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T08:49:31Z","timestamp":1746521371388,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,10,7]],"date-time":"2016-10-07T00:00:00Z","timestamp":1475798400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61006018","61370040"],"award-info":[{"award-number":["61006018","61370040"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Integration of Industry, Education and Research of Jiangsu Province","award":["BY2015069-08"],"award-info":[{"award-number":["BY2015069-08"]}]},{"DOI":"10.13039\/501100003347","name":"Fudan University","doi-asserted-by":"publisher","award":["12KF006"],"award-info":[{"award-number":["12KF006"]}],"id":[{"id":"10.13039\/501100003347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s11265-016-1181-y","type":"journal-article","created":{"date-parts":[[2016,10,7]],"date-time":"2016-10-07T03:28:03Z","timestamp":1475810883000},"page":"687-694","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Stage-Combined Belief Propagation Decoder for Polar Codes"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0266-3583","authenticated-orcid":false,"given":"Jin","family":"Sha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingbo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongfeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,7]]},"reference":[{"issue":"7","key":"1181_CR1","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Ar\u0131kan","year":"2009","unstructured":"Ar\u0131kan, E. (2009). Channel polarization: a method for constructing capacity- achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory, 55(7), 3051\u20133073.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1181_CR2","doi-asserted-by":"crossref","unstructured":"Tal, I., & Vardy, A. (2011). List decoding of polar codes. In Proc. IEEE Int. Symp. Inform. Theory, pp. 1\u20135.","DOI":"10.1109\/ISIT.2011.6033904"},{"key":"1181_CR3","doi-asserted-by":"crossref","unstructured":"Xiong,\u2009C., Lin, J., & Yan, Z. (2014). Symbol-based successive cancelation list decoder for polar codes. In Proc. IEEE Workshop on Signal Processing Systems (SiPS), Belfast, UK, October 2014, pp. 1\u20136.","DOI":"10.1109\/SiPS.2014.6986086"},{"issue":"3","key":"1181_CR4","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1109\/TSP.2015.2486750","volume":"64","author":"C Xiong","year":"2015","unstructured":"Xiong, C., Lin, J., & Yan, Z. (2015). Symbol-decision successive cancellation list decoder for polar codes. IEEE Transactions on Signal Processing, 64(3), 675\u2013687.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"6","key":"1181_CR5","first-page":"2378","volume":"24","author":"J Lin","year":"2016","unstructured":"Lin, J., Xiong, C., & Yan, Z. (2016). A high throughput list decoder architecture for polar codes. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 24(6), 2378\u20132391.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"key":"1181_CR6","unstructured":"Xiong,\u2009C., Lin, J., & Yan, Z. (2015). Efficient design of ML decoding units for polar list decoders. In Proc. IEEE Workshop on Signal\u00a0Process. Syst., Hangzhou, CN, Oct. 2015."},{"issue":"12","key":"1181_CR7","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1049\/el.2012.1459","volume":"48","author":"K Niu","year":"2012","unstructured":"Niu, K., & Chen, K. (2012). Stack decoding of polar codes. Electronics Letters, 48(12), 695\u2013697.","journal-title":"Electronics Letters"},{"issue":"5","key":"1181_CR8","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1109\/JSAC.2014.140514","volume":"32","author":"G Sarkis","year":"2014","unstructured":"Sarkis, G., Giard, P., Vardy, A., Thibeault, C., & Gross, W. J. (2014). Fast polar decoders: algorithm and implementation. IEEE Journal on Selected Areas in Communications, 32(5), 946\u2013957.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"2","key":"1181_CR9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TSP.2012.2223693","volume":"61","author":"C Leroux","year":"2013","unstructured":"Leroux, C., Raymond, A. J., Sarkis, G., & Gross, W. J. (2013). A semi-parallel successive-cancellation decoder for polar codes. IEEE Transactions on Signal Processing, 61(2), 289\u2013299.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"1181_CR10","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1109\/TCSI.2013.2283779","volume":"61","author":"B Yuan","year":"2014","unstructured":"Yuan, B., & Parhi, K. K. (2014). Low-latency successive-cancellation polar decoder architectures using 2-bit decoding. IEEE Transactions on Circuits and Systems-I, 61(4), 1241\u20131254.","journal-title":"IEEE Transactions on Circuits and Systems-I"},{"issue":"20","key":"1181_CR11","doi-asserted-by":"crossref","first-page":"5339","DOI":"10.1109\/TSP.2014.2347262","volume":"62","author":"AJ Raymond","year":"2014","unstructured":"Raymond, A. J., & Gross, W. (2014). A scalable successive-cancellation decoder for polar codes. IEEE Transactions on Signal Processing, 62(20), 5339\u20135347.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"1181_CR12","unstructured":"Mishra, A., Raymond, A., Amaru, L., Sarkis, G., Leroux, C., Meinerzhagen, P., Burg, A., & Gross, W. (2012). A successive cancellation decoder ASIC for a 1024-bit polar code in 180nm CMOS, Solid State Circuits Conference (A-SSCC), 2012 I.E. Asian, pp. 205\u2013208."},{"issue":"6","key":"1181_CR13","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1109\/LCOMM.2008.080017","volume":"12","author":"E Ar\u0131kan","year":"2008","unstructured":"Ar\u0131kan, E. (2008). A performance comparison of polar codes and reed-muller codes. IEEE Communications Letters, 12(6), 447\u2013449.","journal-title":"IEEE Communications Letters"},{"key":"1181_CR14","unstructured":"Park, Y., Tao, Y., Sun, S., & Zhang, Z. (2014). A 4.68 Gb\/s belief propagation Polar decoder with bit-splitting register file. In IEEE Symposium on VLSI Circuits, 2014."},{"issue":"24","key":"1181_CR15","doi-asserted-by":"crossref","first-page":"6496","DOI":"10.1109\/TSP.2014.2366712","volume":"62","author":"B Yuan","year":"2014","unstructured":"Yuan, B., & Parhi, K. K. (2014). Early stopping criteria for energy-efficient low-latency belief-propagation polar code decoders. IEEE Transactions on Signal Processing, 62(24), 6496\u20136506.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"5","key":"1181_CR16","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1109\/JSAC.2014.140515","volume":"32","author":"UU Fayyaz","year":"2014","unstructured":"Fayyaz, U. U., & Barry, J. R. (2014). Low-complexity soft-output decoding of polar codes. IEEE Journal on Selected Areas in Communications, 32(5), 958\u2013966.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"2","key":"1181_CR17","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"FR Kschischang","year":"2001","unstructured":"Kschischang, F. R., Frey, B. J., & Loeliger, H. (2001). Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2), 498\u2013519.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"1181_CR18","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/18.910573","volume":"47","author":"GD Forney Jr","year":"2001","unstructured":"Forney, G. D., Jr. (2001). Codes on graphs: normal realizations. IEEE Transactions on Information Theory, 47(2), 520\u2013548.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1181_CR19","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/49.661110","volume":"16","author":"FR Kschischang","year":"1998","unstructured":"Kschischang, F. R., & Frey, B. J. (1998). Iterative decoding of compound codes by probability propagation in graphical models. IEEE Journal on Selected Areas in Communications, 16, 219\u2013230.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"5","key":"1181_CR20","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/26.768759","volume":"47","author":"MPC Fossorier","year":"1999","unstructured":"Fossorier, M. P. C., Mihaljevic, M., & Imai, H. (1999). Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Transactions on Communications, 47(5), 673\u2013680.","journal-title":"IEEE Transactions on Communications"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-016-1181-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-016-1181-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-016-1181-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T10:37:05Z","timestamp":1525862225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-016-1181-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,7]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1181"],"URL":"https:\/\/doi.org\/10.1007\/s11265-016-1181-y","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"type":"print","value":"1939-8018"},{"type":"electronic","value":"1939-8115"}],"subject":[],"published":{"date-parts":[[2016,10,7]]}}}