861 search results - page 53 / 173 » Faster integer multiplication |
ISSAC
2005
Springer
14 years 2 months ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
IEICET
2008
13 years 9 months ago
2008
The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k....
ISCAS
2007
IEEE
14 years 3 months ago
2007
IEEE
—Simplified order-16 Integer Cosine Transform (ICT) has been proved to be an efficient coding tool especially for High-Definition (HD) video coding and is much simpler than ICT a...
ICMCS
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper, a fast transform method is proposed to convert MPEG-2 8-tap discrete cosine transform (DCT) coefficients to H.264/AVC 4-tap integer transform coefficients directly ...
ISCAS
2006
IEEE
14 years 3 months ago
2006
IEEE
— We propose a fast Modular Arithmetic Logic Unit (MALU) that is scalable in the digit size (d) and the field size (k). The datapath of MALU has chains of Carry Save Adders (CSA...