140_pdfsam_VLSI TEST PRINCIPLES & ARCHITECTURES

140_pdfsam_VLSI TEST PRINCIPLES & ARCHITECTURES -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Logic and Fault Simulation 109 B A L EF G 3 G 2 J K H G 4 C G 1 ± FIGURE 3.2 The gate-level model of the combinational circuit N . 3.2.1 Gate-Level Network A gate-level network is described as the interconnections of logic gates, which are circuit elements that realize Boolean operations or expressions. The available gates to realize a Boolean expression range from the standard gates (AND, OR, NOT, NAND, and NOR) to complex gates such as XOR and XNOR. For example, the combinational circuit N 1 in Figure 3.2 is composed of an OR gate ( G 1 ), an AND gate ( G 2 ), an inverter ( G 3 ), and a NOR gate ( G 4 ). The Boolean expression associated with the network can be obtained after a few Boolean algebraic manipulations 2 : K = ±A · E + E ± ² ± = ±A + E ± ² ± = A ± · ±B + 3.2.1.1 Sequential Circuits Most logic designs are sequential circuits , which differ from combinational circuits in that their outputs depend on both the current and past input values; that is, they have memories. Sequential circuits are divided into two categories: syn-
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/16/2011 for the course ENGINEERIN mp108 taught by Professor Elbarki during the Spring '08 term at Alexandria University.

Ask a homework question - tutors are online