Using fixed-point semantics to prove retiming lemmas

DOI10.1007/BF01383944MaRDI QIDQ685101zbMATH OpenWikidataFDO

Authors Stephen Brookes

Publication date 30 September 1993

Published in Formal Methods in System Design (Search for Journal in Brave)

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

zbMATH Keywords

fixed-point semanticspipeliningretimingsystematic arrays

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• scientific article; zbMATH DE number 1089087
• Retiming synchronous circuitry
• The Retiming Lemma: A simple proof and applications
• Understanding retiming through maximum average-delay cycles
• Parallelizing synchronous data-flow graphs via retiming

Cites work

• scientific article; zbMATH DE number 3845501 (Why is no real title available?)
• scientific article; zbMATH DE number 3793435 (Why is no real title available?)
• scientific article; zbMATH DE number 3566181 (Why is no real title available?)
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines

Cited in

(1)

• The Retiming Lemma: A simple proof and applications

This page was built for publication: Using fixed-point semantics to prove retiming lemmas

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