Low complexity bit parallel multiplier for GF(2 m ) generated by equally-spaced trinomials
|
|
- Madeleine Sullivan
- 5 years ago
- Views:
Transcription
1 Inforation Processing Letters Low coplexity bit parallel ultiplier for GF generated by equally-spaced trinoials Haibin Shen a,, Yier Jin a,b a Institute of VLSI Design, Zhejiang University, Hangzhou, China b Departent of Electrical Engineering, Yale University, 10 Hillhouse Avenue, New Haven, CT 0650, USA Received 0 February 007; received in revised for 14 May 007; accepted 3 January 008 Available online 16 March 008 Counicated by D. Pointcheval Abstract Based on the shifted polynoial basis SPB, a high efficient bit-parallel ultiplier for the field GF defined by an equallyspaced trinoial EST is proposed. The use of SPB significantly reduces tie delay of the proposed ultiplier and at the sae tie Karatsuba ethod is cobined with SPB to decrease space coplexity. As a result, with the sae tie coplexity, approxiately 3/4 gates of previous ultipliers are used in the proposed ultiplier. 008 Published by Elsevier B.V. Keywords: Shifted polynoial basis SPB; Equally-spaced trinoial EST; Karatsuba ethod; Bit-parallel ultiplier; Cryptography 1. Introduction Finite filed operations are used in any areas such as coding theory, coputers algebra, cobinatorial designs and cryptography [3,6,13]. Aong these operations, ultiplication is of the ost iportance because other coplex operations such as exponentiation, division, etc. can be carried out through iterative ultiplications. Based on the advanced design technology nowadays, ore and ore logic gates can be located on a single chip which akes the ipleentations of parallel architectures possible and reasonable. In order to iprove the efficiency of cryptographic syste and coding syste, any bit-parallel ultiplier archi- * Corresponding author. E-ail addresses: shb@vlsi.zju.edu.cn H. Shen, yier.jin@yale.edu Y. Jin. tectures have been proposed recently to achieve high coputation speed [,5,8,10 1,14,15]. Also, various basis except for polynoial basis PB, dual basis DB, and noral basis NB are developed in order to further reduce the critical path of ultipliers with even fewer logic gates. And certain types of irreducible polynoials are used to iprove the perforance of ultipliers in which trinoial is one of the best choices [1]. Although different architectures can be evaluated fro several points of view, tie coplexity and space coplexity are often the two ost iportant paraeters. The forer is defined as the elapsed tie between input and output of the circuit ipleenting the ultiplier, and it is usually expressed as the su of T A the delay of a two input AND gate and T X the delay of a two input XOR gate with corresponding coefficients. The latter is weighed by the nubers of AND gates and XOR gates used in ultiplier denoted as #AND /$ see front atter 008 Published by Elsevier B.V. doi: /j.ipl
2 1 H. Shen, Y. Jin / Inforation Processing Letters and #XOR. In the finite field generated by trinoials, the ost efficient ultiplier architecture nowadays contains AND gates and 1 XOR gates with tie delay of T A log T X [5]. If the trinoial is an equally-spaced trinoial EST in the for of fx x + x + 1is even, the best result is TieDelay T A log 1 T X, #AND, #XOR. As entioned above, although we can put uch ore logic gates in a single chip than ever before, the O coplexity of AND and XOR gates still costs considerable chip area. Many researchers are devoted to the reduction of ultipliers space coplexity without increasing their tie coplexity. M. Elia et al. [1] use Karatsuba Ofan ultiplication and achieve even lower space coplexity but their ethod requires two ore T X delays. In this paper, we propose a new bit-parallel ultiplier for GF defined by EST fx x + x + 1 using shifted polynoial basis which can significantly reduce the critical path. Also, we use the well-known Karatsuba Ofan ultiplication [4] to decrease the space coplexity of the proposed bit-parallel ultiplier. Based on these two ethods, an high efficient architecture is constructed. The space coplexity of the proposed ultiplier is about 3/4 of the previous result while the tie coplexity atches the best efficient ultipliers ever known of T A log 1 T X. The irreducible EST in the for of x + x + 1exist when 3 i where i is a non-negative integer. Although the nuber of irreducible EST is not that redundant, they can be used in source critical area, e.g., sartcard where field polynoials are often fixed for the sake of lowering chip area. The rest of paper is organized as follows: Section introduces the representation of shift polynoial basis SPB. Based on this representation a new bit-parallel ultiplier architecture is proposed in Section 3. Section 4 presents the coparison between the proposed ultiplier and soe others. Finally the conclusions are drawn in Section 5.. Shifted polynoial basis SPB Shifted polynoial basis SPB is first introduced by H. Fan and Y. Dai [5] which is derived fro polynoial basis PB by adding a shift variable into each field eleent in order to iprove the efficiency of ultiplier. In PB representation, each eleent of GF is represented by a different binary polynoial of degree less than. More explicitly, a bit string a 1, a,...,a 1,a 0 is taken to represent binary polynoial as 1 ax a i x i a 1 x 1 + a x + + a 1 x + a 0,a i GF. Here the set M {x 1,x,...,x,1} represents a polynoial basis. The addition of bit strings corresponds to addition of binary polynoials. Multiplication is defined in ters of an irreducible binary polynoial fx of degree, called the field polynoial for the representation. The product of two eleents is siply the product of the corresponding polynoials, reduced odulo fx. Here goes the definition of SPB over GF in GF. Definition 1. See [5]. Let v be an integer and the ordered set M {x i 0 i 1} be a polynoial basis of GF over GF. The ordered set x v M : {x i+v 0 i 1} is called the shifted polynoial basis SPB with respect to M. In reality, let fx x + x k + 1 be an irreducible trinoial over GF, M {x i 0 i 1} be a PB and x v M : {x i v 0 i 1} be an SPB, where 0 v 1 and x is a root of fx 0. It has been proved that the best value of v is k or k 1 with which the ultiplier has lowest coplexities [5]. Fro now on, we denote that v equals to k and x k M : {x i k 0 i 1} is the SPB. A field eleent ax can be uniquely represented as ax a 1,a,...,a 1,a 0 x k 1 a ix i with respect to SPB. It is easy to transfor the eleents between PB and SPB representations. Let dx 1 d ix i and ax 1 v i v a v+i x i be two eleents represented in PB and SPB. The conversions between these two representations are showed by the following two forulae: 1 dx d i x i 1 v 1 v d i x i + d i x i + 1 i v 1 i v d i x v+i + x i v 1 d +i x i + d +i v x i,
3 H. Shen, Y. Jin / Inforation Processing Letters v 1 v ax a v+i x i a v+i x i i v + 1 i v 1 v a v+i x +i + x v+i a i x i + 1 i v v 1 a v +i x i + a i x i. According to the above forulae, the conversion between these two representations only needs v XOR gates and 1T X delay with parallel coputing. Multiplication on SPB is the sae as that on PB except that reduction step abides by two forulae: x i x k+i + x i, where v i v, x i x +i + x k+i, where v i v + 1. If the irreducible trinoial is fx x + x + 1 where k v,wehave: x i x i + x i, where i, x i x +i + x +i, where i Multiplier based on SPB Karatsuba ethod has been used to iprove the efficiency of bit-parallel ultiplier for GF generated by an AOP All-One Polynoial and a trinoial in [1,7,9]. This ethod can reduce the space coplexity by approxiately a factor of 3/4 because it replaces the ultiplication by three half-sized integers ultiplications. This ethod, however, will increase the tie delay which akes the decrease of space coplexity less attractive. Here, by using SPB representation, we odify the Karatsuba ethod and propose a new ultiplier architecture with significantly low space coplexity and tie delay in the fields generated by EST. Assue that ax x 1 a ix i, bx x 1 b ix i are two eleents in SPB representation. We partition ax A x + B and bx C x + D, where A C 1 1 a i x i, B b i x i, D 1 1 a i+ x i, b i+ x i. Then, we ultiply ax and bx with Karatsuba ethod and do soe transforations as follows: S ax bx A x + B C x + D AC x + BD + AC + BDx + A + BC + Dx AC x + BD x + AC x + BD + A + BC + Dx. 1 The right side of 1 can be divided into two parts: S re, which needs further reductions odulo fx and S nore, which does not need any reductions because the exponents of all eleents in S nore are located in the interval of [, 1]. These two parts are listed separately as follow: S re AC x + BD x + AC x + BD, S nore A + BC + Dx. i We consider S re in detail first. Let 1 1 AC a i x i b i x i p i x i. These p i s can be coputed as follows: ij0 a j b i j, 0 i 1, p i 1 ji +1 a j b i j, i. Siilarly, we get the coefficients q i sofbd q ix i as: q i ij0 a j+ b i j+, 0 i 1, 1 ji +1 a j+ b i j+, i. 3 According to and 3, the result of the expression AC x + BD can be coputed quickly. AC x + BD p i+, i 1, z i x i p i+ + q i, 0 i 1, 4 q i, i. Fro 4, we can find that, for i 1, z i contains i eleents, for 0 i 1, z i contains eleents and for i, z i contains 1 i eleents. Thus, circuit ipleentation of AC x + BD requires + XOR gates. The calculations of AC and BD both need
4 14 H. Shen, Y. Jin / Inforation Processing Letters Table 1 The space and tie coplexities of S re AC x + BD + AC x + BDx od fx Operation #AND #XOR Tie delay T A + log T X AC x + BD AC x + BD + AC x + BDx 1T X Total T A + log T X 4 AND gates. As a result, AC x + BD totally requires AND gates, XOR gates and the tie delay is T A + log T X. Note that S re needs to be reduced odulo fx and we partition AC x + BD into three parts naed r 1, r, r 3. AC x + BD r1 x + r + r 3 x, where r 1 1 i i z i x i+, r 1 z ix i, r 3 z i x i. Sequentially we have AC x + BD x r 1 x + r x + r3. Because the exponents of r 3 x in AC x + BD and r 1 x in AC x + BD x are beyond the range [, 1], they need to be reduced as follows: S re od fx r 1 x + r + r 3 x + r 1 x + r x + r3 od fx r 1 x + r + r 3 + r 3 x + r 1 + r 1 x + r x + r3 r 1 + r + r + r 3 x. 5 In 5, identical parts are reoved under the addition law in GF. Therefore 5 needs XOR gates and require 1T X delay. In conclusion, the generation of S re needs AND gates and + XOR gates with tie delay of T A log T X T A + log T X. The space and tie coplexity on coputing S re are suarized in Table 1. ii Here we consider S nore in detail. Because S nore A + BC + Dx needs no further reduction, it can be carried out by an -fold left shift of A+BC +D. The shift operation can be realized by a siple rewiring without any logic gates. The space and tie coplexity on coputing S nore are suarized in Table. Fro Tables 1 and, the coputations of S re and S nore have the sae tie delay so they can be calculated in parallel siultaneously. Since C S od fx S re od fx+ S nore, another XOR gates and 1T X delay should be added Table The space and tie coplexities of S nore A + BC + Dx Operation #AND #XOR Tie delay A + C,B + D 1T X A + CB + Dx 4 1 T A + log T X Total T A + log T X Table 3 Coparison of bit-parallel ultipliers when fx x + x + 1 Proposals #AND #XOR Tie delay Wu [8] T A log 1 T X Sunar [1] T A log 1 T X Iana [15] T A log T X Our proposal T A log 1 T X when coputing the final result. The total space coplexity and tie coplexity of the proposed architecture can be calculated fro Tables 1, and extra gates on adding S re and S nore together: #AND , #XOR , Tie delay T A log T X. Because is even, log log 1, the tie coplexity can be rewritten as T A log 1 T X. 4. Coparison In the fields generated by trinoials, low coplexity ultipliers ainly use polynoial basis. Table 3 gives a coparison of four different ipleentations of bit-parallel ultipliers in the class of fields generated by an equally-spaced trinoial x + x + 1 according to space coplexity and tie coplexity. Fro Table 3, the proposed ultiplier requires about 5 percent fewer circuit gates than the previous best architectures while with the sae tie coplexity of T A +1+ log 1 T X. This erit enables the pro-
5 H. Shen, Y. Jin / Inforation Processing Letters posed ultiplier to be used in space critical area such as sartcard, RFID tags, etc. 5. Conclusion In this paper, a new bit-parallel ultiplier architecture is proposed. In this architecture, SPB and Karatsuba ethod are cobined which can reduce the tie coplexity and space coplexity, respectively. This ultiplier can be used in area-critical occasion because of its low space coplexity in GF defined by EST. To find ore efficient polynoials which can use the ethod proposed in this paper should be the future work. References [1] M. Elia, M. Leone, C. Visentin, Low coplexity bit-parallel ultipliers for GF with generator polynoial x + x k + 1, Electronic Letters [] A. R-Masoleh, M.A. Hasan, A new construction of Massey Oura parallel ultiplier over GF, IEEE Transactions on Coputers [3] R. Lidl, H. Niederreiter, Introduction to Finite Fields and Their Applications, Cabridge Univ. Press, New York, [4] D.E. Knuth, The Art of Coputer Prograing, vol., Addison-Wesley, [5] H. Fan, Y. Dai, Fast bit-parallel GF n ultiplier for all trinoials, IEEE Transactions on Coputers [6] A.J. Menezes, I.F. Blake, X. Gao, R.C. Mullin, S.A. Vanstone, T. Yaghoobian, Applications of Finite Fields, Kluwer Acadeic, [7] M. Leone, A new low coplexity parallel ultiplier for a class of finite fields, in: Cryptographic Hardware and Ebedded Systes CHES 001, 001, pp [8] H. Wu, Montgoery ultiplier and squarer for a class of finite fields, IEEE Transactions on Coputers [9] K.-Y. Chang, D. Hong, H.-S. Cho, Low coplexity bit-parallel ultiplier for GF n defined by all-one polynoials using redundant representation, IEEE Transactions on Coputers [10] H. Wu, M.A. Hasan, I.F. Blake, S. Gao, Finite field ultiplier using redundant representation, IEEE Transactions on Coputers [11] Ç.K. Koç, B. Sunar, Low-coplexity bit-parallel canonical and noral basis ultipliers for a class of finite fields, IEEE Transactions on Coputers [1] B. Sunar, Ç.K. Koç, Mastrovito ultiplier for all trinoials, IEEE Transactions on Coputers [13] D. Hankerson, A. Menezes, S. Vanstone, Guide to Elliptic Curve Cryptography, Springer-Verlag, 004. [14] H. Wu, M.A. Hasan, I.F. Blake, New low-coplexity bit-parallel finite field ultipliers using weakly dual bases, IEEE Transactions on Coputers [15] J.L. Iana, J.M. Sanchez, F. Tirado, Bit-parallel finite field ultipliers for irreducible trinoials, IEEE Transactions on Coputers
Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More informationLow complexity bit-parallel GF (2 m ) multiplier for all-one polynomials
Low complexity bit-parallel GF (2 m ) multiplier for all-one polynomials Yin Li 1, Gong-liang Chen 2, and Xiao-ning Xie 1 Xinyang local taxation bureau, Henan, China. Email:yunfeiyangli@gmail.com, 2 School
More informationA new class of irreducible pentanomials for polynomial based multipliers in binary fields
Noname manuscript No. (will be inserted by the editor) A new class of irreducible pentanomials for polynomial based multipliers in binary fields Gustavo Banegas Ricardo Custódio Daniel Panario the date
More informationElliptic Curve Scalar Point Multiplication Algorithm Using Radix-4 Booth s Algorithm
Elliptic Curve Scalar Multiplication Algorith Using Radix-4 Booth s Algorith Elliptic Curve Scalar Multiplication Algorith Using Radix-4 Booth s Algorith Sangook Moon, Non-eber ABSTRACT The ain back-bone
More informationSubquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
1 Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases H. Fan and M. A. Hasan March 31, 2007 Abstract Based on a recently proposed Toeplitz
More informationPARALLEL MULTIPLICATION IN F 2
PARALLEL MULTIPLICATION IN F 2 n USING CONDENSED MATRIX REPRESENTATION Christophe Negre Équipe DALI, LP2A, Université de Perpignan avenue P Alduy, 66 000 Perpignan, France christophenegre@univ-perpfr Keywords:
More informationA 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,
More informationA new class of irreducible pentanomials for polynomial based multipliers in binary fields
Noname manuscript No. (will be inserted by the editor) A new class of irreducible pentanomials for polynomial based multipliers in binary fields Gustavo Banegas Ricardo Custódio Daniel Panario the date
More informationEfficient Filter Banks And Interpolators
Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical
More informationFPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials
FPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials C. Shu, S. Kwon and K. Gaj Abstract: The efficient design of digit-serial multipliers
More informationParallel stream cipher for secure high-speed communications
Signal Processing 82 (2002 259 265 www.elsevier.co/locate/sigpro Parallel strea cipher for secure high-speed counications Hoonjae Lee a;, Sangjae Moon b a Departent of Coputer Engineering, Kyungwoon University,
More informationMontgomery Multiplier and Squarer in GF(2 m )
Montgomery Multiplier and Squarer in GF( m ) Huapeng Wu The Centre for Applied Cryptographic Research Department of Combinatorics and Optimization University of Waterloo, Waterloo, Canada h3wu@cacrmathuwaterlooca
More informationOn Concurrent Detection of Errors in Polynomial Basis Multiplication
1 On Concurrent Detection of Errors in Polynoial Basis Multiplication Siavash Bayat-Saradi and M. Anwar Hasan Abstract The detection of errors in arithetic operations is an iportant issue. This paper discusses
More informationBSIDES multiplication, squaring is also an important
1 Bit-Parallel GF ( n ) Squarer Using Shifted Polynomial Basis Xi Xiong and Haining Fan Abstract We present explicit formulae and complexities of bit-parallel shifted polynomial basis (SPB) squarers in
More informationMastrovito Form of Non-recursive Karatsuba Multiplier for All Trinomials
1 Mastrovito Form of Non-recursive Karatsuba Multiplier for All Trinomials Yin Li, Xingpo Ma, Yu Zhang and Chuanda Qi Abstract We present a new type of bit-parallel non-recursive Karatsuba multiplier over
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationFPGA Implementation of Point Multiplication on Koblitz Curves Using Kleinian Integers
FPGA Ipleentation of Point Multiplication on Koblitz Curves Using Kleinian Integers V.S. Diitrov 1 K.U. Järvinen 2 M.J. Jacobson, Jr. 3 W.F. Chan 3 Z. Huang 1 February 28, 2012 Diitrov et al. (Univ. Calgary)
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informations = (Y Q Y P)/(X Q - X P)
Elliptic Curves and their Applications in Cryptography Preeti Shara M.Tech Student Mody University of Science and Technology, Lakshangarh Abstract This paper gives an introduction to elliptic curves. The
More informationA new type of lower bound for the largest eigenvalue of a symmetric matrix
Linear Algebra and its Applications 47 7 9 9 www.elsevier.co/locate/laa A new type of lower bound for the largest eigenvalue of a syetric atrix Piet Van Mieghe Delft University of Technology, P.O. Box
More informationEfficient Digit-Serial Normal Basis Multipliers over Binary Extension Fields
Efficient Digit-Serial Normal Basis Multipliers over Binary Extension Fields ARASH REYHANI-MASOLEH and M. ANWAR HASAN University of Waterloo In this article, two digit-serial architectures for normal basis
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationRevisiting Finite Field Multiplication Using Dickson Bases
Revisiting Finite Field Multiplication Using Dickson Bases Bijan Ansari and M. Anwar Hasan Department of Electrical and Computer Engineering University of Waterloo, Waterloo, Ontario, Canada {bansari,
More informationDivisibility of Polynomials over Finite Fields and Combinatorial Applications
Designs, Codes and Cryptography anuscript No. (will be inserted by the editor) Divisibility of Polynoials over Finite Fields and Cobinatorial Applications Daniel Panario Olga Sosnovski Brett Stevens Qiang
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationExplicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi
More informationGenetic Quantum Algorithm and its Application to Combinatorial Optimization Problem
Genetic Quantu Algorith and its Application to Cobinatorial Optiization Proble Kuk-Hyun Han Dept. of Electrical Engineering, KAIST, 373-, Kusong-dong Yusong-gu Taejon, 305-70, Republic of Korea khhan@vivaldi.kaist.ac.kr
More informationReducing the Complexity of Normal Basis Multiplication
Reducing the Complexity of Normal Basis Multiplication Ömer Eǧecioǧlu and Çetin Kaya Koç Department of Computer Science University of California Santa Barbara {omer,koc}@cs.ucsb.edu Abstract In this paper
More informationIN modern society that various systems have become more
Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto
More informationSoft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis
Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES
More informationOptimal Resource Allocation in Multicast Device-to-Device Communications Underlaying LTE Networks
1 Optial Resource Allocation in Multicast Device-to-Device Counications Underlaying LTE Networks Hadi Meshgi 1, Dongei Zhao 1 and Rong Zheng 2 1 Departent of Electrical and Coputer Engineering, McMaster
More informationOn the Design of an On-line Complex Householder Transform
On the esign of an On-line Coplex Householder Transfor Robert McIlhenny Coputer Science epartent California State University, Northridge Northridge, CA 9330 rcilhen@csunedu Milo s Ercegovac Coputer Science
More informationEstimation of ADC Nonlinearities from the Measurement in Input Voltage Intervals
Estiation of ADC Nonlinearities fro the Measureent in Input Voltage Intervals M. Godla, L. Michaeli, 3 J. Šaliga, 4 R. Palenčár,,3 Deptartent of Electronics and Multiedia Counications, FEI TU of Košice,
More informationArithmetic Unit for Complex Number Processing
Abstract Arithetic Unit or Coplex Nuber Processing Dr. Soloon Khelnik, Dr. Sergey Selyutin, Alexandr Viduetsky, Inna Doubson, Seion Khelnik This paper presents developent o a coplex nuber arithetic unit
More informationLinear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions
Linear recurrences and asyptotic behavior of exponential sus of syetric boolean functions Francis N. Castro Departent of Matheatics University of Puerto Rico, San Juan, PR 00931 francis.castro@upr.edu
More informationHigh-speed VLSI implementation of Digit-serial Gaussian normal basis Multiplication over GF(2 m )
High-speed VLSI ipleentation of igit-serial Gaussian noral basis Multiplication over GF(2 ) Bahra Rashidi, Sayed Masoud Sayedi 2, Reza Rezaeian Farashahi 3,2 ept. of Elec. & Cop. Eng., Isfahan University
More informationExponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus
ACTA ARITHMETICA XCII1 (2000) Exponential sus and the distribution of inversive congruential pseudorando nubers with prie-power odulus by Harald Niederreiter (Vienna) and Igor E Shparlinski (Sydney) 1
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationMulti-Scale/Multi-Resolution: Wavelet Transform
Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the
More informationThe Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics
ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents
More informationarxiv: v1 [cs.ds] 29 Jan 2012
A parallel approxiation algorith for ixed packing covering seidefinite progras arxiv:1201.6090v1 [cs.ds] 29 Jan 2012 Rahul Jain National U. Singapore January 28, 2012 Abstract Penghui Yao National U. Singapore
More informationA remark on a success rate model for DPA and CPA
A reark on a success rate odel for DPA and CPA A. Wieers, BSI Version 0.5 andreas.wieers@bsi.bund.de Septeber 5, 2018 Abstract The success rate is the ost coon evaluation etric for easuring the perforance
More informationHandwriting Detection Model Based on Four-Dimensional Vector Space Model
Journal of Matheatics Research; Vol. 10, No. 4; August 2018 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Handwriting Detection Model Based on Four-Diensional Vector
More informationComplexity reduction in low-delay Farrowstructure-based. filters utilizing linear-phase subfilters
Coplexity reduction in low-delay Farrowstructure-based variable fractional delay FIR filters utilizing linear-phase subfilters Air Eghbali and Håkan Johansson Linköping University Post Print N.B.: When
More informationEXPLICIT CONGRUENCES FOR EULER POLYNOMIALS
EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS Zhi-Wei Sun Departent of Matheatics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn Abstract In this paper we establish soe explicit
More informationA Division Algorithm Using Bisection Method in Residue Number System
International Journal of Coputer, Consuer and Control IJ3C), Vol., No. 03) 59 A Division Algorith Using Bisection Method in Residue Nuber Syste * Chin-Chen Chang and Jen-Ho Yang Abstract. Introduction
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationlecture 36: Linear Multistep Mehods: Zero Stability
95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,
More informationDepartment of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China
6th International Conference on Machinery, Materials, Environent, Biotechnology and Coputer (MMEBC 06) Solving Multi-Sensor Multi-Target Assignent Proble Based on Copositive Cobat Efficiency and QPSO Algorith
More informationThe simplest method for constructing APN polynomials EA-inequivalent to power functions
The siplest ethod for constructing APN polynoials EA-inequivalent to power functions Lilya Budaghyan Abstract The first APN polynoials EA-inequivalent to power functions have been constructed in [7, 8]
More informationNew upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.
New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationComparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations
International Journal of Applied Science and Technology Vol. 7, No. 3, Septeber 217 Coparison of Stability of Selected Nuerical Methods for Solving Stiff Sei- Linear Differential Equations Kwaku Darkwah
More informationUsing a De-Convolution Window for Operating Modal Analysis
Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis
More informationSymbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm
Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat
More informationEnergy-Efficient Threshold Circuits Computing Mod Functions
Energy-Efficient Threshold Circuits Coputing Mod Functions Akira Suzuki Kei Uchizawa Xiao Zhou Graduate School of Inforation Sciences, Tohoku University Araaki-aza Aoba 6-6-05, Aoba-ku, Sendai, 980-8579,
More informationMulticollision Attacks on Some Generalized Sequential Hash Functions
Multicollision Attacks on Soe Generalized Sequential Hash Functions M. Nandi David R. Cheriton School of Coputer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada 2nandi@uwaterloo.ca D.
More informationOn the Analysis of the Quantum-inspired Evolutionary Algorithm with a Single Individual
6 IEEE Congress on Evolutionary Coputation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-1, 6 On the Analysis of the Quantu-inspired Evolutionary Algorith with a Single Individual
More informationTHE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT
THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationLONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES
Journal of Marine Science and Technology, Vol 19, No 5, pp 509-513 (2011) 509 LONG-TERM PREDICTIVE VALUE INTERVAL WITH THE FUZZY TIME SERIES Ming-Tao Chou* Key words: fuzzy tie series, fuzzy forecasting,
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationA Model for the Selection of Internet Service Providers
ISSN 0146-4116, Autoatic Control and Coputer Sciences, 2008, Vol. 42, No. 5, pp. 249 254. Allerton Press, Inc., 2008. Original Russian Text I.M. Aliev, 2008, published in Avtoatika i Vychislitel naya Tekhnika,
More informationLATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS.
i LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS. C. A. CHURCH, Jr. and H. W. GOULD, W. Virginia University, Morgantown, W. V a. In this paper we give
More informationDesign of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding
IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED PAPER) 1 Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding Lai Wei, Student Meber, IEEE, David G. M. Mitchell, Meber, IEEE, Thoas
More informationAn Attack Bound for Small Multiplicative Inverse of ϕ(n) mod e with a Composed Prime Sum p + q Using Sublattice Based Techniques
Article An Attack Bound for Sall Multiplicative Inverse of ϕn) od e with a Coposed Prie Su p + q Using Sublattice Based Techniques Pratha Anuradha Kaeswari * and Labadi Jyotsna Departent of Matheatics,
More informationOn the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation
journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation
More informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationSubquadratic 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
More informationReduced Length Checking Sequences
Reduced Length Checing Sequences Robert M. Hierons 1 and Hasan Ural 2 1 Departent of Inforation Systes and Coputing, Brunel University, Middlesex, UB8 3PH, United Kingdo 2 School of Inforation echnology
More informationJitter Estimation with High Accuracy for Oscillator-Based TRNGs
Jitter Estiation with High Accuracy for Oscillator-Based TRNGs Shaofeng Zhu 1,2, Hua Chen 1, Liin Fan 1, Meihui Chen 1,2, Wei Xi 3, and Dengguo Feng 1 1 Trusted Coputing and Inforation Assurance Laboratory,
More informationThe Chebyshev Matching Transformer
/9/ The Chebyshev Matching Transforer /5 The Chebyshev Matching Transforer An alternative to Binoial (Maxially Flat) functions (and there are any such alternatives!) are Chebyshev polynoials. Pafnuty Chebyshev
More informationMath 262A Lecture Notes - Nechiporuk s Theorem
Math 6A Lecture Notes - Nechiporuk s Theore Lecturer: Sa Buss Scribe: Stefan Schneider October, 013 Nechiporuk [1] gives a ethod to derive lower bounds on forula size over the full binary basis B The lower
More informationOn Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40
On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering
More informationBernoulli numbers and generalized factorial sums
Bernoulli nubers and generalized factorial sus Paul Thoas Young Departent of Matheatics, College of Charleston Charleston, SC 29424 paul@ath.cofc.edu June 25, 2010 Abstract We prove a pair of identities
More informationSUPERIOR-ORDER CURVATURE-CORRECTED PROGRAMMABLE VOLTAGE REFERENCES
SUPEIO-ODE CUATUE-COECTED POGAMMABLE OLTAGE EFEENCES Cosin Popa e-ail: cosin@golanapubro Faculty of Electronics and Telecounications, University Politehnica of Bucharest, B dul Iuliu Maniu 1-3, Bucuresti,
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationLow-complexity, Low-memory EMS algorithm for non-binary LDPC codes
Low-coplexity, Low-eory EMS algorith for non-binary LDPC codes Adrian Voicila,David Declercq, François Verdier ETIS ENSEA/CP/CNRS MR-85 954 Cergy-Pontoise, (France) Marc Fossorier Dept. Electrical Engineering
More informationConvex Programming for Scheduling Unrelated Parallel Machines
Convex Prograing for Scheduling Unrelated Parallel Machines Yossi Azar Air Epstein Abstract We consider the classical proble of scheduling parallel unrelated achines. Each job is to be processed by exactly
More informationNBN Algorithm Introduction Computational Fundamentals. Bogdan M. Wilamoswki Auburn University. Hao Yu Auburn University
NBN Algorith Bogdan M. Wilaoswki Auburn University Hao Yu Auburn University Nicholas Cotton Auburn University. Introduction. -. Coputational Fundaentals - Definition of Basic Concepts in Neural Network
More informationBINARY extension fields GF (2 m ) are heavily used
This article has been accepte for publication in a future issue of this journal, but has not been fully eite. Content ay change prior to final publication. Citation inforation: DOI 0.09/TC.205.248408,
More informationEntangling characterization of (SWAP) 1/m and Controlled unitary gates
Entangling characterization of (SWAP) / and Controlled unitary gates S.Balakrishnan and R.Sankaranarayanan Departent of Physics, National Institute of Technology, Tiruchirappalli 65, India. We study the
More informationGeneralized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.
Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,
More informationA Quantum Observable for the Graph Isomorphism Problem
A Quantu Observable for the Graph Isoorphis Proble Mark Ettinger Los Alaos National Laboratory Peter Høyer BRICS Abstract Suppose we are given two graphs on n vertices. We define an observable in the Hilbert
More informationStructures for Interpolation, Decimation, and Nonuniform Sampling Based on Newton s Interpolation Formula
Structures for Interpolation, Deciation, and Nonunifor Sapling Based on Newton s Interpolation Forula Vesa Lehtinen, arkku Renfors To cite this version: Vesa Lehtinen, arkku Renfors. Structures for Interpolation,
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationEE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng
EE59 Spring Parallel LSI AD Algoriths Lecture I interconnect odeling ethods Zhuo Feng. Z. Feng MTU EE59 So far we ve considered only tie doain analyses We ll soon see that it is soeties preferable to odel
More informationTime-frequency plane behavioural studies of harmonic and chirp functions with fractional Fourier transform (FRFT)
Maejo International Journal of Science and Technology Full Paper ISSN 95-7873 Available online at www.ijst.ju.ac.th Tie-frequency plane behavioural studies of haronic and chirp functions with fractional
More information