A fully parallel algorithm for residue to binary conversion

DOI10.1016/0020-0190(94)90036-1zbMath0803.68056OpenAlexW2011035845WikidataQ126815291 ScholiaQ126815291MaRDI QIDQ1321825

Ferruccio Barsi, Maria Cristina Pinotti

Publication date: 3 May 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90036-1

zbMATH Keywords

parallel algorithmsVLSI architecturesChinese remainder theoremresidue number systemcomputer arithmeticsVLSI complexityRNS to binary conversion

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Congruences; primitive roots; residue systems (11A07) Distributed algorithms (68W15)

Related Items (1)

Addendum to ``A fully parallel algorithm for residue to binary conversion

Cites Work

• Unnamed Item
• Mod \(m\) arithmetic in binary systems
• Area—Time optimal VLSI integer multiplier with minimum computation time
• Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
• Efficient VLSI networks for converting an integer from binary system to residue number system and vice versa
• A Regular Layout for Parallel Adders
• Fast and flexible architectures for RNS arithmetic decoding
• Majority Gate Networks

This page was built for publication: A fully parallel algorithm for residue to binary conversion