메뉴 건너뛰기




Volumn 81, Issue 5, 2001, Pages 895-906

A new fast algorithm for computing prime-Length DCT through cyclic convolutions

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONVOLUTION; COSINE TRANSFORMS;

EID: 0035336715     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-1684(00)00251-6     Document Type: Article
Times cited : (14)

References (13)
  • 2
    • 0025385370 scopus 로고
    • Algorithm for prime length discrete cosine transforms
    • (February
    • Y.H. Chan, W.C. Siu, Algorithm for prime length discrete cosine transforms, Electron. Lett. 26 (3) (February 1990) 206-208.
    • (1990) Electron. Lett. , vol.26 , Issue.3 , pp. 206-208
    • Chan, Y.H.1    Siu, W.C.2
  • 3
    • 0001718975 scopus 로고
    • On the Realization of Discrete Cosine Transform Using the Distributed Arithmetic
    • (September
    • Y.H. Chan, W.C. Siu, On the Realization of Discrete Cosine Transform Using the Distributed Arithmetic, IEEE Trans. CAS 39 (9) (September 1992) 705-712.
    • (1992) IEEE Trans. CAS , vol.39 , Issue.9 , pp. 705-712
    • Chan, Y.H.1    Siu, W.C.2
  • 4
    • 0027694166 scopus 로고
    • Mixed-Radix Cosine Transform
    • (November
    • Y.H. Chan, W.C. Siu, Mixed-Radix Cosine Transform, IEEE Trans. Signal Processing 41 (11) (November 1993) 3157-3161.
    • (1993) IEEE Trans. Signal Processing , vol.41 , Issue.11 , pp. 3157-3161
    • Chan, Y.H.1    Siu, W.C.2
  • 5
    • 0029206947 scopus 로고
    • Scaled DCT's on input sizes that are composite
    • (January
    • E. Feig, E. Linzer, Scaled DCT's on input sizes that are composite, IEEE Trans. Signal Processing 43 (January 1995) 43-50.
    • (1995) IEEE Trans. Signal Processing , vol.43 , pp. 43-50
    • Feig, E.1    Linzer, E.2
  • 7
    • 0032025751 scopus 로고    scopus 로고
    • DCT Algorithms for Composite Sequence Lengths
    • (March
    • Bi. Guoan, W.Yu. Lee, DCT Algorithms for Composite Sequence Lengths, IEEE Trans. SP 46 (3) (March 1998) 554-562.
    • (1998) IEEE Trans. SP , vol.46 , Issue.3 , pp. 554-562
    • Guoan, B.1    Lee, W.Y.2
  • 8
    • 0024611765 scopus 로고
    • Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
    • (February
    • B.G. Lee, Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform, IEEE Trans. ASSP 37 (2) (February 1989) 237-244.
    • (1989) IEEE Trans. ASSP , vol.37 , Issue.2 , pp. 237-244
    • Lee, B.G.1
  • 9
    • 84994857228 scopus 로고
    • A new method to design recursive algorithms for computing the 1-D and 2-D DCT's
    • IL, September
    • P.Z. Lee, F.Y. Huang, A new method to design recursive algorithms for computing the 1-D and 2-D DCT's, Proceedings 1992, Digital Signal Processing Workshop, IL, September 1992, pp. 3.9.1-3.9.2.
    • (1992) Proceedings 1992, Digital Signal Processing Workshop , pp. 391-392
    • Lee, P.Z.1    Huang, F.Y.2
  • 10
    • 0028484419 scopus 로고
    • An efficient prime-factor algorithm for the discrete cosine transform and its hardware implementations
    • (August
    • P.Z. Lee, F.Y. Huang, An efficient prime-factor algorithm for the discrete cosine transform and its hardware implementations, IEEE Trans. SP 42 (8) (August 1994) 1996-2005.
    • (1994) IEEE Trans. SP , vol.42 , Issue.8 , pp. 1996-2005
    • Lee, P.Z.1    Huang, F.Y.2
  • 12
    • 0027574159 scopus 로고
    • Split-radix fast cosine transform algorithm
    • A.N. Skoddras, C.A. Christopoulos, Split-radix fast cosine transform algorithm, Int. J. Electron. 74 (4) (1993) 513-522.
    • (1993) Int. J. Electron. , vol.74 , Issue.4 , pp. 513-522
    • Skoddras, A.N.1    Christopoulos, C.A.2
  • 13
    • 0021481259 scopus 로고
    • Simple FFT and DCT algorithm with reduced number of operations
    • M. Vetterli, H.J. Nussbaumer, Simple FFT and DCT algorithm with reduced number of operations, Signal Processing 6 (4) (1984) 267-278.
    • (1984) Signal Processing , vol.6 , Issue.4 , pp. 267-278
    • Vetterli, M.1    Nussbaumer, H.J.2


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