Moment-based fast discrete sine transforms

被引：8
|
作者：
Liu, JG [1 ]
Chan, FHY
Lam, FK
Li, HF
机构：
[1] Huazhong Univ Sci & Technol, Inst Pattern Recognit & Artificial Intelligence, Key Lab State Educ Minist Image Proc & Intelligen, Huazhong, Peoples R China
[2] Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Hong Kong, Peoples R China
[3] Concordia Univ, Dept Comp Sci, Montreal, PQ H3G 1M8, Canada
来源：
IEEE SIGNAL PROCESSING LETTERS | 2000年 / 7卷 / 08期
基金：
中国国家自然科学基金;
关键词：
discrete sine transforms; fast transformation; moment; systolic array;
D O I：
10.1109/97.855448
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
This paper presents a novel approach to compute discrete sine transforms (DST's), By using a modular mapping, DST's are approximated by the sum of a finite sequence of discrete moments. Hence, by extending our earlier technique in computing moments with an adder network only, DST's can also be implemented easily by a systolic array primarily involving additions. The method can be applied to multidimensional DST's as well as their inverses.
引用
收藏
页码：227 / 229
页数：3
相关论文
共 50 条
12345