CA2331004A1 - Efficient galois field multiplier structures for error-correction encoding and decoding - Google Patents
Efficient galois field multiplier structures for error-correction encoding and decoding Download PDFInfo
- Publication number
- CA2331004A1 CA2331004A1 CA002331004A CA2331004A CA2331004A1 CA 2331004 A1 CA2331004 A1 CA 2331004A1 CA 002331004 A CA002331004 A CA 002331004A CA 2331004 A CA2331004 A CA 2331004A CA 2331004 A1 CA2331004 A1 CA 2331004A1
- Authority
- CA
- Canada
- Prior art keywords
- code words
- polynomial
- logic gates
- field
- gates
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
Abstract
A communication system employing Reed-Solomon error-correction coding which comprises an encoder (12) and a decoder (22). Either the encoder or decoder may be compatible with a first field polynomial selected to reduce the number of logic gates in the encoder or decoder. Before decoding, a converter (20) converts the code from a form compatible with a first field polynomial to another form compatible with a second field polynomial.
Description
TRW Docket No. 12-1070 EFFICIENT GALOIS FIELD MULTIPLIER STRUCTURES FOR
ERROR-CORRECTION ENCODING AND DECODING
BACKGROUND OF THE INVENTION
This invention relates to communication systems employing polynomial-generated error-correction encoding, and more particularly relates to encoding and decoding techniques for reducing the number of logic gates used in such systems.
Polynomial-generated error-correction coding, such as Reed-Solomon coding, requires encoders and decoders with many gates. Most of the gates are allocated to Galois field multiplier structures. By using certain field polynomials for the Galois field multiplier structures, the number of gates can be reduced. However, the field polynomial which enables gate reduction is frequently incompatible with other parts of the encoder or decoder system which are made with commercially available parts. As a result, there is a need for a system of converting a code compatible with one field polynomial to a code compatible with another field of polynomial which enables a reduction in the number of gates used in the encoders or decoders. This invention addresses the problem and provides a solution.
TRW Docket No. 12-1070 BRIEF SUMMARY OF THE INVENTION
The preferred embodiment is useful on a communication system employing polynomial-generated error-correction coding using encoders and decoders which comprise logic gates. In such an environment, according to a first embodiment of the invention, code words of a first form compatible with a first field polynomial selected to reduce the number of the logic gates are generated, preferably by an encoder.
Code words of a second form compatible with a second field polynomial are decoded, preferably by a decoder. The code words of the first form are converted to code words of the second form before the code words of the second form are decoded.
According to a second embodiment of the invention, code words of a first form compatible with a first field polynomial are generated, preferably by an encoder. Code words of a second form compatible with a second field polynomial selected to reduce the number of logic gates are decoded, preferably by a decoder. The codes words of the first form are converted to code words of the second form before the code words of the second form are decoded by the decoder.
Using the foregoing techniques, systems employing field polynomials selected to reduce the number of logic gates can be made compatible with systems also employing encoders or decoders that use other field polynomials. As result, polynomial-generated error-correction coding systems can be customized to increase efficiency and reduce overall costs.
BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 is a schematic block diagram of a preferred form of a communication system made in accordance with the invention.
ERROR-CORRECTION ENCODING AND DECODING
BACKGROUND OF THE INVENTION
This invention relates to communication systems employing polynomial-generated error-correction encoding, and more particularly relates to encoding and decoding techniques for reducing the number of logic gates used in such systems.
Polynomial-generated error-correction coding, such as Reed-Solomon coding, requires encoders and decoders with many gates. Most of the gates are allocated to Galois field multiplier structures. By using certain field polynomials for the Galois field multiplier structures, the number of gates can be reduced. However, the field polynomial which enables gate reduction is frequently incompatible with other parts of the encoder or decoder system which are made with commercially available parts. As a result, there is a need for a system of converting a code compatible with one field polynomial to a code compatible with another field of polynomial which enables a reduction in the number of gates used in the encoders or decoders. This invention addresses the problem and provides a solution.
TRW Docket No. 12-1070 BRIEF SUMMARY OF THE INVENTION
The preferred embodiment is useful on a communication system employing polynomial-generated error-correction coding using encoders and decoders which comprise logic gates. In such an environment, according to a first embodiment of the invention, code words of a first form compatible with a first field polynomial selected to reduce the number of the logic gates are generated, preferably by an encoder.
Code words of a second form compatible with a second field polynomial are decoded, preferably by a decoder. The code words of the first form are converted to code words of the second form before the code words of the second form are decoded.
According to a second embodiment of the invention, code words of a first form compatible with a first field polynomial are generated, preferably by an encoder. Code words of a second form compatible with a second field polynomial selected to reduce the number of logic gates are decoded, preferably by a decoder. The codes words of the first form are converted to code words of the second form before the code words of the second form are decoded by the decoder.
Using the foregoing techniques, systems employing field polynomials selected to reduce the number of logic gates can be made compatible with systems also employing encoders or decoders that use other field polynomials. As result, polynomial-generated error-correction coding systems can be customized to increase efficiency and reduce overall costs.
BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 is a schematic block diagram of a preferred form of a communication system made in accordance with the invention.
TRW Docket No. 12-1070 Figure 2 is a schematic block diagram of a preferred form of logic gates used in the encoder or decoder shown in Figure1.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Referring to Fig. 1, a preferred embodiment of the invention comprises a data source 10 which transmits conventional communication data to a Reed-Solomon encoder 12 employing polynomial-generated error-correction coding and also comprising logic gates that are operable to generate code words of a first form compatible with a first field polynomial selected to reduce the number of the logic gates.
The first field polynomial may be selected as described in Efficient Multiplier Architectures for Galois Fields Gf(24")" by Christof Paar et al., IEEE
Transactions on Computers, Vol. 47, No. 2, February 1998.
The Reed-Solomon code words generated by encoder 12 are transmitted to a conventional modulator 14. The modulated signals are then transmitted over a conventional communication medium 16, such as wires, optic fibers, or an atmospheric communication channel. The transmitted signals are received by a conventional demodulator 18 and, after demodulation, are transmitted to a converter 20. In a manner explained later, converter 20 converts the code words from the first form compatible with the field polynomial used by encoder 12 to a second form compatible with a second field polynomial used by a Reed-Solomon decoder 22 which may employ commercially available off the-shelf components, including decoding gates, which are compatible with the second field polynomial. The converted code words are then sent to decoder which uses the second field polynomial to generate data useful to a data user 24, which TRW Docket No. 12-1070 may comprise communication equipment or computer equipment that employs the data originally received from source 10.
As an alternative embodiment, decoder 22 may include logic gates operable to decode code words of a form compatible with a field polynomial selected to reduce the number of logic gates in decoder 22. In such an environment, encoder 12 uses a first field polynomial in order to encode data from source 10 according to a Reed-Solomon code. According to the alternative embodiment, encoder 12 may use commercially-available off the-shelf components, including encoding gates, which are compatible with the first field polynomial. Converter 20 then converts the code generated by encoder 12, which is compatible with the first field polynomial, to a code which is compatible with a second field polynomial used by decoder 22 in order to reduce the number of logic gates in decoder 22.
The first and second field polynomials used by encoder 12 and decoder 22, as well as the construction and operation of converter 20, are explained in terms of Galois field arithmetic in the following section of this specification.
A Galois field is like any other field in that all of the elements within the field are closed under "addition" and "multiplication." The operations of addition and multiplication, however, are defined over a polynomial, typically known as the field polynomial. Typically, the field polynomial will be monic and irreducible over GF(2) and will be of order-m, so that it can be extended to GF(2'"). Using a, GF(2"') can be constructed by defining all of the elements in the field in terms of a basis of elements, ~a°, a', a2,..., a"'-' ~ . For example, the typical field polynomial used to define GF(28) is given as:
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Referring to Fig. 1, a preferred embodiment of the invention comprises a data source 10 which transmits conventional communication data to a Reed-Solomon encoder 12 employing polynomial-generated error-correction coding and also comprising logic gates that are operable to generate code words of a first form compatible with a first field polynomial selected to reduce the number of the logic gates.
The first field polynomial may be selected as described in Efficient Multiplier Architectures for Galois Fields Gf(24")" by Christof Paar et al., IEEE
Transactions on Computers, Vol. 47, No. 2, February 1998.
The Reed-Solomon code words generated by encoder 12 are transmitted to a conventional modulator 14. The modulated signals are then transmitted over a conventional communication medium 16, such as wires, optic fibers, or an atmospheric communication channel. The transmitted signals are received by a conventional demodulator 18 and, after demodulation, are transmitted to a converter 20. In a manner explained later, converter 20 converts the code words from the first form compatible with the field polynomial used by encoder 12 to a second form compatible with a second field polynomial used by a Reed-Solomon decoder 22 which may employ commercially available off the-shelf components, including decoding gates, which are compatible with the second field polynomial. The converted code words are then sent to decoder which uses the second field polynomial to generate data useful to a data user 24, which TRW Docket No. 12-1070 may comprise communication equipment or computer equipment that employs the data originally received from source 10.
As an alternative embodiment, decoder 22 may include logic gates operable to decode code words of a form compatible with a field polynomial selected to reduce the number of logic gates in decoder 22. In such an environment, encoder 12 uses a first field polynomial in order to encode data from source 10 according to a Reed-Solomon code. According to the alternative embodiment, encoder 12 may use commercially-available off the-shelf components, including encoding gates, which are compatible with the first field polynomial. Converter 20 then converts the code generated by encoder 12, which is compatible with the first field polynomial, to a code which is compatible with a second field polynomial used by decoder 22 in order to reduce the number of logic gates in decoder 22.
The first and second field polynomials used by encoder 12 and decoder 22, as well as the construction and operation of converter 20, are explained in terms of Galois field arithmetic in the following section of this specification.
A Galois field is like any other field in that all of the elements within the field are closed under "addition" and "multiplication." The operations of addition and multiplication, however, are defined over a polynomial, typically known as the field polynomial. Typically, the field polynomial will be monic and irreducible over GF(2) and will be of order-m, so that it can be extended to GF(2'"). Using a, GF(2"') can be constructed by defining all of the elements in the field in terms of a basis of elements, ~a°, a', a2,..., a"'-' ~ . For example, the typical field polynomial used to define GF(28) is given as:
TRW Docket No. 12-1070 p(x) =x8 +x4 +x' +xz +1 (26) Now, if a is defined to be a zero of p(x), then we have p(a) =a8 +a4 +a' +a2 +1=0 =) a8 =a4 +a' +a2 +1 (27) Any element in GF(28) then can be defined by the field polynomial as a linear combination of ~a°, a', ..., a' . The field element, a8, is derived from (27) and all other field elements also are derived in a similar manner from the field polynomial.
All of the field elements (except 0) from GF (256) can be represented as a' where i is an integer between 0 and 254. This is useful for multiplication between field elements:
a' a = a'+' (28) The integer representation of the field elements is simply given by the expansion of the basis elements (i.e., a° =1, a8 = 29). Thus, multiplication of the integer representations of the field elements does not correspond to multiplication over the field GF
(256).
The addition of any two field elements from GF (256) can be done as an addition over GF(2) of each of the bits in the bit-representation of the field elements. This amounts to a simple XOR of each of the 8 bits of the field elements to be added.
To understand how the multiplication of two elements from GF (256), a = a; and b = a' works, each element is represented as a polynomial over GF(2) (i.e., a(x) and a (x) respectively):
a (x) =a°x° + a, x' + ... + a, x' (29) b(x) = b°x° + a,x' + ... b,x' (30) TRW Docket No. 12-1070 The coefficients of the polynomial are simply the coefficients of the basis expansion for the element. The multiplication of the two elements then is the multiplication of the two polynomials modulo the field polynomial:
c(x) = a (x)b(x) mod p(x) = a'+' (31 ) where the last equality in (31 ) follows from (28). An architecture for implementing the multiplication follows from the solution to each of the 8 coefficients of c(x) in terms of the a;s and b~;s. For example, the solution to the first coefficient of c(x) is:
co = ~o + a~b~+asb~ + a~bs + asb~+asbs + a~b5+ a~b~ + aZbe + cc3b5 + c4b4 +
a5b3 + aeb2 + a~b~ (32) where a;b; is implemented as an AND gate between the two bits, a;, b~ and a; +
b~ is implemented as XOR gate between the two bits. The above architecture using the field polynomial that is defined in (26) is not optimal in terms of minimizing the number of gates used. A more efficient architecture comes from the realization that GF(256) can be generated from many different field polynomials with each of the resulting fields being isomorphic. C. Paar, et al. in "Efficient Multiplier Architectures for Galois Fields GF(24")," IEEE Trans. on Computers, vol. 47, pp. 162-170, February 1998, describe field polynomials that produce a minimum number of gates for a multiplication over GF(256). The resulting field polynomial is given as a composite field. The composite field consists of taking an order-4 field polynomial with coefficients from GF(4) and constructing GF((22)4) = GF(256), whereas, before, an order-8 polynomial was used with coefficients from GF(2) to construct GF(28) = GF(256). The new field polynomial is given as:
p~ (x) = x4 + x3 + wZx2 + w (33) where w is the primitive element of the field polynomial, q(x) , that defines GF(4):
All of the field elements (except 0) from GF (256) can be represented as a' where i is an integer between 0 and 254. This is useful for multiplication between field elements:
a' a = a'+' (28) The integer representation of the field elements is simply given by the expansion of the basis elements (i.e., a° =1, a8 = 29). Thus, multiplication of the integer representations of the field elements does not correspond to multiplication over the field GF
(256).
The addition of any two field elements from GF (256) can be done as an addition over GF(2) of each of the bits in the bit-representation of the field elements. This amounts to a simple XOR of each of the 8 bits of the field elements to be added.
To understand how the multiplication of two elements from GF (256), a = a; and b = a' works, each element is represented as a polynomial over GF(2) (i.e., a(x) and a (x) respectively):
a (x) =a°x° + a, x' + ... + a, x' (29) b(x) = b°x° + a,x' + ... b,x' (30) TRW Docket No. 12-1070 The coefficients of the polynomial are simply the coefficients of the basis expansion for the element. The multiplication of the two elements then is the multiplication of the two polynomials modulo the field polynomial:
c(x) = a (x)b(x) mod p(x) = a'+' (31 ) where the last equality in (31 ) follows from (28). An architecture for implementing the multiplication follows from the solution to each of the 8 coefficients of c(x) in terms of the a;s and b~;s. For example, the solution to the first coefficient of c(x) is:
co = ~o + a~b~+asb~ + a~bs + asb~+asbs + a~b5+ a~b~ + aZbe + cc3b5 + c4b4 +
a5b3 + aeb2 + a~b~ (32) where a;b; is implemented as an AND gate between the two bits, a;, b~ and a; +
b~ is implemented as XOR gate between the two bits. The above architecture using the field polynomial that is defined in (26) is not optimal in terms of minimizing the number of gates used. A more efficient architecture comes from the realization that GF(256) can be generated from many different field polynomials with each of the resulting fields being isomorphic. C. Paar, et al. in "Efficient Multiplier Architectures for Galois Fields GF(24")," IEEE Trans. on Computers, vol. 47, pp. 162-170, February 1998, describe field polynomials that produce a minimum number of gates for a multiplication over GF(256). The resulting field polynomial is given as a composite field. The composite field consists of taking an order-4 field polynomial with coefficients from GF(4) and constructing GF((22)4) = GF(256), whereas, before, an order-8 polynomial was used with coefficients from GF(2) to construct GF(28) = GF(256). The new field polynomial is given as:
p~ (x) = x4 + x3 + wZx2 + w (33) where w is the primitive element of the field polynomial, q(x) , that defines GF(4):
TRW Docket No. 12-1070 q(x) = x2 + x + 1 (34) q(w) =w2 +w+1=0 =) w2 =w+1. (35) The code words generated by encoder 12 which are compatible with a first field polynomial can be converted to a form compatible with a second field polynomial used by decoder 22 according to expressions (36)-{40).
To show that the field generated by p(x) is isomorphic to the field generated by p~ (x) , the following mapping is defined:
'l;' : GF(28 ) _) GF((2 Z ) 4 ) (36) The zero element must map to the zero element by the definition of an isomorphic map:
~'(0) = 0 (37) From (37) it follows that:
'~'(a"' ) _ ~" x = 0,1, ..., 254 (38) where a is the primitive element of p(x) . Solving the above equations, w =
agsK and ,r? = a3'"' . Therefore, the isomorphic map is completely defined by:
~ (aK) = a3~K (39) The resulting architecture can be found by defining multiplication with respect to p~(x):
c(x) = a(x)b(x) mod p~ (x) (40).
where a(x) and b(x) are now order-3 polynomials with coefficients from GF(4).
As a result, after solving for co, c~, c2, c3 in terms of the a; s, b~ ; s, product terms a;b; are evaluated using a GF(4) multiply, while additions are evaluated as usual.
Figure 2 illustrates logic gates suitable for use in encoder 12 or decoder 22.
More specifically, Figure 2 shows and gates 31-33 and exclusive OR gates 41-44. The TRW Docket No. 12-1070 gate arrangement of Figure 2 may be used to implement a GF(4) multiple with field polynomial q(x)=x2+x+1.
The embodiments described in connection with Figure 1 illustrate preferred forms of the invention which may be altered and modified without departing from the true spirit and scope of the invention as defined in the accompanying claims.
To show that the field generated by p(x) is isomorphic to the field generated by p~ (x) , the following mapping is defined:
'l;' : GF(28 ) _) GF((2 Z ) 4 ) (36) The zero element must map to the zero element by the definition of an isomorphic map:
~'(0) = 0 (37) From (37) it follows that:
'~'(a"' ) _ ~" x = 0,1, ..., 254 (38) where a is the primitive element of p(x) . Solving the above equations, w =
agsK and ,r? = a3'"' . Therefore, the isomorphic map is completely defined by:
~ (aK) = a3~K (39) The resulting architecture can be found by defining multiplication with respect to p~(x):
c(x) = a(x)b(x) mod p~ (x) (40).
where a(x) and b(x) are now order-3 polynomials with coefficients from GF(4).
As a result, after solving for co, c~, c2, c3 in terms of the a; s, b~ ; s, product terms a;b; are evaluated using a GF(4) multiply, while additions are evaluated as usual.
Figure 2 illustrates logic gates suitable for use in encoder 12 or decoder 22.
More specifically, Figure 2 shows and gates 31-33 and exclusive OR gates 41-44. The TRW Docket No. 12-1070 gate arrangement of Figure 2 may be used to implement a GF(4) multiple with field polynomial q(x)=x2+x+1.
The embodiments described in connection with Figure 1 illustrate preferred forms of the invention which may be altered and modified without departing from the true spirit and scope of the invention as defined in the accompanying claims.
Claims (20)
1. In a communication system employing polynomial generated error-correction coding, apparatus comprising in combination:
an encoder comprising logic gates operable to generate code words of a first form compatible with a first field polynomial selected to reduce the number of said logic gates;
a decoder operable to decode code words of a second form compatible with a second field polynomial; and a converter operable to convert said code words of the first form to code words of the second form before the code words of the second form are decoded by the decoder.
an encoder comprising logic gates operable to generate code words of a first form compatible with a first field polynomial selected to reduce the number of said logic gates;
a decoder operable to decode code words of a second form compatible with a second field polynomial; and a converter operable to convert said code words of the first form to code words of the second form before the code words of the second form are decoded by the decoder.
2. Apparatus, as claimed in claim 1, wherein said logic gates comprise AND
gates and EXCLUSIVE OR gates.
gates and EXCLUSIVE OR gates.
3. Apparatus, as claimed in claim 1, wherein said logic gates of the encoder perform multiplication of polynomials of the form a(x) and b(x) by multiplication of the polynomials modulo said first field polynomial of the form a(x)b(x) mod p(x) where p(x) represents said first field polynomial.
4. Apparatus, as claimed in claim 1, wherein said converter comprises an isomorphic mapper.
5. Apparatus, as claimed in claim 1, wherein said coding comprises Reed-Solomon coding.
6. In a communication system employing polynomial generated error-correction coding, apparatus comprising in combination:
an encoder operable to generate code words of a first form compatible with a first field polynomial;
a decoder comprising logic gates operable to decode code words of a second form compatible with a second field polynomial selected to reduce the number of said logic gates; and a converter operable to convert the code words of the first form to code words of the a second form before said code words of the second form are decoded by the decoder.
an encoder operable to generate code words of a first form compatible with a first field polynomial;
a decoder comprising logic gates operable to decode code words of a second form compatible with a second field polynomial selected to reduce the number of said logic gates; and a converter operable to convert the code words of the first form to code words of the a second form before said code words of the second form are decoded by the decoder.
7. Apparatus, as claimed in claim 6, wherein said logic gates comprise AND
gates and EXCLUSIVE OR gates.
gates and EXCLUSIVE OR gates.
8. Apparatus, as claimed in claim 6, wherein said logic gates of the decoder perform multiplication of polynomials of the form a(x) and b(x) by multiplication of the polynomials modulo said second field polynomial of the form a(x)b(x) mod p(x) where p(x) represents said second field polynomial.
9. Apparatus, as claimed in claim 6, wherein said converter comprises an isomorphic mapper.
10. Apparatus, as claimed in claim 6, wherein said coding comprises Reed-Solomon coding.
11. In a communication system comprising polynomial generated error-correction encoding apparatus comprising logic gates, a method comprising in combination:
generating code words of a first form compatible with a first field polynomial selected to reduce the number of said logic gates;
decoding code words of a second form compatible with a second field polynomial; and converting said code words of the first form to code words of the second form before the code words of the second form are decoded.
generating code words of a first form compatible with a first field polynomial selected to reduce the number of said logic gates;
decoding code words of a second form compatible with a second field polynomial; and converting said code words of the first form to code words of the second form before the code words of the second form are decoded.
12. A method, as claimed in claim 11, wherein said logic gates comprise AND
gates and EXCLUSIVE OR gates.
gates and EXCLUSIVE OR gates.
13. A method, as claimed in claim 11, wherein said generating comprises multiplication of polynomials of the form a(x) and b(x) by multiplication of the polynomials modulo said first field polynomial of the form a(x)b(x) mod p(x) where p(x) represents said first field polynomial.
14. A method, as claimed in claim 11, wherein said converting comprises isomorphic mapping.
15. A method, as claimed in claim 11, wherein said code words comprise Reed-Solomon code words.
16. In a communication system employing polynomial generated error-correction decoding apparatus comprising logic gates, a method comprising in combination:
generating code words of a first form compatible with a first field polynomial;
decoding code words of a second form compatible with a second field polynomial selected to reduce the number of said logic gates; and converting the code words of the first form to code words of the a second form before said code words of the second form are decoded by the decoder.
generating code words of a first form compatible with a first field polynomial;
decoding code words of a second form compatible with a second field polynomial selected to reduce the number of said logic gates; and converting the code words of the first form to code words of the a second form before said code words of the second form are decoded by the decoder.
17. A method, as claimed in claim 16, wherein said logic gates comprise AND
gates and EXCLUSIVE OR gates.
gates and EXCLUSIVE OR gates.
18. A method, as claimed in claim 16, wherein said logic gates of the decoder perform multiplication of polynomials of the form a(x) and b(x) by multiplication of the polynomials modulo said second field polynomial of the form a(x)b(x) mod p(x) where p(x) represents said second field polynomial.
19. A method, as claimed in claim 16, wherein said converting comprises isomorphic mapping.
20. A method, as claimed in claim 16, wherein said code words comprise Reed-Solomon code words.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US09/498,589 | 2000-02-04 | ||
| US09/498,589 US6574772B1 (en) | 2000-02-04 | 2000-02-04 | Efficient galois field multiplier structures for error-correction encoding and decoding |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2331004A1 true CA2331004A1 (en) | 2001-08-04 |
Family
ID=23981684
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002331004A Abandoned CA2331004A1 (en) | 2000-02-04 | 2001-01-10 | Efficient galois field multiplier structures for error-correction encoding and decoding |
Country Status (4)
| Country | Link |
|---|---|
| US (1) | US6574772B1 (en) |
| EP (1) | EP1122889A3 (en) |
| JP (1) | JP2001274695A (en) |
| CA (1) | CA2331004A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100594265B1 (en) * | 2004-03-16 | 2006-06-30 | 삼성전자주식회사 | A cipher processing unit, an advanced encryption standard cipher system and an advanced encryption standard cipher method with masking method |
| US7370258B2 (en) * | 2005-04-28 | 2008-05-06 | Sandbridge Technologies Inc. | Iterative concatenated convolutional Reed-Solomon decoding method |
| US8923510B2 (en) * | 2007-12-28 | 2014-12-30 | Intel Corporation | Method and apparatus for efficiently implementing the advanced encryption standard |
| KR20200020535A (en) * | 2018-08-17 | 2020-02-26 | 에스케이하이닉스 주식회사 | Error correction device, operating method thereof and electronic device including the same |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4777635A (en) * | 1986-08-08 | 1988-10-11 | Data Systems Technology Corp. | Reed-Solomon code encoder and syndrome generator circuit |
| US5130990A (en) * | 1990-02-15 | 1992-07-14 | The United States Of America, As Represented By The Administrator, National Aeronautics And Space Administration | VLSI architecture for a Reed-Solomon decoder |
| US5291496A (en) * | 1990-10-18 | 1994-03-01 | The United States Of America As Represented By The United States Department Of Energy | Fault-tolerant corrector/detector chip for high-speed data processing |
| US5396502A (en) * | 1992-07-09 | 1995-03-07 | Advanced Hardware Architectures, Inc. | Single-stack implementation of a Reed-Solomon encoder/decoder |
| US5377207A (en) * | 1992-09-03 | 1994-12-27 | The United States Of America As Represented By The United States National Aeronautics And Space Administration | Mappings between codewords of two distinct (N,K) Reed-Solomon codes over GF (2J) |
| US5272661A (en) * | 1992-12-15 | 1993-12-21 | Comstream Corporation | Finite field parallel multiplier |
| US5787099A (en) * | 1995-10-12 | 1998-07-28 | Adaptec, Inc. | System and method for encoding and decoding data using numerical computations in galois fields |
| JPH10135848A (en) * | 1996-10-30 | 1998-05-22 | Texas Instr Japan Ltd | Reed-solomon coder and its method |
| US6263471B1 (en) * | 1999-03-05 | 2001-07-17 | Industrial Technology Research Institute | Method and apparatus for decoding an error correction code |
| US6343305B1 (en) * | 1999-09-14 | 2002-01-29 | The State Of Oregon Acting By And Through The State Board Of Higher Education On Behalf Of Oregon State University | Methods and apparatus for multiplication in a galois field GF (2m), encoders and decoders using same |
-
2000
- 2000-02-04 US US09/498,589 patent/US6574772B1/en not_active Expired - Lifetime
-
2001
- 2001-01-10 CA CA002331004A patent/CA2331004A1/en not_active Abandoned
- 2001-01-18 EP EP01101116A patent/EP1122889A3/en not_active Withdrawn
- 2001-02-05 JP JP2001027915A patent/JP2001274695A/en active Pending
Also Published As
| Publication number | Publication date |
|---|---|
| JP2001274695A (en) | 2001-10-05 |
| US6574772B1 (en) | 2003-06-03 |
| EP1122889A3 (en) | 2004-07-21 |
| EP1122889A2 (en) | 2001-08-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7340003B1 (en) | Multi-mode iterative detector | |
| US5699368A (en) | Error-correcting encoder, error-correcting decoder, and data transmitting system with error-correcting codes | |
| JP2011072009A (en) | Highly parallel map decoder | |
| JPH01256850A (en) | Encoding method | |
| US5912905A (en) | Error-correcting encoder, error-correcting decoder and data transmitting system with error-correcting codes | |
| Kwon et al. | An area-efficient VLSI architecture of a Reed-Solomon decoder/encoder for digital VCRs | |
| JPH10135848A (en) | Reed-solomon coder and its method | |
| Peterson et al. | Binary convolutional codes for a multiple-access channel (corresp.) | |
| CN101779379B (en) | Encoding and decoding using generalized concatenated codes (GCC) | |
| JP2001203589A (en) | Xor code, and serial connected coder and decoder using it | |
| EP0823787A3 (en) | A rate 16/17 ENDEC with independent high/low byte decoding | |
| JP2009512353A (en) | Improved turbo code interleaver for low frame error rate | |
| JP7047092B2 (en) | Decoding method, device and storage medium for stair code | |
| US8365053B2 (en) | Encoding and decoding data using store and exclusive or operations | |
| US6574772B1 (en) | Efficient galois field multiplier structures for error-correction encoding and decoding | |
| TW200926618A (en) | Devices and methods for bit-level coding and decoding of turbo codes, and a set of interleaving instructions recognizable by a data processing device | |
| EP2309650B1 (en) | A systematic encoder with arbitrary parity positions | |
| US6236340B1 (en) | Modulation encoders and decoders | |
| US6344807B1 (en) | Packet-frame generator for creating an encoded packet frame and method thereof | |
| US8161360B1 (en) | Integrated interleaved codes | |
| EP2207266A1 (en) | Decoding of recursive convolutional codes by means of a decoder for non-recursive convolutional codes | |
| Moreno | Symmetries of binary Goppa codes (Corresp.) | |
| CN100380495C (en) | Demodulation apparatus and method using code table with reduced complexity | |
| KR100464228B1 (en) | Device for transmitting and receiving digital information signal and its transmission method | |
| US7696908B2 (en) | Techniques for reducing error propagation using modulation codes having a variable span |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |