Synthesis Of Digital Systems Research Articles

Interval partition with bounded overlap

The paper considers an optimization technique with applications to some resource-allocation problems that arise in high-level synthesis of digital systems. In an abstract sense, the optimization problem is that of the partitioning of a set of line intervals into a minimum number of subsets such that intervals assigned to a subset satisfy certain properties. It is shown that the problem can be solved optically in O(n) time, where n is the number of line intervals. Applications of the problem to memory allocation and task scheduling are discussed. Specifically, a program called MEMAL is described for the allocation of variables to multiport memories. MEMAL has been implemented in PASCAL on a Sun/3 workstation.

Computation structures

From the Publisher: Computation Structures integrates thorough coverage of digital logic design with a comprehensive presentation of computer architecture. It contains a wealth of information for anyone who designs computers or works with computer systems. Indeed, the authors' goal is to teach people to look at systems, as a whole, without being bound by the artificial interfaces that are often used to train specialist engineers. Ward and Halstead demystify the construction of computing hardware by illustrating how it is built up from digital circuits through higher-level components to processors and memories and emphasizing how the design of hardware is affected by its intended use. The book is firmly based in the real world, with pertinent discussions of the many trade-off decisions practicing engineers must confront. Throughout the book, the authors use the running example of the MAYBE computer--a simple microarchitecture that readers can construct and operate--to establish connections between theory and real-world practice. Among the topics addressed are the digital abstracts; combinatorial devices and circuits; the synthesis of digital systems; finite-state machines; control structures and disciplines; performance measures and trade-offs; communication; interpretation; microinterpreter architectures; microprogramming; single-sequence machines; stack, register, and memory architectures; RISC machines; processes; interrupts and priorities; and architectural horizons.

An approach to minimal-time scheduling of micro-operations

The scheduling of operations is a major topic in the synthesis of digital systems from high level algorithmic specifications. Here we propose an approach which performs useful optimizations.

The high-level synthesis of digital systems

High-level synthesis systems start with an abstract behavioral specification of a digital system and find a register-transfer level structure that realizes the given behavior. The various tasks involved in developing a register-transfer level structure from an algorithmic level specification are described. In particular, it is shown how the high-level synthesis task can be decomposed into a number of distinct but not independent subtasks. The techniques that have been developed for solving those subtasks are presented. Areas related to high-level synthesis that are still open problems are examined.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

A semantic approach for modular synthesis of VLSI systems

This paper presents a methodology for automated, modular synthesis of digital systems starting from a behavioral description of the design. A semantic analysis is performed to identify presynthesized library modules that can be used to implement segments of the intended design. The problems related to datapath synthesis and decentralized control synthesis are examined. The proposed approach is illustrated with an example.

Automated Synthesis of Digital systems

This tutorial describes the automatic synthesis of digital implementations from higher-level specifications. The synthesis process is described in terms of four mechanisms: resource allocation, design transformation, composition, and scheduling. These mechanisms are illustrated with examples taken from three synthesis categories: algorithm synthesis, register-transfer synthesis, and logic synthesis. The latter two categories encompass both data-path and control design. An early history of synthesis research is given, highlighting work done at IBM and Carnegie-Mellon University. The tutorial summarizes the difficulties of automating synthesis, including the combinatorial explosion of design possibilities, the interaction between different synthesis tasks, and the difficulty of estimating design attributes such as cost and speed. Finally, the tutorial summarizes the success of automated synthesis.

The automatic synthesis of digital systems

The purpose of a digital synthesis aid is to allow a digital system architect to describe the behavior of a system to be built and to then aid him in the logic design of that system. This paper will overview several different approaches to the development of synthesis aids. The importance of key features of synthesis aids, such as the automatic generation of multilevel system representations, will also be discussed.

Introduction to Elementary Mathematical Logic.

This introduction covers the calculus of propositions as well as quantification theory. Presupposing no more than a familiarity with the most elementary principles of logic and mathematics, the book is accessible to the high-school student or the layman desiring a clear and straightforward presentation of the subject that will prepare him to take on the standard, more advanced texts. The book is carefully designed to be self-sufficient for purposes of self-study, and the exercises following the end of each section can be used by the student to gauge the level of his understanding: they serve as feedback signals that tell him if he should proceed or review the material just covered.Of particular interest is the application of the logic of propositions to the analysis and synthesis of digital systems, which is presented at the end of the first of the three sections.The first section develops the fundamentals of the logic of propositions. Taken up in turn are objects and operations; formulas, equivalent formulas, and identically true formulas; applications; normal and minimum forms of functions; and applications to digital systems.The second section covers the calculus of propositions. Material is presented on the axiomatic approach, including the consistency, independence, and completeness of a system of axioms in the calculus of propositions.The logic of predicates is the subject of the last section. It treats in some detail operations on sets, defects in the logic of propositions, operations on predicates, quantifiers, equivalent and generally valid formulas, aspects of traditional logic, equality relations, and the axiomatic derivation of the mathematical theory.References to more advanced studies available in English are provided.

The Application of Shift Registers to Secondary State Assignment: Part II

Abstract—This paper introduces a method of synthesis of digital systems and develops a theory by which this new concept may be applied to problems of both theoretical and practical significance.