{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:46:27Z","timestamp":1742798787226},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J VLSI Sign Process Syst Sign Image Video Technol"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1007\/bf01880274","type":"journal-article","created":{"date-parts":[[2005,7,4]],"date-time":"2005-07-04T19:55:21Z","timestamp":1120506921000},"page":"85-94","source":"Crossref","is-referenced-by-count":33,"title":["Generalized trace-back techniques for survivor memory management in the Viterbi algorithm"],"prefix":"10.1007","volume":"5","author":[{"given":"Robert","family":"Cypher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Bernard","family":"Shung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1993,1,1]]},"reference":[{"key":"BF01880274_CR1","doi-asserted-by":"crossref","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,\u201dIEEE Trans. Information Theory, vol. IT-13, 1967, pp. 260\u2013269.","journal-title":"IEEE Trans. Information Theory"},{"key":"BF01880274_CR2","doi-asserted-by":"crossref","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,\u201dIEEE Trans. Information Theory, vol. IT-15, 1969, pp. 177\u2013179.","journal-title":"IEEE Trans. Information Theory"},{"key":"BF01880274_CR3","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TIT.1972.1054829","volume":"IT-18","author":"G.D. Forney Jr.","year":"1972","unstructured":"G.D. Forney Jr., \u201cMaximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference,\u201dIEEE Trans. Information Theory, vol. IT-18, 1972, pp. 363\u2013378.","journal-title":"IEEE Trans. Information Theory"},{"key":"BF01880274_CR4","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1109\/PROC.1973.9030","volume":"61","author":"G.D. Forney Jr.","year":"1973","unstructured":"G.D. Forney Jr., \u201cThe Viterbi algorithm,\u201dProc. IEEE, vol. 61, 1973, pp. 268\u2013278.","journal-title":"Proc. IEEE"},{"key":"BF01880274_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0255(72)90005-9","volume":"4","author":"F.P. Preparata","year":"1972","unstructured":"F.P. Preparata and S.R. Ray, \u201cAn approach to artificial nonsymbolic cognition,\u201dInform. Sci., vol. 4, 1972, pp. 65\u201386.","journal-title":"Inform. Sci."},{"key":"BF01880274_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-2174-1","volume-title":"Error Correction Coding for Digital Communication","author":"G.C. Clark","year":"1981","unstructured":"G.C. Clark and J.B. Cain,Error Correction Coding for Digital Communication, New York: Plenum Press, 1981."},{"key":"BF01880274_CR7","doi-asserted-by":"crossref","first-page":"1399","DOI":"10.1109\/TCOM.1981.1095146","volume":"29","author":"C.M. Rader","year":"1981","unstructured":"C.M. Rader. \u201cMemory management in a Viterbi decoder,\u201dIEEE Trans. Communications, vol. 29, 1981, pp. 1399\u20131401.","journal-title":"IEEE Trans. Communications"},{"key":"BF01880274_CR8","unstructured":"O. Collins and F. Pollara, \u201cMemory management in traceback Viterbi decoders,\u201d TDA Progress Report 42\u201399, Jet Propulsion Laboratory, 1988."},{"key":"BF01880274_CR9","unstructured":"G. Feygin, P.G. Gulak, and F. Pollara, \u201cSurvivor sequence memory management in Viterbi decoders,\u201dProc. 3rd Workshop on ECC, San Jose, CA, 1989, pp. 72\u201390."},{"key":"BF01880274_CR10","unstructured":"CD. Thompson, \u201cA complexity theory for VLSI,\u201d Ph.D. thesis, Dept. of Comp. Sci., Carnegie Mellon University, 1980."}],"container-title":["Journal of VLSI signal processing systems for signal, image and video technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01880274.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01880274\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01880274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T23:07:49Z","timestamp":1557443269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01880274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["BF01880274"],"URL":"https:\/\/doi.org\/10.1007\/bf01880274","relation":{},"ISSN":["0922-5773"],"issn-type":[{"value":"0922-5773","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}