Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,216,350 papers from all fields of science
Search
Sign In
Create Free Account
Viterbi algorithm
Known as:
Viterbi path
, Vitterbi algorithm
, Viterbi search
Expand
The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states – called the Viterbi path – that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
ARC (processor)
Algorithm
Baum–Welch algorithm
Bayesian programming
Expand
Broader (2)
Dynamic programming
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Performance Comparison of Different Forward Error Correction Coding Techniques for Wireless Communication Systems
Sanjeev Kumar
,
Ragini Gupta
2011
Corpus ID: 7207375
High bit error rates of the wireless communication system require employing forward error correction (FEC) methods on the data…
Expand
2008
2008
A High-Speed Viterbi Decoder
Qing Li
,
Xuan-zhong Li
,
Han-hong Jiang
,
Wen-hao He
Fourth International Conference on Natural…
2008
Corpus ID: 35634113
Convolutional codes are widely used in many communication systems due to their excellent error-control performance. High-speed…
Expand
2004
2004
Area-Efficient Architectures for the Viterbi Algorithm-Part I : Theory
C. Shung
,
Horng-Dar Lin
,
R. Cypher
,
P. Siegel
,
H. Thapar
2004
Corpus ID: 17727427
The Viterbi algorithm has been widely applied to many decoding and estimation applications in communications and signal…
Expand
2001
2001
Forward error correction codes to reduce intercarrier interference in OFDM
K. Sathananathan
,
C. Tellambura
ISCAS . The IEEE International Symposium on…
2001
Corpus ID: 12552129
Orthogonal Frequency Division Multiplexing (OFDM) is sensitive to the carrier frequency offset (CFO), which destroys…
Expand
2000
2000
ENHANCED PERFORMANCE OF FQPSK-B RECEIVER BASED ON TRELLIS-CODED VITERBI DEMODULATION
Dennis Lee
,
M. Simon
,
T. Yan
2000
Corpus ID: 55349924
A simplified Viterbi receiver with a reduced trellis and significanly less complexity is introduced with only a slight BER…
Expand
Highly Cited
1999
Highly Cited
1999
Iterative Posterior-Based Keyword Spotting Without Filler Models
M. Silaghi
,
H. Bourlard
1999
Corpus ID: 13948911
Keywords: speech Reference EPFL-CONF-82544 Record created on 2006-03-10, modified on 2017-05-12
1995
1995
A lower-complexity Viterbi algorithm
Sarvar Patel
IEEE International Conference on Acoustics…
1995
Corpus ID: 5396141
In continuous speech recognition, when using statistical language models (e.g. bigrams) a significant amount of time is used…
Expand
1991
1991
Two extensions of the Viterbi algorithm
A. Bouloutas
,
G. Hart
,
M. Schwartz
IEEE Transactions on Information Theory
1991
Corpus ID: 29207980
The problem of minimum-cost correction of a corrupted set of data that has been generated by a known finite state machine (FSM…
Expand
1989
1989
Speaker-independent recognition of connected utterances using recurrent and non-recurrent neural networks
M. Franzini
,
M. Witbrock
,
K. Lee
International Joint Conference on Neural…
1989
Corpus ID: 17884706
Connectionist learning procedures are applied to the task of speaker-independent continuous speech recognition, creating a system…
Expand
1980
1980
Asymptotically catastrophic convolutional codes
F. Hemmati
,
D. Costello
IEEE Transactions on Information Theory
1980
Corpus ID: 7540248
The minimum distance growth rate of unmerged codewords in a convolutional code is shown to depend upon the minimum average weight…
Expand