Re: Help on NAND gates

Article View: aus.computers.logic-prog

Article #462

Back to aus.computers.logic-prog Previous Next

#462

From: Pablo Varela
Date: Wed, 07 May 1997 00:00

17 lines
1303 bytes

felixmeister wrote:
> 
> Can anyone please help with a problem.
> 
> How can you show that any minimal AND/OR circuit can be replaced by an
> equivalent circuit that uses the same number of NAND gates as in the
> AND/OR circuit and no logic gates of any other kind.
> 

You can't, a simple AND gate must be substituted by two NAND gates.
What can be shown, by means of Boole's algebra, is that any circuit can
be
replaced by NAND gates.

Hope it helps,
	Pablo Varela

Technical Details

Message-ID: <33704BEB.3699@tid.es>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

References: <336EE1FC.76A5@icenet.com.au>

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: fd9bd,83f2e73c9bdcc7dd
X-Google-Attributes: gidfd9bd,public
X-Google-Thread: 115730,83f2e73c9bdcc7dd
X-Google-Attributes: gid115730,public
X-Google-Thread: 107cee,83f2e73c9bdcc7dd
X-Google-Attributes: gid107cee,public
X-Google-Thread: 111d0a,83f2e73c9bdcc7dd
X-Google-Attributes: gid111d0a,public
X-Google-Thread: 112d1e,83f2e73c9bdcc7dd
X-Google-Attributes: gid112d1e,public
From: Pablo Varela <pvb@tid.es>
Subject: Re: Help  on NAND gates
Date: 1997/05/07
Message-ID: <33704BEB.3699@tid.es>
X-Deja-AN: 239941126
References: <336EE1FC.76A5@icenet.com.au>
To: gaynos@icenet.com.au
Organization: Telefonica I+D
Newsgroups: aus.computers.logic-prog,sci.electronics.equipment,sci.electronics.misc,sci.electronics.design,sci.electronics.basics

Reply to Parent Message