Digitale Kredsløb Noter

Chapter 1: All relevant. You will not get a direct question from this chapter but it is a base
for many other chapters. So, please read the chapter carefully to understand numbering
etc.

Chapter 2: 2.2 and 2.3 (one or two samples of each. The more the better), 2.15, 2.18,
2.20, 2.30

Chapter 3: 3.2 and 3.3 (one or two samples of each question), 3.7 (one or two samples),
3.14, 3.18, 3.23

Chapter 4: 4.2, 4.5, 4.7 (a), 4.27, 4.28 (a), 4.32, 4.34 and 4.35. On top of these learn how
to implement more complicated decoders using smaller decoders and also the same for
multiplexers

Chapter 5: 5.6, 5.7, 5.8, 5.9, 5.10, 5.12, 5.18, 5.19. Read the chapter and its examples
carefully too.

Chapter 6: 6.1, 6.6, 6.7, 6.10, 6.12, 6.19, 6.28.

1.Digital Systems and Binary Numbers

How many different denary numbers can one represent in n bits?

 𝑛
2

8
Eg. 2 = 256(in 8-bits)

Representing negative numbers using signed binary numbers:

To represent negative numbers, let the largest exponent of 2 (eg. 128) be negative. This
means that 100000002 = − 12810

To represent smaller negative numbers, add the remaining exponents of 2 to the negative
number.

Representing a negative denary number in binary using 2s complement:

Write the magnitude of the denary number you want to represent in binary
Convert to 1’s complement: 0 and 1 switch
Add 1 to the binary number
(the largest exponent of 2 (eg. 128) has a negative coefficient)
Done

Representing real numbers using fixed point binary fractions

BCD code

Each decimal digit (1-9) is represented in binary. You then write decimal numbers as a
collection of these decimal digits in binary.
So 182 becomes: 0001 1001 0010 in 4-bit BCD
10-15 can be represented using 4-bit binary, but these are not decimal digits (they are
decimal numbers). So we are not interested in them (invalid / dont care).

Gray code
Only one digit changes at a time.
From decimal to HEX: Example
 2.Boolean Algebra and Logic Gates
Logic friday all day

Complement of function
Example: F = A' B C' + A' B' C
Complement of F, aka. F’ = ?

F’ = (A' B C' + A' B' C) ‘

Minimize in logic friday -> F’ = B' C' + B C + A ;

(watch out for distinciton between F’ and F, logic friday wont do that for you)
Product of maxterms / Sum of minterms

Maxterms: where the function outputs zero. M

F(x, y, z) = 𝚷(terms where function is low)

Minterms: where the function outputs one m

Σm(insert terms where function is high)

Example: find a product of maxterms expression for F(x,y,z)=Σ(1 2 3 5 7)

1. File -> new -> truthtable

2. Three inputs x, y, z. One output F.
3. 1’s at term 1, 2, 3, 5, 7. Rest are left blank
4. Submit (boolean expression is acquired)
5. Sum of products: Minterms / Product of sums: Maxterms
6. Done

Example: convert Σm(1, 4, 5, 6, 7) to maxterms

F(A, B, C) = Σm( F'(A, B, C) = Σm(0, 2, 3) = m0 + m2 + m3

Now, if we take the complement of F’ by DeMorgan’s theorem, we obtain F in a different
form:
F = (m0 + m2 + m3)’
= m0’m2’m3′
= M0*M2*M3
= 𝚷(0, 2, 3)
 3.Gate - Level Minimization

K-maps
Bunching 1’s: minterms
Bunching 0’s: maxterms
 4.Combinational Logic

Half adder logic:

Full Adder schematic

Full adder truth table

Encoder
“n” inputs and “m” outputs

Expressing each output variable in minterms. OR gate at the encoder’s output

Decoder