메뉴 건너뛰기




Volumn 4, Issue , 1992, Pages 1875-1878

Trellis pipeline-interleaving: A novel method for efficient viterbi-decoder implementation

Author keywords

[No Author keywords available]

Indexed keywords

PIPELINES;

EID: 84888049999     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCAS.1992.230446     Document Type: Conference Paper
Times cited : (7)

References (10)
  • 1
    • 0025560039 scopus 로고
    • Minimized method viterbi decoding: 600 mbit/s per chip
    • G. Fettweis, H. Dawid, and H. Meyr, "Minimized method Viterbi decoding: 600 Mbit/s per chip, " in Proc. GLOBECOM'90, pp. 1712-16, 1990.
    • (1990) Proc. GLOBECOM'90 , pp. 1712-1716
    • Fettweis, G.1    Dawid, H.2    Meyr, H.3
  • 2
    • 0026153976 scopus 로고
    • High speed parallel viterbi decoding: Algorithm and VLSI-Architecture
    • G. Fettweis and H. Meyr, "High speed parallel Viterbi decoding: Algorithm and VLSI-Architecture, " IEEE Comm. Magazine, vol. 29, no. 5, pp. 46-55, 1991.
    • (1991) IEEE Comm. Magazine , vol.29 , Issue.5 , pp. 46-55
    • Fettweis, G.1    Meyr, H.2
  • 3
    • 84935113569 scopus 로고
    • Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
    • April
    • A. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, " IEEE Trans. Inf. Theory, vol. IT-13, pp. 260-69, April 1967.
    • (1967) IEEE Trans. Inf. Theory , vol.IT-13 , pp. 260-269
    • Viterbi, A.1
  • 5
    • 0024700229 scopus 로고
    • Pipeline interleaving and parallelism in recursive digital filters-Part I: Pipelining using scattered look-ahead and decomposition
    • K. Parhi and D. Messerschmidt, "Pipeline interleaving and parallelism in recursive digital filters-Part I: Pipelining using scattered look-ahead and decomposition, " IEEE Trans. ASSP. vol. 37, no. 7, pp. 1099-1117, 1989.
    • (1989) IEEE Trans. ASSP. Vol. 37 , Issue.7 , pp. 1099-1117
    • Parhi, K.1    Messerschmidt, D.2
  • 6
    • 85067232113 scopus 로고    scopus 로고
    • Boosting the implementation efficiency of viterbi decoders by novel scheduling schemes
    • to be submitted to
    • S. Bitterlich, H. Dawid, and H. Meyr, "Boosting the implementation efficiency of Viterbi decoders by novel scheduling schemes." to be submitted to GLOBE- COM'92.
    • GLOBE- COM'92
    • Bitterlich, S.1    Dawid, H.2    Meyr, H.3
  • 7
    • 0026169529 scopus 로고
    • Pipelining in dynamic programming architectures
    • June
    • K. Parhi, "Pipelining in dynamic programming architectures, " IEEE Trans. Signal Processing, vol. 39, pp. 1442-50, June 1991.
    • (1991) IEEE Trans. Signal Processing , vol.39 , pp. 1442-1450
    • Parhi, K.1
  • 8
    • 85067265586 scopus 로고
    • Area-Efficient architectures for the viterbi algorithm
    • C. B. Sluing, H. D. Lin, P. H. Siegel, and H. K. Thapar, "Area-Efficient Architectures for the Viterbi Algorithm, " in Proc. ISCAS '90, pp. 1787-92, 1990.
    • (1990) Proc. ISCAS '90 , pp. 1787-1792
    • Sluing, C.B.1    Lin, H.D.2    Siegel, P.H.3    Thapar, H.K.4
  • 10
    • 0019045358 scopus 로고
    • On a class of multistage interconnection networks
    • C. Wu and T. Feng, "On a class of multistage interconnection networks, " IEEE Trans. Computers, no. 8, pp. 694-702, 1980.
    • (1980) IEEE Trans. Computers , Issue.8 , pp. 694-702
    • Wu, C.1    Feng, T.2


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