.png){kind=icon}
.png){kind=icon}
Return
Joint LDPC Code and Spreading Optimization for Multi-User Communications
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2025.3598006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Closed-form expressions of the degree distribution of regular low-density parity-check codes and spreading length are presented over a Gaussian multiple access channel. Specifically, given a specific variable node degree $d_{v}$ , the theoretical expressions of check node degree $d_{c}$ and spreading length m are derived by fixed point equation array. Then, a reliable region where our multi-user system can decode successfully is obtained by solving uncertainty of the inverse problem. Finally, the optimal parameters $(d_{c}^{o}, d_{v}^{o},m^{o})$ of LDPC code degree distribution and spreading length in the reliable region are selected to maximize the transmission rate. Numerical results show that our derivation is effective and efficient, and exhibits much lower complexity than EXIT chart.
Keywords:
Multi-user system
degree distribution
spreading
maximum transmission rate
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W