{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:17:02Z","timestamp":1753881422714,"version":"3.41.2"},"reference-count":15,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T00:00:00Z","timestamp":1525305600000},"content-version":"vor","delay-in-days":122,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61771066","61671080"],"award-info":[{"award-number":["61771066","61671080"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>In this paper, a three\u2010dimensional polar code (3D\u2010PC) scheme is proposed to improve the error floor performance of parallel concatenated systematic polar code (PCSPC). The proposed 3D\u2010PC is constructed by serially concatenating the PCSPC with a rate\u20101 third dimension, where only a fraction <jats:italic>\u03bb<\/jats:italic> of parity bits of PCSPC are extracted to participate in the subsequent encoding. It takes full advantage of the characteristics of parallel concatenation and serial concatenation. In addition, the convergence behavior of 3D\u2010PC is analyzed by the extrinsic information transfer (EXIT) chart. The convergence loss between PCSPC (<jats:italic>\u03bb<\/jats:italic> = 0) and different <jats:italic>\u03bb<\/jats:italic> provides the reference for choosing the value of <jats:italic>\u03bb<\/jats:italic> for 3D\u2010PC. Finally, the simulation results confirm that the proposed 3D\u2010PC scheme lowers the error floor.<\/jats:p>","DOI":"10.1155\/2018\/8928761","type":"journal-article","created":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T23:41:44Z","timestamp":1525390904000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adding a Rate\u20101 Third Dimension to Parallel Concatenated Systematic Polar Code: 3D Polar Code"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4045-7481","authenticated-orcid":false,"given":"Zhenzhen","family":"Liu","sequence":"first","affiliation":[]},{"given":"Kai","family":"Niu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4922-7762","authenticated-orcid":false,"given":"Chao","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Jiaru","family":"Lin","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2018,5,3]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1049\/el.2015.2592"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2011.061611.110862"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2502246"},{"key":"e_1_2_9_4_2","doi-asserted-by":"crossref","unstructured":"BerrouC. GlavieuxA. andThitimajshimaP. Near Shannon limit error-correcting coding and encoding: turbo-codes Proceedings of the IEEE International Conference on Communications May 1993 Geneve Switzerland 1064\u20131070 2-s2.0-0027297425.","DOI":"10.1109\/ICC.1993.397441"},{"key":"e_1_2_9_5_2","doi-asserted-by":"crossref","unstructured":"BerrouC. Graell i AmatA. MouhamedouY. O. C. DouillardC. andSaouterY. Adding a rate-1 third dimension to turbo codes Proceedings of the 2007 IEEE Information Theory Workshop ITW 2007 September 2007 USA 156\u2013161 2-s2.0-46749090922 https:\/\/doi.org\/10.1109\/ITW.2007.4313066.","DOI":"10.1109\/ITW.2007.4313066"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.09.070521"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2133610"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.669119"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.081512.110872"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.080017"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140515"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.661117"},{"key":"e_1_2_9_15_2","doi-asserted-by":"crossref","unstructured":"WijesingheP. GunawardanaU. andLiyanapathiranaR. Low complexity MAP decoding of tailbiting convolutional codes Proceedings of the 2010 International Conference on Signal Processing and Communications SPCOM 2010 July 2010 India 2-s2.0-77958450178 https:\/\/doi.org\/10.1109\/SPCOM.2010.5560562.","DOI":"10.1109\/SPCOM.2010.5560562"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/8928761.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/8928761.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/8928761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T06:18:57Z","timestamp":1723011537000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/8928761"}},"subtitle":[],"editor":[{"given":"Zesong","family":"Fei","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/8928761"],"URL":"https:\/\/doi.org\/10.1155\/2018\/8928761","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2017-11-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-03-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8928761"}}