Name
Abstract | ||
|---|---|---|
We consider spatially coupled low-density parity-check (SC-LDPC) codes within a non-orthogonal interleave division multiple access (IDMA) scheme to avoid cumbersome degree profile matching of the LDPC code components to the iterative multi-user detector (MUD). Besides excellent decoding thresholds, the approach benefits from the possibility of using rather simple and regular underlying block LDPC codes owing to the universal behavior of the resulting coupled code with respect to the channel front-end, i.e., the iterative MUD. Furthermore, an additional outer repetition code makes the scheme flexible to cope with a varying number of users and user rates, as the SC-LDPC itself can be kept constant for a wide range of different user loads. The decoding thresholds are obtained via density evolution (DE) and verified by bit error rate (BER) simulations. To keep decoding complexity and latency small, we introduce a joint iterative windowed detector/decoder imposing carefully adjusted sub-block interleavers. Finally, we show that the proposed coding scheme also works for Rayleigh channels using the same code with tolerable performance loss compared to the additive white Gaussian noise (AWGN) channel. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/CISS.2019.8692899 | 2019 53rd Annual Conference on Information Sciences and Systems (CISS) |
Field | DocType | Volume |
Mathematical optimization,Repetition code,Low-density parity-check code,Communication channel,Algorithm,Coding (social sciences),Decoding methods,Additive white Gaussian noise,Detector,Mathematics,Bit error rate | Journal | abs/1901.05877 |
ISBN | Citations | PageRank |
978-1-7281-1151-3 | 0 | 0.34 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| sebastian cammerer | 1 | 157 | 16.76 |
| Xiaojie Wang | 2 | 18 | 1.62 |
| Yingyan Ma | 3 | 0 | 0.34 |
| Stephan ten Brink | 4 | 2912 | 204.86 |