However, being based on trellis codes, they are more complex than STBCs to encode and decode; they rely on a Viterbi decoder at the receiver where STBCs need only linear processing.
His work included the standard use of channel estimation and the combination of equalization, error correcting codes and modulation in which the Viterbi algorithm was used by all components.
algorithm | RSA (algorithm) | Secure Hash Algorithm | Schönhage–Strassen algorithm | Luhn algorithm | Earley's Algorithm | Dijkstra's algorithm | CYK algorithm | Viterbi algorithm | Prim's algorithm | Levenberg–Marquardt algorithm | Kosaraju's algorithm | Yarrow algorithm | sorting algorithm | Root-finding algorithm | Kruskal's algorithm | Generic Security Service Algorithm for Secret Key Transaction | Digital Signature Algorithm | Cayley–Purser algorithm | Blahut–Arimoto algorithm | Bellman–Ford algorithm | Andrew Viterbi | Algorithm | Viterbi decoder | Viterbi | Verhoeff algorithm | Vatti clipping algorithm | Sorting algorithm | Secure Hash Algorithm (disambiguation) | Schoof's algorithm |
Similarly, the Viterbi algorithm for finding the most probable state sequence corresponding to an observation sequence in a Hidden Markov model can also be formulated as a computation over a (max, ×) algebra on probabilities.
The Viterbi algorithm is one popular method of searching for the most probable parse.