Understanding retiming through maximum average-delay cycles

DOI10.1007/BF01187093MaRDI QIDQ4277377zbMATH OpenOpenAlexFDO

Authors Marios C. Papaefthymiou

Publication date 31 October 1994

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01187093

zbMATH Keywords

synchronous circuitcombinational circuitryminimum clock periodunit-delay circuitry

Mathematics Subject Classification ID

Circuits, networks (94C99) Distributed algorithms (68W15)

Recommendations

• Retiming synchronous circuitry
• Retiming: Theory and practice
• Minimization of circuit registers: Retiming revisited
• Optimizing two-phase, level-clocked circuitry
• The cut theorem—a tool for design of systolic algorithms

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3845501 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A characterization of the minimum cycle mean in a digraph
• Faster Scaling Algorithms for Network Problems
• New scaling algorithms for the assignment and minimum mean cycle problems
• On the capabilities of systolic systems
• Retiming synchronous circuitry

Cited in

(19)

• Tools and Algorithms for the Construction and Analysis of Systems
• Using fixed-point semantics to prove retiming lemmas
• Retiming-based partial scan
• Maximal delay reduction for RLC-based multi-source multi-sink bus with repeater insertion
• scientific article; zbMATH DE number 1852154 (Why is no real title available?)
• Parallelizing synchronous data-flow graphs via retiming
• Invited paper Data rate optimization in synchronous circuits
• Variables bounding based retiming algorithm.
• Minimization of circuit registers: Retiming revisited
• The Retiming Lemma: A simple proof and applications
• Minimum inserted buffers for clock period minimization
• scientific article; zbMATH DE number 1555989 (Why is no real title available?)
• Recovering cyclic schedules from delay
• A new clocking algorithm based on polynomial manipulations
• The minimal average latency of multiconfigurable pipelines
• scientific article; zbMATH DE number 3845501 (Why is no real title available?)
• Design and verification of pipelined circuits with timed Petri nets
• Implementation and Application of Automata
• An efficient algorithm for delay buffer minimization

This page was built for publication: Understanding retiming through maximum average-delay cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277377)