메뉴 건너뛰기




Volumn 2, Issue , 2003, Pages 501-504

Cooley-Tukey FFT like algorithms for the DCT

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SOFTWARE; MATHEMATICAL MODELS; POLYNOMIALS;

EID: 0141565306     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (25)

References (13)
  • 2
    • 0031636309 scopus 로고    scopus 로고
    • FFTW: An adaptive software architecture for the FFT
    • M. Frigo and S. G. Johnson, "FFTW: An adaptive software architecture for the FFT," in Proc. ICASSP, 1998, vol. 3, pp. 1381-1384, http://www.fftw.org.
    • (1998) Proc. ICASSP , vol.3 , pp. 1381-1384
    • Frigo, M.1    Johnson, S.G.2
  • 5
    • 0022674146 scopus 로고
    • A Fast Algorithm for the Cosine Transform Based on Successive Order Reduction of the Chebyshev Polynomial
    • Y. Morikawa, H. Hamada, and N. Yamane, "A Fast Algorithm for the Cosine Transform Based on Successive Order Reduction of the Chebyshev Polynomial," Elec. and Comm. in Japan, Part 1, vol. 69, no. 3, pp. 173-180, 1986.
    • (1986) Elec. and Comm. in Japan, Part 1 , vol.69 , Issue.3 , pp. 173-180
    • Morikawa, Y.1    Hamada, H.2    Yamane, N.3
  • 6
    • 84966222128 scopus 로고
    • A Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
    • G. Steidl and M. Tasche, "A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms," Mathematics in Computation, vol. 56, no. 193, pp. 281-296, 1991.
    • (1991) Mathematics in Computation , vol.56 , Issue.193 , pp. 281-296
    • Steidl, G.1    Tasche, M.2
  • 7
    • 0026925543 scopus 로고
    • Fast Algorithms for the Discrete Cosine Transform
    • E. Feig and S. Winograd, "Fast Algorithms for the Discrete Cosine Transform," IEEE Trans, on Signal Processing, vol. 40, no. 9, pp. 2174-2193, 1992.
    • (1992) IEEE Trans, on Signal Processing , vol.40 , Issue.9 , pp. 2174-2193
    • Feig, E.1    Winograd, S.2
  • 8
    • 0035446682 scopus 로고    scopus 로고
    • Automatic Generation of Fast Discrete Signal Transforms
    • S. Egner and M. Püschel, "Automatic Generation of Fast Discrete Signal Transforms," IEEE Trans, on Signal Processing, vol. 49, no. 9, pp. 1992-2002, 2001.
    • (2001) IEEE Trans, on Signal Processing , vol.49 , Issue.9 , pp. 1992-2002
    • Egner, S.1    Püschel, M.2
  • 9
    • 84954231636 scopus 로고    scopus 로고
    • The Discrete Trigonometric Transforms and Their Fast Algorithms: An Algebraic Symmetry Approach
    • M. Püschel and J. M. F. Moura, "The Discrete Trigonometric Transforms and Their Fast Algorithms: An Algebraic Symmetry Approach," in Proc. 10th IEEE DSP Workshop, 2002.
    • (2002) Proc. 10th IEEE DSP Workshop
    • Püschel, M.1    Moura, J.M.F.2
  • 10
    • 0141473171 scopus 로고    scopus 로고
    • The Algebraic Approach to the Discrete Cosine and Sine Transforms and their Fast Algorithms
    • M. Püschel and J. M. F. Moura, "The Algebraic Approach to the Discrete Cosine and Sine Transforms and their Fast Algorithms," 2003, submitted to SIAM Journal of Computing.
    • (2003) SIAM Journal of Computing
    • Püschel, M.1    Moura, J.M.F.2
  • 12
    • 0039928421 scopus 로고
    • Fast Radix-p Discrete Cosine Transform
    • G. Steidl, "Fast Radix-p Discrete Cosine Transform," Appl. Algebra Engrg. Comm. Comp., vol. 3, pp. 39-46, 1992.
    • (1992) Appl. Algebra Engrg. Comm. Comp. , vol.3 , pp. 39-46
    • Steidl, G.1
  • 13
    • 0032025751 scopus 로고    scopus 로고
    • DCT Algorithms for Composite Sequence Lengths
    • G. Bi and L. W. Yu, "DCT Algorithms for Composite Sequence Lengths," IEEE Trans, on Signal Processing, vol. 46, no. 3, pp. 554-562, 1998.
    • (1998) IEEE Trans, on Signal Processing , vol.46 , Issue.3 , pp. 554-562
    • Bi, G.1    Yu, L.W.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.