{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T09:47:27Z","timestamp":1753868847227,"version":"3.41.2"},"reference-count":31,"publisher":"Wiley","issue":"14","license":[{"start":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:00:00Z","timestamp":1626134400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Int J Communication"],"published-print":{"date-parts":[[2021,9,25]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>The power limitation is the predominant challenge for achieving a reliable communication transmission for aerospace systems. Therefore, it is appealing to use robust channel coding techniques with a low decoding complexity. The robust forward error correction scheme that uses a Reed\u2013Solomon as an outer code concatenated with a convolutional code as an inner code is an attractive scheme whose applications are widely used in wireless and space communications. However, iterative soft\u2010decision decoding of that concatenated code is still an open research challenge. This paper proposes a reduced complexity iterative decoding algorithm for this concatenated coding scheme. The soft\u2010output adaptive Viterbi algorithm with a dynamic discarding threshold has been adopted to decode the inner convolutional code while the outer decoder will be based on a bit\u2010level modified Chase algorithm. We have used the Hamming metric instead of the Euclidean metric, which is not only much less complex but also overcomes the lack of channel information on the outer decoder input. Simulation results using the proposed soft information exchange decoding mechanism show that a considerable performance enhancement over the classical decoding scheme as well as a significant reduction in complexity over the existing decoding algorithms that use an iterative process to decode this concatenated coding scheme. The adaptive decoding of the inner convolutional code can gain a complexity reduction of 90<jats:italic>%<\/jats:italic>after 5 iterations compared to the soft\u2010output Viterbi algorithm while maintaining the small performance loss from the maximum a posteriori decoding algorithm.<\/jats:p>","DOI":"10.1002\/dac.4922","type":"journal-article","created":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T09:37:44Z","timestamp":1626169064000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Low complexity iterative decoding of Reed\u2013Solomon convolutional concatenated codes"],"prefix":"10.1002","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1120-3810","authenticated-orcid":false,"given":"Ramy","family":"Samy","sequence":"first","affiliation":[{"name":"Communication Division Space Technology Center Cairo Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashraf","family":"Mahran","sequence":"additional","affiliation":[{"name":"Avionics Department Military Technical College Cairo Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yahya","family":"Mohasseb","sequence":"additional","affiliation":[{"name":"Computer Engineering Department College of Engineering &amp; Technology, Arab Academy for Science, Technology and Maritime Transport Cairo Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,7,13]]},"reference":[{"key":"e_1_2_10_2_1","doi-asserted-by":"crossref","unstructured":"SchierJ RushJ VrotsosP WilliamsW.Space Communication Architecture Supporting Exploration and Science: Plans and Studies for 2010\u20102030 in 1st Space Exploration Conference: Continuing the Voyage of Discovery AIAA 2005\u20102517 2005.","DOI":"10.2514\/6.2005-2517"},{"key":"e_1_2_10_3_1","unstructured":"International Telecommunication Union ITU Radio Regulations 2016."},{"key":"e_1_2_10_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781119673811.ch5"},{"key":"e_1_2_10_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2842231"},{"key":"e_1_2_10_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.optcom.2019.02.071"},{"key":"e_1_2_10_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2587863"},{"volume-title":"Recommendation for Space Data System Standards, CCSDS 131.0\u2010B\u20103. Blue Book. Issue 3","year":"2017","author":"TM Synchronization and Channel Coding","key":"e_1_2_10_8_1"},{"key":"e_1_2_10_9_1","unstructured":"ForneyGD.Concatenated codes 1965."},{"volume-title":"Error Control Coding: Fundamentals and Applications","year":"2004","author":"Lin S","key":"e_1_2_10_10_1"},{"key":"e_1_2_10_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.539767"},{"key":"e_1_2_10_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.58746"},{"key":"e_1_2_10_13_1","doi-asserted-by":"crossref","unstructured":"AitsabO PyndiahR.Performance of concatenated Reed\u2010Solomon\/convolutional codes with iterative decoding in GLOBECOM 97 IEEE Global Telecommunications Conference Conference Record Vol.2 pp.934\u2010938 1997.","DOI":"10.1109\/GLOCOM.1997.638463"},{"key":"e_1_2_10_14_1","unstructured":"LamarcaM Sala\u2010AlvarezJ Mart\u0131\u0301nezA.Iterative decoding algorithm for RS\u2010convolutional concatenated codes in Proc. of 3rd Intl. Symposium on Turbo Codes and Related Topics pp.543\u2010546 2003."},{"key":"e_1_2_10_15_1","doi-asserted-by":"crossref","unstructured":"ZhangJ YouJ LuL MaX.An iterative soft\u2010decision decoding algorithm for conventional concatenated codes in 2009 Fourth International Conference on Communications and Networking in China pp.1\u20105 2009.","DOI":"10.1109\/CHINACOM.2009.5339712"},{"key":"e_1_2_10_16_1","unstructured":"LiY SalehiM.An efficient decoding algorithm for concatenated RS\u2010convolutional codes in 2009 43rd Annual Conference on Information Sciences and Systems pp.411\u2010413 2009."},{"key":"e_1_2_10_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.082813.120943"},{"key":"e_1_2_10_18_1","doi-asserted-by":"crossref","unstructured":"ChenL MaX.Iterative soft\u2010decision decoding of Reed\u2010Solomon convolutional concatenated codes in 2013 IEEE International Symposium on Information Theory pp.1222\u20101226 2013.","DOI":"10.1109\/ISIT.2013.6620421"},{"key":"e_1_2_10_19_1","doi-asserted-by":"crossref","unstructured":"ChenL.Improved soft\u2010decision decoding of RSCC codes. In 2013 IEEE Wireless Communications and Networking Conference (WCNC) pp.4299\u20104304 2013.","DOI":"10.1109\/WCNC.2013.6555269"},{"key":"e_1_2_10_20_1","doi-asserted-by":"crossref","unstructured":"ChenL.Turbo decoding performance of spectrally efficient RS convolutional concatenated codes International Workshop on High Mobility Wireless Communications pp.57\u201062 2014.","DOI":"10.1109\/HMWC.2014.7000214"},{"key":"e_1_2_10_21_1","unstructured":"HagenauerJ HoeherP.A Viterbi algorithm with soft\u2010decision outputs and its applications in 1989 IEEE Global Telecommunications Conference and Exhibition Communications Technology for the 1990s and Beyond pp.1680\u20101686 1989."},{"key":"e_1_2_10_22_1","doi-asserted-by":"crossref","unstructured":"YangHY YoonSH KangCC.Iterative decoding of serially concatenated convolutional codes applying the SOVA in VTC 98. 48th IEEE Vehicular Technology Conference. Pathway to Global Wireless Revolution (Cat. No. 98CH36151) Vol. 1 pp.353\u2010357 1998.","DOI":"10.1109\/VETEC.1998.686594"},{"key":"e_1_2_10_23_1","doi-asserted-by":"crossref","unstructured":"ChanF.Adaptive Viterbi decoding of turbo codes with short frames in 1999 IEEE Communications Theory Mini\u2010Conference (Cat. No. 99EX352) pp.47\u201051 1999.","DOI":"10.1109\/CTMC.1999.790235"},{"key":"e_1_2_10_24_1","doi-asserted-by":"crossref","unstructured":"SinghM.Design of a Low Complex Adaptable SOVA Decoder for Convolutional Codes in 2005 5th International Conference on Information Communications and Signal Processing pp.1366\u20101368 2005.","DOI":"10.1109\/ICICS.2005.1689280"},{"key":"e_1_2_10_25_1","doi-asserted-by":"crossref","unstructured":"RefaeyA RoyS FortierP.On the application of BP decoding to convolutional and turbo codes in 2009 Conference Record of the Forty\u2010Third Asilomar Conference on Signals Systems and Computers pp.996\u20101001 2009.","DOI":"10.1109\/ACSSC.2009.5470035"},{"key":"e_1_2_10_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.649755"},{"key":"e_1_2_10_27_1","doi-asserted-by":"crossref","unstructured":"MahranA SamyR.Modified adaptive Viterbi algorithm for convolutional codes decoding in 2017 IEEE Aerospace Conference pp.1\u20107 2017.","DOI":"10.1109\/AERO.2017.7943748"},{"key":"e_1_2_10_28_1","doi-asserted-by":"crossref","unstructured":"LinYM LiuWC ChangLY LienCY ChenPY ChenSC.A low\u2010power IP design of Viterbi decoder with dynamic threshold setting in Proceedings of 2010 IEEE International Symposium on Circuits and Systems pp.585\u2010588 2010.","DOI":"10.1109\/ISCAS.2010.5537527"},{"key":"e_1_2_10_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.485714"},{"key":"e_1_2_10_30_1","doi-asserted-by":"crossref","unstructured":"Abdul\u2010ShakoorAR SzwarcV.A High Performance Soft Decision Viterbi Decoder for Wlan and Broadband Applications in 2006 Canadian Conference on Electrical and Computer Engineering pp.2468\u20102471 2006.","DOI":"10.1109\/CCECE.2006.277834"},{"key":"e_1_2_10_31_1","first-page":"131","article-title":"FPGA Implementation of Viterbi Decoder using Trace back Architecture","volume":"4","author":"Gupta S","year":"2011","journal-title":"Int J Eng Trends Technol"},{"key":"e_1_2_10_32_1","doi-asserted-by":"crossref","unstructured":"WeerackodyV.Adaptive coding and modulation for satellite communication links in the presence of channel estimation errors in IEEE Military Communications Conference pp.622\u2010627 2013.","DOI":"10.1109\/MILCOM.2013.112"}],"container-title":["International Journal of Communication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/dac.4922","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/dac.4922","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/dac.4922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T00:57:44Z","timestamp":1725411464000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/dac.4922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,13]]},"references-count":31,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2021,9,25]]}},"alternative-id":["10.1002\/dac.4922"],"URL":"https:\/\/doi.org\/10.1002\/dac.4922","archive":["Portico"],"relation":{},"ISSN":["1074-5351","1099-1131"],"issn-type":[{"type":"print","value":"1074-5351"},{"type":"electronic","value":"1099-1131"}],"subject":[],"published":{"date-parts":[[2021,7,13]]},"assertion":[{"value":"2021-01-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-19","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e4922"}}