Results 221 to 230 of about 5,328 (242)
Some of the next articles are maybe not open access.
SPIE Proceedings, 1988
Gram-Schmidt orthogonalization of a set of vectors is carried out in a Residue Number System. Two problems usually present in RNS computations - singularity of transformations and the occurrence of isotropic vectors (i.e., nonzero vectors whose length is zero) - are properly handled.
J C. Bradley +3 more
openaire +1 more source
Gram-Schmidt orthogonalization of a set of vectors is carried out in a Residue Number System. Two problems usually present in RNS computations - singularity of transformations and the occurrence of isotropic vectors (i.e., nonzero vectors whose length is zero) - are properly handled.
J C. Bradley +3 more
openaire +1 more source
Efficient FPGA implementation of RNS Montgomery multiplication using balanced RNS bases
The Integration VLSI Journal, 2022Mohammad Esmaeildoust
exaly
RNS Number Comparator Based on a Modified Diagonal Function
Electronics (Switzerland), 2020Andrei Tchernykh +2 more
exaly
A high-speed realization of a residue to binary number system converter
IEEE Transactions on Circuits and Systems Part 2: Express Briefs, 1995S J Piestrak
exaly
Design of RNS Reverse Converters with Constant Shifting to Residue Datapath Channels
Journal of Signal Processing Systems, 2017Piotr Patronik, Stanislaw Piestrak
exaly
Twenty-Third Asilomar Conference on Signals, Systems and Computers, 1989., 1989
openaire +1 more source
openaire +1 more source
Performance of RNS-Based Orthogonal DS-COMA System with Concatenated Coding and Diversity
HKIE Transactions, 1998Lie-Liang Yang
exaly
How to Teach Residue Number System to Computer Scientists and Engineers
IEEE Transactions on Education, 2011Keivan Navi +2 more
exaly
Novel RNS Parameter Selection for Fast Modular Multiplication
IEEE Transactions on Computers, 2014Íngrid Verbauwhede +1 more
exaly
Residue to binary conversion for RNS arithmetic using only modular look-up tables
IEEE Transactions on Circuits and Systems, 1988exaly