• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International symposium on Personal, Indoor, and Mobile Radio Communications >Fast convergence of joint demodulation and decoding based on joint sparse graph for spatially coupling data transmission
【24h】

Fast convergence of joint demodulation and decoding based on joint sparse graph for spatially coupling data transmission

机译：基于联合稀疏图的联合解调与解码快速收敛，用于空间耦合数据传输

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.
机译：空间耦合数据传输（SCDT）是一种多址技术。由于SCDT和低密度奇偶校验（LDPC）码都可以由因子图表示，因此构造了包括SCDT和LDPC码的单个图的联合稀疏图（JSG）。基于JSG，在并行调度中应用信念传播（BP）算法进行联合解调和解码（JDD），但收敛速度较慢。为了加快收敛速度​​，提出了一种新的序列表。研究了两个计划的迭代JDD的外部信息传输（EXIT）图，并用于评估它们的收敛行为。 EXIT分析和仿真结果表明，可以节省大约一半的迭代次数，但会付出边际系统性能损失的代价。此外，与单独的解调和解码，turbo结构的JDD和解耦结构的JDD相比，基于JSG for SCDT的JDD通过利用串行调度实现了最佳性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号