A description is given of system design and implementation using desktop-programmable, user-configurable gate arrays. The device's innovative antifuse architecture provides the density and performance benefits of ...
详细信息
A description is given of system design and implementation using desktop-programmable, user-configurable gate arrays. The device's innovative antifuse architecture provides the density and performance benefits of a masked gate array. Implementing a 2901 bit-slice processor using the Actel ACT 1010 and the Action logic System is also discussed.< >
An approach to implementing neural computing with Boolean programmablelogic is presented. A technique for the implementation of image morphological operations using a neural architecture is developed. Image morpholog...
详细信息
An approach to implementing neural computing with Boolean programmablelogic is presented. A technique for the implementation of image morphological operations using a neural architecture is developed. Image morphological operations, by their very nature, involve repeated computations over large data structures. Parallelism appears to be a necessary attribute of a hardware system which can efficiently perform such image analysis tasks.< >
In this paper a new approach to logic synthesis in VLSI design, based on parallel decomposition, is proposed. The idea is to use an effective method for multiple-output function reduction to select a decomposition tha...
详细信息
In this paper a new approach to logic synthesis in VLSI design, based on parallel decomposition, is proposed. The idea is to use an effective method for multiple-output function reduction to select a decomposition that yields minimal silicon area in the final implementation. Experimental results and assessment of this synthesis method are provided.
Minimal sum-of-products expressions for multiple-valued logic functions for realization by programmable logic arrays are investigated. The focus is on expressions where product terms consist of the MIN of interval lit...
详细信息
Minimal sum-of-products expressions for multiple-valued logic functions for realization by programmable logic arrays are investigated. The focus is on expressions where product terms consist of the MIN of interval literals on input variables and are combined using one of two operations, SUM or MAX. In binary logic, the question of whether or not prime implicants are sufficient to realize all functions optimally has been answered in the affirmative. The same question is considered for higher radix functions. When the combining operation is MAX, prime implicants are sufficient. However, it is shown that this is not the case with SUM. It is also shown that all functions cannot be optimally realized by successively selecting implicants that are prime with respect to the intermediate functions. In fact, the number of implicants in a solution using prime implicants successively can be significantly larger than the number of implicants in a minimal solution.< >
An evaluation is presented of a highly configurable architecture for two-dimensional arrays of powerful processors. The evaluation is based on an array of Warp cells and uses real application programs. The evaluation ...
详细信息
An evaluation is presented of a highly configurable architecture for two-dimensional arrays of powerful processors. The evaluation is based on an array of Warp cells and uses real application programs. The evaluation covers the areas of configurability, array survivability, and performance degradation. The software and algorithms developed for the evaluation are also discussed. The results based on simulations of small and medium size arrays (up to 16*16) show that a high degree of configurability and array survivability can be achieved with little impact on program performance.< >
An algorithm is developed to optimize the channel models used by many of the existing channel routers for block layout. Optimization is performed by considering the global routing information at the channel intersecti...
详细信息
An algorithm is developed to optimize the channel models used by many of the existing channel routers for block layout. Optimization is performed by considering the global routing information at the channel intersection points. An explanation is given of the motivational aspects behind the development of the proposed method and its use in resolving the bottleneck issues that are encountered during the channel definition phase.< >
The DIII-D fusion experiment uses 18 field-shaping coils (F-coils) to control the position and shape of a plasma discharge. The DIII-D F-coils are powered and controlled by configuring single or parallel operation of ...
详细信息
The DIII-D fusion experiment uses 18 field-shaping coils (F-coils) to control the position and shape of a plasma discharge. The DIII-D F-coils are powered and controlled by configuring single or parallel operation of up to 50 modular, 3-kA, 3-kHz, 2-quadrant-switching power supplies (choppers) and nine DC power supplies. The DC power supplies provide the raw power for the choppers while the choppers control the current in the F-coils. The chopper selection, control, and fault-recognition system uses state-of-the-art computer bus switching networks and programmable array logic (PAL) circuitry. The chopper selection and control system uses the computer bus switching networks to select individual chopper controls for a specific F-coil. A fault system capable of managing over 100 faults was developed using flexible PAL circuitry programmed for the application. The fault system identifies the first fault to occur and takes appropriate action for controlled safe termination of a shot. Additional faults are flagged and new responses taken if required.< >
The problem of encoding the states of a synchronous Finite State Machine (FSM), so that the area of a two-level implementation of the combinational logic is minimized, is addressed. As in previous approaches, the prob...
详细信息
The problem of encoding the states of a synchronous Finite State Machine (FSM), so that the area of a two-level implementation of the combinational logic is minimized, is addressed. As in previous approaches, the problem is reduced to the solution of the combinatorial optimization problems defined by the translation of the cover obtained by a multiple-valued logic minimization or by a symbolic minimization into a compatible boolean representation. In this paper we present algorithms for their solution, based on a new theoretical framework that offers advantages over previous approaches to develop effective heuristics. The algorithms are part of NOVA, a program for optimal encoding of control logic. Final areas averaging 20% less than other state assignment programs and 30% less than the best random solutions have been obtained. Literal counts averaging 30% less than the best random solutions have been obtained.
An approach taken to automate gas-engine/compressor skid-mounted packages is described. Design criteria and special considerations relating to the application of programmablelogic controllers (PLCs) are discussed. Us...
详细信息
An approach taken to automate gas-engine/compressor skid-mounted packages is described. Design criteria and special considerations relating to the application of programmablelogic controllers (PLCs) are discussed. Using typical industry standard specifications along with I/O lists, sequence narratives, and logic diagrams, the PLCs can be programmed to perform the desired operation. The added capabilities of the PLC enhance simulation, checkout, and startup. The presentation is based on experience gained from the installation of three reciprocating engine/compressor packages on remote unmanned platforms in the Gulf of Mexico.< >
There is much interest in the declarative languages community in integrating logic variables into functional languages. The authors give a full semantic account of such a language. They present a Plotkin-style operati...
详细信息
There is much interest in the declarative languages community in integrating logic variables into functional languages. The authors give a full semantic account of such a language. They present a Plotkin-style operational semantics for the language and an abstract semantics that expresses meanings as closure operators on a Scott domain. They also show that the denotational semantics is fully abstract with respect to the operational semantics.< >
暂无评论