A built-in self-test (BIST) design method for large embedded CMOS folded programmable logic arrays (PLAs) is presented that is based on a deterministic, function-independent structural method. It requires about half t...
详细信息
A built-in self-test (BIST) design method for large embedded CMOS folded programmable logic arrays (PLAs) is presented that is based on a deterministic, function-independent structural method. It requires about half the testing time and comparable area overhead of deterministic BIST methods applied to corresponding nonfolded PLAs. Tests to detect stuck-at, bridging, cross-point and stuck-open faults are given.< >
The authors describe a design-for-testability strategy for the SYCO control section compiler (CPC). The SYCO CPC translates high-level descriptions into mask-level specification for hierarchical control sections, whic...
详细信息
The authors describe a design-for-testability strategy for the SYCO control section compiler (CPC). The SYCO CPC translates high-level descriptions into mask-level specification for hierarchical control sections, which are composed of a stack of control section slices, each one organized around a programmablelogic array. The proposed design-for-testability scheme is called UBIST (unified built-in self-test) and ensures a high quality for all tests needed for integrated circuits (i.e. online and offline tests). The authors elucidate the concept of UBIST and show how to modify SYCO CPC data structure and its automatic layout synthesizer to generate UBIST control sections automatically and efficiently.< >
A class of optimization algorithms for finding the global minimum of functions of continuous variables is presented. These algorithms merge conventional local minima search strategies with the stimulated annealing (SA...
详细信息
A class of optimization algorithms for finding the global minimum of functions of continuous variables is presented. These algorithms merge conventional local minima search strategies with the stimulated annealing (SA) technique. The rationale behind these algorithms is discussed, and a complete description is given of one of them, derived from the Hooke and Jeeves (1961) search method. Tests made on mathematical functions show an increase up to two orders of magnitudes in efficiency with respect to a conventional SA algorithm. An example of application to VLSI design is given.< >
The authors present a novel state assignment technique for synchronous finite state machines (FSMs) that are implemented as single programmable logic arrays (PLAs) using Johnson counters as state memories. The goal is...
详细信息
The authors present a novel state assignment technique for synchronous finite state machines (FSMs) that are implemented as single programmable logic arrays (PLAs) using Johnson counters as state memories. The goal is to minimize the number of product terms in the PLAs and thus the overall area of the FSMs. The authors use a three-step approach to achieve this. First, the FSM description is adapted to allow an optimal use of the computer properties; then the counter is embedded by ordering the internal states of the FSM; and finally the states are coded. The product term reductions obtained are, on the average 20% to 30% compared to conventional D-latch-based FSM implementations.< >
A novel architecture for CMOS electrically configurable gate arrays using a two-terminal antifuse element is described. The architecture is extensible and can provide a level of integration comparable to mask-programm...
详细信息
A novel architecture for CMOS electrically configurable gate arrays using a two-terminal antifuse element is described. The architecture is extensible and can provide a level of integration comparable to mask-programmable gate arrays. This is accomplished by using a conventional gate array organization with rows of logic modules separated by wiring channels. Each channel contains segmented wiring tracks. The overhead need to program the antifuses is minimized by an addressing scheme that utilizes the wiring segments, pass transistors between adjacent segments, shared control lines, and serial addressing circuitry at the periphery of the array. By providing sufficient wiring tracks segmented into carefully chosen lengths and a logic module with a high degree of symmetry, fully automated placement and routing is facilitated.< >
A methodology in which it is not necessary to compute the entire offset is presented, that still provides a global picture. This scheme has been implemented in ESPRESSO with an interface to the multilevel minimization...
详细信息
A methodology in which it is not necessary to compute the entire offset is presented, that still provides a global picture. This scheme has been implemented in ESPRESSO with an interface to the multilevel minimization environment MIS. Initial results show that for functions for which the ratio of the size of the cover to the size of the don't care set is small, the new approach is much faster. The initial interest was to use this mainly in a multilevel logic synthesis system where the desired don't care sets are typically large. Some results in this environment are given, and the new scheme is compared with ESPRESSO.< >
In this paper, reliable algorithms are developed to perform inner-outer, coprime, and spectral factorizations for discrete FDLTI systems. It is shown that the discrete algebraic Riccati equation plays an important rol...
详细信息
In this paper, reliable algorithms are developed to perform inner-outer, coprime, and spectral factorizations for discrete FDLTI systems. It is shown that the discrete algebraic Riccati equation plays an important role in obtaining state-space representations for all key factorizations. The implementation of algorithms can be carried out efficiently using real matrix operations.
A heuristic algorithm for assigning input variables to the decoders of a decoded-programmablelogic array (PLA) is presented. In this algorithm, the number of inputs to each decoder is not restricted to two and the ar...
详细信息
A heuristic algorithm for assigning input variables to the decoders of a decoded-programmablelogic array (PLA) is presented. In this algorithm, the number of inputs to each decoder is not restricted to two and the area overhead incurred by using multi-input decoders is considered in the cost function. Experimental results show that the areas of multi-input decoded-PLAs designed by this algorithm are smaller in many cases than those of decoded-PLAs with two-input decoders or standard PLAs.< >
The 900-gate XC3090 CMOS user-programmable gate array is the largest member of a family of devices based on a second-generation logic cell array (LCA) architecture. This architecture features three types of user-confi...
详细信息
The 900-gate XC3090 CMOS user-programmable gate array is the largest member of a family of devices based on a second-generation logic cell array (LCA) architecture. This architecture features three types of user-configurable elements: an interior array of logic blocks, a perimeter of input/output (I/O) blocks, and interconnection resources. Configuration is established by programming internal static memory cells that determine the logic functions and interconnections. An IC design and layout methodology based on modularity combined with the use of advanced processing technology allowed this architecture to be extended to 9000 usable gates. Architectural resources were designed to allow for a range of logic densities without compromising overall performance. User-programmable gate arrays can be used in place of conventional, mask-programmed gate arrays for the majority of digital designs.< >
暂无评论