中继编码协作系统等效点对点传输模型的研究

doi:10.3969/j.issn.1000-436x.2012.12.013

摘要/Abstract

摘要：

摘要：研究了LDPC 编码中继协作通信系统及其编码协作系统目的点译码器基于双层Tanner图的LDPC 联合迭代译码算法，通过在目的点接收机引入算术/几何平均信噪比的概念，将中继编码协作系统转换成等效的易于分析的点对点传输模型，利用点对点传输中的原理研究较复杂编码中继协作系统的性能。理论分析和模拟结果表明，在相同的条件下LDPC中继编码协作系统及其等效点对点编码传输系统的性能非常接近，从而证实了本文所提出的等效点对点传输模型的合理性，以及基于双层Tanner图的LDPC联合迭代译码算法的有效性。

关键词: 中继协作, LDPC码, 双层Tanner图, 联合迭代译码, 算术和几何平均信噪比

Abstract:

LDPC-coded relay cooperation and its joint iterative decoding based on the bi-layer Tanner graph were investigated.The coded relay cooperation becomed an equivalent and relatively simple point-to-point transmission model by introducing the notation of average arithmetic/geometr SNR for the receiver in the destination,which could be employed to perform the further study on more complex coded relay cooperations.Both LDPC-coded relay cooperation and its equivalent point-to-point model have almost the same performance by theoretical analysis and ical simulation,which proves the validity of the introduced equivalent model and the joint iterative decoding based on bi-layer Tanner graph.

张秋霞,仰枫帆,张顺外,罗琳. 中继编码协作系统等效点对点传输模型的研究[J]. 通信学报, 2012, 33(12): 100-107.

Qiu-xia ZHANG,Feng-fan YANG,Shun-wai ZHANG,Lin LUO. Study of equivalent point-to-point transmission model for coded relay cooperations[J]. Journal on Communications, 2012, 33(12): 100-107.

图/表 7

图1

图2

图3

图4

图5

图6

图7

参考文献 15

[7]	LI C X , YUE G S , WANG X D . LDPC code design for half-duplex cooperative relay[J]. IEEE Transactions on Wireless Communications, 2008,7(11): 4558-4567.
[8]	CANCES M , MEGHDADI V J . Optimized low density parity check codes designs for half duplex relay channels[J]. IEEE Transactions on Wireless Communications, 2009,8(7): 3390-3395.
[9]	LI C X , YUE G S , KHOJASTEPOUR M A . LDPC-coded cooperative relay systems:performance analysis and code design[J]. IEEE Transactions on Communications, 2008,56(3): 485-496.
[10]	陈婧文, 仰枫帆 . 基于非正规LDPC码的中继协作通信及其联合迭代译码的性能研究[J]. 电子学报, 2010,38(7): 1535-1540. CHEN J W , YANG F F . Study on the irregular-LDPC-based relay cooperation and performance of joint iterative decoding[J]. Acta Electronica Sinica , 2010,38(7): 1535-1540.
[11]	CHEN J W , YANG F F , LUO L ,et al. Joint iterative decoding for simple-encoding systematic irregular-LDPC based coded cooperation in non-ideal relay channel[J]. Journal of Electronics (China), 2010,27(3): 305-315.
[12]	GALLAGER R G . Low-density parity-check codes[J]. IRE Transactions on Information Theory, 1963,15(7): 728-739.
[13]	LI Y , SONG G H , WANG L L . Design of joint network-low density parity check codes based on the EXIT charts[J]. IEEE Communications Letters, 2009,13(8): 600-602.
[14]	MACKAY D J C , NEAL R M . Near Shannon limit performance of low density parity check codes[J]. Electric Lett, 1996,32(7): 1645-1646.
[1]	LANEMAN J N , TSE D N , WORNELL G W . Cooperative diversity in wireless networks:efficient protocols and outage behavior[J]. IEEE Transactions on Information Theory, 2004,50(12): 3062-3080.
[2]	EKREM E , ULUKUS S . Secrecy in cooperative relay broadcast channels[A]. IEEE International Symposium on Information Theory[C]. Toronto,Canada, 2008. 2117-2221.
[3]	JANANI M , HEDAYAT A , HUNTER T E . Coded cooperation in wireless communications:space-time transmission and iterative decoding[J]. IEEE Transactions on Signal Processing, 2004,52(2): 362-371.
[4]	刘星成, 叶远生 . 系统RA码的基于WBF策略的改进BP译码算法[J]. 电子学报, 2010,38(7): 1541-1546. LIU X C , YE Y S . Improved BP decoding algorithm based WBF scheme for systematic RA codes[J]. Acta Electronica Sinica, 2010,38(7): 1541-1546.
[5]	韩玉洁 . 新型协同无线通信网络中多层协作处理技术的研究[D]. 南京:东南大学, 2011. HAN Y J . The Study of Multi-Level Cooperative Processing Techniques for Wireless Cooperation Networks[D]. Nanjing:Southeast University, 2011.
[6]	KHOJASTEPOUR M A , AHMED N , AAZHANG B . Code design for the relay channel and factor graph decoding[A]. 38th Asilomar Conf Sig Sys Comput[C]. Paci?c Grove,CA,USA, 2004. 2000-2004.
[15]	KSCHISCHANG F R , FREY B J , LOELIGER H A . Factor graphs and the sum-product algorithm[J]. IEEE Transactions on Information Theory, 2001,47(2): 498-519.