Loading...
Please wait, while we are loading the content...
Similar Documents
Method of Logical Synthesis of Integrated Circuits in basis K-PLA
| Content Provider | Semantic Scholar |
|---|---|
| Author | Novikov, S. |
| Copyright Year | 2006 |
| Abstract | Modern Computer-Aided Design systems of Very Large Scale Integration allow to use the chips with thousands of components as element's modules of electronic circuits. For example, ULSI-chip has complexity more than 20000 transistors. One of perspective chips (Programmable Logic Chip) has the architecture of a Programmable Logic Array (PLA). PLA can be programmed in a laboratory to perform complex functions with the help of a special equipment called by programmer (similar as PROM blower). There are different methods of the logical synthesis of circuits in PLA [1,2,3]. These integrated circuits have many advantages (simplicity of layout design, testing and modification), because the circuits are regular. Let's consider a task of designing of a digital circuit described by the system of partial many-valued logical functions in basis K-PLA , which is one from modern generalizations of PLA [4]. It is well known, that the mathematical model of functioning of the each code translator (m,r,q) of binary words is a system of partial Boolean functions. If a translator has m inputs, r outputs and reforms q binary input words with length m to q binary output words with length r, and q < 2 m , then we have a system (m,r,q) of the partial Boolean functions G={g 1 The translator (m,r,q) can be realized by a circuit with one PLA(m',r',q'), which has not less than m input pins (m' ≥ ≥ ≥ ≥ m), r output pins (r' ≥ ≥ ≥ ≥ r) and q intermediate lines (q' ≥ ≥ ≥ ≥ q). The elementary products (implicants) are realized on the intermediate lines of matrix AND of PLA, sum-of-products are realized in matrix OR of PLA. Otherwise circuits have more chips and the difficulty of the synthesis grows. Modern PLA have m' < 20, r'< 16, q' < 100, as here exist tasks designing of translators for long binary words with m ≥ ≥ ≥ ≥ 64. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.studiainformatica.ii.ap.siedlce.pl/download/67.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
