An improved 32-bit Carry-Lookahead Adder with Conditional Carry-Selection
An improved 32-bit carry-lookahead adder (CLA) with Conditional Carry-Selection (CSS) is proposed in this paper. The new adder is compared with Serial Adder and pure Carry- Lookahead Adder. The three adders is simulated in FPGA circuits, the results show that the propagation time of the carry of the new 32-bit adder is reduced 26% compared with Serial Adder and 3.17% with pure Carry-Lookahead Adder.
CSS CLA adder
CHEN Ping-hua ZHAO Juan XIE Guo-bo LI Yi-jun
Faculty of Computer Guangdong University of Technology Guangzhou Guangdong 510006,China
国际会议
第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)
南京
英文
1911-1913
2009-07-25(万方平台首次上网日期,不代表论文的发表时间)