Cooperative Beamforming and User Selection for Improving the Security of Relay-aided Systems

A relay network in which a source wishes to convey a confidential message to a legitimate destination with the assistance of trusted relays is considered. In particular, cooperative beamforming and user selection techniques are applied to protect the confidential message. The secrecy rate (SR) and secrecy outage probability (SOP) of the network are investigated first, and a tight upper bound for the SR and an exact formula for the SOP are derived. Next, asymptotic approximations for the SR and SOP in the high signal-to-noise ratio (SNR) regime are derived for two different schemes: i) cooperative beamforming and ii) multiuser selection. Further, a new concept of cooperative diversity gain, namely, adapted cooperative diversity gain (ACDG), which can be used to evaluate security level of a cooperative relaying network, is investigated. It is shown that the ACDG of cooperative beamforming is equal to the conventional cooperative diversity gain of traditional multiple-input single-output networks, while the ACDG of the multiuser scenario is equal to that of traditional single-input multiple-output networks.

Joint Information and Jamming Beamforming for Secrecy Rate Maximization in Cognitive Radio Networks

In this paper, we consider the secure beamforming design for an underlay cognitive radio multiple-input singleoutput broadcast channel in the presence of multiple passive eavesdroppers. Our goal is to design a jamming noise (JN) transmit strategy to maximize the secrecy rate of the secondary system. By utilizing the zero-forcing method to eliminate the interference caused by JN to the secondary user, we study the joint optimization of the information and JN beamforming for secrecy rate maximization of the secondary system while satisfying all the interference power constraints at the primary users, as well as the per-antenna power constraint at the secondary transmitter. For an optimal beamforming design, the original problem is a nonconvex program, which can be reformulated as a convex program by applying the rank relaxation method. To this end, we prove that the rank relaxation is tight and propose a barrier interior-point method to solve the resulting saddle point problem based on a duality result. To find the global optimal solution, we transform the considered problem into an unconstrained optimization problem. We then employ Broyden-Fletcher-Goldfarb-Shanno (BFGS) method to solve the resulting unconstrained problem which helps reduce the complexity significantly, compared to conventional methods. Simulation results show the fast convergence of the proposed algorithm and substantial performance improvements over existing approaches.

Beamforming and interference cancellation in D2D communication underlaying cellular networks

This paper presents an analytical performance investigation of both beamforming (BF) and interference cancellation (IC) strategies for a device-to-device (D2D) communication system underlaying a cellular network with an M-antenna base station (BS). We first derive new closed-form expressions for the ergodic achievable rate for BF and IC precoding strategies with quantized channel state information (CSI), as well as, perfect CSI. Then, novel lower and upper bounds are derived which apply for an arbitrary number of antennas and are shown to be sufficiently tight to the Monte-Carlo results. Based on these results, we examine in detail three important special cases including: high signal-to-noise ratio (SNR), weak interference between cellular link and D2D link, and BS equipped with a large number of antennas. We also derive asymptotic expressions for the ergodic achievable rate for these scenarios. Based on these results, we obtain valuable insights into the impact of the system parameters, such as the number of antennas, SNR and the interference for each link. In particular, we show that an irreducible saturation point exists in the high SNR regime, while the ergodic rate under IC strategy is verified to be always better than that under BF strategy. We also reveal that the ergodic achievable rate under perfect CSI scales as log2M, whilst it reaches a ceiling with quantized CSI.

Beamforming and interference cancellation schemes for D2D communications

We investigate device-to-device (D2D) communication underlaying cellular networks with M-antenna base stations. We consider both beamforming (BF) and interference cancellation (IC) strategies under quantized channel state information (CSI), as well as, perfect CSI. We derive tight closed-form approximations of the ergodic achievable rate which hold for arbitrary transmit power, location of users and number of antennas. Based on these approximations, we derive insightful asymptotic expressions for three special cases namely high signal-to-noise (SNR), weak interference, and large M. In particular, we show that in the high SNR regime a ceiling effect exists which depends on the received signal-to-interference ratio and the number of antennas. Moreover, the achievable rate scales logarithmically with M. The ergodic achievable rate is shown to scale logarithmically with SNR and the antenna number in the weak interference case. When the BS is equipped with large number of antennas, we find that the ergodic achievable rate under quantized CSI reaches a saturated value, whilst it scales as log2M under perfect CSI.

Distribution of the Demmel Condition Number of Wishart Matrices

This paper studies the Demmel condition number of Wishart matrices, a quantity which has numerous applications to wireless communications, such as adaptive switching between beamforming and diversity coding, link adaptation, and spectrum sensing. For complex Wishart matrices, we give an exact analytical expression for the probability density function (p.d.f.) of the Demmel condition number, and also derive simplified expressions for the high tail regime. These results indicate that the condition of complex Wishart matrices is dominantly decided by the difference between the matrix dimension and degree of freedom (DoF), i.e., the probability of drawing a highly ill conditioned matrix decreases considerably when the difference between the matrix dimension and DoF increases. We further investigate real Wishart matrices, and derive new expressions for the p.d.f. of the smallest eigenvalue, when the difference between the matrix dimension and DoF is odd. Based on these results, we succeed to obtain an exact p.d.f. expression for the Demmel condition number, and simplified expressions for the high tail regime.

Rotman lens based-retrodirective array

A new type of broadband retrodirective array, which has been constructed using a microstrip Rotman lens, is presented. Automatic tracking of targets is obtained by exploiting the conjugate phase response of the beamforming network which is exhibited when the input ports are terminated with either open or short circuits. In addition, the true time-delay property of the Rotman lens gives broadband operation of the self-tracking array when used in conjunction with Vivaldi antennas. The simulated and measured bistatic and monostatic radar cross-section (RCS) patterns of a structure consisting of 13 beamports and 12 array ports are presented at frequencies in the range 8-12 GHz. Significantly enhanced RCS within the scan coverage ±40° is demonstrated by comparing the retrodirective behavior of a 12-element Vivaldi array terminated with and without the Rotman lens. © 2006 IEEE.

SOME SYSTOLIC ARRAY DEVELOPMENTS IN THE UNITED KINGDOM.

Two major UK systolic array projects are described. The first concerns the development of a wavefront array processor for adaptive beamforming; the second concerns the design of bit-level systolic arrays for high-performance signal processing.

QRD and SVD processor design based on an approximate rotations algorithm

A silicon implementation of the Approximate Rotations algorithm capable of carrying the computational load of algorithms such as QRD and SVD, within the real-time realisation of applications such as Adaptive Beamforming, is described. A modification to the original Approximate Rotations algorithm to simplify the method of optimal angle selection is proposed. Analysis shows that fewer iterations of the Approximate Rotations algorithm are required compared with the conventional CORDIC algorithm to achieve similar degrees of accuracy. The silicon design studies undertaken provide direct practical evidence of superior performance with the Approximate Rotations algorithm, requiring approximately 40% of the total computation time of the conventional CORDIC algorithm, for a similar silicon area cost. © 2004 IEEE.

Parameterizable QR core

The design of a generic QR core for adaptive beamforming is presented. The work relies on an existing mapping technique that can be applied to a triangular QR array in such a way to allow the generation of a range of QR architectures. All scheduling of data inputs and retiming to include processor latency has been included within the generic representation.

Sidelobe Modulation Scrambling Transmitter Using Fourier Rotman Lens

A means for scrambling the digital modulation content in the sidelobes of a radio transmission from a steerable antenna array is presented. The method uses a Fourier transform beam-forming network simultaneously excited by an RF information stream and orthogonally injected interference streams. The proposed system is implemented using a Fourier Rotman lens and its operational characteristics are validated for a 10 GHz QPSK transmission.

Vector representation of directional modulation transmitters

Directional Modulation (DM) is a recently proposed technique for securing wireless communication. In this paper we point out that modulation-directionality is a consequence of varying the beamforming network, either in baseband or in the RF stage, at the information rate In order to formalize and extend on previous analysis and synthesis methods a new theoretical treatment using vector representations of directional modulation (DM) systems is introduced and used to obtain the necessary and sufficient con

Secure Communication in Cellular Networks: The Benefits of Millimeter Wave Mobile Broadband

This paper proposes millimeter wave (mmWave) mobile broadband for achieving secure communication in downlink cellular network. Analog beamforming with phase shifters is adopted for the mmWave transmission. The secrecy throughput is analyzed based on two different transmission modes, namely delay-tolerant transmission and delay-limited transmission. The impact of large antenna arrays at the mmWave frequencies on the secrecy throughput is examined. Numerical results corroborate our analysis and show that mmWave systems can enable significant secrecy improvement. Moreover, it is indicated that with large antenna arrays, multi-gigabit per second secure link at the mmWave frequencies can be reached in the delay-tolerant transmission mode and the adverse effect of secrecy outage vanishes in the delay-limited transmission mode.

Characterisation of Passive Intermodulation in Passive RF Devices with X-parameter

A novel approach to the modelling of passive intermodulation (PIM) generation in passive components with distributed weak nonlinearities is outlined. Based upon the formalism of X-parameters, it provides a unified framework for co-design of antenna beamforming networks, filters, combiners, phase shifters and other passive and active devices containing nonlinearities at RF front-end. The effects of discontinuities and complex circuit layouts can be efficiently evaluated with the aid of the equivalent networks of the canonical nonlinear elements. The main concepts are illustrated by examples of numerical simulations of PIM generation in the transmission lines and comparison with the measurement results.

Statistical Eigenmode Transmission for the MU-MIMO Downlink in Rician Fading

In this paper, we study the achievable ergodic sum-rate of multiuser multiple-input multiple-output downlink systems in Rician fading channels. We first derive a lower bound on the average signal-to-leakage-and-noise ratio by using the Mullen’s inequality, and then use it to analyze the effect of channel mean information on the achievable ergodic sum-rate. A novel statistical-eigenmode space-division multiple-access (SESDMA) downlink transmission scheme is then proposed. For this scheme, we derive an exact analytical closed-form expression for the achievable ergodic rate and present tractable tight upper and lower bounds. Based on our analysis, we gain valuable insights into the system parameters, such as the number of transmit antennas, the signal-to-noise ratio (SNR) and Rician K-factor on the system sum-rate. Results show that the sum-rate converges to a saturation value in the high SNR regime and tends to a lower limit for the low Rician K-factor case. In addition, we compare the achievable ergodic sum-rate between SE-SDMA and zeroforcing beamforming with perfect channel state information at the base station. Our results reveal that the rate gap tends to zero in the high Rician K-factor regime. Finally, numerical results are presented to validate our analysis.