Mappings between codewords of two distinct (N,K) Reed-Solomon co

Excavating

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 1110, H03M 1300

Patent

active

053772075

ABSTRACT:
A process for realizing mappings between codewords of two distinct (N,K) Reed-Solomon codes over GF(2.sup.J) having selected two independent parameters: J, specifying the number of bits per symbol; and E, the symbol error correction capability of the code, wherein said independent parameters J and E yield the following: N=2.sup.J -1, total number of symbols per codeword; 2E, the number of symbols assigned a role of check symbols; and K=N-2E, the number of code symbols representing information, all within a codeword of an (N,K) RS code over GF(2.sup.J), and having selected said parameters for encoding, the implementation of a decoder are governed by: 2.sup.J field elements defined by a degree J primitive polynomial over GF(2) denoted by F(x); a code generator polynomial of degree 2E containing 2E consecutive roots of a primitive element defined by F(x); and, in a Berlekamp RS code, the basis in which the RS information and check symbols are represented.
The process includes separate transformation steps for symbol-by-symbol conversion for a first RS code to ultimately a second conventional RS code capable of being corrected by a conventional RS decoder, followed by a reverse sequence of the inverse of the first set of steps to arrive at codewords having corrected information symbols, at which time check symbols of the RS code may be discarded.

REFERENCES:
patent: 3988677 (1976-10-01), Fletcher et al.
patent: 4782490 (1988-11-01), Tenengoltz
patent: 4843607 (1989-06-01), Tong
patent: 4907233 (1990-03-01), Deutsch et al.
Solomon W. Golomb, "Theory of Transformation Groups of Polynomials over GF(2) with Applications to Linear Shift Register Sequences," American Elsevier Publishing Company, Inc., 1968, pp. 87-109.
Wesley Peterson, "Error-Correcting Codes," The M.I.T. Press and John Wiley & Sons, Inc., publishers, 1961, pp. 251-254.
M. Perlman and J. Lee, "Reed-Solomon Encoders--Conventional vs Berlekamp's Architecture," JPL Publication 82-71, Dec. 1, 1982.
E. R. Berlekamp, "Bit-Serial Reed-Solomon Encoders," IEEE Transactions on Information Theory, vol. IT 28, No. 6, pp. 869-874, Nov. 1982.
R. Miller and L. Deutsch, "Conceptual Design for a Universal Reed-Solomon Decoder," IEEE Transactions on Communications, vol. Com-29, No. 11, pp. 1721-1722, Nov. 1981.
"Telemetry Channel Coding," Recommendation for Space Data System Standards, CCSDS 101.0-B-2, Blue Book, Consultative Committee for Space Data Systems, Jan. 1987.

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

Mappings between codewords of two distinct (N,K) Reed-Solomon co does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Mappings between codewords of two distinct (N,K) Reed-Solomon co, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mappings between codewords of two distinct (N,K) Reed-Solomon co will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-924150

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