首页 | 本学科首页   官方微博 | 高级检索  
     

网络卷积协同通信新系统及性能
引用本文:郝建军,李剑峰,罗涛,乐光新. 网络卷积协同通信新系统及性能[J]. 北京邮电大学学报, 2008, 31(4): 15-19
作者姓名:郝建军  李剑峰  罗涛  乐光新
作者单位:北京邮电大学电信工程学院,北京,100876;北京邮电大学电信工程学院,北京,100876;北京邮电大学电信工程学院,北京,100876;北京邮电大学电信工程学院,北京,100876
基金项目:国家自然科学基金,教育部高等学校博士学科点专项科研基金
摘    要:提出一种新的协同通信系统——网络卷积协同通信系统。新方案借鉴网络编码的思想,对协同用户自身要传输的数据和需要转发的同伴数据进行相关卷积编码,这样整个协同通信方案可等效为一个卷积编码器,在获得分集增益的同时可获得编码增益,提高系统的误码性能。在假设协同用户间信道理想的情况下,理论推导出系统误码率性能的上界。理论分析和仿真结果表明,网络卷积协同通信系统在协同用户间信道理想时,在误比特率为10-3时,较编码协同通信和无协同通信系统分别大约有8~9 dB和11~13 dB的增益。

关 键 词:协同通信  网络编码  卷积编码  分集技术
收稿时间:2008-03-31

Studies on Performance of a Network Convolutional Cooperative Communication System
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 Telecommunications, 2008, 31(4): 15-19
Authors:HAO Jian-jun  LI Jian-feng  LUO Tao  YUE Guang-xin
Affiliation:School of Telecommunications Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,China
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.
Keywords:cooperative communication  network coding  convolution coding  diversity technology
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号