
	Where results make sense

Topic: Viterbi algorithm

Related Topics

Hidden Markov model

Convolutional code

Andrew Viterbi

Markov property

Dynamic programming

Timeline of algorithms

Chart parser

Markov chain

Maximum likelihood

Quadratic sieve

LZ77

Forward error correction

Recursion

University of Southern California

Electric motor

	Viterbi algorithm decoding method and apparatus - Patent 5504784
		Viterbi algorithm decoder, operatively coupled to the sampler, for decoding, according to Viterbi algorithm, the sampled phase angle and the sampled magnitude into a decoded symbol using a metric that limits effects on the metric's value as the difference between the sampled phase angle and the decoded symbol increases.
		The Viterbi algorithm decoder 311, by applying the Viterbi algorithm using one of the metrics as previously described, decodes the data from the sampler 309 into a code word that is used in conventional ways that are known in the art.
		The Viterbi algorithm decoder 417, by applying the Viterbi algorithm using one of the metrics as previously described, decodes the data from the deinterleaver 415 into a code word that is used in conventional ways that are known in the art.
	www.freepatentsonline.com /5504784.html (3975 words)

	Viterbi algorithm - Wikipedia, the free encyclopedia
		The Viterbi algorithm was originally conceived as an error-correction scheme for noisy digital communication links, finding universal application in decoding the convolutional codes used in CDMA and GSM digital cellular, dial modems, satellite and deep-space communications, and 802.11 wireless LANs.
		The algorithm begins by initializing T to the start probabilities: the total probability for a state is just the start probability of that state; and the Viterbi path to a start state is the singleton path consisting only of that state; the probability of the Viterbi path is the same as the start probability.
		The Viterbi path itself is computed as the corresponding argmax of that maximization, by extending the Viterbi path that leads to the current state with the next state.
	en.wikipedia.org /wiki/Viterbi_algorithm (1467 words)

	Viterbi decoder - Wikipedia, the free encyclopedia
		A viterbi decoder uses the viterbi algorithm for decodig a bitstream that has been encoding using Forward error correction based on a Convolutional code.
		Viterbi decoding was developed by Andrew J. Viterbi and published in the paper "Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm," IEEE Transactions on Information Theory, Volume IT-13, pages 260-269, in April, 1967.
		The Viterbi decoding algorithm is used in decoding trellis-coded modulation, the technique used in telephone-line modems to squeeze high spectral efficiency out of 3 kHz-bandwidth analog telephone lines.
	en.wikipedia.org /wiki/Viterbi_decoder (146 words)

	Spartanburg SC \| GoUpstate.com \| Spartanburg Herald-Journal
		The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states – called the Viterbi path – that results in a sequence of observed events, especially in the context of hidden Markov models.
		The algorithm begins by initializing T to the start probabilities: the total probability for a state is just the start probability of that state; and the Viterbi path to a start state is the singleton path consisting only of that state; the probability of the Viterbi path is the same as the start probability.
		The Viterbi path itself is computed as the corresponding argmax of that maximization, by extending the Viterbi path that leads to the current state with the next state.
	www.goupstate.com /apps/pbcs.dll/section?category=NEWS&template=wiki&text=Viterbi_algorithm (1586 words)

	Convolutional code - Wikipedia, the free encyclopedia
		For relatively small values of k, the Viterbi algorithm is universally used as it provides maximum likelihood performance and is highly parallelizable.
		Viterbi decoders are thus easy to implement in VLSI hardware and in software on CPUs with SIMD instruction sets.
		Longer constraint lengths produce more powerful codes, but the complexity of the Viterbi algorithm increases exponentially with constraint lengths, limiting these more powerful codes to deep space missions where the extra performance is easily worth the increased decoder complexity.
	en.wikipedia.org /wiki/Convolutional_code (364 words)

	CommsDesign - Crafting a Custom Viterbi Decoder for WLAN Designs
		A very simple variation of the Viterbi algorithm permits a modem to use soft decision demodulated data, that is, signals that have been quantized into multiple levels and digitized.
		The Viterbi algorithm is a recursive sequential minimization algorithm that can be used to find the least expensive way to route symbols from one edge of a state diagram to another.
		In the Viterbi decoding scheme described here, a 5-b soft decision could be used so that the transmitted bits in a symbol could be represented as 32 possible signal levels.
	www.commsdesign.com /design_corner/OEG20020131S0016 (2920 words)

	Andrew Viterbi - Wikipedia, the free encyclopedia (Site not responding. Last check: 2007-10-19)
		Andrew Viterbi (March 9, 1935) is the cofounder with Irwin Jacobs of Linkabit Corporation in 1968, a small military contractor and Qualcomm Inc. in 1985.
		He is a former professor of electrical engineering at UCLA and UCSD and inventor of the Viterbi algorithm.
		Andrew Viterbi was born in Bergamo, Italy and immigrated with his parents in 1939 to the United States as a refugee.
	www.encyclopedia-online.info /Andrew_Viterbi (185 words)

	Archives: Story
		Viterbi, 68, the son of a prominent ophthalmologist, was born in Bergamo, a northern Italian town of 100,000, with 70 resident Jews.
		Viterbi received his doctorate in electrical engineering from USC in 1962, in 1963 joined the UCLA faculty, and three years later developed his path-breaking Viterbi Algorithm.
		Actually, it was the Viterbi Algorithm, now imprinted on USC T-shirts, which opened the doors to the digital age as a groundbreaking mathematical formula for eliminating signal interference.
	www.clevelandjewishnews.com /articles/2004/08/18/features/business/jadigital0806.txt (811 words)

	Viterbi Museum Opens in Tutor Hall
		The Viterbis made the trip from their home in San Diego a day earlier to attend the Viterbi Conference and evening Viterbi Lecture, a keynote address that is delivered each year by a distinguished leader in information technology and digital communications.
		Viterbi and a handful of other prominent pioneers in satellite communication are featured on the cover of a 1958 issue of Life magazine as they studied transmissions in the control room of Explorer 1, the first U.S. satellite to orbit earth.
		Viterbi’s groundbreaking paper in 1967 describing an algorithm that would eliminate much of the interference in satellite communications at the time — the Viterbi algorithm — is also part of the collection.
	www.usc.edu /uscnews/stories/11114.html (973 words)

	Impinj: Press Release (Site not responding. Last check: 2007-10-19)
		Viterbi is a co-founder and retired Vice Chairman and Chief Technical Officer of QUALCOMM Incorporated.
		This technique, called the Viterbi Algorithm, is used in most digital cellular phones and digital satellite receivers, as well as in such diverse fields as magnetic recording, voice recognition and DNA sequence analysis.
		The Viterbi Group, LLC is an equity investment fund established in 2000 by Andrew Viterbi, a founder of Qualcomm.
	www.impinj.com /page.cfm?ID=releaseDetails&releaseId=103&releaseType=4 (462 words)

	Steve's Explanation of the Viterbi Algorithm (Site not responding. Last check: 2007-10-19)
		The motivation behind this algorithm arises from the fact that, given N states and T moments in time, calculating the probabilities of all transitions over time would be N^T probability calculations.
		The observation made by the Viterbi algorithm is that for any state at time t, there is only one most likely path to that state.
		The Viterbi algorithm does the same thing, with states over time instead of cities across the country, and with calculating the maximum probability instead of the minimal distance.
	www.cs.toronto.edu /~sengels/tutorials/viterbi.html (344 words)

	High-Performance VLSI Architecture for the Viterbi Algorithm
		The Viterbi algorithm (VA) is characterized by a graph, called a trellis, which defines the transitions between states.
		This formal model is employed for the partitioning of the computations among an arbitrary number of processors in such a way that the data are recirculated, optimizing the use of the PE's and the communications.
		Therefore, the algorithm is mapped onto a column of processing elements and an optimal design solution is obtained for a particular set of area and/or speed constraints.
	www.comsoc.org /comm/private/1997/feb/168_45comm02-boo.html (487 words)

	World Intellectual Property Organization (Site not responding. Last check: 2007-10-19)
		However, the traditional Viterbi search requires a recursive structure of the metric to be optimized, and not all MLSE problems have a recursive metric structure; thus, the traditional Viterbi algorithm cannot be applied directly in many applications.
		The Generalized Viterbi search provides an efficient, near optimal search on an optimal metric for a variety of MLSE problems that are otherwise unable to be solved by the traditional Viterbi algorithm.
		The Generalized Viterbi search takes advantage of the temporary decisions that have been made on the surviving paths, while in the traditional Viterbi search, the temporary decisions on a surviving path are not used for the incremental metric calculation for extending that surviving path.
	www.wipo.int /ipdl/IPDL-CIMAGES/view/pct/getbykey5?KEY=01/89080.011122&ELEMENT_SET=DECL (3743 words)

	A Tutorial on Convolutional Coding with Viterbi Decoding
		Following this introduction, I will provide a detailed description of the algorithms for generating random binary data, convolutionally encoding the data, passing the encoded data through a noisy channel, quantizing the received channel symbols, and performing Viterbi decoding on the quantized channel symbols to recover the original binary data.
		Convolutional encoding with Viterbi decoding is a FEC technique that is particularly suited to a channel in which the transmitted signal is corrupted mainly by additive white gaussian noise (AWGN).
		Viterbi decoding is one of two types of decoding algorithms used with convolutional encoding-the other type is sequential decoding.
	home.netcom.com /~chip.f/viterbi/tutorial.html (2090 words)

	Viterbi Algorithm for Convolutional Codes (Site not responding. Last check: 2007-10-19)
		Viterbi algorithm is used, which is a semi-optimum algorithm for maximum-likelihood decoding of convolutional codes.
		Although the interface is somewhat simple, it has interpreted the meaning and procedure of Viterbi algorithm.
		For each grid, the algorithm compares the possible paths enter one states from a previous state.
	www.csee.wvu.edu /~jian/javaApplet/decoder.htm (207 words)

	Decoding and Filtering (Site not responding. Last check: 2007-10-19)
		The Viterbi Algorithm is a soft decoding technique that manifests itself in practical, finite memory hardware.
		The Viterbi Algorithm is, in essence, a decoder which has precalculated the expected outputs of the convolutional encoder.
		The conventional analogy of the Viterbi Algorithm is a continuously running trellis hedge with many branches that diverge and converge over a distance along the trellis, with the distance representing the time axis.
	www.ee.unb.ca /thesis98/ee4000a/ch5.html (655 words)

	Project Turbo Code -- Decoding
		The decoding algorithm is similar to Viterbi algorithm in the sense that it produces soft outputs.
		While the Viterbi algorithm outputs either 0 or 1 for each estimated bit, the turbo code decoding algorithm outputs a continuous value of each bit estimate.
		While the goal of the Viterbi decoder is to minimize the code word error by finding a maximum likelihood estimate of transmitted code word, the soft output decoding attempts to minimize bit error by estimating the posterior probabilities of individual bits of the code word.
	faraday.ee.emu.edu.tr /eaince/ee562/Public/sova.htm (1004 words)

	Department Of Computer Science - USC (Site not responding. Last check: 2007-10-19)
		One key set of applications of the algorithm allows numerous cell phones to communicate without interfering with each other and today the algorithm is embedded in hundreds of millions of cell phones worldwide.
		The Viterbis’ gift is the largest ever to name an existing school of engineering and it brings the School approximately to the halfway mark in its recently announced $300 million fundraising initiative.
		The USC Viterbi School of Engineering is the only school in California, and one of only four in the nation, to house two active National Science Foundation supported Engineering Research Centers.
	www.cs.usc.edu /news/viterbi.htm (924 words)

	Andrew J Viterbi: 2005 Bejamin Franklin Medal in Electrical Engineering
		As processor efficiency increased rapidly in the 1980’s, the algorithm could be applied more readily, and began to appear in the references of articles in electrical and electronic engineering and the new field of computer sciences.
		Viterbi’s work was so valuable and so visionary that nearly three decades have passed, and scientists in many fields are still finding ways to employ this powerful decoding method, with his earliest paper receiving more citations in 2004 alone than in the first 13 years of its existence.
		Viterbi’s two earliest books on communications and information theory – his 1966 Principles of Coherent Communication, and his 1973 Principles of Digital Communication – are themselves referenced extensively, with over 600 citations to each of these works.
	www.isihighlycited.com /isi_copy/Comm_newsa01.htm (872 words)

	VITERBI ALGORITHM
		The Viterbi algorithm, named after its developer Andrew Viterbi, is a way to find the most likely sequence of hidden states (or causes) that result in a sequence of observed events.
		More technically, the Viterbi algorithm is a dynamic programming algorithm to find the hidden sequence of observations given an observed sequence of observations in a hidden Markov model.
		Recently, the terms "Viterbi path" and "Viterbi algorithm" have been applied to related dynamic programming algorithms, such as parsing, as well.
	www.websters-online-dictionary.org /definition/english/Vi/Viterbi+algorithm.html (447 words)

	USC Viterbi School of Engineering : Viterbi Algorithm
		The Viterbi Algorithm — theoretical basis for such wide-ranging applications as cell phones, DNA analysis and speech recognition — is essentially a fast way of eliminating dead ends.
		The algorithm takes the result and backtracks, throwing away all the branches that, by the rules, couldn’t have lead to the observed result.
		At the time Dr. Viterbi published his algorithm, computers weren’t up to the task of even a relatively shallow decoding.
	viterbi.usc.edu /about/viterbi/viterbi_algorithm.htm (496 words)

	USC Viterbi School of Engineering : Bold Ideas & Inventive Spirit
		Today, the Viterbi Algorithm is used in all four international standards for digital cellular telephones, as well as in data terminals, digital satellite broadcast receivers and deep space telemetry.
		Viterbi and his Linkabit associates came up with a breakthrough computer to accomplish the task and dubbed it a “microprocessor,” even though it was made up of many chips.
		A member of the USC School of Engineering Board of Councilors, Dr. Viterbi also is on the board of the Burnham Institute and the Scripps Cancer Center in La Jolla, a trustee of the Mathematical Sciences Research Institute in Berkeley and a member of the UC President’s Council for the National Laboratories.
	viterbi.usc.edu /about/viterbi/viterbi_transform_world.htm (1449 words)

	4 Algorithm
		For SAM running on a workstation, we decided that the L=2 algorithm, which reduces space use by the square root of the sequence length, would be sufficient.
		The Viterbi algorithm, used to find the single best path through a dynamic programming matrix (that is, an alignment of a sequence to a model) is, as mentioned, simpler than the forward-backward algorithm.
		With hindsight, the added programming complexity and runtime overhead of boundary conditions with the diagonal checkpoints (especially for the local and semi-local algorithms discussed next), as well as the difficulty of maintaining the Viterbi and the forward-backward routines in parallel, made this a poor choice.
	www.cse.ucsc.edu /projects/compbio/papers/samspace/node4.html (1282 words)

	ICSLP-2000 Abstract: Nguyen et al. (Site not responding. Last check: 2007-10-19)
		The Viterbi algorithm is certainly the most popular dynamic programming algorithm used in speech recognition.
		In this paper we propose a new algorithm that outperforms the Viterbi algorithm in term of complexity and of memory requirements.
		Even though the algorithm is asymptotically two times faster that the conventional Viterbi algorithm, in our experiments we measured an improvement of at least three.
	www.isca-speech.org /archive/icslp_2000/i00_4286.html (184 words)

	Pipelined Architectures For The Viterbi Algorithm (ResearchIndex)
		Abstract: The main part of the Viterbi Algorithm is a nonlinear feedback loop which presents a bottleneck for high-speed implementations.
		We propose four different solutions for increasing the computation speed of the Viterbi Algorithm, three of them are based on the utilization of pipelined systems combined with efficient scheduling methodologies and the other one is based on the simplification of the ACS recursion to cut down the critical path of the system.
		303 The Viterbi Algorithm (context) - Forney - 1973 ACM
	citeseer.ist.psu.edu /35596.html (239 words)

	Viterbi algorithm (Site not responding. Last check: 2007-10-19)
		Definition: An algorithm to compute the optimal (most likely) state sequence in a hidden Markov model given a sequence of observed outputs.
		Go to the Dictionary of Algorithms and Data Structures home page.
		Paul E. Black, "Viterbi algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology.
	www.nist.gov /dads/HTML/viterbiAlgorithm.html (88 words)

Try your search on: Qwika (all wikis)