A FAST RECURSIVE ALGORITHM FOR THE DISCRETE SINE TRANSFORM

被引:31
作者
GUPTA, A
RAO, KR
机构
[1] Electrical Engineering Department, University of Texas at Arlington, Arlington
来源
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING | 1990年 / 38卷 / 03期
关键词
D O I
10.1109/29.106875
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
A fast recursive algorithm for the discrete sine transform (DST) is developed. An N-point DST can be generated from two identical N/2-point DST's. Besides being recursive, this algorithm requires fewer multipliers and adders than other DST algorithms. © 1990 IEEE
引用
收藏
页码:553 / 557
页数:5
相关论文
共 7 条
[1]   APPLICATION OF THE SINE-TRANSFORM METHOD IN TIME-OF-FLIGHT POSITRON-EMISSION IMAGE-RECONSTRUCTION ALGORITHMS [J].
CHENG, SNC .
IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, 1985, 32 (03) :185-192
[2]  
HOU HS, 1987, IEEE T ACOUST SPEECH, V35, P1455
[3]   FAST KARHUNEN-LOEVE TRANSFORM FOR A CLASS OF RANDOM PROCESSES [J].
JAIN, AK .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1976, 24 (09) :1023-1029
[4]   SINUSOIDAL FAMILY OF UNITARY TRANSFORMS [J].
JAIN, AK .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1979, 1 (04) :356-365
[5]  
ROSE K, 1987, NOV GLOBECOM 87 TOK
[6]  
WANG ZD, 1984, IEEE T ACOUST SPEECH, V32, P803
[7]   FAST COMPUTATIONAL ALGORITHM FOR THE DISCRETE SINE TRANSFORM [J].
YIP, P ;
RAO, KR .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1980, 28 (02) :304-307