scientific article; zbMATH DE number 3992805
From MaRDI portal
Publication:4720683
Recommendations
Cited in
(18)- Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis
- Fast one's-complement multiplication
- Computer arithmetic of complex numbers
- On the number of iterations required by von Neumann addition
- Computer arithmetic algorithms.
- Multiple-base number system. Theory and applications.
- Finite precision number systems and arithmetic
- scientific article; zbMATH DE number 3874496 (Why is no real title available?)
- On the problem of the choice of the radix
- A theorem of fixed-point machine arithmetic in redundant binary quasicanonical number system
- scientific article; zbMATH DE number 3938520 (Why is no real title available?)
- scientific article; zbMATH DE number 3749094 (Why is no real title available?)
- scientific article; zbMATH DE number 605662 (Why is no real title available?)
- scientific article; zbMATH DE number 1567935 (Why is no real title available?)
- Arithmetic and Logic in Computer Systems
- Complex binary number system. Algorithms and circuits
- Iterative Arrays ror Radix Conversion
- Arithmetic Algorithms in a Negative Base
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4720683)