Expand description
Implements encoding and decoding of the “trellis” convolutional error correcting code specified by P25.
Encoding is done with a state machine and decoding is done with the Viterbi algorithm, adapted from Coding Theory and Cryptography: The Essentials, Hankerson, Hoffman, et al, 2000.
Structs§
- Dibit
History - Dibit
States - Half-rate state machine (dibit input).
- Dibit
Walks - TrellisFSM
- Convolutional code finite state machine with the given transition table. Each fed-in symbol is used as the next state.
- Tribit
History - Tribit
States - 3/4-rate state machine (tribit input).
- Tribit
Walks - Viterbi
Decoder - Decodes a received convolutional code dibit stream to a nearby codeword using the truncated Viterbi algorithm.
- Walk
Traits§
Type Aliases§
- Dibit
Decoder - Half-rate convolution (“trellis”) code decoder.
- DibitFSM
- Half-rate convolutional (“trellis”) code state machine.
- Tribit
Decoder - 3/4-rate convolution (“trellis”) code decoder.
- TribitFSM
- 3/4-rate convolutional (“trellis”) code state machine.