A multi-objective optimization based robust beamforming(BF)scheme is proposed to realize secure transmission in a cognitive satellite and unmanned aerial vehicle(UAV)network.Since the satellite network coexists with t...A multi-objective optimization based robust beamforming(BF)scheme is proposed to realize secure transmission in a cognitive satellite and unmanned aerial vehicle(UAV)network.Since the satellite network coexists with the UAV network,we first consider both achievable secrecy rate maximization and total transmit power minimization,and formulate a multi-objective optimization problem(MOOP)using the weighted Tchebycheff approach.Then,by supposing that only imperfect channel state information based on the angular information is available,we propose a method combining angular discretization with Taylor approximation to transform the non-convex objective function and constraints to the convex ones.Next,we adopt semi-definite programming together with randomization technology to solve the original MOOP and obtain the BF weight vector.Finally,simulation results illustrate that the Pareto optimal trade-off can be achieved,and the superiority of our proposed scheme is confirmed by comparing with the existing BF schemes.展开更多
Most of the reconstruction-based robust adaptive beamforming(RAB)algorithms require the covariance matrix reconstruction(CMR)by high-complexity integral computation.A Gauss-Legendre quadrature(GLQ)method with the high...Most of the reconstruction-based robust adaptive beamforming(RAB)algorithms require the covariance matrix reconstruction(CMR)by high-complexity integral computation.A Gauss-Legendre quadrature(GLQ)method with the highest algebraic precision in the interpolation-type quadrature is proposed to reduce the complexity.The interference angular sector in RAB is regarded as the GLQ integral range,and the zeros of the threeorder Legendre orthogonal polynomial is selected as the GLQ nodes.Consequently,the CMR can be efficiently obtained by simple summation with respect to the three GLQ nodes without integral.The new method has significantly reduced the complexity as compared to most state-of-the-art reconstruction-based RAB techniques,and it is able to provide the similar performance close to the optimal.These advantages are verified by numerical simulations.展开更多
The derivation of a diagonally loaded sample-matrix inversion （LSMI） algorithm on the busis of inverse matrix recursion （i.e.LSMI-IMR algorithm） is conducted by reconstructing the recursive formulation of covarian...The derivation of a diagonally loaded sample-matrix inversion （LSMI） algorithm on the busis of inverse matrix recursion （i.e.LSMI-IMR algorithm） is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.展开更多
基金supported by the Key International Cooperation Research Project(61720106003)the National Natural Science Foundation of China(62001517)+2 种基金the Shanghai Aerospace Science and Technology Innovation Foundation(SAST2019-095)the NUPTSF(NY220111)the Foundational Research Project of Complex Electronic System Simulation Laboratory(DXZT-JC-ZZ-2019-009,DXZTJC-ZZ-2019-005).
文摘A multi-objective optimization based robust beamforming(BF)scheme is proposed to realize secure transmission in a cognitive satellite and unmanned aerial vehicle(UAV)network.Since the satellite network coexists with the UAV network,we first consider both achievable secrecy rate maximization and total transmit power minimization,and formulate a multi-objective optimization problem(MOOP)using the weighted Tchebycheff approach.Then,by supposing that only imperfect channel state information based on the angular information is available,we propose a method combining angular discretization with Taylor approximation to transform the non-convex objective function and constraints to the convex ones.Next,we adopt semi-definite programming together with randomization technology to solve the original MOOP and obtain the BF weight vector.Finally,simulation results illustrate that the Pareto optimal trade-off can be achieved,and the superiority of our proposed scheme is confirmed by comparing with the existing BF schemes.
基金supported by the National Natural Science Foundation of China(618711496197115962071144)。
文摘Most of the reconstruction-based robust adaptive beamforming(RAB)algorithms require the covariance matrix reconstruction(CMR)by high-complexity integral computation.A Gauss-Legendre quadrature(GLQ)method with the highest algebraic precision in the interpolation-type quadrature is proposed to reduce the complexity.The interference angular sector in RAB is regarded as the GLQ integral range,and the zeros of the threeorder Legendre orthogonal polynomial is selected as the GLQ nodes.Consequently,the CMR can be efficiently obtained by simple summation with respect to the three GLQ nodes without integral.The new method has significantly reduced the complexity as compared to most state-of-the-art reconstruction-based RAB techniques,and it is able to provide the similar performance close to the optimal.These advantages are verified by numerical simulations.
文摘The derivation of a diagonally loaded sample-matrix inversion （LSMI） algorithm on the busis of inverse matrix recursion （i.e.LSMI-IMR algorithm） is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.
