Results 31 to 40 of about 131,778 (213)
ABSTRACT Two major tasks in applications of hidden Markov models are to (i) compute distributions of summary statistics of the hidden state sequence, and (ii) decode the hidden state sequence. We describe finite Markov chain imbedding (FMCI) and hybrid decoding to solve each of these two tasks.
Zenia Elise Damgaard Bæk +3 more
wiley +1 more source
A parallel Viterbi decoder for block cyclic and convolution codes
We present a parallel version of Viterbi's decoding procedure, for which we are able to demonstrate that the resultant task graph has restricted complexity in that the number of communications to or from any processor cannot exceed 4 for BCH codes.
Amarasinghe, Kosala +3 more
core +1 more source
Linking the Movement Behavior of the Laptev Sea Walrus to Sea Ice and Resource Dynamics
ABSTRACT The walrus subspecies inhabiting the Laptev Sea (Odobenus rosmarus divergens) remains one of the least studied walrus taxa and occurs in a region undergoing rapid environmental change driven by climate warming and increasing human activity. We conducted the first satellite telemetry study of walruses in this region, tracking 14 individuals ...
Varvara Levitskaya +4 more
wiley +1 more source
Graph-Based Codes and Iterative Decoding [PDF]
The field of error correcting codes was revolutionized by the introduction of turbo codes in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity.
Khandekar, Aamod Dinkar
core +1 more source
Interleaved Convolutional Code and Its Viterbi Decoder Architecture
We propose an area-efficient high-speed interleaved Viterbi decoder architecture, which is based on the state-parallel architecture with register exchange path memory structure, for interleaved convolutional code. The state-parallel architecture uses as
Kong Jun Jin, Parhi Keshab K
doaj +1 more source
A New List Decoding Algorithm for Short-Length TBCCs With CRC
In this paper, a new list decoding algorithm for tail-biting convolutional codes (TBCCs) with a cyclic redundancy check (CRC) is proposed, where the CRC is considered as a concatenated outer code.
Jae-Won Kim +3 more
doaj +1 more source
Hidden Markov graphical models with state‐dependent generalized hyperbolic distributions
Abstract In this article, we develop a novel hidden Markov graphical model to investigate time‐varying interconnectedness between different financial markets. To identify conditional correlation structures under varying market conditions and accommodate shape features embedded in financial time series, we rely upon the generalized hyperbolic family of ...
Beatrice Foroni +2 more
wiley +1 more source
A Fast Viterbi Decoding in Optical Channels [PDF]
http://search.ieice.org/index.html | http://search.ieice.org/index.htmlA fast Viterbi decoding technique with path reduction in optical channels is presented. This decoding exploits the asymmetric characteristic of optical channels.
八嶋, 弘幸, ヤシマ, ヒロユキ
core +1 more source
Novel decoding of convolutional codes for OCDMA system
The characteristics of optical code division multiple access(OCDMA) and convolutional codes were introduced.Based on the tunnel model of OCDMA with its multiple access interference(MAI), and according to its characteristics, a novel decoding of ...
ZHOU Hai-xian, XU Guo-liang, YAO Wei
doaj +2 more sources
Using hidden Markov models (HMM) to analyze dynamic brain states from resting‐state fMRI, this study identifies opposing temporal dynamics in Parkinson's disease (PD) and progressive supranuclear palsy (PSP). PD patients show reduced fractional occupancy in unimodal networks, while PSP patients exhibit increased occupancy and prolonged duration in ...
Chenfei Ye +6 more
wiley +1 more source

