全加器公式
卡诺图化简可参考:http://www.fx361.com/page/2019/0917/5560913.shtml
![](https://img2020.cnblogs.com/blog/1164424/202004/1164424-20200411200720755-1709930628.png)
公式理解:A,B,Ci只要有奇数个1,则S=1,而进位的产生则至少需要2个1
Co和S的关系
![](https://img2020.cnblogs.com/blog/1164424/202004/1164424-20200411201142977-1502028147.png)
利用互补静态CMOS实现的全加器
![](https://img2020.cnblogs.com/blog/1164424/202004/1164424-20200424194830542-1937822509.png)
用P(进位传播)、G(进位产生)、D(进位消除)表示全加器
![](https://img2020.cnblogs.com/blog/1164424/202004/1164424-20200411201048586-808486638.png)
进位传播AB=10,01 进位产生AB=11, 进位消除AB=00
镜像加法器
![](https://img2020.cnblogs.com/blog/1164424/202004/1164424-20200411201229473-216771675.png)
卡诺图化简可参考:http://www.fx361.com/page/2019/0917/5560913.shtml
公式理解:A,B,Ci只要有奇数个1,则S=1,而进位的产生则至少需要2个1
进位传播AB=10,01 进位产生AB=11, 进位消除AB=00