Journal of the Korean Institute of Telematics and Electronics (대한전자공학회논문지)
- Volume 21 Issue 6
- /
- Pages.70-77
- /
- 1984
- /
- 1016-135X(pISSN)
A Fast Computational Algorithm for the Discrete Sine Transform
DST를 위한 고속 계산 알고리즘
Abstract
This paper represents a fast computational algorithm for the discrete sine transform defined by Kekre and Solanki. Techniques are developed to factor the discrete sine trans form matrix into M=log2 2N matrices, where the number(N) of sampled data points is a power of two. Each factorial matrix contains not more than two non-zero real elem tints in any row or column. As a result of this method, the exact a배orithm for the fast discrete sine transform is accomplished. The algorithm is illustiated by a signal flow graph, which may be readily translated to hardware or software implementation.
Keywords