A ONE-STEP MODULO 2N+1 ADDER BASED ON DOUBLE-LSB REPRESENTATION OF RESIDUES

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

JABERIPUR GHASSEM

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING Year:2006 | Volume:4 | Issue:2-4 (B) Page(s): 10-16

Download Full-Text

Persian Verion

View:

802

Download:

Cites:

Information Journal Paper

Title

A ONE-STEP MODULO 2N+1 ADDER BASED ON DOUBLE-LSB REPRESENTATION OF RESIDUES

Author(s)

JABERIPUR GHASSEM | Issue Writer Certificate

Keywords

RESIDUE NUMBER SYSTEMQ4

MODULO 2N+1 ADDITIONQ4

DOUBLE-1SB REPRESENTATIONQ4

DIMINISHED-I NUMBER REPRESENTATIONQ4

PARALLEL PREFIX ADDERSQ4

GENERIC ADDERSQ4

Abstract

Efficient modulo 2n±1 adders are desirable for computer arithmetic units based on RESIDUE NUMBER SYSTEMs (RNS) with the popular moduli set {2n-1, 2n, 2n+1}. Regular n-bit ripple-carry adders or their fast equivalents are suitable for modulo 2n addition. But for the other two moduli a correcting increment/decrement step besides the primary n-bit addition is normally required. Several design efforts have tried to reduce the latency of the correcting step to a small delay not depending on the word length n, leading to one-step modular addition schemes. These include the use of alternative encoding of residues (e.g., diminished-1 representation of modulo 2n+1 numbers), customized (vs. generic) adders (e.g., specialized PARALLEL PREFIX ADDERS), or compound adders. In this paper we investigate alternative modulo 2n+1 addition schemes, focus on generic one-step adder designs, and use the double-lsb representation of modulo 2n+1 numbers. In a generic modular adder, the central abstract n-bit adder may be replaced by any concrete adder architecture meeting the designer's prescribed measures in time, area and power consumption.

Cites

No record.

References

No record.

Cite

APA: Copy

JABERIPUR, GHASSEM. (2006). A ONE-STEP MODULO 2^N+1 ADDER BASED ON DOUBLE-LSB REPRESENTATION OF RESIDUES. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, 4(2-4 (B)), 10-16. SID. https://sid.ir/paper/70655/en

Vancouver: Copy

JABERIPUR GHASSEM. A ONE-STEP MODULO 2^N+1 ADDER BASED ON DOUBLE-LSB REPRESENTATION OF RESIDUES. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING[Internet]. 2006;4(2-4 (B)):10-16. Available from: https://sid.ir/paper/70655/en

IEEE: Copy

GHASSEM JABERIPUR, “A ONE-STEP MODULO 2^N+1 ADDER BASED ON DOUBLE-LSB REPRESENTATION OF RESIDUES,” THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, vol. 4, no. 2-4 (B), pp. 10–16, 2006, [Online]. Available: https://sid.ir/paper/70655/en

Related Journal Papers