Simple and systematic process for constructing and coding LDPC codes
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Mar 30, 2004
Grant Date -
N/A
app pub date -
Oct 12, 2000
filing date -
Oct 12, 1999
priority date (Note) -
Expired
status (Latency Note)
Importance
Abstract
A process for the construction of LDPC codes including N symbols, of which K are free, each code being defined by a check matrix A including M=N-K rows, N columns, and t nonzero symbols in each column. The method includes allocating the same number of nonzero symbols to all the rows of the check matrix A, taking t to be the smallest possible odd number, defining the columns of A such that any two columns of the check matrix A have at most one nonzero value in a common position, and defining the rows of A such that any two rows of the check matrix A have only one nonzero value in a common position.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully