Realizing full adder from MUX (2:1)

Hi All
Can anybody tell me to realize Full adder wtih Mux(2:1) or any good book which describe circuit design using Mux

Well, the easiest way is to realise the full adder as basic gates, which all of us know and then replace every gate instance with its mux instantiation. Mux equivalents of basic gates are very basic indeed. I dont think there are books dealing specifically with this. Horowitz might give some insight into such things.

"Digital Design Perspective" ,
on sale!

hi
i think the following fig hs got d flip flop n i think with this example u can get
jk flip flop

http://www-ee.eng.hawaii.edu/~msmith...p03/asp03b.htm
regards

refer the book " digital design" by mano

Here goes the answer............
Hope this helps...

Code:

                                       
                                       
                         A----+          
          B----+------+       |       
               |      |    +--+--+    
            +--+--+   +----|0    |                  
        1---|0    |        |     +----------+       
            |     +--------|1    |          |       
        0---|1    |        +-----+       +--+--+    
            +-----+      Cin ---+--------|0    |    
                                |        |     +--- SUM
                             +--+--+  +--|1    |    
                         1---|0    |  |  +-----+    
                             |     +--+
                         0---|1    | 
                             +-----+ 

         A ------+
                 |   
              +--+--+
         0 ---|0    |
              |     +-------------+
         B ---|1    |             |
              +-----+             |          
         B ------+             +--+--+     
                 |      +------|0    |     
              +--+--+   |      |     +---+
         0 ---|0    |   | 1 ---|1    |   |
              |     +---+      +-----+   |        
         C ---|1    |                    |
              +-----+                    |   
         C ------+                    +--+--+
                 |           +--------|0    |
              +--+--+        |        |     +-------- CARRY
         0 ---|0    |        |   1 ---|1    |
              |     +--------+        +-----+
         A ---|1    |
              +-----+

Any Boolean function can be realized using MUXes. Draw truth table of the function. Connect inputs to control signals of MUX, then according to truth table tie the proper input to either Vdd or Gnd.
To simplify the circuit you can move one of controls to input section. For example of half-adder see attachment.
Issues like this were covered in details in some rather old book "Digital design : a pragmatic approach / by Everett L. Johnson, Mohammad A. Karim."

Vardan

Full adder from 2:1MUX

-----+----
C---------| 0 |
| |-------- -----+---
C'--------- | 1 | |----------|0 |
-----+---- | |---------SUM
| |---------- |1 |
B| | -----+---
-----+--- | |
C'---------|0 | | |
| |-------| A
C---------|1 |
-----+---





-----+----
0----------| 0 |
| |-------- -----+---
C--------- | 1 | |----------|0 |
-----+---- | |---------CARRY
| |---------- |1 |
B| | -----+---
-----+--- | |
C---------|0 | | |
| |--------| A
1---------|1 |
-----+---

ok, now how about the same thing using 2 4to1 mux's? I cant seem to translate it over
Thanks

Code:

For SUM Mux controlled by A, B
mux input 0 connected to Cin
mux input 1 connected to Cin inverted
mux input 2 connected to Cin inverted
mux input 3 connected to Cin

For CARRY Mux controlled by A, B
mux input 0 connected to '0'
mux input 1 connected to Cin
mux input 2 connected to Cin 
mux input 3 connected to '1'

Heh, actually, I sat for about 2 hours after i asked and finally figured out exactly what you said, but I appreciate the help

-David