US4035626A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Parity predict network for M-level N'th power galois arithmetic gate
Assignee: Unisys Corp
•
Filing: 1976-03-29
•
Granted: 1977-07-12
•
Expires: 1996-03-29
Abstract
Abstract A parity predict circuit for an M-level N'th power Galois arithmetic gate using binary logic elements and a method of the designing thereof is disclosed. The method involves an algorithm that the logic designer utilizes to visually analyze the output of the arithmetic gate using a heuristic technique to determine the procedure for intercoupling the outputs of the gate's 1 through m-1 levels of parity trees as inputs to the parity predict parity tree. This visual analysis obviates the laborious mathematical treatment of the arithmetic gate priorly utilized to design a parity predict network.
Inventors
- 👤 Bruce Arnold Christensen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 10:52
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F7/00; G06F7/60; G06F7/72; G06F7/724; H; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/13
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
335 words
A method of constructing a parity predict network for a two-level, N'th power, Galois multiplication gate, which multiplication gate is comprised of: a matrix array of n, X input lines x 0 , . . . x n-1 and n, Y input lines y 0 , . . . y n-1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n-1 y n-2 , x n-1 y n-1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; a plurality of first level parity trees; n, output, second level parity trees; means intercoupling said n 2 AND gates, said plurality of first level parity trees and said n, output, second level parity trees for generating as the outputs of said n, output, second level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n-1, and of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n-1 ; said method comprising: coupling the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n-1, which is the parity of the Galois input on said n, Y input lines as two separate inputs to a parity predict AND gate; coupling only the outputs of said first level parity trees that are inputs to an even number of said n, output, second level parity trees as inputs to a parity predict tree; and, coupling the output of said parity predict AND gate as an input to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 2
Independent Claim
335 words
A method of constructing a parity predict network for a two-level, N'th power, Galois multiplication gate, which multiplication gate is comprised of: a matrix array of n, X input lines x 0 , . . . x n-1 and n, Y input lines y 0 , . . . y n-1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n-1 y n-2 , x n-1 y n-1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; a plurality of first level parity trees; n, output, second level parity trees; means intercoupling said n 2 AND gates, said plurality of first level parity trees and said n, output, second level parity trees for generating as the outputs of said n, output, second level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n-1, and of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n-1 ; said method comprising: coupling the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n-1, which is the parity of the Galois input on said n, Y input lines as two separate inputs to a parity predict AND gate; coupling only the outputs of said first level parity trees that are inputs to an even number of said n, output, second level parity trees as inputs to a parity predict tree; and, coupling the output of said parity predict AND gate as an input to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 3
Dependent Claim
93 words
The method of claim 1 further including: coupling the outputs of said n, output, second level parity trees to a parity of the product parity tree for generating the parity of the product (xy).sub. p as an output therefrom; coupling the output of said parity of the product parity tree as a first input to a parity error indicator parity tree; coupling the output of said parity predict parity tree as a second input to said parity error indicator parity tree for generating the parity error indicator E p as an output therefrom.
Claim 4
Dependent Claim
331 words
A parity predict network for a two-level Galois multiplication gate that is comprised of: a matrix array of n, X input lines x 0 , . . . x n-1 and n, Y input lines y 0 , . . . y n-1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n-1 y n-2 , x n-1 y n-1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; a plurality of first level parity trees; n, output, second level parity trees; means intercoupling said n 2 AND gates, said plurality of first level parity trees and said n, output level parity trees for generating as the outputs of said n, output, second level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n-1, and of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n-1 ; said parity predict network comprising: a parity predict parity tree; a parity predict AND gate for receiving the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n-1, which is the parity of the Galois input on said n, Y input lines; means coupling the output of said parity predict AND gate as an input to said parity predict parity tree; means coupling only the outputs of said first level parity trees that are inputs to an even number of said n, output, second level parity trees as inputs to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 5
Dependent Claim
331 words
A parity predict network for a two-level Galois multiplication gate that is comprised of: a matrix array of n, X input lines x 0 , . . . x n-1 and n, Y input lines y 0 , . . . y n-1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n-1 y n-2 , x n-1 y n-1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; a plurality of first level parity trees; n, output, second level parity trees; means intercoupling said n 2 AND gates, said plurality of first level parity trees and said n, output level parity trees for generating as the outputs of said n, output, second level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n-1, and of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n-1 ; said parity predict network comprising: a parity predict parity tree; a parity predict AND gate for receiving the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n-1, which is the parity of the Galois input on said n, Y input lines; means coupling the output of said parity predict AND gate as an input to said parity predict parity tree; means coupling only the outputs of said first level parity trees that are inputs to an even number of said n, output, second level parity trees as inputs to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 6
Dependent Claim
107 words
The multiplication gate of claim 3 further including: a parity of the product parity tree; a parity error indicator parity tree; means coupling the outputs of said n, output, second level parity trees to said parity of the product parity tree for generating the parity of the product (xy).sub. p as an output therefrom; means coupling the output of said parity of the product parity tree as a first input to said parity error indicator parity tree; and, means coupling the output of said parity predict parity tree to said parity error indicator parity tree for generating the parity error indicator E p as an output therefrom.
Claim 7
Independent Claim
410 words
A method of constructing a parity predict network for a two-level, N'th power, Galois linear gate, which linear gate is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n - 1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; a plurality of first level parity trees; n, output, second level parity trees; n, Z input lines z 0 , . . . z n -1 ; means intercoupling said n 2 AND gates, said plurality of first level parity trees and said n, output, second level parity trees for generating as the outputs of said n, output, second level parity trees, the Galois linear resultant G(XY+Z)= (xy+z).sub.0, . . . (xy+z).sub.n.sub.-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; and of the Galois input on said n, Z input lines of G(Z)= z.sub.0, . . . z.sub.n.sub.-1 ; said method comprising: coupling the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines as two separate inputs to a parity predict AND gate; coupling the input Z.sub.p = z.sub.0 ⊕, . . . ⊕ z.sub.n.sub.-1, which is the parity of the Galois input on said n, Z input lines as an input to a parity predict parity tree; coupling the output of said parity predict AND gate as an input to said parity predict parity tree; and, coupling only the outputs of said first level parity trees that are inputs to an even number of said n, output, second level parity trees as inputs to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 8
Independent Claim
410 words
A method of constructing a parity predict network for a two-level, N'th power, Galois linear gate, which linear gate is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n - 1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; a plurality of first level parity trees; n, output, second level parity trees; n, Z input lines z 0 , . . . z n -1 ; means intercoupling said n 2 AND gates, said plurality of first level parity trees and said n, output, second level parity trees for generating as the outputs of said n, output, second level parity trees, the Galois linear resultant G(XY+Z)= (xy+z).sub.0, . . . (xy+z).sub.n.sub.-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; and of the Galois input on said n, Z input lines of G(Z)= z.sub.0, . . . z.sub.n.sub.-1 ; said method comprising: coupling the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines as two separate inputs to a parity predict AND gate; coupling the input Z.sub.p = z.sub.0 ⊕, . . . ⊕ z.sub.n.sub.-1, which is the parity of the Galois input on said n, Z input lines as an input to a parity predict parity tree; coupling the output of said parity predict AND gate as an input to said parity predict parity tree; and, coupling only the outputs of said first level parity trees that are inputs to an even number of said n, output, second level parity trees as inputs to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 9
Dependent Claim
93 words
The method of claim 5 further including: coupling the outputs of said n, output, second level parity trees to a parity of the product parity tree for generating the parity of the product (XY+Z) p as an output therefrom; coupling the output of said parity of the product parity tree as a first input to a parity error indicator parity tree; coupling the output of said parity predict parity tree as a second input to said parity error indicator parity tree for generating the parity error indicator E p as an output therefrom.
Claim 10
Dependent Claim
419 words
A parity predict network for a two-level, Galois linear gate that is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n -1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; a plurality of first level parity trees; n, output, second level parity trees; n, Z input lines z 0 , . . . z n -1 ; means intercoupling said n 2 AND gates, said plurality of first level parity trees and said n, output level parity trees for generating as the outputs of said n, output, second level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n.sub.-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; and of the Galois input on said n, Z input lines of G(Z)= z.sub.0, . . . z.sub.n.sub.-1 ; said parity predict network comprising: a parity predict parity tree; a parity predict AND gate for receiving the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines for generating the product of the parities x p y p as an output therefrom; means coupling the output of said parity predict AND gate as an input to said parity predict parity tree; means coupling the input Z.sub.p = z.sub.0 ⊕, . . . ⊕z.sub.n.sub.-1, which is the parity of the Galois input on said n, Z input lines as an input to said parity predict parity tree; means coupling only the outputs of said first level parity trees that are inputs to an even number of said n, output, second level parity trees as inputs to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 11
Dependent Claim
419 words
A parity predict network for a two-level, Galois linear gate that is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n -1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; a plurality of first level parity trees; n, output, second level parity trees; n, Z input lines z 0 , . . . z n -1 ; means intercoupling said n 2 AND gates, said plurality of first level parity trees and said n, output level parity trees for generating as the outputs of said n, output, second level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n.sub.-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; and of the Galois input on said n, Z input lines of G(Z)= z.sub.0, . . . z.sub.n.sub.-1 ; said parity predict network comprising: a parity predict parity tree; a parity predict AND gate for receiving the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines for generating the product of the parities x p y p as an output therefrom; means coupling the output of said parity predict AND gate as an input to said parity predict parity tree; means coupling the input Z.sub.p = z.sub.0 ⊕, . . . ⊕z.sub.n.sub.-1, which is the parity of the Galois input on said n, Z input lines as an input to said parity predict parity tree; means coupling only the outputs of said first level parity trees that are inputs to an even number of said n, output, second level parity trees as inputs to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 12
Dependent Claim
107 words
The linear gate of claim 7 further including: a parity of the product parity tree; a parity error indicator parity tree; means coupling the outputs of said n, output, second level parity trees to said parity of the product parity tree for generating the parity of the product (xy+z).sub. p as an output therefrom; means coupling the output of said parity of the product parity tree as a first input to said parity error indicator parity tree; and, means coupling the output of said parity predict parity tree to said parity error indicator parity tree for generating the parity error indicator E p as an output therefrom.
Claim 13
Independent Claim
346 words
A method of constructing a parity predict network for an M-level, N'th power, Galois multiplication gate, which multiplication gate is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n -1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; 1 through m-1 levels of parity trees; n, output, m-level parity trees; means intercoupling said n 2 AND gates, said 1 through m-1 levels of parity trees and said n, output, m-level parity trees for generating as the outputs of said n, output, m-level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n.sub.-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, and of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; said method comprising: coupling the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines as two separate inputs to a parity predict AND gate; coupling only the inputs to said 1 through m levels of parity trees that are inputs to an even number of parity trees of said 1 through m levels of parity trees as inputs to a parity predict tree; and, coupling the output of said parity predict AND gate as an input to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 14
Independent Claim
346 words
A method of constructing a parity predict network for an M-level, N'th power, Galois multiplication gate, which multiplication gate is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n -1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; 1 through m-1 levels of parity trees; n, output, m-level parity trees; means intercoupling said n 2 AND gates, said 1 through m-1 levels of parity trees and said n, output, m-level parity trees for generating as the outputs of said n, output, m-level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n.sub.-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, and of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; said method comprising: coupling the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines as two separate inputs to a parity predict AND gate; coupling only the inputs to said 1 through m levels of parity trees that are inputs to an even number of parity trees of said 1 through m levels of parity trees as inputs to a parity predict tree; and, coupling the output of said parity predict AND gate as an input to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 15
Dependent Claim
92 words
The method of claim 9 further including: coupling the outputs of said n, output, m-level parity trees to a parity of the product parity tree for generating the parity of the product (xy).sub. p as an output therefrom; coupling the output of said parity of the product parity tree as a first input to a parity error indicator parity tree; coupling the output of said parity predict parity tree as a second input to said parity error indicator parity tree for generating the parity error indicator E p as an output therefrom.
Claim 16
Dependent Claim
342 words
A parity predict network for an M-level, Galois multiplication gate that is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n -1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; 1 through m-1 levels of parity trees; n, output, m-level parity trees; means intercoupling said n 2 AND gates, said 1 through m-1 levels of parity trees and said n, output, m-level parity trees for generating as the outputs of said n, output, m-level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n.sub.-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, and of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; said parity predict network comprising: a parity predict parity tree; a parity predict AND gate for receiving the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines; means coupling the output of said parity predict AND gates an input to said parity predict parity tree; means coupling only the inputs to said 1 through m levels of parity trees that are inputs to an even number of parity trees of said 1 through m levels of parity trees as inputs to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 17
Dependent Claim
342 words
A parity predict network for an M-level, Galois multiplication gate that is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n -1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; 1 through m-1 levels of parity trees; n, output, m-level parity trees; means intercoupling said n 2 AND gates, said 1 through m-1 levels of parity trees and said n, output, m-level parity trees for generating as the outputs of said n, output, m-level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n.sub.-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, and of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; said parity predict network comprising: a parity predict parity tree; a parity predict AND gate for receiving the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines; means coupling the output of said parity predict AND gates an input to said parity predict parity tree; means coupling only the inputs to said 1 through m levels of parity trees that are inputs to an even number of parity trees of said 1 through m levels of parity trees as inputs to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 18
Dependent Claim
106 words
The multiplication gate of claim 11 further including: a parity of the product parity tree; a parity error indicator parity tree; means coupling the outputs of said n, output, m-level parity trees to said parity of the product parity tree for generating the parity of the product (xy).sub. p as an output therefrom; means coupling the output of said parity of the product parity tree as a first input to said parity error indicator parity tree; and, means coupling the output of said parity predict parity tree to said parity error indicator parity tree for generating the parity error indicator E p as an output therefrom.
Claim 19
Independent Claim
407 words
A method of constructing a parity predict network for an M-level, N'th power Galois linear gate, which linear gate is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n -1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; 1 through m-1 levels of parity trees; n, output, m-level parity trees; n, Z input lines z 0 , . . . z n -1 ; means intercoupling said n 2 AND gates and said 1 through m levels of parity trees for generating as the outputs of said n, output, m-level parity trees, the Galois linear resultant G(XY+Z)= (xy+z).sub.0, . . . (xy+z).sub.n.sub.-1, of the Galois input on said n X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; and of the Galois input on said n, Z input lines of G(Z)= z.sub.0, . . . z.sub.n.sub.-1 ; said method comprising: coupling the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines as two separate inputs to a parity predict AND gate; coupling the input Z.sub.p = z.sub.0 ⊕, . . . ⊕z.sub.n.sub.-1, which is the parity of the Galois input on said n, Z input lines as an input to a parity predict parity tree; coupling the output of said parity predict AND gate as an input to said parity predict parity tree; and, coupling only the inputs to said 1 through m levels of parity trees that are inputs to an even number of parity trees of said 1 through m levels of parity trees as inputs to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 20
Independent Claim
407 words
A method of constructing a parity predict network for an M-level, N'th power Galois linear gate, which linear gate is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n -1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; 1 through m-1 levels of parity trees; n, output, m-level parity trees; n, Z input lines z 0 , . . . z n -1 ; means intercoupling said n 2 AND gates and said 1 through m levels of parity trees for generating as the outputs of said n, output, m-level parity trees, the Galois linear resultant G(XY+Z)= (xy+z).sub.0, . . . (xy+z).sub.n.sub.-1, of the Galois input on said n X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; and of the Galois input on said n, Z input lines of G(Z)= z.sub.0, . . . z.sub.n.sub.-1 ; said method comprising: coupling the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines as two separate inputs to a parity predict AND gate; coupling the input Z.sub.p = z.sub.0 ⊕, . . . ⊕z.sub.n.sub.-1, which is the parity of the Galois input on said n, Z input lines as an input to a parity predict parity tree; coupling the output of said parity predict AND gate as an input to said parity predict parity tree; and, coupling only the inputs to said 1 through m levels of parity trees that are inputs to an even number of parity trees of said 1 through m levels of parity trees as inputs to said parity predict parity tree for generating the parity predict P p as an output therefrom.
Claim 21
Dependent Claim
92 words
The method of claim 13 further including: coupling the outputs of said n, output, m-level parity trees to a parity of the product parity tree for generating the parity of the product (XY+Z).sub. p as an output therefrom; coupling the output of said parity of the product parity tree as a first input to a parity error indicator parity tree; coupling the output of said parity predict parity tree as a second input to said parity error indicator parity tree for generating the parity error indicator E p as an output therefrom.
Claim 22
Dependent Claim
418 words
A parity predict network for an M-level, Galois linear gate that is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n -1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; 1 through m levels of parity trees; n, output, m-level parity trees; n, Z input lines z 0 , . . . z n -1 ; means intercoupling said n 2 AND gates and said 1 through m levels of parity trees for generating as the outputs of said n, output, m-level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n.sub.-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; and of the Galois input on said n, Z input lines of G(Z)= z.sub.0, . . . z.sub.n.sub.-1 ; said parity predict network comprising: a parity predict parity tree; a parity predict AND gate for receiving the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines for generating the product of the parities x p y p as an output therefrom; means coupling the output of said parity predict AND gate as an input to said parity predict parity tree; means coupling the input Z.sub.p = z.sub.0 ⊕, . . . ⊕z.sub.n.sub.-1, which is the parity of the Galois input on said n, Z input lines as an input to said parity predict parity tree; means coupling only the inputs to said 1 through m levels of parity trees that are inputs to an even number of parity trees of said 1 through m levels of parity trees as inputs to said parity predict tree for generating the parity predict P p as an output therefrom.
Claim 23
Dependent Claim
418 words
A parity predict network for an M-level, Galois linear gate that is comprised of: a matrix array of n, X input lines x 0 , . . . x n -1 and n, Y input lines y 0 , . . . y n -1 for forming the n 2 intersections x 0 y 0 , x 0 y 1 , . . . x n -1 y n -2 , x n -1 y n -1 , said matrix array including n 2 , two-input AND gates, a separate one having its two inputs coupled across the X input line and the Y input line of an associated one of said n 2 intersections; 1 through m levels of parity trees; n, output, m-level parity trees; n, Z input lines z 0 , . . . z n -1 ; means intercoupling said n 2 AND gates and said 1 through m levels of parity trees for generating as the outputs of said n, output, m-level parity trees, the Galois multiplication resultant G(XY)= (xy).sub.0, . . . (xy).sub.n.sub.-1, of the Galois input on said n, X input lines of G(X)= x.sub.0, . . . x.sub.n.sub.-1, of the Galois input on said n, Y input lines of G(Y)= y.sub.0, . . . y.sub.n.sub.-1 ; and of the Galois input on said n, Z input lines of G(Z)= z.sub.0, . . . z.sub.n.sub.-1 ; said parity predict network comprising: a parity predict parity tree; a parity predict AND gate for receiving the two inputs X.sub.p = x.sub.0 ⊕, . . . ⊕x.sub.n.sub.-1, which is the parity of the Galois input on said n, X input lines, and Y.sub.p = y.sub.0 ⊕, . . . ⊕y.sub.n.sub.-1, which is the parity of the Galois input on said n, Y input lines for generating the product of the parities x p y p as an output therefrom; means coupling the output of said parity predict AND gate as an input to said parity predict parity tree; means coupling the input Z.sub.p = z.sub.0 ⊕, . . . ⊕z.sub.n.sub.-1, which is the parity of the Galois input on said n, Z input lines as an input to said parity predict parity tree; means coupling only the inputs to said 1 through m levels of parity trees that are inputs to an even number of parity trees of said 1 through m levels of parity trees as inputs to said parity predict tree for generating the parity predict P p as an output therefrom.
Claim 24
Dependent Claim
106 words
The linear gate of claim 15 further including: a parity of the product parity tree; a parity error indicator parity tree; means coupling the outputs of said n, output, m-level parity trees to said parity of the product parity tree for generating the parity of the product (xy+z) p as an output therefrom; means coupling the output of said parity of the product parity tree as a first input to said parity error indicator parity tree; and, means coupling the output of said parity predict parity tree to said parity error indicator parity tree for generating the parity error indicator E p as an output therefrom.
References Cited (Backward Citations)
US3459927A
Cited
US3557356A
Cited
US3649817A
Cited
US3699323A
Cited
US3805037A
Cited
US3922536A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1980-07-11 | 1981-01-10 | 1981-07-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1984-07-11 | 1985-01-10 | 1985-07-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1988-07-11 | 1989-01-10 | 1989-07-12 | $7700.00 | Window Closed / Lapsed |