Title of article
Implementation of Efficient Modulo 2n+1 Squarer for {2n-1, 2n, 2n+1} Based Residue Number System
Author/Authors
Sajedi, Horialsadat Hossein Department of Computer Engineering - Science and Research Branch - Islamic Azad University, Tehran , Navi, Keivan Faculty of Computer Science and Engineering - Shahid Beheshti University, Tehran , Jalali, Ali Faculty of Computer Science and Engineering - Shahid Beheshti University, Tehran
Pages
8
From page
60
To page
67
Abstract
In order to design special-purpose digital signal processing, modulo 2n+1 squarer is the core element that is widely employed in algorithms. Among the 3n dynamic ranges, the {2n-1, 2n, 2n+1} moduli set has received significant attention in residue number systems. Since modulo 2n+1 is the most critical one, in this paper we present a novel architecture of modulo 2n+1 squarer for weighted binary representation. Experimental results show power, delay and area improvements compared to the latest 2n+1 squarer architectures.
Keywords
Modulo Squarer , Multiplier , Residue Arithmetic , Residue Number System
Journal title
The CSI Journal on Computer Science and Engineering (JCSE)
Serial Year
2017
Record number
2504968
Link To Document