[go: up one dir, main page]
Scribd
Upload
170 views22 pages

DTE Microproject

The document discusses digital arithmetic circuits. It defines arithmetic circuits as sets of gates that carry out arithmetic operations like addition, subtraction, multiplication, and division on separate inputs for each number. Adder circuits are discussed as an example, with the rules of binary addition defined for two bits. Combinational circuits are described as consisting of logic gates that operate on binary values and have outputs dependent on the current input combinations. Code converters that change one code to another are discussed. Parity bit generators for even and odd parity are explained. Finally, a binary adder circuit that adds two bits is presented.

Uploaded by

Shreyas Bagate
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
170 views22 pages

DTE Microproject

The document discusses digital arithmetic circuits. It defines arithmetic circuits as sets of gates that carry out arithmetic operations like addition, subtraction, multiplication, and division on separate inputs for each number. Adder circuits are discussed as an example, with the rules of binary addition defined for two bits. Combinational circuits are described as consisting of logic gates that operate on binary values and have outputs dependent on the current input combinations. Code converters that change one code to another are discussed. Parity bit generators for even and odd parity are explained. Finally, a binary adder circuit that adds two bits is presented.

Uploaded by

Shreyas Bagate
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

JSPM’s

JAYAWANTRAO SAWANT POLYTECHNIC, Handewadi


Road, Hadapsar, Pune-28

Department of Computer Engineering

Academic Year 2021-2022

MICRO PROJECT
SUBJECT : Digital Techniques

SUBJECT CODE: 22320 CLASS:SYCO3

SEMISTER :THIRD SUBJECT TEACHER: Shivpriya Desai

TOPIC: Design and analyze digital arithmetic circuit


GROUP MEMBERS

Sr No. Name Enrollment Roll no.


no
Aditya 2007110635 54
1 Chorghade
2 Shreyas 2007110548 33
Bagate
3 Kartik 2007110246 07
Choudhary
4 Gaurav 2007110623 48
Kamthe
INDEX
Sr. No. Topic
Introduction to
1
arithmetic circuits
Definition of arithmetic
2
circuits
3 Combinational circuits

4 Code converter

5 Parity Bit Generator :

6 Parity cheaker

7 Binary adder

8 4 bit binary adder


Design and analyze digital
arithmetic circuit

Introduction :

One important aspect of digital design with MSI circuits not dealt with in earlier chapters is the
design and implementation of arithmetic circuits. Originally, the basic arithmetic circuits were
designed using discrete components, but this method has long been superseded by the introduction
of MSI circuits. Multi-bit adders, arithmetic logic units and other circuits are now readily available as
medium scale integrated circuits.

In some cases, a required arithmetic function is not available in a standard MSI package and modifying
logic may be required. A typical example of this is the implementation of a binary adder/subtractor or
a circuit used for the implementation of BCD arithmetic. The modifying logic can be provided by
discrete gates or by another MSI circuit, so that some arithmetic circuits may be implemented by a
combination of MSI and SSI chips.

Progammable logic devices may also be used in arithmetic applications. For example, ROMs
programmed as look-up tables can implement the multiplication process, while a combination of
multi-bit adders and ROMs, in some cases, can extend the range of multiplication that can be
provided.
Definition:

An arithmetic circuit is a set of gates with a separate set of inputs for each number that has to be
processed. The gates are connected so as to carry out an arithmetic action and the outputs of the gate
circuit are the digits of the result (addition, subtraction, multiplication, or division).

Adder Circuits

Definition

The rules of binary addition for two bits are:

0+0=0

0+1=1

1+0=1

1 + 1 = 0 and carry 1 (the binary number 10; denary 2).


Combinational circuits:

Combinational circuits consist of Logic gates. These circuits operate with binary values.
The outputs of combinational circuit depends on the combination of present inputs. The
following figure shows the block diagram of combinational circui

This combinational circuit has ‘n’ input variables and ‘m’ outputs. Each combination of input variables
will affect the outputs.

Design procedure of Combinational circuits

Find the required number of input variables and outputs from given specifications.

Formulate the Truth table. If there are ‘n’ input variables, then there will be 2n possible combinations.
For each combination of input, find the output values.

Find the Boolean expressions for each output. If necessary, simplify those expressions.

Implement the above Boolean expressions corresponding to each output by using Logic gates.
Code Converters

We have discussed various codes in the chapter named codes. The converters, which convert one code
to other code are called as code converters. These code converters basically consist of Logic gates.

Example

Binary code to Gray code converter

Let us implement a converter, which converts a 4-bit binary code WXYZ into its equivalent Gray code
ABCD.

The following table shows the Truth table of a 4-bit binary code to Gray code converter.
From Truth table, we can write the Boolean functions for each output bit of Gray code as below.
Parity Bit Generator :

There are two types of parity bit generators based on the type of parity bit being generated. Even parity
generator generates an even parity bit. Similarly, odd parity generator generates an odd parity bit.

Even Parity Generator

Now, let us implement an even parity generator for a 3-bit binary input, WXY. It generates an even
parity bit, P. If odd number of ones present in the input, then even parity bit, P should be ‘1’ so that the
resultant word contains even number of ones. For other combinations of input, even parity bit, P should
be ‘0’. The following table shows the Truth table of even parity generator.
Binary Adder:

The most basic arithmetic operation is addition. The circuit, which performs the addition of two binary
numbers is known as Binary adder. First, let us implement an adder, which performs the addition of two
bits.

You might also like