BE Lab Manual Experiment 4

Experiment 4 

Aim:-To study Binary to Gray Code Converter Circuit.


Apparatus: - Binary to Gray Code Converter kit, digital multimeter, patch chords.


Theory: - Code converter is a digital system that converts code from one form to another. Many a time’s data or information is available in one form and we require the data in another form. For such purpose a “Code Converter” is used. Binary to Gray Code Converter is one the type of Code Converter.


Binary Number System:-

The number system with base (or Radix) two is called a Binary number System. There are only two Symbols used in this system they are 0 & 1. These are known as bits. It is a Positional system. i.e. every position assigned a specific weight.


Gray Codes:-

The Gray Code is an unweighted Code, which means the position in the code groups do not have any specific weight assigned to them because of this, Gray Code is not suited for arithmetic operations. But it is used to reduce error while transmitting digital information from one place to another. The major advantage of the Gray Code is, only a single bit changes its logic when a decimal number changes from proceeding number to next number.


Conversion from Binary to Gray Code:-

  1. Copy the MSB of the binary number as it is.

  2.   Add the MSB of binary with the next bit and record the sum ignoring the carry if 

       generated.

  1. Continue the addition of one bit to the next till the LSB of the Binary number and   

      record the sum.


D:\bhupesh shukla 29-01-10\D LAB\B G conver 1.jpg


           The following table shows the 4 bit equivalent of the 4-bit binary number.

Procedure:-

  1. Study the circuit provided on the front panel of the kit.
  2. Switch ‘ON’ the power supply.
  3. Note down the voltage at D0 to D3   for logic 1 & logic 0.
  4. Apply the logic to the B3 to B0 from logic input using patch chords.
  5. Connect the output’s G3 to G0 to logic output indicator using patch chords.
  6. Verify and note down the Gray equivalent of binary no.

Result:-

The Binary to Gray Code Converter Circuit is studied and the Truth table is verified.

Comments

Post a Comment

Popular posts from this blog

BCA Syllabus Topics

SEMESTER-2 nd Course: BCA SUBJECT: DIGITAL COMPUTER ORGANIZATION Syllabus : Unit-I : Digital computer and digital system; Binary number system: number base conversion. Compliments: one's, two's, 9's and 10's complements code: Gray BCD, ASCII, and error detection code. Logic Gates: AND, OR, NOT, EX-OR, Universal gate. Logic Circuit. Boolean function: Rules and simplification, simplification of Boolean function using map method, don't care condition. Unit-II: Combinational Circuits: Adders, Subtractors, Multiplexer, Demultiplexer Decoder, Encoder) Sequential Circuit: Flip-Flop: RS, Clocked RS, JK, D flip-flop, and Master board, Case studies to understand organization of laptop like Dell, Lenovo etc. slave flip-flop. Register- Introduction, Shift register, serial Transfer & parlor Load. Counters- Ripple Counter (Asynchronous), Synchronous Counters. Unit-III: 8086 internal architecture, register organization of 8086, addressing modes, instruction set and assembler ...
Read more

Quine-Mccluskey Method

Image
 Quine-Mccluskey Method It also known as Tabular method. It is more systematic method of minimizing expressions of even larger number of variables. It is suitable for hand computation as well as computation by machines i.e., programmable. . The procedure is based on repeated application of the combining theorem.  PA+P =P (P is set of literals) on all adjacent pairs of terms, yields the set of all PI‘s from which a minimal sum may be selected.  Consider expression ∑m(0,1,4,5)= + C+A +A C First,  second terms & third, fourth terms can be combined ( + ) + (C+ )= + A Reduced to (      +    ) = The same result can be obtained by combining m 0 & m 4 & m 1 &m 5 in first step & resulting terms in the second step. Procedure: Decimal Representation Don‘t cares PI chart EPI Dominating Rows & Columns Determination of Minimal expressions in c...
Read more

Alternate Logic-Gate Representations

Image
Alternate Logic-Gate Representations We have discussed the five basic logic gates (AND, OR, INVERTER, NAND, and NOR) and the standard symbols used to represent them in a logic circuit diagram. Most of the logic networks use standard symbols. But in some networks an alternative set of symbols is used in addition to the standard symbols. The table shows the alternate set of symbols for the five basic gates. Table: Alternate Logic Gate Representations To convert any normal symbol to its corresponding alternate symbol, the following steps are used: METHODOLOGY: TO CONVERT STANDARD SYMBOL TO ALTERNATE SYMBOL Step 1: Add bubbles (indication of inversion) at those input or output points where it is not present. Step 2: Remove all pre-existing bubbles of the normal symbol, if there is any at the point (only NOT, NAND and NOR gates) Step 3: If the existing normal logic symbol is AND, change it to OR, Similarly, if it is OR, then change it to AND. There is no change for the triangular symbol of ...
Read more