Design a half adder, Computer Engineering

Assignment Help:

Q. Design a half adder?

In half adder inputs are:

The augend let's say 'x' and addend 'y' bits.

The outputs are sum 'S' and carry 'C' bits.

Logical relationship between these are given by truth table as displayed in figure (a). Carry 'C' can be attained on implementing AND gate on 'x' & 'y' inputs so C = x.y whereas S can be found from Karnaugh Map as displayed in figure (b).  Corresponding logic diagram is displayed in figure (c).

So sum and carry equations of half- adder are:

S  =  x.y¯ + x¯.y

C =  x.y

322_Design a half adder.png

Figure: Half - Adder implementation


Related Discussions:- Design a half adder

New execution of listpermutations, Update the permutation algorithm from th...

Update the permutation algorithm from the text to obtainthe correct list of permutations even if the string haves repeated letters. For example, if you call ListPermutations on the

Design issues, Design issues:  To complete the maximum processor utilizatio...

Design issues:  To complete the maximum processor utilization in a multithreaded architecture, the following design issues have to be addressed: Context Switching time: S

Determine a positive logic system logic state level, In a positive logic sy...

In a positive logic system, logic state 1 corresponds to ? Ans. For positive digital logic, we choose two voltages levels. Higher voltage shows logic 1 and a lower voltage sho

High level expertise, The most useful feature of an expert system is the h...

The most useful feature of an expert system is the high level expertise it provides to aid in problem solving. This expertise can represent the best thinking of the top

Assembler directives, What are assembler directives? Ans: These are th...

What are assembler directives? Ans: These are the instructions that direct the program to be executed. They have no binary corresponding so they are called pseudo-opcodes. The

Explain optimal page replacement algorithm, Optimal Page Replacement Algori...

Optimal Page Replacement Algorithm The optimal page replacement algorithm that as well known as OPT is an algorithm which works as follows: while a page needs to be swapped in,

What is an assembly language, An assembly language is a? Ans. Low level...

An assembly language is a? Ans. Low level programming language is an assembly language.

What are different normalization forms, What are different normalization fo...

What are different normalization forms? 1NF: Eliminate Repeating Groups Make a separate table for every set of related attributes, and give each table a primary key. Each fie

Padovan string , A Padovan string P(n) for a natural number n is defined as...

A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string of t

Interfacing assembly language routines, By now you can write procedures bot...

By now you can write procedures both internal andexternal and pass parameters particularly through stack.Let's us use these concepts to see how assembly language can be interfaced

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd