In this paper, we propose successive optimization non-linear precoding strategies for physical-layer security in wireless networks. We also investigate different precoding techniques for multi-user MIMO systems under various conditions of channel state information (CSI) between the access point and the users and the eavesdroppers. A non-linear precoding technique based on Successive Optimization Tomlinson-Harashima Precoding (SO-THP) and Simplified Generalized Matrix Inversion (S-GMI) technique is proposed along with a strategy for injecting artificial noise prior to transmission. Simulation results show that the proposed SO-THP+S-GMI precoding technique outperforms existing non-linear and linear precoding algorithms in terms of BER and secrecy rate performances.
In recent years, precoding techniques have been widely applied to multi-user MIMO systems. Precoding techniques rely on pre-processing the transmitted data with the help of channel state information (CSI). Different kinds of linear precoding techniques such as Zero-forcing (ZF) precoding, Minimum Mean Square Error (MMSE) precoding and Block Diagonalization (BD) precoding are introduced in @cite_15 - @cite_10 , respectively. Some non-linear precoding techniques like Tomlinson-Harashima precoding (THP) @cite_16 , Vector Perturbation (VP) precoding @cite_6 have also been reported. The precoding techniques can also contribute to the performance of relay systems @cite_9 These precoding techniques have been proven effective in improving the sum-rate and the bit-error rate (BER) performances. However, precoding strategies require CSI at the transmit side, whereas in reality CSI is available to the users of interest but is rarely available to the eavesdroppers. In most situations, a designer only has access to imperfect CSI for the users of interest. Dealing with imperfect CSI and the absence of CSI of the eavesdropper is a major challenge. Moreover, a technique that is particularly effective for improving the secrecy rate of physical-layer security is the introduction of artificial noise at the transmitter @cite_1 .
@cite_9 @cite_1 @cite_6 @cite_15 @cite_16 @cite_10
2170510856 2124309071 1432778544 2132035967 2035769579 2592550725 2611749634 2952850327 2131262740 1991331367 2124071994 1979755618 2123836500 2041287972 2635604129 1883796613 2081893537 2908955555 2152137554 1971976913
In this paper we introduce a novel linear precoding technique. The approach used for the design of the precoding matrix is general and the resulting algorithm can address several optimization criteria with an arbitrary number of antennas at the user terminals. We have achieved this by designing the precoding matrices in two steps. In the first step we minimize the overlap of the row spaces spanned by the effective channel matrices of different users using a new cost function. In the next step, we optimize the system performance with respect to specific optimization criteria assuming a set of parallel single- user MIMO channels. By combining the closed form solution with Tomlinson-Harashima precoding we reach the maximum sum-rate capacity when the total number of antennas at the user terminals is less or equal to the number of antennas at the base station. By iterating the closed form solution with appropriate power loading we are able to extract the full diversity in the system and reach the maximum sum-rate capacity in case of high multi-user interference. Joint processing over a group of multi-user MIMO channels in different frequency and time slots yields maximum diversity regardless of the level of multi-user interference. In this work, we propose a linear base station (BS) precoding strategy based on switched relaying (SR) processing for downlink multiuser multiple-input multiple-output (MIMO) relay systems. The BS and the MIMO relay station (RS) are both equipped with a codebook of interleaving matrices. For a given channel state information (CSI) the selection function at the BS chooses the optimum interleaving matrix from the codebook based on the maximum sum received signal-to-interference-plus-noise ratio (SINR) or sum rate to design the linear BS precoder. Prior to the payload transmission the BS sends the index corresponding to the selected interleaving matrix to the RS, where the optimum interleaving matrix is selected as the optimum relay processing matrix. The entries of the codebook are randomly generated unitary matrices. Simulation results show that the performance of the proposed techniques is significantly better than prior art in the case of perfect CSI.1 Millimeter wave (mmWave) MIMO will likely use hybrid analog and digital precoding, which uses a small number of RF chains to reduce the energy consumption associated with mixed signal components like analog-to-digital components not to mention baseband processing complexity. However, most hybrid precoding techniques consider a fully connected architecture requiring a large number of phase shifters, which is also energy-intensive. In this paper, we focus on the more energy-efficient hybrid precoding with subconnected architecture, and propose a successive interference cancelation (SIC)-based hybrid precoding with near-optimal performance and low complexity. Inspired by the idea of SIC for multiuser signal detection, we first propose to decompose the total achievable rate optimization problem with nonconvex constraints into a series of simple subrate optimization problems, each of which only considers one subantenna array. Then, we prove that maximizing the achievable subrate of each subantenna array is equivalent to simply seeking a precoding vector sufficiently close (in terms of Euclidean distance) to the unconstrained optimal solution. Finally, we propose a low-complexity algorithm to realize SIC-based hybrid precoding, which can avoid the need for the singular value decomposition (SVD) and matrix inversion. Complexity evaluation shows that the complexity of SIC-based hybrid precoding is only about 10 as complex as that of the recently proposed spatially sparse precoding in typical mmWave MIMO systems. Simulation results verify that SIC-based hybrid precoding is near-optimal and enjoys higher energy efficiency than the spatially sparse precoding and the fully digital precoding. In this paper, we propose a linear precoder for the downlink of a multi-user MIMO system with multiple users that potentially act as eavesdroppers. The proposed precoder is based on regularized channel inversion (RCI) with a regularization parameter α and power allocation vector chosen in such a way that the achievable secrecy sum-rate is maximized. We consider the worst-case scenario for the multi-user MIMO system, where the transmitter assumes users cooperate to eavesdrop on other users. We derive the achievable secrecy sum-rate and obtain the closed-form expression for the optimal regularization parameter αLS of the precoder using large-system analysis. We show that the RCI precoder with αLS outperforms several other linear precoding schemes, and it achieves a secrecy sum-rate that has same scaling factor as the sum-rate achieved by the optimum RCI precoder without secrecy requirements. We propose a power allocation algorithm to maximize the secrecy sum-rate for fixed α. We then extend our algorithm to maximize the secrecy sum-rate by jointly optimizing α and the power allocation vector. The jointly optimized precoder outperforms RCI with αLS and equal power allocation by up to 20 percent at practical values of the signal-to-noise ratio and for 4 users and 4 transmit antennas. Existing studies on physical layer security often assume the availability of perfect channel state information (CSI) and overlook the importance of channel training needed for obtaining the CSI. In this letter, we discuss how an active eavesdropper can attack the training phase in wireless communication to improve its eavesdropping performance. We derive a new security attack from the pilot contamination phenomenon, which targets at systems using reverse training to obtain the CSI at the transmitter for precoder design. This attack changes the precoder used by the legitimate transmitter in a controlled manner to strengthen the signal reception at the eavesdropper during data transmission. Furthermore, we discuss an efficient use of the transmission energy of an advanced full-duplex eavesdropper to simultaneously achieve a satisfactory eavesdropping performance whilst degrading the detection performance of the legitimate receiver. Channel reciprocity in time-division duplexing (TDD) massive multiple-input multiple-output (MIMO) systems can be exploited to reduce the overhead required for the acquisition of channel state information (CSI). However, perfect reciprocity is unrealistic in practical systems due to random radio-frequency (RF) circuit mismatches in uplink and downlink channels. This can result in a significant degradation in the performance of linear precoding schemes, which are sensitive to the accuracy of the CSI. In this paper, we model and analyse the impact of RF mismatches on the performance of linear precoding in a TDD multi-user massive MIMO system, by taking the channel estimation error into considerations. We use the truncated Gaussian distribution to model the RF mismatch, and derive closed-form expressions of the output signal-to-interference-plus-noise ratio for maximum ratio transmission and zero forcing precoders. We further investigate the asymptotic performance of the derived expressions, to provide valuable insights into the practical system designs, including useful guidelines for the selection of the effective precoding schemes. Simulation results are presented to demonstrate the validity and accuracy of the proposed analytical results. We propose a new hybrid precoding technique for massive multi-input multi-output (MIMO) systems using spatial channel covariance matrices in the analog precoder design. Applying a regularized zero-forcing precoder for the baseband precoding matrix, we find an unconstrained analog precoder that maximizes signal-to-leakage-plus-noise ratio (SLNR) while ignoring analog phase shifter constraints. Subsequently, we develop a technique to design a constrained analog precoder that mimics the obtained unconstrained analog precoder under phase shifter constraints. The main idea is to adopt an additional baseband precoding matrix, which we call a compensation matrix. We analyze the SLNR loss due to the proposed hybrid precoding compared to fully digital precoding, and determine which factors have a significant impact on this loss. In the simulations, we show that if the channel is spatially correlated and the number of users is smaller than the number of RF chains, the SLNR loss becomes negligible compared to fully digital precoding. The main benefit of our method stems from the use of spatial channel matrices in such a way that not only is each user's desired signal considered, but also the inter-user interference is incorporated in the analog precoder design. Obtaining accurate Channel State Information (CSI) at the transmitters (TX) is critical to many cooperation schemes such as Network MIMO, Interference Alignment etc. Practical CSI feedback and limited backhaul-based sharing inevitably creates degradations of CSI which are specific to each TX, giving rise to a distributed form of CSI. In the Distributed CSI (D-CSI) broadcast channel setting, the various TXs design elements of the precoder based on their individual estimates of the global multiuser channel matrix, which intuitively degrades performance when compared with the commonly used centralized CSI assumption. This paper tackles this challenging scenario and presents a first analysis of the rate performance for the distributed CSI multi-TX broadcast channel setting, in the large number of antenna regime. Using Random Matrix Theory (RMT) tools, we derive deterministic equivalents of the Signal to Interference plus Noise Ratio (SINR) for the popular regularized Zero-Forcing (ZF) precoder, allowing to unveil the price of distributedness for such cooperation methods. We consider a MIMO broadcast channel where both the transmitter and receivers are equipped with multiple antennas. Channel state information at the transmitter (CSIT) is obtained through limited (i.e., finite-bandwidth) feedback from the receivers that index a set of precoding vectors contained in a predefined codebook. We propose a novel transceiver architecture based on zero-forcing beamforming and linear receiver combining. The receiver combining and quantization for CSIT feedback are jointly designed in order to maximize the expected SINR for each user. We provide an analytic characterization of the achievable throughput in the case of many users and show how additional receive antennas or higher multiuser diversity can reduce the required feedback rate to achieve a target throughput.We also propose a design methodology for generating codebooks tailored for arbitrary spatial correlation statistics. The resulting codebooks have a tree structure that can be utilized in time-correlated MIMO channels to significantly reduce feedback overhead. Simulation results show the effectiveness of the overall transceiver design strategy and codebook design methodology compared to prior techniques in a variety of correlation environments. We study the potential benefits of base-station (BS) cooperation for downlink transmission in multicell networks. Based on a modified Wyner-type model with users clustered at the cell-edges, we analyze the dirty-paper-coding (DPC) precoder and several linear precoding schemes, including cophasing, zero-forcing (ZF), and MMSE precoders. For the nonfading scenario with random phases, we obtain analytical performance expressions for each scheme. In particular, we characterize the high signal-to-noise ratio (SNR) performance gap between the DPC and ZF precoders in large networks, which indicates a singularity problem in certain network settings. Moreover, we demonstrate that the MMSE precoder does not completely resolve the singularity problem. However, by incorporating path gain fading, we numerically show that the singularity problem can be eased by linear precoding techniques aided with multiuser selection. By extending our network model to include cell-interior users, we determine the capacity regions of the two classes of users for various cooperative strategies. In addition to an outer bound and a baseline scheme, we also consider several locally cooperative transmission approaches. The resulting capacity regions show the tradeoff between the performance improvement and the requirement for BS cooperation, signal processing complexity, and channel state information at the transmitter (CSIT). Secure communications can be impeded by eavesdroppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay network can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jamming scheme is proposed that shows significant improvement in terms of secrecy rate compared to the approach without jamming. Furthermore, the case involving an eavesdropper with unknown CSI is also investigated in this paper. Simulation results show that the secrecy rate is dramatically increased when inactive nodes in the relay network participate in cooperative jamming. The objective of this paper is to study the performance of a multicell vector perturbation (MVP) precoding technique under practical situations in a network multiple-input multiple-output (MIMO) scheme employing joint transmission. The conventional perturbation strategy that minimizes the total power is considered, and the power at each base station (BS) is properly scaled to enforce per-BS power constraints. In our scenario, we consider multiple-antenna users and use block diagonalization (BD) as the linear front-end precoder for VP. The sum rate for the MVP in the case of uniformly distributed input and an asymptotic upper bound on the sum rate at high signal-to-noise ratios (SNRs) are derived. In addition, using the asymptotic upper bound on the individual user rates, we propose a proportionally fair (PF) user scheduling algorithm of lower complexity and better performance compared with the benchmark fair semiorthogonal user selection (SUS) algorithm. As opposed to the PF-SUS, the proposed PF scheduling algorithm requires no predefined correlation threshold. Furthermore, we study the impact of backhaul delay on the performance of both VP and BD by deriving bounds on the sum rate. The numerical results show that MVP in the case of perfect channel state information (CSI) outperforms multicell BD. In the presence of a backhaul delay, the performance of MVP significantly degrades, but the upper bound on the sum rate for MVP is still higher than for multicell BD. We consider the MIMO broadcast channel (MIMO-BC) where an array equipped with M antennas transmits distinct information to K users, each equipped with N antennas. We propose a linear precoding technique, called multiuser eigenmode transmission (MET), based on the block diagonalization precoding technique. MET addresses the shortcomings of previous ZF-based beamformers by transmitting to each user on one or more eigenmodes chosen using a greedy algorithm. We consider both the typical sum-power constraint (SPC), and a per-antenna power constraint (PAPC) motivated by array architectures where antennas are powered by separate amplifiers and are either co-located or spatially separated. Numerical results show that the proposed MET technique outperforms previous linear techniques with both SPC and PAPC. Asymptotically as the number of user K increases without bound, we show that block diagonalization with receive antenna selection under PAPC and SPC are asymptotically optimal. Massive multiple-input multiple-output (MIMO) is envisioned to offer considerable capacity improvement, but at the cost of high complexity of the hardware. In this paper, we propose a low-complexity hybrid precoding scheme to approach the performance of the traditional baseband zero-forcing (ZF) precoding (referred to as full-complexity ZF), which is considered a virtually optimal linear precoding scheme in massive MIMO systems. The proposed hybrid precoding scheme, named phased-ZF (PZF), essentially applies phase-only control at the RF domain and then performs a low-dimensional baseband ZF precoding based on the effective channel seen from baseband. Heavily quantized RF phase control up to 2 bits of precision is also considered and shown to incur very limited degradation. The proposed scheme is simulated in both ideal Rayleigh fading channels and sparsely scattered millimeter wave (mmWave) channels, both achieving highly desirable performance. This paper characterizes the performance in terms of queueing stability of a network composed of multiple MIMO transmitter-receiver pairs taking into account the dynamic traffic pattern and the probing feedback cost. We adopt a centralized scheduling scheme that selects a number of active pairs in each time-slot. We consider that the transmitters apply interference alignment (IA) technique if two or more pairs are active, whereas in the special case where one pair is active point-to-point MIMO singular value decomposition (SVD) is used. We consider a time-division duplex (TDD) system where transmitters acquire their channel state information (CSI) by decoding the pilot sequences sent by the receivers. Since global CSI knowledge is required for IA, the transmitters have also to exchange their estimated CSIs over a backhaul of limited capacity (i.e. imperfect case). Under this setting, we characterize in this paper the stability region of the system under both the imperfect and perfect (i.e. unlimited backhaul) cases, then we examine the gap between these two resulting regions. Further, under each case we provide a centralized probing policy that achieves the max stability region. These stability regions and scheduling policies are given for the symmetric system, where all the path loss coefficients are equal to each other, as well as for the general system. For the symmetric system, we provide the conditions under which IA yields a queueing stability gain compared to SVD. Under the general system, the adopted scheduling policy is of a high computational complexity for moderate numbers of pairs, consequently we propose an approximate policy that has a reduced complexity but that achieves only a fraction of the system stability region. A characterization of this fraction is provided. In this paper we compare the following two methods of transmit preceding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also termed zero forcing or ZF) precoding and scalar Tomlinson-Harashima (TH) precoding applied to sum-rate achieving transmit precoding. Our results indicate that vector perturbation applied to channel inversion preceding can significantly reduce power enhancement and yields the full diversity afforded by the channel to each user. Scalar TH-modulo reduction significantly reduces the power enhancement for precoding based on sum-rate criterion. The solution to vector perturbation applied to ZF precoding requires the solution to an integer optimization problem which is exponentially complex, or an approximation to the integer optimization problem which requires the Lenstra-Lenstra-Lovasz algorithm of polynomial complexity. Instead we propose a simpler solution (an approximation) to the vector perturbation problem based on the Rayleigh-Ritz theorem (R.A. Horn and C.R. Johnson, 1985). This approximate solution achieves the same diversity order as the optimal vector perturbation technique, but suffers a small coding loss. This solution is of polynomial complexity order. Further, a small increase in complexity with a "sphere"-based search around this solution yields significantly better performance. Since this vector perturbation is required to be done at the symbol rate, the lower complexity of the proposed algorithm is valuable in practice Consider media streaming in MIMO interference networks whereby multiple base stations (BS) simultaneously deliver media to their associated users using fixed data rates. The performance is fundamentally limited by the cross-link interference. We propose a cache-induced opportunistic cooperative MIMO (CoMP) for interference mitigation. By caching a portion of the media files, the BSs opportunistically employ CoMP to transform the cross-link interference into spatial multiplexing gain. We study a mixed-timescale optimization of MIMO precoding and cache control to minimize the transmit power under the rate constraint. The cache control is to create more CoMP opportunities and is adaptive to the long-term popularity of the media files. The precoding is to guarantee the rate requirement and is adaptive to the channel state information and cache state at the BSs. The joint stochastic optimization problem is decomposed into a short-term precoding and a long-term cache control problem. We propose a precoding algorithm which converges to a stationary point of the short-term problem. Based on this, we exploit the hidden convexity of the long-term problem and propose a low complexity and robust solution using stochastic subgradient. The solution has significant gains over various baselines and does not require explicit knowledge of the media popularity. A major obstacle for widespread deployment of frequency division duplex (FDD)-based Massive multiple-input multiple-output (MIMO) communications is the large signaling overhead for reporting full downlink (DL) channel state information (CSI) back to the basestation (BS), in order to enable closed-loop precoding. We completely remove this overhead by a deep-learning based channel extrapolation (or "prediction") approach and demonstrate that a neural network (NN) at the BS can infer the DL CSI centered around a frequency @math by solely observing uplink (UL) CSI on a different, yet adjacent frequency band around @math ; no more pilot reporting overhead is needed than with a genuine time division duplex (TDD)-based system. The rationale is that scatterers and the large-scale propagation environment are sufficiently similar to allow a NN to learn about the physical connections and constraints between two neighboring frequency bands, and thus provide a well-operating system even when classic extrapolation methods, like the Wiener filter (used as a baseline for comparison throughout) fails. We study its performance for various state-of-the-art Massive MIMO channel models, and, even more so, evaluate the scheme using actual Massive MIMO channel measurements, rendering it to be practically feasible at negligible loss in spectral efficiency when compared to a genuine TDD-based system. In this paper, we consider a discrete memoryless state-dependent relay channel with non-causal Channel State Information (CSI). We investigate three different cases in which perfect channel states can be known non-causally: i) only to the source, ii) only to the relay or iii) both to the source and to the relay node. For these three cases we establish lower bounds on the channel capacity (achievable rates) based on using Gel'fand-Pinsker coding at the nodes where the CSI is available and using Compress-and-Forward (CF) strategy at the relay. Furthermore, for the general Gaussian relay channel with additive independent and identically distributed (i.i.d) states and noise, we obtain lower bounds on the capacity for the cases in which CSI is available at the source or at the relay. We also compare our derived bounds with the previously obtained results which were based on Decode-and-Forward (DF) strategy, and we show the cases in which our derived lower bounds outperform DF based bounds, and can achieve the rates close to the upper bound. We present a framework to study linear deterministic interference networks over finite fields. Unlike the popular linear deterministic models introduced to study Gaussian networks, we consider networks where the channel coefficients are general scalars over some extension field Fpm (scalar m-th extensionfield models), m×m diagonal matrices over Fp (m-symbol extension ground-field models), and m×m general non-singular matrices (MIMO ground field models). We use the companion matrix representation of the extension field to convert m-th extension scalar models into MIMO ground-field models where the channel matrices have special algebraic structure. For such models, we consider the 2× 2× 2 topology (two-hops two-flow) and the 3-user interference network topology. We derive achievability results and feasibility conditions for certain schemes based on the Precoding-Based Network Alignment (PBNA) approach, where intermediate nodes use random linear network coding (i.e., propagate random linear combinations of their incoming messages) and non-trivial precoding decoding is performed only at the network edges, at the sources and destinations. Furthermore, we apply this approach to the scalar 2×2×2 complex Gaussian IC with fixed channel coefficients, and show two competitive schemes outperforming other known approaches at any SNR, where we combine finite-field linear precoding decoding with lattice coding and the Compute and Forward approach at the signal level. As a side result, we also show significant advantages of vector linear network coding both in terms of feasibility probability (with random coding coefficients) and in terms of coding latency, with respect to standard scalar linear network coding, in PBNA schemes.