网络卷积协同通信新系统及性能

doi:10.13190/jbupt.200804.15.haojj

北京邮电大学学报 ›› 2008, Vol. 31 ›› Issue (4): 15-19.doi: 10.13190/jbupt.200804.15.haojj

网络卷积协同通信新系统及性能

郝建军，李剑峰，罗涛，乐光新

北京邮电大学电信工程学院，北京 100876

收稿日期:2008-03-31 修回日期:1900-01-01 出版日期:2008-08-30 发布日期:2008-08-30
通讯作者: 郝建军

Studies on Performance of a Network Convolutional Cooperative Communication System

HAO Jian-jun，LI Jian-feng，LUO Tao，YUE Guang-xin

School of Telecommunications Engineering，Beijing University of Posts and Telecommunications，Beijing 100876，China

Received:2008-03-31 Revised:1900-01-01 Online:2008-08-30 Published:2008-08-30
Contact: HAO Jian-jun

摘要/Abstract

摘要：

提出一种新的协同通信系统——网络卷积协同通信系统。新方案借鉴网络编码的思想，对协同用户自身要传输的数据和需要转发的同伴数据进行相关卷积编码，这样整个协同通信方案可等效为一个卷积编码器，在获得分集增益的同时可获得编码增益，提高系统的误码性能。在假设协同用户间信道理想的情况下，理论推导出系统误码率性能的上界。理论分析和仿真结果表明，网络卷积协同通信系统在协同用户间信道理想时，在误比特率为10^-3时，较编码协同通信和无协同通信系统分别大约有8～9 dB和11～13 dB的增益。

关键词: 协同通信, 网络编码, 卷积编码, 分集技术

Abstract:

A new identity-based partially blind signature scheme was proposed. Assuming the intractability of the q-Strong Diffie-Hellman problem, the scheme was proved to be unforgeable in the random oracle model. Compared with other existing schemes, the new scheme performs more efficient in computation because it doesn’t need inefficient MapToPoint hash function and only needs one pairing computation. Based on the scheme mentioned above, a restrictive partially blind signature is proposed and proved to be efficient, correct, unforgeable, as well as restrictive and partially blind.

Key words: cooperative communication, network coding, convolution coding, diversity technology

中图分类号:

TN929.5

郝建军，李剑峰，罗涛，乐光新. 网络卷积协同通信新系统及性能[J]. 北京邮电大学学报, 2008, 31(4): 15-19.

HAO Jian-jun，LI Jian-feng，LUO Tao，YUE Guang-xin. Studies on Performance of a Network Convolutional Cooperative Communication System[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(4): 15-19.

参考文献

[1] Paulraj A, Nabar R, Gore D. Introduction to space-time wireless communications[M]. Cambridge: Cambridge University Press, 2003: 6-10.
[2] 罗涛, 乐光新. 多天线无线通信原理与应用[M]. 北京: 北京邮电大学出版社, 2005: 68-173.
[3] Yang Hongwei. A road to future broadband wireless access MIMO-OFDM-based air interface[J]. IEEE Communications Magazine, 2005, 43(1): 53-60.
[4] Roh W, Paulraj A. MIMO channel capacity for the distributed antenna systems//VTC'2002. Vancouver: IEEE Press, 2002: 706-709.
[5] Nosratinia A, Hunter T E, Hedayat A. Cooperative communication in wireless networks[J]. IEEE Communications Magazine, 2004, 42(10): 74-80.
[6] Sendonaris A, Erkip E, Aazhang B. User cooperation diversity part Ⅰ and part Ⅱ[J]. IEEE Trans Commun, 2003, 51(11): 1927-1948.
[7] Janani M, Hedayat A, Hunter T E, et al. Coded cooperation in wireless communications: space-time transmission and iterative decoding[J]. IEEE Trans Sig Proc, 2004, 52(2): 362-371.
[8] Laneman J N, Wornell G W. Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks[J]. IEEE Trans on Info Theory, 2003, 49(10): 2415-2425.
[9] Ahlswede R, Cai N, Li S-Y R, et al. Network information flow[J]. IEEE Trans on Info Theory, 2000, 46(4): 1204-1216.
[10] Proakis J G. Digital communication[M]. 3rd ed. New York: McGraw-Hill, 1995.
[11] Simon M K, Alouini M-S. Digital communication over fading channels[M]. 2nd ed. New York: John Wiley and Sons, 2005: 763-765.
[12] Malkamaki E, Leib H. Evaluating the performance of convolutional codes over block fading channels[J]. IEEE Trans on Info Theory, 1999, 45(5): 1643-1646.
[13] Craig J W. A new, simple, and exact result for calculating the probability of error for two-dimensional signal constellations//IEEE MILCOM. McLean: IEEE Press,1991: 571-575.
[14] Simon M K, Alouini M-S. Digital communication over fading channels[M]. 3rd ed. New York: John Wiley and Sons, 2005: 123-125.
[15] Chang Jinn-Ja, Hwang Der-June, Lin Mao-Chao. Some extended results on the search for good convolutional codes[J]. IEEE Trans on Info Theory, 1997, 43(5): 1682-1697.

网络卷积协同通信新系统及性能

Studies on Performance of a Network Convolutional Cooperative Communication System

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

[1]	王璞刘超包建荣姜斌. 信息感知的分层加权干扰消除编码缓存[J]. 北京邮电大学学报, 2023, 46(4): 46-51.
[2]	何建华, 赵辉, 徐晓斌, 闫蕾, 王尚广. 基于改进双层LT码的天基物联网数据收集方法[J]. 北京邮电大学学报, 2020, 43(6): 118-125.
[3]	温卫. 基于密度聚类的容迟网络路由协议[J]. 北京邮电大学学报, 2020, 43(5): 137-142.
[4]	姚建盛, 马春光, 袁琪, 李增鹏. 基于流内与流间网络编码的DTMSN广播传输机制[J]. 北京邮电大学学报, 2017, 40(5): 18-23.
[5]	黄恺翔, 陈越, 贾洪勇, 兰巨龙. 可重构网络体系下的组播机制[J]. 北京邮电大学学报, 2015, 38(5): 66-70.
[6]	李恩玉, 董云泉, 宋传旺, 李言胜. 反馈判断的自适应机会转发策略[J]. 北京邮电大学学报, 2015, 38(3): 61-65,70.
[7]	刘焕淋, 胡晓慧, 陈勇, 张盛峰. 多波长转换结合网络编码的光组播结构和最小转换度调度[J]. 北京邮电大学学报, 2015, 38(3): 99-102,116.
[8]	欧静兰, 吴皓威, 邹玉涛, 胡亚文. 过时信道状态下机会双向中继选择算法[J]. 北京邮电大学学报, 2014, 37(6): 44-48.
[9]	宋小全, 胡鹏, 孙旭. 基于局部重传和网络编码的可靠性传输机制[J]. 北京邮电大学学报, 2014, 37(4): 54-58.
[10]	覃团发, 李亮亮, 闫龙, 邢杰, 蒙云番. 基于网络编码和占空比的无线传感器网络节能方案[J]. 北京邮电大学学报, 2014, 37(4): 83-87.
[11]	吴皓威, 曹耘瑕, 李恩玉, 欧静兰, 杨士中. 基于竞争策略和ARQ的增强型放大转发协议[J]. 北京邮电大学学报, 2013, 36(6): 27-31.
[12]	谢垂益, 贾忠田, 卿斯汉, 罗守山, 程明智. 适用于云存储冗余的半随机线性网络编码[J]. 北京邮电大学学报, 2013, 36(3): 30-34.
[13]	朱艺华, 田志坚, 池凯凯. 分布式存储系统中带宽最优的数据修复策略[J]. 北京邮电大学学报, 2013, 36(3): 25-29.
[14]	刘焕淋秦亮谢芸徽. 多速率分层光组播的波长带宽优化分配[J]. 北京邮电大学学报, 2013, 36(2): 60-63.
[15]	田贤忠陈群朱金凤. 无线网络中任意路径编码感知机会路由[J]. 北京邮电大学学报, 2013, 36(1): 46-49.