On the Complexity of MAX/MIN/AVRG Circuits
نویسندگان
چکیده
We study the complexity of a class of circuits, namely, the MAX/MIN/AVRG circuits. On the wires of these circuits are real values between 0 and 1; the functions each gate performs are MAX, MIN, and AVERAGE of fan-in 2; there can be feed-backs in the circuit. It can be shown that every such circuit has at least a \stable" solution, meaning that there is a way to set each wire to a particular value such that each gate is satis ed. However, nding a stable solution in polynomial time seems to be a tricky problem and remains unsolved. We discuss some results concern this computation model, as well as its applications. Partially supported by the NSF Aladdin center.
منابع مشابه
More Accurate Polynomial-Time Min-Max Timing Simulation
We describe a polynomial-time algorithm for min-max timing simulation of combinational circuits. Our algorithm reports conservative bounds on the propagationdelays from each primary input to each gate, for use in the timing verification of fundamental-mode asynchronous circuits. A new reconvergent fanout analysis technique is presented. Our algorithm produces more accurate results than previous...
متن کاملOn the Hardness of Simple Stochastic Games
We examine the problem of finding optimal strategies in simple stochastic games, and the equivalent problem of finding stable configurations of MIN/MAX/AVG circuits. The problem can be seen as a nontrivial extension to linear programming, but no polynomial-time algorithm is known, despite significant efforts to find such an algorithm. Our investigation will be concerned with the relative comput...
متن کاملReducing Hardware Complexity of Wallace Multiplier Using High Order Compressors Based on CNTFET
Multiplier is one of the important components in many systems such as digital filters, digital processors and data encryption. Improving the speed and area of multipliers have impact on the performance of larger arithmetic circuits that are part of them. Wallace algorithm is one of the most famous architectures that uses a tree of half adders and full adders to increase the speed and red...
متن کاملEfficient Network Flow Based Min-Cut Balanced Partitioning - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
We consider the problem of bipartitioning a circuit into two balanced components that minimizes the number of crossing nets. Previously, Kernighan and Lin type (K&L) heuristics, simulated annealing approach, and analytical methods were given to solve the problem. However, network flow (maxflow min-cut) techniques were overlooked as viable heuristics to min-cut balanced bipartition due to their ...
متن کاملMin-Max Timing Analysis and An Application to Asynchronous Circuits
Modern high-performance asynchronous circuits depend on timing constraints for correct operation, so timing analyzers are essential asynchronous design tools. In this paper, we present a 13-valued abstract waveform algebra and a polynomial-time min-max timing simulation algorithm for use in efficient, approximate timing analysis of asynchronous circuits with bounded component delays. Unlike sev...
متن کامل