메뉴 건너뛰기




Volumn 5, Issue 1, 1993, Pages 85-94

Generalized trace-back techniques for survivor memory management in the Viterbi algorithm

Author keywords

survivor memory; trace back; Viterbi algorithm; VLSI area requirements

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DATA PROCESSING; DECODING; DYNAMIC PROGRAMMING; GRAPH THEORY; MANAGEMENT; RANDOM ACCESS STORAGE; STATE ASSIGNMENT; VLSI CIRCUITS;

EID: 0027264338     PISSN: 09225773     EISSN: 1573109X     Source Type: Journal    
DOI: 10.1007/BF01880274     Document Type: Article
Times cited : (27)

References (10)
  • 8
    • 84936469762 scopus 로고    scopus 로고
    • O. Collins and F. Pollara, “Memory management in traceback Viterbi decoders,” TDA Progress Report 42–99, Jet Propulsion Laboratory, 1988.
  • 9
    • 84936469764 scopus 로고    scopus 로고
    • G. Feygin, P.G. Gulak, and F. Pollara, “Survivor sequence memory management in Viterbi decoders,”Proc. 3rd Workshop on ECC, San Jose, CA, 1989, pp. 72–90.
  • 10
    • 84936469765 scopus 로고    scopus 로고
    • CD. Thompson, “A complexity theory for VLSI,” Ph.D. thesis, Dept. of Comp. Sci., Carnegie Mellon University, 1980.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.