Retiming of Circuits Containing Multiplexers - Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
نویسندگان
چکیده
Classical retiming optimization algorithnis do not consider circuits containing multiplexers or demultiplexers driven by a clock signal l , because the associated retiming equations differ from the special classical form, which make applicable conibinatorialalgorithnisofpolynomial order. In order to provide an algorithm for multiplexer circuits it is shown here that retiming, being an integer linear programming problem inherently, can be relaxed to a linear programming formulation with real valued variables. This is due to the unimodularity of the matrices of the retiming formulation. Multiplexer circuits change this property in a way, which suggests how to nse an integer linear programming problem to derive an polynoniial retiming algorithm.
منابع مشابه
Monotonicity Constraints on Path Delays for Efficient Retiming with Localized Clock Skew and Variable Register Delay
Clock skew and delay characteristics associated with practical registers are signi$cant factors affecting the retiming of synchronous circuits. Although work recently reported using branch and bound techniques offers a means for effective retiming taking these factors into account, the computational complexity involved is substantially greater than that associated with less general retiming alg...
متن کاملPower-Up Delay for Retiming Digital Circuits
Retiming is sometimes used to optimize gate-level sequential designs. This technique allows memory elements to be moved across combinational elements. Unfortunately, retiming may cause the environment of a design to wait for a few additional clock cycles after power-up to guarantee the same behavior as the original design. Leiserson and Saxe [1] presented a bound on this number of clock cycles;...
متن کاملGuest Editorial Special Issue on the 2016 IEEE International Symposium on Circuits and Systems (ISCAS 2016)
متن کامل
Time and Frequency Split Zak Transform for Finite Gabor Expansion - Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
The relationship between finite discrete Zak transform and finite Gabor expansion are well discussed in this paper. In this paper, we present two DFT-based algorithms for computing Gabor coefficients. One is based upon the time-split Zak transform, the other is frequencysplit Zak transform. These two methods are time and frequency dual pairs. Furthermore, we extend the relationship between fini...
متن کاملGuest Editorial - Special Issue on Selected Papers From BioCAS2009
T HIS special issue of the IEEE TRANSACTIONS ON BIOMEDICAL CIRCUITS AND SYSTEMS is devoted to topics from the 2009 IEEE International Symposium on Circuits and Systems (ISCAS 2009), held on May 24–27, 2009, at the Taipei International Convention Centre in Taipei, Taiwan. The IEEE ISCAS conference is the world’s premier networking forum of leading researchers in the highly active fields of theor...
متن کامل