Name
Abstract | ||
|---|---|---|
Shortening is a technique to achieve rate and length adaptable low-density-parity-check (LDPC) codes. Other than the puncturing and extending techniques, shortening aims to remove certain information columns, i.e., the columns standing for the known information bits, from a given parity check matrix. In this paper, we first review the recently suggested largest-extrinsic-sum (LES) algorithm which ... |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TCE.2011.6018855 | IEEE Transactions on Consumer Electronics |
Keywords | Field | DocType |
Parity check codes,IEEE 802.11n Standard,IEEE 802.16 Standards,Algorithm design and analysis,Prediction algorithms,Simulation | BCJR algorithm,Berlekamp–Welch algorithm,Low-density parity-check code,Computer science,Block code,Turbo code,Algorithm,Linear code,Tornado code,Puncturing | Journal |
Volume | Issue | ISSN |
57 | 3 | 0098-3063 |
Citations | PageRank | References |
2 | 0.39 | 10 |
Authors | ||
5 | ||