메뉴 건너뛰기




Volumn 21, Issue 2, 2002, Pages 204-216

A graph theoretic approach for synthesizing very low-complexity high-speed digital filters

Author keywords

Computation reuse; Digital filters; High level synthesis; High performance; Low complexity; Low power; System level

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK SYNTHESIS; GRAPH THEORY; HAMILTONIANS; POLYNOMIALS; TABLE LOOKUP; THEOREM PROVING; TRANSFER FUNCTIONS; TRAVELING SALESMAN PROBLEM;

EID: 0036474435     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.980259     Document Type: Article
Times cited : (40)

References (26)
  • 7
    • 0024699067 scopus 로고
    • An improved search algorithm for the design of multiplier-less FIR filters with powers-of-two coefficients
    • July
    • (1989) IEEE Trans. Circuits Syst. , vol.36 , pp. 1044-1047
    • Samueli, H.1
  • 13
    • 0003831564 scopus 로고
    • Algorithmic and architectural techniques for low power digital signal processing
    • Ph.D. dissertation, Purdue Univ., West Lafayette, IN
    • (1990)
    • Muhammad, K.1
  • 26
    • 0008635145 scopus 로고    scopus 로고
    • Minimizing quantization effects using the TMS320 digital signal processor family
    • Texas Instrument
    • Cooper, E.1


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