programmable logic arrays are important building blocks of VLSI circuits and systems. We address the problem of optimizing the silicon area and the performances of large logicarrays. In particular we describe a gener...
详细信息
ISBN:
(纸本)9780818600265
programmable logic arrays are important building blocks of VLSI circuits and systems. We address the problem of optimizing the silicon area and the performances of large logicarrays. In particular we describe a general method for compacting a logic array defined as multiple row and column folding and we address the problem of interconnecting a PLA to the outside circuitry. We define a constrained optimization problem to achieve minimal silicon area occupation with constrained positions of electrical inputs and outputs. We present a new computer program, PLEASURE, which implements several algorithms for multiple and/or constrained PLA folding.
The authors describe technical aspects, organization details, and results of an experimental undergraduate laboratory based on field programmable gate arrays at the School of Telecommunication of Madrid, Spain. The ta...
详细信息
The authors describe technical aspects, organization details, and results of an experimental undergraduate laboratory based on field programmable gate arrays at the School of Telecommunication of Madrid, Spain. The target of the course has been to introduce concepts of ASIC (application-specific integrated circuit) design methodology such as hierarchy, modularity, simulation, and testability, using a low alternative and a design-oriented, hands-on learning approach.< >
Much research has been done to increase the efficiency for PLA test generation algorithms. However, the overall gains achieved with the increased efficiency do not keep pace with the increase in PLA size, e.g. computa...
详细信息
Much research has been done to increase the efficiency for PLA test generation algorithms. However, the overall gains achieved with the increased efficiency do not keep pace with the increase in PLA size, e.g. computation times are still excessive. For large PLAs the time needed to generate test vectors and to verify correctness of actual implementation on uniprocessor systems is quite prohibitive. However, the recent availability of multiprocessors makes possible great improvements in potential performance for test generation as well as logic/fault simulation. Research using multiprocessors for PLA testing and simulation is still in the very early stages of development.
The PLA (programmablelogic array) topological optimization problem is dealt with using folding techniques. Multiple unconstrained column folding is considered and this problem is solved using the simulated annealing ...
详细信息
The PLA (programmablelogic array) topological optimization problem is dealt with using folding techniques. Multiple unconstrained column folding is considered and this problem is solved using the simulated annealing algorithm. This algorithm is then extended to handle several types of constraints. Multiple constrained folding problems are solved using bipartite graphs. This allows the system to move only into a set of valid solutions. Comments are made concerning the experimental results obtained in the algorithm execution.< >
In this paper, the implementation of scene-based nonuniformity correction (SBNUC) algorithm is presented based on field programmable logic arrays (FPGA) for infrared focal plane arrays (IRFPA). An efficient hardware a...
详细信息
ISBN:
(纸本)9781665440714;9781665411615
In this paper, the implementation of scene-based nonuniformity correction (SBNUC) algorithm is presented based on field programmable logic arrays (FPGA) for infrared focal plane arrays (IRFPA). An efficient hardware architecture for the proposed algorithm is presented. The architecture is modeled using C++ in the High-level Synthesis (HLS) tool. Furthermore, it is implemented on an FPGA device fabricated at a 16nm technology node. According to experimental results, low resource utilization, low power consumption, and a maximum frequency of 300MHz are achieved. The simulation and MATLAB results are compared to test the accuracy in which there are close similarities.
We describe a method for developing a minimal set of four test configurations with associated minimum sets of test patterns that completely tests reprogrammableprogrammable logic arrays (PLAs) with partially programm...
详细信息
We describe a method for developing a minimal set of four test configurations with associated minimum sets of test patterns that completely tests reprogrammableprogrammable logic arrays (PLAs) with partially programmable OR-planes typically found in Complex programmablelogic Devices (CPLDs). The resultant set of test configurations and vectors detect all single and multiple stuck-at faults (including line and transistor faults) as well as all bridging faults without requiring hardware modifications in the PLA. Previous methods for testing reprogrammable PLAs have dealt only with fully programmable OR-planes.
Two versions of a minimization algorithm for multiple-valued programmable logic arrays for shared and distributed memory multiprocessor systems are presented. Both algorithms exploit the considerable parallelism avail...
详细信息
Two versions of a minimization algorithm for multiple-valued programmable logic arrays for shared and distributed memory multiprocessor systems are presented. Both algorithms exploit the considerable parallelism available in the minimization problem. Discussed are communication, synchronization, and load balancing issues under the two machine models. Limited access and the cost of the required computation prevented running of the two parallel algorithms on the actual machines; however, it was possible to run parallel algorithms for a different, but very similar, problem that required less computation. These results indicate that excellent speedups, in some cases superlinear (i.e, more than the number of processors), can be obtained from parallel implementations of this logic minimization algorithm.< >
The time required to customized a logic array circuit can be reduced to minutes by the use of laser programming without the access and resistance limitations of electrically programmable devices. A restructable logic ...
详细信息
The time required to customized a logic array circuit can be reduced to minutes by the use of laser programming without the access and resistance limitations of electrically programmable devices. A restructable logic array (RLA) that can be completely tested before packaging and can be fabricated in a standard CMOS process has been developed. Its key element is a connective laser link device. Circuits of up to 1200 gate equivalents have been restructured, and a base array of 4000 raw gate equivalents is in fabrication. A chip architecture, associated testing, and electrical design features, as well as their use in custom circuits are described.< >
A new design to reduce the overhead required for fully testable programmable logic arrays (PLAs) is proposed. This design exploits the fact that product lines in a PLA can be rearranged and grouped into few partitions...
详细信息
A new design to reduce the overhead required for fully testable programmable logic arrays (PLAs) is proposed. This design exploits the fact that product lines in a PLA can be rearranged and grouped into few partitions. Then, some extra outputs are added, one per partition, to make the whole PLA testable. Compared with the previous PLA design-for-testability techniques, the algorithm presented is very feasible, and its implementation is straightforward. Furthermore, this algorithm significantly lowers overhead and provides substantially higher fault coverage than some existing schemes.< >
A new approach to complete testing of a PLA without any auxiliary facilities is presented. PLA testability is provided by the exact minimization of the PLA in the number of product lines. A theorem about the structure...
详细信息
A new approach to complete testing of a PLA without any auxiliary facilities is presented. PLA testability is provided by the exact minimization of the PLA in the number of product lines. A theorem about the structure of a complete test set detecting all testable single and multiple crosspoint faults in such a minimal PLA is presented. It formulates the three conditions to which the complete test set satisfies. A technique for constructing complete test sets is discussed.< >
暂无评论