天津大学电子信息工程学院,天津,300072
网络首发:2012-04-10,
纸质出版:2012
移动端阅览
张学一, 付晓梅, 周化锰. 一种格约减辅助的协作多址接入方案[J]. 西安交通大学学报, 2012,46(4):100-105.
A Lattice Reduction-Based Cooperative Multiple Access Scheme[J]. 2012, 46(4): 100-105.
针对传统协作多址接入(CMA)系统可靠性不高的问题
提出了一种格约减(LR)辅助的协作多址接入方案(LR-CMA).首先将传统CMA系统中源端到目的端的信道等效成虚拟多输入多输出(MIMO)模型
然后在接收端用LR算法改善虚拟MIMO信道矩阵的正交性
减少信号之间的干扰
最后检测并恢复信号. 通过计算机仿真将LR-CMA方案与传统CMA方案相比较
结果表明
2种方案的复杂度均随维度呈指数增长
但LR-CMA方案的误码率性能要优于传统CMA方案
接近复杂度很高的最大似然检测的误码率性能
在信噪比为30 dB时
其误码率差距超过14 dB
并且LR-CMA方案在衰落信道下可以获得最优的分集增益和复用增益的均衡.
A new cooperative multiple access scheme is proposed to improve the reliability of traditional cooperative multiple access(CMA)system. The new scheme applies lattice reduction to cooperative multiple access(CMA)system. Firstly
the channel between source and destination is equated into a virtual model with multiple inputs and multiple outputs(MIMO). The signal is processed using the LR algorithm at the destination to improve the orthogonality of channel matrix
to reduce interference
and then to be detected. Comparisons with the traditional CMA system show that the complexity of both the algorithms increases as the index is increased
but the bit error rate of LR-CMA system is better than that of the traditional CMA
and that the LR-CMA system achieves the bit error rate(BER)of maximum likelihood detection
and the BER gap outstrips 14 dB at the SNR of 30 dB. It also can get optimal diversity- multiplexing tradeoff.
TIAN Penghui, CHIN K H, SUN Sumei. Joint network-channel code design for block fading cooperative multiple access channel [C]∥Proceedings of IEEE Information Theory Workshop(ITW). Piscataway, NJ, USA: IEEE, 2010:1-5.
HU Yongxu, LI Kwok-Hung, THE K C. Performance analysis of two-user cooperative multiple access systems with DF relaying and superposition modulation [J]. IEEE Transactions on Vehicular Technology, 2011, 60(7): 3118-3126.
REBELATTO J L, UCHOA-FILHO B F,LI Yonghui, et al. Adaptive distributed network-channel coding for cooperative multiple access channel [C]∥IEEE International Conference on Communications. Piscataway, NJ, USA: IEEE, 2011:1-5.
孙宇,何大可. 格基约减算法及其应用[J]. 信息安全与通信保密, 2005(3):154-156.
SUN Yu,HE Dake. LR algorithm and its applications[J]. Information Security and Communications Privacy, 2005(3):154-156.
VETTER H, PONAMPALAM V, SANDELL M, et al. Fixed complexity LLL algorithm [J]. IEEE Transactions on Signal Processing, 2009, 57(4): 1634-1637.
WUBBEN S D, JALDEN J, MATZ G. Lattice reduction [J]. Signal Processing Magazine, 2011, 28(3):70-91.
赵晓群,章惜珍,屈非. MIMO系统LLL格基约减检测技术研究[J].大连民族学院学报,2011,13(1): 19-23.
ZHAO Xiaoqun, ZHANG Xizhen, QU Fei. Research on LLL lattice reduction algorithm for MIMO detection [J]. Journal of Dalian Nationalities University, 2011,13(1):19-23.
MURUGAN A, AZARIAN K, GAMAL H E. Cooperative lattice coding and decoding in half-duplex channels [J]. IEEE Journal on Communication, 2007, 25(2):286-279.
CONG Ling, MOW Waiho, NICK H G. Variants of the LLL algorithm in digital communications: complexity analysis and fixed-complexity implementation [EB/OL].(2010-06-12)[2011-07-15]. http:∥arxiv.org/abs/1006.1661.
ELIA P, JALDEN J. General DMT optimality of LR-aided linear MIMO-MAC transceivers with worst-case complexity at most linear in sum-rate[C]∥Proceedings of IEEE Information Theory Workshop(ITW). Piscataway, NJ, USA:IEEE, 2010:1-5.
DING Zhiguo, LEUNG K K, GOECKEL D L, et al. On the study of network coding with diversity[J]. IEEE Transactions on Wireless Communications, 2009, 8(3):1247-1259.
JALDEN J, ELIA P. LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes [C]∥Proceedings of IEEE International Symposium on Information Theory. Piscataway, NJ, USA:IEEE, 2009: 1263-1267.
宽带认知无线电网络分布式协作压缩频谱感知算法. 2011,45(4):67-71.
线性检测中的最优空时编码设计与分析. 2011,45(2):59-63.
一种增强型选择放大转发机会协作分集协议. 2010,44(8):53-57.
无线协作网络中存在干扰时的中继选择协议. 2010,44(2):72-76.
改进的集中式协作用户选择方法. 2009,43(8):64-67.
频率选择性衰落信道中的时间反驻正交空时分组码设计. 2009,43(8):53-58.
一种迭代处理单元外部信息转移函数的精确计算方法. 2009,43(8):68-71.
放大转发异步协作通信系统中的差分空时频传输方案. 2009,43(6):62-66.
一种正交调制协作系统的功率分配方法. 2009,43(2):81-85.
正交频分复用分组传输系统中载波频偏和信道的联合估计. 2008,42(6):739-742.
0
浏览量
4
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621