检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学技术大学电子工程与信息科学系,合肥230027
出 处:《电子与信息学报》2012年第10期2320-2325,共6页Journal of Electronics & Information Technology
基 金:国家科技重大专项(2010ZX03003-001);国家863计划项目(SS2012 AA011702)资助课题
摘 要:在多中继协作网络中,机会中继编码协作已然成为一种高效且被广泛研究的协作策略,然而现有工作存在着资源浪费或者系统复杂度高的问题。为此,针对如何在资源利用率与系统复杂度之间获得良好折中的问题,该文提出一种新型的机会中继编码协作策略,在不增加额外开销的情况下,使源节点能够自适应地向目的节点发送校验信息。并在Nakagami信道模型下,给出了系统中断概率的解析表达和误比特率上界的闭式表达。仿真结果表明,与已有机会中继编码协作策略相比,在获得性能提升的同时,所提策略对系统复杂度和资源利用率均有所改善。Opportunistic relaying coded cooperation is already an efficient and widely investigated cooperative scheme in multi-relay networks. However, the previous works still have deficiencies, such as high system complexity and low resource utilization. In this paper, a novel opportunistic relaying coded cooperation is proposed to achieve an acceptable tradeoff between resource utilization and system complexity, where the source transmits the parity to the destination adaptively without extra overheads. The analytical expressions of the outage probability and the upper bound of bit error probability over Nakagami fading channels are derived. Simulation results reveal that the proposed scheme, compared with the existing opportunistic relaying coded cooperation schemes, achieves better performance and makes an improvement on both system complexity and resource utilization.
关 键 词:协作通信 机会中继 编码协作 中断概率 误比特率 NAKAGAMI信道
分 类 号:TN925[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15