Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

How many NAND gates are required to implement a function ?

Status
Not open for further replies.
S

smith_kang

Member level 5
Joined
Jan 22, 2005
Messages
89
Helped
4
Reputation
8
Reaction score
3
Trophy points
1,288
Activity points
861
about gates

hi all
this is something related to basics of digital ckt.
how many NAND gates are required to implement a function like ABC or is there any formula to calculate the number of gates to implement a n-variable function

thanks
 

Re: about gates

You can implement ABC as ((((AB)')' . C)')'

There is no "Formula " to calculate the number of nand gates required for any n-variable function . U simply have to deduce it using your knowledge of digital electronics . Going a bit further the number of gates required is not directly related to number of variables but the complexity in the function to be implemented . For ex. a function like ABCD will require a lot less gates than (AB)'.C.(A+B) , even though the second function has only 3 variables it is going to take a lot more gates to implement this . Hope I have cleared your doubt .
 

    S

    smith_kang

    Points: 2
    Helpful Answer Positive Rating
Re: about gates

You can create almost any combination no matter how to complicated it is by using Karnaugh Maps,

Of course, if you have a great deal of experience, no need for those,
 

Re: about gates

kukitron said:
You can create almost any combination no matter how to complicated it is by using Karnaugh Maps,

Of course, if you have a great deal of experience, no need for those,
Click to expand...
That sounds more like a look-up table. Anyway, Karnaugh maps do not give you look-up tables. It's just a systematic way of identifying redundancies to reduce gate count.
 

about gates

no there is no formulae.
 

about gates

There isn't a formula, you can use the K maps, and you can convert the logic obtenided in K maps in a logic NAND with NOt gates.
 

Re: about gates

Semiconductorman wrote:

You can implement ABC as ((((AB)')' . C)')'

You can implement ABC easier as ((ABC)')'
 

Re: about gates

I had deduced it assuming there are no 3 input nand gate available to you . Yes If you do have a 3 input nand gate .. you have it right :)
 
Re: about gates

This question is on digital circuits, but is nowhere near basics. EDA logic synthesis tools are used to answer such questions, and they can employ entire computer clusters just to compute these values.
 
Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top