首页> 外文会议>IEEE International Conference on Industrial and Information Systems >Low-complexity LDPC decoder for physical layer network coded multi-way wireless relay systems
【24h】

Low-complexity LDPC decoder for physical layer network coded multi-way wireless relay systems

机译:用于物理层网络编码的多路无线中继系统的低复杂度LDPC解码器

获取原文

摘要

Recently, in multi-way relay systems employing physical-layer network coding (PNC), channel condition-based pair selection for pairwise information exchange has drawn increased attention as it provides improved performance over the alternative approaches such as round-robin scheduling of node pairs. With pairwise information exchange, there is additional time diversity available due to transmission of the same coded information block of most of the nodes twice in two adjacent time slots. This additional time diversity can be exploited to further enhance the system performance by means of joint channel decoding-network coding. To this end, a joint belief propagation (BP)-based channel decoding-network coding algorithm was proposed by us in [9] for the relay node of low density parity check (LDPC)-coded multi-way relay systems. Even though the algorithm of [9] offers much superior performance over separate channel decoding, it is highly computational expensive and may not be suitable for applications in wireless sensor networks. Alternatively, bit-flipping (BF)-based LDPC decoding can be adopted at much lower computational complexity. In this paper, we develop a low complexity joint bit-flipping (BF)-based channel decoding and network coding algorithm for LDPC-based multi-way relay systems. The BER performance of the proposed algorithm is investigated using computer simulation for two commonly used LDPC codes. The simulation results demonstrate that superior BER performance can be achieved using the proposed joint decoding algorithm over separate and independent bit-flipping-based LDPC channel decoding at the relay. The simulation results also verify that our proposed algorithm is capable of harnessing the aforesaid additional time diversity available. Though the performance of the proposed joint decoding algorithm is inferior to the BP-based algorithm of [9], due to its low computationally complexity, this algorithm may be appealing for applications in relay nodes w- th low computational capabilities and memory constraints.
机译:最近,在采用物理层网络编码(PNC)的多路中继系统中,用于成对信息交换的基于信道条件的对选择引起了越来越多的关注,因为它提供了比诸如节点对的循环调度之类的替代方法更高的性能。 。在成对信息交换中,由于在两个相邻时隙中两次大多数节点的相同编码信息块的传输,因此存在额外的时间分集。可以利用这种额外的时间分集来通过联合信道解码-网络编码来进一步增强系统性能。为此,我们在[9]中针对低密度奇偶校验(LDPC)编码的多路中继系统的中继节点提出了一种基于联合信念传播(BP)的信道解码网络编码算法。即使[9]的算法比单独的信道解码提供了更高的性能,但它的计算量却很大,并且可能不适合无线传感器网络中的应用。可替代地,可以以低得多的计算复杂度采用基于比特翻转(BF)的LDPC解码。在本文中,我们为基于LDPC的多路中继系统开发了一种基于低复杂度联合比特翻转(BF)的信道解码和网络编码算法。使用计算机仿真研究了两种常用的LDPC码,从而研究了所提出算法的BER性能。仿真结果表明,与中继站上基于比特翻转的单独和独立的LDPC信道解码相比,所提出的联合解码算法可以实现出色的BER性能。仿真结果也验证了我们提出的算法能够利用上述可用的额外时间分集。尽管所提出的联合解码算法的性能不及[9]的基于BP的算法,但由于其计算复杂度低,该算法可能因其低计算能力和存储限制而吸引了中继节点中的应用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号