A theorem of fixed-point machine arithmetic in redundant binary quasicanonical number system

DOI10.1007/BF01068569MaRDI QIDQ3694699zbMATH OpenFDO

Authors G. M. Luts'Kij, O. I. Penchev

Publication date 1983

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01068569

zbMATH Keywords

digital feedbackexecution efficiency of complex arithmetic operationsnonautonomous operating moderedundant number systems

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Recurrences (11B37) Theory of computing (68Q99)

Recommendations

• Standard representations of real numbers
• Recursive minimally redundant interval-modular number systems
• scientific article; zbMATH DE number 1231646
• An application of control-theoretic methods to digital arithmetic algorithms
• scientific article; zbMATH DE number 3992805

Cites work

• A General Hardware-Oriented Method for Evaluation of Functions and Computations in a Digital Computer
• Higher-Radix Division Using Estimates of the Divisor and Partial Remainders
• scientific article; zbMATH DE number 3748390 (Why is no real title available?)
• On-Line Algorithms for Division and Multiplication
• Radix-16 Evaluation of Certain Elementary Functions
• The Status of Investigations into Computer Hardware Design Based on the Use of Continued Fractions

Cited in

(1)

• An application of control-theoretic methods to digital arithmetic algorithms

This page was built for publication: A theorem of fixed-point machine arithmetic in redundant binary quasicanonical number system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694699)