Rapid Carry Adder Based on Carry Forecast Between Groups
Fang Xiang-yan
Abstract
Fang Xiang-yan
Abstract
This paper presents and realizes a rapid carry adder based on carry forecast between groups to improve the speed of the large numbers adder in some cryptography systems.The large numbers is divided into many groups,the delay of carry-chain is reduced by carry lookahead in group.The group addition operation of different carry state is finished by carry forecast between groups.The addition sun of different carry forecast state is selected as the final result based on the carry state.Performance analysis shows that the computing speed of the carry adder is faster when realizing the 1 024 bit large numbers add operation.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents and realizes a rapid carry adder based on carry forecast between groups to improve the speed of the large numbers adder in some cryptography systems.The large numbers is divided into many groups,the delay of carry-chain is reduced by carry lookahead in group.The group addition operation of different carry state is finished by carry forecast between groups.The addition sun of different carry forecast state is selected as the final result based on the carry state.Performance analysis shows that the computing speed of the carry adder is faster when realizing the 1 024 bit large numbers add operation.
Key concepts: Carry (investment), Adder, Computer science, Carry-save adder, State (computer science), Arithmetic, Serial binary adder, Speedup