• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Low Density Parity Check Code Designs For Distributed Joint Source-Channel Coding Over Multiple Access Channels.
【24h】

Low Density Parity Check Code Designs For Distributed Joint Source-Channel Coding Over Multiple Access Channels.

机译：用于多个访问信道上的分布式联合源信道编码的低密度奇偶校验代码设计。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The efficient and reliable communication of data from multiple sources to a single receiver plays an important role in emerging applications such as wireless sensor networks. The correlation among observations picked-up by spatially distributed sensors in such a network can be exploited to enhance the efficiency and reliability of communication. In particular, information theory shows that optimal communication of information from correlated sources requires distributed joint source-channel (DJSC) coding.;Considering an orthogonal MAC with two correlated binary sources, an asymptotically optimal DJSC code construction capable of achieving any rate-pair in the theoretically-achievable two-user rate-region is presented. A practical approach to realizing this scheme using irregular LDPC codes is then developed. Experimental results are presented which demonstrate that the proposed codes can approach theoretical bounds when the codeword length is increased. For short codeword length and high inter-source correlation, these DJSC codes are shown to significantly outperform separate source and channel codes.;Next, the DJSC code design for the transmission of a pair of correlated binary sources over a Gaussian MAC (GMAC) is investigated. The separate source and channel coding is known to be sub-optimal in this case. For the optimization of a pair of irregular LDPC codes, the EXIT analysis for message passing in a joint factor-graph decoder is analyzed, and an approach to modeling the probability density functions of messages associated with graph nodes which represent the inter-source dependence is proposed. Simulation results show that, for sufficiently large codeword lengths and high inter-source correlation, the proposed DJSC codes for GMAC can achieve rates higher than the theoretical upper bound for separate source and channel coding.;This dissertation develops new approaches to designing DJSC codes based on low density parity check (LDPC) codes. The existence of low complexity code optimization algorithms and decoding algorithms make these codes ideal for joint optimization and decoding of multiple codes operating on correlated sources. The well known EXIT analysis-based LDPC code optimization method for channel coding in single-user point-to-point systems is extended to the optimization of two-user LDPC codes for DJSC coding in multi-access channels (MACs) with correlated users.
机译：从多个源到单个接收器的数据的高效，可靠的通信在诸如无线传感器网络之类的新兴应用中起着重要作用。可以利用这种网络中的空间分布传感器采集的观测值之间的相关性，以提高通信的效率和可靠性。特别是，信息理论表明，来自相关源的信息的最佳通信需要分布式联合源信道（DJSC）编码;考虑到具有两个相关二进制源的正交MAC，能够在任意情况下实现任何速率对的渐近最优DJSC代码构造给出了理论上可实现的两用户速率区域。然后，开发了一种使用不规则LDPC码实现此方案的实用方法。实验结果表明，当码字长度增加时，所提出的编码可以逼近理论界限。对于较短的代码字长度和较高的源间相关性，这些DJSC代码显示出明显优于单独的源代码和信道代码。接下来，用于在高斯MAC（GMAC）上传输一对相关二进制源的DJSC代码设计是：调查。已知在这种情况下，分开的源和信道编码是次优的。为了优化一对不规则LDPC码，分析了在联合因子图解码器中传递消息的EXIT分析，并建立了一种与表示源间依赖关系的图节点相关的消息的概率密度函数建模的方法。建议。仿真结果表明，对于足够长的码字长度和较高的源间相关性，提出的针对GMAC的DJSC码可以达到比单独的源和信道编码理论上限更高的速率。在低密度奇偶校验（LDPC）码上。低复杂度代码优化算法和解码算法的存在使这些代码非常适合联合优化和对在相关源上运行的多个代码进行解码。用于单用户点对点系统中信道编码的众所周知的基于EXIT分析的LDPC码优化方法被扩展为具有相关用户的多用户信道（MAC）中DJSC编码的两用户LDPC码的优化。

著录项

  • 作者

    Shahid, Iqbal.;

  • 作者单位

    University of Manitoba (Canada).;

  • 授予单位 University of Manitoba (Canada).;
  • 学科 Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 2013
  • 页码 123 p.
  • 总页数 123
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号