{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:56:23Z","timestamp":1755222983720,"version":"3.43.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1023\/a:1008114510995","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:17:47Z","timestamp":1040545067000},"page":"43-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Design and Implementation of a Low Complexity VLSI Turbo-Code Decoder Architecture for Low Energy Mobile Wireless Communications"],"prefix":"10.1007","volume":"24","author":[{"given":"Sangjin","family":"Hong","sequence":"first","affiliation":[]},{"given":"Wayne E.","family":"Stark","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,2,1]]},"reference":[{"key":"253264_CR1","unstructured":"J.G. Proakis, Digital Communications, McGraw-Hill, 1995."},{"key":"253264_CR2","unstructured":"R.C. Dixon, Spread Spectrum Systems with Commercial Applications, Wiley Interscience, 1994."},{"key":"253264_CR3","unstructured":"A.J. Viterbi, CDMA: Principles of Spread Spectrum Communication, Addison-Wesley, 1995."},{"key":"253264_CR4","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"C.E. Shannon, \u201cA mathematical theory of communications,\u201d Bell System Technical Journal, Vol. 27, pt. I, pp. 379\u2013423; pt. II, pp. 623-656, 1948.","journal-title":"Bell System Technical Journal"},{"key":"253264_CR5","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","volume":"IT-13","author":"A.J. Viterbi","year":"1967","unstructured":"A.J. Viterbi, \u201cError bounds for convolutional codes and an asymptotically optimum decoding algorithm,\u201d IEEE Transactions on Information Theory, Vol. IT-13, pp. 260\u2013269, 1967.","journal-title":"IEEE Transactions on Information Theory"},{"key":"253264_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1109\/TIT.1969.1054239","volume":"IT-15","author":"J.K. Omura","year":"1969","unstructured":"J.K. Omura, \u201cOn the Viterbi decoding algorithm,\u201d IEEE Transactions on Information Theory, Vol. IT-15, pp. 177\u2013179, 1969.","journal-title":"IEEE Transactions on Information Theory"},{"key":"253264_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/35.79382","volume":"29","author":"G. Fettweis","year":"1991","unstructured":"G. Fettweis and H. Meyr, \u201cHigh-speed parallel Viterbi decoding: Algorithm and VLSI-architecture,\u201d IEEE Communication Magazine, Vol. 29, pp. 46\u201355, 1991.","journal-title":"IEEE Communication Magazine"},{"key":"253264_CR8","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1109\/4.173118","volume":"27","author":"P.J. Black","year":"1992","unstructured":"P.J. Black and T.H. Meng, \u201cA 140-Mb\/s 32-state, radix-4 Viterbi decoder,\u201d IEEE Journal of Solid-State Circuits, Vol. 27, pp. 1877\u20131885, 1992.","journal-title":"IEEE Journal of Solid-State Circuits"},{"key":"253264_CR9","doi-asserted-by":"crossref","unstructured":"B.K. Min and N. Demassieux, \u201cAversatile architecture for VLSI implementation of the Viterbi algorithm,\u201d Proc. ICASSP, 1991, pp. 1101\u20131104.","DOI":"10.1109\/ICASSP.1991.150556"},{"key":"253264_CR10","first-page":"1064","volume":"2","author":"C. Berrou","year":"1993","unstructured":"C. Berrou, A. Glavieux, and P. Thitimajsima, \u201cNear Shannon limit error-correcting coding and decoding: Turbo-codes (1),\u201d Proc. ICC, Geneva, 1993, Vol. 2, pp. 1064\u20131070.","journal-title":"Proc. ICC, Geneva"},{"key":"253264_CR11","doi-asserted-by":"crossref","unstructured":"P. Robertson, \u201cIlluminating the structure of code and decoder of parallel concatenated recursive systematic (Turbo) codes,\u201d in IEEE Global Telecommunications Conference, Vol. 3, 1994.","DOI":"10.1109\/GLOCOM.1994.512991"},{"key":"253264_CR12","first-page":"248","volume":"IT-20","author":"L.R. Bahl","year":"1974","unstructured":"L.R. Bahl, J. Cocke, F. Jeinek, and J. Raviv, \u201cOptimal decoding of linear codes for minimizing symbol error rate,\u201d IEEE Transactions on Information Theory, Vol. IT-20, pp. 248\u2013287, 1974.","journal-title":"IEEE Transactions on Information Theory"},{"key":"253264_CR13","unstructured":"Comatlas, Chateaubourg, France, \u201cCAS 5093 Turbo-Code Codec, Data sheet,\u201d August 1994."},{"key":"253264_CR14","unstructured":"Efficient Channel Coding, Inc., Eastlake OH, USA, \u201cECC Turbo product code technology,\u201d March 1998."},{"key":"253264_CR15","unstructured":"Small World Communications, Adelaide, Australia, \u201cMAP04 and MAP04A 16 State MAP Decoders,\u201d April 1998."},{"key":"253264_CR16","unstructured":"Sangjin Hong and Wayne E. Stark, \u201cVLSI design and implementation of low-complexity adaptive turbo-code encoder and decoder for wireless mobile communication applications,\u201d Proc. SiPS98, 1998."},{"key":"253264_CR17","doi-asserted-by":"crossref","unstructured":"S. Benedetto and G. Montorsi, \u201cDesign of parallel concatenated codes,\u201d IEEE Transactions on Communications, pp. 591\u2013600, 1996.","DOI":"10.1109\/26.494303"},{"key":"253264_CR18","doi-asserted-by":"crossref","unstructured":"S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, \u201cSoft-input soft-output modules for the construction and distributed iterative decoding of code networks,\u201d European Transactions on Telecommunications, Vol. ETT9, 1998.","DOI":"10.1002\/ett.4460090206"},{"key":"253264_CR19","doi-asserted-by":"crossref","unstructured":"Joachim Hagenauer, Elke Offer, and Lutz Papke, \u201cIterative decoding of binary block and convolutional codes,\u201d IEEE Transactions on Information Theory, pp. 429\u2013445, 1996.","DOI":"10.1109\/18.485714"}],"container-title":["Journal of VLSI signal processing systems for signal, image and video technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008114510995.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008114510995\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008114510995.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T09:23:54Z","timestamp":1754904234000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008114510995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["253264"],"URL":"https:\/\/doi.org\/10.1023\/a:1008114510995","relation":{},"ISSN":["0922-5773"],"issn-type":[{"type":"print","value":"0922-5773"}],"subject":[],"published":{"date-parts":[[2000,2]]},"assertion":[{"value":"1 February 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}