Reed-Solomon Euclid algorithm decoder having a process configura

Details Reed-Solomon Euclid algorithm decoder having a process configura Reed-Solomon Euclid algorithm decoder having a process configura

1989-08-30

1992-12-08

Beausoliel, Robert W.

Excavating

371 381, 371 391, G06F 1110, H03M 1300

Patent

active

051703998

ABSTRACT:
A Reed-Solomon Galois Field Euclid algorithm error correction decoder solves Euclid's algorithm with a Euclid stack which can be configured to function as a Euclid divide or a Euclid multiply module. The decorder is able to resolve twice the erasure errors by selecting .GAMMA.(x) and T(x) as the initial conditions for .LAMBDA..sup.(0) (x) and .OMEGA..sup.(0) (x), respectively.

REFERENCES:
patent: 4649541 (1987-03-01), Lahmeyer
patent: 4782490 (1988-11-01), Tenengolts
patent: 4868828 (1989-09-01), Shao
patent: 4873688 (1989-10-01), Maki
patent: 4897839 (1990-01-01), Yamagishi

Affiliated with

Also associated with

Rating

Reed-Solomon Euclid algorithm decoder having a process configura does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reed-Solomon Euclid algorithm decoder having a process configura, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reed-Solomon Euclid algorithm decoder having a process configura will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-965521