{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:07:07Z","timestamp":1773655627385,"version":"3.50.1"},"reference-count":41,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>This article presents the performance analysis and comparison of turbo codes for several interleavers with short blockchains. According to the symmetry concept, turbo codes consist of two symmetric convolutional codes preceded by an interleaver. Some interleavers can be described by symmetric 3 \u00d7 3 generator matrices, whereas others are represented through symmetric matrices in which the nonzero terms in the matrix are monomials. Interest in short blockchains has grown over the years because of their use in emerging applications that require the transmission of data units in the order of hundred bits. In this research, interleavers used are random interleaver, semi-random interleaver, quadratic polynomial permutation (QPP) interleaver, and chaotic Lozi map interleaver. For each interleaver, the turbo code is assessed with at least two short data distances; then, the interleavers are compared against each other. The performance of turbo codes is assessed based on bit error rate, particularly with lengths between 64 and 512 bits. Additionally, an interleaver based on Duffing chaotic maps is proposed, whose deterministic nature provides an advantage, and the performance results are presented, achieving excellent BER values for 64 bits. With these results, the effect of the interleaver on turbo codes and particularly on short block length interleavers, is studied.<\/jats:p>","DOI":"10.3390\/sym14122529","type":"journal-article","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T05:45:22Z","timestamp":1669787122000},"page":"2529","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Design of Chaotic Interleaver Based on Duffing Map for Turbo Code"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7197-8928","authenticated-orcid":false,"given":"Claudio","family":"Urrea","sequence":"first","affiliation":[{"name":"Electrical Engineering Department, Faculty of Engineering, University of Santiago of Chile, Las Sophoras 165, Estaci\u00f3n Central, Santiago 9170124, Chile"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1958-7289","authenticated-orcid":false,"given":"John","family":"Kern","sequence":"additional","affiliation":[{"name":"Electrical Engineering Department, Faculty of Engineering, University of Santiago of Chile, Las Sophoras 165, Estaci\u00f3n Central, Santiago 9170124, Chile"}]},{"given":"Ricardo","family":"L\u00f3pez-Escobar","sequence":"additional","affiliation":[{"name":"Electrical Engineering Department, Faculty of Engineering, University of Santiago of Chile, Las Sophoras 165, Estaci\u00f3n Central, Santiago 9170124, Chile"}]}],"member":"1968","published-online":{"date-parts":[[2022,11,30]]},"reference":[{"key":"ref_1","unstructured":"Berrou, C., Glavieux, A., and Thitimajshima, P. (1993, January 23\u201326). Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1. Proceedings of the ICC\u201993\u2014IEEE International Conference on Communications, Geneva, Switzerland."},{"key":"ref_2","unstructured":"(2021, October 08). 3GPP TS 36.212 V8.3.0 3rd Generation Partnership Project, Multiplexing and Channel Coding (Release 8). Available online: http:\/\/www.etsi.org."},{"key":"ref_3","unstructured":"ETSI (2012). E-UTRA Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and Channel Coding, ETSI. Technical Specification; 3GPP TS 36.212 version 11.6.0. release 11."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/s11235-019-00630-3","article-title":"A survey on channel coding techniques for 5G wireless networks","volume":"73","author":"Arora","year":"2019","journal-title":"Telecommun. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/CC.2014.7004525","article-title":"Application scenarios and enabling technologies of 5G","volume":"11","author":"Yuan","year":"2014","journal-title":"China Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1109\/COMST.2019.2910817","article-title":"5G Waveforms for IoT Applications","volume":"21","author":"Mendes","year":"2019","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/MCOM.2014.6736746","article-title":"Five disruptive technology directions for 5G","volume":"52","author":"Boccardi","year":"2014","journal-title":"IEEE Commun. Mag."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/MCOM.2015.7120031","article-title":"Coded random access: Applying codes on graphs to design random access protocols","volume":"53","author":"Paolini","year":"2015","journal-title":"IEEE Commun. Mag."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1109\/JPROC.2016.2537298","article-title":"Toward Massive, Ultrareliable, and Low-Latency Wireless Communication with Short Packets","volume":"104","author":"Durisi","year":"2016","journal-title":"Proc. IEEE"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1736","DOI":"10.1080\/03772063.2019.1670104","article-title":"Performance Analysis of Reliability-Based Decoding Algorithm for Short Block Length Turbo Codes","volume":"68","author":"Salija","year":"2019","journal-title":"IETE J. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.phycom.2019.03.004","article-title":"Efficient error-correcting codes in the short blocklength regime","volume":"34","author":"Durisi","year":"2019","journal-title":"Phys. Commun."},{"key":"ref_12","unstructured":"Oestman, J., Durisi, G., Stroem, E.G., Li, J., Sahlin, H., and Liva, G. (2017, January 6\u20139). Low-latency Ultra-Reliable 5G Communications: Finite-Blocklength Bounds and Coding Schemes. Proceedings of the SCC 2017: 11th International ITG Conference on Systems, Communications and Coding, Hamburg, Germany."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1109\/MCOM.2018.1800181","article-title":"Short Block-Length Codes for Ultra-Reliable Low Latency Communications","volume":"57","author":"Shirvanimoghaddam","year":"2019","journal-title":"IEEE Commun. Mag."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Van Wonterghem, J., Alloum, A., Moeneclaey, M., Van Wonterghem, J., Alloum, A., Boutros, J.J., and Moeneclaey, M. (June, January 31). On Performance and Complexity of OSD for Short Error Correcting Codes in 5G-NR. Proceedings of the BalkanCom 2017: First International Balkan Conference on Communications and Networking, Tirana, Albania.","DOI":"10.1016\/j.adhoc.2018.06.005"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Al Bechlawi, C., and Guilloud, F. (2015, January 11\u201314). Frame length reduction for massive-machine communications. Proceedings of the IEEE 81st Vehicular Technology Conference, Glasgow, UK.","DOI":"10.1109\/VTCSpring.2015.7145846"},{"key":"ref_16","first-page":"457","article-title":"Near Shannon limit performance of low density parity check codes","volume":"33","author":"MacKay","year":"1996","journal-title":"Comput. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","volume":"55","author":"Arikan","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","unstructured":"Maunder, R.G. (2016). The 5G Channel Code Contenders, ACCELERCOMM."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/18.910576","article-title":"Improved low-density parity-check codes using irregular graphs","volume":"47","author":"Luby","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"101212","DOI":"10.1016\/j.phycom.2020.101212","article-title":"Further upper bounds on the minimum distance for turbo codes using CPP interleavers","volume":"43","author":"Trifina","year":"2020","journal-title":"Phys. Commun."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1698","DOI":"10.1109\/18.556666","article-title":"A distance spectrum interpretation of turbo codes","volume":"42","author":"Ferez","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Jerkovits, T., and Matuz, B. (2016, January 5\u20137). Turbo code design for short blocks. Proceedings of the 2016 8th Advanced Satellite Multimedia Systems Conference and 14th Signal Processing for Space Communications Workshop, ASMS\/SPSC 2016, Palma de Mallorca, Spain.","DOI":"10.1109\/ASMS-SPSC.2016.7601543"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Trifina, L., Ryu, J., and Tarniceriu, D. (2017, January 13\u201314). Up to five degree permutation polynomial interleavers for short length LTE turbo codes with optimum minimum distance. Proceedings of the ISSCS 2017\u2014International Symposium on Signals, Circuits and Systems, Iasi, Romania.","DOI":"10.1109\/ISSCS.2017.8034883"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1833","DOI":"10.1109\/TCOMM.2017.2783971","article-title":"Protograph-Based Interleavers for Punctured Turbo Codes","volume":"66","author":"Nour","year":"2018","journal-title":"IEEE Trans. Commun."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Sreedevi, M., Yamuna, B., and Salija, P. (2019, January 6\u20138). Design and implementation of interleaver in GNU radio for short block length turbo codes. Proceedings of the 2019 9th International Conference on Advances in Computing and Communication, ICACC 2019, Kochi, India.","DOI":"10.1109\/ICACC48162.2019.8986185"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s11235-020-00723-4","article-title":"Upper bounds on the minimum distance for turbo codes using CPP interleavers","volume":"76","author":"Trifina","year":"2021","journal-title":"Telecommun. Syst."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"3799","DOI":"10.1016\/j.jfranklin.2016.04.007","article-title":"Performance of turbo-coded chaotic interleaving and frequency-domain equalization scheme for high speed OFDM-based PLC systems","volume":"353","author":"Himeur","year":"2016","journal-title":"J. Franklin Inst."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Abderrahmane, L.H., Bacha, M., and Mebrek, A. (2014, January 4\u20137). A new optimised interleaver structure for turbo coding. Proceedings of the 2014 IEEE 27th Canadian Conference on Electrical and Computer Engineering (CCECE), Toronto, ON, Canada.","DOI":"10.1109\/CCECE.2014.6900945"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1933","DOI":"10.1016\/j.dsp.2013.08.001","article-title":"Performance enhancement of power line communication systems with efficient low density parity-check codes, noise removal, equalization, and chaotic interleaving","volume":"23","author":"Shebl","year":"2013","journal-title":"Digit. Signal Process."},{"key":"ref_30","unstructured":"ITU-T (1996). P Series: Telephone Transmission Quality, ITU-T."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Heegard, C., and Wicker, S.B. (1999). Introduction. Turbo Coding, Springer.","DOI":"10.1007\/978-1-4757-2999-3"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Hanzo, L., Liew, T.H., Yeap, B.L., Tee, R.Y.S., and Ng, S.X. (2011). Turbo Coding, Turbo Equalisation and Space-Time Coding: EXIT-Chart-Aided Near-Capacity Designs for Wireless Channels, Wiley-IEEE Press. [2nd ed.].","DOI":"10.1002\/9780470978481"},{"key":"ref_33","unstructured":"Divsalar, D., and Pollara, F. (1995, January 17\u201322). Low-rate turbo codes for deep-space communications. Proceedings of the Proceedings of 1995 IEEE International Symposium on Information Theory, Whistler, BC, Canada."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/s42452-021-04147-w","article-title":"On the performance of chaotic interleaver for turbo codes","volume":"3","author":"Sahnoune","year":"2021","journal-title":"SN Appl. Sci."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TIT.2004.839478","article-title":"Interleavers for turbo codes using permutation polynomials over integer rings","volume":"51","author":"Sun","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_36","unstructured":"ETSI (2010). 3GPP TS 36.212 v8.0.0 Multiplexing and Channel Coding (FDD) (Release 8), ETSI."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"3097","DOI":"10.1016\/j.jfranklin.2020.02.031","article-title":"Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers","volume":"357","author":"Trifina","year":"2020","journal-title":"J. Franklin Inst."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Sharma, S., Sau, P.C., and Shukla, A. (2014, January 7\u20139). Performance analysis of S-Random interleaver for IDMA system using MRRC diversity scheme. Proceedings of the 2014 7th International Conference on Contemporary Computing, IC3 2014, Noida, India.","DOI":"10.1109\/IC3.2014.6897181"},{"key":"ref_39","unstructured":"Crozier, S. (2000, January 28\u201331). New high-spread high-distance interleavers for turbo-codes. Proceedings of the 20th Biennial Symposium on Communications, Kingston, ON, Canada."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/j.compeleceng.2007.10.009","article-title":"Design of two step deterministic interleaver for turbo codes","volume":"34","author":"Arif","year":"2008","journal-title":"Comput. Electr. Eng."},{"key":"ref_41","unstructured":"(2022, November 08). MathWorks MatLab Documentation. Available online: https:\/\/la.mathworks.com\/help\/matlab\/."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/12\/2529\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:30:15Z","timestamp":1760146215000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/12\/2529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,30]]},"references-count":41,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["sym14122529"],"URL":"https:\/\/doi.org\/10.3390\/sym14122529","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,30]]}}}