Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Reexamination Certificate
1999-06-18
2002-04-09
Decady, Albert (Department: 2784)
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
Reexamination Certificate
active
06370671
ABSTRACT:
TECHNICAL FIELD
The present invention is generally related to data communications and, more particularly, is related to a Reed-Solomon (“RS”) decoder and method for minimizing or eliminating errors in data communication.
BACKGROUND OF THE INVENTION
Communication of information in the form of digital data is quite commonplace in today's society. There are many different communications channels that may be employed to facilitate such data communication. Such channels may include existing telecommunications networks, optical fiber networks, cellular networks, the Internet, wide area networks, local area networks, or other like media. It is often the case that the communications channels chosen do not provide a perfect medium to transfer data information, and for various reasons such as noise, interference, or other phenomena, errors may be introduced into the data stream transmitted across a particular channel.
Many different approaches have been proposed to either reduce or eliminate errors in data communications. One such approach is to employ Reed-Solomon encoding/decoding. When employing Reed-Solomon encoding/decoding, data is transmitted in codewords which include a number of parity symbols along with the original data symbols. The parity symbols are generated using a Reed-Solomon encoder.
When using Reed-Solomon encoding, various numbers of parity symbols may be generated to allow a data system to correct up to a specific number of possible errors in the transmitted data. However, for each different number of total parity symbols generated, there is a unique Reed-Solomon generator polynomial with a specific number of coefficients employed. Thus, the typical Reed-Solomon encoder creates a specific number of parity symbols, which limits its usefulness if greater or fewer parity symbols are desired. Likewise, Reed-Solomon decoders are employed to correct errors in the transmission using the same specific number of parity symbols which limits its usefulness in the same manner.
SUMMARY OF THE INVENTION
The present invention provides a configurable Reed-Solomon decoder and method that addresses the above concerns. The configurable Reed-Solomon (RS) decoder comprises a parallel multiply accumulator having a data input to receive at least one RS codeword, the parallel multiply accumulator being configured to generate a syndrome array from the RS codeword. Also, the configurable RS decoder includes a Galois field computation unit coupled to the parallel multiply accumulator, and an RS decoder controller coupled to the parallel multiply accumulator and the Galois field computation unit, wherein the RS decoder controller controls the operation of the parallel multiply accumulator and the Galois field computation unit. The RS decoder may be configured for different numbers of symbols in the RS codewords, different numbers of parity symbols in the RS codewords, and for different modulation types employed in creating the RS codewords.
The present invention can also be viewed as providing a method for decoding a Reed-Solomon codeword in an RS decoder comprising the steps of: indicating an error correction capability configuration in the Reed-Solomon decoder; indicating a codeword length configuration in the Reed-Solomon decoder; indicating a modulation type configuration in the Reed-Solomon decoder; generating a syndrome array from the RS codeword based upon the error correction capability, codeword length, and modulation type configurations; and performing a number of calculations associated with a plurality of Reed-Solomon decoding algorithms based upon the error correction capability, codeword length, and modulation type configurations.
A significant advantage of the present invention is that it is highly configurable to implement Reed-Solomon decoding for different data communications applications, etc. Specifically, the Reed-Solomon decoder of the present invention may be configured to decode Reed-Solomon codewords having various numbers of parity symbols and data symbols. The present invention is also economical in that it requires a minimum number of logical components to implement and is power efficient, while at the same time being highly configurable. Other advantages of the invention are that it is simple in design, user friendly, robust and reliable in operation, and easily implemented for mass commercial production. The present invention is, for example, advantageously employed in various digital subscriber line modems that employ discrete multitone (DMT) line codes, carrierless amplitude-phase (CAP) line codes, quadrature amplitude modulation (QAM) line codes, and others.
Other features and advantages of the present invention will become apparent to one with skill in the art upon examination of the following drawings and detailed description. It is intended that all such additional features and advantages be included herein within the scope of the present invention.
REFERENCES:
patent: 4162480 (1979-07-01), Berlekamp
patent: 4809275 (1989-02-01), Inoue et al.
patent: 4833678 (1989-05-01), Cohen
patent: 5446743 (1995-08-01), Zook
patent: 5467297 (1995-11-01), Zook
patent: 5555250 (1996-09-01), Walker et al.
patent: 5610929 (1997-03-01), Yamamoto
patent: 5818854 (1998-10-01), Meyer
patent: 5905740 (1999-05-01), Williamson
patent: 5974580 (1999-10-01), Zook et al.
patent: 6052815 (2000-04-01), Zook
patent: 6055277 (2000-04-01), Stephens et al.
patent: 6145113 (2000-11-01), Baek
patent: 6163871 (2000-12-01), Yang
patent: 6175945 (2001-01-01), Okita
Fettweis, G. and Hassner, M.; A combined Reed-Solomon encoder and syndrome generator with small hardware complexity; Proceedings 1992 IEEE International Symposium on Circuits and Systems, vol. 4, 1992; pp. 1871-1874.*
Dabiri, D. and Blake, I.F.; Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials; IEEE Transactions on Information Theory, vol. 41 Issue: 4, Jul. 1995; pp. 873-885.*
Sobski, A. and Albicki, A.; Parallel encoder, decoder detector, corrector for cyclic redundancy checking; Proceedings 1992 IEEE International Symposium on Circuit and Systems, ISCAS '92, vol. 6, 1992 pp. 2945-2948.*
Richard E. Blahut, “Theory and Practice of Error Control Codes,” Addison-Wesley Publishing Co., Inc., 1983 pp. 174-191.
Lin, et al., “Error Control Coding Fundamentals and Applications,” Prentice-Hall, Inc. 1983, pp. 170-176.
Whitaker, et al.,. “Reed Solomon VLSI Codec for Advanced Television,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 1, No. 2, Jun. 1991, pp. 230-236.
Kuang Yung-Liu, “Architecture for VLSI Design of Red-Solomon Decoders,” IEEE Transactions on Computers, vol. C-33, No. 2, Feb. 1984, pp. 178-189.
Shayan, et al., “A Versatile Time-Domain Reed-Solomon Decoder,” IEEE Journal on Selected Areas in Communications, vol. 8, No. 8, Oct. 1990, pp. 1535-1542.
Pan Wenwei
Zheng Yue-Peng
De'cady Albert
Globespan, Inc.
Thomas Kayden Horstemeyer & Risley
Torres Joseph D.
LandOfFree
Configurable decoder and method for decoding a reed-solomon... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Configurable decoder and method for decoding a reed-solomon..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Configurable decoder and method for decoding a reed-solomon... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2860476