Automatic generation of cells for recurrence structures

  • Authors:

  • Avinoam Bilgory;Daniel D. Gajski

  • Affiliations:

  • -;-

  • Venue:
  • DAC '81 Proceedings of the 18th Design Automation Conference
  • Year:
  • 1981

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a method for automatic translation of functional into structural descriptions for Boolean recurrence systems. The solution of a recurrence system is accomplished by a network that requires at most four different types of cells. Given any Boolean recurrence of any order, the cell generator module defines the Boolean equations of these cells.