A Residue-to-Binary Converter for a New Five-Moduli Set

DOI10.1109/TCSI.2007.890623MaRDI QIDQ4590190zbMATH OpenOpenAlexFDO

Authors Bin Cao, Chip-Hong Chang, Thambipillai Srikanthan

Publication date 20 November 2017

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcsi.2007.890623

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cited in

(10)

• Efficient reverse converters for 4-moduli sets \(\{2^{2n-1}-1, 2^n,2^n+1,2^n-1\}\) and \(\{2^{2n-1},2^{2n-1}-1, 2^n+1,2^n-1\}\) based on CRTs algorithm
• Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even)
• Efficient CRT-based residue-to-binary converter for the arbitrary moduli set
• Design of reverse converters for a new flexible RNS five-moduli set \(\{ 2^k, 2^n-1, 2^n+1, 2^{n+1}-1, 2^{n-1}-1 \}\) (\(n\) even)
• Designing efficient two-level reverse converters for moduli set \(\{2^{2n+1}-1,2^{2n},2^{n}-1\}\)
• Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
• Highly parallel modular multiplier for elliptic curve cryptography in residue number system
• scientific article; zbMATH DE number 1051286 (Why is no real title available?)
• Reference Points Based RNS Reverse Conversion for General Moduli Sets
• Hierarchical residue number systems with small moduli and simple converters

This page was built for publication: A Residue-to-Binary Converter for a New Five-Moduli Set

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