|
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;
COMPUTATIONAL REDUNDANCY;
DIFFERENTIAL COEFFICIENT METHOD;
HAMILTONIAN PATH;
FIR FILTERS;
|
EID: 0036474435
PISSN: 02780070
EISSN: None
Source Type: Journal
DOI: 10.1109/43.980259 Document Type: Article |
Times cited : (40)
|
References (26)
|