高效QC-LDPC預(yù)編碼Raptor編碼協(xié)作方案

包建榮; 何丹; 許曉榮; 姜斌

doi:10.11999/JEIT160400

高效QC-LDPC預(yù)編碼Raptor編碼協(xié)作方案

doi: 10.11999/JEIT160400

2.
(杭州電子科技大學(xué)通信工程學(xué)院杭州 310018) ②(東南大學(xué)移動(dòng)通信國(guó)家重點(diǎn)實(shí)驗(yàn)室南京 210096)

基金項(xiàng)目:

浙江省自然科學(xué)基金(LZ14F010003, LY15 F010008)，國(guó)家自然科學(xué)基金(61471152)，東南大學(xué)移動(dòng)通信國(guó)家重點(diǎn)實(shí)驗(yàn)室開(kāi)放研究基金(2014D02)，浙江省公益性技術(shù)應(yīng)用研究計(jì)劃 (2015C31103)

計(jì)量
- 文章訪問(wèn)數(shù): 1678
- HTML全文瀏覽量: 181
- PDF下載量: 415
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2016-04-22
- 修回日期: 2016-09-02
- 刊出日期: 2017-03-19

Efficient Raptor Coded Cooperation Scheme via QC-LDPC Pre-coding

2.
(School of Telecommunication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China)

Funds:

Zhejiang Provincial National Natural Science Foundation (LZ14F010003, LY15F010008), The National Natural Science Foundation of China (61471152), The Open Research Fund of National Mobile Communications Research Laboratory Southeast University (2014D02), Zhejiang Provincial Science and Technology Plan Project (2015C31103)

摘要

摘要: 傳統(tǒng)協(xié)作通信常采用譯碼轉(zhuǎn)發(fā)(DF)協(xié)議。而該協(xié)議在源-中繼節(jié)點(diǎn)鏈路通信質(zhì)量較差情況下，易出現(xiàn)誤碼傳播現(xiàn)象。為了改進(jìn)該問(wèn)題，該文提出可應(yīng)用于編碼協(xié)作(CC)機(jī)制的Raptor編碼協(xié)作方案，其可在高信噪比下獲得較大編碼增益和滿(mǎn)分集增益。它在源節(jié)點(diǎn)和中繼節(jié)點(diǎn)使用不同Raptor編碼，使中繼節(jié)點(diǎn)新編碼碼字為源節(jié)點(diǎn)碼字的部分校驗(yàn)信息，使接收端所得碼字獨(dú)立不等。因此，目的節(jié)點(diǎn)在分別接收來(lái)自不同獨(dú)立鏈路消息后，可根據(jù)碼字間固有關(guān)系聯(lián)合譯碼，以獲得額外發(fā)送空間分集增益。為了降低復(fù)雜度，Raptor碼的預(yù)編碼還可采用整數(shù)序列構(gòu)造的準(zhǔn)循環(huán)低密度奇偶校驗(yàn)(QC-LDPC)碼，從而獲得較低線性預(yù)編碼復(fù)雜度。仿真表明：在誤比特率(BER)為10-4 時(shí)，所提Raptor編碼協(xié)作方案較傳統(tǒng)DF協(xié)議Raptor方案，Raptor與分布式空時(shí)分組碼(DSTBC)結(jié)合方案，分別有2 dB和1 dB增益。此外，當(dāng)中斷概率為10-2時(shí)，其性能較CC, DF協(xié)作方案提高了約2 dB和7 dB。
- Raptor編碼協(xié)作 /
- 誤比特率 /
- 中斷概率 /
- 準(zhǔn)循環(huán)低密度奇偶校驗(yàn)碼 /
- 整數(shù)序列
Abstract: Traditionally, the cooperative communications usually uses Decode-and-Forward (DF) strategy. However, there is easily error propagation phenomenon by the strategy, when the quality of the communication link between source and relay is poor. To solve the problem, a novel Raptor coded cooperation scheme, which can be used in the Coded Cooperation (CC) strategy, is proposed to achieve rather high coding gains and full diversity gains in high Signal-to-Noise Ratio (SNR) regime. In this scheme, different Raptor codes are employed at the source and relay nodes, so the codeword at each node is independent and unequal. Meanwhile, the codeword at relay node is the parity check section of the codeword at the source node. Therefore, after receiving the data transmitted from different independent links, the destination node tries to decode them jointly by the intrinsic relationship among them, to obtain additionally spatial diversity gains in transmission. In addition, in order to reduce the complexity of Raptor encoding and decoding, the Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes are constructed by integer sequence and employed as the pre-coding. Simulations indicate that the proposed Raptor CC scheme achieves 2 dB and 1 dB performance gains compared with those of the traditional DF based one and a scheme with the combination of a Raptor code and a Distributed Space-Time Block Code (DSTBC), respectively, at Bit Error Rate (BER) of10-4 . Moreover, the performance improves about 2 dB and 7 dB at the outage of10-2 , when compared with those of the CC strategy and DF strategy, respectively.
- Raptor coded cooperation /
- Bit Error Ratio (BER) /
- Outage probability /
- Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) code /
- Integer sequence

HTML全文

參考文獻(xiàn)(27)

SHOKROLLAHI A. Raptor codes[J]. IEEE Transactions on Information Theory, 2006, 52(6): 2551-2567. doi: 10.1109/ TIT.2006.874390.

ZHANG H T and KUO G S. Raptor code for downlink cooperative wireless cellular networks[C]. IEEE Vehicular Technology Conference 2008, Beijing, China, 2008: 1-5. doi: 10.1109/VETECF.2008.344.

祝開(kāi)艷, 王洪玉, 孫文珠, 等. 一種分布式噴泉碼在協(xié)作通信中的應(yīng)用[J]. 電子學(xué)報(bào), 2014, 42(7): 1249-1255. doi: 10.3969 /j.issn.0372-2112.2014.07.001.

ZHU Kaiyan, WANG Hongyu, SUN Wenzhu, et al. A distributed fountain code for cooperative communications[J]. Acta Electronica Sinica, 2014, 42(7): 1249-1255. doi: 10.3969/ j.issn.0372-2112.2014.07.001.

JAMES A and MADHUKUMAR A S. Performance limits of rateless codes in delay constrained multi-hop relay networks[C]. IEEE International Conference on Communications Workshops 2014, Sydney, Australia, 2014: 325-330. doi: 10.1109/ICCW.2014.6881217.

寇明延, 張登福, 徐志剛, 等. MIMO時(shí)分蜂窩系統(tǒng)混合協(xié)作上行性能研究[J]. 電子與信息學(xué)報(bào), 2010, 32(7): 1538-1542. doi: 10.3724/SP.J.1146.2009.01053.

KOU Mingyan, ZHANG Dengfu, XU Zhigang, et al. Uplink performance of MIMO TDMA cellular system with hybrid collaboration[J]. Journal of Electronics Information Technology, 2010, 32(7): 1538-1542. doi: 10.3724/SP.J.1146. 2009.01053.

HU J and DUMAN T M. Low density parity check codes over half-duplex relay channels[C]. IEEE International Symposium on Information Theory 2006, Seattle, USA, 2006: 972-976. doi: 10.1109/ISIT.2006.261872.

UPPAL M, HOST-MADSEN A, and XIONG Z X. Practical rateless cooperation in multiple access channels using multiplexed raptor codes[C]. IEEE International Symposium on Information Theory 2007, Nice, France, 2007: 671-675. doi: 10.1109/ISIT.2007.4557302.

GALLAGER R G. Low-density parity-check codes[J]. IRE Transaction on Information Theory, 1962, 8(1): 21-28. doi: 10.1109/TIT.1962.1057683.

張軼, 達(dá)新宇, 蘇一棟. 利用等差數(shù)列構(gòu)造大圍長(zhǎng)準(zhǔn)循環(huán)低密度奇偶校驗(yàn)碼[J]. 電子與信息學(xué)報(bào), 2015, 37(2): 394-398. doi: 10.11999/JEIT140538.

ZHANG Yi, DA Xinyu, and SU Yidong. Construction of quasi-cyclic low-density parity-check codes with a large girth based on arithmetic progression[J]. Journal of Electronics Information Technology, 2015, 37(2): 394-398. doi: 10.11999/ JEIT140538.

ZHANG J and ZHANG G. Deterministic girth-eight QC-LDPC codes with large column weight[J]. IEEE Communications Letters, 2014, 18(4): 656-659. doi: 10.1109/ LCOMM.2014.030114.132853.

張國(guó)華, 陳超, 楊洋, 等. Girth-8 (3,L)-規(guī)則QC-LDPC碼的一種確定性構(gòu)造方法[J]. 電子與信息學(xué)報(bào), 2010, 32(5): 1152-1156. doi: 10.3724/SP.J.1146.2009.00838.

ZHANG Guohua, CHEN Chao, YANG Yang, et al. Girth-8 (3, L)-regular QC-LDPC codes based on novel deterministic design technique[J]. Journal of Electronics Information Technology, 2010, 32(5): 1152-1156. doi: 10.3724/SP.J.1146. 2009.00838.

ZHANG S W, SONG R F, and YANG F F. Joint design of QC-LDPC codes for cascade-based multisource coded cooperation[C]. International Conference on Wireless Communications and Signal Processing 2015, Nanjing, China, 2015: 1-4. doi: 10.1109/WCSP.2015.7340967.

ZHANG Y, YANG F F, and SONG W J. Performance analysis for cooperative communication system with QC-LDPC codes constructed with integer sequences[J]. Discrete Dynamics in Nature and Society, 2015, 2015: 1-7. doi: 10.1155/2015/649814.

袁建國(guó), 王望, 梁天宇. 一種高速長(zhǎng)距離光通信系統(tǒng)中QC-LDPC碼的構(gòu)造方法[J]. 光電子激光, 2012, 23(5): 906-909. doi: 10.16136/j.joel.2012.05.025.

YUAN Jianguo, WANG Wang, and LIANG Tianyu. A novel construction method of QC-LDPC codes for high-speed long-haul optical communication systems[J]. Journal of Optoelectronics Laser, 2012, 23(5): 906-909. doi: 10.16136/ j.joel.2012.05.025.

ZHAO D F and LI D B. Coded cooperation scheme using LDPC codes[J]. Journal of Beijing University of Posts and Telecommunications, 2008, 31(5): 121-125.

SIMON M K and ALOUINI M S. Digital Communication Over Fading Channels: A Unified Approach to Performance Analysis[M]. New York: John Wiley Sons, 2000: 506-510. doi: 10.1002/0471200697.

CHEN Wei and CHEN Wen. A new rateless coded cooperation scheme for multiple access channels[C]. IEEE International Conference on Communications 2011 (ICC2011), Kyoto, Japan, 2011: 1-5. doi: 10.1109/icc. 2011.5962473.

彭木根, 王文博. 協(xié)同無(wú)線通信原理與應(yīng)用[M]. 北京: 機(jī)械工業(yè)出版社, 2008: 48-53.

PENG Mugen and WANG Wenbo. Cooperative Wireless Communications: Principles and Practice[M]. Beijing: China Machine Press, 2008: 48-53.

OMID E and AMIN S. Raptor codes on binary memoryless symmetric channels[J]. IEEE Transactions on Information Theory, 2006, 52(5): 2033-2051. doi: 10.1109/TIT.2006. 872855.

段琳琳, 王忠勇, 王瑋, 等. 低復(fù)雜度的自適應(yīng)置信差分迭代譯碼算法[J]. 電子與信息學(xué)報(bào), 2014, 36(11): 2640-2645. doi: 10.3724/SP.J.1146.2014.00234.

DUAN Linlin, WANG Zhongyong, WANG Wei, et al. An adaptive belief propagation difference-map iterative decoding algorithm with low complexity[J]. Journal of Electronics Information Technology, 2014, 36(11): 2640-2645. doi: 10.3724/SP.J.1146.2014.00234.

相關(guān)文章

施引文獻(xiàn)

資源附件(0)

訪問(wèn)統(tǒng)計(jì)