2011Jisuanji gongchengRequires access

Rapid Carry Adder Based on Carry Forecast Between Groups

Fang Xiang-yan

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Carry (investment), Adder, Computer science, Carry-save adder, State (computer science), Arithmetic, Serial binary adder, Speedup

Related papers

Back to paper searchBrowse research topicsOriginal source
Rapid Carry Adder Based on Carry Forecast Between Groups — Research Paper | ScholarLens