发明名称 |
MEMORY-EFFICIENT LDPC DECODING |
摘要 |
To decode a representation of a codeword that encodes K information bits as N>K codeword bits, messages are exchanged between N bit nodes and N-K check nodes of a graph in which E edges connect the bit nodes and the check nodes. While messages are exchanged, fewer than E of the messages are stored, and/or fewer than N soft estimates of the codeword bits are stored. In some embodiments, the messages are exchanged only within sub-graphs and between the sub-graphs and one or more external check nodes. While messages are exchanged, the largest number of stored messages is the number of edges in the sub-graph with the most edges plus the number of edges that connect the sub-graphs to the external check node(s), and/or the largest number of stored soft estimates is the number of bit nodes in the sub-graph with the most bit nodes. |
申请公布号 |
WO2008142683(A3) |
申请公布日期 |
2009.02.12 |
申请号 |
WO2008IL00685 |
申请日期 |
2008.05.20 |
申请人 |
RAMOT AT TEL AVIV UNIVERSITY LTD.;SHARON, ERAN;LITSYN, SIMON;ALROD, IDAN |
发明人 |
SHARON, ERAN;LITSYN, SIMON;ALROD, IDAN |
分类号 |
H03M13/11 |
主分类号 |
H03M13/11 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|