Results 41 to 50 of about 328,523 (223)

Local Viterbi property in decoding

Information and Inference: A Journal of the IMA, 2023
Abstract The article studies the decoding problem (also known as the classification or the segmentation problem) with pairwise Markov models (PMMs). A PMM is a process where the observation process and the underlying state sequence form a two-dimensional Markov chain, a natural generalization of hidden Markov model.
openaire   +1 more source

Enhancing Diabetes Management With CRIBC: A Novel NER Model for Constructing A Comprehensive Chinese Medical Knowledge Graph

Engineering Reports, Volume 7, Issue 10, October 2025.
This study proposes CRIBC, an advanced Named Entity Recognition (NER) model tailored for Chinese medical text processing. By integrating Chinese‐RoBERTa‐WWM‐EXT with BiLSTM‐CRF and IDCNN, CRIBC enables more accurate entity extraction and knowledge representation.
Yiqing Xu, Zalizah Awang Long, Djoko Budiyanto Setyohadi   +2 more
wiley   +1 more source

Divergence coding for convolutional codes

MATEC Web of Conferences, 2017
In the paper we propose a new coding/decoding on the divergence principle. A new divergent multithreshold decoder (MTD) for convolutional self-orthogonal codes contains two threshold elements.
Valery Zolotarev, Gennady Ovechkin, Dina Satybaldina, Nurlan Tashatov, Eldor Egamberdiyev   +4 more
doaj   +1 more source

Named Entity Recognition Model Based on k-best Viterbi Decoupling Knowledge Distillation [PDF]

Jisuanji kexue yu tansuo
Knowledge distillation is a general approach to improve the performance of the named entity recognition (NER) models. However, the classical knowledge distillation loss functions are coupled, which leads to poor logit distillation.
ZHAO Honglei, TANG Huanling, ZHANG Yu, SUN Xueyuan, LU Mingyu
doaj   +1 more source

Unified Neural Lexical Analysis Via Two‐Stage Span Tagging

CAAI Transactions on Intelligence Technology, Volume 10, Issue 4, Page 1254-1267, August 2025.
ABSTRACT Lexical analysis is a fundamental task in natural language processing, which involves several subtasks, such as word segmentation (WS), part‐of‐speech (POS) tagging, and named entity recognition (NER). Recent works have shown that taking advantage of relatedness between these subtasks can be beneficial.
Yantuan Xian, Yefen Zhu, Zhentao Yu, Yuxin Huang, Junjun Guo, Yan Xiang   +5 more
wiley   +1 more source

SYNCHRONIZATION RECOVERY WHEN DECODING MESSAGES USING A MODIFIED VITERBI DECODING ALGORITHM

Известия высших учебных заведений. Поволжский регион:Технические науки, 2020
Background. Modern data transmission systems using cryptographic methods of information protection require high reliability and quality of information transmission. The object of research is protected data transmission systems. The subject of research
Yu. Yu. Sinitsyn, A. B. Sizonenko
doaj   +1 more source

High performance ACS for Viterbi decoder using pipeline T-Algorithm

Alexandria Engineering Journal, 2015
Viterbi algorithm is the most popular algorithm used to decode the convolution code, but its computational complexity increases exponentially with the increasing constraint length due to the large number of Trellis transitions.
D. Vaithiyanathan, J. Nargis, R. Seshasayanan   +2 more
doaj   +1 more source

Skew Convolutional Codes

Entropy, 2020
A new class of convolutional codes, called skew convolutional codes, that extends the class of classical fixed convolutional codes, is proposed.
Vladimir Sidorenko, Wenhui Li, Onur Günlü, Gerhard Kramer   +3 more
doaj   +1 more source

Review and Analysis of Digital Signal Processing Algorithms for Coherent Optical Satellite Links

International Journal of Satellite Communications and Networking, Volume 43, Issue 3, Page 229-250, May/June 2025.
ABSTRACT Coherent optical satellite links enable high‐throughput communication and high accuracy ranging to and between satellites. Due to the ever‐increasing demand for throughput, wavelength division multiplexing of polarization multiplexed optical signals is being considered as a solution to provide high‐speed optical satellite links.
Carl Valjus, Raphael Wolf, Juraj Poliak
wiley   +1 more source

Research of fast decoding for longer constraint length convolutional codes

Tongxin xuebao, 2010
To overcome the disadvantage of Viterbi decoding algorithm, in which its complexity exponentially increases with the increasing constraint length of convolutional codes, and the decoding delay was too large to fit the decoding of longer constraint length
HUANG Xiao-ling, YANG Hua-long
doaj   +2 more sources