Výsledky vyhledávání - K-best Viterbi decoding algorithm

  • Zobrazuji výsledky 1 - 14 z 14
Upřesnit hledání
  1. 1

    Error Performance Analysis of the K-best Viterbi Decoding Algorithm Autor Yoshikawa, Hideki

    Vydáno: IEICE 01.10.2018
    “… But the complexity is increase rapidly in the constraint length. The K-best Viterbi decoding algorithm for the convolutional codes is proposed to reduce its decoding complexity…”
    Získat plný text
    Konferenční příspěvek
  2. 2

    A Double K-best Viterbi-sphere Decoder for Trellis-coded Generalized Spatial Modulation with Multiple Code Rates Autor Wang, Zhe-Yu, Tsai, Pei-Yun, Huang, Yuan-Hao, Lai, I-Wei

    ISSN: 2379-190X
    Vydáno: IEEE 01.05.2019
    “… A double K-best technique is then proposed to strike a good balance between performance and complexity of Viterbi-sphere decoding…”
    Získat plný text
    Konferenční příspěvek
  3. 3

    Named Entity Recognition Model Based on k-best Viterbi Decoupling Knowledge Distillation Autor ZHAO Honglei, TANG Huanling, ZHANG Yu, SUN Xueyuan, LU Mingyu

    ISSN: 1673-9418
    Vydáno: Journal of Computer Engineering and Applications Beijing Co., Ltd., Science Press 01.03.2024
    Vydáno v Jisuanji kexue yu tansuo (01.03.2024)
    “…), which combines k-best Viterbi decoding to improve the computational efficiency, effectively improving the model performance…”
    Získat plný text
    Journal Article
  4. 4

    k-best维特比解耦合知识蒸馏的命名实体识别模型 Autor 赵红磊, 唐焕玲, 张玉, 孙雪源, 鲁明羽

    ISSN: 1673-9418
    Vydáno: 山东工商学院 信息与电子工程学院,山东 烟台 264005%山东工商学院 计算机科学与技术学院,山东 烟台 264005 01.03.2024
    Vydáno v 计算机科学与探索 (01.03.2024)
    “…TP391; 为提升命名实体识别(NER)模型的性能,可采用知识蒸馏方法,但是传统知识蒸馏损失函数因内部存在的耦合关系会导致蒸馏效果较差.为了解除耦合关系,有效提升输出层特征知识蒸馏的效果,提出一种结合k-best维特比解码的解耦合知识蒸馏方法(kvDKD),该方法利用k-best维特比算法提高计算效率,能够有效提升…”
    Získat plný text
    Journal Article
  5. 5

    ASIC design of a low-complexity K-best Viterbi decoder for IoT applications Autor Kato, Hiromasa, Tran, Thi Hong, Nakashima, Yasuhiko

    Vydáno: IEEE 01.10.2016
    “… In this paper, we propose K-best VD to simplify the circuit while keeping the same error correction performance…”
    Získat plný text
    Konferenční příspěvek
  6. 6

    Decoding HMMs using the k best paths: algorithms and applications Autor Brown, Daniel G, Golod, Daniil

    ISSN: 1471-2105, 1471-2105
    Vydáno: London BioMed Central 18.01.2010
    Vydáno v BMC bioinformatics (18.01.2010)
    “…Background Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to the correct state…”
    Získat plný text
    Journal Article
  7. 7

    A probabilistic mobile text entry system for agglutinative languages Autor Tantug, Ahmet Cuneyd

    ISSN: 0098-3063, 1558-4127
    Vydáno: New York IEEE 01.05.2010
    “… The proposed system uses n-gram letter probabilities and K Best Viterbi decoding to generate a list of predictions…”
    Získat plný text
    Journal Article
  8. 8

    MIMO Detector Based on Viterbi Algorithm Autor Lee, Jin, Park, Sin-Chong

    ISBN: 1424412218, 9781424412211
    ISSN: 2162-3562
    Vydáno: IEEE 01.10.2007
    “…) detector, has so far been considered infeasible for high-rate system. Sphere decoder (SD) using depth-first tree searching and K-best algorithm are used for near optimum detector…”
    Získat plný text
    Konferenční příspěvek
  9. 9

    Discriminative training and variational decoding in machine translation via novel algorithms for weighted hypergraphs Autor Li, Zhifei

    ISBN: 1109778961, 9781109778960
    Vydáno: ProQuest Dissertations & Theses 01.01.2010
    “…A hypergraph or "packed forest" is a compact data structure that uses structure-sharing to represent exponentially many trees in polynomial space. A…”
    Získat plný text
    Dissertation
  10. 10

    The k-best paths in hidden Markov models. Algorithms and applications to transmembrane protein topology recognition Autor Golod, Daniil

    ISBN: 0494560533, 9780494560532
    Vydáno: ProQuest Dissertations & Theses 01.01.2009
    “… The naive implementation of k best Viterbi paths is highly space-inefficient, so we adapt recent work on the Viterbi algorithm for a single…”
    Získat plný text
    Dissertation
  11. 11

    Low power design for high performance wireless digital baseband building blocks Autor Jin, Jie

    ISBN: 1109385153, 9781109385151
    Vydáno: ProQuest Dissertations & Theses 01.01.2009
    “… We tackle the design of the following power-hungry modules in a multiple-in and multiple-out (MIMO) baseband system: the K-best lattice decoder design for MIMO detection, the channel decoder design including Viterbi decoder and LDPC decoder design…”
    Získat plný text
    Dissertation
  12. 12

    Predicting eukaryotic genes by integrating evidence Autor Liu, Qian

    ISBN: 9781109235913, 1109235917
    Vydáno: ProQuest Dissertations & Theses 01.01.2009
    “…Nowadays large and complex genomes can be quickly sequenced at a low cost thanks to ever faster and cheaper genome sequencing technology. However it still…”
    Získat plný text
    Dissertation
  13. 13

    Architectures for OFDM-based ultra wideband systems Autor Tang, Jun

    ISBN: 9780542836701, 054283670X
    Vydáno: ProQuest Dissertations & Theses 01.01.2006
    “… The proposed system also kept the performance in the original MB-OFDM system. A Viterbi decoder architecture for the MB-OFDM system is proposed…”
    Získat plný text
    Dissertation
  14. 14

    A list-type reduced-constraint generalization of the Viterbi algorithm Autor Hashimoto, T.

    ISSN: 0018-9448, 1557-9654
    Vydáno: IEEE 01.11.1987
    “…The Viterbi algorithm (VA), an optimum decoding rule for a Q -ary trellis code of constraint length K , operates by taking the best survivor from each of Q^{K-1…”
    Získat plný text
    Journal Article