or
Bookmark and Share
Sub-matrix-based implementation of LDPC (Low Density Parity Check) decoder
 
   
Document Number
US Patent 7530002
Issued Date
May 5, 2009
Link
Map
Abstract
Sub-matrix-based implementation of LDPC (Low Density Parity Check) decoder. A novel approach is presented by which an LDPC coded signal is decoded by processing 1 sub-matrix at a time. A low density parity check matrix corresponding to the LDPC code includes rows and columns of sub-matrices. For example, when performing bit node processing, 1 or more sub-matrices in a column are processed; when performing check node processing, 1 or more sub-matrices in a row are processed. If desired, when performing bit node processing, the sub-matrices in each column are successively processed together (e.g., all column 1 sub-matrices, all column 2 sub-matrices, etc.). Analogously, when performing check node processing, the sub-matrices in each row can be successively processed together (e.g., all row 1 sub-matrices, all row 2 sub-matrices in row 2, etc.).
Tags:
Description:
Amusing 0%
Clever 0%
Complex 0%
Efficient 0%
Historic 0%
Important 0%
Innovative 0%
Interesting 0%
Practical 0%
Simple 0%
Number of Claims:
20
Comments:
no comments yet
Owner
Published
May 5, 2009
Application Number
11/360,267
Filed
February 23, 2006
US Classification
714/758   714/752
Int'l Classification
H03M   13/00   (20060101)  
Parent Case
CROSS REFERENCE TO RELATED PATENTS/PATENT APPLICATIONS Provisional Priority Claims The present U.S. Utility Patent Application claims priority pursuant to 35 U.S.C. .sctn. 119(e) to the following U.S. Provisional Patent Application which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility Patent Application for all purposes: 1. U.S. Provisional Application Ser. No. 60/755,803, entitled "Sub-matrix-based implementation of LDPC (Low Density Parity Check) decoder," filed Tuesday, Jan. 3, 2006 (Jan. 3, 2006), pending.
USPTO Field of Search
714/752   714/758  
Related Patents
Claims
Description
About| FAQs| Terms & Disclaimer| Link to Us| Contact Us