Peter Kornerup

Publications95
h-index20
Citations1,358
Highly Influential Citations88
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • D. Matula
  • 176 Publications, 4,379 Citations
  • J. Muller
  • 236 Publications, 4,509 Citations
  • T. Lang
  • 183 Publications, 4,320 Citations
  • M. Ercegovac
  • 213 Publications, 5,196 Citations
  • Publications
  • Influence
An RNS Montgomery Modular Multiplication Algorithm
TLDR
We present a new RNS modular multiplication for very large operands. Expand
  • 177
  • 11
  • PDF
Modular multiplication and base extensions in residue number systems
TLDR
We present a new RNS modular multiplication for very large operands, which is based on Montgomery's (1985) method adapted to residue arithmetic. Expand
  • 114
  • 9
  • PDF
A High Speed Hough Transform Using CORDIC
This paper applies the CORDIC algorithm to the Hough Transform. The CORDIC algorithm uses just adders and shifters to realize trigonometric function calculations, together with the multiplications… Expand
  • 22
  • 7
An Algorithm for Redundant Binary Bit-Pipelined Rational Arithmetic
TLDR
We 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 operands, using this representation. Expand
  • 34
  • 6
  • PDF
High-radix modular multiplication for cryptosystems
  • Peter Kornerup
  • Mathematics, Computer Science
  • Proceedings of IEEE 11th Symposium on Computer…
  • 29 June 1993
TLDR
Two algorithms for modular multiplication with very large moduli are analyzed specifically for their applicability when a high radix is used for the multiplier. Expand
  • 70
  • 4
  • PDF
Digit-Set Conversions: Generalizations and Application
  • Peter Kornerup
  • Mathematics, Computer Science
  • IEEE Trans. Computers
  • 1 May 1994
TLDR
The problem of digit set conversion for fixed radix is investigated for the case of converting into a non redundant, as well as into a redundant, digit set. Expand
  • 50
  • 4
Digit selection for SRT division and square root
  • Peter Kornerup
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
  • 1 March 2005
TLDR
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 representation. Expand
  • 28
  • 4
  • PDF
Msb-first Digit Serial Arithmetic 1
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.… Expand
  • 8
  • 4
Finite Precision Number Systems and Arithmetic
TLDR
We develop and compare algorithms for the fundamental operations of addition, multiplication, division, and square root with precisely defined roundings over finite precision number systems. Expand
  • 31
  • 3
  • PDF
Finite Precision Rational Arithmetic: Slash Number Systems
TLDR
Fraction number systems characterized by fixed-Slash and floating-slash formats are specified. Expand
  • 34
  • 3