Automated Synthesis of Data Paths in Digital Systems
- 1 July 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 5 (3), 379-395
- https://doi.org/10.1109/tcad.1986.1270207
Abstract
This paper presents a unifying procedure, called Facet, for the automated synthesis of data paths at the register-transfer level. The procedure minimizes the number of storage elements, data operators, and interconnection units. A design generator named Emerald, based on Facet, was developed and implemented to facilitate extensive experiments with the methodology. The input to the design generator is a behavioral description which is viewed as a code sequence. Emerald provides mechanisms for interactively manipulating the code sequence. Different forms of the code sequence are mapped into data paths of different cost and speed. Data paths for the behavioral descriptions of the AM2910, the AM2901, and the IBM System/370 were produced and analyzed. Designs for the AM2910 and the AM2901 are compared with commercial designs. Overall, the total number of gates required for Emerald's designs is about 15 percent more than the commercial designs. The design space spanned by the behavioral specification of the AM2901 is extensively explored.Keywords
This publication has 12 references indexed in Scilit:
- A Formal Method for the Specification, Analysis, and Design of Register-Transfer Level Digital LogicIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Automated Synthesis of Digital HardwareIEEE Transactions on Computers, 1982
- A design methodology and computer aids for digital VLSI systemsIEEE Transactions on Circuits and Systems, 1981
- The MIMOLA Design System: Detailed Description of the Software SystemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- The Mimola Design System a Computer Aided Digital Processor Design MethodPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- Automated exploration of the design space for register transfer (RT) systemsPublished by Association for Computing Machinery (ACM) ,1973
- Corrections to Bierstone's Algorithm for Generating CliquesJournal of the ACM, 1972
- An Analysis of Some Graph Theoretical Cluster TechniquesJournal of the ACM, 1970
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959