Logic Circuit Design: Selected Methods
Mar 2012 · Springer Science & Business Media
4.0star
2 reviewreport
E-book
258
Mga Page
reportHindi na-verify ang mga rating at review Matuto Pa
Tungkol sa ebook na ito
In three main divisions the book covers combinational circuits, latches, and asynchronous sequential circuits. Combinational circuits have no memorising ability, while sequential circuits have such an ability to various degrees. Latches are the simplest sequential circuits, ones with the shortest memory. The presentation is decidedly non-standard.
The design of combinational circuits is discussed in an orthodox manner using normal forms and in an unorthodox manner using set-theoretical evaluation formulas relying heavily on Karnaugh maps. The latter approach allows for a new design technique called composition.
Latches are covered very extensively. Their memory functions are expressed mathematically in a time-independent manner allowing the use of (normal, non-temporal) Boolean logic in their calculation. The theory of latches is then used as the basis for calculating asynchronous circuits.
Asynchronous circuits are specified in a tree-representation, each internal node of the tree representing an internal latch of the circuit, the latches specified by the tree itself. The tree specification allows solutions of formidable problems such as algorithmic state assignment, finding equivalent states non-recursively, and verifying asynchronous circuits.
The design of combinational circuits is discussed in an orthodox manner using normal forms and in an unorthodox manner using set-theoretical evaluation formulas relying heavily on Karnaugh maps. The latter approach allows for a new design technique called composition.
Latches are covered very extensively. Their memory functions are expressed mathematically in a time-independent manner allowing the use of (normal, non-temporal) Boolean logic in their calculation. The theory of latches is then used as the basis for calculating asynchronous circuits.
Asynchronous circuits are specified in a tree-representation, each internal node of the tree representing an internal latch of the circuit, the latches specified by the tree itself. The tree specification allows solutions of formidable problems such as algorithmic state assignment, finding equivalent states non-recursively, and verifying asynchronous circuits.
Mga rating at review
4.0
2 review
I-rate ang e-book na ito
Ipalaam sa amin ang iyong opinyon.
Impormasyon sa pagbabasa
Mga smartphone at tablet
I-install ang Google Play Books app para sa Android at iPad/iPhone. Awtomatiko itong nagsi-sync sa account mo at nagbibigay-daan sa iyong magbasa online o offline nasaan ka man.
Mga laptop at computer
Maaari kang makinig sa mga audiobook na binili sa Google Play gamit ang web browser ng iyong computer.
Mga eReader at iba pang mga device
Para magbasa tungkol sa mga e-ink device gaya ng mga Kobo eReader, kakailanganin mong mag-download ng file at ilipat ito sa iyong device. Sundin ang mga detalyadong tagubilin sa Help Center para mailipat ang mga file sa mga sinusuportahang eReader.
