US 4,190,893 AGrant
Modular Modulo 3 Module
Issue Date:1980-02-26
•1 Claims
•4 Drawing Sheets
Abstract
A modular modulo 3 module is provided having a plurality of input terminals for receiving in parallel two bytes of numerical data, and a plurality of output terminals for outputting the modulo 3 residue of each byte of data individually and the modulo 3 residue of the sum of the input bytes. The modulo 3 module is implemented through a plurality of first type modules which combine logically the numerical data on individual pairs of inputs and feed in turn a logrithmic array of second type modules which combine logically to generate the modulo 3 outputs.
Metadata
Assignee
- Burroughs Corporation
Inventor
- Daniel D. Gajski
Application Information
Application Number:US 8524459
Filing Date:1977-11-17
Priority Date:1977-11-17
Art Unit:236
Classifications
IPC:
G06F 748G06F 750
Field of Search:
364340746;739347 DD
Patent Drawings (4 sheets)
Description
Cross Reference to Related Application
In copending application Ser. No. 810,186, now abandoned, for "High Speed Modulo 3 Generator Module", filed June 27, 1977 in the name of Chandrakant R. Vora, and assigned to the assignee of the present invention, there are described and claimed several embodiments of modulo 3 generator modules combined in modular fashion for binary and binary coded decimal applications. Although not limited thereto, the present modular modulo 3 module invention may be utilized in such combinations disclosed therein.
Background of the Invention
Modulo 3 generation finds application in the field of arithmetic error codes utilization and more particularly in the area of residue code generation. An arithmetic error code is a redundant representation of numbers having the property that certain errors can be detected or corrected in arithmetic operations. A residue code is a separate arithmetic code, in which the information to be used in checking, called check code, is attached to the representation of the number; that is, the number and its check code are processed separately. The check code is attached to the number, say N, is the residue modulo m of that number; that is, the remainder in the division of N by m.
Mathematically speaking, every number N can be represented as a set of two numbers, called codeword
<N, rm(N)>,
where N is any integer, and rm(N) is the remainder of N/m. Addition and multiplication of N1 and N2 are defined as follows:
and
where + and .multidot. are addition and multiplication modulo m. Furthermore, if the equations
and
are satisfied, then the sum or product of any two code words yields another codeword. This property is called code closure under addition and multiplication respectively. The error checking circuit simply checks whether the sum or product is another code word.
Consider a k-bit binary number N, wherein ##EQU1## Using Equations (3) and (4), we can find modulus of N ##EQU2## where .SIGMA. is modulo-sum symbol. Note that for all n.sub.i .epsilon.{0, 1}, r.sub.m (n.sub.i)=n.sub.i, if m>1 and n.sub.i .multidot. k=n.sub.i .multidot.k. Therefore, ##EQU3## Furthermore, using (4) for all integers i, i.gtoreq.0 ##EQU4## Thus, modulo 3 of a number can be performed by adding number of 1's and 2's in modulo 3 fashion. Therefore, modulo three is suitable for use in arithmetic error code applications.
In a high speed data processing system it is important that the residue checking operation be performed quickly so as not to incur a delay in the overall arithmetic operation. One high speed method of modulo generation involves the use of read-only memories (ROM's) wherein a ROM is "addressed" by a number and the desired modulo of that number is read out therefrom, see for example U.S. Pat. No. 3,980,874 issued Sept. 14, 1976 for "BINARY TO MODULO M TRANSLATION". However, the cost of ROM implementation for modulo translation can become rather excessive particularly for modulo translation of very large numbers. Another alternative is to design a particular modulo generator for each particular applicaion. However, the inflexability of this approach renders it less than desirable for many applications. The need exists for an inexpensive, reliable, flexible modulo generator, particularly a modulo 3 generator for residue code generation.
Objects and Summary of the Invention
It is therefore an object of the present invention to provide an modularly reliable modulo 3 module.
It is another object of the invention to provide a modular modulo 3 module which may be combined with other like modules for a variety of modulo 3 generating applications.
It is yet another object of the invention to provide a modular modulo 3 module suitable for high speed current mode logic integration techniques.
The above and other objects of the invention are realized through a modular modulo 3 module having inputs for accepting in parallel two bytes of numerical input data and a plurality of outputs for providing the modulo 3 generation of each byte of input data independently and the modulo 3 generation of the sum of the input bytes. A plurality of first type modules combine logically pairs of inputs and feed in turn a logrithmic array of second type modules which combine logically to generate the modulo 3 outputs.
The system configuration and operational details given above have been presented in simplified form. Other features of the invention will become more fully apparent in the drawings and detailed description presented hereinafter.
Brief Description of the Drawings
FIG. 1 is a block diagram of the modular modulo 3 module of the present invention;
FIG. 2 comprising FIG. 2A and FIG. 2B is a partial truth table for the module of FIG. 1;
FIG. 3 is a detailed block diagram depicting the use of a first type and a second type module to implement the modular modulo 3 module of FIG. 1;
FIG. 4 is a logic diagram of the first type module shown in FIG. 3; and
FIG. 5 is a logic diagram of the second type module shown in FIG. 3.
Detailed Description of the Preferred Embodiment
The modulo 3 generator module 11 of the present invention is fabricated in the preferred embodiment, in a single integrated circuit package, see FIG. 1. Two eight bit bytes are provided as inputs; byte A comprising inputs A.sub.0 through A.sub.7 and byte B comprising inputs B.sub.0 through B.sub.7. Six outputs are provided in three two-bit pairs; ZA comprising ZA.sub.0 and ZA.sub.1, ZB comprising ZB.sub.0 and ZB.sub.1 and AB comprising AB.sub.0 and AB.sub.1. The outputs are described as follows:
ZA=A mod 3
ZB=B mod 3
AB=A+B mod 3
Thus, the logic levels appearing at the outputs ZA, ZB, AB are defined as modulo 3 functions of the logic levels presented to the inputs A and B, see partial truth table formatted in FIGS. 2A and 2B.
Further, the modulo 3 generator 11 of the present invention comprises a plurality of first modules 13 followed by a logrithmic array of second modules 15, see FIG. 3. Each first module 13 includes a first input 17, and a second input 19, and a first through fourth outputs 21, 23, 25 and 27 respectively. Each second module 15 includes a first through eighth input 29, 31, 33, 35, 37, 39, 41 and 43 respectively, and a first through fourth output terminal 45, 47, 49 and 51 respectively.
Each first module 13 is fabricated so that when the first input 17 receives a binary variable X.sub.0 and the second input 19 receives a binary variable X.sub.1, the first output 21 outputs a binary variable Y.sub.0 wherein Y.sub.0 =X.sub.1 X.sub.0, the second output 23 outputs Y.sub.0, the third output 25 outputs Y.sub.1 wherein Y.sub.1 =X.sub.1 X.sub.0 and the fourth output 27 outputs Y.sub.1. Each first module is fabricated in the preferred embodiment from four logic gates 53, 55, 57, and 59, see FIG. 4.
Each second module 15 is fabricated so that when the first through eighth inputs 29, 31, 33, 35, 37, 39, 41 and 43 recieves respectively binary variables X.sub.0, X.sub.0, X.sub.1, X.sub.1, X.sub.2, X.sub.2, X.sub.3, and X.sub.3, the first through fourth outputs 45, 47, 49 and 51 output respectively Y.sub.0, Y.sub.0, Y.sub.1 and Y.sub.1 wherein:
Each second module 15 is fabricated in the preferred embodiment from six AND type logic gates 67, 69, 71, 77, 79 and 81, and two OR type logic gates 87 and 89, see FIG. 5.
With reference again to FIG. 3, a complete modulo 3 generator 11 is constructed from a plurality of first modules 13 followed by a logrithmic array of second modules 15. Since each first module 13 has two levels of gates and each second module 15 has two levels of gates, it is appreciated that only six (or eight) levels of gates interpose the inputs and outputs of the modulo 3 generator of FIG. 3. It is appreciated that the modulo 3 generator 11 as shown and described is modular in form in that it may be used in combination with other like modules to provide modulo 3 generation of binary (or binary coded decimals) of virtually any size. Thus, while many different embodiments of the above-described invention could be made without departing from the scope thereof, it is intended that the above-description not be taken in the limiting sense, but be interpreted as illustrative of a best mode for a particular application as developed by the invention.
Claims
What is claimed is:
1. A modular modulo 3 module having a plurality of input terminals for receiving in parallel binary coded numerical data and a plurality of output terminals for outputting the modulo 3 residue of received data, said modulo 3 module comprising: a plurality of modular first means, each first means therein having a first and a second input line for receiving data binary coded data designable X.sub.0 and X.sub.1 and a first, second, third and fourth line for individually outputting Y.sub.0, Y.sub.0, Y.sub.1 and Y.sub.1 wherein Y.sub.1 =X.sub.1 X.sub.0 and Y.sub.0 =X.sub.1 X.sub.0 ; a logrithmic array of modular second means, each second means therein having eight input lines for receiving binary coded data designable X.sub.0, X.sub.0, X.sub.1, X.sub.1, X.sub.2, X.sub.2, X.sub.3 and X.sub.3 and four output lines for individually outputting Y.sub.0, Y.sub.0, Y.sub.1 and Y.sub.1 wherein and and connecting means for connecting said plurality of input terminals of said modular modulo 3 with the inputs of said plurality of modular first means, the outputs of said plurality of modular first means with the inputs of said logrithmic array of modular second means, and the outputs of said logrithmic array of modular second means with said plurality of output terminals of said modulo 3 module.
Patent Citations (2)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3609324 | 1971-09-01 | Kieburtz | |
| US3980874 | 1976-09-01 | Vora |
Non-Patent Literature (4)
- Goldschmidt et al. "Modulo-3 Residue Tree" _IBM Tech. Disclosure Bulletin , vol. 8 No. 1 Jun. '65 pp. 29-31.
- Clapper "Determination of a Module-3 Residue" IBM Tech. Disclosure Bulletin , vol. 12 No. 7 Dec.'69 pp. 953-954.
- Banerji et al. "On Translation Algorithms in Residue No. Systems" IEEE Trans. on Computers, vol. C-21 No. 12 Dec.'72 pp. 1281-1285.
- Weinberger "Modulo-3 Residue Trees" IBM Tech. Disclosure Bulletin, vol. 19 No. 7 Dec.'76 pp. 2657-2662.