Decoding parallel concatenated parity-check code

Details Decoding parallel concatenated parity-check code Decoding parallel concatenated parity-check code

2006-11-28

2006-11-28

Chung, Phung My (Department: 2138)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Error/fault detection technique

C714S755000

Reexamination Certificate

active

07143336

ABSTRACT:
A decoding system and method for decoding parallel concatenated parity-check code defines a parity check matrix (e.g., a sparse parity check matrix) for the parallel concatenated parity check code. One or more bipartite graph representations are determined based on the parity check matrix with each of the one or more bipartite graph representations including bit nodes and check nodes. At least one of the one or more bipartite graph representations is decoded using an iterative decoding process (e.g., using an algorithm based on belief propagation).

REFERENCES:
patent: 4295218 (1981-10-01), Tanner
patent: 6023783 (2000-02-01), Divsalar et al.
patent: 6145110 (2000-11-01), Khayrallah
patent: 6381713 (2002-04-01), Irvin et al.
patent: 6539367 (2003-03-01), Blanksby et al.
“Turbo Decoding as an Instance of Pearl's “Belief Propagation” Algorithm” by McEliece et al. IEEE, 1998.
Bahl et al., “Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate”, IEEE Transactions on Information Theory, Mar. 1974, pp. 284-287.
Berrou et al., “Near Shannon Limit Error—Correcting Coding and Decoding: Turbo-Codes(1)”, IEEE International Conference on Communications '93, May 23-26, 1993, Geneva, Switzerland, Technical Program, Conference Record, vol. 2/3, pp. 1064-1070.
Cheng et al., “Frequency-Efficient Coding with Low-Density Generator Matrices”, working draft of Aug. 10, 1997.
Gallagher, “Low-Density Parity-Check Codes” M.I.T. Press (1963) pp. 1-90.
Kavcic, “Soft-Output Detector for Channels with Intersymbol Interference and Markov Noise Memory”, Global Telecommunications Conference—Globecom '99, Dec. 5-9, 1999, Rio de Janeiro, Brazil, General Conference (Part B), Conference Record vol. 1 of 5—V01b, pp. 728-732.
Kim et al., “Improved Turbo Decoding through Belief Progagation”, Global Telecommunications Conference—Globecom '99, Dec. 5-9, 1999, Rio de Janeiro, Brazil, Conference Record vol. 5 of 5—V05, pp. 2597-2601.
MacKay, “Good Error-Correcting Codes Based on Very Sparse Matrices”, IEEE Transactions on Information Theory, vol. 45, No. 2, Mar. 1999, pp. 399-431.
MacKay et al., “Near Shannon Limit Performance of Low Density Parity Check Codes”, Electronics Letters, Mar. 13, 1997, vol. 33, No. 6, pp. 457-458.
Moon et al., “Density Dependence of Noise in Thin Metallic Longitudinal Media”, Journal of Applied Physics. 63(8), Apr. 15, 1988, pp. 3254-3256.
Moon, “SNR Definition for Magnetic Recording Channels with Transition Noise,” to appear in IEEE Trans. Mag.
Moon et al., “Discrete-Time Modeling of Transition-Noise-Dominant Channels and Study of Detection Performance”, IEEE Transactions of Magnetics, vol. 27, No. 6, Nov. 1991, pp. 4573-4578.
Moon et al., “Pattern Dependent Noise Prediction in Signal-Dependent Noise”, IEEE J-SAC Special Issue on Signal Processing for High Density Storage Channels., vol. 19, pp. 730-743, Apr. 2001.
Oberg et al., “Parity Check Codes for Partial Response Channels”, Global Telecommunications Conference, Globecom'99, Dec. 5-9, 1999, Rio de Janeiro, Brazil, General Conference (Part B) Conference Record, vol. 1-5—V01b, pp. 717-722.
Oenning et al., “Modeling the Lorentzian Magnetic Recording Channel with Transition Noise”, IEEE Transactions on Magnetics, vol. 37, No. 1, Jan. 2001, pp. 583-591.
Oenning et al., “A Low Density Generator Matrix Interpretation of Parallel Concatenated Single Bit Parity Codes,” TMRC 2000, Santa Clara, CA, Aug. 16, 2000.
Ping et al., “Iterative Decoding of Multi-Dimensional Concatenated Single Parity Check Codes”, 1998 IEEE International Conference on Communications, Jun. 7-11, 1998, Atlanta, Georgia, USA, Conference Record, vol. 1 of 3, pp. 131-135.
Ryan, “Optimal Code Rates for Concatenated Codes on a PR4-Equalized Magnetic Recording Channel”, IEEE Transactions on Magnetics, vol. 36. No. 6, Nov. 2000, pp. 4044-4049.
Ryan, “A Turbo Code Tutorial,” unpublished.
Sawaguchi et al., “Turbo Decoding for High-Rate Concatenated Parity-Check Codes on PRML Channels”, IEEE Transactions on Magnetics, vol. 36, No. 5, Sep. 2000, pp. 2173-2175.
Worthen et al., “Low-Density Parity Check Codes for Fading Channels with Memory”, To appear in Proceedings of the 30thAnnual Allerton Conference on Communication, Control and Computing, 1998. pp. 1-9.
TCM Theory “Theory of Trellis Coding”. pp. 1-8 http://www.ece.wpi.edu/courses/ee535/hwk97/hwk3cd97/bad/theory.html.

Affiliated with

Also associated with

Rating

Decoding parallel concatenated parity-check code 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 parallel concatenated parity-check code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding parallel concatenated parity-check code will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3676130