메뉴 건너뛰기




Volumn 44, Issue 2, 1998, Pages 376-383

A refined fast 2-D discrete cosine transform algorithm with regular butterfly structure

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL TRANSFORMATIONS; PARALLEL PROCESSING SYSTEMS; VLSI CIRCUITS;

EID: 0032072374     PISSN: 00983063     EISSN: None     Source Type: Journal    
DOI: 10.1109/30.681953     Document Type: Article
Times cited : (14)

References (9)
  • 2
    • 0017981049 scopus 로고
    • On the Computation of the Discrete Cosine Transform
    • June
    • M. J. Narasimha and A. M. Peterson, "On the Computation of the Discrete Cosine Transform," IEEE Trans. Communications, Vol. COM-26, No. 6, pp. 934-936, June 1978.
    • (1978) IEEE Trans. Communications , vol.COM-26 , Issue.6 , pp. 934-936
    • Narasimha, M.J.1    Peterson, A.M.2
  • 3
    • 84943728327 scopus 로고
    • A Fast Recursive Algorithms for Computing the Discrete Cosine Transform
    • Oct.
    • H. S. Hou, "A Fast Recursive Algorithms for Computing the Discrete Cosine Transform," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, pp. 1455-1461, Oct. 1987.
    • (1987) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-35 , pp. 1455-1461
    • Hou, H.S.1
  • 4
    • 0028468177 scopus 로고
    • Restructured Recursive DCT and DST Algorithms
    • Jul.
    • PeiZong Lee and Fang-Yu Huang, "Restructured Recursive DCT and DST Algorithms," IEEE Trans. Signal Processing, vol. 42, no. 7, pp. 1600-1609, Jul. 1994.
    • (1994) IEEE Trans. Signal Processing , vol.42 , Issue.7 , pp. 1600-1609
    • Lee, P.1    Huang, F.-Y.2
  • 5
    • 0025665608 scopus 로고
    • Polynomial Transform Computation of 2-D DCT
    • Apr.
    • P. Duhamel and C. Guillemot, "Polynomial Transform Computation of 2-D DCT," in proc. ICASSP '90, pp. 1515-1518, Apr. 1990.
    • (1990) Proc. ICASSP '90 , pp. 1515-1518
    • Duhamel, P.1    Guillemot, C.2
  • 6
    • 0026925543 scopus 로고
    • Fast Algorithms for the Discrete Cosine Transform
    • Sept.
    • E. Feig and S. Winograd, "Fast Algorithms for the Discrete Cosine Transform," IEEE Trans. Signal Processing, vol. 40, no. 9, pp. 2174-2193, Sept. 1992.
    • (1992) IEEE Trans. Signal Processing , vol.40 , Issue.9 , pp. 2174-2193
    • Feig, E.1    Winograd, S.2
  • 7
    • 0026130969 scopus 로고
    • Fast Algorithm and Implementation of 2-D DCT
    • Mar.
    • N. I. Cho and S.U. Lee, "Fast Algorithm and Implementation of 2-D DCT," IEEE Trans. Circuits Syst. vol. 38, no. 3, pp. 297-305, Mar. 1991.
    • (1991) IEEE Trans. Circuits Syst. , vol.38 , Issue.3 , pp. 297-305
    • Cho, N.I.1    Lee, S.U.2
  • 8
    • 0026925031 scopus 로고
    • A Fast 4×4 DCT Algorithm for the Recursive 2-D DCT
    • Sep.
    • N. I. Cho and S.U. Lee, "A Fast 4×4 DCT Algorithm for the Recursive 2-D DCT," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-40, no. 9, pp. 2166-2173, Sep. 1992.
    • (1992) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-40 , Issue.9 , pp. 2166-2173
    • Cho, N.I.1    Lee, S.U.2
  • 9
    • 0027576186 scopus 로고
    • On the Regular Structure for the Fast 2-D DCT Algorithm
    • Apr.
    • N. I. Cho, I. D. Yun, and S.U. Lee, "On the Regular Structure for the Fast 2-D DCT Algorithm," IEEE Trans. Circuits Syst. vol. 40, no. 4, pp. 259-266, Apr. 1993.
    • (1993) IEEE Trans. Circuits Syst. , vol.40 , Issue.4 , pp. 259-266
    • Cho, N.I.1    Yun, I.D.2    Lee, S.U.3


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