Name
Title | ||
|---|---|---|
Fast Convergence Of Joint Demodulation And Decoding Based On Joint Sparse Graph For Spatially Coupling Data Transmission |
Abstract | ||
|---|---|---|
Spatially coupling data transmission (SCDT) is a multiple access technique. Since both SCDT and low density parity-check (LDPC) codes can be represented by a factor graph, a joint sparse graph (JSG) including the single graphs of SCDT and LDPC codes is constructed. Based on the JSG, the joint demodulation and decoding (JDD) by applying belief propagation (BP) algorithm in the parallel schedule is performed, but its convergence rate is slow. In order to accelerate convergence rate, a new serial schedule is proposed. The extrinsic information transfer (EXIT) charts of iterative JDD are investigated for the two schedules and employed to evaluate their converge behaviour. EXIT analysis and simulation results demonstrate that about half iteration number can be saved at the cost of marginal system performance loss. Furthermore, compared with separate demodulation and decoding, turbo-structured JDD and the uncoupling structured JDD, the JDD based on JSG for SCDT by utilizing serial schedule achieves the best performance. |
Year | Venue | Field |
|---|---|---|
2016 | 2016 IEEE 27TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC) | Factor graph,Demodulation,Low-density parity-check code,Computer science,Real-time computing,Schedule,Rate of convergence,Decoding methods,Belief propagation,Dense graph |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhengxuan Liu | 1 | 2 | 1.37 |
| yanyan guo | 2 | 21 | 2.33 |
| Guixia Kang | 3 | 106 | 36.59 |
| Zhongwei Si | 4 | 43 | 7.79 |
| Ningbo Zhang | 5 | 64 | 4.63 |