On the optimal utilization of all available states in the 2ⁿ moduli set

DOI10.1016/S0020-0190(00)00077-6MaRDI QIDQ294795zbMATH OpenOpenAlexFDO

Authors A. B. Premkumar

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019000000776?np=y

zbMATH Keywords

computational complexityparallel processingresidue number systemreverse converters

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Reverse converters for a new moduli set \(\{2^{2n} - 1, 2^{n}, 2^{2n} + 1\}\)
• 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)
• Efficient reverse converter design for five moduli set \(\{2^n,2^{2n+1}-1,2^{n/2}-1,2^{n/2}+1,2^n+1\}\)
• 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)

Cites work

• scientific article; zbMATH DE number 4061135 (Why is no real title available?)
• scientific article; zbMATH DE number 3269473 (Why is no real title available?)
• An efficient residue to binary converter design
• Efficient VLSI networks for converting an integer from binary system to residue number system and vice versa
• Fast and flexible architectures for RNS arithmetic decoding
• Fast conversion techniques for binary-residue number systems

Cited in

(1)

• Finding Matching Initial States for Equivalent NLFSRs in the Fibonacci and the Galois Configurations

This page was built for publication: On the optimal utilization of all available states in the \(2^{n}\) moduli set

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