Combinational Logic

3,531 views
3,414 views

Published on

Deals with the topics of adderes & subtracttors and lot more

Published in: Education, Technology, Business
2 Comments
0 Likes
Statistics
Notes
  • yaar ye to bht basic h..hardly 5 number ka h ye sara
       Reply 
    Are you sure you want to  Yes  No
    Your message goes here
  • aajkl ye padhte ho??
       Reply 
    Are you sure you want to  Yes  No
    Your message goes here
  • Be the first to like this

No Downloads
Views
Total views
3,531
On SlideShare
0
From Embeds
0
Number of Embeds
5
Actions
Shares
0
Downloads
163
Comments
2
Likes
0
Embeds 0
No embeds

No notes for slide

Combinational Logic

  1. 1. Adders Decoders Encoders Multiplexers Demultiplexers
  2. 2.  The half-adder accepts two binary digits on its inputs and produces two binary digits on its outputs, a sum bit and a carry bit.
  3. 3.  The full-adder accepts two input bits and an input carry and generates a sum output and an output carry.
  4. 4. In its general form, a decoder has n input lines to handle n bits and forms one to 2n output lines to indicate the presence of one or more n-bit combinations.
  5. 5. An encoder is a combinational logic ckt that essentially performs a “reverse” decoder function.  An encoder accepts an active level on one of its inputs representing a digit, such as a decimal or octal digit, and converts it to a coded output such as BCD or binary.  Encoders can also be devised to encode various symbols and alphabetic characters. 
  6. 6. The basic MUX has several data i/p lines and a single o/p line. m= Selection i/p n= I/p Lines=2m In the given example m=2 => n=22=4
  7. 7. A DEMUX basically reverses the MUX function.  It also known as data distributor .

×