ON THE ASYMPTOTIC PERFORMANCE OF HIERARCHICAL TRANSFORMS

被引:10
作者
DEQUEIROZ, RL
MALVAR, HS
机构
[1] Universidade de Brasilia, Universidade de Brasilia, Brasilia
关键词
D O I
10.1109/78.157308
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We derive explicit formulas for the coding gain of hierarchical transforms for a given number of stages, and the asymptotic gain as this number goes to infinity. We confirm the intuitive result that hierarchical transforms are not asymptotically optimal, that is, their coding gains do not approach the inverse of the spectral flatness measure as the number of stages goes to infinity. Examples comparing the limits for hierarchical transforms and M-band parallel systems for AR (1) signals are presented.
引用
收藏
页码:2620 / 2622
页数:3
相关论文
共 9 条
[1]   THE LAPLACIAN PYRAMID AS A COMPACT IMAGE CODE [J].
BURT, PJ ;
ADELSON, EH .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (04) :532-540
[2]  
Crochiere R., 1983, MULTIRATE DIGITAL SI
[3]  
Jayant N.C., 1984, DIGITAL CODING WAVEF
[4]  
MALVAR HS, 1991, MAY P IEEE INT C ASS, P1797
[5]  
MALVAR HS, 1991, SIGNAL PROCESSING LA
[6]   LATTICE STRUCTURES FOR OPTIMAL-DESIGN AND ROBUST IMPLEMENTATION OF 2-CHANNEL PERFECT-RECONSTRUCTION QMF BANKS [J].
VAIDYANATHAN, PP ;
HOANG, PQ .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1988, 36 (01) :81-94
[7]  
VETTERLI M, 1990, CTR2069036 COL U TEC
[8]  
WESTERINK PH, 1989, THESIS DELFT TU NETH
[9]  
WOODS JW, 1991, SUBBAND CODING IMAGE