scientific article; zbMATH DE number 5360581
From MaRDI portal
Publication:3534151
zbMATH Open1168.68610MaRDI QIDQ3534151FDOQ3534151
Authors: Amir Sabbagh Molahosseini, Keivan Navi 
Publication date: 3 November 2008
Title of this publication is not available (Why is that?)
Recommendations
- Residue-to-binary converters based on new Chinese Remainder Theorems
- A new efficient memoryless residue to binary converter
- Fast conversion techniques for binary-residue number systems
- An efficient residue to binary converter design
- Comments on ``Residue-to-binary converters based on new Chinese remainder theorems.
- Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
- Residue-to-binary number converters for three moduli sets
- A fully parallel algorithm for residue to binary conversion
- An improved algorithm for mixed-radix conversion of residue numbers
- A parallel residue-to-binary conversion algorithm without trial division
Cited In (17)
- An efficient residue to binary converter design
- Comments on ``The digit parallel method for fast RNS to weighted number system conversion for specific moduli \((2^k -1, 2^k, 2^k +1)\)
- Novel high-radix residue number system architectures
- An efficient algorithm and parallel implementations for binary and residue number systems
- An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications
- High speed residue to binary converter for the new four-moduli set \(\{2^{2n},2^n+1,2^{n/2}+1,2^{n/2}-1\}\)
- Residue number systems. Theory and implementation.
- Methodology for basic selection in recursive residue number system
- Residue-to-binary number converters for three moduli sets
- A fully parallel algorithm for residue to binary conversion
- A new high dynamic range moduli set with efficient reverse converter
- A high-speed residue-to-binary converter for three-moduli \((2^k, 2^k -1, 2^{k-1} -1)\) RNS and a scheme for its VLSI implementation
- Mod \(m\) arithmetic in binary systems
- Moduli selection guidelines for efficient residue-to-decimal conversion
- New adder-based RNS-to-binary converters for the \(\{2^{n+1} + 1, 2^{n+1} - 1, 2^{n}\}\) moduli set
- Floating-point numbers in residue number systems
- Novel RNS structures for the moduli set \((2^{n}-1, 2^{n}, 2^{n}+1)\) and their application to digital filter implementation
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 Q3534151)
