A parallel residue-to-binary conversion algorithm without trial division

DOI10.1016/J.COMPELECENG.2006.01.024zbMATH Open1110.68162OpenAlexW2071051992MaRDI QIDQ861245FDOQ861245

Authors: Chin-Chen Chang, Yeu-Pong Lai 

Publication date: 9 January 2007

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compeleceng.2006.01.024

Recommendations

• A fully parallel algorithm for residue to binary conversion
• An improved residue-to-binary converter
• A new efficient memoryless residue to binary converter
• Residue-to-binary converters based on new Chinese Remainder Theorems
• An efficient residue to binary converter design

zbMATH Keywords

Euclidean algorithmresidue number systemChinese remainder theoremMontgomery algorithmdivision-free

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Number-theoretic algorithms; complexity (11Y16)

Cited In (8)

• A new efficient memoryless residue to binary converter
• Parallel computational algorithms for generalized Chinese remainder theorem.
• A parallel approach to direct analog-to-residue conversion
• Simultaneous conversions with the residue number system using linear algebra
• Title not available (Why is that?)
• A fully parallel algorithm for residue to binary conversion
• Residue-to-binary converters based on new Chinese Remainder Theorems
• Title not available (Why is that?)

This page was built for publication: A parallel residue-to-binary conversion algorithm without trial division

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