共查询到20条相似文献,搜索用时 62 毫秒
1.
在衰落信道环境下,多输入多输出(MIMO)网络编码比传统的网络编码具有更好的鲁棒性.而网络编码与无线中继技术的结合也是目前最具潜力的研究热点之一.从通信基本原理的角度对MIMO双向中继系统的3种通信模型进行介绍,对相应的网络预编码实现的算法和机制进行研究对比,指出3种模型各自的优缺点.最后,讨论该领域的进一步研究方向. 相似文献
2.
在多用户MIMO双向中继系统中,若使用非理想信道模型,中继处仅能获得部分下行信道状态信息,这样将导致系统性能大幅度下降。由此提出基于最小信干噪比最大化的鲁棒预编码方案。仿真表明,该方案不仅可以使最差信干噪比最大化,也有效地改善了系统的比特误码率性能。 相似文献
3.
4.
双向中继网络在提高频谱效率的同时会引入额外的自干扰,本文针对放大转发(AF)模式下双向多输入多输出(MIMO)中继网络中的自干扰抵消问题,从消除信道估计误差引入的剩余自干扰着手,提出一种采用信道独立预编码的盲干扰抵消(BIC)方案。新方案在源节点对信息进行行空间预编码,从而构建不依赖于MIMO信道矩阵的期望信号子空间和自干扰子空间,实现未知信道状态下自干扰抵消和期望信号分离,从而消除非理想信道估计带来的剩余自干扰信号。在此基础上,以最大化有效信噪比为目标设计最佳预编码,通过推导可达和速率的闭合表达式,分析不同方案下信道估计误差对可达和速率的影响。仿真结果表明,新方案在不同的信道估计误差下,能够实现完美自干扰消除,其检测性能和容量均优于基于信道估计的自干扰消除方案。 相似文献
5.
6.
介绍了多用户MIMO系统方案,给出了多中继协作的多用户MIMO系统的模型,对一种简单的中继协作的多用户MIMO系统的性能进行了仿真,并分析了仿真结果。 相似文献
7.
8.
9.
现有的GMD-TH(Geometric Mean Decomposition-Tomlison Harashima)预编码方案在发射端未对获得MIMO(Multiple-Input-Multiple-Output)信道增益矩阵优化,因而其误码率和分集增益无法获得令人满意的效果.为此,在原有MIMO系统GMD-TH预编码的基础上,提出梁种基于格规约辅助的GMD-TH预编码方案.该方案采用基于格规约的算法对信道矩阵进行优化,经过优化的信道矩阵其列向量之间具有更好的正交性并且向量的长度更短,并且采用优化的信道矩阵提高了GMD-TH预编码MIMO系统的分集增益.仿真结果表明:相比于传统的线性预编码方案,该预编码方案有效地提高了MIMO分集增益,相同误码率下,信噪比降低3dB以上,具有实用价值. 相似文献
10.
在无线通信研究中,网络编码因其可有效提升带宽利用率的特性得到了大量关注.但是,网络编码用于双向中继信道(TWRC)时,中继位置的不对称将造成系统性能的下降,故在源节点使用分层调制的方法来解决此问题.研究了分层调制和物理层网络编码的联合以及优化,并进行了系统仿真.仿真结果显示,在非对称中继信道下,通过与传统调制方案(CM... 相似文献
11.
将应用于平坦衰落相关信道下的网格退化(LR, lattice reduction)算法推广到频率选择性衰落信道中.给出了在频率选择性衰落的相关信道中,采用网格退化算法辅助检测前后最小均方误差(MMSE)检测器的性能比较.实验表明:在具有频率选择性衰落的相关信道中,采用网格退化辅助检测算法能显著地提高系统的检测性能. 相似文献
12.
MIMO技术是LTE的关键技术,MIMO信号检测算法的选用需要在复杂度和检测性能之间取得合理的折中。将格基理论应用于MIMO检测中,能够大幅降低由于天线数增多所带来的检测复杂度过高问题,典型的格约减算法有LLL算法和Seysen算法。以上述格基约减算法为基础,引进排序串行干扰抵消和广度优先球译码K-best算法的思想,提出了一种新型的基于格基约减的MIMO检测算法--KLR_OSIC。与原有基于格基约减的检测算法相比,该算法能够在较低的计算复杂度下显著提高MIMO的检测性能。通过仿真可看出,新算法比原基于格基约减的算法性能更佳,且更接近ML算法。 相似文献
13.
In this work heuristic ant colony optimisation (ACO) procedure is deployed in conjunction with lattice reduction (LR) technique aiming to improve the performance-complexity tradeoff of detection schemes in MIMO communication. A hybrid LR-ACO MIMO detector using the linear minimum mean squared error (MMSE) criterion as initial guess is proposed and compared with two other traditional (non)linear MIMO detectors, as well as with heuristic MIMO detection approaches from the literature, in terms of both performance and complexity metrics. Numerical results show that the proposed LR-ACO outperforms the traditional ACO-based MIMO detectors and the ACO detector with the MMSE solution as initial guess, with a significant complexity reduction while is able to reach full diversity degree in all scenarios considered, including different channel correlation levels, modulation orders, and antennas configuration. 相似文献
14.
Wireless Personal Communications - In this paper, a very low complexity Lattice Reduction technique, called Dual Shortest Longest Vector algorithm (SLV), is adopted to improve the Bit Error Rate... 相似文献
15.
16.
17.
《无线电通信技术》2017,(6):1-4
针对无线中继网络中物理层网络编码技术的应用,分析验证了其所带来可观的吞吐量性能提升。总结了当前物理层网络编码技术的相关研究方向,归纳了通信理论研究、信息理论研究和网络理论研究三个方面。介绍了物理层网络编码的关键技术,对物理层网络编码技术在实际信道条件下的性能分析及改进、采用高阶调制时的检测模糊及改进、基于嵌套格码的计算-转发策略和结合缓冲中继协议设计进行了深入探讨。以期放宽物理层网络编码对信道模型的限制,拓展其适用条件,同时在保障通信过程可靠性的前提下充分发挥该技术对通信有效性的提升,从而推进物理层网络编码技术在实际无线中继通信系统中的应用。 相似文献
18.
To provide a high-security guaran- tee to network coding and lower the comput- ing complexity induced by signature scheme, we take full advantage of homomorphic prop- erty to build lattice signature schemes and sec- ure network coding algorithms. Firstly, by means of the distance between the message and its sig- nature in a lattice, we propose a Distance-bas- ed Secure Network Coding (DSNC) algorithm and stipulate its security to a new hard problem Fixed Length Vector Problem (FLVP), which is harder than Shortest Vector Problem (SVP) on lattices. Secondly, considering the bound- ary on the distance between the message and its signature, we further propose an efficient Bo- undary-based Secure Network Coding (BSNC) algorithm to reduce the computing complexity induced by square calculation in DSNC. Sim- ulation results and security analysis show that the proposed signature schemes have stronger unforgeability due to the natural property of lattices than traditional Rivest-Shamir-Adleman (RSA)-based signature scheme. DSNC algo- rithm is more secure and BSNC algorithm greatly reduces the time cost on computation. 相似文献
19.
20.
Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection 总被引:2,自引:0,他引:2
Ying Hung Gan Cong Ling Wai Ho Mow 《Signal Processing, IEEE Transactions on》2009,57(7):2701-2710
Recently, lattice-reduction-aided detectors have been proposed for multiinput multioutput (MIMO) systems to achieve performance with full diversity like the maximum likelihood receiver. However, these lattice-reduction-aided detectors are based on the traditional Lenstra-Lenstra-Lovasz (LLL) reduction algorithm that was originally introduced for reducing real lattice bases, in spite of the fact that the channel matrices are inherently complex-valued. In this paper, we introduce the complex LLL algorithm for direct application to reducing the basis of a complex lattice which is naturally defined by a complex-valued channel matrix. We derive an upper bound on proximity factors, which not only show the full diversity of complex LLL reduction-aided detectors, but also characterize the performance gap relative to the lattice decoder. Our analysis reveals that the complex LLL algorithm can reduce the complexity by nearly 50% compared to the traditional LLL algorithm, and this is confirmed by simulation. Interestingly, our simulation results suggest that the complex LLL algorithm has practically the same bit-error-rate performance as the traditional LLL algorithm, in spite of its lower complexity. 相似文献