Chien's searching apparatus
AssigneeMatsushita Electric Industrial Co., Ltd.
InventorsMasanori Hirofuji, Yoshitaka Hanaki
Life of this patent
Estimating the term…
Abstract
The present invention attempts to speed up operations by a chien's searching apparatus used in error correction, to thereby miniaturize it and save on its power dissipation. To this end, the apparatus includes a plurality of arithmetic units which share an error-position polynomial calculating unit and an error-numeral polynomial calculating unit as well as selectors and registers, to thereby perform calculation on a plurality of orders in the same cycle. Also, a divider unit is shared in use. If no error is found, the divider unit is stopped.
Claims9
A chien's searching apparatus comprising a denominator-side arithmetic unit for operating an error-numeral calculating equation:
- an input terminal provided for each coefficient to which each coefficient of a error-position polynomial is input;
- an selector unit connected to each input terminal for selecting each value input to said input terminal only in an initial cycle and, in the subsequent cycles, selecting each value input from the other input terminal;
- a storage unit connected to said selector unit for storing each value selected by said selector unit;
- a first summing unit for summing each value stored in said storage unit at the beginning of each cycle;
- a first 0-decoder for deciding whether a value of an operation result of said first summing unit is 0 or not each time said operation result is output;
- a second Galois field multiplier unit for causing a Galois field multiplier following said storage unit to performing, for each cycle, Galois field multiplication on each value stored in said storage unit;
- a second summing unit for summing an operation result of said second Galois field multiplier unit for each cycle;
- a second 0-decoder for deciding whether a value of an operation result of said second summing unit each time said operation result is output;
- a first Galois field multiplier unit for causing the following Galois field multiplier to perform Galois field multiplication in the same cycle on a result of each Galois field multiplier of said second Galois field multiplier unit, to then input a result thereof to each of other input terminals of said selector unit;
- a first error-location counter which is reset at 0 at a first cycle and, in each of the following cycles, incremented by two;
- and
- a second error-location counter which is reset at 1 at a first cycle and, in each of the following cycles, incremented by two;
- wherein said apparatus further comprises an error-position specification processing unit for specifying an error position based on values of said two 0-decoders and values of said two error-location counters.
A chien's searching apparatus comprising a denominator-side arithmetic unit for operating an error-numeral calculating equation:
- an input terminal provided for each coefficient to which each coefficient of an error-position polynomial is input;
- a selector unit for selecting each value input to said input terminal only in an initial cycle and, in the following cycles, selecting each value input from other input terminals;
- a storage unit following said selector unit for storing each value selected by said selector unit;
- a first summing unit for summing, for each cycle, each value stored in said storage unit;
- a first 0-decoder for deciding whether a value of an operation result of said first summing unit each time said operation result is output;
- a second Galois field multiplier unit for causing a Galois field multiplier following said storage unit to perform, for each cycle, Galois field multiplication on each value stored in said storage unit;
- a second summing unit for summing an operation result of said second Galois field multiplier unit for each cycle;
- a second 0-decoder for deciding whether a value of an operation result of said second summing unit each time said operation result is output;
- a first Galois field multiplier unit for causing the following Galois field multiplier to perform Galois field multiplication in the same cycle on a result of each Galois field multiplier of said second Galois field multiplier unit, to then input a result thereof to each input terminal of said selector unit;
- a first error-location counter which is reset at 0 in a first cycle and then incremented by two for each cycle;
- a second error-location counter which is reset at 1 in a first cycle and then incremented by two for each cycle;
- a first odd-number order summing unit for summing outputs of an odd number from said first Galois field multiplier unit;
- and
- a second odd-number order summing unit for summing outputs of an odd number from said second Galois field multiplier unit;
- wherein:
- said apparatus further comprises as a numerator-side arithmetic unit for operating an error-numeral calculating equation:
- a numerator-side input terminal provided for each coefficient to which each coefficient of a numerator of an error-numeral polynomial;
- a numerator-side selector unit connected to each input terminal for selecting each value input to said numerator-side input terminal only in an initial cycle and, in the following cycle, selecting each value input from other input terminals;
- a numerator-side storage unit connected to said numerator-side selector unit for storing each value selected by said numerator-side selector unit;
- a numerator-side first summing unit for summing each value stored in said numerator-side storage unit at the beginning of each cycle;
- a numerator-side second Galois field multiplier unit for causing a numerator-side Galois field multiplier following said numerator-side storage unit to perform Galois field multiplication on each value stored in said numerator-side storage unit;
- a second numerator-side summing unit for summing an operation result of said numerator-side second Galois field multiplier unit for each cycle;
- and
- a first numerator-side Galois field multiplier unit for causing the following numerator-side Galois field multiplier to perform in the same cycle Galois field multiplication on a result of each Galois field multiplier of said numerator-side second Galois field multiplier unit, to then input a result thereof to each of other input terminals of said numerator-side selector unit;
- and
- an error-position specification processing unit for specifying an error position based on values of said two 0-decoders and values of said two error-location counters comprises:
- a divider unit for performing division using as a denominator an output, if any, from said first odd-number order summing unit and as a numerator an output, if any, from said numerator-side first summing unit and also using as a denominator an output, if any, from said second odd-number order summing unit and as a numerator an output, if any, from said second numerator-side summing unit;
- and
- a plurality of division controlling units for conducting control in such a way that if said first and second 0-decoders both provides a value of 0, neither a combination of an output of said first odd-number order summing unit and an output of said first numerator-side summing unit nor a combination of an output of said second odd-number order summing unit and an output of said numerator-side second summing unit is input to said divider unit;
- if only one of values of said first and second 0-decoders is 0, only an output from said odd-number order summing unit, not corresponding, and an output from said numerator-side summing unit are input to said divider unit and, at the same time, a signal specifying to this effect is output to a subsequent stream side processing unit;
- and if values of said first and second 0-decoders are both 0, first an output of said first odd-number order summing unit and an output of said numerator-side first summing unit are input to said divider unit and, in the next cycle, an output of said second odd-number summing unit and an output of said second numerator-side summing unit are input to said divider unit and also, each calculating unit and selector are stopped long enough to effectuate two division operations at said divider unit, or a state value is held.
A chien's searching apparatus comprising a denominator-side arithmetic unit for operating an error-numeral calculating equation:
- an input terminal provided for each coefficient to which each coefficient of an error-position polynomial is input;
- a selector unit connected to said input terminal for selecting each value input to said input terminal only in an initial cycle and, in the following cycles, selecting each value input to other input terminals;
- a storage unit connected to said selector unit for storing each value stored in said selector unit;
- an n'th Galois field multiplier unit for causing a Galois field multiplier following said storage unit to perform, for each cycle, Galois field multiplication on each value stored in said storage unit;
- an (i−1)'th Galois field multiplier unit for receiving an output of an upstream-side i'th Galois field multiplier (i=n, n−1, . . . , 3) to cause the following Galois field multiplier to perform Galois field multiplication in the same cycle;
- a first Galois field multiplier unit for receiving, for each cycle, an output from an upstream-side second Galois field multiplier unit, to output a value of said output to other input terminals of following said selector unit in the same cycle;
- a first summing unit for summing each value stored in said storage unit at the beginning of each cycle;
- second through n'th summing units for summing, in the same cycle, a value of a multiplication result from each Galois field multiplier unit except said first Galois field multiplier unit each time said result is output;
- first through n'th 0-decoders provided for each summing unit for deciding whether a value of an operation result of each of said first through n'th summing units is 0 or not each time said result is output;
- a first error-location counter which is reset at 0 in a first cycle and then incremented by n for each of the following cycles;
- and
- n'th through second error-location counters which correspond to said n'th through second Galois field multiplier units respectively and which are reset at 1, . . . , n−1 respectively in a first cycle and then incremented by n in each of the following cycles;
- wherein said apparatus comprises an error-position specification processing unit for specifying an error position based on values of said n 0-decoders and said n error-location counters.
A chien's searching apparatus comprising a denominator-side arithmetic unit for operating an error-numeral calculating equation:
- an input terminal provided for each coefficient to which each coefficient of an error-position polynomial is input;
- a selector unit connected to said input terminal for selecting each value input to said input terminal only in an initial cycle and, in the following cycle, selecting each value input to other input terminals;
- a storage unit connected to said selector unit for string each value stored in said selector unit;
- an n'th Galois field multiplier unit for causing, for each cycle, a Galois field multiplier following said storage unit to perform Galois field multiplication on each value stored in said storage unit;
- an (i−1)'th Galois field multiplier unit for receiving an output from an upstream-side i'th Galois field multiplier (i=n, n−1, . . . , 3), to cause the following Galois field multiplier to perform, in the same cycle, Galois field multiplication;
- a first Galois field multiplier unit for receiving, for each cycle, an output from an upstream-side second Galois field multiplier unit, to output in the same cycle a value thereof to other input terminals of said selector unit;
- a first summing unit for summing each value stored in said storage unit at the beginning of each cycle;
- second through n'th summing units for summing a value of a multiplication result from each Galois field multiplier unit except said first Galois field multiplier each time said result is output;
- first through n'th 0-decoders for deciding whether a value of an operation result from said first through n'th summing units is 0 or not each time said result is output;
- a first error-location counter which is reset at 0 at a first cycle and then incremented by n for each of the following cycles;
- error-location-value count recognizing means provided for each Galois field multiplier which has essentially the same actions as n'th through second error-location counters corresponding to n'th through second Galois field multipliers which are reset at 1, . . , n−1 respectively and then incremented by n or which does so together with said first error-location counter;
- and
- i'th odd-number order summing unit (i=1, 2, . . . , n) for summing outputs of an odd number from said i'th Galois field multiplier unit (i=1, 2, . . . , n);
- wherein:
- said apparatus comprises as a numerator-side arithmetic unit for operating an error-numeral calculating equation:
- a numerator-side input terminal provided for each coefficient to which each coefficient of a numerator of an error-numeral polynomial is input;
- a numerator-side selector unit connected to said numerator-side input terminal for selecting each value input to said numeral-side input terminal only in an initial cycle and, in the following cycles, selecting each value input to other input terminals;
- a numerator-side storage unit connected to said numerator-side selector unit for storing each value stored in said numerator-side selector unit;
- an n'th Galois field multiplier unit for causing, for each cycle, a Galois field multiplier following said numeral-side storage unit to perform Galois field multiplication on each value stored in said numerator-side storage unit;
- a numerator-side (i−1)'th Galois field multiplier unit for receiving an output from a numerator-side i'th Galois field multiplier unit (i=n, n−1, . . . , 3) on the upstream side, to causing, in the same cycle, the following Galois field multiplier to perform Galois field multiplication;
- a numerator-side first Galois field multiplier unit for receiving, for each cycle, an output from a numerator-side second Galois field multiplier unit on the upstream side, to output in the same cycle a value thereof to other input terminals of said numerator-side selector unit;
- a numerator-side first summing unit for summing each value stored in said numerator-side storage unit at the beginning of each cycle;
- and
- a numerator-side second through n'th summing units for summing in the same cycle a value of a multiplication result from each Galois field multiplier unit except said numerator-side Galois field multiplier unit each time said result is output;
- and
- an error-position specification processing unit for specifying an error position based on values of said n 0-decoders and said n error-location counters or values of said n 0-decoders and said first error-location counter and also recognition contents by said error-location-value count recognizing means comprises:
- a divider unit for performing division by using as a denominator an output, if any, from said i'th odd-number order summing unit and as a numerator an output from said numerator-side i'th summing unit;
- and
- a plurality of division controlling units providing control in such a way that if values of said first through n'th 0-decoders are all 0, none of combinations of outputs from said first through n'th odd-number order summing units and outputs from said numerator-side summing units is input to said divider unit;
- and if any one of values of said first through n'th 0-decoders is 0, combinations of outputs from corresponding ones of said odd-number order summing units and outputs from said numerator-side summing units are sequentially input in each cycle to said divider unit in an ascending order and, at the same time, a signal specifying a 0-decoder of interest is output to a downstream-side processing unit and also, each calculating unit and selector are stopped long enough to effectuate a plurality of division operations at said divider unit, or a state value is held.
Dependencies are inferred from the claim text.