Featured post

Top 5 books to refer for a VHDL beginner

VHDL (VHSIC-HDL, Very High-Speed Integrated Circuit Hardware Description Language) is a hardware description language used in electronic des...

Thursday, 26 May 2011

NAND Gates


NAND gates have two bits of input and a single bit of output.
Since NAND is not associative, the definition is based on AND.

In particular

NANDk(x1, x2,...,xn) = NOT( ANDk(x1, x2,...,xn) )



Thus, NANDk is the negation of ANDk.

The truth table defines the behavior of this gate. It's the negation of AND.


The function implemented by NAND gates has interesting properties:

The function is symmetric. Thus, x NAND y == y NAND x. This can be verified by using truth tables.

The function is not associative. This can be verified by using truth tables.
Because of these properties, NANDk is defined from ANDk, and not built from NAND gates.
at
Labels:

No comments:

Post a Comment

Please provide valuable comments and suggestions for our motivation. Feel free to write down any query if you have regarding this post.

Subscribe to: Post Comments (Atom)
  • SystemVerilog Queue
    Queue is a variable size, ordered collection of homogeneous elements which can grow and shrink. The size of a queue is variable similar to ...
  • SystemVerilog Modports
    Modports in SystemVerilog are used to restrict interface access within a interface. The keyword modport indicates that the directions are ...
  • UVM Interview Questions - 5
    Q31: What is virtual sequencer and virtual sequence in UVM? A virtual sequencer is a sequencer that is not connected to a driver itsel...
  • Value Change Dump (VCD) File
    Formal Definition The Value change dump (VCD) file contains information about any value changes on the selected variables. Simplified Synt...
  • Signal Declaration
    Formal Definition Signal is an object with a past history of values. A signal may have multiple drivers, each with a current value and proj...