On the decoding of convolutional codes on an unknown channel

An algorithm is proposed for universal decoding of convolutional/trellis codes employed over unknown channels. On discrete memoryless channels and at rates below the channel´s computational cutoff rate (for a uniform input distribution), the algorithm achieves an asymptotic complexity-performance tradeoff similar to the tradeoff achieved by the Viterbi (1979) algorithm, but with the benefit that the algorithm´s implementation does not require knowledge of the channel law. The algorithm is also applicable to channels with memory, and in particular to intersymbol interference (ISI) channels, to channels with nonlinear ISI, and even to general finite-state channels