#### Filter Results:

- Full text PDF available (30)

#### Publication Year

1974

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup
- IEEE Symposium on Computer Arithmetic
- 2001

We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery’s method adapted to residue arithmetic. By choosing the moduli of the RNS system reasonably… (More)

- Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup
- IEEE Trans. Computers
- 1998

We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery’s method adapted to mixed radix, and is performed using a Residue Number System. By choosing… (More)

- Feng Zhou, Peter Kornerup
- 1995

This paper applies the CORDIC algorithm to the Hough Transform, which is widely used in image processing and recognition. The CORDIC algorithm uses adders and shifters to easily realize the… (More)

- Peter Kornerup, David W. Matula
- IEEE Trans. Computers
- 1990

AbsfmctWe introduce a redundant binary representation of the rationals and an associated algorithm for computing the sum, difference, product, quotient, and other useful functions of two rational… (More)

- Peter Kornerup
- IEEE Symposium on Computer Arithmetic
- 1993

Two algorithms for modular multiplication with very large moduli are analyzed, in particular for their applicability when a high radix is used for the multiplier. Both algorithms perform modulo… (More)

We develop a formal account of digit serial number representations by describing them as strings from a language. A preex of a string represents an interval approximating a number by enclosure.… (More)

- Peter Kornerup
- IEEE Symposium on Computer Arithmetic
- 1999

This note presents necessary and sufficient conditions for parallel and constant time conversions from one digit-set into another, and thus also for constant time addition. In the integer domain it… (More)

- Gerd Bohlender, Wolfgang Walter, Peter Kornerup, David W. Matula
- IEEE Symposium on Computer Arithmetic
- 1991

Semantics are given for the four elementary arithmetic operations and the square root, to characterize what we term exact floating point operations. The operands of the arithmetic operations and the… (More)

- Peter Kornerup
- IEEE Transactions on Computers
- 2005

The quotient digit selection in the SRT division algorithm is based on a few most significant bits of the remainder and divisor, where the remainder is usually represented in a redundant… (More)