scientific article
From MaRDI portal
Publication:2773752
zbMath0994.68186MaRDI QIDQ2773752
Publication date: 27 February 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Nonnumerical algorithms (68W05) Mathematical problems of computer architecture (68M07)
Related Items (25)
Regular numeral systems for data structures ⋮ Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem ⋮ An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques ⋮ Formal proof of integer adders using all-prefix-sums operation ⋮ Fast modular multi-exponentiation using modified complex arithmetic ⋮ Formal proof of prefix adders ⋮ An optimized quantum circuit for converting from sign-magnitude to two's complement ⋮ On the Possibility of Increasing the Accuracy of Computations in the Floating-Point Format with Multiple Exponents ⋮ Balanced non-adjacent forms ⋮ An efficient universal addition scheme for all hybrid-redundant representations with weighted bit-set encoding ⋮ Reciprocal and reciprocal square root units with operand modification and multiplication ⋮ Incremental column-wise verification of arithmetic circuits using computer algebra ⋮ An improved Chen's parity detection technique for the two-moduli set ⋮ GenMul: Generating Architecturally Complex Multipliers to Challenge Formal Verification Tools ⋮ Constant-time sorting ⋮ Efficient CRT-based residue-to-binary converter for the arbitrary moduli set ⋮ Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques ⋮ Precise numerical computation ⋮ An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\) ⋮ Efficient realization of large size two's complement multipliers using embedded blocks in FPGAs ⋮ An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation ⋮ NOVEL QUANTUM COMPRESSOR DESIGNS USING NEW GENETIC ALGORITHM-BASED SIMULATOR, ANALYZER AND SYNTHESIZER SOFTWARE IN NANOTECHNOLOGY ⋮ Fast exponentiation by folding the signed-digit exponent in half ⋮ Rethinking arithmetic for deep neural networks ⋮ Functional verification of high performance adders in \textsc{Coq}
This page was built for publication:
