Results 1 - 10
of
351
Table 2. Sampling for multiple output circuits
1999
"... In PAGE 5: ... c3540 (402) c1908(72) 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 4 5 1 3 6 EX3 abdd abdd abdd abdd cube cube cube cube EX5 abdd cube EX6 Figure 3: Dynamic ordering with aBDD vs. cube based method Experiment 3 ( Table2 ): We performed another set of experiments to show the efficacy of window based methods on multiple output functions. It is known that sifting works very well for ISCAS85 cir- cuits [12] and for many circuits, there may not be scope for significant improvement.... ..."
Cited by 1
Table 1.1: Comparison of Reconfigurable Realizations for Multiple-output Functions. Performance Design time Chip area
2001
Cited by 6
Table 2.1. Behavior of faulty multiple-output circuits Inputs Fault-free
Table 7. The QSD representation of a single-digit multiplication output.
"... In PAGE 4: ... Gathering all the outputs to produce a partial product result presents a small challenge. The QSD representation of a single digit multiplication output, shown in Table7 , contains a carry-out of magnitude 2 when the output is either -9 or 9. This prohibits the use of the second step QSD adder alone as a gatherer.... ..."
Table 2: Algorithm for Synthesizing single input, multiple output mechanisms
1993
"... In PAGE 38: ...Table 2: Algorithm for Synthesizing single input, multiple output mechanisms The SIMO synthesis problem can be solved by a series of calls to SISO Synthesize as in ( Table2 ). Calls to SISO Synthesize produce a tree with isolated paths from i to each oj.... In PAGE 38: ...Table 2). Calls to SISO Synthesize produce a tree with isolated paths from i to each oj. However, this introduces a lot of redundancy in the form of common intermediate motions along these paths. The optimization algorithm in Table2 merges common motions in the paths: if the inputs I1 and I2 to two abstract mechanisms in two di erent branches of the initial tree are equivalent, we eliminate the path to I2 and connect I1 in place of I2. This eliminates repeated transformation of i to I2.... ..."
Cited by 14
Table 2.1. Behavior of faulty multiple output circuits Inputs
Table D.4. Health, Multiple Inputs and Multiple Outputs
Table 2.1. Behaviors of faulty multiple output circuits Inputs Fault-free
1999
Cited by 19
Results 1 - 10
of
351