Convolutional interpolative coding algorithms
The authors proposed a method for decoding interpolatively encoded data. This class of coding scheme achieves higher estimation gain and are symmetric with respect to time which makes them a good candidate for storage application. They showed that different trade-off parameters are involved and inve...
Saved in:
Published in | Data Compression Conference, 1992 pp. 209 - 218 |
---|---|
Main Authors | , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE Comput. Soc. Press
1992
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The authors proposed a method for decoding interpolatively encoded data. This class of coding scheme achieves higher estimation gain and are symmetric with respect to time which makes them a good candidate for storage application. They showed that different trade-off parameters are involved and investigated their relationships. These parameters are estimation gain, delay experienced by the encoder and the decoder and end-to-end signal-to-noise ratio. They also showed the implementation and the effect of incorporating quantizers in the circuits. Specifically, they investigated two extreme open and closed loop architectures and compared their performances. Generalization of the above algorithm to noise feedback coding can be achieved easily.< > |
---|---|
ISBN: | 0818627174 9780818627170 |
DOI: | 10.1109/DCC.1992.227460 |