Finite field polynomial processing module for error control codi

Excavating

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

371 371, G11C 2900

Patent

active

056423675

ABSTRACT:
A single module for performing polynomial arithmetic operations over finite fields is provided in an error correcting system for correcting Reed-Solomon codewords with mixtures of errors and erasures in an optical disk storage. The module comprises two-dimensional register arrays, which serve as a working area to store initial data and intermediate results of the polynomial operations. A set of multiplier-adder units performs multiplication and addition operations under the data supplied from the register arrays based on finite field arithmetic over the Galois field GF(2.sup.8). A set of multiplexers routes the input data to the corresponding multiplier-adder units depending on the polynomial functions to be performed. In response to initial condition signals, a control system determines what polynomial functions are to be performed by the polynomial processing module and supplies the module with control signals to provide the data control in the register arrays and selection of the multiplexers.

REFERENCES:
patent: 3811108 (1974-05-01), Howell
patent: 4584686 (1986-04-01), Fritze
patent: 4649541 (1987-03-01), Lahmeyer
patent: 4747103 (1988-05-01), Iwamura et al.
patent: 4763332 (1988-08-01), Glover
patent: 4777635 (1988-10-01), Glover
patent: 4841300 (1989-06-01), Yoshida et al.
patent: 4852098 (1989-07-01), Brechard et al.
patent: 4873688 (1989-10-01), Maki et al.
patent: 5099482 (1992-03-01), Cameron
patent: 5170399 (1992-12-01), Cameron et al.
patent: 5329535 (1994-07-01), Coker
patent: 5381423 (1995-01-01), Turco
patent: 5444719 (1995-08-01), Cox et al.
patent: 5535140 (1996-07-01), Iwamura
Kao, Rom-Shen; A Multiplier-Free Fast Transform with Efficient VLSI Implementation for Polynomial RNS Processors; IEEE 1991.
Kao, Rom-Shen et al.; The Basis-Change Algorithm for Fast Finite Field Transforms; IEEE Proceedings. 1991.
S. Sakata; "Extension of the Berlekamp-Massey Algorithm to N Dimensions", Information and Computation, vol. 84, pp. 207-239, 1990.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Finite field polynomial processing module for error control codi does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Finite field polynomial processing module for error control codi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite field polynomial processing module for error control codi will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-153802

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.