메뉴 건너뛰기




Volumn 149, Issue 1, 2002, Pages 17-24

Design of efficient architectures for discrete orthogonal transforms using bit level systolic structures

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COSINE TRANSFORMS; DISCRETE FOURIER TRANSFORMS; FIELD PROGRAMMABLE GATE ARRAYS; IMAGE PROCESSING; LOGIC DESIGN; MATHEMATICAL MODELS; MATRIX ALGEBRA; SIGNAL PROCESSING; VECTORS;

EID: 0036187481     PISSN: 13502387     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-cdt:20020159     Document Type: Article
Times cited : (12)

References (19)
  • 7
    • 0008576379 scopus 로고    scopus 로고
  • 14
    • 0025517054 scopus 로고
    • Systolic architectures for the computation of the discrete Hartley and the discrete cosine transforms based on prime-factor decomposition
    • (1990) IEEE Trans. Comput. , vol.39 , pp. 1359-1368
    • Chakrabarti, B.1    Ja'ja', J.2


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