scientific article
From MaRDI portal
Publication:3795599
zbMath0649.94001MaRDI QIDQ3795599
No author found.
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Conference proceedings and collections of articles (00Bxx)
Related Items (30)
Bits and relative order from residues, space efficiently ⋮ n-order direct form digital filters with integer arithmetic ⋮ Multi-periodic neural coding for adaptive information transfer ⋮ On convergence and limit cycles in digital filters in integer number systems ⋮ A parallel approach to direct analog-to-residue conversion ⋮ On the optimal utilization of all available states in the \(2^{n}\) moduli set ⋮ A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers ⋮ Modular multiplication using the core function in the residue number system ⋮ High speed residue to binary converter for the new four-moduli set \(\{2^{2n},2^n+1,2^{n/2}+1,2^{n/2}-1\}\) ⋮ Highly parallel modular multiplier for elliptic curve cryptography in residue number system ⋮ Fast and highly compact RNS multipliers ⋮ Reverse conversion using core function, CRT and mixed radix conversion ⋮ Partial-Collision Attack on the Round-Reduced Compression Function of Skein-256 ⋮ On deterministic sketching and streaming for sparse recovery and norm estimation ⋮ On Resolving Simultaneous Congruences Using Belief Propagation ⋮ Finding smooth integers in short intervals using CRT decoding ⋮ Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system ⋮ An efficient design of residue to binary converter for four moduli set \((2^{n}-1,2^n + 1,2^{2n}-2,2^{2n+1}-3)\) based on New CRT II ⋮ A generalized Fourier transform and convolution on time scales ⋮ Hierarchical residue number systems with small moduli and simple converters ⋮ 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 ⋮ Revisiting sum of residues modular multiplication ⋮ Efficient CRT-based residue-to-binary converter for the arbitrary moduli set ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code ⋮ Reverse converters for the moduli set \(\{2^n, 2^{n-1}-1,2^{n}-1, 2^{n+1}-1\}\) (\(n\) even) ⋮ Fast algorithms for erasures and error correction in redundant residue number systems ⋮ An improved algorithm for mixed-radix conversion of residue numbers ⋮ Quadruples for Residue Number Systems with Sum of Quotients a Power of a Prime ⋮ Stability of \(n\)-order state space digital filters with integer arithmetic ⋮ A fast and robust RNS algorithm for evaluating signs of determinants
This page was built for publication:
