Struct p25::coding::trellis::TrellisFSM

pub struct TrellisFSM<S: States> { /* fields omitted */ }

Convolutional code finite state machine with the given transition table. Each fed-in symbol is used as the next state.

Methods

impl<S: States> TrellisFSM<S>

pub fn new() -> TrellisFSM<S>

Construct a new TrellisFSM at the initial state.

pub fn feed(&mut self, input: S::Symbol) -> (Dibit, Dibit)

Apply the given symbol to the state machine and return the dibit pair on the transition.

pub fn finish(&mut self) -> (Dibit, Dibit)

Flush the state machine with the finishing symbol and return the final transition.