CORRECTION OF BIT ERRORS

Abstract

Processing of a bit sequence is proposed, wherein (i) a first partial error syndrome s.sub.1 of an error syndrome and a second partial error syndrome s.sub.2 of the error syndrome are determined for the bit sequence, (ii) a first comparison value is determined on the basis of a bit position and the first partial error syndrome, (iii) a second comparison value is determined on the basis of the bit position and the second partial error syndrome, and (iv) the bit position is corrected should a comparison of the first comparison value with the second comparison value assume a specified value and otherwise the bit position is not corrected.

Claims

1. A method for processing a bit sequence, determining a first partial error syndrome s.sub.1 of an error syndrome and a second partial error syndrome s.sub.2 of the error syndrome for the bit sequence, determining a first comparison value based on a bit position and the first partial error syndrome, determining a second comparison value based on the bit position and the second partial error syndrome, and changing a bit value at the bit position to a corrected bit value when a comparison of the first comparison value with the second comparison value is a specified value, and otherwise leaving the bit value at the bit position when the comparison of the first comparison value with the second comparison value is not the specified value.

2. The method of claim 1, wherein the changing of the bit value to the corrected bit value uses an error code capable of correcting at least a 2-bit error.

3. The method of claim 2, wherein the error code is a —-Chaudhuri—Hocquenghem (BCH) code.

4. The method of claim 1, wherein the bit value is changed to the corrected bit value when the first comparison value equals the second comparison value.

5. The method of claim 1, wherein the first partial error syndrome s.sub.1 and the second partial error syndrome s.sub.2 each have m components of the error syndrome and m>2.

6. The method of claim 1, wherein the bit value is assigned a value β, wherein the first comparison value is determined as (s.sub.1β).sup.k and the second comparison value is determined as s.sub.2+β.sup.k, wherein k≠0, and s.sub.1, s.sub.2 and β are elements of a Galois field.

7. The method of claim 6, wherein the Galois field is GF(2.sup.m)and m>2.

8. The method of claim 6, wherein r bit positions i.sub.0, i.sub.1, . . . , i.sub.r−1 of the bit sequence are assigned r values α.sup.i.sup.0, α.sup.i.sup.1, α.sup.i.sup.2, α.sup.i.sup.r−1, wherein first comparison values ${\left[s_1+{\alpha }^{i_0}\right]}^k,{\left[s_1+{\alpha }^{i_1}\right]}^k,{\left[s_1+{\alpha }^{i_2}\right]}^k,{\mathrm{.Math.}\left[s_1+{\alpha }^{i_{r-1}}\right]}^k$ and second comparison values $s_2+{\left[{\alpha }^{i_0}\right]}^k,s_2+{\left[{\alpha }^{i_1}\right]}^k,s_2+{\left[{\alpha }^{i_2}\right]}^k,\mathrm{.Math.}$ $s_2+{\left[{\alpha }^{i_{r-1}}\right]}^k$ are determined for bit positions to be corrected, wherein 1 and a is a generator of the Galois field.

9. The method of claim 6, wherein k=3 or k=−1.

10. The method of claim 1 for error correction of a 2-bit error at bit positions i and j, wherein the first partial error syndrome is determined as
s.sub.1=α.sup.i+α.sup.j wherein the second partial error syndrome is determined as
s.sub.2=α.sup.k.Math.i+α.sup.k.Math.j wherein the comparison supplies a correction signal for correcting the i-th bit, wherein the correction signal is determined such that it assumes a first value if
(s.sub.1+α.sup.i).sup.k=s.sub.2+α.sup.k.Math.i applies, and assumes a second value if
(s.sub.1+α.sup.i).sup.k≠s.sub.2+α.sup.k.Math.i applies, where α.sup.i, α.sup.j, α.sup.k.Math.i, α.sup.k.Math.j are elements of a Galois field GF(2.sup.m), m≥3 and k is an integer not equal to 0, and + denotes addition in the Galois field.

11. The method of claim 10, further comprising: determining a plurality of correction signals, in each case one for a different bit, and wherein the plurality of correction signals are at least partially determined with overlapping timing.

12. The method of claim 10, wherein different correction signals are determined by means of different components.

13. The method of claim 10, wherein the first comparison value and the second comparison value are at least partially determined simultaneously.

14. The method of claim 1, further comprising: determining a third partial error syndrome.

15. The method of claim 14, wherein the third partial error syndrome is a syndrome of a 3-bit error-correcting —-Chaudhuri—Hocquenghem (BCH) code.

16. The method of claim 14, wherein the specified value in correction of a 2-bit error is constant.

17. The method of claim 15, wherein, in correction of a 3-bit error, the specified value is determined based on the respective bit position to be corrected.

18. The method of claim 14, wherein, when the corrected bit value corrects an erroneous first bit of a 3-bit error, the specified value equals a value of a product of: a second bit position, a third bit position, and a sum of the second bit position and the third bit position; where the second bit position represents a position of a second bit error and the third bit position represents a position of a third bit error, and where the product and the sum of the bit positions are determined in a Galois field GF(2.sup.m).

19. The method of claim 18, wherein the specified value is determined based on a symmetric function of the erroneous bit positions.

20. The method of claim 19, wherein the symmetric function is determined using partial error syndromes of a Bose—Chaudhuri—Hocquenghem (BCH) code.

21. The method of claim 14, further comprising: determining a parity for the bit sequence.

22. The method of claim 21, wherein the specified value is constant if the parity of the bit sequence equals 0 and the first partial error syndrome si is not equal to 0.

23. The method of claim 21, wherein the specified value is constant if the parity of the bit sequence equals 1 and s.sub.1.sup.3=s.sub.2, where s.sub.1 is the first partial error syndrome and s.sub.2 is the second partial error syndrome.

24. A device for processing a bit sequence, configured to: determine a first partial error syndrome s.sub.1 of an error syndrome and a second partial error syndrome s.sub.2 of the error syndrome for the bit sequence, determine a first comparison value based on a bit position and the first partial error syndrome, determine a second comparison value based on the bit position and the second partial error syndrome, correct a bit value at the bit position when a comparison between the first comparison value and the second comparison value assumes a specified value, not correct the bit value at the bit position when the comparison between the first comparison value and the second comparison value do not assume the specified value.

25. The device of claim 24, wherein the device comprises a plurality of processing units and/or circuits configured to correct or not correct bit values at corresponding bit positions at least in part in simultaneous fashion.

26. The device of claim 25, wherein the device is part of a memory or a memory system or is separate from the memory or the memory system.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0043] FIG. 1 shows an exemplary symbolic block diagram for a possible correction of a multiplicity of bit positions;

[0044] FIG. 2 shows a block diagram based on FIG. 1, additionally with a bit error coding signal, on the basis of which the correction can be switched inactive;

[0045] FIG. 3 shows a first alternative for realizing the comparison value generator, shown in FIG. 1, for processing the partial error syndrome s.sub.1;

[0046] FIG. 4 shows a first alternative for realizing the comparison value generator, shown in FIG. 1, for processing the partial error syndrome s.sub.2;

[0047] FIG. 5 shows a second alternative for realizing the comparison value generator, shown in FIG. 1, for processing the partial error syndrome s.sub.1; and

[0048] FIG. 6 shows a second alternative for realizing the comparison value generator, shown in FIG. 1, for processing the partial error syndrome s.sub.2.

DETAILED DESCRIPTION

[0049] By way of example, the determination of a correction value for a bit to be corrected is proposed. By way of example, the bit is part of a bit sequence. The correction value can be determined using an error code.

[0050] Error syndromes, in particular partial error syndromes, can be determined for the error code. By way of example, a first partial error syndrome and a second partial error syndrome may be determined. A first comparison value is ascertained on the basis of the first partial error syndrome and a bit position to be corrected, and a second comparison value is ascertained on the basis of the second partial error syndrome and the bit position to be corrected. If the two comparison values are identical, the correction value can be set equal to a first value (e.g., “1”). If the two comparison values are not equal, the correction value can be set equal to a second value (e.g., “0”).

[0051] In this context, the first comparison value and the second comparison value, and hence also the correction value for the bit position, in each case are determined advantageously directly from one of the partial error syndromes and the bit position, without it being necessary to ascertain a locator polynomial and the zeros thereof by way of a search method, for example.

[0052] If use is made of a Galois field GF(2.sup.m) with m>2, each bit position to be corrected may be reversibly assigned an m-component value. On the basis of this value and the first syndrome component, it is possible to determine the first comparison value. Accordingly, the second comparison value can be determined using this value and the second syndrome component.

[0053] In one option, correction values for a plurality of bit positions, in particular for all bit positions, are determined according to this scheme. Preferably, correction values for at least two bit positions can be determined in parallel. In this case, “determined in parallel” means that the correction values are determined at least partly simultaneously (that is to say at least partly with overlapping timing), preferably using different hardware and/or software.

[0054] Various bit positions to be corrected

i.sub.0,i.sub.1, . . . , i.sub.r
can be reversibly uniquely assigned various values
β.sub.i0, . . . , β.sub.i.sub.r
in pairs. The bit positions can be denoted by
0, 1, . . . , r
and the values can be denoted by
β.sub.0, . . . , β.sub.r
in simplified notation.

[0055] The first comparison value for the bit position i.sub.j to be corrected, with j=0, . . . , r can be determined as

(s.sub.1β.sub.i.sub.j).sup.k
and the second comparison value for the bit position to be corrected can be determined as
s.sub.2β.sub.ij.sup.k,
where s.sub.1 denotes the first partial error syndrome, s.sub.2 denotes the second partial error syndrome and k denotes a specified value.

[0056] Here, k is not equal to 0; s.sub.1, s.sub.2and β may be determined as values of a Galois field. If the Galois field is GF(2.sup.m) with m>2, s.sub.1, s.sub.2 and β can be described as m-component binary vectors in their vector representation. Then, formation of exponentials is likewise determined in the corresponding Galois field.

[0057] In one option, all bit positions to be corrected

i.sub.0,i.sub.1,i.sub.2, . . . i.sub.n−1
are assigned pairwise different values
β.sub.i.sub.0,β.sub.i.sub.1, β.sub.i.sub.2, . . . , β.sub.i.sub.n−1
of the Galois field. If a is a generator or primitive element of the Galois field,

[00001]${\beta }_{i_0}={\alpha }^{i_0},{\beta }_{i_1}={\alpha }^{i_1},{\beta }_{i_2}={\alpha }^{i_2},\mathrm{.Math.}$${\beta }_{i_{n-1}}={\alpha }^{i_{n-1}}$

is defined in one option.

[0058] A correction value Δ.sub.r for the r-th bit can be determined as 1 if

(s.sub.1+α.sup.i.sup.r).sup.k=s.sub.2+α.sup.k.Math.i.sup.r   (1) applies, and a correction value Δ.sub.r can be determined as 0 if

(s.sub.1+α.sup.i.sup.r).sup.k≠s.sub.2+α.sup.k.Math.i.sup.r   (2)

applies.

[0059] An advantageous variant consists of the term s.sub.1+α.sup.i.sup.r being realized by virtue of the components of si in which air equals 1 being inverted and the components of s.sub.1 in which α.sup.i.sup.r equals 0 remaining unchanged.

[0060] The addition of s.sub.1 and α.sup.i.sup.r in the Galois field GF(2.sup.m), which corresponds to a component-by-component XOR operation on si and α.sup.i.sup.r in their vector representation, can be realized by means of inverters which invert the components of s.sub.1 in which air equals 1 and the components of s.sub.1 in which α.sup.i.sup.r equals 0 remain unchanged. Thus, to implement s.sub.1+α.sup.i.sup.r in this example, only inverters and no XOR gates are required.

[0061] Accordingly, the term s.sub.2+α.sup.k.Math.i.sup.r can be realized by virtue of the components of s.sub.2 in which α.sup.k.Math.i.sup.r equals 1 being inverted and the components of s.sub.2 in which α.sup.k.Math.i.sup.r equals 0 remaining unchanged.

[0062] A bit error-correcting code which can correct at least two bit errors can be used as an error code. By way of example, an appropriate BCH code may be used. An option consists of incorporating a parity (that is to say at least one parity bit) into the error detection.

[0063] An H-matrix

[00002]$\begin{array}{cc}H=\left(\begin{array}{c}{H}_1\\ H_2\end{array}\right)=\left(\begin{array}{cccccc}{\alpha }^{i_0}& {\alpha }^{i_1}& {\alpha }^{i_2}& {\alpha }^{i_3}& \mathrm{.Math.}& {\alpha }^{i_{n-1}}\\ {\alpha }^{3i_0}& {\alpha }^{3i_1}& {\alpha }^{3i_2}& {\alpha }^{3i_3}& \mathrm{.Math.}& {\alpha }^{3i_{n-1}}\end{array}\right)& \left(3\right)\end{array}$

may be used to describe a 2-bit error-correcting BCH code. The values α.sup.j are elements of the Galois field GF(2.sup.m) in their vector representation as m-component binary vectors, wherein the exponents should be interpreted modulo 2.sup.m−1. Furthermore, n≤2.sup.m−1 applies.

[0064] A 2-bit error-correcting and 3-bit error-detecting BCH code with included parity may be described by an H-matrix

[00003]$\begin{array}{cc}H=\left(\begin{array}{c}{H}_1\\ H_2\\ P\end{array}\right)=\left(\begin{array}{cccccc}{\alpha }^0& {\alpha }^1& {\alpha }^2& {\alpha }^3& \mathrm{.Math.}& {\alpha }^{n-1}\\ {\alpha }^0& {\alpha }^3& {\alpha }^6& {\alpha }^9& \mathrm{.Math.}& {\alpha }^{3.Math.\left(n-1\right)}\\ 1& 1& 1& 1& \mathrm{.Math.}& 1\end{array}\right)& \left(4\right)\end{array}$

for example. In this case, the following applies:

[00004]$i_0=0,i_1=1,i_2=2,\mathrm{.Math.}$$i_r=r,\mathrm{.Math.}$$i_{n-1}=n-1.$

If

[0065]
x′=x′.sub.0, . . . ,x′.sub.n−1

is a binary vector to be corrected (that is to say a bit sequence which might be erroneous), then the error syndrome s is determined as follows:

s=H.Math.x′  (5)

[0066] For an H matrix with

[00005]$H=\left(\begin{array}{c}{H}_1\\ H_2\end{array}\right)$

the first partial error syndrome s1 may be determined as

s.sub.1=H.sub.1.Math.x′  (6)

and the second partial error syndrome s2 may be determined as

s.sub.2=H.sub.2.Math.x′  (7)

with the matrix H.sub.2 also being referred to as matrix H.sub.3 and the partial error syndrome s.sub.2 also being referred to as partial error syndrome s.sub.3 in the case of a binary BCH code.

[0067] In the case of a 2-bit error, the partial error syndromes s.sub.1 and s.sub.2 of the error syndrome are determined as:

s.sub.1=α.sup.i+α.sup.j   (8)

s.sub.2=α.sup.3.Math.i+α.sup.3.Math.j   (9)

[0068] For the partial error syndrome

s.sub.P=[1, . . . , 1].Math.x′

the following applies in the case of a 2-bit error:

s.sub.P=1+1=0

[0069] For the i-th bit, the correction value Δ.sub.i for a 2-bit error is as follows:

[00006]$\begin{array}{cc}{\Delta }_i=\{\begin{array}{c}1\mathrm{for}{\left(s_1+{\alpha }^i\right)}^3=s_2+{\alpha }^{3.Math.i}\\ 0\mathrm{for}{\left(s_1+{\alpha }^i\right)}^3\ne s_2+{\alpha }^{3.Math.i}\end{array}& \left(10\right)\end{array}$

[0070] If a 2-bit error is present in bit positions i and j, then taking account of equations (8) and (9) above

s.sub.1+α.sup.i+α.sup.i+α.sup.j+α.sup.i=α.sup.j

s.sub.2+α.sup.3i=α.sup.3i+α.sup.3j+α.sup.3i=α.sup.3j

and hence

(s.sub.1+α.sup.i).sup.3=α.sup.3j=s.sub.2+α.sup.3i

with the correction value Δ.sub.i=1.

[0071] For r≠i,j, once again taking account of equations (8) and (9), the following applies:

s.sub.1+α.sup.r=α.sup.i+a.sup.j+α.sup.r

s.sub.2+α.sup.3r=α.sup.3i+α.sup.3j+α.sup.3r

and hence

(s.sub.1+α.sup.r).sup.3≠s.sub.2+α.sup.3r

with the correction value Δ.sub.i=0.

[0072] The bit positions

[00007]$i_0=0,i_1=1,i_2=2,\mathrm{.Math.}$$i_{n-1}=n-1$

are reversibly uniquely assigned the elements α.sup.0, α.sup.1, α.sup.2, α.sup.n−1 of the Galois field GF(2.sup.m) in their vector representation as m-component binary vectors, for example.

[0073] For the bit position i to be corrected, [0074] a first comparison value
(s.sub.1+α.sup.i).sup.3
is determined on the basis of the first partial error syndrome Si and the bit position i and [0075] a second comparison value
s.sub.2[α.sup.i].sup.3=s.sub.2+α.sup.3i
is determined on the basis of the second partial error syndrome s.sub.2 and the bit position i.

[0076] If the first and second comparison values correspond, Δ.sub.i=1 arises as correction value and the i-th bit position is corrected. If the two comparison values do not correspond, Δ.sub.i=0 arises as correction value and there is no correction at the i-th bit position.

[0077] For a 1-bit error at the error position j, the following applies:

s.sub.1=α.sup.j

s.sub.2=α.sup.3.Math.j

[0078] Hence, the first comparison value is determined as

(s.sub.1+α.sup.i).sup.3=(α.sup.j+α.sup.i).sup.3

and the second comparison value is determined as

(s.sub.1+α.sup.3.Math.i=α.sup.3.Math.j+α.sup.3.Math.i

for for a bit position i to be corrected. If the error position j and the bit position i to be corrected correspond (that is to say i=j), then the following applies:

(s.sub.1+α.sup.i).sup.3=(α.sup.i+α.sup.i).sup.3=0.sup.3=0=s.sub.2+α.sup.3.Math.i=α.sup.3.Math.i+α.sup.3.Math.i=0.

[0079] The first comparison value and the second comparison value are the same even in the case of the 1-bit error in position i and there is a correction of the bit position i.

[0080] If the error position j and the bit position i to be corrected do not correspond (that is to say i≠j), then the following applies:

(s.sub.1+α.sup.i).sup.3=(α.sup.j+α.sup.i).sup.3≠s.sub.2+α.sup.3.Math.i+α.sup.3.Math.j+α.sup.3.Math.i

[0081] In this case, the first comparison value and the second comparison value are not the same, and so there is no correction at the bit position i since the error is present at another bit position j.

[0082] A comparison of the first comparison value and of the second comparison value, which are each determined as m-component binary vectors, can be implemented for example by a component-by-component exclusive or operation (XOR operation) and a subsequent or operation (OR operation).

EXAMPLE: H-MATRIX WITH PARITY

[0083] A further example of an H-matrix of a code for 2-bit error correction and 3-bit error detection is as follows:

[00008]$\begin{array}{cc}H=\left(\begin{array}{c}{H}_1\\ H_{-1}\\ P\end{array}\right)=\left(\begin{array}{cccccc}{\alpha }^0& {\alpha }^1& {\alpha }^2& {\alpha }^3& \mathrm{.Math.}& {\alpha }^{n-1}\\ {\alpha }^0& {\alpha }^{-1}& {\alpha }^{-2}& {\alpha }^{-3}& \mathrm{.Math.}& {\alpha }^{-\left(n-1\right)}\\ 1& 1& 1& 1& \mathrm{.Math.}& 1\end{array}\right).& \left(11\right)\end{array}$

[0084] The partial error syndromes s.sub.1 and s.sub.2 of the error syndrome arise as follows for the 2-bit error:

s.sub.1=α.sup.i+α.sup.j   (12)

s.sub.2=α.sup.−i+α.sup.−j   (13)

[0085] The values α.sup.j again are elements of the Galois field GF(2.sup.m) in their vector representation as m-component binary vectors, wherein the exponents should be interpreted modulo 2.sup.m−1. Furthermore, n≤2.sup.m−1 applies.

[0086] For the i-th bit, the correction value Δ.sub.i for the 2-bit error is determined as follows:

[00009]$\begin{array}{cc}{\Delta }_i=\{\begin{array}{c}1\mathrm{for}{\left(s_1+{\alpha }^i\right)}^{-1}=s_2+{\alpha }^{-1}\\ 0\mathrm{for}{\left(s_1+{\alpha }^i\right)}^{-1}\ne s_2+{\alpha }^{-1}\end{array}& \left(14\right)\end{array}$

[0087] The first comparison value for the bit position i is

(s.sub.1+α.sup.i).sup.−1

and the second comparison value for this bit position is

s.sub.2+α.sup.−i

Further Exemplary Embodiments

[0088] FIG. 1 shows an exemplary diagram for r bit positions 0 to r−1 to be corrected.

[0089] An m-bit wide partial error syndrome Si is applied to an m-bit wide input 113, which is connected to the inputs of r first comparison value generators 11 to 13. The comparison value generators 11 to 13 are suited to determining a first comparison value per bit position on the basis of the partial error syndrome s.sub.1 and on the basis of the bit position.

[0090] An m-bit wide partial error syndrome s.sub.2 is applied to an m-bit wide input 114, which is connected to the inputs of r second comparison value generators 14 to 16. The comparison value generators 14 to 16 are suited to determining a second comparison value per bit position on the basis of the partial error syndrome s.sub.2 and on the basis of the bit position.

[0091] Now, a comparison of the first comparison value with the second comparison value is carried out for each bit position by means of a comparator. To this end, r comparators 17 to 19 are provided, the inputs of which are connected to the appropriate outputs of the comparison value generators.

[0092] A respective correction value Δ.sub.0 to Δ.sub.r −1 for the respective bit position is provided at the output of the comparator 17 to 19. By way of example, the correction value is 1 if the comparison value generators connected to the comparator supply the same output signals and the correction value is 0 if the comparison value generators supply unequal output signals.

[0093] The output of the respective comparator 17 to 19 is connected to the input of an XOR gate 110 to 112. A possibly erroneous bit x.sub.0.sup.1 to x.sub.r−1.sup.1 is applied to the other input of the respective XOR gate 110 to 112. A corrected bit

[00010]$x_0^{\mathrm{cor}}=x_0^{\prime }+{\Delta }_0,\mathrm{.Math.}$$x_{r-1}^{\mathrm{cor}}=x_{r-1}^{\prime }+{\Delta }_{r-1}$

is provided at the output of the XOR gate 110 to 112. Here, + denotes addition modulo 2.

[0094] In this case, a bit is referred to as corrected bit if a correction value has been added to a possibly erroneous bit. Here, the correction value can equal 1 if the bit was erroneous and the correction value can equal 0 if the bit was not erroneous. Independently of whether or not the bit was erroneous, the resultant bit following the addition of the correction value is referred to as corrected bit in this case. The addition is implemented modulo 2 and can be realized by an XOR operation.

[0095] As already explained above, the determination of the corrected bit is implemented for all bit positions. By way of example, the following applies to the bit position 0: The output of the comparison value generator 11 is connected to the first input of the comparator 17 and the output of the comparison value generator 14 is connected to the second input of the comparator 17. The output of the comparator 17 supplies the correction value Δ.sub.0 to the first input of the XOR gate 110, at the second input of which the possibly erroneous bit x′.sub.0 is applied. At its output, the XOR gate 110 consequently supplies the corrected bit x.sub.0.sup.corr. This is implemented accordingly for the further bit positions 1 to r−1.

[0096] FIG. 2 shows an exemplary arrangement on the basis of the representation shown in FIG. 1. An AND gate 21 to 23 is arranged between the output of the respective comparator 17 to 19. The first input of the AND gate 21 to 23 is connected to the output of the comparator 17 to 19 and the second input of the AND gate 21 to 23 is connected to an image error coding signal 201. The output of the AND gate 21 to 23 is connected to the XOR gate 110 to 112.

[0097] The arrangement shown in FIG. 2 once again applies per bit position. By way of example, for the bit position 0, the output of the comparator 17 is connected to the first input of the AND gate 21. The second input of the AND gate is connected to the bit error coding signal 201 The output of the AND gate 21 is connected to the first input of the XOR gate 110. These explanations apply accordingly to the further bit positions 1 to r−1, with the bit error coding signal 201 being applied to all second inputs of the AND gates 21 to 23.

[0098] The bit error coding signal 201 is for example a binary value 1 if a 1-bit error or a 2-bit error was determined on account of the error syndrome, and a binary value 0 if the error syndrome equals 0, and hence no errors are indicated by the error syndrome. Consequently, what follows from the link to the respective AND gate 21 to 23 is that no change of the value of the bit x′.sub.0 to x′.sub.r−1 applied to the XOR gate 110 to 112 is implemented, that is to say no correction is carried out.

[0099] FIG. 3 shows an exemplary configuration of the comparison value generators 11 to 13 of FIG. 1.

[0100] By way of example, a 2-bit error-correcting BCH code with an H-matrix as per equation (4) is used. The possibly to be corrected bit positions are the bit positions 0 to r−1.

[0101] Each comparison value generator 11 to 13 comprises a series connection of an adding member 31 to 33 and a third power generator 34 to 36.

[0102] The structure of the comparison value generator 11 for the bit position 0 can be described as follows: The comparison value generator 11 comprises the series connection of the adding member 31 and the third power generator 34. The adding member 31 facilitates a component-by-component XOR operation on the first partial error syndrome s.sub.1 and α.sup.0 in its vector representation. It is an option to realize the XOR operation on the partial error syndrome s.sub.1 and α.sup.0 by virtue of inverting those components of s.sub.1 where α.sup.0 equals 1 and leaving the components of s.sub.1 in which α.sup.0 equals 0 unchanged. In a Galois field GF(2.sup.m)

[00011]${\alpha }^0=\left(\underset{\underset{m}{︸}}{0\mathrm{.Math.01}}\right),$

and so the first component of s.sub.1 is inverted while all other components of s.sub.1 remain unchanged.

[0103] The third power generator 34 is provided to form and output, in the Galois field GF(2.sup.m), the third power (s.sub.1+α.sup.0).sup.3 of the value (s.sub.1+α.sup.0) applied to its input. The third power generator 34 can be realized as a combinational circuit.

[0104] This is implemented accordingly for the further bit positions 1 to r−1, wherein the respective adding member correspondingly carries out an addition with α.sup.1 to α.sup.r−1.

[0105] FIG. 4 shows an exemplary configuration of the comparison value generators 14 to 16 of FIG. 1.

[0106] Each comparison value generator 14 to 16 comprises an adding member 41 to 43.

[0107] The structure of the comparison value generator 14 for the bit position 0 can be described as follows: The comparison value generator 14 comprises the adding member 41 in order to XOR-link, component-by-component, the partial error syndrome s.sub.2 and α.sup.0 functionally in its vector representation. It is an option to realize the XOR operation on the partial error syndrome s.sub.2 and α.sup.0 by virtue of inverting those components of s.sub.2 where α.sup.0 equals 1 and leaving the components of s.sub.2 where α.sup.0 equals 0 unchanged.

[0108] This is implemented accordingly for the further bit positions j (with j=1, . . . , r−1), wherein the respective adding member accordingly carries out an addition with α.sup.3j.

The Third Power Generator

[0109] A third power generator in a Galois field GF(2.sup.m) can be realized as a combinational circuit with m binary inputs and m binary outputs. It is one option to describe the combinational functionality by a value table and to realize the value table as a circuit using a synthesis tool.

[0110] For i=0, . . . , 2.sup.m−1, the input value α.sup.i in its vector representation as a m-component binary vector is assigned the corresponding output value α.sup.3.Math.i in such a value table. The input value

[00012]$\left(\underset{\underset{m}{︸}}{0\mathrm{.Math.0}}\right)$

can be assigned the output value

[00013]$\left(\underset{\underset{m}{︸}}{0\mathrm{.Math.0}}\right).$

[0111] The exponents should be interpreted modulo 2.sup.m−1 and a is a generator of the Galois field.

[0112] For elucidating purposes, a Galois field GF(2.sup.3) with the modular polynomial

M(x)=x.sup.3+x+1

is considered, for which the elements α.sup.0 to α.sup.6 are represented in their vector representation in the following table “Exponential representation and vector representation”, wherein the element 0 is shown as 000:

TABLE-US-00001 Exponential representation Vector representation 0 000 α.sup.0 001 α.sup.1 010 α.sup.2 100 α.sup.3 011 α.sup.4 110 α.sup.5 111 α.sup.6 101

[0113] Value tables for Galois fields up to GF(2.sup.10) are shown in [Lin, S.; Costello, D.: Error Control Coding, Prentice Hall, 1983, pages 561 to 577] for example.

[0114] The third power generator outputs α.sup.3.Math.i on the basis of an input of α.sup.i, wherein the exponents should be interpreted modulo 2.sup.3−1=7 in this case. That is to say, the following relationships arise between input and output:

TABLE-US-00002 Input Output α.sup.0 α.sup.0 α.sup.1 α.sup.3 α.sup.2 α.sup.6 α.sup.3 α.sup.2 α.sup.4 α.sup.5 α.sup.5 α.sup.1 α.sup.6 α.sup.4

[0115] A corresponding binary value table on the basis of the vector representations of the values α.sup.i shown above is elucidated by the following table of the third power generator in GF(2.sup.3):

TABLE-US-00003 Input value Output value 000 000 001 001 010 011 011 100 100 101 101 110 110 111 111 010

Example: Comparison Value Generator with Galois Field Inverter

[0116] FIG. 5 shows an exemplary alternative configuration of the comparison value generators 11 to 13 of FIG. 1.

[0117] A 2-bit error-correcting code with an H-matrix as per equation (11) is used in exemplary fashion. The bit positions possibly to be corrected are the bit positions 0 to r−1.

[0118] Each comparison value generator 11 to 13 comprises a series connection of an adding member 51 to 53 and a Galois field inverter 54 to 56.

[0119] The structure of the comparison value generator 11 for the bit position 0 can be described as follows: The comparison value generator 11 comprises the series connection of the adding member 51 and the Galois field inverter 54. The adding member 51 facilitates a component-by-component XOR operation on the first partial error syndrome s.sub.1 and α.sup.0 in its vector representation. The Galois field inverter 54 is provided to form and output, in the Galois field GF(2.sup.m), (s.sub.1+α.sup.0).sup.−1 on the basis of the value (s.sub.1+α.sup.0) applied to its input. The Galois field inverter 54 can be realized as a combinational circuit.

[0120] This is implemented accordingly for the further bit positions 1 to r−1, wherein the respective adding member correspondingly carries out an addition with α.sup.1 to α.sup.r−1.

[0121] FIG. 6 shows an exemplary configuration of the comparison value generators 14 to 16 of FIG. 1.

[0122] Each comparison value generator 14 to 16 comprises an adding member 61 to 63.

[0123] The structure of the comparison value generator 14 for the bit position 0 can be described as follows: The comparison value generator 14 comprises the adding member 61 in order to XOR-link, component-by-component, the partial error syndrome s.sub.2 and α.sup.0 functionally in its vector representation.

[0124] This is implemented accordingly for the further bit positions j (with j=1, . . . , r−1), wherein the respective adding member correspondingly carries out an addition with α.sup.j.

[0125] The Galois field inverter in a Galois field GF(2.sup.m) can be realized as a combinational circuit with m binary inputs and m binary outputs. It is one option to describe the combinational functionality thereof by a value table and to realize the value table as a circuit using a synthesis tool.

[0126] For i=0, . . . ,2.sup.m−1, the input value α.sup.i in its vector representation as a m-component binary vector is assigned the corresponding output value α.sup.−i in such a value table. The input value

[00014]$\left(\underset{\underset{m}{︸}}{0\mathrm{.Math.0}}\right)$

can be assigned the output value

[00015]$\left(\underset{\underset{m}{︸}}{0\mathrm{.Math.0}}\right)$

[0127] The exponents should be interpreted modulo 2.sup.m−1 and α is a generator of the Galois field. Furthermore, α.sup.0=α.sup.−0 applies.

[0128] For elucidating purposes, the Galois field GF(2.sup.3) with the modular polynomial

M(x)=x.sup.3+x+1

is considered, for which the elements α.sup.0 to α.sup.6 are represented in the table labeled “Exponential representation and vector representation” above.

[0129] The Galois field inverter outputs α.sup.0 when α.sup.0 is input, and outputs α.sup.7−i when α.sup.i is input, wherein the exponents should be interpreted modulo 2.sup.3−1=7 in this case. That is to say, the following applies:

TABLE-US-00004 Input Output α.sup.0 α.sup.0 α.sup.1 α.sup.6 α.sup.2 α.sup.5 α.sup.3 α.sup.4 α.sup.4 α.sup.3 α.sup.5 α.sup.2 α.sup.6 α.sup.1

[0130] A corresponding binary value table on the basis of the vector representations of the values α.sup.i shown above is elucidated by the following table of the Galois field inverter in GF(2.sup.3):

TABLE-US-00005 Input value Output value 000 000 001 001 010 101 011 110 100 111 101 010 110 011 111 100

[0131] Fast correction of 3-bit errors

[0132] A fast correction of 3-bit errors is presented below in exemplary fashion. To this end, a 3-bit error-correcting BCH code may be used.

[0133] A 3-bit error-correcting BCH code may be described by an H-matrix

[00016]$\begin{array}{cc}H=\left(\begin{array}{c}{H}_1\\ H_2\\ H_3\end{array}\right)=\left(\begin{array}{cccccc}{\alpha }^{i_0}& {\alpha }^{i_1}& {\alpha }^{i_2}& {\alpha }^{i_3}& \mathrm{.Math.}& {\alpha }^{i_{n-1}}\\ {\alpha }^{3i_0}& {\alpha }^{3i_1}& {\alpha }^{3i_2}& {\alpha }^{3i_3}& \mathrm{.Math.}& {\alpha }^{3i_{n-1}}\\ {\alpha }^{5i_0}& {\alpha }^{5i_1}& {\alpha }^{5i_2}& {\alpha }^{5i_3}& \mathrm{.Math.}& {\alpha }^{5i_{n-1}}\end{array}\right)& \left(15\right)\end{array}$

[0134] By way of example, the values a′ are elements of the Galois field GF(2.sup.m) in their vector representation as m-component binary vectors, wherein the exponents should be interpreted modulo (2.sup.m−1). The following apply: n≤2.sup.m−1 and m>2.

[0135] Additionally, a 3-bit error-correcting BCH code may be described by an H-matrix:

[00017]$\begin{array}{cc}H=\left(\begin{array}{c}{H}_1\\ H_2\\ H_3\end{array}\right)=\left(\begin{array}{cccccc}{\alpha }^0& {\alpha }^1& {\alpha }^2& {\alpha }^3& ...& {\alpha }^{n-1}\\ {\alpha }^0& {\alpha }^3& {\alpha }^6& {\alpha }^9& ...& {\alpha }^{3.Math.\left(n-1\right)}\\ {\alpha }^0& {\alpha }^5& {\alpha }^{10}& {\alpha }^{15}& ...& {\alpha }^{5.Math.\left(n-1\right)}\end{array}\right)& \left(16\right)\end{array}$

[0136] In this case, the following apply:

[00018]$\begin{array}{c}{i}_0=0,\\ i_1=1,\\ i_2=2,\\ ...\\ i_r=r,\\ \mathrm{.Math.}\\ i_{n-1}=n-1\end{array}$

If

[0137]
x′=x′.sub.0, . . . , x′.sub.n−1

is a binary vector to be corrected, then the error syndrome s is determined as

s=H.Math.x′  (17)

[0138] For the H-matrix with

[00019]$H=\left(\begin{array}{c}{H}_1\\ H_2\\ H_3\end{array}\right)$

the first partial error syndrome s.sub.1 can be determined as

s.sub.1=H.sub.1.Math.x′  (18)

the second partial error syndrome s.sub.2 can be determined as

s.sub.2=H.sub.2.Math.x′  (19)

and the third partial error syndrome s.sub.3 can be determined as

s.sub.x=H.sub.3.Math.x′  (20)

[0139] In the case of a binary BCH code, the matrix H.sub.2 can be referred to as matrix H.sub.3, the partial error syndrome s.sub.2 can be referred to as partial error syndrome s.sub.3, the matrix H.sub.3 can be referred to as matrix H.sub.5 and the partial error syndrome s.sub.3 can be referred to as partial error syndrome s.sub.5.

[0140] While two partial error syndromes, for example the partial error syndromes s.sub.1 and s.sub.2, are used for the correction of a 2-bit error, the partial error syndrome s.sub.3 is additionally used to correct a 3-bit error.

[0141] One option is to use the parity of bits for error detection and/or error correction. A 3-bit error-correcting BCH code with parity can be described by an H-matrix.

[00020]$\begin{array}{cc}H=\left(\begin{array}{c}{H}_1\\ H_2\\ H_3\\ H_P\end{array}\right)=\left(\begin{array}{cccccc}{\alpha }^{i_0}& {\alpha }^{i_1}& {\alpha }^{i_2}& {\alpha }^{i_3}& ...& {\alpha }^{i_{n-1}}\\ {\alpha }^{3i_0}& {\alpha }^{3i_1}& {\alpha }^{3i_2}& {\alpha }^{3i_3}& ...& {\alpha }^{3i_{n-1}}\\ {\alpha }^{5i_0}& {\alpha }^{5i_1}& {\alpha }^{5i_2}& {\alpha }^{5i_3}& ...& {\alpha }^{5i_{n-1}}\\ 1& 1& 1& 1& ...& 1\end{array}\right)& \left(21\right)\end{array}$

[0142] where H.sub.P denotes a parity matrix. Alternatively, a 3-bit error-correcting BCH code with parity may also be described by the H-matrix

[00021]$\begin{array}{cc}H=\left(\begin{array}{c}{H}_1\\ H_2\\ H_3\\ H_P\end{array}\right)=\left(\begin{array}{cccccc}{\alpha }^0& {\alpha }^1& {\alpha }^2& {\alpha }^3& ...& {\alpha }^{n-1}\\ {\alpha }^0& {\alpha }^3& {\alpha }^6& {\alpha }^9& ...& {\alpha }^{3.Math.\left(n-1\right)}\\ {\alpha }^0& {\alpha }^5& {\alpha }^{10}& {\alpha }^{15}& ...& {\alpha }^{5.Math.\left(n-1\right)}\\ 1& 1& 1& 1& ...& 1\end{array}\right)& \left(22\right)\end{array}$

[0143] In this respect, reference is made to equations (15) and (16) above, which were augmented by the matrix H.sub.P.

[0144] With the binary vector x′ to be corrected, the error syndrome s arises as

s=H.Math.x′  (23)

[0145] With

[00022]$H=\left(\begin{array}{c}{H}_1\\ H_2\\ H_3\\ H_P\end{array}\right)$

the following follows for the partial error syndromes s1, s2, s3 and s4:

s.sub.1=H.sub.1.Math.x′

s.sub.2=H.sub.2.Math.x′

s.sub.3=H.sub.3.Math.x′

s.sub.4=s.sub.P=H.sub.P.Math.x′=x.sub.0+x.sub.1+. . . +x.sub.n−1.

[0146] In this case, “+” denotes addition modulo 2, corresponding to an XOR operation. The partial error syndrome s.sub.P is the parity of the bits x.sub.0 to x.sub.n−1.

[0147] The partial error syndromes s.sub.1, s.sub.2 and s.sub.3 of the error syndrome arise for the 3-bit error in bit positions i, j and k as

s.sub.1=α.sup.i+α.sup.j+α.sup.k   (24)

s.sub.2=α.sup.3iα.sup.3jα.sup.3k   (25)

s.sub.3=α.sup.5i+α.sup.5j+α.sup.5k   (26)

[0148] The bit positions i, j and k may also be described, for example, by the values a.sup.i, a.sup.j, a.sup.k, by elements of the Galois field GF(2.sup.m), by the binary values x′.sub.i, x′.sub.j, x′.sub.k to be corrected or by i, j and k.

[0149] For a 3-bit error in bit positions i, j and k, the following applies:

(s.sub.1+α.sup.i).sup.3=s.sub.2+α.sup.3i+α.sup.j.Math.α.sup.k)α.sup.j+α.sup.k)   (27)

[0150] This emerges by recalculation. In this case, α.sup.j.Math.α.sup.k is the product of the elements α.sup.j and α.sup.k in the Galois field GF(2.sup.m) and α.sup.j+α.sup.k denotes their sum in the Galois field, which may be determined for example in the vector representation of α.sup.j and α.sup.k as m-component of binary vectors by the component-by-component XOR operation on these binary vectors.

[0151] In the case of a 3-bit error in bit positions a.sup.i, α.sup.j and α.sup.k, the partial error syndromes s.sub.1 and s.sub.2 are determined by equations (24) and (25).

[0152] With

s.sub.1+α.sup.i=α.sup.j+α.sup.k   (28)

s.sub.2+α.sup.3i=α.sup.3j+α.sup.3k   (29)

it is possible to verify by insertion into equation (27) that:

[00023]$\begin{array}{c}{\left(s_1+{\alpha }^i\right)}^3={\left(s_1+{\alpha }^i\right)}^2.Math.\left(s_1+{\alpha }^i\right)=\\ ={\left({\alpha }^j+{\alpha }^k\right)}^2.Math.\left({\alpha }^j+{\alpha }^k\right)=\\ =\left({\alpha }^{2j}+{\alpha }^j.Math.{\alpha }^k+{\alpha }^j.Math.{\alpha }^k+{\alpha }^{2k}\right).Math.\left({\alpha }^j+{\alpha }^k\right)=\\ =\left({\alpha }^{2j}+{\alpha }^{2k}\right).Math.\left({\alpha }^j+{\alpha }^k\right)=\\ ={\alpha }^{3j}+{\alpha }^{2j}.Math.{\alpha }^k+{\alpha }^{2k}.Math.{\alpha }^j+{\alpha }^{3k}=\\ ={\alpha }^{3j}+{\alpha }^{3k}+{\alpha }^j.Math.{\alpha }^k.Math.\left({\alpha }^j+{\alpha }^k\right)=\\ =s_2+{\alpha }^{3i}+{\alpha }^j.Math.{\alpha }^k.Math.\left({\alpha }^j+{\alpha }^k\right).\end{array}$

[0153] In this case, it should be observed that addition modulo 2 of two equal values yields 0.

[0154] In the case of a 3-bit error in bit positions i, j and k, a comparison of a first value (s.sub.1+α.sup.i).sup.3 with a second value s.sub.2+α.sup.3i yields the specified value α.sup.jα.sup.k(α.sup.j+α.sup.k) if an error is corrected in the bit position i. If (s.sub.1+α.sup.i).sup.3 and s.sub.2+α.sup.3i differ by a different value than α.sup.jα.sup.k(α.sup.j+α.sup.k), there is no correction.

[0155] To be able to determine for the i-th bit position whether a 3-bit error, where the i-bit is erroneous and corrected, is present, for example the value

α.sup.jα.sup.k(α.sup.j+α.sup.k)   (30)

is determined on the basis of the partial error syndromes and only the bit position i. The two further erroneous bit positions j and k need not be determined for the correction of the i-th bit position.

[0156] The value (α.sup.j+α.sup.k) from equation (30) of the two further erroneous bit positions can be determined on the basis of the i-th bit position α.sup.i and on the basis of the partial error syndrome s.sub.1:

α.sup.j+α.sup.k=s.sub.1+α.sup.i

[0157] This follows immediately from equation (24).

[0158] The value α.sup.jα.sup.k from equation (30) can be represented on the basis of the i-th bit position using the symmetric function σ.sub.2

σ.sub.2=α.sup.iα.sup.j+α.sup.iα.sup.k+α.sup.jα.sup.k   (31)

as

[00024]$\begin{array}{cc}\begin{array}{c}{\alpha }^j{\alpha }^k={\sigma }_2+{\alpha }^i{\alpha }^j+{\alpha }^i{\alpha }^k=\\ ={\sigma }_2+{\alpha }^i.Math.\left({\alpha }^j+{\alpha }^k\right)=\\ ={\sigma }_2+{\alpha }^i.Math.\left(s_1+{\alpha }^i\right)\end{array}& \left(32\right)\end{array}$

[0159] Hence, the following arises from equation (27) in conjunction with equation (32) and equation (28):

(s.sub.1+α.sup.i).sup.3=s.sub.2+α.sup.3i+(σ.sub.2+α.sup.i(s.sub.1+α.sup.i)).Math.(s.sub.1+α.sup.i)   (33)

[0160] For σ.sub.2, the following furthermore emerges by means of the partial error syndromes s.sub.1, s.sub.2 and s.sub.3 as per equations (24), (25) and (26) which in turn are symmetric functions of the bit positions to be corrected:

[00025]${\sigma }_2=\frac{s_1^2.Math.s_2+s_3}{s_1^3+s_2}.$

[0161] This can be verified by insertion into equations (24), (25) and 26.

[0162] Consequently, a common value of the symmetric function σ.sub.2, which is determined by the syndrome components s.sub.1, s.sub.2 and s.sub.3, can be used for all bit positions to be corrected.

[0163] By way of example, a binary correction value Δ.sub.i for the i-th bit position in the case of a 3-bit error is determinable as per

[00026]$\begin{array}{cc}{\Delta }_i=1\mathrm{for}{\left(s_1+{\alpha }^i\right)}^3=s_2+{\alpha }^{3i}+\left({\sigma }_2+{\alpha }^i\left(s_1+{\alpha }^i\right)\right)\left(s_1+{\alpha }^i\right),{\Delta }_i=0\mathrm{for}{\left(s_1+{\alpha }^i\right)}^3\ne s_2+{\alpha }^{3i}+\left({\sigma }_2+{\alpha }^i\left(s_1+{\alpha }^i\right)\right)\left(s_1+{\alpha }^i\right).& \left(34\right)\end{array}$

[0164] A first comparison value (s.sub.1+α.sup.i).sup.3 is determined on the basis of the bit position i and the first partial error syndrome s.sub.1. A second comparison value s.sub.2+α.sup.3i is determined on the basis of the bit position i and the second partial error syndrome s.sub.2.

[0165] The bit position i is corrected with Δ.sub.i=1 if the comparison of the first comparison value to the second comparison value assumes a specified value, in this case the specified value

(α.sup.jα.sup.k)(α.sup.j+α.sup.k)=(σ.sub.2α.sup.i(s.sub.1+α.sup.i))(s.sub.1+60 .sup.i)   (35)

[0166] The bit position i is not corrected, or is corrected with Δ.sub.i=0, if the comparison of the first comparison value to the second comparison value does not assume the specified value as per equation (35).

[0167] An advantage of the method presented here for forming a correction value for the i-th bit is, for example, that values that depend on the syndrome components can be formed and provided only once (e.g., centrally). Thus, for example the value

s.sub.1σ.sub.2

can be determined once and can be provided for a plurality of bit positions. Advantageously, the formation of the term s.sub.1+α.sup.i does not require a component-by-component XOR operation. Instead, inverters can be used in simplified fashion to this end: The components of s.sub.1 in which α.sup.i equals 1 are inverted; components in which α.sup.i equals 0 remain unchanged. Corresponding explanations apply to the addition of α.sup.3i.

[0168] Likewise, the value

s.sub.1.sup.2+σ.sub.2

need only be formed once and can be provided as an m-bit wide value for all bit positions to be corrected. In each bit position i to be corrected, all that still is required is a multiplication by the constant α.sup.i. For the i-th bit position, the value s.sub.1+α.sup.i can advantageously be realized by inverting the bits of the m-bit vector s.sub.1 in which the bits of α.sup.i equal 1. It is consequently possible to dispense with a component-by-component XOR operation, significantly reducing the outlay.

[0169] In an alternative embodiment, the rewritten form

(σ.sub.2+α.sup.i(s.sub.1+α.sup.i))(s.sub.1+α.sup.i)=s.sub.1σ.sub.2+α.sup.i(s.sub.1.sup.2+σ.sub.2)+α.sup.3i

can be used. What then follows from equation (34) is that

[00027]$\begin{array}{cc}{\Delta }_i=1\mathrm{for}{\left(s_1+{\alpha }^i\right)}^3=s_2+{\alpha }^{3i}+s_1{\sigma }_2+{\alpha }^i\left(s_1^2+{\sigma }_2\right)+{\alpha }^{3i},{\Delta }_i=0\mathrm{for}{\left(s_1+{\alpha }^i\right)}^3\ne s_2+{\alpha }^{3i}+s_1{\sigma }_2+{\alpha }^i\left(s_1^2+{\sigma }_2\right)+{\alpha }^{3i}.& \left(36\right)\end{array}$

[0170] A further option consists, in equation (27), of representing the value α.sup.j.Math.α.sup.k on the basis of the i-th bit position using a symmetric function σ.sub.3

σ.sub.3=α.sup.iα.sup.jα.sup.k   (37)

as

α.sup.jα.sup.k=σ.sub.2.Math.α.sup.−i   (38)

[0171] The following then emerges from equation (27):

(s.sub.1+α.sup.i).sup.3=s.sub.2+α.sup.3i+σ.sub.3.Math.(s.sub.1+α.sup.i).Math.α.sup.−i   (39)

[0172] Using the partial error syndromes s.sub.1, s.sub.2and the symmetric function σ.sub.2, the symmetric function σ.sub.3 can be represented by:

σ.sub.3=s.sub.1.sup.3+s.sub.2s.sub.1.Math.σ.sub.2   (40)

[0173] This can be verified by inserting the values s.sub.1, s.sub.2 and σ.sub.2.

[0174] If 1-bit errors, 2-bit errors and 3-bit errors should be corrected, it is an option, if a 1-bit error or a 2-bit error occurs, to determine a correction value Δ.sub.i for the i-th bit such that

[00028]$\begin{array}{cc}{\Delta }_i=1\mathrm{for}{\left(s_1+{\alpha }^i\right)}^3=s_2+{\alpha }^{3i}{\Delta }_i=0\mathrm{for}{\left(s_1+{\alpha }^i\right)}^3\ne s_2+{\alpha }^{3i}& \left(41\right)\end{array}$

applies, and that equation (34), for example, applies in the case of a 3-bit error.

[0175] In the case of a 1-bit error or a 2-bit error, a comparison value between

(s.sub.1+α.sup.i).sup.3

and

s.sub.2+α.sup.3i

is constant and identical for all bit positions. In the case of a 3-bit error, this comparison value is determined by the bit position i, and the values of the symmetric function σ.sub.2 and the component of the error syndrome s.sub.1, which are the same for all bit positions, because, in accordance with the explanations above, the additional term (σ.sub.2+α.sup.i(s.sub.1+α.sup.i))(s.sub.1+α.sup.i) is also added.

[0176] Even if a 2-bit error is present, the correction value Δ.sub.i for the i-th bit can be determined according to equation (34), because for the 2-bit error in bit positions i and j with

[00029]${\sigma }_2=\frac{s_3+s_1^2{s}_3}{s_1^3+s_2},s_1={\alpha }^i+{\alpha }^j,s_2={\alpha }^{3i}+{\alpha }^{3j},s_3={\alpha }^{5i}+{\alpha }^{5j}$

σ.sub.2 is determined as
σ.sub.2=α.sup.i.Math.α.sup.j

[0177] Hence,

(σ.sub.2+α.sup.i(s.sub.1+α.sup.i))(s.sub.1+α.sup.i)=0

and in the case of a 2-bit error, the correction value is determinable by

(s.sub.1+α.sup.i).sup.3+s.sub.2+α.sup.3i

as required.

[0178] Whether there is no error or whether there is a 1-bit error or whether there is a 2-bit error or whether there is a 3-bit error can be determined using the error syndrome components s.sub.1, s.sub.2, s.sub.3 and s.sub.4=s.sub.P: [0179] If no error is present, all error syndrome components s.sub.1, s.sub.2, s.sub.3 and s.sub.4=s.sub.P are equal to 0. Otherwise an error is present. [0180] If a 1-bit error is present, s.sub.1.sup.3=s.sub.2 and s.sub.P=1 then and applies. [0181] If a 2-bit error is present, s.sub.P=0 then s.sub.1.sup.3≠s.sub.2 and applies. [0182] If a 3-bit error is present, s.sub.P=1 and s.sub.1.sup.3≠s.sub.2 applies.

[0183] Even though the invention was illustrated more closely and described in detail by the at least one exemplary embodiment shown, the invention is not restricted thereto, and other variations can be derived herefrom by a person skilled in the art without departing from the scope of protection of the invention.