Relevant bibliographies by topics / Algorithme de Viterbi

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Algorithme de Viterbi'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algorithme de Viterbi.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Algorithme de Viterbi"

1

Xu, Hui Hong. "Speaker Recognition Study Based on Optimized HMM Algorithm." Advanced Materials Research 765-767 (September 2013): 2809–12. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.2809.

Full text
Abstract:
The article has carried on the optimization to the HMM algorithms Viterbi algorithm and LBG algorithm, It can be proofed that the optimized algorithm improved the text dependent recognition efficiency throgh experiment.
APA, Harvard, Vancouver, ISO, and other styles
2

Viterbi, Andrew. "Viterbi algorithm." Scholarpedia 4, no. 1 (2009): 6246. http://dx.doi.org/10.4249/scholarpedia.6246.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

GOLOD, DANIIL, and DANIEL G. BROWN. "A TUTORIAL OF TECHNIQUES FOR IMPROVING STANDARD HIDDEN MARKOV MODEL ALGORITHMS." Journal of Bioinformatics and Computational Biology 07, no. 04 (August 2009): 737–54. http://dx.doi.org/10.1142/s0219720009004242.

Full text
Abstract:
In this tutorial, we discuss two main algorithms for Hidden Markov Models or HMMs: the Viterbi algorithm and the expectation phase of the Baum–Welch algorithm, and we describe ways to improve their naïve implementations. For the Baum–Welch algorithm we first present an implementation of the expectation computations using constant space. We then discuss the classical implementation of this calculation and describe ways to reduce its space usage to logarithmic and [Formula: see text], with their respective CPU costs. We also note where each respective algorithm can be parallelized. For the Viterbi algorithm, we describe [Formula: see text] and logarithmic space algorithms which increase CPU use by a factor of two and by a logarithmic factor respectively. We also present two recent heuristics for decreasing space use, which in practice lead to logarithmic space use. Classical version of Viterbi cannot be parallelized by splitting sequence in several subsequences, but we show a parallelization that works if we are willing to pay a significant extra CPU cost. Finally we show a very simple parallelization trick which enables full usage of multiple CPUs/cores under the condition that they share memory.
APA, Harvard, Vancouver, ISO, and other styles
4

Yin, Yibo, Kainan Ma, and Ming Liu. "Temporal Convolutional Network Connected with an Anti-Arrhythmia Hidden Semi-Markov Model for Heart Sound Segmentation." Applied Sciences 10, no. 20 (October 11, 2020): 7049. http://dx.doi.org/10.3390/app10207049.

Full text
Abstract:
Heart sound segmentation (HSS) is a critical step in heart sound processing, where it improves the interpretability of heart sound disease classification algorithms. In this study, we aimed to develop a real-time algorithm for HSS by combining the temporal convolutional network (TCN) and the hidden semi-Markov model (HSMM), and improve the performance of HSMM for heart sounds with arrhythmias. We experimented with TCN and determined the best parameters based on spectral features, envelopes, and one-dimensional CNN. However, the TCN results could contradict the natural fixed order of S1-systolic-S2-diastolic of heart sound, and thereby the Viterbi algorithm based on HSMM was connected to correct the order errors. On this basis, we improved the performance of the Viterbi algorithm when detecting heart sounds with cardiac arrhythmias by changing the distribution and weights of the state duration probabilities. The public PhysioNet Computing in Cardiology Challenge 2016 data set was employed to evaluate the performance of the proposed algorithm. The proposed algorithm achieved an F1 score of 97.02%, and this result was comparable with the current state-of-the-art segmentation algorithms. In addition, the proposed enhanced Viterbi algorithm for HSMM corrected 30 out of 30 arrhythmia errors after checking one by one in the dataset.
APA, Harvard, Vancouver, ISO, and other styles
5

Minh Quang, Nguyen. "VITERBI ALGORITHM FOR ENGLISH - VIETNAMESE SENTENCE RETRIEVAL IN EBMT." Journal of Science, Educational Science 60, no. 7A (2015): 3–9. http://dx.doi.org/10.18173/2354-1075.2015-0047.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kahina, Rekkal, and Abdesselam Bassou. "Improving the Performance of Viterbi Decoder using Window System." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 1 (February 1, 2018): 611. http://dx.doi.org/10.11591/ijece.v8i1.pp611-621.

Full text
Abstract:
An efficient Viterbi decoder is introduced in this paper; it is called Viterbi decoder with window system. The simulation results, over Gaussian channels, are performed from rate 1/2, 1/3 and 2/3 joined to TCM encoder with memory in order of 2, 3. These results show that the proposed scheme outperforms the classical Viterbi by a gain of 1 dB. On the other hand, we propose a function called RSCPOLY2TRELLIS, for recursive systematic convolutional (RSC) encoder which creates the trellis structure of a recursive systematic convolutional encoder from the matrix “H”. Moreover, we present a comparison between the decoding algorithms of the TCM encoder like Viterbi soft and hard, and the variants of the MAP decoder known as BCJR or forward-backward algorithm which is very performant in decoding TCM, but depends on the size of the code, the memory, and the CPU requirements of the application.
APA, Harvard, Vancouver, ISO, and other styles
7

Muhammad, Shamsuddeen Hassan, and Abdulrasheed Mustapha. "A Form of List Viterbi Algorithm for Decoding Convolutional Codes." U.Porto Journal of Engineering 4, no. 2 (October 31, 2018): 42–48. http://dx.doi.org/10.24840/2183-6493_004.002_0004.

Full text
Abstract:
Viterbi algorithm is a maximum likelihood decoding algorithm. It is used to decode convolutional code in several wireless communication systems, including Wi-Fi. The standard Viterbi algorithm gives just one decoded output, which may be correct or incorrect. Incorrect packets are normally discarded thereby necessitating retransmission and hence resulting in considerable energy loss and delay. Some real-time applications such as Voice over Internet Protocol (VoIP) telephony do not tolerate excessive delay. This makes the conventional Viterbi decoding strategy sub-optimal. In this regard, a modified approach, which involves a form of List Viterbi for decoding the convolutional code is investigated. The technique employed combines the bit-error correction capabilities of both the Viterbi algorithm and the Cyclic Redundancy Check (CRC) procedures. It first uses a form of ‘List Viterbi Algorithm’ (LVA), which generates a list of possible decoded output candidates after the trellis search. The CRC check is then used to determine the presence of correct outcome. Results of experiments conducted using simulation shows considerable improvement in bit-error performance when compared to classical approach.
APA, Harvard, Vancouver, ISO, and other styles
8

Lou, H. L. "Implementing the Viterbi algorithm." IEEE Signal Processing Magazine 12, no. 5 (1995): 42–52. http://dx.doi.org/10.1109/79.410439.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jin, Yuzi. "The Optimization of the Dynamic Mechanism of Jilin’s Economic Revitalization from the Perspective of Viterbi Algorithm’s Supply-Side Structural Reform." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 28, Supp02 (December 2020): 111–22. http://dx.doi.org/10.1142/s0218488520400188.

Full text
Abstract:
Under the background of the rapid development of the Internet, the development information and social status that affect economic regeneration exist in the form of literal data in massive data information. The use of Viterbi algorithm can establish a digital model of information extraction, so as to quickly and accurately find the important content information in the Internet that influences the development of reform and economic rejuvenation. Therefore, based on the Viterbi algorithm, the use of mathematical models to help Jilin economic mechanism research from qualitative to quantitative, and continuously improve the scientific level of economic research. After deep analysis of the implementation principle and algorithm flow of Viterbi algorithm, and from the need of text information extraction, an optimization and update scheme is proposed to improve the effectiveness of the algorithm and the accuracy is calculated effectively based on the word feature detection. After simulation experiments show that Viterbi algorithm has a good application value in the field of Jilin economic reform research.
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Xia, Fei Long, Wenjie Zhang, and Lu Guo. "Modular Interacting Multiple Model Based on Extended Viterbi Algorithm for Maneuvering Target Tracking." Mathematical Problems in Engineering 2015 (2015): 1–6. http://dx.doi.org/10.1155/2015/374054.

Full text
Abstract:
A new maneuvering target tracking algorithm is investigated, which is modeled as a class of Markov jump linear systems (MJLS). Drawing on the experience of combination idea of the extended Viterbi algorithm (EV) and the interacting multiple model algorithm (IMM), a modular interacting multiple model based on extended Viterbi (MIMMEV) is presented. The MIMMEV algorithm consists ofNindependent interacting multiple model-extended Viterbi (IMM-EV). Furthermore, these IMM-EV filters are independent and working in parallel in the MIMMEV algorithm. According to the derived probability, the estimated state of every moment is the weighted sum of each estimator at the corresponding time. Simulation results demonstrate that the proposed algorithm improves the tracking precision and reduces the computational burden compared with traditional IMM and IMM-EV.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Algorithme de Viterbi"

1

Pelchat, Émilie. "Décodage Viterbi Dégénéré." Mémoire, Université de Sherbrooke, 2013. http://hdl.handle.net/11143/6595.

Full text
Abstract:
La correction d'erreur fera partie intégrante de toute technologie d'information quantique. Diverses méthodes de correction d'erreurs quantiques ont par conséquent été élaborées pour pallier les erreurs inévitables qui proviennent de la manipulation des qubits ainsi que de leur interaction inévitable avec l'environnement. Parmi les familles de codes de correction d'erreurs se trouvent les codes convolutifs, dont l'utilité envisagée est surtout pour protéger l'information quantique envoyée à travers un canal de communication bruyant. La méthode de décodage des codes convolutifs utilise des algorithmes d'estimation d'erreur basés sur un principe de maximum de vraisemblance. L'algorithme de Viterbi permet de déterminer ce maximum de vraisemblance de façon efficace. Cette méthode permet de trouver le mot code le plus probable et ce en utilisant des outils telle décodage par trellis. De plus, cet algorithme a une complexité linéaire avec le nombre de qubits encodés. Ce mémoire porte sur l'effet de la dégénérescence sur le décodage Viterbi. La dégénérescence est une propriété de lamécanique quantique ne possédant aucun analogue classique par laquelle des corrections distinctes peuvent corriger une erreur donnée. Les versions précédentes de décodage quantique suivant l'algorithme de Viterbi étaient sous-optimales parce qu'elles ne tenaient pas compte de la dégénérescence. La réalisation principale de ce mémoire est la conception d'un algorithme de décodage de Viterbi qui tient compte des erreurs dégénérées et nous les testons par des simulations numériques. Ces simulations démontrent qu'il y a effectivement un avantage à utiliser le décodeur Viterbi qui tient compte de la dégénérescence.
APA, Harvard, Vancouver, ISO, and other styles
2

Saidane, Mohamed. "Modèles à Facteurs Conditionnellement Hétéroscédastiques et à Structure Markovienne Cachée pour les Séries Financières." Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2006. http://tel.archives-ouvertes.fr/tel-00089558.

Full text
Abstract:
Dans cette thèse nous proposons une nouvelle approche dans le cadre des modèles d'évaluation des actifs financiers permettant de tenir compte de deux aspects fondamentaux qui caractérisent la volatilité latente: co-mouvement des rendements financiers conditionnellement hétéroscédastiques et changement de régime. En combinant les modèles à facteurs conditionnellement hétéroscédastiques avec les modèles de chaîne de Markov cachés, nous dérivons un modèle multivarié localement linéaire et dynamique pour la segmentation et la prévision des séries financières. Nous considérons, plus précisément le cas où les facteurs communs suivent des processus GQARCH univariés. L'algorithme EM que nous avons développé pour l'estimation de maximum de vraisemblance et l'inférence des structures cachées est basé sur une version quasi-optimale du filtre de Kalman combinée avec une approximation de Viterbi. Les résultats obtenus sur des simulations, aussi bien que sur des séries financières sont prometteurs.
APA, Harvard, Vancouver, ISO, and other styles
3

Bajot, Yann. "Etude et spécification d'un coeur de processeur de traitement du signal configurable pour systèmes embarques spécialisés." Paris 6, 2001. http://www.theses.fr/2001PA066262.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fang, Juing. "Décodage pondère des codes en blocs et quelques sujets sur la complexité du décodage." Paris, ENST, 1987. http://www.theses.fr/1987ENST0005.

Full text
Abstract:
Etude de la compléxité théorique du décodage des codes en blocs à travers une famille d'algorithmes basée sur le principe d'optimisation combinatoire. Puis on aborde un algorithme parallèle de décodage algébrique dont la complexitré est liée au niveau de bruit du canal. Enfin on introduit un algorithme de Viterbi pour les applications de traitement en chaînes.
APA, Harvard, Vancouver, ISO, and other styles
5

Kriouile, Abdelaziz. "La reconnaissance automatique de la parole et les modèles markoviens cachés : modèles du second ordre et distance de Viterbi à optimalité locale." Nancy 1, 1990. http://www.theses.fr/1990NAN10273.

Full text
Abstract:
Des travaux intensifs sur la reconnaissance automatique de la parole utilisant les modèles stochastiques ont été réalisés durant les cinq dernières années. L'application des modèles markoviens cachés (HMM) du premier ordre a conduit 0 des résultats impressionnants dans le domaine de la reconnaissance de mots isolés et de la parole continue. Notre objectif était de montrer que l'apport des modèles markoviens cachés à la reconnaissance automatique de la parole est d'autant plus important qu'on mène des réflexions fondamentales sur les modèles markoviens eux-mêmes et sur la façon de les appliquer. Nous avons développé une nouvelle formulation de Baum-Welch et une extension de l'algorithme de Viterbi, qui rendent les modèles markoviens cachés du second ordre efficaces en calcul pour des applications en temps réel. Il y avait une nette amélioration du taux de reconnaissance avec le second ordre. L'extension a des HMM d'ordre plus élevé a été aussi discutée. Enfin, nous avons proposé une nouvelle stratégie d'utilisation de l'algorithme de Viterbi pour la reconnaissance de la parole continue. Elle est basée sur la comparaison d'optimums locaux dans une fenêtre de trames. Cette stratégie, par bloc, a donné de meilleurs résultats que les versions classiques de l'algorithme de Viterbi. Elle permet une interaction avec d'autres processeurs.
APA, Harvard, Vancouver, ISO, and other styles
6

Baudry, Séverine. "Stratégies de codage de canal pour le tatouage de video." Paris, ENST, 2002. http://www.theses.fr/2002ENST0006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pertsinidou, Christina Elisavet. "Stochastic models for the estimation of the seismic hazard." Thesis, Compiègne, 2017. http://www.theses.fr/2017COMP2342.

Full text
Abstract:
Dans le premier chapitre, la notion d'évaluation des risques sismiques est définie et les caractéristiques sismotectoniques de la région d'étude sont brièvement présentés. Un examen rigoureux des modèles stochastiques, appliqués au domaine de la sismologie est fourni. Dans le chapitre 2, différents modèles semi-Markoviens sont développés pour étudier la sismicité des îles Ioniennes centrales ainsi que le Nord de la mer Egée (Grèce). Les quantités telles que le noyau semi-Markovien et les probabilités de destination sont évaluées, en considérant que les temps de séjour suivent les distributions géométrique, discrète Weibull et Pareto. Des résultats utiles sont obtenus pour l'estimation de la sismicité. Dans le troisième chapitre un nouvel algorithme de Viterbi pour les modèles semi-Markoviens cachés est construit, dont la complexité est une fonction linéaire du nombre d'observations et une fonction quadratique du nombre d'états cachés, la plus basse existante dans la littérature. Une extension de ce nouvel algorithme est développée pour le cas où une observation dépend de l'état caché correspondant, mais aussi de l'observation précédente (cas SM1-M1). Dans le chapitre 4 les modèles semi-Markoviens cachés sont appliquées pour étudier la sismicité du Nord et du Sud de la mer Égée. La séquence d'observation est constituée des magnitudes et des positions d’un tremblement de terre et le nouvel algorithme de Viterbi est mis en œuvre afin de décoder les niveaux des tensions cachés qui sont responsables pour la sismogenèse. Les phases précurseurs (variations des tensions cachées) ont été détectées en avertissant qu’un tremblement de terre pourrait se produire. Ce résultat est vérifié pour 70 sur 88 cas (le score optimal). Les temps de séjour du processus caché étaient supposés suivre les distributions Poisson, logarithmique ou binomiale négative, tandis que les niveaux de tensions cachés ont été classés en 2, 3 ou 4 états. Les modèles de Markov caché ont également été adaptés sans présenter des résultats intéressants concernant les phases précurseurs. Dans le chapitre 5 un algorithme de Viterbi généralisé pour les modèles semi-Markoviens cachés, est construit dans le sens que les transitions au même état caché sont autorisées et peuvent également être décodées. De plus, une extension de cet algorithme généralisé dans le contexte SM1-M1 est présentée. Dans le chapitre 6 nous modifions de manière convenable le modèle Cramér-Lundberg y compris des sinistres négatifs et positifs, afin de décrire l'évolution avec le temps des changements de contraintes de Coulomb (valeurs ΔCFF) calculées pour sept épicentres (M ≥ 6) du Nord de la mer Egée. Formules pour les probabilités de ruine sont définies sous une forme générale. Corollaires sont également formulés pour la distribution exponentielle et Pareto. L'objectif est de mettre en lumière la question suivante qui pose la problématique dans la Sismologie: Au cours d'une année pourquoi un tremblement de terre s’est produit dans une position précise et pas dans une autre position, aux régions sismotectoniquement homogènes ayant valeurs ΔCFF positives. Les résultats montrent que les nouvelles formules de probabilité peuvent contribuer à répondre au problème susmentionné
In the first chapter the definition of the seismic hazard assessment is provided, the seismotectonic features of the study areas are briefly presented and the already existing mathematical models applied in the field of Seismology are thoroughly reviewed. In chapter 2, different semi-Markov models are developed for studying the seismicity of the areas of the central Ionian Islands and the North Aegean Sea (Greece). Quantities such as the kernel and the destination probabilities are evaluated, considering geometric, discrete-Weibull and Pareto distributed sojourn times. Useful results are obtained for forecasting purposes. In the third chapter a new Viterbi algorithm for hidden semi-Markov models is developed, whose complexity is a linear function of the number of observations and a quadratic function of the number of hidden states, the lowest existing in the literature. Furthermore, an extension of this new algorithm is introduced for the case that an observation depends on the corresponding hidden state but also on the previous observation (SM1-M1 case). In chapter 4, different hidden semi-Markov models (HSMMs) are applied for the study of the North and South Aegean Sea. The earthquake magnitudes and locations comprise the observation sequence and the new Viterbi algorithm is implemented in order to decode the hidden stress field associated with seismogenesis. Precursory phases (variations of the hidden stress field) were detected warning for an anticipated earthquake occurrence for 70 out of 88 cases (the optimal model’s score). The sojourn times of the hidden process were assumed to follow Poisson, logarithmic or negative binomial distributions, whereas the hidden stress levels were classified into 2, 3 or 4 states. HMMs were also adapted without presenting significant results as for the precursory phases. In chapter 5 a generalized Viterbi algorithm for HSMMs is constructed in the sense that now transitions to the same hidden state are allowed and can also be decoded. Furthermore, an extension of this generalized algorithm in the SM1-M1 context is given. In chapter 6 we modify adequately the Cramér-Lundberg model considering negative and positive claims, in order to describe the evolution in time of the Coulomb failure function changes (ΔCFF values) computed at the locations of seven strong (M ≥ 6) earthquakes of the North Aegean Sea. Ruin probability formulas are derived and proved in a general form. Corollaries are also formulated for the exponential and the Pareto distribution. The aim is to shed light to the following problem posed by the seismologists: During a specific year why did an earthquake occur at a specific location and not at another location in seismotectonically homogeneous areas with positive ΔCFF values (stress enhanced areas). The results demonstrate that the new probability formulas can contribute in answering the aforementioned question
APA, Harvard, Vancouver, ISO, and other styles
8

Dobson, Jonathan M. "ASIC implementations of the Viterbi Algorithm." Thesis, University of Edinburgh, 1999. http://hdl.handle.net/1842/13669.

Full text
Abstract:
The Viterbi Algorithm is a popular method for decoding convolutional codes, receiving signals in the presence of intersymbol-interference, and channel equalization. In 1981 the European Telecommunications Administration (CEPT) created the Groupe Special Mobile (GSM) Committee to devise a unified pan-European digital mobile telephone standard. The proposed GSM receiver structure brings together Viterbi decoding and equilization. This thesis presents three VLSI designs of the Viterbi Algorithm with specific attention paid to the use of such modules within a GSM receiver. The first design uses a technique known as redundant number systems to produce a high speed decoder. The second design uses complementary pass-transistor logic to produce a low-power channel equalizer. The third design is a low area serial equalizer. In describing the three designs, redundant number systems and complementary pass-transistor logic are examined. It is shown that while redundant number systems can offer significant speed advantages over twos complement binary, there are other representations that can perform equally well, if not better. It will also be shown that complementary pass-transistor logic can offer a small improvement for VLSI circuits in terms of power consumption.
APA, Harvard, Vancouver, ISO, and other styles
9

Dujari, Rajeev. "Parallel Viterbi search algorithm for speech recognition." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/13111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ju, Zilong. "Fast Viterbi Decoder Algorithms for Multi-Core System." Thesis, KTH, Signalbehandling, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-98779.

Full text
Abstract:
In this thesis, fast Viterbi Decoder algorithms for a multi-core system are studied. New parallel Viterbi algorithms for decoding convolutional codes are proposed based on tail biting trellises. The performances of the new algorithms are first evaluated by MATLAB and then Eagle (E-UTRA algorithms for LTE) link level simulations where the optimal parameter settings are obtained based on various simulations. One of the algorithms is proposed for implementation in the product due to its good BLER performance and low implementation complexity. The new parallel algorithm is then implemented on target DSPs for Ericsson internal multi-core system to decode the PUSCH (Physical Uplink Shared Channel) CQI (Channel Quality Indicator) in LTE (Long Term Evolution). And the performance of the new algorithm in the real multi-core system is compared against the current implementation regarding both cycle and memory consumption. As a fast decoder, the proposed parallel Viterbi decoder is computationally efficient which reduces significantly the decoding latency and solves memory limitation problems on DSP.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Algorithme de Viterbi"

1

Couble, K. A coder-decoder chip using the viterbi algorithm. Manchester: University of Manchester,Department of Computer Science, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Turnbull, C. V. M. A coder-decoder chip using the viterbi algorithm. Manchester: University ofManchester, Department of Computer Science, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Feygin, G. Survivor sequence memory management in Viterbi Decoders. Toronto: Computer Systems Research Institute, University of Toronto, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lin, Shu. On decoding of multi-level MPSK modulation codes. Honululu, Hawaii: Dept. of Electrical Engineering, University of Hawaii at Manoa, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shu, Lin. On decoding of multi-level MPSK modulation codes. Honululu, Hawaii: Dept. of Electrical Engineering, University of Hawaii at Manoa, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Eshraghi, Aria. A reduced complexity squaring function for the Viterbi algorithm. 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

University of Hawaii at Manoa. Dept. of Electrical Engineering. and Goddard Space Flight Center, eds. On decoding of multi-level MPSK modulation codes. Honululu, Hawaii: Dept. of Electrical Engineering, University of Hawaii at Manoa, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Algorithme de Viterbi"

1

Lagoudakis, Michail G., Thomas Zeugmann, and Claude Sammut. "Viterbi Algorithm." In Encyclopedia of Machine Learning, 1025. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-30164-8_878.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wu, Jun. "Andrew Viterbi and the Viterbi algorithm." In The Beauty of Mathematics in Computer Science, 197–205. Boca Raton, FL : Taylor & Francis Group, 2019.: Chapman and Hall/CRC, 2018. http://dx.doi.org/10.1201/9781315169491-25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

De Boom, Cedric, Jasper De Bock, Arthur Van Camp, and Gert de Cooman. "Robustifying the Viterbi Algorithm." In Probabilistic Graphical Models, 160–75. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11433-0_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

van Alphen, Paul, and Jeroen Döll. "Keyword Propagation Viterbi Algorithm." In Speech Recognition and Coding, 248–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-642-57745-1_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ivaniš, Predrag, and Dušan Drajić. "Convolutional Codes and Viterbi Algorithm." In Information Theory and Coding - Solved Problems, 327–83. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49370-1_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lin, Shu, Tadao Kasami, Toru Fujiwara, and Marc Fossorier. "The Viterbi and Differential Trellis Decoding Algorithms." In Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes, 175–93. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5745-6_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mazurek, Przemysław. "Viterbi Algorithm for Noise Line Following Robots." In Advances in Intelligent Systems and Computing, 111–18. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-10662-5_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chowdhury, Rezaul, Pramod Ganapathi, Vivek Pradhan, Jesmin Jahan Tithi, and Yunpeng Xiao. "An Efficient Cache-oblivious Parallel Viterbi Algorithm." In Euro-Par 2016: Parallel Processing, 574–87. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-43659-3_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Matczak, Grzegorz, and Przemysław Mazurek. "Adjustment of Viterbi Algorithm for Line Following Robots." In Image Processing and Communications Challenges 7, 159–66. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23814-2_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Suvitha, D., M. Vijayalakshmi, and P. M. Mohideen Sameer. "Traffic Prediction Using Viterbi Algorithm in Machine Learning Approach." In Communications in Computer and Information Science, 323–33. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-8657-1_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algorithme de Viterbi"

1

Pulford, G. "The Viterbi algorithm." In IEE Seminar on Target Tracking: Algorithms and Applications. IEE, 2006. http://dx.doi.org/10.1049/ic:20060556.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Arslan, Suayb S., Jaewook Lee, and Turguy Goker. "Embedding Noise Prediction Into List-Viterbi Decoding Using Error Detection Codes for Magnetic Tape Systems." In ASME 2013 Conference on Information Storage and Processing Systems. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/isps2013-2835.

Full text
Abstract:
A List–Viterbi detector produces a rank ordered list of the N globally best candidates in a trellis search. A List–Viterbi detector structure is proposed that incorporates the noise prediction with periodic state-metric updates based on outer error detection codes (EDCs). More specifically, a periodic decision making process is utilized for a non-overlapping sliding windows of P bits based on the use of outer EDCs. In a number of magnetic recording applications, Error Correction Coding (ECC) is adversely effected by the presence of long and dominant error events. Unlike the conventional post processing methods that are usually tailored to a specific set of dominant error events or the joint modulation code trellis architectures that are operating on larger state spaces at the expense of increased implementation complexity, the proposed detector does not use any a priori information about the error event distributions and operates at reduced state trellis. We present pre-ECC bit error rate performance as well as the post-ECC codeword failure rates of the proposed detector using perfect detection scenario as well as practical detection codes as the EDCs are not essential to the overall design. Furthermore, it is observed that proposed algorithm does not introduce new error events. Simulation results show that the proposed algorithm gives improved bit error and post-ECC codeword failure rates at the expense of some increase in complexity.
APA, Harvard, Vancouver, ISO, and other styles
3

Schnall-Levin, Michael, Leonid Chindelevitch, and Bonnie Berger. "Inverting the Viterbi algorithm." In the 25th international conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1390156.1390270.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bobbin, Jason. "An incremental viterbi algorithm." In Sixth International Conference on Machine Learning and Applications (ICMLA 2007). IEEE, 2007. http://dx.doi.org/10.1109/icmla.2007.49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kerner, M., and O. Amrani. "Viterbi algorithm motives in turbo decoding." In IEEE Information Theory Workshop, 2005. IEEE, 2005. http://dx.doi.org/10.1109/itw.2005.1531865.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ji, T., and W. E. Stark. "Modified Viterbi algorithm for predictive TCQ." In Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096). IEEE, 1999. http://dx.doi.org/10.1109/dcc.1999.785689.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Jin, and Sin-Chong Park. "MIMO Detector Based on Viterbi Algorithm." In 2007 IEEE Workshop on Signal Processing Systems. IEEE, 2007. http://dx.doi.org/10.1109/sips.2007.4387528.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bongiovanni, Wilson, Adilson E. Guelfi, Elvis Pontes, A. A. A. Silva, Fen Zhou, and Sergio Takeo Kofuji. "Viterbi algorithm for detecting DDoS attacks." In 2015 IEEE 40th Conference on Local Computer Networks (LCN). IEEE, 2015. http://dx.doi.org/10.1109/lcn.2015.7366308.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Haroun, Mohamed, and Sebastien Roy. "Adaptive block-length partitioned Viterbi algorithm." In 2015 IEEE 14th Canadian Workshop on Information Theory (CWIT). IEEE, 2015. http://dx.doi.org/10.1109/cwit.2015.7255164.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pollara, Fabrizio. "Concurrent Viterbi Algorithm With Trace-Back." In 30th Annual Technical Symposium, edited by Jeffrey M. Speiser. SPIE, 1986. http://dx.doi.org/10.1117/12.936894.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Algorithme de Viterbi' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography