Title :
On the redundancy of trellis lossy source coding
Author :
Zhou, Guangcai ; Zhang, Zhen
Author_Institution :
Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA, USA
fDate :
1/1/2002 12:00:00 AM
Abstract :
It is well known that trellis lossy source codes have better performance/complexity tradeoff than block codes, as shown by simulations. This makes the trellis coding technique attractive in practice. To get a better understanding of this fact, this paper studies the redundancy of trellis coding for memoryless sources and compares it with a similar result for block codes
Keywords :
block codes; computational complexity; memoryless systems; rate distortion theory; redundancy; source coding; trellis codes; Viterbi algorithm; block codes; block length; code length; codewords; complexity measures; computational complexity; distortion redundancy; distortion-rate function; full search encoding; memoryless sources; performance/complexity tradeoff; simulations; storage complexity; trellis lossy source codes; trellis lossy source coding; Block codes; Computational complexity; Convergence; Encoding; Loss measurement; Particle measurements; Performance loss; Rate distortion theory; Rate-distortion; Source coding;
Journal_Title :
Information Theory, IEEE Transactions on
