Bits and relative order from residues, space efficiently
Authors:
- Paul F. DietzPDPaul F. Dietz
- Ioan I. MacarieIMIoan I. Macarie
- Joel I. SeiferasJSJoel I. Seiferas
- 1 May 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 50 (3) , 123-127
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An Efficient Algorithm and Parallel Implementations for Binary and Residue Number SystemsJournal of Symbolic Computation, 1993
- Fast Parallel Arithmetic via Modular RepresentationSIAM Journal on Computing, 1991
- Logarithmic Depth Circuits for Algebraic FunctionsSIAM Journal on Computing, 1986
- Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue DecodingIEEE Transactions on Computers, 1985
- An improved residue number system digital-to-analog converterIEEE Transactions on Circuits and Systems, 1983
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- Division and Overflow Detection in Residue Number SystemsIEEE Transactions on Electronic Computers, 1962
- Sign Detection in Nonredundant Residue SystemsIEEE Transactions on Electronic Computers, 1962
- The Residue Number SystemIEEE Transactions on Electronic Computers, 1959