检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:TANG Lei YANG Fengfan ZHANG Shunwai SAQIB Ejaz LUO Lin
机构地区:[1]College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics [2]School of Communication Engineering, Nanjing Institute of Technology [3]College of Information Science and Engineering, Southeast University
出 处:《Chinese Journal of Electronics》2016年第1期179-184,共6页电子学报(英文版)
基 金:supported by the School Scientific Research Fund of Nanjing Institute of Technology(No.YKJ201417)
摘 要:This paper proposes an effective method to jointly design girth-4 cycle-free Quasi-cyclic(QC) Lowdensity parity-check(LDPC) codes for multi-relay cooperation in a Rayleigh fading channel, where the joint iterative decoding by Min-sum algorithm(MSA) based on the introduced joint Tanner graph is also presented at the destination. Theoretical analysis and simulation show that the proposed QC-LDPC coded cooperation outperforms the randomly coded cooperation under the same conditions.This paper proposes an effective method to jointly design girth-4 cycle-free Quasi-cyclic(QC) Lowdensity parity-check(LDPC) codes for multi-relay cooperation in a Rayleigh fading channel, where the joint iterative decoding by Min-sum algorithm(MSA) based on the introduced joint Tanner graph is also presented at the destination. Theoretical analysis and simulation show that the proposed QC-LDPC coded cooperation outperforms the randomly coded cooperation under the same conditions.
关 键 词:Coded cooperation Low-density parity-check (LDPC) codes Min-sum algorithm (MSA) Joint it-erative decoding Treble-layer Tanner graph.
分 类 号:TN911.22[电子电信—通信与信息系统] TP391.41[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117