Page 75 - Handout Digital Electronics
P. 75

Figure 12: Full Adder Logic Circuit

            The Boolean expressions for implementing the Full Adder are derived from the truth table for example:

            Cout = CinBA + CINBA + CinBA + CinBA

            = CinBA + CinBA + CINBA + CinBA

            = BA(C IN  + CIN ) + CIN(BA + BA)
            = BA + Cin (B  A)

            Sum = CinBA + CinBA + CINBA + CinBA

            = Cin (B  A) + Cin (BA + BA)

            = Cin (B  A) + Cin (B  A)
            = Cin  B  A = Cin   A  B

























                                                                75
   70   71   72   73   74   75   76   77   78   79   80