0% found this document useful (0 votes)
34 views

Boolean Algebra Basics

The document discusses several characteristics of integrated circuits including fan out, propagation delay, noise margin, and power dissipation. It then covers various topics related to digital logic including complement representations in different bases, Gray code, canonical and standard forms of Boolean expressions, and taking the complement of a Boolean function by complementing each literal.

Uploaded by

Sarthak
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views

Boolean Algebra Basics

The document discusses several characteristics of integrated circuits including fan out, propagation delay, noise margin, and power dissipation. It then covers various topics related to digital logic including complement representations in different bases, Gray code, canonical and standard forms of Boolean expressions, and taking the complement of a Boolean function by complementing each literal.

Uploaded by

Sarthak
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 37

IC CHARACTERSTICS

- Fan Out
- Propagation Delay
- Noise Margin
- Power Dissipation

2.4V
2.0V
0.8V
0.4V

Power Dissipation (PD)


Expressed

in Milliwatts

PD= VCC * ICC


ICC(avg)=(ICCH+ICCL)/2

Diminished Radix Complement


Number N in base r having n digits
(r-1)s complement = (rn -1) N

Radix Complement
Number N in base r having n digits
(r)s complement = (rn N )
Ex: base 2:
base10:

2s complement, 1s complement
10s compliment, 9s compliment

The Reflected Code


The advantage of the reflected code
over pure binary numbers is that a
number in the reflected code changes by
only one bit as it proceeds from one
number to the next. The reflected code
is also known as the Gray code.

Four-bit reflected code

Complement of a Function.
F = xyz + xyz

Complement of a Function.
F = xyz + xyz
dual of F is (x+y+z)(x+y+z)
complement each literal
- (x+y+z)(x+y+z) = F

Canonical Form
- Boolean Expression expressed in
sum of minterms or product of maxterms

Standard form
F1 = y +xy + xyz
F = (AB + CD)(AB+CD)

You might also like