{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T18:43:58Z","timestamp":1767725038026,"version":"build-2238731810"},"reference-count":31,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":3848,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1998,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Soft\u2010input soft\u2010output building blocks (modules) are presented to construct and iteratively decode in a distributed fashion\n                    <jats:italic>code networks<\/jats:italic>\n                    , a new \u00e7oncept that includes, and generalizes, various forms of concatenated coding schemes. Among the modules, a central role is played by the SISO module (and the underlying algorithm): it consists of a four\u2010port device performing a processing of the sequences of two input probability distributions by constraining them to the code trellis structure. The SISO and other soft\u2010input soft\u2010output modules are employed to construct and decode a variety of code networks, including \u201cturbo codes\u201d and serially concatenated codes with interleavers.\n                  <\/jats:p>","DOI":"10.1002\/ett.4460090206","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T12:39:51Z","timestamp":1221223191000},"page":"155-172","source":"Crossref","is-referenced-by-count":164,"title":["Soft\u2010input soft\u2010output modules for the construction and distributed iterative decoding of code networks"],"prefix":"10.1002","volume":"9","author":[{"given":"Sergio","family":"Benedetto","sequence":"first","affiliation":[]},{"given":"Guido","family":"Montorsi","sequence":"additional","affiliation":[]},{"given":"Dariush","family":"Divsalar","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Pollara","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"C.Berrou A.Glavieux P.Thitimajshima:Near shannon limit error\u2010correcting coding and decoding: turbo\u2010codes. \u201cProceedings of ICC'93\u201d Geneve Switzerland. May1993 p.1064\u20131070.","DOI":"10.1109\/ICC.1993.397441"},{"key":"e_1_2_1_3_2","unstructured":"S.Benedetto D.Divsalar G.Montorsi F.Pollara:Serial concatenation of interlaced codes: performance analysis design and iterative decoding. \u201cJPL TDA Progress Report\u201d Vol. 42\u2013126 Aug.1996."},{"key":"e_1_2_1_4_2","volume-title":"Digital transmission theory","author":"Benedetto S.","year":"1987"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1970.7732"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053923"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"L. R.Bahl J.Cocke F.Jelinek J.Raviv:Optimal decoding of linear codes for minimizing symbol error rate. \u201cIEEE Transactions on Information Theory\u201d Mar.1974 p.284\u2013287.","DOI":"10.1109\/TIT.1974.1055186"},{"key":"e_1_2_1_8_2","unstructured":"P. L.MacAdam L.Welch C.Weber:Map bit decoding of convolutional codes. \u201cAbstract of papers ISIT'72\u201d Asilomar California Jan.1972 p.91."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055617"},{"key":"e_1_2_1_10_2","unstructured":"B.Vucetic Y.Li:A survey of Soft\u2010output algorithm. \u201cProceedings of ISITA'94\u201d Sydney Australia Nov.1994 p.863\u2013867."},{"key":"e_1_2_1_11_2","unstructured":"S. S.Pietrobon A. S.Barbulescu:A simplification of the modified bahl algorithm for systematic convolutional codes. \u201cProceedings of ISITA'94\u201d Sydney Australia Nov.1994 p.1073\u20131077."},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","unstructured":"P.Robertson E.Villebrun P.Hoeher:A comparison of optimal and sub\u2010optimal MAP decoding algorithms operating in the log domain. \u201cProceedings of ICC'95\u201d Seattle Washington June1995 p.1009\u20131013.","DOI":"10.1109\/ICC.1995.524253"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19950069"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19960217"},{"key":"e_1_2_1_15_2","unstructured":"L.Papke:Improved decoding with the sova in a parallel concatenated (turbo\u2010code) scheme. \u201cProceedings of ICC 96\u201d Dallas Texas June1996."},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"S.Benedetto D.Divsalar G.Montorsi F.Pollara:Soft\u2010output decoding algorithms for continuous decoding of parallel concatenated convolutional codes. \u201cProceedings of ICC'96\u201d Dallas Texas June1996.","DOI":"10.1049\/el:19960217"},{"key":"e_1_2_1_17_2","volume-title":"Concatenated codes","author":"Forney G. D.","year":"1966"},{"issue":"4","key":"e_1_2_1_18_2","first-page":"20","article-title":"Multidimensional signals for a continuous channel","volume":"23","author":"Ginzburg V. V.","year":"1984","journal-title":"Problems of Information Transmission"},{"key":"e_1_2_1_19_2","unstructured":"N.Seshadri C.\u2010E. W.Sundberg:Generalized Viterbi algorithms for error detection with convolutional codes. \u201cProceedings of GLOBECOM'89\u201d Dallas Texas Nov.1989 Vol. 3 p.43.3.1\u201343.3.5."},{"key":"e_1_2_1_20_2","unstructured":"J.Hagenauer P.Hoeher:Concatenated Viterbi decoding. \u201cProceedings of Fourth Joint Swedish\u2010Soviet Int. Workshop on Information Theory\u201d Gotland Sweden Studenlitteratur Lund Aug.1989 p.29\u201333."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.485714"},{"key":"e_1_2_1_22_2","unstructured":"P.Hoeher:TCM on frequency\u2010selective fading channels: a comparison of soft\u2010output probabilistic equalizers. \u201cProceedings of GLOBECOM\u201090\u201d San Diego California Dec.1990 p.401.4.1\u2013401.4.6."},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.382016"},{"key":"e_1_2_1_24_2","unstructured":"R.McEliee E.Rodemich J.\u2010F.Cheng:The turbo decision algorithm. Proceedings of 33\u2010rd Allerton Conference on Communication Control and Computing Monticello Illinois Aug.1995."},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460060507"},{"key":"e_1_2_1_26_2","first-page":"63","article-title":"Soft\u2010output decoding algorithms in iterative decoding of turbo codes","volume":"42","author":"Benedetto S.","year":"1996","journal-title":"JPL TDA Progress Report"},{"key":"e_1_2_1_27_2","doi-asserted-by":"crossref","unstructured":"S.Benedetto D.Divsalar G.Montorsi F.Pollara:Analysis design and iterative decoding of double serially concatenated codes with interleavers. \u201cIEEE Journal on Selected Areas on Communication\u201d Feb.1998.","DOI":"10.1109\/49.661111"},{"key":"e_1_2_1_28_2","unstructured":"S.Benedetto R.Garello G.Montorsi:The trellis complexity of turbo codes. Proceedings of GLOBECOM'97\u2010Communications Theory Miniconference Phoenix Arizona Oct1997."},{"key":"e_1_2_1_29_2","volume-title":"Principles of digital communication and coding","author":"Viterbi A. J.","year":"1979"},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3998-8"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-2174-1"},{"key":"e_1_2_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.494302"}],"updated-by":[{"DOI":"10.1002\/ett.70216","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T00:00:00Z","timestamp":1753574400000}}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460090206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460090206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:42:08Z","timestamp":1738345328000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460090206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["10.1002\/ett.4460090206"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460090206","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"value":"1124-318X","type":"print"},{"value":"1541-8251","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}