PARALLEL PROCESSING FOR VITERBI ALGORITHM

被引：0
|
作者：
KUEI, AW
JAU, YL
机构：
[1] Natl Cheng Kung Univ, Taiwan
来源：
ELECTRONICS LETTERS | 1988年 / 24卷 / 17期
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
8
引用
收藏
页码：1098 / 1099
页数：2
相关论文
共 50 条
  • [1] EFFICIENT COMPUTING METHODS FOR PARALLEL PROCESSING - AN IMPLEMENTATION OF THE VITERBI ALGORITHM
    WEN, KA
    WANG, JF
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1989, 17 (12) : 1511 - 1521
  • [2] A parallel Viterbi decoding algorithm
    Reeve, JS
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2001, 13 (02): : 95 - 102
  • [3] Parallel implementation of Viterbi algorithm
    Šuligoj, Domen
    Trobec, Roman
    Robič, Borut
    Elektrotehniski Vestnik/Electrotechnical Review, 2002, 69 (02): : 90 - 94
  • [4] Parallel Viterbi algorithm for a VLIW DSP
    Khan, SA
    Saqib, MM
    Ahmed, S
    2000 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS, VOLS I-VI, 2000, : 3390 - 3393
  • [5] Parallel Trellis Viterbi Algorithm for Sparse Channels
    McGinty, Nigel C.
    Kennedy, Rodney A.
    Hoeher, Peter
    IEEE COMMUNICATIONS LETTERS, 1998, 2 (05) : 143 - 145
  • [6] An efficient parallel algorithm for list Viterbi decoding
    Sánchez, V
    Peinado, AM
    SIGNAL PROCESSING, 2003, 83 (03) : 511 - 515
  • [7] Accelerating Viterbi algorithm on graphics processing units
    Muhammad Kashif Hanif
    Karl-Heinz Zimmermann
    Computing, 2017, 99 : 1105 - 1123
  • [8] SYSTOLIC ARRAY-PROCESSING OF THE VITERBI ALGORITHM
    CHANG, CY
    YAO, K
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (01) : 76 - 86
  • [9] Accelerating Viterbi algorithm on graphics processing units
    Hanif, Muhammad Kashif
    Zimmermann, Karl-Heinz
    COMPUTING, 2017, 99 (11) : 1105 - 1123
  • [10] An Efficient Cache-oblivious Parallel Viterbi Algorithm
    Chowdhury, Rezaul
    Ganapathi, Pramod
    Pradhan, Vivek
    Tithi, Jesmin Jahan
    Xiao, Yunpeng
    EURO-PAR 2016: PARALLEL PROCESSING, 2016, 9833 : 574 - 587
12345