IRS辅助的安全通信系统波束成形嵌套优化算法

智能反射面（Intelligent Reflecting Surface,IRS）是一种通过重新配置无线传播环境,提高无线通信网络安全性的绿色通信新技术。该文针对IRS辅助的多输入单输出安全通信系统,考虑在合法用户保密率约束下,联合优化基站处的发射波束成形和IRS处无源移相器的反射波束成形,使基站的发射功率最小。为了求解多变量耦合的非凸优化问题,我们提出了拉格朗日函数和粒子群嵌套优化算法,使用粒子群算法搜索IRS的反射波束成形,拉格朗日函数求解对应的发射波束成形,获得非凸优化问题的次优解。论文仿真比较了不同算法下基站所需的发射功率,结果表明所提算法基站所需发射功率更低。      

基于硬件损伤的MIMO异构网络波束成形算法

由于多输入多输出(MIMO)异构网络能够提高系统容量和实现更多的用户接入,因此受到了学术界和工业界的广泛关注,从而成为下一代通信系统的关键技术之一。然而,由于放大器非线性、相位噪声和I/Q不均衡等因素的影响,这类硬件损伤成为制约当前MIMO异构网络波束成形性能进一步提升的瓶颈。为了解决该问题,该文提前将硬件损伤考虑到MIMO异构网络波束成形算法设计当中。首先,考虑了每个基站的最大发射功率约束和每个用户的最小信干噪比约束,建立了一个含硬件损伤参数的系统总能耗最小的资源优化问题。其次,利用等价变换和半正定松弛方法,将原非凸问题转化为凸优化问题进行求解。仿真结果表明,与完美硬件条件下的波束成形算法对比,所提算法具有较好的抗硬件损伤能力和较低的中断概率。     

多输入多输出雷达低旁瓣发射方向图优化算法

提出了一种基于波束域加权的低旁瓣方向图设计方法。综合考虑方向图匹配性能和发射阵元等功率作为约束条件,建立低旁瓣发射方向图优化模型,采用半正定松弛技术将优化模型转化为凸优化问题;对波束加权矩阵施加对偶约束,使得接收信号满足旋转不变性;利用高斯随机化方法对波束加权矩阵进行求解,得到原优化问题的最优解。仿真结果表明,算法能够保持期望主瓣形状并有效降低方向图旁瓣,提高到达角(DOA)的估计精确度和角度分辨力。     

基于IRS辅助的SWIPT物联网系统安全波束成形设计

为满足绿色万物互联的智能信号处理部署和物理层安全的新要求,针对基于智能反射面辅助的无线携能通信物联网系统中可持续能量供应紧缺问题,提出了一种安全波束成形设计方法。考虑保密速率、发射功率和IRS反射相移约束,以最大化能量采集器采集功率为目标,联合优化基站发射波束成形矩阵和干扰机协方差矩阵以及IRS相移,将优化问题建模为具有二次型约束的非凸二次型规划问题。利用松弛变量、半定松弛法、辅助变量和序列参数凸逼近法将非凸的二次型问题转化为等价的凸问题,并提出一种交替迭代优化算法获取原问题的可行解。仿真结果表明,所提算法能够快速收敛,且与基准方案相比能有效地提升性能。     

一种新的MIMO雷达发射波形设计方法

该文提出一种约束基波束权值动态的MIMO雷达发射波形设计方法。首先,构造一组发射波形集并从理论上推导了阵元发射波形的恒模特性,在此基础之上,将各阵元平均发射功率的均匀性控制问题转化为基波束权值动态的定量约束问题;其次,建立了直接约束权值动态的基波束优化模型,利用切线投影法和区域迭代法将其进行凸松弛,并且给出了二阶锥规划子问题和序列锥迭代流程;最后,利用二阶锥规划设计出了基波束的比例系数。所提方法在保证MIMO雷达发射方向图匹配性能的前提下,能够兼顾阵元发射功率均匀性和发射方向图旁瓣功率的性能,因而在设计发射波形时更具灵活性。仿真实验验证了所提方法的有效性。     

双基地MIMO雷达发射功率聚焦的角度估计算法研究

该文针对传统双基地MIMO雷达发射功率在空间发散的问题,提出一种双基地MIMO雷达发射功率聚焦方法。首先,建立了双基地MIMO雷达发射功率聚焦的优化模型,其优化准则为:在感兴趣空域内严格约束优化波束与期望波束的最大误差小于给定门限的前提下,最小化发射方向图的峰值旁瓣功率。同时,构造特殊发射端波束矩阵,不仅能使等效发射/接收导向矢量具有旋转不变性,并且简化了原优化模型,以便采用二阶锥规划理论进行快速求解;其次,利用改进平行因子算法对空间目标的收发角度进行估计,结合发射/接收导向矢量的旋转不变性对平行因子内部最小二乘算法的初始迭代点进行了改进,有效地减小了算法的迭代步数;再次,推导了双基地MIMO雷达发射功率聚焦下多目标角度估计的克拉美罗界(CRB),进一步说明了所提方法的优越性。最后,仿真验证了理论分析的有效性。     

放大转发双向中继系统中降低总功率的波束成形设计

本文研究了多天线放大转发双向中继系统中在满足源节点信噪比要求条件下最小化系统总功率的波束设计问题。该问题是非凸优化问题,为了有效求解该问题,采用分层优化方法将原问题分解成发送波束成形向量优化、接收波束成形向量优化和中继波束成形矩阵优化三类子问题。发送/接收波束成形向量通过求解Rayleigh商最小化问题来获得。中继波束成形矩阵优化问题通过半正定松弛方法转化成半正定优化问题来求解。在求解这三类优化问题的基础上,提出了一种迭代波束成形算法,并采用单调有界序列定理证明了所提算法的收敛性。计算机仿真表明:所提算法经过若干次迭代即可收敛到稳定点;相比于已有算法,本文算法能显著降低系统总功率。      

多维正交天线的鲁棒波束成形算法分析

将服务质量(QoS)概念引入码分多址(CDMA)系统鲁棒波束成形(BF)的分析,通过对基站端天线阵元空间排列的调整,使接收信号同时在三维空间进行处理,使用凸优化算法对各维信号进行多目标约束优化,最终形成所需的合成发射波束模式。文中最后给出了仿真结果,并与WUSIC及MMSE算法进行了性能比较。     

接收端配备滤波器的分布式波束形成技术

基于频率选择性信道中由一个发射节点、一个目标节点和多个中继节点构成的中继网络,该文提出一种新型的分布式波束形成技术。该技术除了在中继节点上采用滤波而后转发的中继数据中转策略之外,在接收节点也配备一个有限长响应(Finite Impulse Response, FIR)滤波器,共同均衡发射节点与中继节点以及中继节点与接收节点之间的频率选择性信道。该文中,此两种滤波器将得到联合优化以提高接收节点的服务质量,并同时满足中继节点的发射功率限制。仿真结果表明,相较于放大而后转发以及滤波而后转发但无接收滤波器的波束形成器而言,所提波束形成技术极大地提高了频率选择性信道中中继网络的性能。     

多小区大规模协同功率分配及波束成形算法

针对大规模多输入单输出的多点协作下行系统,本文主要研究协同波束成形和功率控制,以达到最大化最差用户信干噪比的目的。为了求解原始下行的非凸优化问题,首先将原始优化问题转化成等价的上行优化问题进行求解。尽管在有限系统里可通过迭代算法获得波束矢量和发射功率,但是该算法依赖于瞬时信道信息,功率也需要瞬时更新。为了减少功率更新计算复杂度,本文进一步利用随机矩阵理论,提出了只需要依赖统计信道信息的算法来获得发射功率。数值仿真验证了单基站功率约束下所提算法的有效性以及相对于最大比发送算法的优越性。      

基于混合波束赋形的室内毫米波MIMO系统性能分析

混合波束赋形在射频模拟域波束赋形的基础上,通过在基带实现数字域波束赋形来进一步提高数据速率.本文针对基于混合波束赋形的室内毫米波MIMO（Multiple Input Multiple Output）系统进行性能分析,分别评估了迫零（Zero Force,ZF）接收机、最小均方误差（Minimum Mean Square Error,MMSE）接收机以及匹配滤波（Matched Filter,MF）接收机在基于码本的最优波束选择下的传输速率,并对接收机在不同的信道环境下进行性能评估.仿真结果表明,无论视距（Line-Of-Sight,LOS）传播路径是否被遮挡,MMSE接收机和ZF接收机在总发射功率较高时均具有接近容量的性能;在总发射功率较低时MMSE接收机的性能则略优于ZF接收机.相反,MF接收机始终保持较差的性能.系统可根据总发射功率大小以及接收机的实现复杂度来选取合适的接收机.本文所研究的系统可应用于实际室内无线个域网（Wireless Personal Area Networks,WPAN）以实现高速短距无线通信.     

Joint transmitter receiver diversity for efficient space divisionmultiaccess

The beamforming problem is studied in wireless networks where both the transmitters and receivers have linear adaptive antenna arrays. Algorithms are proposed that find the antenna array weight vectors at both the transmitters and receivers as well as the transmitter powers with one of the following two objectives: (1) to maximize the minimum signal-to-interference-and-noise ratio (SINR) over all receivers and (2) to minimize the sum of the total transmitted power satisfying the SINR requirements at all links. A numerical study is performed to compare the network capacity and the power consumption among systems having a different number of antenna array elements in a code division multiple access network     

On multiple‐domain cooperative diversity for communications with distributed content in G.hn networks

Broadband data applications can be delivered to homes over the available home network infrastructure (i.e., mediums). Further enhancement of the network performance is possible by exploiting spatial, time, or frequency diversity. Recently, MIMO systems have been proposed for power line communication (PLC) networks. Because of the extremely diverse physical characteristics of the mediums, an implementation of MIMO systems in G.hn across different domains represents a non‐trivial task. In this paper, we present and theoretically evaluate the performance of multiple‐domain diversity mechanism in G.hn using a cross‐layer classification algorithm. In the proposed network architecture, the signal is transmitted over different mediums selected by the classification algorithm in order to meet the quality‐of‐service demands. At the receiver, joint signal combining and equalization are done to take advantage of the multiple‐domain cooperative diversity and increase the signal‐to‐noise ratio. The merit of the proposed multiple‐domain PLC network has been confirmed by analytical performance analysis and computer simulation. Copyright © 2015 John Wiley & Sons, Ltd.     

Power domain cyclic spread multiple access: An interference‐resistant mixed NOMA strategy

The next generation wireless access technology highly relies on nonorthogonal multiple access (NOMA) technique. This paper proposes a novel power domain cyclic spread multiple access (PDCSMA) scheme for the design of NOMA system with power domain superposition coding (SC) and cyclic spreading at the transmitter concurrent with symbol level successive interference cancellation (SL‐SIC) at the receiver. Based on acceptable difference in channel gain, the users are grouped together to form PDCSMA clusters, and the unique power is allotted to each user in a cluster. The user with good channel condition is allotted less power, and the user with poor channel condition is allotted more power. Each PDCSMA cluster has its own spreading code, and the data of every user in a cluster are cyclic spread with the same code. Each cluster supports the number of multipath components equivalent to the length of the spreading code. The use of cyclic spreading makes the signal suffered by multipath fading less prone to intra cluster interference. The user signal is decoded by minimum mean square error‐frequency domain equalization (MMSE‐FDE) or maximal ratio combining (MRC)–based receiver in which weak user is detected with hard decision, and strong user is detected with SIC. Compared with conventional power domain NOMA (PDNOMA) and interleaved NOMA, the proposed PDCSMA achieves better bit error rate (BER) performance and assures guaranteed detection.     

多点协作传输中的联合传输方法

文章提出了一种多点协作传输中多点联合传输的方法,该方案将空时,频编码与波束赋形技术以及预编码技术与波束赋形技术相结合,首先进行空时／频编码和预编码处理,并将经过处理后获得的多路数据分别通过波束赋形映射到多个协作节点进行传输;然后通过空时／频编码与波束赋形技术的结合,接收方获得更大的分集增益,同时获得波束赋形增益;最后将预编码处理与波束赋形应用到多点协作中,使得各个发送节点的信号在接收方合并,从而使得各层之间的信号更加独立,并获得波束赋形增益。     

Transmit Beamforming for MIMO Optical Wireless Communication Systems

This paper focuses on transmit beamforming for multiple-input multiple-output optical wireless communication (OWC) systems with intensity modulation and direct detection (IM/DD). OWC with IM/DD requires the transmitted signals to be nonnegative, for which existing beamforming schemes developed for radio frequency systems cannot be applied directly. We propose effective schemes for OWC over frequency flat and frequency selective channels. For frequency flat fading, the property of the beamforming vector is derived. For frequency selective fading, bit-error rate performances of the proposed scheme with zero-forcing and minimum mean-square error frequency domain equalization receivers are derived, and a suboptimal beamforming vector for frequency selective fading channels is proposed. Compared with asymmetrically clipped optical orthogonal frequency division multiplexing based frequency domain beamforming, the proposed scheme needs much less feedback information and has a better error performance.     

A Framework to Optimize the OFDM-Based Multiuser Dynamic Spectrum Access Networks with Frequency Reuse

This paper presents a novel framework to optimally solve the spectrum access problem at the central spectrum moderator (CSM) for multiple radio pairs. In the system model considered, the available spectrum is partitioned into N subcarriers, and the proposed CSM assigns subcarriers to multiple radio pairs with the objective to maximize the total achievable bit rate in the network. Each transceiver adopts the OFDM frontend, and transmits only on those subcarriers assigned to it. The proposed algorithm jointly considers the effect of interference from multiple co-channel radios, while at the same time supports all transmitters at their minimum guaranteed bit rate, under individual total transmit power constraint. Our proposed method converts the original NP-hard mixed integer non-linear programming problem into a mixed binary linear programming problem, which can be solved optimally using standard algorithms.     

Distributed Beamforming for Relay Networks Based on Second-Order Statistics of the Channel State Information

In this paper, the problem of distributed beamforming is considered for a wireless network which consists of a transmitter, a receiver, and $r$ relay nodes. For such a network, assuming that the second-order statistics of the channel coefficients are available, we study two different beamforming design approaches. As the first approach, we design the beamformer through minimization of the total transmit power subject to the receiver quality of service constraint. We show that this approach yields a closed-form solution. In the second approach, the beamforming weights are obtained through maximizing the receiver signal-to-noise ratio (SNR) subject to two different types of power constraints, namely the total transmit power constraint and individual relay power constraints. We show that the total power constraint leads to a closed-form solution while the individual relay power constraints result in a quadratic programming optimization problem. The later optimization problem does not have a closed-form solution. However, it is shown that using semidefinite relaxation, this problem can be turned into a convex feasibility semidefinite programming (SDP), and therefore, can be efficiently solved using interior point methods. Furthermore, we develop a simplified, thus suboptimal, technique which is computationally more efficient than the SDP approach. In fact, the simplified algorithm provides the beamforming weight vector in a closed form. Our numerical examples show that as the uncertainty in the channel state information is increased, satisfying the quality of service constraint becomes harder, i.e., it takes more power to satisfy these constraints. Also our simulation results show that when compared to the SDP-based method, our simplified technique suffers a 2-dB loss in SNR for low to moderate values of transmit power.      

Multiuser capacity in block fading with no channel stateinformation

Consider M independent users, each user having his own transmit antenna, that transmit simultaneously to a receiver equipped with N antennas through a Rayleigh block-fading channel having a coherence interval of T symbols, with no channel state information (CSI) available to either the transmitters or to the receiver. The total transmitted power is independent of the number of users. For a given coherence time T, we wish to identify the best multiaccess strategy that maximizes the total throughput. If perfect CSI were available to the receiver, it is known that the total capacity would increase monotonically with the number of users. If the CSI is available to both the receiver and to all transmitters, the throughput maximizing strategy implies for N=1 that only the single user who enjoys the best channel condition transmits. In the absence of CSI one is forced to a radically different conclusion. In particular, we show that if the propagation coefficients take on new independent values for every symbol (e.g., T=1) then the total capacity for any M > 1 users is equal to the capacity for M=1 user, in which case time division multiple access (TDMA) is an optimal scheme for handling multiple users. This result follows directly from a recent treatment of the single-user multiple antenna block-fading channel. Again, motivated by the single-user results, one is lead to the following conjecture for the multiple-user case: for any T > 1, the maximum total capacity can be achieved by no more than M = T users. The conjecture is supported by establishing the asymptotic result that, for a fixed N and a constant M/T for large T, the total capacity is maximized when M/T→0, which yields a total capacity per symbol of N log(1 + ρ), where ρ is the expected signal-to-noise ratio (SNR) at the receiver. We further support the conjecture by examining the asymptotic behavior with large to for fixed M, T, and N ⩽ T