Title :
On the redundancy of trellis lossy source coding
Author :
Zhou, Guangcai ; Zhang, Zhen
Author_Institution :
Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
Abstract :
Proof of theorems show that, with the same computational complexity as block codes of length n, fully connected trellis codes can achieve the same redundancy order of block codes of length n ln n.
Keywords :
redundancy; source coding; trellis codes; block code; computational complexity; distortion redundancy; fully connected trellis code; trellis lossy source coding; Block codes; Computational complexity; Concatenated codes; Decoding; Distortion measurement; Encoding; Network address translation; Source coding; Viterbi algorithm;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023310
