Polynomial divider which can perform Euclid's Algorithm to produ

Excavating

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

H03M 1300

Patent

active

056152205

ABSTRACT:
A polynomial divider which can perform Euclid's Algorithm by iteratively solving both equations thereof through performing iterations of polynomial division so as to produce an error locator polynomial from an error syndrome polynomial, and apparatus including the polynomial divider. The polynomial divider is capable of performing polynomial division of a numerator polynomial by a denominator polynomial to produce a quotient polynomial and a remainder polynomial. The polynomial divider includes (a) a first set of registers for storing the denominator polynomial; (b) a second set of registers for storing the remainder polynomial; (c) an input for receiving the numerator polynomial; (d) an output for supplying the quotient polynomial; (e) a first coupling unit far coupling the first set of registers to the input so that the denominator polynomial stored in the first set of registers becomes the numerator polynomial which is received by the input and used in a further polynomial division; and (f) a second coupling unit for coupling the second set of registers to the first set of registers so that the remainder polynomial stored in the second set of registers becomes the denominator polynomial which is stored in the first set registers and used in the further polynomial division. An error locator polynomial determining apparatus includes the polynomial divider and a control unit for controlling the polynomial divider. An error correction apparatus includes the error locator polynomial determining apparatus, an error information determiner and a data corrector.

REFERENCES:
patent: 5185711 (1993-02-01), Hattori
patent: 5309449 (1994-05-01), Gandini
patent: 5365529 (1994-11-01), Mester
patent: 5367478 (1994-11-01), Hattori
patent: 5367479 (1994-11-01), Van Der Putten
patent: 5379243 (1995-01-01), Greenberger et al.
patent: 5436916 (1995-07-01), Nakamura
patent: 5442578 (1995-08-01), Hattori
patent: 5495488 (1996-02-01), Nakamura
patent: 5504758 (1996-04-01), Inoue et al.
Clark et al., "Error-Correction Coding For Digital Communications", Chapters 5.3.2-5.4, pp. 191-208, 1988 (3rd printing, Plenum Press).
Peterson et al., "Error-Correcting Codes", Chapter 7, pp. 170-179, 1980, (4th ed., MIT).
Shao et al., "A VLSI Design of a Pipeline Reed-Solomon Decoder", IEEE Transactions on Computers, vol. C-34, No. 5, May 1985, pp. 393-402.
MacWilliams et al., The Theory of Error-Correcting Codes, Bell Laboratories, Murray Hill, NJ, pp. 362-364, 1987.
Yongjin Jeong and Wayne Burleson, VLSI Array Synthesis for Polynomial GCD Computation, Application Specific Array Processors, 1993 Int'l Conference. IEEE 0-8186-3492-Aug. 1993.
Yongjin Jeong and Wayne Burleson, VLSI Array Synthesis for Polynomial GCD Computation and Application to Finite Field Division, IEEE Transactions on Circuits and Systems: -I Fundamental Theory and Applications, vol. 41, No. 12, Dec. 1994.
Richard P. Brent, Systolic VLSI Arrays for Polynomial GCD Computation, IEEE Transactions on Computers, vol. C-33, No. 8, Aug. 1984.

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

Polynomial divider which can perform Euclid's Algorithm to produ does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Polynomial divider which can perform Euclid's Algorithm to produ, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial divider which can perform Euclid's Algorithm to produ will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2210256

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