• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Efficient Message Passing Decoding Using Vector-Based Messages (Effektiv Meddelandebaserad avkodning med Vektomeddelanden)
【24h】

Efficient Message Passing Decoding Using Vector-Based Messages (Effektiv Meddelandebaserad avkodning med Vektomeddelanden)

机译：使用基于矢量的消息进行高效的消息传递解码（Effektiv meddelandebaserad avkodning med Vektomeddelanden）

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

摘要

Low-Density Parity-Check (LDPC) codes provide strong error correction capability. Early LDPC-work concentrated on the binary Galois Field, GF(2), but here we consider higher order alphabets, GF(q). The code symbols from GF(q) are mapped to M-ary Phase Shift Keying (M-PSK) signals to yield higher spectral efficiency. LDPC codes are commonly decoded using the Message Passing (MP) algorithm, which is an iterative algorithm that passes messages between nodes in a graph representation of the code. Unfortunately, the computational complexity of the optimal MP decoder, the Belief Propagation (BP) decoder, scales as the square of the order of the used Galois Field. To reduce complexity, we investigate a number of simplified MP decoders. Since the information of a PSK signal is found in the phase angle, geometrical vectors and angles are used as messages in the decoders. A promising simplification is the Table Vector Decoder, which approximates the check node operation of a BP decoder by table lookup. The complexity of table-based decoders is unaffected by size of the used Galois Field. For well-designed tables, the table-based decoders suffer only minor losses compared to the optimal Belief Propagation (BP) decoders. We also investigate the theoretical decoding properties using Density Evolution analysis.

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号