{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:30:22Z","timestamp":1738387822882,"version":"3.35.0"},"reference-count":16,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":3056,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[2000,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The input\u2010output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice over the interleaver and a uniform choice of the component codes from the set of time varying recursive systematic convolutional codes. The conventional union bound is employed to obtain an upper bound on the bit error probability of the ensemble of serially concatenated turbo codes for the binary\u2010input additive white Gaussian noise (AWGN) channel with coherent detection OF antipodal signals and maximum likelihood decoding. The influence of the interleaver length<jats:italic>N<\/jats:italic>and the memory length of the component codes<jats:italic>in<\/jats:italic>on the ensemble performance is investigated and compared with relevant results for parallel concatenated multiple\u2010turbo codes.<\/jats:p>","DOI":"10.1002\/ett.4460110304","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T13:55:03Z","timestamp":1221227703000},"page":"271-282","source":"Crossref","is-referenced-by-count":3,"title":["On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding"],"prefix":"10.1002","volume":"11","author":[{"given":"Igal","family":"Sason","sequence":"first","affiliation":[]},{"given":"Shlomo","family":"Shamai","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.485713"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.669119"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"C.Berrou A.GlavieuxandP.Thitimajshima Near Shannon limit error correcting coding and decoding: turbo\u2010codes.Proc. of International Conference on Communications pages1064\u20131070 Geneva Switzerland May 23\u201326 1993.","DOI":"10.1109\/ICC.1993.397441"},{"key":"e_1_2_1_5_2","unstructured":"J.Craig A new simple and exact result for calculating error probability for two\u2010dimensional signal constellation.Proceedings of 1991 Mil Commun. Conf. (MILCOM'91)."},{"key":"e_1_2_1_6_2","unstructured":"F.DaneshgaranandM.Mondin An efficient algorithm for obtaining the distance spectrum of turbo codes.Proceedings of the International Symposium on Turbo Codes Related Topics pages251\u2013254 Brest France 3\u20135 September 1997."},{"key":"e_1_2_1_7_2","unstructured":"D.Divsalar S.Dolinar R. J.McElieceandF.Pollara Transfer functions bounds on the performance of turbo codes. the Telecommunications and Data Acquisition Progress Report 42\u2013122 April\u2010June Jet Propulsion Laboratory Pasadena. California pages44\u201355 August 15 1995."},{"key":"e_1_2_1_8_2","unstructured":"D.Divsalar A simple tight bound on error probability of block codes with application to turbo codes. JPL TDA Progress Report 42\u2013139. pages1\u201335. November1999."},{"key":"e_1_2_1_9_2","unstructured":"D.DivsahrandF.Pollara Serial and hybrid concatenated codes with applications.Proceedings of the International Symposium an Turbo Codes Related Topics pages80\u201387. Brest. France 3\u20135 September 1997."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.681398"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"N.KahaleandR.Urbanke On the minimum distances of parallel and serially concatenated codes.Proceedings 1998 IEEE Int. Symp. Information Theary (ISIT'98). p.31 Boston MA USA August 16\u201321 1998. See also Bell Laboratories Lucent Technologies Technical Report 1997.","DOI":"10.1109\/ISIT.1998.708611"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055064"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.817506"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460060510"},{"key":"e_1_2_1_15_2","unstructured":"E.TelatarandR.Urbanke On the ensemble performance of turbo codes. 1996. Available in:http:\/\/cavwww.epfl.ch\/ruedigedpublications.html."},{"volume-title":"Principles of Digital Communications and Coding","year":"1979","author":"Viterbi A. J.","key":"e_1_2_1_16_2"},{"key":"e_1_2_1_17_2","unstructured":"A. J.Viterbi A. M.Viterbi J.NicolasandN. T.Sindushyana Perspectives on interleaved concatenated codes with iteralive soft\u2010output decoding.Proceedings of the International Symposium on Turbo Codes & Related Topics pages47\u201354 Brest France 3\u20135 September 1997."}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460110304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460110304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:37:28Z","timestamp":1738363048000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460110304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["10.1002\/ett.4460110304"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460110304","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"type":"print","value":"1124-318X"},{"type":"electronic","value":"1541-8251"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}