Counting circuits

 28 June 02:27   

    = Counting circuits =

    An addition and analytic assemblage (ALU) adder provides the basal functionality of addition operations aural a computer, and is a

    significant basic of the addition and analytic unit. Adders are composed of bisected adders and abounding adders, which add atomic binary

    pairs, and ripple backpack adders and backpack attending advanced adders which do accession operations to a alternation of bifold numbers.

    Note: Pictures on wikipedia beneath GFDL

    A bisected adder is a analytic ambit that performs an accession operation on two bifold digits. The bisected adder produces a sum and a backpack amount which are both bifold digits.

    Sum(s) = A xor B

    Cot(c) = A and B

    Following is the argumentation table for a bisected adder:

    A abounding adder is a analytic ambit that performs an accession operation on three bifold digits. The abounding adder produces a sum and

    carry value, which are both bifold digits.

    Sum = (A xor B) xor Cin

    Cot = (A nand B) nand (Cin nand (A xor B))

    

 


Tags: addition, circuit, counting

 adder, binary, adders, logical, digits, addition, arithmetic, carry, counting, circuits, , binary digits, counting circuits, circuit that performs, logical circuit that, circuits counting circuits, counting circuits counting,

Share Counting circuits: Digg it!   Google Bookmarks   Del.icio.us   Yahoo! MyWeb   Furl  Binklist   Reddit!   Stumble Upon   Technorati   Windows Live   Bookmark

Text link code :
Hyper link code:

Also see ...

Permalink
Article In : Reference & Education  -  Physics