Reduced-rank Adaptive Constrained Constant Modulus Beamforming Algorithms based on Joint Iterative Optimization of Filters

This paper proposes a reduced-rank scheme for adaptive beamforming based on the constrained joint iterative optimization of filters. We employ this scheme to devise two novel reduced-rank adaptive algorithms according to the constant modulus (CM) criterion with different constraints. The first devised algorithm is formulated as a constrained joint iterative optimization of a projection matrix and a reduced-rank filter with respect to the CM criterion subject to a constraint on the array response. The constrained constant modulus (CCM) expressions for the projection matrix and the reduced-rank weight vector are derived, and a low-complexity adaptive algorithm is presented to jointly estimate them for implementation. The second proposed algorithm is extended from the first one and implemented according to the CM criterion subject to a constraint on the array response and an orthogonal constraint on the projection matrix. The Gram-Schmidt (GS) technique is employed to achieve this orthogonal constraint and improve the performance. Simulation results are given to show superior performance of the proposed algorithms in comparison with existing methods.Comment: 4 figure

Adaptive Low-rank Constrained Constant Modulus Beamforming Algorithms using Joint Iterative Optimization of Parameters

This paper proposes a robust reduced-rank scheme for adaptive beamforming based on joint iterative optimization (JIO) of adaptive filters. The scheme provides an efficient way to deal with filters with large number of elements. It consists of a bank of full-rank adaptive filters that forms a transformation matrix and an adaptive reduced-rank filter that operates at the output of the bank of filters. The transformation matrix projects the received vector onto a low-dimension vector, which is processed by the reduced-rank filter to estimate the desired signal. The expressions of the transformation matrix and the reduced-rank weight vector are derived according to the constrained constant modulus (CCM) criterion. Two novel low-complexity adaptive algorithms are devised for the implementation of the proposed scheme with respect to different constrained conditions. Simulations are performed to show superior performance of the proposed algorithms in comparison with the existing methods.Comment: 4 figures, 4 pages. arXiv admin note: substantial text overlap with arXiv:1303.157

Study of Joint MSINR and Relay Selection Algorithms for Distributed Beamforming

This paper presents joint maximum signal-to-interference-plus-noise ratio (MSINR) and relay selection algorithms for distributed beamforming. We propose a joint MSINR and restricted greedy search relay selection (RGSRS) algorithm with a total relay transmit power constraint that iteratively optimizes both the beamforming weights at the relays nodes, maximizing the SINR at the destination. Specifically, we devise a relay selection scheme that based on greedy search and compare it to other schemes like restricted random relay selection (RRRS) and restricted exhaustive search relay selection (RESRS). A complexity analysis is provided and simulation results show that the proposed joint MSINR and RGSRS algorithm achieves excellent bit error rate (BER) and SINR performances.Comment: 7 pages, 2 figures. arXiv admin note: text overlap with arXiv:1707.0095

Study of Robust Distributed Beamforming Based on Cross-Correlation and Subspace Projection Techniques

In this work, we present a novel robust distributed beamforming (RDB) approach to mitigate the effects of channel errors on wireless networks equipped with relays based on the exploitation of the cross-correlation between the received data from the relays at the destination and the system output. The proposed RDB method, denoted cross-correlation and subspace projection (CCSP) RDB, considers a total relay transmit power constraint in the system and the objective of maximizing the output signal-to-interference-plus-noise ratio (SINR). The relay nodes are equipped with an amplify-and-forward (AF) protocol and we assume that the channel state information (CSI) is imperfectly known at the relays and there is no direct link between the sources and the destination. The CCSP does not require any costly optimization procedure and simulations show an excellent performance as compared to previously reported algorithms.Comment: 3 figures, 7 pages. arXiv admin note: text overlap with arXiv:1707.00953

Study of Efficient Robust Adaptive Beamforming Algorithms Based on Shrinkage Techniques

This paper proposes low-complexity robust adaptive beamforming (RAB) techniques based on shrinkage methods. We firstly briefly review a Low-Complexity Shrinkage-Based Mismatch Estimation (LOCSME) batch algorithm to estimate the desired signal steering vector mismatch, in which the interference-plus-noise covariance (INC) matrix is also estimated with a recursive matrix shrinkage method. Then we develop low complexity adaptive robust version of the conjugate gradient (CG) algorithm to both estimate the steering vector mismatch and update the beamforming weights. A computational complexity study of the proposed and existing algorithms is carried out. Simulations are conducted in local scattering scenarios and comparisons to existing RAB techniques are provided.Comment: 9 pages, 2 figures. arXiv admin note: text overlap with arXiv:1505.0678

Study of BEM-Type Channel Estimation Techniques for 5G Multicarrier Systems

In this paper, we investigate channel estimation techniques for 5G multicarrier systems. Due to the characteristics of the 5G application scenarios, channel estimation techniques have been tested in Orthogonal Frequency Division Multiplexing (OFDM) and Generalized Frequency Division Multiplexing (GFDM) systems. The orthogonality between subcarriers in OFDM systems permits inserting and extracting pilots without interference. However, due to pulse shaping, subcarriers in GFDM are no longer orthogonal and interfere with each other. Due to such interference, the channel estimation for GFDM is not trivial. A robust and low-complexity channel estimator can be obtained by combining a minimum mean-square error (MMSE) regularization and the basis expansion model (BEM) approach. In this work, we develop a BEM-type channel estimator along with a strategy to obtain the covariance matrix of the BEM coefficients. Simulations show that the BEM-type channel estimation shows performance close to that of the linear MMSE (LMMSE), even though there is no need to know the channel power delay profile, and its complexity is low.Comment: 2 figures, 7 page

Coordinate Tomlinson-Harashima Precoding Design for Overloaded Multi-user MIMO Systems

Tomlinson-Harashima precoding (THP) is a nonlinear processing technique employed at the transmit side to implement the concept of dirty paper coding (DPC). The perform of THP, however, is restricted by the dimensionality constraint that the number of transmit antennas has to be greater or equal to the total number of receive antennas. In this paper, we propose an iterative coordinate THP algorithm for the scenarios in which the total number of receive antennas is larger than the number of transmit antennas. The proposed algorithm is implemented on two types of THP structures, the decentralized THP (dTHP) with diagonal weighted filters at the receivers of the users, and the centralized THP (cTHP) with diagonal weighted filter at the transmitter. Simulation results show that a much better bit error rate (BER) and sum-rate performances can be achieved by the proposed iterative coordinate THP compared to the previous linear art.Comment: 3 figures, 6 pages, ISWCS 2014. arXiv admin note: text overlap with arXiv:1401.475

Study of Opportunistic Cooperation Techniques using Jamming and Relays for Physical-Layer Security in Buffer-aided Relay Networks

In this paper, we investigate opportunistic relay and jammer cooperation schemes in multiple-input multiple-output (MIMO) buffer-aided relay networks. The network consists of one source, an arbitrary number of relay nodes, legitimate users and eavesdroppers, with the constraints of physical layer security. We propose an algorithm to select a set of relay nodes to enhance the legitimate users' transmission and another set of relay nodes to perform jamming of the eavesdroppers. With Inter-Relay interference (IRI) taken into account, interference cancellation can be implemented to assist the transmission of the legitimate users. Secondly, IRI can also be used to further increase the level of harm of the jamming signal to the eavesdroppers. By exploiting the fact that the jamming signal can be stored at the relay nodes, we also propose a hybrid algorithm to set a signal-to-interference and noise ratio (SINR) threshold at the node to determine the type of signal stored at the relay node. With this separation, the signals with high SINR are delivered to the users as conventional relay systems and the low SINR performance signals are stored as potential jamming signals. Simulation results show that the proposed techniques obtain a significant improvement in secrecy rate over previously reported algorithms.Comment: 8 pages, 3 figure

Flexible Widely-Linear Multi-Branch Decision Feedback Detection Algorithms for Massive MIMO Systems

This paper presents widely-linear multi-branch decision feedback detection techniques for large-scale multiuser multiple-antenna systems. We consider a scenario with impairments in the radio-frequency chain in which the in-phase (I) and quadrature (Q) components exhibit an imbalance, which degrades the receiver performance and originates non-circular signals. A widely-linear multi-branch decision feedback receiver is developed to mitigate both the multiuser interference and the I/Q imbalance effects. An iterative detection and decoding scheme with the proposed receiver and convolutional codes is also devised. Simulation results show that the proposed techniques outperform existing algorithms.Comment: 3 figures, 9 pages. arXiv admin note: text overlap with arXiv:1308.272

Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques

This work presents cost-effective low-rank techniques for designing robust adaptive beamforming (RAB) algorithms. The proposed algorithms are based on the exploitation of the cross-correlation between the array observation data and the output of the beamformer. Firstly, we construct a general linear equation considered in large dimensions whose solution yields the steering vector mismatch. Then, we employ the idea of the full orthogonalization method (FOM), an orthogonal Krylov subspace based method, to iteratively estimate the steering vector mismatch in a reduced-dimensional subspace, resulting in the proposed orthogonal Krylov subspace projection mismatch estimation (OKSPME) method. We also devise adaptive algorithms based on stochastic gradient (SG) and conjugate gradient (CG) techniques to update the beamforming weights with low complexity and avoid any costly matrix inversion. The main advantages of the proposed low-rank and mismatch estimation techniques are their cost-effectiveness when dealing with high dimension subspaces or large sensor arrays. Simulations results show excellent performance in terms of the output signal-to-interference-plus-noise ratio (SINR) of the beamformer among all the compared RAB methods.Comment: 11 figures, 12 page