Maximum likelihood sequence estimation in channels with intersymbol interference and noise memory

We extend the Viterbi algorithm to observable sequences with memory and demonstrate that the complexity of the solution remains only linearly proportional to the sequence length, as long as the memory of the observable process is Markov.