Search

Imperfect Channel State Information at the Transmitter (CSIT) is inevitable in modern wireless communication networks, and results in severe multi-user interference in multi-antenna Broadcast Channel (BC). While the capacity of multi-antenna (Gaussian) BC with perfect CSIT is known and achieved by Dirty Paper Coding (DPC), the capacity and the capacity-achieving strategy of multi-antenna BC with imperfect CSIT remain unknown. Conventional approaches therefore rely on applying communication strategies designed for perfect CSIT to the imperfect CSIT setting. In this work, we break this conventional routine and make two major contributions. First, we show that linearly precoded Rate-Splitting (RS), relying on the split of messages into common and private parts and linear precoding at the transmitter, and successive interference cancellation at the receivers, can achieve larger rate region than DPC in multi-antenna BC with partial CSIT. Second, we propose a novel scheme, denoted as Dirty Paper Coded Rate-Splitting (DPCRS), that relies on RS to split the user messages into common and private parts, and DPC to encode the private parts. We show that the rate region of DPCRS in Multiple-Input Single-Output (MISO) BC with partial CSIT is enlarged beyond that of conventional DPC and that of linearly precoded RS. Gaining benefits from the capability of RS to partially decode the interference and partially treat interference as noise, DPCRS is less sensitive to CSIT inaccuracies, networks loads and user deployments compared with DPC and other existing transmission strategies. [ABSTRACT FROM AUTHOR]

For multi-user multiple-input-multiple-output (MU-MIMO) system, transmitter utilizes a pre-equalizer based precoding to cancel inter-stream interference for parallel transmission with the aid of accurate feedback of channel state information (CSI) from all receivers. The correct power scaling factor, which normalizes the symbols power of precoding to be a constant one, is required at each receiver. Due to CSI error and limitation of feed-forward link, the received inaccurate power scaling factor will shrink or expand the received constellation points which severely degrades the performance of MIMO system. In this paper, using nonlinear vector perturbation (VP) and linear zero-forcing (ZF) precoding, we analyze the impact of inaccurate power scaling factor on the performance of a MIMO precoding system. The analyzed results show that the mismatched modulo size from inaccurate power scaling factor severely degrades the performance of the VP system, especially for high order M-QAM modulation. In addition, the performance degradation is strongly related with the distribution of representation points for each M-QAM symbol. For linear ZF precoding, the performance loss from the shrinked or expanded constellation points is severe for system using high order M-QAM. In addition, to alleviate the performance degradation, we propose a VP system using partial perturbation points (PPP). By limiting the region of redundant points with vector perturbation for partial M-QAM symbols, the performance degradation due to the inaccurate power scaling factor can be alleviated. [ABSTRACT FROM AUTHOR]

In wireless networks, the link connectivity may be intermittent due to shadowing, burstiness of data arrival, or uncoordinated resource allocation. In this paper, we model the intermittence of links as Bernoulli distributed random channel states, termed intermittence channel states, and study the impact of the corresponding channel state information at the transmitter (CSIT) in a two-user Gaussian broadcast channel (BC). Moreover, due to the heterogeneous timeliness of intermittence channel states, the CSIT considered in this paper is hybrid. More specifically, the CSIT of each link can be perfectly (causally or non-causally) available, delayed, or not available. When the links are connected, we adopt a general setting that the received signal-to-noise ratios can be different. Our contribution is the characterization of the capacity regions of intermittent Gaussian BC to within bounded gaps for all combinations of hybrid CSIT, except for scenario DN (delayed CSIT of receiver 1, no CSIT of receiver 2). For scenario DN, we propose an opportunistic physical layer network coding scheme that achieves a strictly larger degree-of-freedom (DoF) region than the no-CSIT DoF region. As a corollary, single-user CSIT is able to increase the sum DoF for intermittent Gaussian BC (also the capacity region for the erasure BC, as a by-product). This result is in sharp contrast to the recent negative result by Davoodi and Jafar, where it is shown that for fast-fading multiple-input single-output BC with continuous channel states, single-user CSIT does not help at all in terms of sum DoF. [ABSTRACT FROM AUTHOR]

The reconfigurable intelligent surface (RIS), which consists of many low-cost reflecting elements, can enhance the reception of the desired signal and suppress the interference. Considering the above advantages, this paper investigates the RIS-assisted wireless communication in the presence of an interferer, where a receiver receives the desired signal and interference from a transmitter and an interferer, respectively, and the RIS is deployed to assist this system. First, an interference-limited channel capacity maximization problem is formulated, and a numerical algorithm based on the fraction programming and optimality conditions is proposed to obtain the optimal solution. Then, this paper shows the upper boundary of the maximal capacity with interference and discusses what kind of channel conditions can achieve the upper boundary and the corresponding optimal phase shifts. Next, this paper analyzes the asymptotic behaviors of the maximal capacity in the scenarios that some or all of the number of reflecting elements, antennas at the transmitter, and interferer go to infinity. Finally, this paper generalizes the above results to the multiple interferers scenario. [ABSTRACT FROM AUTHOR]

This paper studies a memoryless state-dependent multiple access channel (MAC) where two transmitters wish to convey a message to a receiver under the assumption of causal and imperfect channel state information at transmitters (CSIT) and imperfect channel state information at receiver (CSIR). In order to emphasize the limitation of transmitter cooperation between physically distributed nodes, we focus on the so-called distributed CSIT assumption, i.e., where each transmitter has its individual channel knowledge, while the message can be assumed to be partially or entirely shared a priori between transmitters by exploiting some on-board memory. Under this setup, the first part of the paper characterizes the common message capacity of the channel at hand for arbitrary CSIT and CSIR structure. The optimal scheme builds on Shannon strategies, i.e., optimal codes are constructed by letting the channel inputs be a function of current CSIT only. For a special case when CSIT is a deterministic function of CSIR, the considered scheme also achieves the capacity region of a common message and two private messages. The second part addresses an important instance of the previous general result in a context of a cooperative multi-antenna Gaussian channel under i.i.d. fading operating in frequency-division duplex mode, such that CSIT is acquired via an explicit feedback of perfect CSIR. The capacity of the channel at hand is achieved by distributed linear precoding applied to Gaussian codes. Surprisingly, we demonstrate that it is suboptimal to send a number of data streams bounded by the number of transmit antennas as typically considered in a centralized CSIT setup. Finally, numerical examples are provided to evaluate the sum capacity of the binary MAC with binary states as well as the Gaussian MAC with i.i.d. fading. [ABSTRACT FROM AUTHOR]

Computation over multiple access channels (CoMAC) has been proposed to solve the problem of spectrum scarcity in wireless networks, which combines communication and computation efficiently using the superposition property of wireless channels. In this paper, we consider a multi-cluster CoMAC network, whose performance is affected by the inter-cluster interference and the non-uniform fading. To minimize the sum mean squared error of signals aggregated at different fusion centers (FCs), we propose a transceiver design for multi-cluster CoMAC. Specifically, we adopt a uniform-forcing transmitter design to formulate the receiver design as a quadratic sum-of-ratios problem with nonconvex quadratic constraints. Then, we propose a branch-and-bound algorithm to find its optimal solution with a given error tolerance. To solve the problem in a decentralized way, we develop a distributed algorithm based on the primal decomposition theory. Each subproblem is solved by using the successive convex approximation method. Further combining Lagrange duality, we derive the optimal solution structure of each subproblem, based on which we can find the solution with lower complexity. Simulation results demonstrate the effectiveness of the proposed distributed transceiver design. [ABSTRACT FROM AUTHOR]

Owing to the flexible mobility and convenient deployment, unmanned aerial vehicle (UAV) aided networks can facilitate many applications. However, the open accessibility of wireless communication brings a great risk of privacy to UAV-based networks. Thus, in this paper, we propose a UAV-aided covert communication scheme assisted by a multi-antenna jammer to maximize the transmission rate between a ground transmitter and a UAV receiver against several randomly distributed wardens. The transmitter adopts the maximum ratio transmission, while the jammer zero-forces its transmitted signal at the UAV to disturb the monitoring at wardens without interfering the legitimate transmission. First, we analyze the detection performance and derive the optimal threshold for each warden to minimize its detection outage probability (DOP). Then, with the worst situation in which all wardens set their respective optimal thresholds to achieve the minimum global DOP, the location and the transmit power of the jammer are optimized to maximize the DOP. The location of UAV and the transmit power of the ground transmitter are also optimized to maximize the transmission rate with the minimum DOP requirement satisfied. Numerical results are provided to demonstrate the effectiveness of the proposed UAV-aided covert communication scheme. [ABSTRACT FROM AUTHOR]

It has been a challenging task to derive the complementary cumulative distribution function (CCDF) of aggregate interference as closed-form in Poisson point process (PPP). In this paper, we consider wireless communication networks where transmitters are all distributed according to homogeneous PPP and study the CCDF of the interference. Mainly, we derive generalized bounds on the CCDF of aggregate interference from whole homogeneous PPP based on discretization of interference, which considerably enhance tightness compared to the previous bounds. These bounds can be used to the analysis requiring the distribution for aggregate interference, such as deployment and activation of BSs, massive MIMO, and millimeter wave communication networks. As examples of utilizing the derived bounds, we derive tractable coverage probabilities of uplink non-orthogonal multiple access (NOMA) users and downlink users in cellular networks under line-of-sight(LoS)/non-line-of-signt (NLOS) channels, respectively. In NOMA, we derive the closed-form bounds on coverage probability when successive interference cancellation is adopted for NOMA signal demodulation. Using the proposed bounds, we also obtain the bounds on coverage probability of a cellular system with LoS/NLOS channels. The tightness of bounds in this work is shown via numerical comparison. Moreover, we mathematically prove the convergence of bounds to exact CCDF. [ABSTRACT FROM AUTHOR]

In this paper, we consider a coordinated beamforming design for a multiple-input single-output bursty interference channel. In practical scenarios, the distributed medium access control mechanisms or the decentralized networking protocols across different users contribute to the bursty nature of network traffic. The potential gains provided by such burstiness can be exploited by feeding back the interference state information to the transmitters. Errors may occur during such feedback, thus causing uncertainties in the user traffic and resulting in complicated beamforming design problems. In this paper, we model such traffic uncertainties by using a hidden Markov model (HMM). Assuming that perfect channel state information (CSI) is available at the transmitters, our goal is to maximize the average system utility subjected to average power constraints under traffic uncertainties. We also extend the optimization problem to the imperfect CSI case. However, the resulting problem is highly nonconvex. Hence, we apply a series of convex approximation techniques. We further improve the approximation accuracy by using our proposed successive convex approximation (SCA) algorithms (HMM-SCA). In our simulation results, we observe that our proposed HMM-SCA provides a $46.3\%$ improvement in weighted sum rate over the SCA algorithm, in which the interference is assumed to be always present (NB-SCA). For the average weighted geometric mean rate, we observe that our proposed HMM-SCA also provides a $41.3\%$ improvement over the NB-SCA when user fairness is considered. Therefore, it is crucial to exploit bursty traffic for a practical wireless communication system when channel estimation errors are considered. [ABSTRACT FROM AUTHOR]

In this paper, spectrum sharing incentive for legitimate wireless information surveillance at the physical layer is investigated. The concept behind this is that authorized government agencies want to eavesdrop the communication between a suspicious source-destination pair, and stimulate the help of another source-destination pair (referred to as secondary users) looking for transmission opportunities. We thus propose to let the secondary receiver act as a monitor to eavesdrop the suspicious communication and let the secondary transmitter act as a friendly jammer to improve the eavesdropping performance, such that they are granted to share the spectrum of the suspicious users, as a reward. To guarantee the eavesdropping performance, the successful eavesdropping probability is required to be larger than that with passive eavesdropping. The problems of jointly optimizing the transmit power of the secondary transmitter and the successive interference cancellation (SIC) decoding order at the secondary receiver to maximize the average secondary transmission rate and minimize the secondary transmission outage probability are investigated. Two scenarios are considered for the availability of the channel state information (CSI). The first scenario assumes perfect CSI, and the optimal strategies for the transmit power control and the SIC decoding ordering are derived. The second scenario assumes partial CSI, where the instantaneous CSI of the secondary transmission link and the statistical CSI of the links related to the suspicious communication are available, and the optimal strategies for maximizing an approximate average secondary transmission rate and minimizing an approximate secondary transmission outage probability are proposed. Extensive simulation results validate the effectiveness of the proposed strategies. [ABSTRACT FROM AUTHOR]

To meet the ever increasing demand for better service quality and availability, the next generation digital TV (DTV) broadcast, a.k.a., the ATSC 3.0, is developed with new capabilities to deliver 4K ultra-high-definition (4K-UHD) services to fixed receivers, robust HD-quality services to mobile receivers, as well as non-broadcast services (e.g., broadband), including Internet of Things (IoT), Connected Vehicles, etc. To realize these capabilities, it becomes necessary to evolve the existing single-transmitter high-power-high-tower (HPHT) network to multi-transmitter low-power-low-tower single-frequency-networks (SFN), which requires installing new transmitters. Each new transmitter needs a feederlink to receive the service data from the broadcast gateway (BG) for transmission. This feederlink contributes to a significant portion of installation and operational costs of the new transmitters. This paper proposes a wireless in-band distribution link (WIDL) technology, where the distribution data is delivered to the newly deployed transmitters from the existing DTV towers wirelessly sharing the same TV band with the broadcast services. The distribution signal is multiplexed with service signal in the same ATSC 3.0 waveform. Layered division multiplexing (LDM) technology is proposed to achieve more efficient transmission of the distribution signal. The WIDL offers better performance and more robust operation than the on-channel repeater (OCR) technologies. More importantly, it offers the possibility of delivering backhaul data for future applications over the DTV infrastructure, such as IoT and connected vehicles. Therefore, the proposed WIDL is one enabling technology to achieve convergence of broadcast services with broadband and other wireless services on the DTV spectrum. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the covert communications in an overlay cognitive radio (CR) network, where multiple secondary transmitters (STs) opportunistically send confidential information to a secondary receiver (SR). In contrast to current studies with ensuring security of information transmitted, we are motivated to protect communication behavior in CR network, which is considered as a higher-level security. To address covert rate and fairness performance, three joint user-jammer scheduling schemes are proposed, namely, rate-oriented secondary user scheduling (R-SUS), link-oriented secondary user scheduling (L-SUS), and fairness oriented secondary user scheduling (F-SUS). Numerical results show that the minimal detection error probability at eavesdropper (Eve) can be effectively impacted by creating channel uncertainty with the jamming signal. Further, it can be seen that under the same covert constraint, the R-SUS scheme achieves the best covert rate performance, full diversity can be obtained by the L-SUS scheme, while the F-SUS scheme exploits an advantage of better fairness. [ABSTRACT FROM AUTHOR]

This paper studies the information-energy ($\mathrm{I}$ - $\mathrm{E}$) region for simultaneous wireless information and power transfer (SWIPT) networks in mobility scenarios, where a moving transmitter simultaneously transmits information and power to a fixed receiver, and the receiver adopts power splitting (PS) receiving architecture. In order to characterize the tradeoff between the received information and harvested energy, the $\mathrm{I}$ - $\mathrm{E}$ region is defined, and corresponding optimization problems are formulated to explore the system $\mathrm{I}$ - $\mathrm{E}$ regions by jointly optimizing the transmit power at the transmitter and the PS ratio at the receiver with three popular energy harvesting (EH) models, i.e., traditional linear EH model, the logistic nonlinear EH model and the piecewise nonlinear EH model. Particularly, to efficiently solve the nonconvex optimization problem with the logistic nonlinear EH model, a successive convex approximate (SCA)-based algorithm is proposed, which is able to characterize the lower bound of the $\mathrm{I}$ - $\mathrm{E}$ with low complexity. To solve the optimization problems with the linear and piecewise EH models, as they are convex, some closed and semi-closed solutions are derived by using Lagrange dual method and KKT conditions. Numerical results show that compared with the $\mathrm{I}$ - $\mathrm{E}$ regions under the linear and piecewise EH models, that under the logistic nonlinear EH model is smaller due to the limitations of practical EH circuit features. Moreover, with a fixed moving speed, when the transmit power is relatively large, the logistic nonlinear EH model can be replaced with the piecewise one due to the relatively small gap between their achieved $\mathrm{I}$ - $\mathrm{E}$ regions. Additionally, for a fixed moving track length, the higher moving speed yields the smaller $\mathrm{I}$ - $\mathrm{E}$ region with all three EH models. [ABSTRACT FROM AUTHOR]

This paper studies caching in $(K\!+\!L\!-\!1)\!\times \!K$ partially connected wireless linear networks, where each of the $K$ receivers locally communicates with $L$ out of the $K\!+\!L\!-\!1$ transmitters, and caches are at all nodes. The goal is to design caching and delivery schemes to reduce the transmission latency, by using normalized delivery time (NDT) as the performance metric. For small transmitter cache size (any $L$ transmitters can collectively store the database just once), we propose a cyclic caching strategy so that each of every $L$ consecutive transmitters caches a distinct part of each file; the delivery strategy exploits coded multicasting and interference alignment by introducing virtual receivers. The obtained NDT is within a multiplicative gap of 2 to the optimum in the entire cache size region, and optimal in certain region. For large transmitter cache size (any $L$ transmitters can collectively store the database for multiple copies), we propose a modified caching strategy so that every bit is repeatedly cached at consecutive transmitters; the delivery strategy exploits self-interference cancellation and interference neutralization. By combining these schemes, the NDT is optimal in a larger region. We also extend our results to linear networks with heterogeneous receiver connectivity and partially connected circular networks. [ABSTRACT FROM AUTHOR]

Building on the recent coded-caching breakthrough by Maddah-Ali and Niesen, the work here considers the $K$ -user cache-aided wireless multi-antenna symmetric broadcast channel with random fading and imperfect feedback, and analyzes the throughput performance as a function of feedback statistics and cache size. In this setting, this paper identifies the optimal cache-aided degrees-of-freedom (DoF) within a factor of 4, by identifying near-optimal schemes that exploit a new synergy between coded caching and delayed CSIT, as well as by exploiting the unexplored interplay between caching and feedback-quality. The DoF expressions reveal an initial gain due to current CSIT, and an additional gain due to coded caching, which is exponential in the sense that any linear decrease in the required DoF performance, allows for an exponential reduction in the required cache size. In the end, this paper reveals three new aspects of caching: a synergy between memory and delayed feedback, a tradeoff between memory and current CSIT, and a powerful ability to provide cache-aided feedback savings. [ABSTRACT FROM PUBLISHER]

Chemical reactions are a prominent feature of molecular communication systems, with no direct parallels in wireless communications. While chemical reactions may be used inside the transmitter nodes, receiver nodes, or the communication medium, we focus on its utility in the medium in this paper. Such chemical reactions can be used to perform computation over the medium as molecules diffuse and react with each other (physical-layer computation). We propose the use of chemical reactions for the following purposes: 1) to reduce signal-dependent observation noise of receivers by reducing the signal density; 2) to realize molecular physical-layer network coding (PNC) by performing the natural XOR operation inside the medium; and 3) to reduce the inter-symbol interference (ISI) of other transmitters by canceling out the remaining molecules from previous transmissions. To make the ideas formal, we consider an explicit two-way relaying example with a transparent receiver (which has a signal-dependent noise). The proposed ideas are used to define a modulation scheme (which we call the PNC scheme). We compare the PNC with a previously proposed scheme for this problem, where the XOR operation is performed at the relay node (using a molecular logic gate). We call the latter, the straightforward network coding (SNC). It is observed that in addition to the simplicity of the proposed PNC scheme, it outperforms the SNC scheme especially when we consider ISI. [ABSTRACT FROM AUTHOR]

This paper considers a wireless communication network consisting of multiple interfering multicast sessions. Different from a unicast system where each transmitter has only one receiver, in a multicast system, each transmitter has multiple receivers and broadcasts a common message to all of them. It is a well-known result for wireless unicast systems that the feasibility of a signal-to-interference-plus-noise power ratio (SINR) without power constraint is decided by the spectral radius of a nonnegative matrix. We generalize this result and obtain necessary and sufficient conditions for the feasibility of an SINR in a wireless multicast system with and without power constraint. The feasible SINR region and its geometric properties are studied. Besides, an iterative algorithm is proposed, which can efficiently check the feasibility condition and compute the boundary points of the feasible SINR region. [ABSTRACT FROM AUTHOR]

In this paper, we study a secure cooperative transmission system in which a transmitter (Alice) intends to send a secret message to an authorized receiver (Bob), with the aid of a friendly private cooperative jammer (Oscar), in the presence of a malicious eavesdropper (Eve). Specifically, artificial noise (AN) assisted secrecy beamforming is utilized for secure transmission. Under the imperfect channel state information (CSI) of legitimate channels and the statistic CSI of illegitimate channels, the optimal power allocation ratio between the information-bearing signal and the AN signal for maximizing secrecy rate is derived. Through mathematical analysis, we notice that the high channel estimation error is greatly detrimental to the realization of the positive secrecy rate in secure system. For overcoming this drawback, back propagation neural network (BPNN) is employed for a high accuracy channel estimation to simulate a realistic security communication scenario. The numerical results show that the channel estimation errors result in a decrease in secrecy rate, but the BPNN channel estimator still can guarantee secure transmission that verifies the feasibility of the application of physical layer security. Analytical derivations and numerical simulations are presented to validate the correctness of obtained expressions and our analysis. [ABSTRACT FROM AUTHOR]

This paper proposes and implements a switched-capacitorless energy-encrypted transmitter and a 2-D frequency and duration encryption (FDE) technology for roadway-charging electric vehicles based on wireless power transfer (WPT). To prevent the encrypted energy package from being illegally decrypted by unauthorized receivers, the proposed 2-D chaotic FDE scheme generates a well-defended security key to improve the security performance for the multi-receiver WPT system. Moreover, by introducing a continuously energy-encrypted transmitter without using a switched-capacitor array as well as a hybrid modulation of pulse density modulation and pulse frequency modulation, the proposed FDE-WPT system can offer high energy security while maintaining high efficiency at flexible operating frequencies. Theoretical analysis, computer simulation, and experimental results are provided to verify the feasibility of the proposed FDE-WPT system. [ABSTRACT FROM AUTHOR]

In this paper, a multiple-input multiple-output wiretap channel model is studied, where the information packet sent from the transmitter to the desired receiver is wiretapped by a potential eavesdropper. When ideal channel state information (CSI) is available, we design the secure beamforming using a proposed iterative closed-form updating scheme based on majorization–minimization approach. Numerical results demonstrate that the proposed scheme acquires the same secrecy rate as the existing algorithms whereas it has much lower complexity. When ideal CSI is not available and channel errors are modeled by deterministically bounded model, we investigate robust secure beamforming (RSB) optimization problem whose goal is worst-case secrecy rate maximization. In the formulated optimization problem, the objective function includes the expression of a logarithm of a determinant ($\log \det$) minus $\log \det$. Instead of approximating the $\log \det$ expression as a trace, we propose to linearize two $\log \det$ terms. After linearization, epigraph reformulation is used to deal with deterministically bounded channel errors and semi-infinite constraints are recast as linear matrix inequalities. Finally, an alternating optimization algorithm is utilized to find the RSB design. After obtaining the RSB design, we derive the worst-case secrecy rate. Numerical results illustrate that the proposed RSB design is superior to the nonrobust one. [ABSTRACT FROM AUTHOR]

In this paper, the $\eta $ -Nash equilibrium ( $\eta $ -NE) region of the two-user Gaussian interference channel (IC) with perfect output feedback is approximated to within 1 bit/s/Hz and $\eta $ arbitrarily close to 1 bit/s/Hz. The relevance of the $\eta $ -NE region is that it provides the set of rate pairs that are achievable and stable in the IC when both transmitter–receiver pairs autonomously tune their own transmit–receive configurations seeking an $\eta $ -optimal individual transmission rate. Therefore, any rate tuple outside the $\eta $ -NE region is not stable as there always exists one link able to increase by at least $\eta $ bits/s/Hz its own transmission rate by updating its own transmit–receive configuration. The main insights that arise from this paper are as follows. First, the $\eta $ -NE region achieved with feedback is larger than or equal to the $\eta $ -NE region without feedback. More importantly, for each rate pair achievable at an $\eta $ -NE without feedback, there exists at least one rate pair achievable at an $\eta $ -NE with feedback that is weakly Pareto superior. Second, there always exists an $\eta $ -NE transmit–receive configuration that achieves a rate pair that is at most 1 bit/s/Hz per user away from the outer bound of the capacity region. [ABSTRACT FROM PUBLISHER]

Motivated by the recent emergence of energy harvesting and wirelessly powered transceivers, we study communication over a memoryless channel with a transmitter, whose battery is recharged at random or deterministic times known to the receiver. We characterize the capacity of this channel as the limit of an $n$ -letter maximum mutual information rate under various assumptions: causal and noncausal transmitter knowledge of the battery recharges, with or without feedback from the receiver to the transmitter. While the resultant $n$ -letter capacity expressions are not computable in the general case, we demonstrate their usefulness by focusing on two important special cases, namely, the binary erasure channel (BEC) and the additive white Gaussian noise (AWGN) channel, where they lead to some interesting, and somewhat surprising, insights. By focusing on the BEC, we show that output feedback can strictly increase the capacity of this channel, even though the channel is memoryless and the battery recharging process is independent over time. Interestingly, this provides a counter example to an old claim by Shannon stated without proof in his 1956 paper. On the other hand, by focusing on the AWGN channel, we are able to show that the capacity with noncausal knowledge of the battery recharging times at the transmitter is strictly larger than that with causal knowledge, even though the battery recharging process is independent over time and known to the receiver. The $n$ -letter expressions can also be used to derive explicit upper and lower bounds on capacity. In particular, we derive simple upper and lower bounds on the capacity of the AWGN channel with random battery recharges, which are within 1.05 b/s/Hz of each other for all parameter values. [ABSTRACT FROM PUBLISHER]

Jamming attacks can significantly impact the performance of wireless communication systems. In addition to reducing the capacity, such attacks may lead to insurmountable overhead in terms of retransmissions and increased power consumption. In this paper, we consider the multiple-input single-output (MISO) broadcast channel (BC) in the presence of a jamming attack in which a subset of the receivers can be jammed at any given time. Further, countermeasures for mitigating the effects of such jamming attacks are presented. The effectiveness of these antijamming countermeasures is quantified in terms of the degrees-of-freedom (DoF) of the MISO BC under various assumptions regarding the availability of the channel state information (CSIT) and the jammer state information at the transmitter (JSIT). The main contribution of this paper is the characterization of the DoF region of the two user MISO BC under various assumptions on the availability of CSIT and JSIT. Partial extensions to the multiuser broadcast channels are also presented. [ABSTRACT FROM PUBLISHER]

Consider the single-group multicast beamforming problem, where multiple users receive the same data stream simultaneously from a single transmitter. The problem is NP-hard and all existing algorithms for the problem either find suboptimal approximate or local stationary solutions. In this paper, we propose an efficient branch-and-bound algorithm for the problem that is guaranteed to find its global solution. To the best of our knowledge, our proposed algorithm is the first tailored global algorithm for the single-group multicast beamforming problem. Simulation results show that our proposed algorithm is computationally efficient (albeit its theoretical worst-case iteration complexity is exponential with respect to the number of receivers) and it significantly outperforms a state-of-the-art general-purpose global optimization solver called Baron. Our proposed algorithm provides an important benchmark for performance evaluation of existing algorithms for the same problem. By using it as the benchmark, we show that two state-of-the-art algorithms, semidefinite relaxation algorithm and successive linear approximation algorithm, work well when the problem dimension (i.e., the number of antennas at the transmitter and the number of receivers) is small but their performance deteriorates quickly as the problem dimension increases. [ABSTRACT FROM PUBLISHER]

In this paper, a cooperative wireless system with unreliable wireless backhaul connections is investigated. To increase the throughput and maximize the receiver signal-to-noise ratio (SNR), a selection combining (SC) protocol is employed. Cooperative transmitters are connected to the control unit (CU) via independent but unreliable wireless backhaul connections. Simultaneously taking into account the reliability of each backhaul and different fading conditions of Nakagami-$m$ fading channels, the statistical properties of the effective SNR (e-SNR) at the receiver are investigated. Closed-form expressions are derived for several performance metrics, including the outage probability, average spectral efficiency (ASE), and average symbol error rate (ASER). The effects of backhaul reliability on these performance metrics are also investigated. The scaling relationship between the convergence behavior of these performance metrics and the conventional diversity gain is also analytically investigated in the asymptotic high-SNR regime. Monte Carlo simulations are conducted to verify the derived impact of backhaul reliability on the performance. [ABSTRACT FROM PUBLISHER]

Information and energy can be transferred over the same radio-frequency channel. In the power-splitting (PS) mode, they are simultaneously transmitted using the same signal by the base station (BS) and later separated at the user (UE)’s receiver by a power splitter. In the time-switching (TS) mode, they are either transmitted separately in time by the BS or received separately in time by the UE. In this paper, the BS transmit beamformers are jointly designed with either the receive PS ratios or the transmit TS ratios in a multicell network that implements wireless information and power transfer (WIPT). Imposing UE-harvested energy constraints, the design objectives include: 1) maximizing the minimum UE rate under the BS transmit power constraint, and 2) minimizing the maximum BS transmit power under the UE data rate constraint. New iterative algorithms of low computational complexity are proposed to efficiently solve the formulated difficult nonconvex optimization problems, where each iteration either solves one simple convex quadratic program or one simple second-order-cone-program. Simulation results show that these algorithms converge quickly after only a few iterations. Notably, the transmit TS-based WIPT system is not only more easily implemented but outperforms the receive PS-based WIPT system as it better exploits the beamforming design at the transmitter side. [ABSTRACT FROM PUBLISHER]

This paper tackles the hardware complexity of a digital predistortion (DPD) system used to linearize a power amplifier (PA) driven with interband carrier aggregated (CA) signals (i.e., two component carriers with different modulation bandwidths and wide frequency separations). It focuses particularly on reducing the required bandwidth, and number of channels, of the transmitter’s observation receiver (TOR) as well as the specifications of the underlying building blocks (e.g., speed of the analog-to-digital converter). A novel dual-band DPD system using a single TOR was devised. The training of the DPD for each band was carried out in an alternating fashion, using a single training engine following a model-reference adaptive control approach with a recursive least squares algorithm. The proposed approach was experimentally validated by successfully linearizing a 20-W Class F Doherty PA driven with different multistandard CA signals. [ABSTRACT FROM PUBLISHER]

This paper studies the impact of a multiple-input–multiple-output (MIMO) relay on the $K$- user multiple-input–single-output (MISO) interference channel (IC) when the relay has delayed feedback (i.e., delayed channel state information (CSI) or delayed channel output feedback) from each receiver, yet each transmitter has no knowledge about CSI. We first develop a new relay-aided retrospective interference alignment (r-RIA) and characterize the optimal sum degrees of freedom (DoFs) for the $K$- user MISO IC with a MIMO relay by providing a new matching outer bound. It is shown that the sum DoF does not decrease, even in the absence of direct links between transmitters and receivers, as long as $K$ is sufficiently large. We next show that a MIMO relay can provide a sum-DoF gain in the $K$- user MISO IC with delayed feedback to the relay in the absence of CSI at transmitter (CSIT), whereas relaying is shown to be not useful with instantaneous CSIT from the DoF perspective. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a generalized code index modulation (CIM) technique for direct-sequence spread spectrum (DSSS) communication. In particular, at the transmitter, the bit stream is divided into blocks in which each block is divided into two subblocks: mapped and modulated subblocks. Thereafter, the bits within the mapped subblock are used to select one of the predefined spreading codes, which is then used to spread the modulated bits of the second subblock. In this design, using the spreading code index as an information-bearing unit increases the overall spectral efficiency of this system. At the receiver side, the spreading code index is first estimated, thus resulting in a direct estimation of mapped subblock bits. Consequently, the corresponding spreading code to this estimated index is used to despread the modulated symbol of the modulated subblock. Subsequently, mathematical expressions for bit error rate (BER), symbol error rate (SER), throughput, energy efficiency, and the system complexity are derived to analyze the system performance. Finally, simulation results show that the proposed modulation scheme can achieve a higher data rate than the conventional DSSS system, with lower energy consumption and complexity. [ABSTRACT FROM PUBLISHER]

This paper discusses the energy- and spectral-efficient transmissions for delay-constrained wireless communication systems utilizing hybrid automatic repeat request (HARQ). Three design metrics are considered: 1) the energy efficiency (EE) measured by the average energy required to successfully deliver one information bit from a source to its destination; 2) the spectral efficiency (SE) defined as the average data rate per unit bandwidth; and 3) the average energy per bit normalized by the SE. Optimum system designs with respect to different metrics are developed by analytically identifying the sequence of transmission energy that should be employed at different retransmissions. The optimum energy distributions are calculated with a new backward sequential calculation method, where the energy at each retransmission round is expressed as a closed-form expression of a wide range of practical system parameters, such as circuit power and channel coding in the physical layer and frame length and protocol overhead in the media access control layer. Reducing the SE-normalized energy per bit yields a balanced tradeoff between EE and SE. Numerical results demonstrate that reducing the SE-normalized energy per bit achieves a 26.7% SE gain over the system that minimizes the average energy per bit; yet, the EE of the two systems is almost identical. [ABSTRACT FROM AUTHOR]

This paper proposes a wireless power transfer (WPT) transmitter that can concurrently operate at 200 kHz and 6.78 MHz in order to simultaneously power two receivers operating with different frequency standards. Unlike a dual-resonant single-coil design, the use of two separate coils decouples the design for one frequency from the other, enabling independent selection of inductance and Q-factor to simultaneously maximize efficiency at both frequencies. The two coils then support separate coil drivers, enabling concurrent multistandard operation. Dual-band operation is achieved in the same area as an equivalent single-band design by placing a low-frequency coil within the geometry of a high-frequency coil, where the outer diameter of inner coil is sacrificed only by 1.2 cm in a 12.5 × 8.9-cm2 design. Circuit analysis is presented to identify the eddy current between the two Tx coils and its associated loss, after which an eddy-current filter design is proposed. To validate the proposed design, a dual-mode transmitter, along with two receivers designed at 6.78 MHz and 200 kHz, respectively, have been fabricated. At 25-mm separation, the system is able to simultaneously deliver 9 and 7.4 W with efficiencies of 78% and 70.6% at 6.78 MHz and 200 kHz, respectively. [ABSTRACT FROM AUTHOR]

This paper presents the basic control principles of omnidirectional wireless power transfer (WPT) based on the current amplitude control. The principles involve 1) an “omnidirectional” scanning process for detecting the power requirements in a 3-D space and 2) a “directional” power flow control for focusing the wireless power toward the targeted areas. Such principles apply to any WPT system comprising three orthogonal transmitter coils and multiple receivers with coil resonators. A current amplitude control method capable of generating a magnetic vector at a set of points evenly distributed on a spherical surface is explained. Based on the voltage and the current information in the transmitter circuit, the power involved in each vector over the spherical surface can be obtained. By scanning the vector over the spherical surface, the collective power flow requirements for the targeted loads can be determined. Based on the power requirements for the vectors over the spherical surface, a weighted time-sharing scheme is adopted to focus the wireless power toward the targeted areas. This method has been successfully applied to a hardware prototype. Both theoretical and experimental results are included to confirm these principles. [ABSTRACT FROM AUTHOR]

In this paper, we consider a spatial modulation (SM)-based multiple-input–single-output (MISO) system relying on a single radio-frequency chain equipped with a finite-rate feedback channel to provide quantized channel state information (CSI) to the transmitter. First, under the assumption of Rayleigh flat-fading channels and perfect CSI at the transmitter (CSIT), we analyze the symbol error probability (SEP) of an SM scheme, which perfectly compensates the channel phase and employs constellation rotation at the different transmit antennas (TAs). Then, we consider a more practical scenario, where scalar quantization of the channel phase angles is employed, and the quantized CSI is made available to the transmitter via a finite-rate feedback channel. We analyze the SEP reduction, i.e., Pe_L, relative to perfect CSIT, imposed by the quantized CSIT (Q-CSIT). We show that at a high feedback rate, Pe_L varies as C^\prime\mbox2^-2B, where each channel phase angle is quantized to B bits, and C^{\prime} is a constant. Furthermore, based on the rotational symmetry of the M-ary phase-shift keying ( M-PSK) signal constellation, we propose a novel feedback scheme, which requires (n_t-\mbox{1})\log_2(M) fewer bits of feedback with any performance erosion, where n_t$ is the number of TAs. We characterize the performance of the SM-MISO system with finite-rate feedback and validate our analysis through Monte Carlo simulations. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a codeword refinement technique called double codeword coding in the context of MIMO feedback. In the proposed method, the second codeword is fed back in addition to the best codeword as their interpolation at the transmitter improves the channel knowledge. The derivation of the optimal interpolation parameter is presented together with the derivation of an upper-bound to the interpolation parameter based on channel quality feedback available at the transmitter. We show that double codeword feedback refinement has slightly lower complexity than alternative techniques and still achieves similar performance. Furthermore, double codeword coding can be generalized to higher transmission ranks. Using extended multiuser MIMO link simulations, we verify that the double codeword feedback is able to provide significant gains in 3GPP LTE context. [ABSTRACT FROM AUTHOR]

This paper investigates the capacity region of the three-receiver AWGN broadcast channel where the receivers: 1) have private-message requests and 2) may know some of the messages requested by other receivers as side information. We first classify all 64 possible side information configurations into eight groups, each consisting of eight members. We next construct transmission schemes, and derive new inner and outer bounds for the groups. This establishes the capacity region for 52 out of 64 possible side information configurations. For six groups (i.e., groups 1, 2, 3, 5, 6, and 8 in our terminology), we establish the capacity region for all their members, and show that it tightens both the best-known inner and outer bounds. For group 4, our inner and outer bounds tighten the best-known inner bound and/or outer bound for all the group members. Moreover, our bounds coincide at certain regions, which can be characterized by two thresholds. For group 7, our inner and outer bounds coincide for four members, and thereby establishing the capacity region. For the remaining four members, our bounds tighten both the best-known inner and outer bounds. [ABSTRACT FROM PUBLISHER]

Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSITs) is assumed, and the transmit power and data-rate can be jointly chosen for every fading vector realization. On the other hand, in fast-fading links with distributed CSIT, the lack of full CSI is compensated by performing ergodic averaging over sufficiently many channel realizations. Notice that the distributed CSI may necessitate decentralized power-control for optimal data-transfer. Apart from these two models, the case of slow-fading links and distributed CSIT, though relevant to many systems, has received much less attention. In this paper, a block-fading additive white Gaussian noise MAC with full CSI at the receiver and distributed CSI at the transmitters is considered. The links undergo independent fading, but otherwise have arbitrary fading distributions. The channel statistics and respective long-term average transmit powers are known to all parties. We first consider the case where each encoder has knowledge only of its own link quality, and not of others. For this model, we compute the adaptive capacity region, i.e., the collection of average rate-tuples under blockwise coding/decoding such that the rate-tuple for every fading realization is inside the instantaneous MAC capacity region. The key step in our solution is an optimal rate allocation function for any given set of distributed power control laws at the transmitters. This also allows us to structurally characterize the optimal power control for a wide class of fading models. Further extensions are also proposed for the case where each encoder has additional partial CSI about the other links. [ABSTRACT FROM PUBLISHER]

It is sometimes unavoidable to use loosely coupled coils in applications, like biomedical devices, for transferring electric energy wirelessly. However, coil misalignment causes degradation of the power transfer efficiency. It is well known that the power transfer efficiency of classical parallel coils is primarily determined by the quality factors of the coils and the coupling coefficient between the coils, and is maximized by choosing an optimal turns-ratio between the coils. Changing the number of turns of the coils cannot effectively overcome such misalignment effect. This paper presents a structure that comprises two orthogonally placed windings for lessening the variation of the coupling coefficient due to the coil misalignment. An output current summing technique that keeps the windings concurrently energized and combines the output currents of the windings will be studied. A canonical model will also be derived to describe the interactions between the coils. An experimental prototype has been built and evaluated on a test bed, which allows different degrees of lateral and angular misalignments. Results reveal that the proposed structure can effectively increase the minimum efficiency zone, allowing more lateral and angular misalignments. These investigations lay the foundation for future understanding more complex loosely coupled winding structures. [ABSTRACT FROM AUTHOR]

This paper describes a technique for multifrequency wireless power transfer systems in which the wireless power can be transmitted through the wireless power transfer channel or channels from the transmitter to the targeted loads with receiver coils specifically tuned for energy reception. Auxiliary circuits comprising bandpass and/or bandstop circuits are proposed for incorporation into the receiver circuits and optional relay circuits so as to facilitate the selection and enhancement of the wireless power transfer to the designated load without causing significant cross interference due to the use of multifrequency wireless power flow control. A unique feature of this technique is that the nontargeted receiver will automatically act as a relay resonator to enhance 1) magnetic coupling, and thus, 2) the power transfer between the power transmitter and the targeted receiver. A second novel feature is that the chosen operating frequencies for the tuned receivers need not be widely apart because the auxiliary circuits consist of bandpass and/or bandstop filters to reduce any cross interference from the nontargeted frequency. The proposed technique has been practically verified in experimental prototype. [ABSTRACT FROM AUTHOR]

In this paper, we formulate and solve a weighted-sum transmitter and receiver energy minimization (WSTREMin) problem in the downlink of an orthogonal frequency division multiplexing (OFDM) based multiuser wireless system. The proposed approach offers the flexibility of assigning different levels of importance to base station (BS) and mobile terminal (MT) power consumption, with the BS being connected to the grid and the MT relying on batteries. To obtain insights into the problem, we first consider two extreme cases separately, i.e., weighted-sum receiver-side energy minimization (WSREMin) for MTs and transmitter-side energy minimization (TEMin) for the BS. It is shown that Dynamic TDMA (D-TDMA), where MTs are scheduled for single-user OFDM transmissions over orthogonal time slots, is the optimal transmission strategy for WSREMin at MTs, while OFDMA is optimal for TEMin at the BS. As a hybrid of the two extreme cases, we further propose a new multiple access scheme, i.e., Time-Slotted OFDMA (TS-OFDMA) scheme, in which MTs are grouped into orthogonal time slots with OFDMA applied to users assigned within the same slot. TS-OFDMA can be shown to include both D-TDMA and OFDMA as special cases. Numerical results confirm that the proposed schemes enable a flexible range of energy consumption tradeoffs between the BS and MTs. [ABSTRACT FROM AUTHOR]

We consider a point-to-point multiple-input-single-output (MISO) system where a receiver harvests energy from a transmitter. To achieve high-efficiency wireless power transfer (WPT), the transmitter performs energy beamforming by using an instantaneous channel state information (CSI). The CSI is estimated at the receiver by training via a preamble and fed back to the transmitter. In this paper, we address the key challenge of balancing the time resource used for channel estimation and WPT to maximize the harvested energy and also investigate the allocation of energy resource used for WPT. First, we consider the general scenario where the preamble length is allowed to vary dynamically depending on channel conditions. The optimal preamble length is obtained online by solving a dynamic programming (DP) problem. The DP problem is proved to reduce to an optimal stopping problem. The optimal policy is then shown to depend only on the channel estimate power. Next, we consider the scenario in which the preamble length is fixed by an offline optimization. Furthermore, we derive the optimal power allocation schemes. For the dynamic-length-preamble scenario, the power is allocated according to both the optimal preamble length and the channel estimate power, while for the fixed-length-preamble scenario, the power is allocated according to only the channel estimate power. By numerical simulations, our results show that with optimal power allocation, the energy harvested by using the optimized fixed-length preamble is close to that harvested by using a dynamic-length preamble, hence allowing a low-complexity yet close-to-optimal WPT system to be implemented in practice. [ABSTRACT FROM AUTHOR]

Interference alignment has emerged as a powerful tool in the analysis of multiuser networks. Despite considerable recent progress, the capacity region of the Gaussian $K$ -user interference channel is still unknown in general, in part due to the challenges associated with alignment on the signal scale using lattice codes. This paper develops a new framework for lattice interference alignment, based on the compute-and-forward approach. Within this framework, each receiver decodes by first recovering two or more linear combinations of the transmitted codewords with integer-valued coefficients and then solving these linear combinations for its desired codeword. For the special case of symmetric channel gains, this framework is used to derive the approximate sum capacity of the Gaussian interference channel, up to an explicitly defined outage set of the channel gains. The key contributions are the capacity lower bounds for the weak through strong interference regimes, where each receiver should jointly decode its own codeword along with part of the interfering codewords. As part of the analysis, it is shown that decoding K$ linear combinations of the codewords can approach the sum capacity of the K$ -user Gaussian multiple-access channel up to a gap of no more than bits. [ABSTRACT FROM PUBLISHER]

This paper presents a short-term analysis of the radio propagation channels within vegetation media at the most commonly used wireless network frequency bands: 2.4, 3.5, and 5.8 GHz. Fading effects underlying this short-term analysis would determine whether the radio channel could support a stable link or not. The configuration used in this study is a peer-to-peer system, where the transmitter and the receiver are located at low heights inside several vegetation media, including forests and meadows. The distribution function that best fits the received power was determined to be Weibull, and the evolution of its parameters was studied as the distance between transmitter and receiver increases. [ABSTRACT FROM PUBLISHER]

This paper studies a multi-antenna wiretap channel with a passive eavesdropper and an external helper, where only quantized channel information regarding the legitimate receiver is available at the transmitter and helper due to finite-rate feedback. Given a fixed total bandwidth for the two feedback channels, the receiver must determine how to allocate its feedback bits to the transmitter and helper. Assuming zero-forcing transmission at the helper and random vector quantization of the channels, an analytic expression for the achievable ergodic secrecy rate due to the resulting quantization errors is derived. While direct optimization of the secrecy rate is difficult, an approximate upper bound for the mean loss in secrecy rate is derived and a feedback bit allocation method that minimizes the average upper bound on the secrecy rate loss is studied. A closed-form solution is shown to be possible if the integer constraint on the bit allocation is relaxed. Numerical simulations indicate the significant advantage that can be achieved by adaptively allocating the available feedback bits. [ABSTRACT FROM PUBLISHER]

In this paper, we analyze a multiple-input multiple-output (MIMO) interference channel where nodes are randomly distributed on a plane as a spatial Poisson cluster point process. A Poisson cluster point process consists of clusters with fixed number of points randomly distributed as with the cluster centers distributed randomly on the plane. The nodes in each cluster use interference alignment (IA) to suppress intra-cluster interference but unlike most work on IA, we do not neglect inter-cluster interference. We also connect the accuracy of channel state information to the distance between the nodes, i.e., the quality of CSI degrades with increasing distance. Accounting for the training and feedback overhead, we derive the transmission capacity of this MIMO IA ad hoc network and then compare it to open-loop (interference-blind) spatial multiplexing. Finally, we present exemplary system setups where spatial multiplexing outperforms IA due to the imperfect channel state information or the non-aligned inter-cluster interference. [ABSTRACT FROM PUBLISHER]

Wireless power transfer via magnetically resonant coupling is a new technology to deliver power over a relatively long distance. Here, we present a mat-based design to wirelessly power moving targets based on this technology. Our design is specifically applied to transcutaneously power medical implants within free-moving laboratory animals. Our system comprises a driver coil array, a hexagonally packed transmitter mat, a receiver coil, and a load coil, and generates a nearly flat magnetic distribution over a defined area to produce an approximately constant power output independent of the location of the receiver coil. This paper also describes a novel power receiver coil design of the same shape as the exterior of the implant, allowing for maximum magnetic coupling, eliminating the space restrictions due to the coil within the implant, and matching the resonant frequencies of the implant and the transmitter coil. Our new transmitter and receiver designs significantly reduce the size of a biomedical implant and may provide a lifetime power supply to implanted circuits without the need for an internal battery. Our designs are also useful in various other applications involving moving targets, such as part of a robot or a vehicle. [ABSTRACT FROM PUBLISHER]

The migration to wireless network from wired network has been a global trend in the past few decades. The mobility and scalability brought by wireless network made it possible in many applications. Among all the contemporary wireless networks, Mobile Ad hoc NETwork (MANET) is one of the most important and unique applications. On the contrary to traditional network architecture, MANET does not require a fixed network infrastructure; every single node works as both a transmitter and a receiver. Nodes communicate directly with each other when they are both within the same communication range. Otherwise, they rely on their neighbors to relay messages. The self-configuring ability of nodes in MANET made it popular among critical mission applications like military use or emergency recovery. However, the open medium and wide distribution of nodes make MANET vulnerable to malicious attackers. In this case, it is crucial to develop efficient intrusion-detection mechanisms to protect MANET from attacks. With the improvements of the technology and cut in hardware costs, we are witnessing a current trend of expanding MANETs into industrial applications. To adjust to such trend, we strongly believe that it is vital to address its potential security issues. In this paper, we propose and implement a new intrusion-detection system named Enhanced Adaptive ACKnowledgment (EAACK) specially designed for MANETs. Compared to contemporary approaches, EAACK demonstrates higher malicious-behavior-detection rates in certain circumstances while does not greatly affect the network performances. [ABSTRACT FROM PUBLISHER]

The interference alignment (IA) is a promising technique to efficiently mitigate interference and to enhance capacity of a wireless communication network. This paper proposes an interference alignment scheme for a network with multiple cells and multiple multiple-input and multiple-output (MIMO) users under a Gaussian interference broadcast channel (IFBC) scenario. We first extend a grouping method already known in the literature to a multiple-cells scenario and jointly design transmit and receiver beamforming vectors using a closed-form expression without iterative computation. Then we propose a new approach using the principle of multiple access channel (MAC) - broadcast channel (BC) duality to perform interference alignment while maximizing capacity of users in each cell. The algorithm in its dual form is solved using interior point methods. We show that the proposed approach outperforms the extension of the grouping method in terms of capacity and basestation complexity. Finally, a rate balancing technique is introduced to maintain fairness among users. [ABSTRACT FROM PUBLISHER]

Interference alignment (IA) is a joint-transmission technique for the interference channel that achieves the maximum degrees-of-freedom and provides linear scaling of the capacity with the number of users for high signal-to-noise ratios (SNRs). Most prior work on IA is based on the impractical assumption that perfect and global channel-state information (CSI) is available at all transmitters. However, to implement IA, each receiver has to feed back CSI to all interferers, resulting in overwhelming feedback overhead. In particular, the sum feedback rate of each receiver scales quadratically with the number of users even if the feedback CSI is quantized. To substantially suppress feedback overhead, this paper focuses on designing efficient arrangements of feedback links, called feedback topologies, under the IA constraint. For the multiple-input multiple-output (MIMO) K-user interference channel, we propose the feedback topology that supports sequential CSI exchange (feedback and feedforward) between transmitters and receivers so as to achieve IA progressively. This feedback topology is shown to reduce the network feedback overhead from a quadratic function of K to a linear one. To reduce the delay in the sequential CSI exchange, an alternative feedback topology is designed for supporting two-hop feedback via a control station, which also achieves the linear feedback scaling with K. Next, given the proposed feedback topologies, the feedback-bit allocation algorithm is designed for allocating feedback bits by each receiver to different feedback links so as to regulate the residual interference caused by finite-rate feedback. Simulation results demonstrate that the proposed bit allocation leads to significant throughput gains especially in strong interference environments. [ABSTRACT FROM PUBLISHER]

For cooperative amplify-and-forward (AF) relaying in spectrum-sharing wireless systems, secondary users share spectrum resources originally licensed to primary users to communicate with each other and, thus, the transmit power of secondary transmitters is strictly limited by the tolerable interference powers at primary receivers. Furthermore, the received signals at a relay and at a secondary receiver are inevitably interfered by the signals from primary transmitters. These co-channel interferences (CCIs) from concurrent primary transmission can significantly degrade the performance of secondary transmission. This paper studies the effect of CCIs on outage probability of the secondary link in a spectrum-sharing environment. In particular, in order to compensate the performance loss due to CCIs, the transmit powers of a secondary transmitter and its relaying node are respectively optimized with respect to both the tolerable interference powers at the primary receivers and the CCIs from the primary transmitters. Moreover, when multiple relays are available, the technique of opportunistic relay selection is exploited to further improve system performance with low implementation complexity. By analyzing lower and upper bounds on the outage probability of the secondary system, this study reveals that it is the tolerable interference powers at primary receivers that dominate the system performance, rather than the CCIs from primary transmitters. System designers will benefit from this result in planning and designing next-generation broadband spectrum-sharing systems. [ABSTRACT FROM AUTHOR]