Abstract:
In order to simplify a hardware arrangement of a so-called Chien&#39;s searching circuit, an error location counter is provided. The error location counter counts up in response to each execution for detecting an error in a code word. If an error is detected in the code word, the content of the error location counter is latched by a suitable storage means and then applied to an external circuit.

Description:
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention relates generally to a method and arrangement of ascertaining error locations and the corresponding error patterns of a decoded code word(s) in a digital data communications system, and more specifically to such a method and arrangement using a so-called Chien&#39;s searching algorithm. 
     2. Description of Prior Art 
     Before turning to the present invention it is deemed advantageous to briefly discuss prior art with reference to FIGS. 1 and 2. 
     FIG. 1 is a block diagram schematically showing an overall error correcting arrangement which follows a suitable decoder such as a Viterbi decoder. 
     Code words, outputted from the above mentioned decoder, are successively applied to a syndrome calculator 10 and a memory 12. The memory 12 is to delay the code words applied thereto by a predetermined time period in order to compensate for delay of the code words induced while processed by blocks 10, 14, 16 and 18. 
     The syndrome calculator 10 produces syndromes from the code words applied thereto. A polynomial generator 14 is provided to issue two polynomials: one is an error-locator polynomial and the other is an error numerical value polynomial. These two polynomials wall will be given later. 
     The aforesaid two polynomials, obtained at the block 14, are applied to the next stage, viz., an error location and error pattern determiner 16 which is directly concerned with the present invention. 
     The block 16 generates error location data and error pattern data which are applied to an error corrector 20 via an error data check circuit 18. The error corrector 20 implements error correction included in the code words applied thereto from the memory 12 using the error location data and the error pattern applied thereto from the data check circuit 18. Thus, error corrected code words can be derived from the error corrector 20. 
     The above mentioned error correction using the syndrome scheme is well known in the art. For further details reference should be made to a book entitled &#34;Error Control Coding&#34; by Shu Lin, et al., published 1983 by Prentice-Hall, Inc. Englewood Cliffs, N.J. 07632, merely by way of example. 
     As is known in the art, a so-called Chien&#39;s searching algorithm has proven suited for error correction of code words in Galois field GF(2 m ) (m is a positive integer). In more specific terms, the Chien&#39;s searching algorithm is to determine error locations and the corresponding error patterns using an error-locator polynomial (depicted by σ(X)) and an error numerical value polynomial (depicted by p(X)) both derived from Euclid&#39;s algorithm. The root of σ(X)=0 indicates an error location. Therefore, let α be a primitive element in GF(2 m ). Briefly speaking, the Chien&#39;s searching circuit is arranged such as to successively replace &#34;X&#34; with α 0 , α -1 , α -2 , . . . and check to see if outputs of an exclusive-or thereof assume zeros. 
     FIG. 2 is a block diagram schematically showing a known Chien&#39;s searching circuit which determines error locations and the corresponding error patterns of the code words applied thereto. The error location polynomial σ(X) and the error numerical value polynomial p(x) are respectively given by 
     
         σ(X)=σ.sub.t X.sup.t +σ.sub.t-1 X.sup.t-1 +. . . +σ.sub.2 X.sup.2 +σ.sub.1 X+σ.sub.0     ( 1) 
    
     
         p(X)=p.sub.t-1 X.sup.t-1 +. . . +p.sub.2 X.sup.2 +p.sub.1 X.sup.1 +p.sub.0( 2) 
    
     Further, the number of the maximum correctable symbols is denoted by &#34;t&#34;. 
     In the present disclosure, term &#34;symbol&#34; implies a component which forms part of a code word. In other words, a code word consists of a plurality of symbols each of which has a predetermined bit length. 
     In FIG. 2, error location data (α -1 )(i=0, 1, 2, . . . ) is obtained using the following blocks: registers Rl-Rt, selectors S1-St, multipliers M1-Mt, an exclusive-or gate E1, an all-zero detector 30, a power index counter 31 and a index-vector converter 32. It is assumed, merely for the sake of simplifying the descriptions, that the multipliers M1, M2, . . . , M(t-1), and Mt are respectively provided with registers (not shown) for storing α -1 , α -2 , . . . , α 1-t , and α -t . 
     On the other hand, the arrangement for obtaining the corresponding error pattern data (e i ) includes, two exclusive-or gates E2 und E3, multipliers MA0-MA(t-1) and MB0-MB(t-1), and an error pattern calculator 34, in addition to the above mentioned blocks R1-Rt, S1-St, and M1-Mt. As in the above, it is assumed that the multipliers MA0, MA1, MA2, . . . , and MA(t-1) are respectively provided with register (not shown) for storing σ 0   -1 , σ 1   -1 , σ 2   -1 , . . . , and σ t-1   -I . In the similar manner, it is assumed that he multipliers MB0, MB1, MB2, . . . , and MB(t-1) are respectively provided with registers (not shown) for storing p 0 , p 1 , p 2 , . . . , p t-1 . 
     Prior to initiating the operations of the FIG. 2 arrangement, the multipliers M1, M2, . . . , M(t-1), and Mt store respectively α -1 , α -2 , . . . , α l-t  and α -t  in the corresponding registers (not shown) thereof. Further, the multipliers MA0, MA1, MA2, . . . , and MA(t-1) store respectively σ 0   -1 , σ 1   -1 , σ 2   -1 , . . . , and σ t-1   -1  in the corresponding registers (not shown) thereof. Similarly, the multipliers MB0, MB1, MB2, . . . , and MB(t-1) store respectively P0, P1, P2, . . . , P t-1  within the corresponding registers (not shown) thereof. 
     Firstly, in order to replace X of Equation (1) with α 0  (viz., i=0), the coefficients σ 0 , σ 1 , σ 2 , . . . , σ t-1 , and σ t  are applied to the arrangement of FIG. 2 from the polynomial generator 14. In more specific terms, σ 0  is directly applied to the exclusive-or gate E1, while σ 1 , σ 2 , . . . , σ t-1 , and σ t  are respectively applied to the exclusive-or gate E1 via the selectors S1, S2, . . . , S(t-1), and St. That is to say, when i=0, each of selector S1-St selects the coefficients applied thereto from the generator 14. 
     The gate E1 implements exclusive-or operations of the corresponding bits of the coefficients σ o , σ 1 , σ 2 , . . . , σ t-1 , and σ t . The outputs of the exclusive-or gate E1 are applied to the all-zero detector 30. It is assumed for a better understanding that each of the coefficients σ 0 , σ 1 , σ 2 , . . . , σ t-1 , and σ t  has a bit length of eight. In such a case, the gate E1 carries out eight exclusive-or operations at the same time. More specifically, if 
     σ 0  =0000 0000 
     σ 1  =0000 0000 
     σ 2  =0000 0000 
     **** 
     σ t-1  =0000 0000 
     σ t  =0000 0000 
     then the eight outputs of the exclusive-or gate E1 exhibit all &#34;0&#34;s. Thus, the detector 30 detects this situation which is applied to the index-vector converter 32 and the power index counter 31. More specifically, before the arrangement of FIG. 2 starts the operation thereof, the counter 31 is reset such that the power index &#34;i&#34; of α -i  indicates &#34;+1&#34;. Thereafter, the counter 31 decrements the power index &#34;i&#34; by one each time the exclusive or gate E1 issues its output. In the above-mentioned initial stage (cycle), the counter 31 applies α 0  to the error pattern calculator 34. 
     While the exclusive-or gate E1 implements the above mentioned operations, the multipliers M1, M2, . . . , M(t-1), and Mt multiplication respectively the output of the selectors S1, S2, . . . , S(t-1), and St by α -1 , α -2 , . . . , α l-t  and α -t . The multiplication results σ 1  α -1 , σ 2  α -2 , . . . , σ t-1  α 1-t  and σ t  α -t  are respectively latched by the registers R1, R2, . . . , R(t-1), and Rt. 
     Following this, in order to replace X of Equation (1) with α 1  (viz., i=1), σ 0  is directly applied to the exclusive-or gate E1 as in the, above case. However, the selectors S1, S2, . . . , S(t-1), and St, in turn, selects the corresponding contents stored in the registers R1, R2, . . . , R(t-1), and Rt. Accordingly, the exclusive-or gate E1 is supplied within σ 0 , σ 1  α -1 , σ 2  α -2 , . . . , σ t-1  α l-t , and σ t  α -t . Thereafter, the same operations as mentioned above are implemented at the gate El. In the event that the detector 30 detects all &#34;0&#34;s of the results issued from the exclusive-or gate E1 the power index counter 31 issues α -1  which indicates an error location. 
     Furthermore, in order to replace X of Equation (1) with α 2  (viz., i=2), σ 0 , is directly applied to the exclusive-or gate E1. As in the case of i=1, the selectors S1, S2, . . . , S(t-1), and St select the corresponding contents stored in the registers R1, R2, . . . , R(t-1) and Rt, respectively. Accordingly, the exclusive-or gate E1 is supplied with σ 0 , σ 1  α -2 , σ 2  α -4 , . . . , σ t-1  α 2-2t , and σ t  α -2t . Thereafter, the same operations as mentioned in the above two cases are implemented thereat. 
     These operations are iterated until i=n wherein it is readily understood that σ 0 , σ 1  α -n , σ 2  α -2n , . . . , σ t-1  α n-tn , and σ t  α -tn  are applied to the exclusive-or gate E1. 
     An error location is defined as an index α -1  (σ(α -i ) =0) which is applied to the index-vector converter 32 and is then converted into the corresponding vector. The vector thus obtained is applied to the next stage, viz., the error data check circuit 18 (FIG. 1). The index-vector converter 32 is required to have a lookup-table (not shown) previously stored in a ROM (Read Only Memory) for the index-vector conversion. 
     As is well known in the art, a primitive polynomial f(X) over GF(2 8 ) is given by 
     
         f(X)=X.sup.8 +X.sup.4 +X.sup.3 +X.sup.2 +1                 (3) 
    
     Therefore, the index-vector pairs (viz., table of Galois Field GF(2 8 )) stored in the ROM are 
     
         ______________________________________      --   = 0000 0000      α.sup.0           = 1000 0000      α.sup.1           = 0100 0000      α.sup.2           = 0010 0000      α.sup.3           = 0000 1000           . . . . . .      α.sup.125           = 1100 1100      α.sup.126           = 0110 0110      α.sup.127           = 0011 0011      α.sup.128           = 1010 0001           . . . . . .      α.sup.251           = 0001 1011      α.sup.252           = 1011 0101      α.sup.253           = 1110 0010      α.sup.254           = 0111 0001______________________________________ 
    
     That is, the above mentioned index-vector conversion requires 256 index-vector pairs stored in the ROM. Further, if GF(2 10 ) is used, then the index-vector pairs amount to a very large number of 1024. The tables of Galois Fields are shown in APPENDIX A of the aforesaid reference book. 
     When the error location α -1  (σ(α -1 )=0) is ascertained, the error pattern calculator 34 acquires the outputs of the counter 31 and the exclusive-or gates E2 and E3 in order to obtain the corresponding error pattern e i . The error pattern e i  is given by 
     
         e.sub.i =p(X)/[σ&#39;(X)·X]                     (4) 
    
     When error location α -i  (viz., σ(α -i )=0) is defined, the corresponding error pattern is determined by substituting X for α -i  and is implemented by the hardware arrangement which includes the exclusive-or gates E2 and E3, the multipliers MA0-MA(t-1) and MB0-MB(t-1), and the error pattern calculator 34. 
     The numerator p(α -i ) of Equation (4) is calculated as follows. The multiplier MA0, MA1, MA2, . . . , MA(t-1) multiply σ 0 , σ 1  α -i , σ 2  α -2i , . . . , σ t-1  α i-ti  by the reciprocals of the coefficients of Equation (2), viz., σ 0   -1 , σ 1   -1 , σ 2   -1 , . . . , σ t-1   -1 , respectively. Thereafter, the following multipliers MB0, MB1, MB2, . . . , MB(t-1) multiply the outputs of the preceding multipliers MA0, MA1, MA2, . . . , MA(t-1) by p 0 , p 1 , p 2 , . . . , p t-1 , respectively. Thus, the multiplication results p 0 , p 1  α -n , p 2  α -2n , . . . , p t-1  α n-tn  are applied to the exclusive-or gate E3. This gate E3 implements the exclusive-or operations of the corresponding bits of each of the above mentioned multiplication results as in the gate E1. The output of the exclusive-or gate E3 is applied to the error pattern calculator 34. 
     The denominator [σ&#39;(X)·X] of Equation (4) is calculated as follows. The exclusive-or gate E2 receives the selector&#39;s outputs wherein each of the suffixes of σ exhibits an odd number. That is, the exclusive-or gate E2 receives σ 1  α -n , σ 3  α -3n , . . . , σ t-3  α - (t-3)n, σ t-1  α - (t-1)n which are respectively generated from the selectors S1, S3, . . . , S(t-3) and S(t-1) (although the selectors S3 and S(t-3) are not shown in FIG. 2). 
     The error pattern calculator 34 is supplied with the outputs of the counter 31 and the exclusive-or gates E2 and E3, and outputs the error pattern e i  after executing the following divisional operation: 
     
         e.sub.i =p(α.sup.-i)/[σ&#39;(α.sup.-i)·α.sup.-i ] 
    
     The above mentioned known Chien&#39;s searching, however, has suffered from the drawbacks that the index α -i  (σ(α -i )=0) should be converted into the corresponding vector using a large lookup table stored in a ROM. As discussed above, if GF(2 8 ) then the number of the index-vector pairs amounts to 255, while if GF(2 10 ) then the number of the index-vector pairs amounts to 1024. In addition to this problem, the error data check circuit 18 (FIG. 1) is undesirably required to define the error location using the vector applied thereto from the Chien&#39;s searching circuit. 
     Still further, with the prior art, determining the error pattern data requires the reciprocals of the coefficients of the error-location polynomial. These reciprocal are usually obtained using a table stored in a ROM (not shown in FIG. 2). Further, the two multiplying circuits (MA0-MA(t-1) and MB-MB(t-1)) are required which inevitably require a plurality of registers for temporarily storing intermediate values. These complex circuitry renders it difficult to fabricate the arrangement of FIG. 2 by LSI (Large Sale Integration) techniques. 
     SUMMARY OF THE INVENTION 
     It is an object of the present invention to provide a so-called Chien&#39;s searching circuit which features a simplified arrangement and thus is well suited for fabrication thereof using LSI techniques. 
     In brief, the above object is achieved by technique wherein in order to simplify a hardware arrangement of a so-called Chien&#39;s searching circuit, an error location counter is provided. The error location counter counts up in response to each execution for detecting an error in a code word. If an error is detected in the code word, the content of the error location counter is latched by a suitable storage means and then applied to en eternal circuit. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     The features and advantages of the present invention will become more clearly appreciated from the following description taken in conjunction with the accompanying drawing in which like elements are denoted by like reference numerals and in which: 
     FIG. 1 is a block diagram schematically showing an overall error correction arrangement, this figure having been referred to in the opening paragraphs; 
     FIG. 2 is a block diagram showing a known Chien&#39;s searching circuit; 
     FIG. 3 is a block diagram showing one embodiment of the present invention; and 
     FIG. 4 is a block diagram showing one example of the embodiment for a better understanding of the instant invention. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     Reference is now made to FIG. 3, wherein an embodiment of the present invention is shown in block diagram form. 
     An arrangement of the embodiment for determining error locations, differs from that of the prior art (FIG. 1) in that the former arrangement is provided with an error location counter 50 And a register 52 in lieu of the index-vector converter 32. Accordingly, the blocks of FIG. 3, which have been shown in FIG. 2, are labelled with like characters and numerals. 
     The circuit operations up to detecting all &#34;0&#34;s at the detector 30 of the embodiment are essentially the same as the arrangement of FIG. 1 and thus, merely the descriptions relevant to the present invention will be given. 
     The error location counter 50 is initialized prior to commencing the operations of the arrangement of FIG. 3. 
     The error location counter 50 increments the content thereof by one in response to the first step wherein the coefficients σ 0 , σ 1 , σ 2 , . . . , σ t-1 , and σ t  are applied to the arrangement of FIG. 2 from the polynomial generator 14. 
     Following this, as above mentioned, in order to replace X of Equation (1) with α 1  (viz., i=1), σ 0  is directly applied to the exclusive-or gate E1 as in the above case. The selectors S1, S2, . . . , S(t-1) and St, select respectively the corresponding contents stored in the registers R1, R2, . . . , R(t-1) and Rt. Accordingly, the exclusive-or gate E1 is supplied with σ 0 , σ 1  α -1 , σ 2  α -2 , . . . , σ t-1  α l-t  and σ t  α -t . The error location counter 50, in response to this second step, further increments the content thereof by one. 
     Thus, in the following steps, the error location counter 50 increments the content thereof by one in response to each of the steps. In other words, it can be said that the counter 50 counts up by one each time the exclusive-or gate E1 issues the outputs thereof. 
     In the above, if the all-zero detector 30 detects that the outputs of the exclusive-or gate E1 exhibits all zeros, the register 52 latches the content of the error location counter 50 and then applies same to the following circuit, viz., the error data check circuit 18 (FIG. 1). It will be readily appreciated that the content of the error location counter 50, latched by the register 52, is able to specify which symbol of the code word contains the error. If the error data check circuit 18 (FIG. 1) is configured such as to correctly locate error position(s) according to the counter output(s) applied thereto from the register 52, the index-vector conversion of the prior art is no longer required. 
     Thus, the present embodiment is able to markedly lessen the burden on the hardware arrangement as compared with the prior art. 
     Determining an error pattern according to the present embodiment will be discussed below. 
     The arrangement dedicated to determining the error pattern, includes selectors S1&#39;, S2&#39;, . . . , S(t-1)&#39;, registers R1&#39;, R2&#39;, . . . , R(t-1)&#39;, multipliers M1&#39;, M2&#39;, . . . , M(t-1)&#39;, exclusive-or gates E2&#39; and E3&#39;, a power index counter 31 and an error pattern calculator 34&#39;. The gates E2&#39; and E3&#39; operate in exactly the same manner as their counterparts E2 and E3. Similarly, the calculator 34&#39; functions in exactly the same manner as the counterpart 34. It is assumed that each of he multipliers M1&#39;-M(t-1)&#39; includes a register (not shown) for storing contents as mentioned below. 
     Prior to initiating the operations of the FIG. 3 arrangement, the following constants are set to the multipliers M1&#39;, M2&#39;, . . . , and M(t-1)&#39;. That is, the multipliers M1&#39;, M2&#39;, . . . , and M(t-1)&#39; store respectively α -1 , α -2 , . . . , and α l-t  in the corresponding registers thereof (not shown). 
     The numerator p(α -i ) of Equation (4) is calculated as follows. Upon starting the first step wherein X of Equation is replaced with α 0  (viz., i=0) in the portion for the above mentioned error location detection, the coefficient p 0  is directly applied to the exclusive-or gate E3&#39;, while p 1 , p 2 , . . . , and p t-1  are respectively applied to the exclusive-or gate E3&#39; via the selectors S1&#39;, S2&#39;, . . . , and S(t-1)&#39;. That is to say, when i=0, each of the selectors S1&#39;-S(t-1)&#39; selects the coefficients applied thereto. 
     The gate E3&#39; performs, during the first stage, exclusive-or operations on the corresponding bits of the coefficients p o , p 1 , p 2 , . . . , and p t-1 . Further, during the first stage, the multipliers M1&#39;-M(t-1)&#39; multiply the outputs of the corresponding selectors S1&#39;-S(t-1)&#39; by α -1 , α -2 , . . . , α l-t , respectively. Thereafter, the multiplication results p 1  α -1 , p 2  α -2 , . . . , and p t-1  α l-t  are respectively latched by the registers R1&#39;, R2&#39;, . . . , R(t-1)&#39; and. 
     In the following steps, the selectors S1&#39;-S(t-1)&#39;select the corresponding registers R1&#39;-R(t-1)&#39;, respectively. Accordingly, in the second step, the exclusive-or gate E3&#39; is supplied with p 1  α -1 , p 2  α -2 , . . . , and p t-1  α l-t  in addition to p 0  directly applied thereto from the calculator 14 (FIG. 1). During the second step, the contents of the registers R1&#39;-R(t-1)&#39; are renewed. These operations are repeated until the final stage is completed. 
     When the error location α -1  is ascertained, the error pattern calculator 34&#39; acquires he outputs of the exclusive-or gates E2&#39; and E3&#39; and calculates the error pattern data using Equation (4) which has been described in the opening paragraphs. The operations of he error pattern calculator 34&#39; are identical to those of the prior art and thus, further descriptions thereof will be omitted. 
     FIG. 4 is a block diagram showing one concrete example wherein the embodiment of FIG. 3 is applied to a particular case of GF(2 8 ). Thus, the circuit configuration of FIG. 4 can readily be appreciated in view of FIG. 3 and as such, we will directly enter into the operations of the FIG. 4 arrangement omitting the discussion of the hardware arrangement thereof. 
     As mentioned above, a primitive polynomial f(X) over GF(2 8 ) is defined by 
     
         f(X)=X.sup.8 +X.sup.4 +X.sup.3 +X.sup.2 +1 
    
     It is assumed that: (a) a transmitter (not shown) has transmitted a code word including 16 symbols each having a bit length of eight and being set to all &#34;0&#34;s, (b) the code word received includes three symbols which exhibit errors and (c) the three symbols including error are depicted by α 3 , α 8  and α 11 . The code word received is represented by ##STR1## In this case, the error location polynomial σ(X) and the error numerical value polynomial p(x) are respectively given by 
     
         σ(X)=α.sup.248 X.sup.3 +α.sup.212 X.sup.2 +α.sup.219 X+α.sup.229 
    
     
         p(X)=α.sup.73 X.sup.2 +α.sup.52 X+α.sup.54 
    
     As shown, the coefficients α 248 , α 212 , α 219 , and α 229  are initially applied to the arrangement of FIG. 4 as illustrated. It is understood, from the error positions of the received data, that the three locations are α -2 , α -5  and α -12 , respectively. 
     That is, ##STR2## On the other hand, the error patterns, at the above mentioned error locations α -2 , α -5  and α -12 , are respectively calculated by executing 
     
         e.sub.i =p(X)/[σ&#39;(X)·X] 
    
     More specifically, 
     Error pattern of α -2   
     =[α 73  (α -2 ) 2  +α 52  (α -2 )+α 54  ]/[(α 248  (α -2 ) 2  +α 219 )α -2  ] 
     =α 11   
     Error pattern of α -5   
     =[α 73  (α -5 ) 2  +α 52  (α -5 )+α 54  ]/[(α 248  (α -5 ) 2  +α 219 )α -5  ] 
     α 8   
     Error pattern of α -12   
     =[α 73  (α -12 ) 2  +α 52  (α -12 )+α 54  ]/[(α 248  (α -12 ) 2  +α 219 )α -12  ] 
     =α 3   
     It will be understood that the above disclosure is representative of few possible embodiments of the present invention and that the concept on which the present invention is based is not specially limited thereto.