RNS multiplication/sum-of-squares units
RNS multiplication/sum-of-squares units
- Author(s): D. Adamidis and H.T. Vergos
- DOI: 10.1049/iet-cdt:20060009
For access to this article, please select a purchase option:
Buy article PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
IET Computers & Digital Techniques — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): D. Adamidis 1 and H.T. Vergos 2
-
-
View affiliations
-
Affiliations:
1: Multimedia and Communications Group of Atmel Corp., University of Patras, Greece
2: Computer Engineering & Informatics Department, University of Patras, Greece
-
Affiliations:
1: Multimedia and Communications Group of Atmel Corp., University of Patras, Greece
- Source:
Volume 1, Issue 1,
January 2007,
p.
38 – 48
DOI: 10.1049/iet-cdt:20060009 , Print ISSN 1751-8601, Online ISSN 1751-861X
© The Institution of Engineering and Technology
Published
Digital signal processing and multimedia applications often profit from the use of a residue number system. Among the most commonly used moduli, in such systems, are those of 2n−1 and 2n+1 forms and among the most commonly used operations are multiplication and sum-of-squares. These operations are currently performed using distinct design units and/or consecutive machine cycles. Novel architectures for combined units that perform modulo 2n−1/diminished-1 modulo 2n+1 multiplication or sum-of-squares depending on the value of a control signal are proposed.
Inspec keywords: residue number systems
Other keywords:
Subjects: Digital electronics; Digital arithmetic methods
References
-
-
1)
- C. Efstathiou , H.T. Vergos , D. Nikolos . Modulo 2n±1 adder design using select-prefix blocks. IEEE Trans. Comput. , 11 , 1399 - 1406
-
2)
- L. Kalamboukas , D. Nikolos , C. Efstathiou , H.T. Vergos , J. Kalamatianos . High-speed parallel-prefix modulo 2n−1 adders. IEEE Trans. Comput. , 673 - 680
-
3)
- E. Di Claudio , F. Piazza , G. Orlandi . Fast combinatorial RNS processors for DSP applications. IEEE Trans. Comput. , 624 - 633
-
4)
- H.T. Vergos , C. Efstathiou , D. Nikolos . Diminished-one modulo 2n+1 adder design. IEEE Trans. Comput. , 1389 - 1399
-
5)
- S. Piestrak . Design of squarers modulo a with low-level pipelining. IEEE Trans. Comput. , 31 - 41
-
6)
- R.H. Strandberg , L.G. Bustamante , V.G. Oklobdzija , M. Sonderstrand , J.C. Le Duc . Efficient realizations of squaring circuit and reciprocal used in adaptive sample rate notch filters. J. VLSI Signal Process. , 303 - 309
-
7)
- A. Eshraghi , T.S. Fiez , K.D. Winters , T.R. Fischer . Design of a new squaring function for the Viterbi algorithm. IEEE J. Solid-State Circuits , 9 , 1102 - 1107
-
8)
- M.A. Soderstrand , W.K. Jenkins , G.A. Jullien , F.J. Taylor . (1986) Residue number system arithmetic: modern applications in digital signal processing.
-
9)
- Cardarilli, G.C., Nannarelli, Al., Re, M.: `Reducing power dissipation in FIR filters using the residue number system', Proc. 43rd IEEE Midwest Symp. on Circuits Syst., 2000, 1, p. 320–323.
-
10)
- R.K. Kolagotla , W.R. Griesbach , H.R. Srinivas . VLSI implementation of 350 MHz 0.35 µm 8 bit merged squarer. Electron. Lett. , 1 , 47 - 48
-
11)
- J. Ramirez , U. Meyer-Baese . High performance, reduced complexity programmable RNS–FPL merged FIR filters. Electron. Lett. , 199 - 200
-
12)
- G. Kempa , P. Jung . FPGA-based logic synthesis of squarers using VHDL. Proc. 2nd Int. Workshop on Field Program. Logic Appl. , 112 - 123
-
13)
- Wang, Z., Jullien, G.A., Miller, W.C.: `An algorithm for multiplication modulo 2', Proc. 39th IEEE Midwest Symp. on Circuits Syst, 1996, p. 1301–1304.
-
14)
- J. Pihl , E.J. Aas . A multiplier and squarer generator for high performance DSP applications. Proc. 39th Midwest Symp. on Circuits Syst. , 109 - 112
-
15)
- Ramirez, J., Garcia, A., Meyers-Baese, U., Lloris, A.: `Fast RNS FPL-based communications receiver design and implementation', Proc. 12th Int. Conf. on Field Program. Logic, 2002, 2438, Springer-Verlag, p. 472–481, Lecture Notes in Computer Science.
-
16)
- J.T. Yoo , K.F. Smith , G. Gopalakrishnan . A fast parallel squarer based on divided-and-conquer. IEEE J Solid-State Circuits , 6 , 909 - 912
-
17)
- J. Ramirez , A. Garcia , S. Lopez-Buedo , A. Lloris . RNS-enabled digital signal processor design. Electron. Lett. , 266 - 268
-
18)
- C. Efstathiou , H.T. Vergos , G. Dimitrakopoulos , D. Nikolos . Efficient diminished-1 modulo 2n+1 multipliers. IEEE Trans. Comput. , 491 - 496
-
19)
- Wrzyszcz, A., Milford, D.: `A new modulo 2', Proc. Int. Conf. on Comput. Design (ICCD'93), 1995, p. 614–617.
-
20)
- L.M. Leibowitz . A simplified binary arithmetic for the Fermat number transform. IEEE Trans. Acoust. Speech Signal Process. , 356 - 359
-
21)
- L. Dadda . (1965) Some schemes for parallel multipliers’, Alta Frequenza.
-
22)
- H. Bhatnagar . (2001) Advanced ASIC chip synthesis using synopsys design compiler, physical compiler, and primetime.
-
23)
- C. Efstathiou , H.T. Vergos , D. Nikolos . Fast parallel-prefix modulo 2n+1 adders. IEEE Trans. Comput. , 1211 - 1216
-
24)
- H.T. Vergos , C. Efstathiou . Diminished-1 modulo 2n+1 squarer design. IEE Proc., Comput. Digit. Tech. , 561 - 566
-
25)
- A. Tyagi . A reduced-area scheme for carry-select adders. IEEE Trans. Comput. , 10 , 1163 - 1170
-
1)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cdt_20060009
Related content
content/journals/10.1049/iet-cdt_20060009
pub_keyword,iet_inspecKeyword,pub_concept
6
6
