1st Laboratory Practice
1st task:
Study the operation of:
– LED doide
– switch
– interactive input
Design a very simple network, the LED diodes show the ouput value of the of the swith and the interactive input. Set the 3 types of the switch.
REPORT:
– show the network
– summarize the behavior of this three components

2nd task:

Design a network to study the operation of an exclusive-OR gate. Fill the truth table of the exclusive-OR gate.
REPORT:
– show the network,
– truth table.

3rd task

Study the operation of a seven segment LED display.
(The seven segment LED display is an existing IC. (=integrated circuit). It has 7 LED (=Light Emitting Diode) segments or pixels on the top surface of the IC, and it has 7 input to force to light the 7 LED segments. The segments are marked as „a”, „b”, ..”g”. You can find this device in the output devices field of the symulation system.)

Design an assembly of the seven segment display to check the assegnment of the 7 inputs and seven segments.
REPORT:
– show the network
– show the assignment.of the inputs and LED segments

4th task

Design an assembly of 4 switch + 1 seven-segment-decoder + seven segment LED display.
(The seven-segment-decoder converts the 4 bit input combination – binary numbers between 0 and 15 onto the 7segment information. You can find this component in the „IIT” component library, as „Hétszegmens dekóder” component.)
Try the binary combinations from 0000 until 1111. Fill the truth table of this network:left side are the binary combinations – right side the segment combination.
REPORT:
– show the network
– show the truth table (binary combination (A,B,C,D)  segment data ( a,b,..g)
–
–
Note: The „IIT” component library is a special library, developed for the Lab practices of the Hungarian students.. This is the reason thet the Hungarian name of this component.

5th task

Design a full adder.
The full adder is a 3 bit adder, it has 3 inputs (A, B, C). The inputs are 1-1-1 bit binary numbers ( 0/1). The adder has 2 outputs (CO and S). The outputs are a 2bit binary number, CO is the more significant bit. The adder executes the arithmetic addition:
A plus B plus C  CO, S
( the „plus” is the arithmetic addition, because the „+” also expresses the logical OR operation). This adder is a combinational network, the present output combination depends on the present input combination.

Steps:

– fill the truth table of the adder,
– extract into K maps the CO and S,
– define the simplest function of S and CO,
– apply exclusive_OR gates to realize the function of S,
– realize this functions in the simulation, ( the inputs are originated by 3 switch, the outputs drive LEDs),
– check it.

Report:
– truth table
– K maps,
– functions,
– realization.

dr Horváth István 

–