{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T05:31:48Z","timestamp":1734499908002,"version":"3.30.2"},"reference-count":14,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2004,6,8]],"date-time":"2004-06-08T00:00:00Z","timestamp":1086652800000},"content-version":"vor","delay-in-days":7,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Communication"],"published-print":{"date-parts":[[2004,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we investigate and compare the asymptotic performance of concatenated convolutional coding schemes over<jats:italic>GF<\/jats:italic>(4) over additive white Gaussian noise (AWGN) channels. Both parallel concatenated codes (PCC) and serial concatenated codes (SCC) are considered. We construct such codes using optimal non\u2010binary convolutional codes where optimality is in the sense of achieving the largest minimum distance for a fixed number of encoder states. Code rates of the form<jats:italic>k<\/jats:italic><jats:sub>0<\/jats:sub>\/(<jats:italic>k<\/jats:italic><jats:sub>0<\/jats:sub>+ 1) for<jats:italic>k<\/jats:italic><jats:sub>0<\/jats:sub>=1, 8, and 64 are considered, which suite a wide spectrum of communications applications. For all of these code rates, we find the minimum distance and the corresponding multiplicity for both concatenated code systems. This is accomplished by feeding the encoder with all possible weight\u2010two and weight\u2010three input information patterns and monitoring, at the output of the encoder, the weight of the corresponding codewords and their multiplicity. Our analytical results indicate that the SCC codes considerably outperform their counterpart PCC codes at a much lower complexity. Inspired by the superiority of SCC codes, we also discuss a mathematical approach for analysing such codes, leading to a more comprehensive analysis and allowing for further improvement in performance by giving insights on designing a proper interleaver that is capable of eliminating the dominant error patterns. Copyright \u00a9 2004 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/dac.660","type":"journal-article","created":{"date-parts":[[2004,6,9]],"date-time":"2004-06-09T07:04:44Z","timestamp":1086764684000},"page":"479-490","source":"Crossref","is-referenced-by-count":3,"title":["Asymptotic performance comparison of concatenated (turbo) codes over<i>GF<\/i>(4)"],"prefix":"10.1002","volume":"17","author":[{"given":"Ali","family":"Ghrayeb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taher","family":"Abualrub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2004,6,8]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"BerrouC GlavieuxA ThitimajshimaP.Near Shannon limit error\u2010correcting coding and decoding: turbo\u2010codes. IEEE International Conference on Communications Geneva Switzerland 1993;1064\u20131070.","DOI":"10.1109\/ICC.1993.397441"},{"key":"e_1_2_1_3_2","unstructured":"TanT StuberGL.Soft output Viterbi algorithm (SOVA) for non\u2010binary turbo codes. IEEE International Symposium on Information Theory Sorrento Italy 2000;483."},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"ShoemakeMB HeegardC RossinE.Turbo codes for high order constellations. IEEE Information Theory Workshop Killarney Ireland 1998;6\u20137.","DOI":"10.1109\/ITW.1998.706371"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.661109"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1049\/el:20010032"},{"key":"e_1_2_1_7_2","unstructured":"WhiteGS CostelloJrDJ.Construction and performance ofq\u2010ary turbo codes for use withM\u2010ary modulation techniques. Proceedings of the Conference on Information Systems and Sciences (CISS) Princeton University Princeton New Jersey USA 1999;217\u2013218."},{"key":"e_1_2_1_8_2","unstructured":"WhiteGS CostelloJrDJ.Turbo coding withM\u2010ary modulation on fading and non\u2010fading channels. International Symposium on Information Theory Sorrento Italy 2000;220."},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"WhiteGS CostelloJrDJ.Turbo coding with differential coherent and non\u2010coherent modulation on non\u2010fading and fading channels. IEEE International Symposium on Information Theory Ulm Germany July 1997;428.","DOI":"10.1109\/ISIT.1997.613365"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"BerrouC JezequelM DouillardC KerouedanS.The advantages of non\u2010binary turbo codes. IEEE Information Theory Workshop CAlms Australia 2001;61\u201363.","DOI":"10.1109\/ITW.2001.955136"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19990059"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.669119"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","unstructured":"SouvignierT FriedmannA ObergM SiegelPH SwansonRE WolfJK.Turbo decoding for PR4: parallel versus serial concatenation. IEEE International Conference on Communications1999;1638\u20131642.","DOI":"10.1109\/ICC.1999.765510"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.920179"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1995.525138"}],"container-title":["International Journal of Communication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fdac.660","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/dac.660","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T13:04:42Z","timestamp":1734440682000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/dac.660"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["10.1002\/dac.660"],"URL":"https:\/\/doi.org\/10.1002\/dac.660","archive":["Portico"],"relation":{},"ISSN":["1074-5351","1099-1131"],"issn-type":[{"type":"print","value":"1074-5351"},{"type":"electronic","value":"1099-1131"}],"subject":[],"published":{"date-parts":[[2004,6]]}}}