MIMO多中继系统中基于不完全信道状态信息的预编码算法研究

针对配置多个中继节点的多输入多输出（Multiple-input Multiple-Output,MIMO）系统,提出一种不完全信道状态信息（Imperfect channel state information,CSI）下基于最小均方误差（Minimum Mean-Squared Error,MMSE）准则的预编码设计方案,该方案综合考虑各个节点天线之间的相关性及信道估计误差。由于各个中继端预编码矩阵之间可视为相互独立,故将约束优化问题转化为若干半正定规划问题,继而通过内点法或CVX工具箱求解预编码矩阵,然后采用求导法推导出接收端处理矩阵。最后利用迭代算法交替迭代来联合优化预编码矩阵和接收端处理矩阵,直到算法收敛。仿真结果表明,与未能综合考虑各个节点的预编码算法相比,本文提出的算法能明显改善系统BER性能。      

一种基于预编码的AF多中继协作通信系统信道估计方法

针对瑞利平坦衰落信道下AF多中继协作通信系统,提出了一种基于预编码的分段式信道估计方法.该方法分两个阶段对S-R和R-D两个链路的信道状态信息进行估计,利用在中继端进行预编码,使中继节点可同时向目的节点发送训练序列.仿真结果表明,提出的方法可有效地估计出两段链路的信道状态信息,减小了训练时隙的开支,缩短了信道估计时间.     

双向中继系统用户联合预编码与检测算法研究

双向中继协同通信系统的两用户节点通过中继节点相互交换信息,显示了其在频谱效率上的优势。在系统装备多天线的情况下,为进一步改善误比特率性能,论文提出一种基于格规约算法的用户联合预编码与检测算法。该算法通过一次复数域格规约处理来提高信道增益矩阵的正交性,预编码和检测算法联合应用处理后的矩阵,中继节点仅需要对接收信号进行求模运算和放大转发,算法的复杂度主要集中在两用户节点上。仿真结果显示:相比于传统的预编码和检测算法,用户联合预编码与检测算法在计算复杂度仅增加了对信道增益矩阵一次格规约计算的前提下,可显著降低系统的误比特率,提高分集增益,具有工程实用价值。     

MIMO中继系统中预编码的级联算法

在两跳MIMO中继通信系统的预编码相关研究中,提出了一种级联预编码算法,该算法把两跳系统的预编码分解成两个独立的部分,从而把预编码问题转化成为求源节点到中继节点的预编码过程以及中继节点到目的节点的过程。本文使用MMSE准则,在简化迭代算法复杂度的同时,与一种只在中继节点进行联合优化的算法进行比较,由仿真可以看出,本文算法有一定的性能提升。     

一种前向放大中继通信系统中的有限反馈中继预编码方案

 本文首先给出了前向放大中继通信系统中,在给定QoS要求下的最优中继预编码矩阵的设计. 进而,针对实际通信系统中反馈信道带宽的限制,给出了一种有限反馈中继预编码码本的设计方案. 计算机仿真表明,本文所提新码本有限反馈中继预编码方案的系统性能随着反馈比特数的增加接近完全反馈下的系统性能,且在相同反馈比特数下的系统容量和误码率均明显优于将传统MIMO通信系统中的Grassmannian码本或随机码本直接应用于中继预编码的有限反馈方案.     

信道反馈延迟时MIMO中继系统的线性预编码算法

针对采用放大转发(Amplify and Forward, AF)中继技术的多入多出(Multiple Input Multiple Output, MIMO)系统, 考虑信道估计误差及反馈存在延迟的情况, 提出一种基于最小均方误差(Minimum Mean Squared Error, MMSE)准则的预编码设计方案.假设基站-中继端及中继端-终端的信道均存在估计误差与反馈延迟, 在基站和中继端功率都受限条件下, 以MMSE为准则, 推导得到了基站预编码矩阵、中继转发矩阵和终端解码矩阵的闭式解.数值仿真结果表明, 该方案所提出的预编码算法能有效地改善系统的误比特率与均方误差.     

基于联合迭代检测译码的多中继RA编码协作系统

为提高协作系统的性能,提出一种RA码多中继编码协作通信系统。首先,在系统的源和中继节点处采用RA编码,推导出与目的节点接收码字对应的多层Tanner图;然后,以多层Tanner图为基础,结合MAP算法给出一种联合迭代检测译码新算法译码,完成目的点的信号检测。理论分析和数值模拟表明,所提出的新方法能够充分实现多中继编码协作所具有的潜在分集和编码增益,随着内外迭代次数的增加,误比特率性能迅速提升,在相同条件下明显优于编码非协作系统。     

基于双向MIMO中继系统的一种预编码策略

为了克服已有的双向MIMO中继系统模型中预编码技术计算量大的缺点,提出了一种基于双向MIMO系统的三时段预编码策略,给出了该策略的模型和算法。该模型的中继节点预均衡各信道状态信息影响(CSI)后将合并信号分时段发送给不同通信节点,简化了传统中继转发矩阵对多信道信息的联合设计。理论计算和仿真结果表明,该策略在性能和复杂度之间得到了良好的折衷     

混合蛙跳在网络编码协作系统资源分配中的应用

网络编码协作中继技术能合理分配IMT-Advanced的资源,从而提高系统性能,受到了广大学者的关注。针对基于网络编码的双向多中继协作系统,提出基于混合蛙跳的资源分配方案。以最小化系统传输功率为优化目标,在满足用户QoS下,推导每个节点的最优化功率,建立最优化资源分配模型,利用混合蛙跳算法解决系统资源分配问题。仿真结果表明,在满足单节点QoS下,所提出的基于混合蛙跳的资源分配方案能有效减小系统的总功率,提高了系统性能。     

MIMO双向中继信道的网络预编码算法研究

在衰落信道环境下,多输入多输出（MIMO）网络编码比传统的网络编码具有更好的鲁棒性.而网络编码与无线中继技术的结合也是目前最具潜力的研究热点之一.从通信基本原理的角度对MIMO双向中继系统的3种通信模型进行介绍,对相应的网络预编码实现的算法和机制进行研究对比,指出3种模型各自的优缺点.最后,讨论该领域的进一步研究方向.     

Joint Source/Relay Precoder Design in Nonregenerative Cooperative Systems Using an MMSE Criterion

This paper considers transmitter precoding in an amplify-and-forward cooperative system where multiple antennas are equipped at the source, the relay, and the destination. Existing methods for the problem only consider the design of the relay precoder. To further improve the performance, we include the source precoder into the design. Using a minimum-meansquare- error (MMSE) criterion, we propose a joint source/relay precoder design method, taking both the direct and relay links into account. It is shown that the MMSE is a highly nonlinear function of the precoding matrices, and a direct minimization is not feasible. To facilitate analysis, we propose to design the precoders toward first diagonalizing the MSE matrix of the relay link. This imposes certain structural constraints on both precoders that allow us to derive an analytically tractable MSE upper bound. By conducting minimization with respect to this bound, the solution can be obtained by an iterative water-filling technique.     

Joint Source and Relay Precoder Design in Amplify-and-Forward MIMO Relay Systems with Direct Link

This paper investigates the precoder design problem in a two-hop amplify-and-forward multiple-input-multiple-output relay system. Many previous works on this problem are based on the minimum mean-square error criterion and the presence of a direct link between the source and the destination is ignored. In this paper, we propose a new method for joint source and relay precoder design based on maximizing the mutual information between the source and the destination, taking both the relay link and the direct link into account. In contrast to previous works, which consider the transmit power constraints of the source and the relay independently, we assume a total power constraint on the sum transmit power of the source and the relay instead to study also the optimal power distribution over the two nodes. A constrained optimization problem with respect to the unknown source precoder matrix and relay precoder matrix is then formulated, which is nonconvex and very difficult to solve directly. We propose a structural constraint on the precoders by analyzing the structure of the problem and referring to related works. With the proposed precoders’ structure and by applying the Hadamard’s inequality, the original problem is simplified from a matrix-valued problem to a scalar-valued one. However, the new scalar-valued problem is still nonconvex and we manage to convert it into two subproblems and solve it in an iterative fashion. By using the Karash–Kuhn–Tucker (KKT) conditions, we give out the closed-form solutions to the subprobelms. Simulation results demonstrate that the proposed design method converges rapidly and significantly outperforms the existing methods.     

MMSE‐based transceiver design for distributed MIMO amplify‐and‐forward cooperative networks in correlated channels

In this paper, the source‐precoder, multiple‐relay amplifying matrices, and destination‐equalizer joint optimization is investigated in distributed MIMO amplify‐and‐forward multiple‐relay networks with direct source–destination transmission in correlated fading channels. With the use of taking both the direct link and spatial correlation between antenna elements into account, the cooperative transceiver joint design is developed based on the minimum mean‐squared error criterion under individual power constraints at the source and multiple‐relay nodes. Simulation results demonstrate that the cooperative transceiver joint design architecture for an amplify‐and‐forward MIMO multiple‐relay system outperforms substantially the noncooperative transceiver design techniques on the BER performance under the spatial‐correlation channels.Copyright © 2012 John Wiley & Sons, Ltd.     

MIMO-AF协作中继网络中发送预编码器的优化

本文首先利用中继节点和目标节点在第一时隙中的接收信噪比之和最大准则,推导出优化问题并解得优化的预编码器矢量。然后又利用目标节点最大比合并后的接收信号信噪比最大准则,推导出性能更佳的预编码器优化问题,但由于表达式复杂不能得到闭式解。为此本文提出了两种次优解决方法,分别是梯度下降迭代法和近似求解法。仿真结果表明,提出的两种准则优化预编码器方法都能有效改进系统性能,且因后者更能直接反映接收端情况,效果更好。两种次优的解优化方法能够获得几乎相同的系统性能,但梯度下降法采用迭代运算,计算量比较大,而近似求解法在性能不损失的情况下大大降低了计算复杂度。      

小区间干扰利用的协作网络窃听传输算法

针对多小区系统上下行业务流同时发送的场景,提出利用相邻小区间干扰的窃听信号来提升多小区的信号质量。为了满足未来无线通信网络的低功耗要求,建立了多小区网络上下行业务流速率约束下,多天线中继总功率最小化的最优预编码设计数学模型,通过对该非凸问题的分析和推导,将其等价转化为二次型约束的二次规划问题(QCQP, Quadratically constrained quadratic program),利用半定松弛方法进行求解。仿真和分析表明,所提最优预编码算法相比传统算法具有更高的性能增益。      

无线并行放大转发中继传输中基于信噪比的功率分配研究

在无线通信网中,高效的功率分配可显著降低资源消耗、获得更好的服务质量、并减少网络内干扰.本文以无线并行中继协作通信系统为背景,在目的节点目标信噪比的约束条件下,对如何最小化中继链路中各通信节点的发射功率进行了研究.文章首先建立了无线中继协作通信系统模型,推导出了无线中继协作通信系统中信噪比的表达式.接着,文章将功率分配...     

Joint optimization of source and relay precoding in non‐regenerative MIMO relay systems

We investigate the problem of precoding optimization in an amplify‐and‐forward multiple‐input‐multiple‐output relay system. Most reported works on this problem focus chiefly on the design of relay precoder without simultaneously optimizing the direct link. In this paper, we propose a method for joint source/relay precoder design, taking both direct and relay links into account. Our design is based on maximizing the mutual information (MI) under limited transmission power constraints at the source and relay, respectively. We first formulate a constrained optimization problem before relaxing the original cost function for tractability and derive a MI lower bound. This elaborate bound can asymptotically approach the exact expression of MI in an iterative fashion. In contrast to previous strategies, we then prove that the optimal structure of the source and relay precoders jointly convert the multiple‐input‐multiple‐output relay channel into a bank of single‐input‐single‐output relay channels without having to assume a beamforming structure to simplify the derivation. Specifically, the linear precoding design problem degenerates into power loading among multiple single‐input‐single‐output relay channels. Applying standard Lagrange technique results in a scalar convex optimization, and it can be readily solved by iterative water filling. Numerical examples demonstrate that the proposed scheme, either exploiting partial or full channel state information, significantly outperforms the existing methods. Copyright © 2012 John Wiley & Sons, Ltd.     

Relay-Assisted Decorrelating Multiuser Detector (RAD-MUD) for Cooperative CDMA Networks

In this paper, we examine the uplink of a cooperative CDMA network, where users cooperate by relaying each other's messages to the base station. When spreading waveforms are not orthogonal, multiple access interference (MAI) exists at the relays and the destination, causing cooperative diversity gains to diminish. To address this issue, we adopt the multiuser detection (MUD) technique to mitigate MAI in achieving the full advantages of cooperation. Specifically, the relay-assisted decorrelating multiuser detector (RAD-MUD) is proposed to separate interfering signals at the destination with the help of preceding at the relays along with pre-whitening at the destination. Unlike the conventional zero-forcing (ZF) precoder or the decorrelating MUD, the proposed RAD-MUD experiences neither power expansion at the relays nor noise amplification at the destination. Three cooperative transmission strategies are considered on top of RAD-MUD; namely, transmit beamforming, selective relaying and distributed space-time coding. Since the reliability of each source-relay and/or relay-destination links are different, relay transmissions are weighted accordingly in our schemes to further combat MAI. The advantages of RAD-MUD over ZF precoding and other existing cooperative MUD schemes are shown through computer simulations.     

一种新的VMIMO协作中继选择方案

提出了一种无需信道估计的中继选择方案来实现虚拟多路输入输出（VMIMO）小区间的协作复用通信。在该方案中,VMIMO协作复用采用放大转发（AF）方式,中继VMIMO小区首先把接收到的从源VMIMO小区发射的信号和噪声同时进行线性放大,再向目的小区转发。仿真结果表明,与需要进行信道估计的基于瞬时信噪比的中继选择方案相比,所提出的方案其系统遍历容量和中断容量与前者几乎相同,但是后者却可以减小中继小区的运算复杂度。