Sciweavers

10718 search results - page 235 / 2144
» On the Circuit Implementation Problem
Sort
View
HPCN
1997
Springer
15 years 9 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher
124
Voted
DAGSTUHL
2006
15 years 6 months ago
Approximability of Minimum AND-Circuits
Given a set of monomials, the Minimum AND-Circuit problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that t...
Jan Arpe, Bodo Manthey
DAC
1999
ACM
16 years 6 months ago
Retiming for DSM with Area-Delay Trade-Offs and Delay Constraints
The concept of improving the timing behavior of a circuit by relocating registers is called retiming and was first presented by Leiserson and Saxe. They showed that the problem of...
Abdallah Tabbara, Robert K. Brayton, A. Richard Ne...
106
Voted
ASPDAC
2005
ACM
89views Hardware» more  ASPDAC 2005»
15 years 7 months ago
Optimal placement by branch-and-price
— Circuit placement has a large impact on all aspects of performance; speed, power consumption, reliability, and cost are all affected by the physical locations of interconnected...
Pradeep Ramachandaran, Ameya R. Agnihotri, Satoshi...
133
Voted
ICASSP
2011
IEEE
14 years 8 months ago
Reduced-hardware digital filter design via joint quantization and multiple constant multiplication optimization
The focus of this paper is to provide a framework for the joint optimization of both the coefficient quantization and multiple constant multiplication (MCM) problems. It is known...
Matthew B. Gately, Mark B. Yeary, Choon Yik Tang