{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T02:37:45Z","timestamp":1755225465612,"version":"3.43.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Personal Communications"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1023\/a:1013902205407","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T13:55:48Z","timestamp":1041083748000},"page":"101-112","source":"Crossref","is-referenced-by-count":1,"title":["Truncated Turbo Decoding with Reduced Computational Complexity"],"prefix":"10.1007","volume":"20","author":[{"given":"Peter","family":"Haase","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herman","family":"Rohling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"355781_CR1","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/26.494303","volume":"44","author":"S. Benedetto","year":"1996","unstructured":"S. Benedetto and G. Montorsi, \u201cDesign of Parallel Concatenated Convolutional Codes\u201d, IEEE Trans. Communications, Vol. 44, No. 5, pp. 591\u2013600, 1996.","journal-title":"IEEE Trans. Communications"},{"key":"355781_CR2","unstructured":"C. Berrou and A. Glavieux, \u201cTurbo Codes: General Principles and Applications\u201d, in 6th Tierrenia Int. Workshop on Digital Communications, Tierrenia, Italy, 1993, pp. 215\u2013226."},{"key":"355781_CR3","doi-asserted-by":"crossref","unstructured":"C. Berrou, A. Glavieux and P. Thitimajshima, \u201cNear Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes\u201d, in IEEE Int. Conf. on Communications, 1993, pp. 1064\u20131070.","DOI":"10.1109\/ICC.1993.397441"},{"key":"355781_CR4","unstructured":"D. Divsalar and F. Pollara, \u201cOn the Design of Turbo Codes\u201d, TDA Progress Report 99\u2013121, JPL, 1995."},{"key":"355781_CR5","doi-asserted-by":"crossref","unstructured":"J. Hagenauer et al., \u201cDecoding Turbo Codes with the Soft-Output Viterbi Algorithm (SOVA)\u201d, p. 164.","DOI":"10.1109\/ISIT.1994.394808"},{"key":"355781_CR6","unstructured":"J. Hagenauer et al., \u201cIterative (Turbo) Decoding of Systematic Convolutional Codes with the MAP and SOVA Algorithms\u201d, in Proc. of ITG, 1994, pp. 21\u201329."},{"key":"355781_CR7","unstructured":"J. Hagenauer and P. Hoher, \u201cA Viterbi Algorithm with Soft-Decision Outputs and Its Applications\u201d, pp. 47.1.1\u201347.1.7."},{"key":"355781_CR8","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/18.485714","volume":"IT-42","author":"J. Hagenauer","year":"1996","unstructured":"J. Hagenauer, E. Offer and L. Papke, \u201cIterative Decoding of Binary Block and Convolutional Codes\u201d, IEEE Trans. Information Theory, Vol. IT-42, pp. 429\u2013445, 1996.","journal-title":"IEEE Trans. Information Theory"},{"issue":"8","key":"355781_CR9","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1109\/26.780444","volume":"IC-47","author":"R.Y. Shao","year":"1999","unstructured":"R.Y. Shao, S. Lin and M.P.C. Fossorier, \u201cTwo Simple Stopping Criteria for Turbo Decoding\u201d, IEEE Trans. Communications, Vol. IC-47, No. 8, pp. 1117\u20131120, 1999.","journal-title":"IEEE Trans. Communications"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013902205407.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013902205407\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013902205407.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T12:05:59Z","timestamp":1755086759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013902205407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["355781"],"URL":"https:\/\/doi.org\/10.1023\/a:1013902205407","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}