Fast Computing of Bilinear Time-Frequency Transformation

摘要：

Bilinear time-frequency transform has become an important non-stationary signal process tool. But large computation and memory cost makes it hard to real-time implement. According to the principle of kernel function spectral decomposition, this paper expresses the discrete kernel as a symmetric matrix, and by eigen-decomposition of the matrix represents the discrete bilinear time-frequency transform with the weight sum of discrete spectrograms; then the bilinear transform can be fast implemented approximate by computing the sum of partial spectrograms. The digital simulation shows that the algorithm has a smaller memory cost and a faster speed than traditional ones.

关键词： signal processing bilinear time-frequency transform eigen-decomposition fast algorithm

作者: Fan Yongsheng Yu Hongying

作者单位: Department of Computer Science and Technology, North University of China, TaiYuan 030051

会议类型: 国际会议

会议名称: 第七届国际测试技术研讨会

会议地点: 北京

会议语种:英文

在线出版日期: 2007-08-05（万方平台首次上网日期，不代表论文的发表时间）