Name
Abstract | ||
|---|---|---|
Linear programming decoding with the alternating direction method of multipliers (ADMM) is a promising decoding technique for low-density parity-check (LDPC) codes, where the computational complexity of Euclidean projections onto check polytopes becomes a prominent problem. In this paper, the problem is circumvented by building lookup tables (LUTs) and quantizing the inputs to approach approximate... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TCOMM.2017.2659733 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Parity check codes,Table lookup,Maximum likelihood decoding,Computational complexity,Projection algorithms,Quantization (signal) | Lookup table,Sequential decoding,Commutative property,Computer science,Low-density parity-check code,Algorithm,Theoretical computer science,Electronic engineering,Polytope,Decoding methods,Quantization (signal processing),Computational complexity theory | Journal |
Volume | Issue | ISSN |
65 | 4 | 0090-6778 |
Citations | PageRank | References |
4 | 0.44 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaopeng Jiao | 1 | 16 | 2.42 |
| Jianjun Mu | 2 | 8 | 3.23 |
| Yu-cheng He | 3 | 53 | 10.01 |
| Chao Chen | 4 | 16 | 2.13 |