TUGAS 1_2

6
KASUS 1.2 TEKNIK DIGITAL DAN RANGKAIAN KOMBINASIONAL Deskripsi : Pada Kasus Teknik Digital dan Rangkaian Kombinasional kali ini diberikan sub kasus yang meliputi : 5. Rangkaian kombinasional 5.1 Perancangan rangkaian digital 5.2 Macammacam rangkaian kombinasional 5.2.1 Unitunit penjumlah (Adder) 5.2.2 Unit pengurang (Substractor) 5.2.3 Multiplier 5.2.4 Divider 5.2.5 Decoder 5.2.6 Encoder 5.2.7 Binary Code 5.2.8 Code Converter 5.2.9 Multiplexer 5.2.11 Demultiplexer 5.2.12 Shifter Tujuan 1. Mahasiswa dapat mengimplementasikan minimasi Fungsi Boolean pada kasuskasus tertentu sesuai dengan fungsi dan perangkat/komponen yang digunakan 2. Mahasiswa dapat membaca dan merancang rangkaian kombinasional sesuai requirenment yang ditentukan Penilaian 1. Rencana kerja tim 2. Komunikasi dan Diskusi yang dibangun 3. Ketepatan waktu pengerjaan 4. Kebenaran hasil pengerjaan kasus

Transcript of TUGAS 1_2

Page 1: TUGAS 1_2

KASUS 1.2 TEKNIK DIGITAL DAN RANGKAIAN KOMBINASIONAL

Deskripsi :

Pada Kasus Teknik Digital dan Rangkaian Kombinasional kali ini diberikan sub kasus yang meliputi :

5. Rangkaian kombinasional 5.1 Perancangan rangkaian digital 5.2 Macam‐macam rangkaian kombinasional

5.2.1 Unit‐unit penjumlah (Adder) 5.2.2 Unit pengurang (Substractor) 5.2.3 Multiplier 5.2.4 Divider 5.2.5 Decoder 5.2.6 Encoder 5.2.7 Binary Code 5.2.8 Code Converter 5.2.9 Multiplexer 5.2.11 Demultiplexer 5.2.12 Shifter

Tujuan

1. Mahasiswa dapat mengimplementasikan minimasi Fungsi Boolean pada kasus‐kasus tertentu sesuai dengan fungsi dan perangkat/komponen yang digunakan

2. Mahasiswa dapat membaca dan merancang rangkaian kombinasional sesuai requirenment yang ditentukan

Penilaian

1. Rencana kerja tim 2. Komunikasi dan Diskusi yang dibangun 3. Ketepatan waktu pengerjaan 4. Kebenaran hasil pengerjaan kasus

Page 2: TUGAS 1_2

1. Consider the timing diagram below

In the picture above, X and Y are the input variables while A and B is the output variable. Make a truth table of the timing diagram above then write the Boolean function of its

2. Consider the timing diagram below

In the picture above, A and B are the input variables while X, Y and Z is the output variable. Make a truth table of the timing diagram above then write the Boolean function of its

3. Consider the following logic circuit

Make a truth table for logic circuit above, then give a simplified Boolean equation for each output and analysis of logic circuits what it is!

Page 3: TUGAS 1_2

4. To maintain the security of the environment, the storage space of Ammonia (NH3) in a

laboratory equipped with alarm systems. Normal conditions in the storage room is maintained at a temperature (T) 12o C, pressure (P) 5 atmospheres and humidity (D) 10%. The alarm system will work (reads) if the temperature <12o C, pressures <5 atmospheres and humidity >10%, or temperature <12o C, pressures >5 atmospheres and humidity <10%, or temperature >12o C, pressure <5 atmosphere and humidity >10%, or temperature > 12o C, pressures >5 atmospheres and humidity < 10%. Alarm system is used by the computer as the input signal to restore the room to return to normal conditions. a. Implement the above requirements into a truth table to determine in advance the

number of input and output variables are required. b. Simplify the Boolean function resulting from the translation of ideas according

requirenment at a point above c. Implemented in a logic circuit with only basic gates

5. Design a circuit that will tell whether a given month has 31 days in it. The month is specified by a 4‐bit inputs, A3:0. For example, if the inputs are 0001, the month is January, and if the inputs are 1100, the month is December. The circuit output, Y, should be HIGH only when the month specified by the inputs has 31 days in it. Write the simplied equations, and draw the circuit diagram using a minimum number of gates. (Hint: Remember to take advantage of don’t cares)

6. A priority encoder has 2N inputs. It produces N‐bit binary output indicating the most significant bit of the input thats is TRUE, or 0 if none of the inputs are TRUE. It also produces an output NONE that is TRUE if none of the inputs bits are TRUE. Design an eight‐input priority encoder with inputs A7:0 and outputs Y2:0 and NONE. Give a simplified Boolean equation for each output, and sketch a schematic

7. An M‐bit thermometer code for the number k consists of k 1’s in the least significant bit positions and M – k 0’s in all the more significant bit positions. A binary‐thermometer code converter has N inputs and 2N‐1 outputs. It produces a 2N‐1 bit thermometer code for the number specified by the input. For example, if the inputs is 110, the output should be 0111111 . Design a 3:7 binary‐thermometer code converter. Give a simlified Boolean equation for each output, and sketch a shematic.

8. Implement the function below using

a. an 8:1 multiplexer b. a 4:1 multiplexer and one inverter c. a 2:1 multiplexer and two other logic gates the function are : i. Y BC ABC BC

ii. iii.

Page 4: TUGAS 1_2

9. Consider the block diagram below

7 8 9

4 5 6

1 2 3

0

CODE DESIMAL

ENCODER 10 to 4

9

0

4

1

2

6

7

8

5

3

DECODER 4 to 7C

A

B

D

0

4

1

2

6

7

5

3

a

b

c

d

e

f

g

Design a circuit that can display the number on the keyboard into the 7‐segment display. For example, when the number 0 on the keyboard is pressed, the display 7‐segment displays the number 0. When number 1 on the keyboard is pressed, the display 7‐segment will show the number 1 and so on.

10. In the block diagram below is shown a network containing several combinational logic

devices. Complete the following truth tables. Assumes that F input on shifter mode equal to zero

A B Cout S3 S2 S1 S0 0 0 0 1 1 0 1 1

B

A

0

1

2-to-4 DEC

01

4-bitPARALLEL

ADDER

S0

4-bitSHIFTER

S0

S1

4-to-1MUX

S1

S2

S3

YBinary-to-GrayCONVERTER

0

1

23

0123

0

1

2

3

0123

01

Cin

Cout

Cout

0123

RDA1

A0

Y0Y1Y2Y3

I0I1I2I3

Page 5: TUGAS 1_2

11. In the block diagram below is shown a network containing several combinational logic devices. Complete the following truth tables.

A B P3 P2 P1 P0 0 0 0 1 1 0 1 1

1-to-2DEC-0

1-to-2DEC-1

1-to-2DEC-2

Gray-to-84-2-1CONVERTER

16-to-1MUX

B

A

C0C1C2C3

S0S1S2S3 I14 I12 I1 I0

Y2

Y3

2-bitPARALLEL

ADDER

EN

B

EN

A

A0

Cin

A1

B0

B1

2 x 2 bitMULTIPLIER

S0

S1

Y

SHIFTER

P3 P2 P1 P0

A0

A1

B0

B1

R

D

F

A1A0

I3 I2 I1 I0

Y3 Y2 Y1 Y0

A

B

A

Y0

Y1

Y0

Y1

0(H)

I15 . . .I13

. . .

Cout

2 x 2 bitDIVIDER

A0

A1

A2

A3

dividend

B0

B1

B2

B3

divisor

P3 P2 P1 P0

Page 6: TUGAS 1_2

12. To make part of the ALU of a processor that can implement the required circuit Arithmetic

and Logic functions in accordance with the choice of the functions assigned to the circuit as shown in the table below

Choice Functions Functions

S2 S1 S0 0 0 0 A + B (2’s complement) 0 0 1 A – B (2’s complement) 0 1 0 A x B (Multiplier) 0 1 1 A and B 1 0 0 A or B 1 0 1 A 1 1 0 A’ 1 1 1 B’

Sketch a logic circuit / block diagram to represent the ALU function above!. Assume that the Cout/Bout of the sum function is considered as an overflow bit