Explore chapters and articles related to this topic
Digital Design with Programmable Logic Devices
Published in Suman Lata Tripathi, Sobhit Saxena, Sushanta Kumar Mohapatra, Advanced VLSI Design and Testability Issues, 2020
M. Panigrahy, S. Jena, R. L. Pradhan
PLA is a subset of PLD that includes set of programmable AND array and OR array to achieve a variety of logic functions. These Boolean functions are usually presented in sum-of-product form. Min-terms are produced by the AND plane, whereas OR plane adds the required set of min-terms to create different functions. N-type metal oxide semiconductor transistors are generally used as switches to enable interconnections between input variables and AND plane or between min-terms and OR plane.
Application-Specific Integrated Circuits
Published in Eugene D. Fabricius, Modern Digital Design and Switching Theory, 2017
PLDs are composed of programmable logic array (PLA) devices, programmable read-only memory (PROM) devices, programmable array logic (PAL) devices, and dynamic logic array (DLA) devices. They are the logical choice with which to implement two-level logic when a finished product is required as soon as possible or when frequent circuit modifications are anticipated. They are ideal for introducing students to ASIC technology due to their low cost, flexibility, and rapid turnaround time.
Controllability decomposition of dynamic-algebraic Boolean control networks
Published in International Journal of Control, 2020
Sen Wang, June Feng, Jianli Zhao, Jianwei Xia
The decomposition of logical circuit attracts many researchers (Ashenhurst, 1957; Curtis, 1962; Sasao& Butler, 1997). Using a AND-OR two-level circuit, we can construct programmablelogical circuit (pla), which can be represented as logical function (Muroga, 1979).A pla can be decomposed into two cascaded plas and in plas, the statesmay be subject to constraints (Sasao, 1989). In the literature (Wang, Feng, Yu, & Zhao, 2018), a dabcn is constructed to demonstrate a case of pla: And the pla is shown as Figure 3. The admissible set is derived as . Number theelements that . Then the strong incidence matrix and weak incidence matrix arecalculated as Calculate that The system is neither strongly controllable nor weakly controllable. Applying Algorithms 1 and 2, one derives that and The condition that for any cannot be satisfied. Thus, we cannot realise the strong controllability decomposition or weak controllability decomposition. It implicates that it is not feasible to decompose the pla into controllable subsystem and uncontrollable subsystem.