The following pages link to (Q2773752):
Displaying 20 items.
- Formal proof of integer adders using all-prefix-sums operation (Q362271) (← links)
- Efficient CRT-based residue-to-binary converter for the arbitrary moduli set (Q543164) (← links)
- Formal proof of prefix adders (Q611751) (← links)
- Efficient realization of large size two's complement multipliers using embedded blocks in FPGAs (Q733691) (← links)
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques (Q870135) (← links)
- Fast modular multi-exponentiation using modified complex arithmetic (Q884549) (← links)
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation (Q1007833) (← links)
- Precise numerical computation (Q1779570) (← links)
- Regular numeral systems for data structures (Q2139186) (← links)
- Incremental column-wise verification of arithmetic circuits using computer algebra (Q2225473) (← links)
- Constant-time sorting (Q2252525) (← links)
- Functional verification of high performance adders in \textsc{Coq} (Q2336214) (← links)
- An efficient universal addition scheme for all hybrid-redundant representations with weighted bit-set encoding (Q2432112) (← links)
- Reciprocal and reciprocal square root units with operand modification and multiplication (Q2432144) (← links)
- An efficient parity detection technique using the two-moduli set \(\{2^{h} - 1, 2^{h} + 1\}\) (Q2509242) (← links)
- An optimized quantum circuit for converting from sign-magnitude to two's complement (Q2681011) (← links)
- An improved Chen's parity detection technique for the two-moduli set (Q2995490) (← links)
- NOVEL QUANTUM COMPRESSOR DESIGNS USING NEW GENETIC ALGORITHM-BASED SIMULATOR, ANALYZER AND SYNTHESIZER SOFTWARE IN NANOTECHNOLOGY (Q3083654) (← links)
- Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem (Q3174867) (← links)
- Rethinking arithmetic for deep neural networks (Q4993501) (← links)
