Block transform packets - An efficient approach to time-frequency decomposition

被引：1

作者：

Horng, J ^{[1
]}

Haddad, RA ^{[1
]}

机构：

[1] Polytech Univ, Dept Elect Engn, Brooklyn, NY 11201 USA

来源：

PROCEEDINGS OF THE IEEE-SP INTERNATIONAL SYMPOSIUM ON TIME-FREQUENCY AND TIME-SCALE ANALYSIS | 1998年

关键词：

D O I：

10.1109/TFSA.1998.721508

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A Block Transform Packet (BTP) is an orthonormal block transform which represents an arbitrary tiling of the time-frequency plane. This paper describes procedures for synthesizing BTP's with desirable time-frequency localization from conventional block transforms, while maintaining the computational efficiency of the progenitor transforms. Time Localizable Block Transform packets (TLBT) are constructed from the DCT while the dual Frequency Localizable Block Transform packets are synthesized starting with the time-localized Kronecker delta basis sequences. The BTP can represent a time-varying decomposition tree but requires no transition or boundary filters. This decomposition is an efficient alternative to wavelet packet decomposition. Three examples are developed to illustrate the procedure and demonstrate the enhanced compression properties of the TLBT.

引用

页码：649 / 652

页数：4