This paper will discuss the characteristics of two scaled versions of a 32b reduced instruction set computer. A 4μm version (58mm 2 ) runs at 8MHz within 5% of expected speed, using 1.25W. The 3μm version, for which...
详细信息
This paper will discuss the characteristics of two scaled versions of a 32b reduced instruction set computer. A 4μm version (58mm 2 ) runs at 8MHz within 5% of expected speed, using 1.25W. The 3μm version, for which no additional simulation was provided, operates at 12MHz using 1.8W. Its size is 32mm 2 .
This paper describes a recently implemented program that very rapidly generates control paths for different variants of the constituent processing elements of a particular massively parallel machine, the NON-VON Super...
详细信息
ISBN:
(纸本)9780818605420
This paper describes a recently implemented program that very rapidly generates control paths for different variants of the constituent processing elements of a particular massively parallel machine, the NON-VON Supercomputer. The program, called PLATO, accepts as input a set of instruction opcodes, together with associated control information, and produces as output a functionally correct, highly area-efficient set of PLA's for the processing elements. One novel aspect of the program is its use of a channel routing algorithm to generate a Weinberger Array layout for the OR-plane of the PLA. By supporting extremely rapid generation of processing elements with different instruction sets, PLATO facilitates "rapid turnaround" architectural experimentation of a sort that would otherwise be impractical. Use of the program has already yielded major area and performance improvements in the NON-VON processing element. Many of the techniques employed in the PLATO system should prove applicable to the semi-automatic layout of processing elements for other multiprocessor machines.
The paper describes CAMP, a Computer Aided Minimization Procedure for Boolean functions. The procedure is based on theorems of switching theory and fully exploits the power of degree of adjacency. The program does not...
详细信息
ISBN:
(纸本)9780818605420
The paper describes CAMP, a Computer Aided Minimization Procedure for Boolean functions. The procedure is based on theorems of switching theory and fully exploits the power of degree of adjacency. The program does not generate any superfluous prime implicant and all the essential and selective prime implicants are chosen with no or minimum iteration. For shallow functions consisting mainly of essential prime implicants (EPIs) and a few selective prime implicants (SPIs), CAMP produces the exact minimal sum of product form. For dense functions consisting of a large number of inter-connected cyclic SPI chains, the solution may not be exactly minimal, but near minimal.
The porting, or updating of a 2.5 micron CMOS VLSI design into 1.75 micron design rules has been completed. This porting involves three major undertakings: (1) reduction of all feature sizes in accordance to the new d...
详细信息
The porting, or updating of a 2.5 micron CMOS VLSI design into 1.75 micron design rules has been completed. This porting involves three major undertakings: (1) reduction of all feature sizes in accordance to the new design rules, (2) simulation at the transistor level of the 1.75 micron circuit behavior and (3) incorporation of several new architectural features in the original topology. Despite the extent of logic changes the resulting design was completed in an extremely short period of time. This paper describes a process by which this and other VLSI designs which require state of the art performance can be transformed into a new generation of design rules in a prompt and efficient manner.
An integrated method which combines modular and standard -cell techniques with automated PLA design to implement a 16b microcomputer will be reported. A CAD system was used to achieve less than 20 man-month design time.
An integrated method which combines modular and standard -cell techniques with automated PLA design to implement a 16b microcomputer will be reported. A CAD system was used to achieve less than 20 man-month design time.
This paper will present a comparison of gate-array, mixed gate-array-custom and full custom implementations of a 32b NMOS microprocessor. Use of 5V and 3.4V on-chip supply voltages and automated gate-array design for ...
详细信息
This paper will present a comparison of gate-array, mixed gate-array-custom and full custom implementations of a 32b NMOS microprocessor. Use of 5V and 3.4V on-chip supply voltages and automated gate-array design for parts of the chip has resulted in a speed and power dissipation of 230ns/2.8W, comparable to the full-custom approach (170ns/3W) in half the design time.
The problem of optimally sizing the transistors in a digital MOS VLSI circuit is examined. Macro-models are developed and new theorems on the optimal sizing of the transistors in a critical path are presented. The res...
详细信息
ISBN:
(纸本)9780818605420
The problem of optimally sizing the transistors in a digital MOS VLSI circuit is examined. Macro-models are developed and new theorems on the optimal sizing of the transistors in a critical path are presented. The results of a design automation procedure to perform the optimization is discussed.
This paper describes a cell compiler that translates cell descriptions given in form of Boolean equations including pass transistors into layout descriptions in Caltech Intermediate Form (CIF). The translation process...
详细信息
ISBN:
(纸本)9780818605420
This paper describes a cell compiler that translates cell descriptions given in form of Boolean equations including pass transistors into layout descriptions in Caltech Intermediate Form (CIF). The translation process is constrained by given height and width of the cell and the position of each I/O signal on the boundary of the cell. Furthermore, the size of each transistor as well as power consumption can be arbitrarily chosen. This cell compiler allows routing through the cell in any direction. The cell architecture is based on PLA structures.
This paper describes a fully automated finite-state machine (FSM) synthesis system. The FSM is realized as a PLA. This synthesizer accepts a high-level description of the FSM and generates a mask level layout. Several...
详细信息
ISBN:
(纸本)9780818605420
This paper describes a fully automated finite-state machine (FSM) synthesis system. The FSM is realized as a PLA. This synthesizer accepts a high-level description of the FSM and generates a mask level layout. Several simulation models are produced at different levels of abstraction; these models can be integrated with other modules on the chip to aid in the debugging of the overall VLSI chip design. Valuable information on speed, area, and testability of the PLA can be obtained through a collection of audit programs. This system has been used to design complex controllers for many VLSI chips at AT&T Bell Laboratories. Although a PLA implementation is assumed, the system can be extended to synthesize a random logic implementation of the FSM.
This paper introduces Intel's functional CAD design environment and methodology. The generation of an accurate behavioral model for use in systems design validation and for comparisons with lower-level components ...
详细信息
ISBN:
(纸本)9780818605420
This paper introduces Intel's functional CAD design environment and methodology. The generation of an accurate behavioral model for use in systems design validation and for comparisons with lower-level components is described. The need for both an RTL and a schematics simulator in Intel's hierarchical design methodology is explained. Finally, the paper shows how these two simulators have been linked together in two ways for two different purposes: for RTL-schematics verification, and for very large logic simulation runs.
暂无评论