A unified addition structure for moduli set {2n-1, 2 n,2n+1} based on a novel RNS representation

Somayeh Timarchi; Sorin D.cotofana

doi:10.1109/ICCD.2010.5647761

A unified addition structure for moduli set {2ⁿ-1, 2 ⁿ,2ⁿ+1} based on a novel RNS representation

Somayeh Timarchi, Sorin D.cotofana

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

9 Citations (Scopus)

Abstract

Given that modulo 2ⁿ±1 are the most popular moduli in Residue Number Systems (RNS), a large variety of modulo 2ⁿ±1 adder designs have been proposed based on different number representations. However, in most of the cases, these encodings do not allow the implementation of a unified adder for all the moduli of the form 2ⁿ-1, 2 ⁿ, and 2ⁿ+1. In this paper, we address the modular addition issue by introducing a new encoding, namely, the storedunibit RNS. Moreover, we demonstrate how the proposed representation can be utilized to derive a unified design for the moduli set {2ⁿ-1,2ⁿ,2 ⁿ+1}. Our approach enables a unified design for the moduli set adders, which opens the possibility to design reliable RNS processors with low hardware redundancy. Moreover, the proposed representation can be utilized in conjunction with any fast state of the art binary adder without requiring any extra hardware for end-around-carry addition.

Original language	English
Title of host publication	2010 IEEE International Conference on Computer Design, ICCD 2010
Pages	247-252
Number of pages	6
DOIs	https://doi.org/10.1109/ICCD.2010.5647761
Publication status	Published - 2010
Externally published	Yes
Event	28th IEEE International Conference on Computer Design, ICCD 2010 - Amsterdam, Netherlands Duration: 3 Oct 2010 → 6 Oct 2010

Publication series

Name	Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors
ISSN (Print)	1063-6404

Conference

Conference	28th IEEE International Conference on Computer Design, ICCD 2010
Country/Territory	Netherlands
City	Amsterdam
Period	3/10/10 → 6/10/10

Access to Document

10.1109/ICCD.2010.5647761

Cite this

Timarchi, S., & D.cotofana, S. (2010). A unified addition structure for moduli set {2ⁿ-1, 2 ⁿ,2ⁿ+1} based on a novel RNS representation. In 2010 IEEE International Conference on Computer Design, ICCD 2010 (pp. 247-252). Article 5647761 (Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors). https://doi.org/10.1109/ICCD.2010.5647761

@inproceedings{10470945d78844238a4f05dd539062f3,

title = "A unified addition structure for moduli set {2n-1, 2 n,2n+1} based on a novel RNS representation",

abstract = "Given that modulo 2n±1 are the most popular moduli in Residue Number Systems (RNS), a large variety of modulo 2n±1 adder designs have been proposed based on different number representations. However, in most of the cases, these encodings do not allow the implementation of a unified adder for all the moduli of the form 2n-1, 2 n, and 2n+1. In this paper, we address the modular addition issue by introducing a new encoding, namely, the storedunibit RNS. Moreover, we demonstrate how the proposed representation can be utilized to derive a unified design for the moduli set {2n-1,2n,2 n+1}. Our approach enables a unified design for the moduli set adders, which opens the possibility to design reliable RNS processors with low hardware redundancy. Moreover, the proposed representation can be utilized in conjunction with any fast state of the art binary adder without requiring any extra hardware for end-around-carry addition.",

author = "Somayeh Timarchi and Sorin D.cotofana",

year = "2010",

doi = "10.1109/ICCD.2010.5647761",

language = "English",

isbn = "9781424489350",

series = "Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors",

pages = "247--252",

booktitle = "2010 IEEE International Conference on Computer Design, ICCD 2010",

note = "28th IEEE International Conference on Computer Design, ICCD 2010 ; Conference date: 03-10-2010 Through 06-10-2010",

}

Timarchi, S & D.cotofana, S 2010, A unified addition structure for moduli set {2ⁿ-1, 2 ⁿ,2ⁿ+1} based on a novel RNS representation. in 2010 IEEE International Conference on Computer Design, ICCD 2010., 5647761, Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 247-252, 28th IEEE International Conference on Computer Design, ICCD 2010, Amsterdam, Netherlands, 3/10/10. https://doi.org/10.1109/ICCD.2010.5647761

A unified addition structure for moduli set {2ⁿ-1, 2 ⁿ,2ⁿ+1} based on a novel RNS representation. / Timarchi, Somayeh; D.cotofana, Sorin.
2010 IEEE International Conference on Computer Design, ICCD 2010. 2010. p. 247-252 5647761 (Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A unified addition structure for moduli set {2n-1, 2 n,2n+1} based on a novel RNS representation

AU - Timarchi, Somayeh

AU - D.cotofana, Sorin

PY - 2010

Y1 - 2010

N2 - Given that modulo 2n±1 are the most popular moduli in Residue Number Systems (RNS), a large variety of modulo 2n±1 adder designs have been proposed based on different number representations. However, in most of the cases, these encodings do not allow the implementation of a unified adder for all the moduli of the form 2n-1, 2 n, and 2n+1. In this paper, we address the modular addition issue by introducing a new encoding, namely, the storedunibit RNS. Moreover, we demonstrate how the proposed representation can be utilized to derive a unified design for the moduli set {2n-1,2n,2 n+1}. Our approach enables a unified design for the moduli set adders, which opens the possibility to design reliable RNS processors with low hardware redundancy. Moreover, the proposed representation can be utilized in conjunction with any fast state of the art binary adder without requiring any extra hardware for end-around-carry addition.

AB - Given that modulo 2n±1 are the most popular moduli in Residue Number Systems (RNS), a large variety of modulo 2n±1 adder designs have been proposed based on different number representations. However, in most of the cases, these encodings do not allow the implementation of a unified adder for all the moduli of the form 2n-1, 2 n, and 2n+1. In this paper, we address the modular addition issue by introducing a new encoding, namely, the storedunibit RNS. Moreover, we demonstrate how the proposed representation can be utilized to derive a unified design for the moduli set {2n-1,2n,2 n+1}. Our approach enables a unified design for the moduli set adders, which opens the possibility to design reliable RNS processors with low hardware redundancy. Moreover, the proposed representation can be utilized in conjunction with any fast state of the art binary adder without requiring any extra hardware for end-around-carry addition.

UR - http://www.scopus.com/inward/record.url?scp=78650751439&partnerID=8YFLogxK

U2 - 10.1109/ICCD.2010.5647761

DO - 10.1109/ICCD.2010.5647761

M3 - Conference contribution

AN - SCOPUS:78650751439

SN - 9781424489350

T3 - Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors

SP - 247

EP - 252

BT - 2010 IEEE International Conference on Computer Design, ICCD 2010

T2 - 28th IEEE International Conference on Computer Design, ICCD 2010

Y2 - 3 October 2010 through 6 October 2010

ER -