Pages that link to "Item:Q689112"
From MaRDI portal
The following pages link to An efficient algorithm and parallel implementations for binary and residue number systems (Q689112):
Displaying 12 items.
- Efficient CRT-based residue-to-binary converter for the arbitrary moduli set (Q543164) (← links)
- An improved algorithm for mixed-radix conversion of residue numbers (Q803204) (← links)
- Floating-point numbers in residue number systems (Q1192180) (← links)
- A fully parallel algorithm for residue to binary conversion (Q1321825) (← links)
- Bits and relative order from residues, space efficiently (Q1327295) (← links)
- Parallel computational algorithms for generalized Chinese remainder theorem. (Q1427328) (← links)
- Novel high-radix residue number system architectures (Q2732958) (← links)
- A modular approach to the computation of convolution sum using distributed arithmetic principles (Q2733032) (← links)
- Comments on ``an arithmetic free parallel mixed-radix conversion algorithm'' (Q2733062) (← links)
- (Q3429637) (← links)
- Beyond-Binary Arithmetic: Algorithms and VLSI Implementations. (Q4498369) (← links)
- Quadruples for Residue Number Systems with Sum of Quotients a Power of a Prime (Q5868046) (← links)