Idaho Research Foundation, Inc.

American Microsystems, Inc.

Kelly B Cameron

Patrick A Owsley

Gary K Maki

Jack Venbrux

The preferred embodiment includes a method and apparatus for generating a comma code. A data word having a value m is received. A binary storage apparatus receives the data value. A storage apparatus is coupled to the output of the address calculator. The storage apparatus includes a plurality of single bit storage elements that are arranged to provide an M bit output. Each single bit storage element is initialized to a first value. The address calculator calculates the appropriate single bit storage element to be selectively inverted.

Comma code generator

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.

Reed-Solomon Euclid algorithm decoder having a process configurable

A Reed-Solomon Galois Field Euclid algorithm decoder determines whether an error is uncorrectable by checking for:

Apparatus for detecting uncorrectable error patterns when using Euclid's

A Galois Field error correction decoder is described which can correct an error in a received polynomial. The apparatus includes means for generating a plurality of syndrome polynomials. A magnitude polynomial and a location polynomial having a first derivative are calculated from the syndrome polynomials utilizing Euclid's Algorithm. The module utilizing Euclid's Algorithm includes a general Galois Field multiplier having combinational logic circuits. The magnitude polynomial is divided by the first derivative of said location polynomial to form a quotient. Preferrably the division includes finding the inverse of the first derivative and multiplying the inverse by the magnitude polynomial. The error is corrected by exclusive ORing the quotient with the received polynomial.

High-speed real-time Reed-Solomon decoder

A flip-flop stores input data on both the leading and trailing edges of a clock pulse. The flip-flop includes a data path responsive to the leading edge of a clock pulse and a second data path responsive to the trailing edge of a clock pulse, thereby allowing data to be stored on both the leading edge and the trailing edge of a clock pulse.

Growing community of inventors

Moscow, ID, United States of America

Kelly B Cameron