Binary Logic for Residue Arithmetic Using Magnitude Index

DOI10.1109/T-C.1970.223026MaRDI QIDQ5597995zbMATH OpenFDO

Authors

Publication date 1970

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/T-C.1970.223026

zbMATH Keywords

computer science and automata

Cited in

(5)

• Arithmetic codes resembling neural encoding
• Error codes in residue number systems with magnitude index
• Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system
• An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code
• An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications

This page was built for publication: Binary Logic for Residue Arithmetic Using Magnitude Index

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