1. A method for Galois field (GF(2m)) multiplication by a logic circuit, where m is a positive integer, and the GF(2m) multiplication operation calculates the multiplication of two polynomials producing a product which is divided by a generator polynomial, and wherein the multiplication of the two polynomials is combined with the division operation whereby the GF(2m) multiplication is computed as a single function GF(2m) multiplication operation, the method comprising:
generating xm\u2212i polynomial coefficient terms from multiplication and division mathematical operations, where i is a variable;
combining xm\u2212i polynomial coefficient terms having the same exponents from the multiplication and division mathematical operations to generate a recurrence relation that represents the combination of the multiplication and division operations;
computing the recurrence relation using the combined xm\u2212i polynomial coefficient terms in the single function GF(2m) multiplication operation to produce a GF(2m) result; and
storing the GF(2m) result in memory in a computer readable form.
2. The method of claim 1 wherein the recurrence relation for the single GF(2m) multiplication function is Y(i)=Y(i\u22121)+(qm\u2212i*p+Y(i\u22121)2m\u2212i*g)*xm\u2212i, i=1, 2, . . . , m and where Y(0)=0, Y(i=m) is the GF(2m) result, p and q are coefficients of input polynomials px and qx, respectively, and g is the coefficients of a generator polynomial gx.
3. The method of claim 1 further comprising:
computing the recurrence relation for a single GF(2m) multiplication function as Y(i) Y(i\u22121)+(qm\u2212i*p+Y(i\u22121)2m\u22121*g Y(i\u22121)m\u22121*g)*xm\u2212i, i=1, 2, . . . , m and where Y(0)=0, Y(i=m) is the GF(2m) result, p and q are coefficients of input polynomials px and qx, respectively, and g is the coefficients of a generator polynomial gx in an m by m single function computation array utilizing m bits per internal calculation stage.
4. A method for Galois field (GF(2m)) multiplication by a logic circuit, where m is a positive integer, and the GF(2m) multiplication operation calculates the multiplication of two polynomials producing a product which is divided by a generator polynomial, and wherein the multiplication of the two polynomials is combined with the division operation whereby the GF(2m) multiplication is computed as a single function GF(2m) multiplication operation, the method comprising:
generating xm\u2212i polynomial coefficient terms from multiplication and division mathematical operations, where i is a variable;
combining xm\u2212i polynomial coefficient terms having the same exponents from the multiplication and division mathematical operations to generate a recurrence relation that represents the combination of the multiplication and division operations;
computing the recurrence relation using the combined xm\u2212i polynomial coefficient terms in the single function GF(2m) multiplication operation thereby calculating m by m bits for the GF(2m) multiplication function to produce an m bit GF(2m) result; and
storing the m bit GF(2m) result in memory in a computer readable form.
5. The method claim 4 wherein the recurrence relation for the single GF(2m) multiplication function is Y(i)=Y(i\u22121)+(qm\u2212i*p+Y(i\u22121)m\u22121*g)*xm\u22121, i=1, 2, . . . , m and where Y(0)=0, Y(i=m) is the m bit GF(2m) result, p and q are coefficients of input polynomials px and qx, respectively, and g is the coefficients of a generator polynomial gx.
6. The method of claim 4 wherein the step of computing the recurrence relation is accomplished in an m by m single function computation logic array utilizing m bits per internal logic stage.
7. A GF multiplication circuit cell producing result Y(i)j for i\u03b5{1, 2, . . . , m}, j\u03b5{0, 1, . . . , m\u22121}, where m is a positive integer, and a selected i and j value comprising:
a bit qm\u2212i selected from the set {qm\u22121, qm\u22122, . . . , qm\u2212i, . . . q0} of first product inputs based on the selected i value;
a bit pj selected from the set {pm\u22121, pm\u22122, . . . , pj, . . . , p0}of second product inputs based on the selected j value;
a bit gj selected from the set {gm\u22121, gm\u22122, . . . , gj, . . . , g0} of generator polynomial coefficients based on the selected j value;
a most significant bit Y(i\u22121)m\u22121 of a previous stage of GF multiplication circuit cells results;
a value of the rightmost neighbor bit Y(i\u22121)j\u22121 of a previous stage of GF multiplication circuit cell results, wherein the rightmost neighbor bit Y(i\u22121)j\u22121 is in relation to the present GF multiplication circuit cell producing result Y(i)j for the selected i and j values;
a logic device producing qm\u2212i AND pj as output A;
a logic device producing Y(i\u22121)m\u22121 AND gj as output B; and
a logic device producing A XOR B XOR Y(i\u22121)j\u22121 as result Y(i)j to be utilized in one or more GF multiplication circuit cells or stored in a processor accessible storage unit.
8. The GF multiplication circuit cell of claim 7 disposed within an m-by-m array of interconnected GF multiplication circuit cells for producing a Galois Field (2m) multiplication result Y, where m is a positive integer, further comprising:
input operand q=(qm\u22121 qm\u22122 . . . q0);
input operand p=(pm\u22121 pm\u22122 . . . p0);
input operand g=(gm\u22121 gm\u22122 . . . g0);
the Y(i\u22121)m\u22121 and the Y(i\u22121)j\u22121 array border GF multiplication circuit cell input values set to 0; and
output Y result which is stored in a computer readable form.
9. The CF multiplication circuit cell of claim 8 wherein the m-by-m array of interconnected GF multiplication circuit cells further comprises:
the interconnections of the GF multiplication circuit cells governed by the equation
Y(i)=Y(i\u22121)+(qm\u2212i*p+Y(i\u22121)m\u22121*g)*xm\u2212i, i=1, 2, . . . , m and where Y(0)=0.
10. The GF multiplication circuit cell of claim 8 wherein the m-by-m array of GF multiplication circuit cells is further disposed within a grouping of multiple m-by-m arrays in a processor execution unit and further comprises:
a GF (2m) multiplication instruction with a data type field specifying at least one GF (2m) multiplication operation; and
means for connecting the multiple m-by-m arrays inputs and outputs for performing at least one GF (2m) multiplication in the execution of the GF (2m) multiplication instruction.
11. The GF multiplication circuit cell of claim 8 wherein the input operands q=(qm\u22121 qm\u22122 . . . q0), p=(pm\u22121 pm\u22122 . . . p0), and g=(gm\u22121 gm\u22122 . . . g0) are connected to read outputs of at least one storage unit in a processor system.
12. The GF multiplication circuit cell of claim 8 wherein the output Y results are connected to at least one storage unit write inputs in a processor system.
13. The GF multiplication circuit cell of claim 11 wherein the at least one storage unit is a processor accessible register file.
14. The GF multiplication circuit cell of claim 13 wherein the at least one storage unit is a processor accessible register file.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
What is claimed is:
1. A system for identifying an unidentified customer at the point of sale, comprising:
a database containing utterance data corresponding to a known customer; and
a processing system coupled to the database and operable to receive utterance information corresponding to the unidentified customer at the point of sale, the processing system further operable to compare the utterance information with the utterance data to identify the unidentified customer as the known customer.
2. The system of claim 1, wherein the database contains utterance data corresponding to a plurality of known customers.
3. The system of claim 1, wherein the database is located at a location other than the point of sale.
4. The system of claim 1, wherein the processing system is located at the point of sale.
5. The system of claim 1, wherein the processing system is further operable to register the identity of the unidentified customer.
6. The system of claim 5, wherein the processing system is further operable to associate the identity of the unidentified customer with the utterance information for the unidentified customer.
7. The system of claim 1, wherein the processing system is further operable to automatically retrieve stored information corresponding to the known customer in response to identifying the unidentified customer.
8. The system of claim 1, wherein the point of sale is remote from the database and is selected from. the group consisting of:
a telephone point of sale; and
a personal computer point of sale.
9. The system of claim 1, wherein:
the database contains a stored identifier for the known customer; and
the processing system is further operable to receive an identifier from the unidentified customer in response to identifying the unidentified customer as the known customer and to compare the identifier with the stored identifier to verify the identification of the unidentified customer as the known customer.
10. The system of claim 9, wherein the identifier comprises a personal identification number.
11. The system of claim 9, wherein the identifier comprises a password.
12. The system of claim 9, wherein the identifier is spoken.
13. A system for identifying an unidentified customer at the point of sale, comprising:
a database containing utterance data corresponding to a plurality of known customers;
a first processing system coupled to the database and operable to receive utterance information corresponding to a first unidentified customer at a first point of sale, the processing system further operable to compare the utterance information with the utterance data to identify the first unidentified customer as a first known customer; and
a second processing system coupled to the database and operable to receive utterance information corresponding to a second unidentified customer at a second point of sale, the second processing system further operable to compare the utterance information for the second unidentified customer with the utterance data to identify the second unidentified customer as a second known customer.
14. The system of claim 9, wherein the first unidentified customer and the second unidentified customer are the same unidentified customer.
15. The system of claim 9, wherein the first point of sale and the second point of sale are within the same establishment.
16. A method for identifying an unidentified customer at the point of sale, comprising:
receiving utterance information corresponding to the unidentified customer at the point of sale;
comparing the utterance information with utterance data corresponding to a known customer; and
identifying the unidentified customer as the known customer according to the comparison.
17. The method of claim 16, wherein the utterance data is contained in a database containing utterance data corresponding to a plurality of known customers.
18. The method of claim 16, further comprising the step of retrieving the utterance data from a database that is at a location other than the point of sale.
19. The method of claim 16, wherein the step of comparing occurs at the point of sale.
20. The method of claim 16, further comprising the step of registering the identity of the unidentified customer.
21. The method of claim 20, further comprising the step of associating the identity of the unidentified customer with the utterance information for the unidentified customer.
22. The method of claim 16, further comprising the step of associating the utterance data with stored information corresponding to the known customer.
23. The method of claim 16, further comprising the step of automatically retrieving information corresponding to the known customer in response to identifying the unidentified customer.
24. The method of claim 16, wherein the point of sale is remote from the database and is selected from the group consisting of:
a telephone point of sale; and
a personal computer point of sale.
25. The method of claim 16:
receiving utterance information corresponding to the unidentified customer at the point of sale;
comparing the utterance information with utterance data corresponding to a known customer;
identifying the unidentified customer as the known customer according to the comparison;
receiving an identifier from the formerly unidentified customer at the point of sale; and
comparing the identifier with a stored identifier for the known customer to verify the identification of the formerly unidentified customer as the known customer.
26. The system of claim 25, wherein the identifier comprises a personal identification number.
27. The system of claim 25, wherein the identifier comprises a password.
28. The system of claim 25, wherein the identifier is spoken.