Results 151 to 160 of about 62,799 (214)
Toward Graph-Based Decoding of Tumor Evolution: Spatial Inference of Copy Number Variations. [PDF]
Diagnostics (Basel)Zhang Y +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An artificial neural net Viterbi decoder
IEEE Transactions on Communications, 1996The Viterbi algorithm is a maximum likelihood means for decoding convolutional codes and has thus played an important role in applications ranging from satellite communications to cellular telephony. In the past, Viterbi decoders have usually been implemented using digital circuits.
S B Wicker
exaly +4 more sources
An effective simplifying scheme for Viterbi decoder
IEEE Transactions on Communications, 1991A new reduced-state decoding method is presented. The method constructs state-sets, then classifies, compares, and selects states through certain rules based on a Viterbi algorithm (VA). The decoder complexity is reduced to increasing linearly with constraint-length, as compared to the VA whose complexity increases exponentially with constraint-length.
Chongxi Feng, Yao Yan
exaly +2 more sources
, 2018 Trellis decoding is used to recover encoded information that was corrupted during transmission over a noisy channel. The Viterbi algorithm is the most well-known trellis-based maximum likelihood decoding algorithm. The Viterbi algorithm is executed by a Viterbi decoder.
Mário Pereira Véstias
openaire +2 more sources
An optimal circular Viterbi decoder for the bounded distance criterion
IEEE Transactions on Communications, 2002 We propose a Viterbi-type decoder for tailbiting trellis codes that works by traversing the tailbiting circle somewhat more than once. The traversal is the least possible for any bounded distance Viterbi decoder.
J B Anderson
exaly +3 more sources
IEEE Transactions on Circuits and Systems II: Express Briefs, 2005
The problem of survival memory management of a Viterbi decoder (VD) was solved by introducing a novel pointer implementation for the register exchange method, where a pointer is assigned to each row of memory in the survivor memory unit (SMU). The content of the pointer which points to one row of memory is altered to point to another row of memory ...
Dalia A. El-Dib, Mohamed I. Elmasry
openaire +1 more source
The problem of survival memory management of a Viterbi decoder (VD) was solved by introducing a novel pointer implementation for the register exchange method, where a pointer is assigned to each row of memory in the survivor memory unit (SMU). The content of the pointer which points to one row of memory is altered to point to another row of memory ...
Dalia A. El-Dib, Mohamed I. Elmasry
openaire +1 more source