Filters








435,284 Hits in 5.2 sec

Polynomial circuit models for component matching in high-level synthesis

J. Smith, G. De Micheli
2001 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
Furthermore, we derive a means of approximating the functionality of nonpolynomial functions and determining a bound on the error of this approximation.  ...  These methods have been implemented in the POLYSYS synthesis tool and used to synthesize a JPEG encode block and infinite impulse response filter from a library of complex elements.  ...  To illustrate the application of the polynomial methods developed in this article, we map a JPEG encode specification to complex elements and compare the specification of a filter suitable for controlling  ... 
doi:10.1109/92.974892 fatcat:br37ddwxhrccha5lpzhexbzzyy

A Constructive Approach for Finding Arbitrary Roots of Polynomials by Neural Networks

D.-S. Huang
2004 IEEE Transactions on Neural Networks  
Moreover, the root moment method (RMM) is also simplified into a recursive version so that the computational complexity can be further decreased, which leads the roots of those higher order polynomials  ...  (CLA), which encodes the a priori information of constraint relations between root moments and coefficients of a polynomial into the usual BP algorithm (BPA).  ...  the constrained relations or additional information implicit in a given polynomial so that a specific CLA can be constructed to find the arbitrary roots of polynomials. 1) The Constrained Relation Between  ... 
doi:10.1109/tnn.2004.824424 pmid:15384540 fatcat:44ted6ds2fgr7eva3v2gbtagvm

Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination

Murat Cenk, M. Anwar Hasan, Christophe Negre
2014 IEEE transactions on computers  
We propose optimized three and four-way split formulas which reduce the space and time complexity of the best known methods.  ...  Moreover, we present a block recombination method which provides some further reduction in the space complexity of the considered two, three and four-way split multipliers.  ...  For the complexity of the R function: it is equal to the complexity of the multiplier minus the complexity of two CP F s and one CM .  ... 
doi:10.1109/tc.2013.105 fatcat:rbmr4ixxefbzdasjoaxbggsnhe

Robust stability: The computational complexity point of view

R Tempo, V Cerone
1992 Journal of Complexity  
The main task of robust stability is to detect if all the roots of p(s, q) are contained in a given region 28 of the complex plane for all q E Q.  ...  (multiplications/divisions and additions/subtractions) required for the solution of this problem is at most O(n*).  ...  ACKNOWLEDGMENTS This work was partially supported by funds of CENS-CNR of Italy and by the Italian "Ministero dell' Universita e della Ricerca Scientifica" (MURST), under the plan "Fondi per la Ricerca  ... 
doi:10.1016/0885-064x(92)90026-8 fatcat:uxwllkof4zgfpjsgkosv6qxfh4

Construction of pseudorandom binary sequences using additive characters over GF(2 k ) II

János Folláth
2010 Periodica Mathematica Hungarica  
Throughout this paper the structure of a family of binary sequences based on GF(2 k ) will be studied.  ...  In later papers the structure of families of binary sequences was also studied. In these constructions fields with prime order were used.  ...  The f-complexity Γ(F ) of a family F of binary sequences E N ∈ {−1, +1} N is defined as the greatest integer j so that for any specification of length j there is at least one E N ∈ F which satisfies it  ... 
doi:10.1007/s10998-010-2127-y fatcat:i5fmmiwbcjg7vnqt26pnjr4s3m

Stability testing of 2-D discrete linear systems by telepolation of an immittance-type tabular test

Y. Bistritz
2001 IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications  
"2-D table") and requires the testing of only one last one dimensional (1-D) symmetric polynomial of degree 2 1 2 for no zeros on the unit circle.  ...  2 + 1 polynomials in the complex cases).  ...  Algorithm 2 can test a complex polynomial of degree in real multiplications, and real additions.  ... 
doi:10.1109/81.933325 fatcat:2otp5ok45nalpm3zng4s5dvram

Speeding-up Ideal Lattice-Based Key Exchange Using a RSA/ECC Coprocessor [article]

Aurélien Greuet, Simon Montoya, Guénaël Renault
2020 IACR Cryptology ePrint Archive  
The efficiency of these algorithms depends on the component specifications and the cryptosystem parameters set.  ...  Polynomial multiplication is one of the most costly operations of ideal lattice-based cryptosystems. In this work, we study its optimization when one of the operand has coefficients close to 0.  ...  To choose the most efficient algorithm for polynomial multiplication we need to compare the three following complexities, depending on the component specification. • Shift&Add: E(n) + n(S(n , ) + δ 2 A  ... 
dblp:journals/iacr/GreuetMR20a fatcat:ok6zcuwppbagroa5mn5xcdmylq

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

M. J. Bremner, R. Jozsa, D. J. Shepherd
2010 Proceedings of the Royal Society A  
tower of classical complexity classes known as the polynomial hierarchy, would collapse to its third level.  ...  More specifically we introduce the class post-IQP of languages decided with bounded error by uniform families of IQP circuits with post-selection, and prove first that post-IQP equals the classical class  ...  infinite tower of complexity classes known as the polynomial hierarchy (PH), would collapse to its third level (see theorem 2 and corollary 1 in [1] ).  ... 
doi:10.1098/rspa.2010.0301 fatcat:sxoem3tnevhdze75exo6wdak2a

Polynomial methods for component matching and verification

James Smith, Giovanni De Micheli
1998 Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design - ICCAD '98  
If a common structure is used to represent components that are described at multiple levels of abstraction, comparisons between circuit specifications and a library of potential implementations can be  ...  Polynomials can be used to represent circuits that are described at the bit level or arithmetically.  ...  of F(x) by one, (x) = F(x+1) -F(x) -1 is a less complex way to reduce the order of F(x) by one.  ... 
doi:10.1145/288548.289115 dblp:conf/iccad/SmithM98 fatcat:e23rrlbifbhyxci56s4iv7pzka

Optimal Sharpening of Compensated Comb Decimation Filters: Analysis and Design

David Ernesto Troncoso Romero, Massimiliano Laddomada, Gordana Jovanovic Dolecek
2014 The Scientific World Journal  
Using a simple three-addition compensator and an optimization-based derivation of sharpening polynomials, we introduce an effective low-complexity filtering scheme.  ...  Design examples are presented in order to show the performance improvement in terms of passband distortion and selectivity compared to other methods based on the traditional Kaiser-Hamming sharpening and  ...  The reason is that the increased complexity in the sharpened compensated comb structures amounts to only 3 extra additions per polynomial degree (when the compensator from [11] is used), and these additions  ... 
doi:10.1155/2014/950860 pmid:24578674 pmcid:PMC3919003 fatcat:t3znozpaqjbcnmqe7cgcsvucjm

Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications [chapter]

Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung
2011 Lecture Notes in Computer Science  
It further exploits a "round table" communication paradigm to reduce the complexity in the number of parties.  ...  We achieve a solution that both, takes advantage of the algebraic structure of the polynomials, and is polynomial-time in all parameters (security parameter, polynomial size, polynomial degree, number  ...  Using the LIPEV protocol, a prover can prove to a verifier that A encrypted points lie on one polynomial of degree d, provided that the randomness for the encryptions was chosen in a specific way; namely  ... 
doi:10.1007/978-3-642-21554-4_8 fatcat:p4ergh7g7fhclbg6iuqjymyxom

PAnTHErS: A Prototyping and Analysis Tool for Homomorphic Encryption Schemes

Cyrielle Feron, Vianney Lapotre, Loïc Lagadec
2017 Proceedings of the 14th International Joint Conference on e-Business and Telecommunications  
This paper introduces PAnTHErS, a Prototyping and Analysis Tool for Homomorphic Encryption Schemes that alleviates the need for implementation to estimate the performances of any new HE scheme.  ...  Still, HE is not yet usable in real cases due to complexity issues.  ...  Additional analyses show that the impact of t on computational complexity is non-existent.  ... 
doi:10.5220/0006464703590366 dblp:conf/secrypt/FeronLL17 fatcat:d2yhhfsb6za3lps6cgkv24k6fa

Complex library mapping for embedded software using symbolic algebra

Armita Peymandoust, Giovanni De Micheli, Tajana Simunic
2002 Proceedings - Design Automation Conference  
This paper presents a methodology that maps algorithmic constructs of the software specification to a library of complex software elements.  ...  We implemented and measured the performance and energy consumption of the MP3 decoder software on Badge4 running embedded Linux operating system.  ...  Yung-Hsiang Lu for his help with the data acquisition.  ... 
doi:10.1145/514001.514003 fatcat:ovfusiobbfgdzcnj4mgvcalnsq

Complex library mapping for embedded software using symbolic algebra

A. Peymandoust, T. Simunic, G. De Micheli
2002 Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324)  
This paper presents a methodology that maps algorithmic constructs of the software specification to a library of complex software elements.  ...  We implemented and measured the performance and energy consumption of the MP3 decoder software on Badge4 running embedded Linux operating system.  ...  Yung-Hsiang Lu for his help with the data acquisition.  ... 
doi:10.1109/dac.2002.1012644 fatcat:x32aknjqjnhmldrpiuovcwvjvu

Complex library mapping for embedded software using symbolic algebra

Armita Peymandoust, Giovanni De Micheli, Tajana Simunic
2002 Proceedings - Design Automation Conference  
This paper presents a methodology that maps algorithmic constructs of the software specification to a library of complex software elements.  ...  We implemented and measured the performance and energy consumption of the MP3 decoder software on Badge4 running embedded Linux operating system.  ...  Yung-Hsiang Lu for his help with the data acquisition.  ... 
doi:10.1145/513918.514003 dblp:conf/dac/PeymandoustMS02 fatcat:wwtdepi5lrgrjbfghouzfo5czm
« Previous Showing results 1 — 15 out of 435,284 results