Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion
- 1 January 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 23 (1) , 71-83
- https://doi.org/10.1109/tit.1977.1055657
Abstract
The theory of sliding-block codes (nonlinear, time-invariant, discrete-time filters) is employed to obtain general source coding theorems for ergodic sources using time-invariant trellis coding (time-invariant decoding filter and replicating trellis). The results are coupled with the theory of universal block source codes to obtain universal trellis source coding theorems for classes of sources. It is shown for a certain class of sources that the problem of designing good trellis codes is equivalent to that of simulating general random processes by filtering digital memoryless sources.Keywords
This publication has 23 references indexed in Scilit:
- The maximum mutual information between two random processesInformation and Control, 1977
- Block and sliding-block source codingIEEE Transactions on Information Theory, 1977
- Sliding-block joint source/noisy-channel coding theoremsIEEE Transactions on Information Theory, 1976
- Tree coding of discrete-time abstract alphabet stationary block-ergodic sources with a fidelity criterionIEEE Transactions on Information Theory, 1976
- Tree encoding of speechIEEE Transactions on Information Theory, 1975
- Sliding-block source codingIEEE Transactions on Information Theory, 1975
- On tree coding with a fidelity criterionIEEE Transactions on Information Theory, 1975
- Nonblock Source Coding with a Fidelity CriterionThe Annals of Probability, 1975
- Trellis Encoding of memoryless discrete-time sources with a fidelity criterionIEEE Transactions on Information Theory, 1974
- Information rates of autoregressive processesIEEE Transactions on Information Theory, 1970