On Equivalences and Fair Comparisons Among Residue Number Systems with Special Moduli
|
|
- Collin Stanley
- 5 years ago
- Views:
Transcription
1 On Equivalences and Fair Comparisons Among Residue Number Systems with Special Moduli Behrooz Parhami Department of Electrical and Computer Engineering University of California Santa Barbara, CA , USA Abstract Properties and applications of residue number systems (RNS) with special moduli of the form 2 k ± 1, with a single power-of-2 modulus often also included, have been studied extensively. We show that lack of systematic studies has led to rediscovery of new moduli sets that are really equivalent to previously studied ones and that certain comparisons presented to show advantages of some proposed moduli sets are rather unfair. We prove a general mathematical result that allows us to normalize the single power-of-2 modulus, thus removing some of the problematic variations from such proposed sets. We then offer an assessment strategy based on dynamic ranges of the RNS sets being compared, rather than on artificial parameters that may be different for comparable systems. Keywords Computer arithmetic, forward converter, modular arithmetic, residue number system, residue-tobinary converter, reverse converter, special RNS moduli. A fundamental operation in computing with RNS representations is that of modular addition. For a general modulus m, modular addition is both more costly and slower than ordinary addition: much slower if addition and modular reduction are done in successive stages. Even a fast implementation, where x + y and x + y m are computed concurrently and the appropriate one is then chosen as the modular sum (Fig. 1), is slightly slower than ordinary addition, given the presence of a carry-save adder and a multiplexer on the critical path. Multiplication is another important operation in signal processing applications forming the main target of RNS. Modular multiplication can be performed by interleaving addition and modular reduction steps in a sequential algorithm, thus essentially reducing the problem to multiple modular additions. Alternatively, one can use modular multioperand addition that leads to faster tree multipliers. However, modular multioperand addition is rather costly and slow for an arbitrary modulus m. 1. Introduction Residue number systems (RNS) have been studied for nearly as long as electronic digital computers [Svob59], and are still attracting considerable attention from the research community [Omon07]. They have found niche applications for certain arithmetic-intensive digital signal processing (DSP) problems [Sode86]. In an RNS, a number x is represented by a collection of j residues (r 1, r 2, r 3,..., r j ), where r i = x mod m i, with the m i parameters constituting a set of j pairwise relatively prime moduli. The dynamic range of RNS(m 1, m 2,..., m j ), that is, the total number of distinct values that it can represent, is M = m 1 m 2 m 3... m j. 1 0 Fig. 1. Fast modular addition for a general modulus m. RNS with Special Moduli: Equiv. & Fair Comparisons 1 44th Asilomar Conf. Signals, Systems, and Computers
2 2. RNS with Special Moduli Certain special sets of moduli, in which each m j is of the form 2 k, 2 k 1, or 2 k + 1 lead to simplifications in hardware and reduction of latency for many operations of interest, including binary-to-rns and RNS-to-binary conversions and the associated forward and reverse hardware converters. Modulo-2 k operations are trivially simple. For example in both 2-operand and multioperand mod-2 k addition, we simply discard any carry that goes into position k (Fig. 2a). Integers of the form 2 k 1 constitute low-cost RNS moduli [Parh76], because as in low-cost arithmetic error codes [Aviz71] they lead to simplified hardware realizations. Mod-m addition for a low-cost modulus m is performed by simply connecting an ordinary adder s carry-out signal to its carry-in line, a scheme known as end-around carry. The equivalent correction in the case of multioperand addition is to reinsert a carry bit that goes to column k into column 0 (Fig. 2b). Moduli of the form 2 k + 1, though not as simple to handle as the aforementioned two types (2 k and 2 k 1), still lead to efficient hardware realizations by using the diminished-1 encoding (Fig. 3). In the latter encoding, one bit is used to distinguish 0 from nonzero residues. For the latter residues, k bits are used to encode a magnitude that is one less than the true residue. It can be readily proven that an inverted end-around carry performs the necessary correction in this case, in a manner that is similar to the role of end-around carry in mod-(2 k 1) addition (Fig. 2c). For these reasons, scores of papers have been written about moduli sets comprised of such special moduli, the attendant algorithms, and hardware implementations for various arithmetic operations [Abda95], [Abda05], [Anan07], [Anan07a], [Conw99], [Hias03], [Tomc08], [Wang00]. Other special moduli, such as those taking the forms 2 k ± c, where c is a small constant greater than 1, or 2 k ± 2 l ± 1, for 1 < l < k, are also of some interest [Hias03a], [Pate07], [Sheu04], but dealing with them is beyond the scope of this paper. Fig. 2. Modular multioperand addition with special moduli. Fig. 3. Standard binary vs. diminished-1 representation of mod-(2 k + 1) residues. Some special sets of moduli are listed in Table 1 as a small representative sample. The set M4 was proposed in [Anan07a], M1-M3 are sets against which advantages are claimed for M4, and M5 is a set that we use to support our main idea that more systematic assessments and fairer comparisons are needed, both among RNS representations with special moduli and in general. We note that the moduli sets appearing in Table 1 require different widths in their representations, ranging from 3n 1 bits for M2 to 4n + 2 bits for M3. They also offer different dynamic ranges (shown in an approximate manner in the rightmost column of Table 1), ranging from 2 3n 1 to 2 4n+1. Thus, any comparative assessment of implementation cost (VLSI area) and latency as functions of n would be inherently unfair. What we need are cost and latency functions that are expressed in terms of the dynamic range M or another parameter that bears a direct relationship to M. More specifically, because the dynamic range of an RNS with special moduli of the form considered here is always close to a power of 2, we can take the associated power as a rough indication of the word width in an equivalent binary representation and use it to normalize all comparisons. Put another way, if we start with a desired dynamic range and proceed to choosing one of the moduli sets in Table 1 for the application at hand, different values of n may have to be used. This unfairness in comparison, though quite important, isn t the only problem with the comparative assessments offered in published studies. Table 1. Some special sets of 3 or 4 RNS moduli. Set m 1 m 2 m 3 m 4 Width Range M1 2 n 1 2 n 2 n + 1 3n n M2 2 n 1 2 n 2 n 1 1 3n 1 2 3n 1 M3 2 n 1 2 n 2 n n+1 1 4n n+1 M4 2 n n 2 n 1 3n n+1 M5 2 n n+1 2 n 1 3n n+2 RNS with Special Moduli: Equiv. & Fair Comparisons 2 44th Asilomar Conf. Signals, Systems, and Computers
3 3. Normalizing the Moduli Set To treat RNS choices with special moduli methodically, we need some terminology and background. Definition 1: An RNS with special moduli has a powerof-2 modulus 2 b, plus an arbitrary number of moduli of the form 2 k ± 1, that is, it has the moduli set: {2 k 1 k = a 1, a 2,...} {2 b } {2 k + 1 k = c 1, c 2,...} Without loss of generality, we assume: a 1 > a 2 >... and c 1 > c 2 >... We know from number theory that for the low-cost moduli of the form 2 k 1 to be pairwise relatively prime, it is necessary and sufficient for the parameters a 1, a 2,... to be pairwise relatively prime. There is, of course, only one parameter b. As for the c i parameters, defining the subset of moduli of the form 2 k + 1, selection rules to ensure relative primality are not widely known. If a is odd, then 2 a 1 is guaranteed to be relatively prime with respect 2 c + 1. Only one of the a parameters can be even, in which case it must be factorized to determine limitations on other a i and c j values. Numbers of the form 2 c + 1 can be divided into well-defined classes, with no more than one number allowed from each class [Abda95]. Because in addition and multiplication operations, residues are processed independently and in parallel, operation latency is determined by the dominating parameters a 1, b, and c 1, given that operations with smaller moduli of the same kind are always faster. Let T(b) be the operation latency for the modulus 2 b and assume that T and T + denote the corresponding latency functions for moduli of the form 2 k 1 and 2 k + 1, respectively. Then, the operation latency for our RNS with special moduli can be written as: T RNS = max(t (a 1 ), T(b), T + (c 1 )) Operations with a power-of-2 modulus are always simpler than the corresponding operations with moduli of the form 2 k ± 1, and operations for low-cost moduli 2 k 1 are simpler than corresponding operations for moduli of the form 2 k + 1, for the same value of k. Thus, we will not lose any performance or efficiency if we assume: c 1 < a 1 b (*) Using the notation introduced, the defining parameters of the RNS moduli sets of Table 1 are as follows: M1: c 1 = a 1 = b M2: a 1 = b M3: c 1 = b < a 1 M4: b < a 1 M5: a 1 = b We see that M1, M3, and M4 do not satisfy the requirements (*) for optimal latency. Consequently, the choice of the corresponding moduli cannot be justified based on the speed of arithmetic operations alone. We thus introduce the following definition. Definition 2: An RNS with special moduli {2 k 1 k = a 1, a 2,...} and {2 k + 1 k = c 1, c 2,...}, with a 1 > a 2 >... and c 1 > c 2 >..., and a power-of-2 modulus 2 b is in normal form if b = max(a 1, c 1 + 1). For a particular set of special moduli, a normal-form RNS maximizes the dynamic range, without any speed penalty, as demonstrated later. Forward and reverse conversion latencies are discussed next. In converting from RNS to binary, certain methods require that the multiplicative inverse of one modulus with respect to another modulus be found and multiplied by other terms, with the results then summed up. Example 1: Inverses for M4 of Table 1. X A = (2 n ) 1 mod (2 n+1 1) = 2 X B = (2 n ) 1 mod (2 n 1) = 1 X C = (2 n 1) 1 mod (2 n+1 1) = 2 X D = (2 n+1 1) 1 mod (2 n 1) = 1 These results can be readily confirmed. For example, 2 is the mod-(2 n+1 1) inverse of 2 n because 2 2 n = 1 mod (2 n+1 1). Clearly, 2, 1, and 2 are quite easily multiplied by other quantities, because the product can be derived by mere shifting and complementation. Example 2: Inverses for M5 of Table 1. X A = (2 n+1 ) 1 mod (2 n+1 1) = 1 X B = (2 n+1 ) 1 mod (2 n 1) = 2 We also have X C = X C and X D = X D, as in Example 1. The moduli set M5 has a range that is double that of M4, while its widest residue has the same width. Given that speed of arithmetic in RNS is dictated by the width of the widest residue, M4 with its more limited range offers no advantage over M5 that could justify its use. It is seen from Examples 1 and 2 that the multiplicative inverses of M5 s moduli are as simple as those for M4, producing identical circuit speedups and simplifications. Similar results can be obtained for all other multiplicative inverses reported in the literature. To generalize the discussion above, we need the following definition. Definition 3: The (arithmetic) weight of an integer x is the minimum number of powers of 2, with positive or negative signs, that add up to x. So, the arithmetic weight of ±2 i is 1, while that of ±(2 j ± 2 k ), j k, is 2. RNS with Special Moduli: Equiv. & Fair Comparisons 3 44th Asilomar Conf. Signals, Systems, and Computers
4 Multiplying y by a weight-1 integer x requires only shifting and possibly complementation. In the case of a weight-2 multiplier x, a single addition is also needed. The one extra addition in the latter case may not affect the critical path length if it is merged into a multioperand addition process. For example, adding 6 integers is not any slower than adding 5 items. We now have all the tools and concepts needed to present the following general result. Theorem 1: Changing the modulus 2 b in the RNS of Definition 1 to 2 b+1 increases the weight of the inverses of moduli with respect to each other by at most 1. Proof: First, consider the inverse of the power-of-2 modulus. In this case, the following more general results can be proven that show the weight of the inverse to be 1 (the inverse is a positive or negative power of 2): (2 i ) 1 mod (2 j ( i) mod j 1) = 2 (2 i ) 1 mod (2 j ( i) mod j + 1) = ±2 In the latter equality, the sign depends on the parity of l, where i = lj + (i mod j). Next, let (2 a 1) 1 mod 2 b = x, with x of weight w; the final case of (2 c + 1) 1 mod 2 b is similar and is thus omitted in this proof. Let (2 a 1) 1 mod 2 b+1 = y. The fact that x(2 a 1) = 1 mod 2 b implies x(2 a 1) = h2 b + 1 for some integer h. It is readily verified that for h even, we have y = x, while for h odd, y = x + 2 b, thus establishing the desired result. Based on Theorem 1, doubling the power-of-2 modulus in a special set of moduli either has no effect on the simplicity of modular inverse computations or has a very small effect on cost and latency. We can thus modify the M3 and M4 example systems in Table 1 by doubling their power-of-2 moduli without an adverse effect on the speed of arithmetic. Once we have done this, we normalize the power-of-2 modulus to be 2 n in all cases, to get the equivalent normalized RNSs in Table 2. As shown in Table 3, in normalizing an RNS with special moduli, we sometimes increase the value of the parameter n required to achieve a desired dynamic range. However, as noted earlier, it is not the value of the parameter n, but rather the latency of the slowest RNS channel that determines the overall latency. Table 2. Three RNSs from Table 1, in normalized form. Set m 1 m 2 m 3 m 4 Width Range M1 2 n 1 2 n 2 n n 2 3n 1 M3 2 n n 2 n n 1 4n 1 2 4n 2 M4 2 n 1 2 n 2 n 1 1 3n 1 2 3n 1 Table 3. Some specific RNSs with special moduli. Equiv. range (b) n for M1/M1 3/4 6/6 7/7 8/9 10/10 11/11 n for M3/M3 3/4 4/5 5/6 6/7 7/8 8/9 n for M4/M4 4/5 5/6 7/7 8/9 9/10 11/11 4. Implications of Our Results Our results find applications in selecting special moduli for an RNS with a desired dynamic range, so as to minimize the operation latencies. Of course, latency is not the only consideration and we must also take into account implementation cost (VLSI area) and power consumption. Let us focus on area and take power to be roughly proportional to area. The moduli 2 k 1, 2 k, and 2 k + 1 have nearly identical contributions to the dynamic range. It thus makes sense to use larger moduli of the form 2 k + 1 only when an equivalent range extension cannot be achieved by raising the other moduli, especially 2 k. We are thus led to the following (this is an informal result, rather than a theorem, because modification of the moduli must be done with an eye toward keeping them pairwise relatively prime and may thus entail some trial and error). Assertion: If the conditions (*) are not satisfied for an RNS with special moduli, then a lower latency or wider range can always be achieved by changing the moduli, that is, modifying the parameters a 1, b, and c 1. A final observation is in order here. Comparing M5 with M2 of Table 1, we note that the former is in fact M2, but with the parameter n replaced by n + 1. In other words, M5 is nothing but an instance of M2. We are thus led to the conclusion that the moduli set M4 proposed and evaluated in [Anan07a] is neither novel nor offers advantages over the already proposed moduli sets that have been extensively studied in the literature on computer arithmetic and DSP. 5. Conclusion We have pointed out certain features of special RNS moduli of the form 2 k ± 1, with one power-of-2 modulus, exposing some equivalences and redundancies of efforts in the process. There do exist other classes of special moduli that can be studied separately or in combination with moduli of the form 2 k ± 1. One interesting example is moduli of the form β k for different values of β and k, which lead to simplifications if radix-β i representation is used in the ith RNS channel [Pali00]. RNS with Special Moduli: Equiv. & Fair Comparisons 4 44th Asilomar Conf. Signals, Systems, and Computers
5 References [Abda95] M. Abdallah and A. Skavantzos, New Multi- Moduli Residue and Quadratic Residue Systems for Large Dynamic Ranges, Proc. 29th Asilomar Conf. Signals, Systems, and Computers, 1995, pp [Abda05] M. Abdallah and A. Skavantzos, On Multi Moduli Residue Number Systems with Moduli of Forms r a, r b 1, r c + 1, IEEE Trans. Circuits and Systems I, Vol. 52, No. 7, pp , [Anan07] P. V. Ananda Mohan and A. B. Premkumar, RNS-to-Binary Converters for Two Four-Moduli Sets {2 n 1, 2 n, 2 n +1, 2 n+1 1} and {2 n 1, 2 n, 2 n +1, 2 n+1 +1}, IEEE Trans. Circuits and Systems I, Vol. 54, No. 6, pp , [Anan07a] P. V. Ananda Mohan, RNS-to-Binary Converter for a New Three-Moduli Set {2 n+1 1, 2 n, 2 n 1}, IEEE Trans. Circuits and Systems II, Vol. 54, No. 9, pp , [Aviz71] A. Avizienis, Arithmetic Error Codes: Cost and Effectiveness Studies for Application in Digital System Design, IEEE Trans. Computers, Vol. 20, No. 11, pp , [Bi88] G. Bi and E. V. Jones, Fast Conversion Between Binary and Residue Numbers, Electronics Letters, Vol. 24, No. 19, pp , [Cao07] B. Cao, C. H. Chang, and T. Srikanthan, A Residue-to-Binary Converter for a New Five- Moduli Set, IEEE Trans. Circuits and Systems I, Vol. 54, No. 5, pp , [Conw99] R. Conway and J. Nelson, Fast Converter for 3 Moduli RNS Using New Property of CRT, IEEE Trans. Computers, Vol. 48, No. 8, pp , [Conw03] R. Conway and J. Nelson, New CRT-Based RNS Converter Using Restricted Moduli Set, IEEE Trans. Computers, Vol. 52, No. 5, pp , [Conw04] R. Conway and J. Nelson, Improved RNS FIR Filter Architectures, IEEE Trans. Circuits and Systems II, Vol. 51, No. 1, pp , [Gall97] D. Gallaher, F. E. Petry, and P. Srinivasan, The Digit Parallel Method for Fast RNS to Weighted Number System Conversion for Specific Moduli (2 k 1, 2 k, 2 k + 1), IEEE Trans. Circuits and Systems II, Vol. 44, No. 1, pp , [Hias98] A. A. Hiasat and H. S. Abdel-Aty-Zohdy, Residue to Binary Arithmetic Converter for the Moduli Set (2 k, 2 k 1, 2 k 1 1), IEEE Trans. Circuits and Systems II, Vol. 45, No. 2, pp , [Hias03] A. Hiasat and A. Sweiden, Residue Number System to Binary Converter for the Moduli Set (2 n 1, 2 n 1, 2 n + 1), J. Systems Architecture, Vol. 49, Nos. 1-2, pp , [Hias03a] A. Hiasat, An Arithmetic Residue to Binary Conversion Technique, Integration, the VLSI J., Vol. 36, Nos. 1-2, pp , [Mola10] A. S. Molahosseini, K. Navi, C. Dadkhah, O. Kavehei, and S. Timarchi, Efficient Reverse Converter Designs for the New 4-Moduli Sets {2 n 1, 2 n, 2 n +1, 2 2n+1 1} and {2 n 1, 2 n +1, 2 2n, 2 2n +1} Based on New CRTs, IEEE Trans. Circuits and Systems I, Vol. 57, No. 4, pp , [Omon07] A. Omondi and B. Premkumar, Residue Number Systems: Theory and Implementation, World Scientific, [Pali00] V. Paliouras and T. Stouraitis, Novel High-Radix Residue Number System Architectures, IEEE Trans. VLSI, Vol. 8, No. 3, pp , [Parh76] B. Parhami, Low-Cost Residue Number Systems for Computer Arithmetic, AFIPS Conf. Proc., Vol. 45 (1976 National Computer Conf.), AFIPS Press, pp [Pate07] R. A. Patel, M. Benaissa, and S. Boussakta, Fast Modulo 2 n (2 n 2 + 1) Addition: A New Class of Adders for RNS, IEEE Trans. Computers, Vol. 56, No. 4, pp , [Pies95] S. J. Piestrak, A High-Speed Realization of Residue to Binary System Converter, IEEE Trans. Circuits and Systems II, Vol. 42, No. 12, pp , [Sheu04] M.-H. Sheu, S.-H. Lin, C. Chen, and S.-W. Yang, An Efficient VLSI Design for a Residue to Binary Converter for General Balance Moduli (2 n 3, 2 n + 1, 2 n 1, 2 n + 3), IEEE Trans. Circuits and Systems II, Vol. 51, No. 3, pp , [Sode86] M. A. Soderstrand, W. K. Jenkins, G. A. Jullien, and F. J. Taylor (eds.), Residue Number System Arithmetic, IEEE Press, [Svob59] A. Svoboda, The Numerical System of Residual Classes in Mathematical Machines, in Information Processing (Proc. UNESCO Conf., 1959), pp [Tomc08] T. Tomczak, Fast Sign Detection for RNS (2 n 1, 2 n, 2 n +1), IEEE Trans. Circuits and Systems I, Vol. 55, No. 6, pp , [Wang99] Y. Wang, M. N. S. Swamy, and M. O. Ahmad, Residue to Binary Number Converters for Three Moduli Sets, IEEE Trans. Circuits and Systems II, Vol. 46, No. 2, pp , [Wang00] W. Wang, M. N. S. Swamy, M. O. Ahmad, and Y. Wang, A High-Speed Residue-to-Binary Converter for Three-Moduli (2 k, 2 k 1, 2 k 1 1) RNS and a Scheme for Its VLSI Implementation, IEEE Trans. Circuits and Systems II, Vol. 47, No. 12, pp , [Wang00a] Z. Wang, G. A. Jullien, and W. C. Miller, An Improved Residue to Binary Converter, IEEE Trans. Circuits and Systems I, Vol. 47, No. 9, pp , RNS with Special Moduli: Equiv. & Fair Comparisons 5 44th Asilomar Conf. Signals, Systems, and Computers
An Effective New CRT Based Reverse Converter for a Novel Moduli Set { 2 2n+1 1, 2 2n+1, 2 2n 1 }
An Effective New CRT Based Reverse Converter for a Novel Moduli Set +1 1, +1, 1 } Edem Kwedzo Bankas, Kazeem Alagbe Gbolagade Department of Computer Science, Faculty of Mathematical Sciences, University
Volume 3, No. 1, January 2012 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at
Volume 3, No 1, January 2012 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at wwwjgrcsinfo A NOVEL HIGH DYNAMIC RANGE 5-MODULUS SET WHIT EFFICIENT REVERSE CONVERTER AND
KEYWORDS: Multiple Valued Logic (MVL), Residue Number System (RNS), Quinary Logic (Q uin), Quinary Full Adder, QFA, Quinary Half Adder, QHA.
GLOBAL JOURNAL OF ADVANCED ENGINEERING TECHNOLOGIES AND SCIENCES DESIGN OF A QUINARY TO RESIDUE NUMBER SYSTEM CONVERTER USING MULTI-LEVELS OF CONVERSION Hassan Amin Osseily Electrical and Electronics Department,
A High-Speed Realization of Chinese Remainder Theorem
Proceedings of the 2007 WSEAS Int. Conference on Circuits, Systems, Signal and Telecommunications, Gold Coast, Australia, January 17-19, 2007 97 A High-Speed Realization of Chinese Remainder Theorem Shuangching
Digital/Analog Arithmetic with Continuous-Valued Residues
Digital/Analog Arithmetic with Continuous-Valued Residues Behrooz Parhami Department of Electrical and Computer Engineering University of California, Santa Barbara, USA parhami@ece.ucsb.edu Abstract Residue
GENERALIZED ARYABHATA REMAINDER THEOREM
International Journal of Innovative Computing, Information and Control ICIC International c 2010 ISSN 1349-4198 Volume 6, Number 4, April 2010 pp. 1865 1871 GENERALIZED ARYABHATA REMAINDER THEOREM Chin-Chen
International Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 8, August 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Efficient
A Suggestion for a Fast Residue Multiplier for a Family of Moduli of the Form (2 n (2 p ± 1))
The Computer Journal, 47(1), The British Computer Society; all rights reserved A Suggestion for a Fast Residue Multiplier for a Family of Moduli of the Form ( n ( p ± 1)) Ahmad A. Hiasat Electronics Engineering
AREA EFFICIENT MODULAR ADDER/SUBTRACTOR FOR RESIDUE MODULI
AREA EFFICIENT MODULAR ADDER/SUBTRACTOR FOR RESIDUE MODULI G.CHANDANA 1 (M.TECH),chandana.g89@gmail.com P.RAJINI 2 (M.TECH),paddam.rajani@gmail.com Abstract Efficient modular adders and subtractors for
Novel Modulo 2 n +1Multipliers
Novel Modulo Multipliers H. T. Vergos Computer Engineering and Informatics Dept., University of Patras, 26500 Patras, Greece. vergos@ceid.upatras.gr C. Efstathiou Informatics Dept.,TEI of Athens, 12210
Performance Evaluation of Signed-Digit Architecture for Weighted-to-Residue and Residue-to-Weighted Number Converters with Moduli Set (2 n 1, 2 n,
Regular Paper Performance Evaluation of Signed-Digit Architecture for Weighted-to-Residue and Residue-to-Weighted Number Converters with Moduli Set (2 n 1, 2 n, 2 n +1) Shuangching Chen and Shugang Wei
Forward and Reverse Converters and Moduli Set Selection in Signed-Digit Residue Number Systems
J Sign Process Syst DOI 10.1007/s11265-008-0249-8 Forward and Reverse Converters and Moduli Set Selection in Signed-Digit Residue Number Systems Andreas Persson Lars Bengtsson Received: 8 March 2007 /
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research)
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
Implementation Of Digital Fir Filter Using Improved Table Look Up Scheme For Residue Number System
Implementation Of Digital Fir Filter Using Improved Table Look Up Scheme For Residue Number System G.Suresh, G.Indira Devi, P.Pavankumar Abstract The use of the improved table look up Residue Number System
Design and Implementation of Efficient Modulo 2 n +1 Adder
www..org 18 Design and Implementation of Efficient Modulo 2 n +1 Adder V. Jagadheesh 1, Y. Swetha 2 1,2 Research Scholar(INDIA) Abstract In this brief, we proposed an efficient weighted modulo (2 n +1)
A VLSI Algorithm for Modular Multiplication/Division
A VLSI Algorithm for Modular Multiplication/Division Marcelo E. Kaihara and Naofumi Takagi Department of Information Engineering Nagoya University Nagoya, 464-8603, Japan mkaihara@takagi.nuie.nagoya-u.ac.jp
Residue Number Systems Ivor Page 1
Residue Number Systems 1 Residue Number Systems Ivor Page 1 7.1 Arithmetic in a modulus system The great speed of arithmetic in Residue Number Systems (RNS) comes from a simple theorem from number theory:
The equivalence of twos-complement addition and the conversion of redundant-binary to twos-complement numbers
The equivalence of twos-complement addition and the conversion of redundant-binary to twos-complement numbers Gerard MBlair The Department of Electrical Engineering The University of Edinburgh The King
Computer Architecture 10. Residue Number Systems
Computer Architecture 10 Residue Number Systems Ma d e wi t h Op e n Of f i c e. o r g 1 A Puzzle What number has the reminders 2, 3 and 2 when divided by the numbers 7, 5 and 3? x mod 7 = 2 x mod 5 =
On the Complexity of Error Detection Functions for Redundant Residue Number Systems
On the Complexity of Error Detection Functions for Redundant Residue Number Systems Tsutomu Sasao 1 and Yukihiro Iguchi 2 1 Dept. of Computer Science and Electronics, Kyushu Institute of Technology, Iizuka
Lecture 8: Sequential Multipliers
Lecture 8: Sequential Multipliers ECE 645 Computer Arithmetic 3/25/08 ECE 645 Computer Arithmetic Lecture Roadmap Sequential Multipliers Unsigned Signed Radix-2 Booth Recoding High-Radix Multiplication
Optimization of new Chinese Remainder theorems using special moduli sets
Louisiana State University LSU Digital Commons LSU Master's Theses Graduate School 2010 Optimization of new Chinese Remainder theorems using special moduli sets Narendran Narayanaswamy Louisiana State
Digital Arithmetic in Nature: Continuous-Digit RNS
Advance Access publication on 17 July 2014 The British Computer Society 2014. All rights reserved. For Permissions, please email: journals.permissions@oup.com doi:10.1093/comjnl/bxu060 Digital Arithmetic
Information encoding and decoding using Residue Number System for {2 2n -1, 2 2n, 2 2n +1} moduli sets
Information encoding and decoding using Residue Number System for {2-1, 2, 2 +1} moduli sets Idris Abiodun Aremu Kazeem Alagbe Gbolagade Abstract- This paper presents the design methods of information
assume that the message itself is considered the RNS representation of a number, thus mapping in and out of the RNS system is not necessary. This is p
Montgomery Modular Multiplication in Residue Arithmetic Jean-Claude Bajard LIRMM Montpellier, France bajardlirmm.fr Laurent-Stephane Didier Universite de Bretagne Occidentale Brest, France laurent-stephane.didieruniv-brest.fr
VLSI Arithmetic. Lecture 9: Carry-Save and Multi-Operand Addition. Prof. Vojin G. Oklobdzija University of California
VLSI Arithmetic Lecture 9: Carry-Save and Multi-Operand Addition Prof. Vojin G. Oklobdzija University of California http://www.ece.ucdavis.edu/acsel Carry-Save Addition* *from Parhami 2 June 18, 2003 Carry-Save
Frequency Domain Finite Field Arithmetic for Elliptic Curve Cryptography
Frequency Domain Finite Field Arithmetic for Elliptic Curve Cryptography Selçuk Baktır, Berk Sunar {selcuk,sunar}@wpi.edu Department of Electrical & Computer Engineering Worcester Polytechnic Institute
THE discrete sine transform (DST) and the discrete cosine
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS-II: EXPRESS BIREFS 1 New Systolic Algorithm and Array Architecture for Prime-Length Discrete Sine Transform Pramod K. Meher Senior Member, IEEE and M. N. S. Swamy
ISSN (PRINT): , (ONLINE): , VOLUME-5, ISSUE-7,
HIGH PERFORMANCE MONTGOMERY MULTIPLICATION USING DADDA TREE ADDITION Thandri Adi Varalakshmi Devi 1, P Subhashini 2 1 PG Scholar, Dept of ECE, Kakinada Institute of Technology, Korangi, AP, India. 2 Assistant
Lecture 8. Sequential Multipliers
Lecture 8 Sequential Multipliers Required Reading Behrooz Parhami, Computer Arithmetic: Algorithms and Hardware Design Chapter 9, Basic Multiplication Scheme Chapter 10, High-Radix Multipliers Chapter
A HIGH-SPEED PROCESSOR FOR RECTANGULAR-TO-POLAR CONVERSION WITH APPLICATIONS IN DIGITAL COMMUNICATIONS *
Copyright IEEE 999: Published in the Proceedings of Globecom 999, Rio de Janeiro, Dec 5-9, 999 A HIGH-SPEED PROCESSOR FOR RECTAGULAR-TO-POLAR COVERSIO WITH APPLICATIOS I DIGITAL COMMUICATIOS * Dengwei
Algorithms (II) Yu Yu. Shanghai Jiaotong University
Algorithms (II) Yu Yu Shanghai Jiaotong University Chapter 1. Algorithms with Numbers Two seemingly similar problems Factoring: Given a number N, express it as a product of its prime factors. Primality:
SUFFIX PROPERTY OF INVERSE MOD
IEEE TRANSACTIONS ON COMPUTERS, 2018 1 Algorithms for Inversion mod p k Çetin Kaya Koç, Fellow, IEEE, Abstract This paper describes and analyzes all existing algorithms for computing x = a 1 (mod p k )
ENGIN 112 Intro to Electrical and Computer Engineering
ENGIN 112 Intro to Electrical and Computer Engineering Lecture 3 More Number Systems Overview Hexadecimal numbers Related to binary and octal numbers Conversion between hexadecimal, octal and binary Value
A COMBINED 16-BIT BINARY AND DUAL GALOIS FIELD MULTIPLIER. Jesus Garcia and Michael J. Schulte
A COMBINED 16-BIT BINARY AND DUAL GALOIS FIELD MULTIPLIER Jesus Garcia and Michael J. Schulte Lehigh University Department of Computer Science and Engineering Bethlehem, PA 15 ABSTRACT Galois field arithmetic
NUMBERS AND CODES CHAPTER Numbers
CHAPTER 2 NUMBERS AND CODES 2.1 Numbers When a number such as 101 is given, it is impossible to determine its numerical value. Some may say it is five. Others may say it is one hundred and one. Could it
Low Power, High Speed Parallel Architecture For Cyclic Convolution Based On Fermat Number Transform (FNT)
RESEARCH ARTICLE OPEN ACCESS Low Power, High Speed Parallel Architecture For Cyclic Convolution Based On Fermat Number Transform (FNT) T.Jyothsna 1 M.Tech, M.Pradeep 2 M.Tech 1 E.C.E department, shri Vishnu
Design and Comparison of Wallace Multiplier Based on Symmetric Stacking and High speed counters
International Journal of Engineering Research and Advanced Technology (IJERAT) DOI:http://dx.doi.org/10.31695/IJERAT.2018.3271 E-ISSN : 2454-6135 Volume.4, Issue 6 June -2018 Design and Comparison of Wallace
Residue Number Systems. Alternative number representations. TSTE 8 Digital Arithmetic Seminar 2. Residue Number Systems.
TSTE8 Digital Arithmetic Seminar Oscar Gustafsson The idea is to use the residues of the numbers and perform operations on the residues Also called modular arithmetic since the residues are computed using
ISSN (PRINT): , (ONLINE): , VOLUME-4, ISSUE-10,
A NOVEL DOMINO LOGIC DESIGN FOR EMBEDDED APPLICATION Dr.K.Sujatha Associate Professor, Department of Computer science and Engineering, Sri Krishna College of Engineering and Technology, Coimbatore, Tamilnadu,
Chapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn
Chapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn Randomization Randomized Algorithm: An algorithm that uses (or can use) random coin flips in order to make decisions We will see: randomization
A New Bit-Serial Architecture for Field Multiplication Using Polynomial Bases
A New Bit-Serial Architecture for Field Multiplication Using Polynomial Bases Arash Reyhani-Masoleh Department of Electrical and Computer Engineering The University of Western Ontario London, Ontario,
Lecture 11. Advanced Dividers
Lecture 11 Advanced Dividers Required Reading Behrooz Parhami, Computer Arithmetic: Algorithms and Hardware Design Chapter 15 Variation in Dividers 15.3, Combinational and Array Dividers Chapter 16, Division
Computer Architecture 10. Fast Adders
Computer Architecture 10 Fast s Ma d e wi t h Op e n Of f i c e. o r g 1 Carry Problem Addition is primary mechanism in implementing arithmetic operations Slow addition directly affects the total performance
Svoboda-Tung Division With No Compensation
Svoboda-Tung Division With No Compensation Luis MONTALVO (IEEE Student Member), Alain GUYOT Integrated Systems Design Group, TIMA/INPG 46, Av. Félix Viallet, 38031 Grenoble Cedex, France. E-mail: montalvo@archi.imag.fr
Cost/Performance Tradeoff of n-select Square Root Implementations
Australian Computer Science Communications, Vol.22, No.4, 2, pp.9 6, IEEE Comp. Society Press Cost/Performance Tradeoff of n-select Square Root Implementations Wanming Chu and Yamin Li Computer Architecture
Combinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
A Low-Error Statistical Fixed-Width Multiplier and Its Applications
A Low-Error Statistical Fixed-Width Multiplier and Its Applications Yuan-Ho Chen 1, Chih-Wen Lu 1, Hsin-Chen Chiang, Tsin-Yuan Chang, and Chin Hsia 3 1 Department of Engineering and System Science, National
AN IMPROVED LOW LATENCY SYSTOLIC STRUCTURED GALOIS FIELD MULTIPLIER
Indian Journal of Electronics and Electrical Engineering (IJEEE) Vol.2.No.1 2014pp1-6 available at: www.goniv.com Paper Received :05-03-2014 Paper Published:28-03-2014 Paper Reviewed by: 1. John Arhter
DESIGN OF PARITY PRESERVING LOGIC BASED FAULT TOLERANT REVERSIBLE ARITHMETIC LOGIC UNIT
International Journal of VLSI design & Communication Systems (VLSICS) Vol.4, No.3, June 2013 DESIGN OF PARITY PRESERVING LOGIC BASED FAULT TOLERANT REVERSIBLE ARITHMETIC LOGIC UNIT Rakshith Saligram 1
Commutative Rings and Fields
Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two
Improved Lempel-Ziv-Welch s Error Detection and Correction Scheme using Redundant Residue Number System (RRNS)
Circulation in Computer Science Vol2, No6, pp: (25-30), July 2017 https://doiorg/1022632/ccs-2017-252-33 Improved Lempel-Ziv-Welch s Error Detection and Correction Scheme using Redundant Residue Number
Logic and Computer Design Fundamentals. Chapter 5 Arithmetic Functions and Circuits
Logic and Computer Design Fundamentals Chapter 5 Arithmetic Functions and Circuits Arithmetic functions Operate on binary vectors Use the same subfunction in each bit position Can design functional block
EXPLOITING RESIDUE NUMBER SYSTEM FOR POWER-EFFICIENT DIGITAL SIGNAL PROCESSING IN EMBEDDED PROCESSORS
EXPLOITING RESIDUE NUMBER SYSTEM FOR POWER-EFFICIENT DIGITAL SIGNAL PROCESSING IN EMBEDDED PROCESSORS Rooju Chokshi 1, Krzysztof S. Berezowski 2,3, Aviral Shrivastava 2, Stanisław J. Piestrak 4 1 Microsoft
2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
What s the Deal? MULTIPLICATION. Time to multiply
What s the Deal? MULTIPLICATION Time to multiply Multiplying two numbers requires a multiply Luckily, in binary that s just an AND gate! 0*0=0, 0*1=0, 1*0=0, 1*1=1 Generate a bunch of partial products
ARITHMETIC COMBINATIONAL MODULES AND NETWORKS
ARITHMETIC COMBINATIONAL MODULES AND NETWORKS 1 SPECIFICATION OF ADDER MODULES FOR POSITIVE INTEGERS HALF-ADDER AND FULL-ADDER MODULES CARRY-RIPPLE AND CARRY-LOOKAHEAD ADDER MODULES NETWORKS OF ADDER MODULES
NOVEL QCA CONTROL GATE AND NEW DESIGNING OF MEMORY ON THE BASIS OF QUANTUM DOT CELLULAR AUTOMATA WITH MINIMUM QCA BLOCKS
Indian J.Sci.Res. 2(1) : 96-100, 2014 ISSN : 2250-0138 (Online) ISSN: 0976-2876(Print) NOVEL QCA CONTROL GATE AND NEW DESIGNING OF MEMORY ON THE BASIS OF QUANTUM DOT CELLULAR AUTOMATA WITH MINIMUM QCA
A Digit-Serial Systolic Multiplier for Finite Fields GF(2 m )
A Digit-Serial Systolic Multiplier for Finite Fields GF( m ) Chang Hoon Kim, Sang Duk Han, and Chun Pyo Hong Department of Computer and Information Engineering Taegu University 5 Naeri, Jinryang, Kyungsan,
Class Website:
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #5 Instructor: Andrew B. Kahng (lecture) Email: abk@ece.ucsd.edu Telephone: 858-822-4884 office, 858-353-0550 cell Office:
Chinese Remainder Algorithms. Çetin Kaya Koç Spring / 22
Chinese Remainder Algorithms http://koclab.org Çetin Kaya Koç Spring 2018 1 / 22 The Chinese Remainder Theorem Some cryptographic algorithms work with two (such as RSA) or more moduli (such as secret-sharing)
HARDWARE IMPLEMENTATION OF FIR/IIR DIGITAL FILTERS USING INTEGRAL STOCHASTIC COMPUTATION. Arash Ardakani, François Leduc-Primeau and Warren J.
HARWARE IMPLEMENTATION OF FIR/IIR IGITAL FILTERS USING INTEGRAL STOCHASTIC COMPUTATION Arash Ardakani, François Leduc-Primeau and Warren J. Gross epartment of Electrical and Computer Engineering McGill
Reduced-Area Constant-Coefficient and Multiple-Constant Multipliers for Xilinx FPGAs with 6-Input LUTs
Article Reduced-Area Constant-Coefficient and Multiple-Constant Multipliers for Xilinx FPGAs with 6-Input LUTs E. George Walters III Department of Electrical and Computer Engineering, Penn State Erie,
Median architecture by accumulative parallel counters
Median architecture by accumulative parallel counters Article Accepted Version Cadenas Medina, J., Megson, G. M. and Sherratt, S. (2015) Median architecture by accumulative parallel counters. IEEE Transactions
Tree and Array Multipliers Ivor Page 1
Tree and Array Multipliers 1 Tree and Array Multipliers Ivor Page 1 11.1 Tree Multipliers In Figure 1 seven input operands are combined by a tree of CSAs. The final level of the tree is a carry-completion
Conquering Edge Faults in a Butterfly with Automorphisms
International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS-0) Conquering Edge Faults in a Butterfly with Automorphisms Meghanad D. Wagh and Khadidja Bendjilali Department
2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007 Topic Notes: Digital Logic Our goal for the next few weeks is to paint a a reasonably complete picture of how we can go from transistor
Arithmetic in Integer Rings and Prime Fields
Arithmetic in Integer Rings and Prime Fields A 3 B 3 A 2 B 2 A 1 B 1 A 0 B 0 FA C 3 FA C 2 FA C 1 FA C 0 C 4 S 3 S 2 S 1 S 0 http://koclab.org Çetin Kaya Koç Spring 2018 1 / 71 Contents Arithmetic in Integer
Introduction to Modern Cryptography. Benny Chor
Introduction to Modern Cryptography Benny Chor RSA Public Key Encryption Factoring Algorithms Lecture 7 Tel-Aviv University Revised March 1st, 2008 Reminder: The Prime Number Theorem Let π(x) denote the
p = This is small enough that its primality is easily verified by trial division. A candidate prime above 1000 p of the form p U + 1 is
LARGE PRIME NUMBERS 1. Fermat Pseudoprimes Fermat s Little Theorem states that for any positive integer n, if n is prime then b n % n = b for b = 1,..., n 1. In the other direction, all we can say is that
GALOP : A Generalized VLSI Architecture for Ultrafast Carry Originate-Propagate adders
GALOP : A Generalized VLSI Architecture for Ultrafast Carry Originate-Propagate adders Dhananjay S. Phatak Electrical Engineering Department State University of New York, Binghamton, NY 13902-6000 Israel
9. Datapath Design. Jacob Abraham. Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017
9. Datapath Design Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017 October 2, 2017 ECE Department, University of Texas at Austin
RSA Implementation. Oregon State University
RSA Implementation Çetin Kaya Koç Oregon State University 1 Contents: Exponentiation heuristics Multiplication algorithms Computation of GCD and Inverse Chinese remainder algorithm Primality testing 2
Power Consumption Analysis. Arithmetic Level Countermeasures for ECC Coprocessor. Arithmetic Operators for Cryptography.
Power Consumption Analysis General principle: measure the current I in the circuit Arithmetic Level Countermeasures for ECC Coprocessor Arnaud Tisserand, Thomas Chabrier, Danuta Pamula I V DD circuit traces
MODULAR ARITHMETIC I
MODULAR ARITHMETIC I. Modular Arithmetic and Check Digit Schemes The check digit schemes that we have been studying have some features in common. Certain information (book title publisher etc., personal
Parallelism in Computer Arithmetic: A Historical Perspective
Parallelism in Computer Arithmetic: A Historical Perspective 21s 2s 199s 198s 197s 196s 195s Behrooz Parhami Aug. 218 Parallelism in Computer Arithmetic Slide 1 University of California, Santa Barbara
Chapter 1: Solutions to Exercises
1 DIGITAL ARITHMETIC Miloš D. Ercegovac and Tomás Lang Morgan Kaufmann Publishers, an imprint of Elsevier, c 2004 Exercise 1.1 (a) 1. 9 bits since 2 8 297 2 9 2. 3 radix-8 digits since 8 2 297 8 3 3. 3
Design of Low Power, High Speed Parallel Architecture of Cyclic Convolution Based on Fermat Number Transform (FNT)
Advance in Electronic and Electric Engineering. ISSN 2231-1297, Volume 3, Number 6 (2013), pp. 641-650 Research India Publications http://www.ripublication.com/aeee.htm Design of Low Power, High Speed
Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations
Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 9.1 Chapter 9 Objectives
MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST
MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST JAMES MCIVOR Today we enter Chapter 2, which is the heart of this subject. Before starting, recall that last time we saw the integers have unique factorization
Design and Implementation of Carry Tree Adders using Low Power FPGAs
1 Design and Implementation of Carry Tree Adders using Low Power FPGAs Sivannarayana G 1, Raveendra babu Maddasani 2 and Padmasri Ch 3. Department of Electronics & Communication Engineering 1,2&3, Al-Ameer
Chapter 9 Factorisation and Discrete Logarithms Using a Factor Base
Chapter 9 Factorisation and Discrete Logarithms Using a Factor Base February 15, 2010 9 The two intractable problems which are at the heart of public key cryptosystems, are the infeasibility of factorising
Binary Multipliers. Reading: Study Chapter 3. The key trick of multiplication is memorizing a digit-to-digit table Everything else was just adding
Binary Multipliers The key trick of multiplication is memorizing a digit-to-digit table Everything else was just adding 2 3 4 5 6 7 8 9 2 3 4 5 6 7 8 9 2 2 4 6 8 2 4 6 8 3 3 6 9 2 5 8 2 24 27 4 4 8 2 6
EECS Components and Design Techniques for Digital Systems. Lec 26 CRCs, LFSRs (and a little power)
EECS 150 - Components and esign Techniques for igital Systems Lec 26 CRCs, LFSRs (and a little power) avid Culler Electrical Engineering and Computer Sciences University of California, Berkeley http://www.eecs.berkeley.edu/~culler
Part II Addition / Subtraction
Part II Addition / Subtraction Parts Chapters I. Number Representation 1. 2. 3. 4. Numbers and Arithmetic Representing Signed Numbers Redundant Number Systems Residue Number Systems Elementary Operations
Chapter 7 Randomization Algorithm Theory WS 2017/18 Fabian Kuhn
Chapter 7 Randomization Algorithm Theory WS 2017/18 Fabian Kuhn Randomization Randomized Algorithm: An algorithm that uses (or can use) random coin flips in order to make decisions We will see: randomization
Tight Bounds on the Ratio of Network Diameter to Average Internode Distance. Behrooz Parhami University of California, Santa Barbara
Tight Bounds on the Ratio of Network Diameter to Average Internode Distance Behrooz Parhami University of California, Santa Barbara About This Presentation This slide show was first developed in fall of
High Performance GHASH Function for Long Messages
High Performance GHASH Function for Long Messages Nicolas Méloni 1, Christophe Négre 2 and M. Anwar Hasan 1 1 Department of Electrical and Computer Engineering University of Waterloo, Canada 2 Team DALI/ELIAUS
Area Efficient Sparse Modulo 2 n 3 Adder
Circuits and Systems, 2016, 7, 4024-4035 http://www.scirp.org/journal/cs ISSN Online: 2153-1293 ISSN Print: 2153-1285 Area Efficient Sparse Modulo 2 n 3 Adder Ritesh Kumar Jaiswal, Chatla Naveen Kumar,
A Deep Convolutional Neural Network Based on Nested Residue Number System
A Deep Convolutional Neural Network Based on Nested Residue Number System Hiroki Nakahara Tsutomu Sasao Ehime University, Japan Meiji University, Japan Outline Background Deep convolutional neural network
CPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 9 September 30, 2015 CPSC 467, Lecture 9 1/47 Fast Exponentiation Algorithms Number Theory Needed for RSA Elementary Number Theory
Subquadratic space complexity multiplier for a class of binary fields using Toeplitz matrix approach
Subquadratic space complexity multiplier for a class of binary fields using Toeplitz matrix approach M A Hasan 1 and C Negre 2 1 ECE Department and CACR, University of Waterloo, Ontario, Canada 2 Team
A Hardware-Oriented Method for Evaluating Complex Polynomials
A Hardware-Oriented Method for Evaluating Complex Polynomials Miloš D Ercegovac Computer Science Department University of California at Los Angeles Los Angeles, CA 90095, USA milos@csuclaedu Jean-Michel
Quality of Minimal Sets of Prime Implicants of Boolean Functions
INTL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS, 2017, VOL. 63, NO. 2, PP. 165-169 Manuscript received October 9, 2016; revised April, 2017. DOI: 10.1515/eletel-2017-0022 Quality of Minimal Sets of
Part II Addition / Subtraction
Part II Addition / Subtraction Parts Chapters I. Number Representation 1. 2. 3. 4. Numbers and Arithmetic Representing Signed Numbers Redundant Number Systems Residue Number Systems Elementary Operations
Reduced-Error Constant Correction Truncated Multiplier
This article has been accepted and published on J-STAGE in advance of copyediting. Content is final as presented. IEICE Electronics Express, Vol.*, No.*, 1 8 Reduced-Error Constant Correction Truncated
UNIT V FINITE WORD LENGTH EFFECTS IN DIGITAL FILTERS PART A 1. Define 1 s complement form? In 1,s complement form the positive number is represented as in the sign magnitude form. To obtain the negative
ECE 645: Lecture 3. Conditional-Sum Adders and Parallel Prefix Network Adders. FPGA Optimized Adders
ECE 645: Lecture 3 Conditional-Sum Adders and Parallel Prefix Network Adders FPGA Optimized Adders Required Reading Behrooz Parhami, Computer Arithmetic: Algorithms and Hardware Design Chapter 7.4, Conditional-Sum
INF2270 Spring Philipp Häfliger. Lecture 8: Superscalar CPUs, Course Summary/Repetition (1/2)
INF2270 Spring 2010 Philipp Häfliger Summary/Repetition (1/2) content From Scalar to Superscalar Lecture Summary and Brief Repetition Binary numbers Boolean Algebra Combinational Logic Circuits Encoder/Decoder