6568 search results - page 90 / 1314 » Reducing the Complexity of Reductions |
186
click to vote
DATE
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
145
click to vote
IEEEPACT
2006
IEEE
16 years 5 days ago
2006
IEEE
Modern compiler transformations that eliminate redundant computations or reorder instructions, such as partial redundancy elimination and instruction scheduling, are very effectiv...
134
click to vote
ISLPED
1996
ACM
15 years 10 months ago
1996
ACM
-- By taking advantage of the redundancy in a 4-2 compressor, we reduce the number of transitions in carry-save adder trees that are common in large multipliers. Three new 4-2 comp...
159
click to vote
TON
2008
15 years 6 months ago
2008
Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying Virtual Private Networks (VPNs) and there...
164
click to vote
STVR
2002
15 years 5 months ago
2002
Test-suite reduction techniques attempt to reduce the costs of saving and reusing test cases during software maintenance by eliminating redundant test cases from test suites. A po...