Registers – Transfer mechanism – Traveling pawl
Patent
1975-05-09
1976-09-14
Malzahn, David H.
Registers
Transfer mechanism
Traveling pawl
340347DD, G06F 7385, H03K 1324
Patent
active
039808742
ABSTRACT:
Modulo M translation is performed on a large binary number of n bits by grouping the binary number in contiguous sets of approximately K bits each, storing the modulo M residues for each K bit set in an individually associated pre-stored ROM, reading the modulo M residues for a particular K bit segment of a binary number out of the ROMs, and performing modulo M addition on the read-out residues. Thus, modulo M translation of a positive number is accomplished in n/k modulo M additions and a table look-up, with the look-up table being stored in n/k ROMs. A subsequent modulo M subtraction is performed if the binary number is negative.
REFERENCES:
patent: 3316393 (1967-04-01), Ruthazer
patent: 3863248 (1975-01-01), Deschenes et al.
patent: 3882483 (1975-05-01), Burke et al.
L. Y. Liu et al., "Residue Generation of Binary Nos. in 2's Comp. Form" IBM Tech. Disclosure Bulletin, vol. 9, No. 2, July 1966, pp.158-159.
B. E. Bliss, "Table Lookup REsidue Adder" IBM Tech. Disclosure Bulletin, vol. 11, No. 8, Jan. 1969, pp. 1017-1018.
D. K. Banerji et al., "On Translation Algorithms in Residue No. Systems," IEEE Trans. on Computers, vol. c-21, No. 12, Dec. '72, pp. 1281-1285.
D. K. Banerji, "A Novel Implementation Method For Add. & Subt. in Residue No. Systems" IEEE Trans-on Computers, Jan. 1974, pp. 106-109.
Brenner Leonard C.
Burroughs Corporation
Feeney, Jr. Edward J.
Malzahn David H.
Peterson Kevin R.
LandOfFree
Binary to modulo M translation does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Binary to modulo M translation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary to modulo M translation will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1028091