作者: Levent Aksoy , Eduardo Costa , Paulo Flores , Jose Monteiro
DOI: 10.1109/ICECS.2006.379897
关键词:
摘要: In this work two heuristic algorithms are presented for the problems of optimization area and under a delay constraint in digital filter synthesis. The heuristics search solution on combinational network that represents covering problem using greedy method partial term selection. methods start from outputs towards inputs each coefficient. This top-down approach considers much larger space than existing bottom-up algorithms. We present results wide range instances compare them with exact prominent demonstrate solutions obtained by proposed extremely close to significantly better