Decoding error-correcting codes based on finite geometries

Details Decoding error-correcting codes based on finite geometries Decoding error-correcting codes based on finite geometries

2006-09-05

2006-09-05

Baker, Stephen M. (Department: 2133)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Digital data error correction

C714S780000

Reexamination Certificate

active

07103825

ABSTRACT:
A method decodes a received word for a binary linear block code based on a finite geometry. First, a parity check matrix representation of the code is defined. The received word is stored in a channel register. An active register represents a current state of the decoder. Each element in the active register can take three states, representing the two possible states of the corresponding bit in the word, and a third state representing uncertainty. Votes from parity checks to elements of the active register are determined from parity checks in the matrix, and the current state of the active register. A recommendation and strength of recommendation for each element in the active register is determined from the votes. The elements in the active register are then updated by comparing the recommendation and strength of recommendation with two thresholds, and the state of the corresponding bit in the received word. When termination conditions are satisfied, the decoder outputs the state of the active register. If the decoder outputs a state of the active register that does not correspond to a codeword, a new representation for the code using a parity check matrix with substantially more rows is chosen, and the decoding cycle is restarted.

REFERENCES:
patent: 4295218 (1981-10-01), Tanner
patent: 4404674 (1983-09-01), Rhodes
patent: 4819231 (1989-04-01), Yamada
patent: 5157671 (1992-10-01), Karplus
patent: 6944805 (2005-09-01), Seki
patent: 2002/0116677 (2002-08-01), Morelos-Zaragoza
patent: 2002/0188906 (2002-12-01), Kurtas et al.
Rudolph, et al., “Algebraic Analog Decoding of Linear Binary Codes” IEEE Transactions on Information Theory, vol. IT-25, No. 4, Jul. 1979, pp. 430-440.
Lucas, et al., “On Iterative Soft-Decision Decoding of Linear Binary Block Codes and Product Codes” IEEE Journal on Selected Areas in Communications, vol. 16, No. 2, Feb. 1998, pp. 276-296.
Lucas, et al., “Iterative Decoding of One-Step Majority Logic Decodable Codes Based on Belief Propagation” IEEE Transactions on Communications, vol. 48, No. 6, Jun. 2000, pp. 931-937.
Yeo, et al., “High Throughput Low-Density Parity-Check Decoder Architectures” GLOBRCOM 2001, Nov. 2001, pp. 3019-3024.
Richardson et al., “The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding,” IEEE Trans. Information Theory, vol. 47, num. 2, pp. 599-619, Feb. 2001.
Blahut, “Algebraic Codes for Data Transmission,” Chapter 13, Cambridge University Press: Cambridge, 2003.
Lin et al., “Error Control Coding: Fundamentals and Applications,” Chapter 8, Prentice Hall: Englewood Cliffs, NJ, 1983.

Affiliated with

Also associated with

Rating

Decoding error-correcting codes based on finite geometries does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Decoding error-correcting codes based on finite geometries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding error-correcting codes based on finite geometries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3601016