Trellis (graph)
 |
A trellis is a graph whose nodes are ordered into vertical slices (time) with each node at each time connected to at least one node at an earlier and at least one node at a later time. The earliest and latest times in the trellis have only one node.
Trellises are used in encoders and decoders for communication theory and encryption. They are also the central datatype used in Baum–Welch algorithm or the Viterbi Algorithm[1] for Hidden Markov Models.
References
- ^ Ryan, M. S., & Nudd, G. R. (1993). The viterbi algorithm. University of Warwick, Department of Computer Science.
See also
.svg){kind=small} | This combinatorics-related article is a stub. You can help Wikipedia by expanding it. |
 | This technology-related article is a stub. You can help Wikipedia by expanding it. |