메뉴 건너뛰기




Volumn 34, Issue 8, 1998, Pages 723-724

Fast DCT algorithm with fewer multiplication stages

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODING ERRORS; MATHEMATICAL TRANSFORMATIONS;

EID: 0032046275     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19980533     Document Type: Article
Times cited : (10)

References (4)
  • 2
    • 0021619710 scopus 로고
    • A new algorithm to compute the discrete cosine transform
    • LEE, B.G.: 'A new algorithm to compute the discrete cosine transform', IEEE Trans. Acoust., Speech Signal Process., 1984, ASSP-32, (6) pp. 1243-1245
    • (1984) IEEE Trans. Acoust., Speech Signal Process. , vol.ASSP-32 , Issue.6 , pp. 1243-1245
    • Lee, B.G.1
  • 3
    • 84943728327 scopus 로고
    • A fast recursive algorithm for computing the discrete cosine transform
    • HOU, H.S.: 'A fast recursive algorithm for computing the discrete cosine transform', IEEE Trans. Acoust., Speech Signal Process., 1987, ASSP-35, (10), pp. 1445-1461
    • (1987) IEEE Trans. Acoust., Speech Signal Process. , vol.ASSP-35 , Issue.10 , pp. 1445-1461
    • Hou, H.S.1


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