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.

[1]  Andrew J. Viterbi,et al.  Principles of Digital Communication and Coding , 1979 .

[2]  Shlomo Shamai,et al.  On the generalized symmetric cutoff rate for finite-state channels , 1994, IEEE Trans. Inf. Theory.

[3]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[4]  Ezio Biglieri.  The computational cutoff rate of channels having memory , 1981, IEEE Trans. Inf. Theory.

[5]  Erik Ordentlich,et al.  Universal portfolios with side information , 1996, IEEE Trans. Inf. Theory.

[6]  P. Varaiya,et al.  Capacity, mutual information, and coding for finite-state Markov channels , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[7]  I. Csiszár.  Information Theory , 1981 .

[8]  Rafail Krichevsky.  Universal Compression and Retrieval , 1994 .

[9]  Amos Lapidoth,et al.  On the Universality of the LZ-Based Decoding Algorithm , 1998, IEEE Trans. Inf. Theory.

[10]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[11]  I. M. Jacobs,et al.  Principles of Communication Engineering , 1965 .

[12]  Israel Bar-David,et al.  Capacity and coding for the Gilbert-Elliot channels , 1989, IEEE Trans. Inf. Theory.

[13]  Emre Telatar,et al.  The Compound Channel Capacity of a Class of Finite-State Channels , 1998, IEEE Trans. Inf. Theory.

[14]  Raphail E. Krichevsky,et al.  The performance of universal encoding , 1981, IEEE Trans. Inf. Theory.

[15]  Prakash Narayan,et al.  Reliable Communication Under Channel Uncertainty , 1998, IEEE Trans. Inf. Theory.

[16]  Jacob Ziv,et al.  Universal decoding for finite-state channels , 1985, IEEE Trans. Inf. Theory.

[17]  Shlomo Shamai,et al.  Bounds on the symmetric binary cutoff rate for dispersive Gaussian channels , 1994, IEEE Trans. Commun..

[18]  Meir Feder,et al.  Universal Decoding for Channels with Memory , 1998, IEEE Trans. Inf. Theory.

[19]  Frans M. J. Willems,et al.  The context-tree weighting method: basic properties , 1995, IEEE Trans. Inf. Theory.