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]

The “carbon copy onto dirty paper” (CCDP) channel is the compound “writing on dirty paper” channel in which the channel output is obtained as the sum of the channel input, white Gaussian noise and a Gaussian state sequence randomly selected among a set possible realizations. The transmitter has non-causal knowledge of the set of possible state sequences but does not know which sequence is selected to produce the channel output. We study the capacity of the CCDP channel for two scenarios: 1) the state sequences are independent and identically distributed; and 2) the state sequences are scaled versions of the same sequence. In the first scenario, we show that a combination of superposition coding, time-sharing, and Gel’fand-Pinsker binning is sufficient to approach the capacity to within 3 bits per channel use for any number of possible state realizations. In the second scenario, we derive capacity to within 4 bits per channel use for the case of two possible state sequences. This result is extended to the CCDP channel with any number of possible state sequences under certain conditions on the scaling parameters, which we denote as “strong fading” regime. We conclude by providing some remarks on the capacity of the CCDP channel in which the state sequences have any jointly Gaussian distribution. [ABSTRACT FROM AUTHOR]

We derive the capacity region of the two-user dirty-paper Gaussian multiaccess channel (MAC) with conferencing encoders. In this MAC, prior to each transmission block, the transmitters can hold a conference in which they can communicate with each other over error-free bit pipes of given capacities. The received signal suffers not only from additive Gaussian noise but also from additive interference, which is known noncausally to the transmitters but not to the receiver. The additive interference is modeled as Gaussian or uniform over a sphere. We show that the interference can be perfectly mitigated, i.e., that the capacity region without interference can also be achieved in its presence. This holds irrespective of whether the transmitters learn the interference before or after the conference. It follows as a corollary that also for the MAC with degraded message sets, the interference can be perfectly mitigated if it is known noncausally to the transmitters. To derive our results, we generalize Costa's single-user writing-on-dirty-paper achievability result to channels with dependent interference and not-necessarily Gaussian noise. [ABSTRACT FROM AUTHOR]

A wideband Rayleigh fading channel is considered with causal channel state information (CSI) at the transmitter and no receiver CSI. A simple orthogonal code with energy detection rule at the receiver (similar to pulse position modulation in IEEE Trans. Inf. Theory, vol. 46, no. 4, Apr. 2000 and IEEE Trans. Inf. Theory, vol. 52 no. 5, May 2006) is shown to achieve the capacity of this channel in the wideband limit. This strategy transmits energy only when the channel gain exceeds a threshold, hence only needs causal transmitter CSI. In the wideband limit, this capacity without any receiver CSI is the same as the capacity with full receiver CSI, which is proportional to the logarithm of the bandwidth. Similar threshold-based pulse position modulation is shown to achieve the capacity per unit cost of the dirty-tape channel (dirty paper channel with causal transmitter CSI and no receiver CSI), which equals its capacity per unit cost with full receiver CSI. Then, a general discrete channel with i.i.d. states is considered. Each input has an associated cost and a zero cost input “0” exists. The channel state is assumed to be known at the transmitter in a causal manner. Capacity per unit cost is found for this channel and a simple orthogonal code is shown to achieve this capacity. Later, a novel orthogonal coding scheme is proposed for the case of causal transmitter CSI and a condition for equivalence of capacity per unit cost for causal and noncausal transmitter CSI is derived. [ABSTRACT FROM PUBLISHER]

A dirty-paper channel is considered, where the transmitter knows the interference sequence up to a constant multiplicative factor, known only to the receiver. Lower bounds on the achievable rate of communication are derived by proposing a coding scheme that partially compensates for the imprecise channel knowledge. We focus on a communication scenario where the signal-to-noise ratio is high. Our approach is based on analyzing the performance achievable using lattice-based coding schemes. When the power of the interference is finite, we show that the achievable rate of this lattice-based coding scheme may be improved by a judicious choice of the scaling parameter at the receiver. We further show that the communication rate may be improved, for finite as well as infinite interference power, by allowing randomized scaling at the transmitter. [ABSTRACT FROM AUTHOR]

The article offers information on the 2015 IEEE Communications Society and Information Theory Society Joint Paper Awards given to Mohammad Ali Maddah-Ali and David Tse for the paper "Completely Stale Transmitter Channel State Information is Still Very Useful."

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]

The maximum efficiency point of an inductive power link depends on its load power consumption and the distance between the transmitter and the receiver. Matching networks (MNs) and adjustable ac–dc converters have been proposed in the literature as a means to achieve and track this maximum efficiency point. Most of the published papers in inductive power transmission only use one of these two methods without considering a joint design. In this paper, we analyze and compare both methods proposing a general joint design which exploits the advantages of each method. A proof-of-concept system was developed following the proposed flow, built and tested. This system, with a regulated output voltage, presents improvements in measured efficiencies of up to 80% (from 9.2% to 16%) at the largest distances, thus maximizing the distance range. The same approach can be used to maximize output dc voltage, instead of the link efficiency. The proposed system using our designed MN achieved a maximum output voltage that was 90% higher (from 1.36 to 2.59 V) than the case where only a step-up converter was used. [ABSTRACT FROM AUTHOR]

This paper investigates the Gaussian state-dependent interference channel (IC) and Z-IC, in which two receivers are corrupted respectively by two different but correlated states that are noncausally known to two transmitters but are unknown to the receivers. Three interference regimes are studied, and the capacity region boundary or the sum capacity boundary is characterized either fully or partially under various channel parameters. In particular, the impact of the correlation between states on cancellation of state and interference as well as achievability of capacity is explored with numerical illustrations. For the very strong interference regime, the capacity region is achieved by the scheme where the two transmitters implement a cooperative dirty paper coding. For the strong but not very strong interference regime, the sum-rate capacity is characterized by rate splitting, layered dirty paper coding, and successive cancellation. For the weak interference regime, the sum-rate capacity is achieved via dirty paper coding individually at two receivers as well as treating interference as noise. This paper also provides the achievable region for the state-dependent IC with each state known at its corresponding transmitter. [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 state-dependent Gaussian interference channel (IC) and Z-IC are investigated, in which two receivers are corrupted by the same but differently scaled states. The state sequence is noncausally known at both transmitters, but not known at either receiver. Three interference regimes are studied, i.e., the very strong, strong, and weak regimes. In the very strong regime, the capacity region is characterized under certain channel parameters by designing a cooperative dirty paper coding between the two transmitters to fully cancel the state. In the strong regime, points on the capacity region boundary are characterized under certain channel parameters by designing an achievable scheme based on rate splitting, layered dirty paper coding, and successive state cancellation. In the weak regime, the sum capacity is obtained by independent dirty paper coding at two transmitters. For all the above regimes, the capacity achieves that of the IC/Z-IC without state. Comparison between the state-dependent regular IC and the Z-IC suggests that even with one interference-free link, the Z-IC does not necessarily perform better, because dirty paper coded interference in the regular IC facilitates to cancel the state through the cooperative dirty paper coding between the transmitters. [ABSTRACT FROM AUTHOR]

We investigate the state-dependent Gaussian wiretap channel with noncausal channel state information at the transmitter (GWTC-N-CSIT), and explore whether three strategies (i.e., taking action on the state, legitimate receiver’s channel output feedback, and combining the former two strategies together) help to enhance the secrecy capacity of the GWTC-N-CSIT. To be specific, we first determine the secrecy capacity of the GWTC-N-CSIT with noiseless feedback. Next, we derive lower and upper bounds on the secrecy capacity of the GWTC-N-CSIT with action-dependent state. Finally, we derive lower and upper bounds on the secrecy capacity of the GWTC-N-CSIT with both action-dependent state and noiseless feedback, and show that these bounds meet for a special case. Numerical results of this paper indicate that all three strategies enhance the secrecy capacity of the GWTC-N-CSIT. The study of this paper offers new options for enhancing the secrecy rates of the state-dependent wiretap channel models. [ABSTRACT FROM AUTHOR]

A hybrid communication network with a common analog source signal and independent digital data streams at the transmitters of a multiple access network is considered. The receiver has to estimate the analog signal samples with a given fidelity, and decode the digital streams with a low error probability. The main goal of this paper is to characterize the optimal tradeoff between the mean-squared error distortion in source estimation and the data rates available to each user. To this end, we consider a Gaussian multiple access channel (GMAC) setup with additive state, where the state is nothing but a scaled version of the source process itself. The state process is assumed to be non-causally available to all the transmitting nodes. The problem now becomes that of the joint state estimation and message communication in a GMAC with state. We provide a complete characterization of the optimal distortion-rate tradeoff for an $N$ —sender GMAC. Our results show that, similar to the single-user results, it is optimal to amplify the state using uncoded transmissions, whereas the digital streams are superposed using appropriate Gaussian codebooks in conjunction with dirty paper coding (DPC). Since the variance of the additive state is controlled by a scaling factor in our model, we also recover the results for communicating a common source and independent messages over a GMAC without state as a special case. [ABSTRACT FROM AUTHOR]

In this paper, simple methodologies of deep learning application to conventional multiple-input multiple-output (MIMO) communication systems are presented. The deep learning technologies with deep neural network (DNN) structure, emerging technologies in various engineering areas, have been actively investigated in the field of communication engineering as well. In the physical layer of conventional communication systems, there are practical challenges of application of DNN: calculating complex number in DNN and designing proper DNN structure for a specific communication system model. This paper proposes and verifies simple solutions for the difficulty. First, we apply a basic DNN structure for signal detection of one-tap MIMO channel. Second, convolutional neural network (CNN) and recurrent neural network (RNN) structures are presented for MIMO system with multipath fading channel. Our DNN structure for one-tap MIMO channel can achieve the optimal maximum likelihood detection performance, and furthermore, our CNN and RNN structures for multipath fading channel can detect the transmitted signal properly. [ABSTRACT FROM AUTHOR]

This paper addresses the estimation and compensation of I/Q imbalance, one of the most prominent impairments found in wideband zero-intermediate frequency transceivers (TRxs). The I/Q imbalance encountered in this kind of TRx comprises not only frequency-selective gain and phase imbalance but also delay imbalance. Unless appropriate compensation is applied, the I/Q imbalance significantly degrades the performance of a communication system. This paper presents a novel compensation technique for transmitter I/Q imbalance based on built-in-self-calibration, a low cost and robust compensation technique that enables manufacturing as well as in-field calibration with low computational complexity. The method's performance is evaluated in a TRx with 64-quadratic-amplitude modulation and 2 GHz of bandwidth implemented with real hardware. The measurements show that the proposed technique achieves an image rejection ratio greater than 35 dB in the entire 2 GHz bandwidth and an error vector magnitude lower than 3%. [ABSTRACT FROM AUTHOR]

This paper studies the precoder design problem of achieving max-min fairness (MMF) amongst users in multigateway multibeam satellite communication systems with feeder link interference. We propose a beamforming strategy based on a newly introduced transmission scheme known as rate-splitting multiple access (RSMA). RSMA relies on multi-antenna rate-splitting at the transmitter and successive interference cancellation (SIC) at the receivers, such that the intended message for a user is split into a common part and a private part and the interference is partially decoded and partially treated as noise. In this paper, we formulate the MMF problem subject to per-antenna power constraints at the satellite for the system with imperfect channel state information at the transmitter (CSIT). We also consider the case of two-stage precoding which is assisted by on- board processing (OBP) at the satellite. Numerical results obtained through simulations for RSMA and the conventional linear precoding method are compared. When RSMA is used, MMF rate gain is promised and this gain increases when OBP is used. RSMA is proven to be promising for multigateway multibeam satellite systems whereby there are various practical challenges such as feeder link interference, CSIT uncertainty, per-antenna power constraints, uneven user distribution per beam and frame-based processing. [ABSTRACT FROM AUTHOR]

With the rise of critical machine-to-machine applications, next generation wireless communication systems must meet challenging requirements with respect to latency and reliability. A key question in this context relates to channel state estimation, which allows the transmitter to adapt the code rate to the channel state. In this paper, we characterize the tradeoff between the training sequence length and data codeword length: shorter channel estimation leaves more time for the payload transmission but reduces the estimation accuracy and causes more decoding errors. Using lower coding rates can mitigate this effect, but may result in a higher backlog of data at the transmitter. In order to optimize the training sequence length and the rate adaptation scheme with respect to the delay performance, we employ queuing analysis on top of accurate models of the physical layer. We obtain an analytically tractable solution to the problem by deriving a closed-form approximation for the decoding error probability due to imperfect channel knowledge and finite-blocklength channel coding. The optimized training sequence length and rate adaptation strategy can reduce the delay violation probability by an order of magnitude, compared with suboptimal strategies that do not consider the delay constraints. [ABSTRACT FROM AUTHOR]

The use of unmanned aircraft systems (UAS) is expanding rapidly. For safe and reliable integration of UAS into the National Airspace System (NAS), control and nonpayload communication (CNPC) system requirements are being developed. The air-to-ground (AG) channel characteristics essentially determine CNPC link performance. The National Aeronautics and Space Administration (NASA) Glenn Research Center has sponsored a comprehensive AG channel measurement campaign in 2013 in both the L- and C-bands recently allocated for UAS. These measurements covered nearly all typical ground site (GS) local environments, including over water, hilly, mountainous, suburb, and near urban. As a continuation of results reported for the over-water scenarios, a description of the measurement campaign, measured results, and complete AG channel models for hilly and mountainous terrains are provided in this paper. The path loss is modeled by a modified log-distance path loss model with a correction for flight direction; path loss results are close to those of free space. A strong ground reflection was observed only for some small portions of some of the flight paths. The small-scale fading is well modeled by the Ricean distribution with a $K$-factor of 29.4 dB in the C-band and 12.8 dB in the L-band. The interband signals are uncorrelated. The spatial correlation for the two intraband channels with an aircraft antenna separation of 1.8 m is greater than 0.85. The C-band root-mean-square delay spread (RMS-DS) is 10 ns most of the time, with a maximum of 1 \mu\text{s} in hilly terrain and 180 ns in mountainous terrain. Tapped delay line (TDL) models accounting for the line of sight (LOS) and up to seven intermittent multipath components (MPCs) were developed, including the MPCs' probability of occurrence, relative power, phase, duration, and excess delay. [ABSTRACT FROM PUBLISHER]

The state-dependent point-to-point Gaussian channel with a helper is first studied, in which a transmitter communicates with a receiver via a state-corrupted channel. The state is not known to the transmitter nor to the receiver, but known to a helper noncausally, which then wishes to assist the receiver to cancel the state. Differently from the previous work that characterized the capacity only in the infinite state power regime, this paper explores the general case with arbitrary state power. A lower bound on the capacity is derived based on an achievable scheme that integrates direct state subtraction and single-bin dirty paper coding. By analyzing this lower bound and further comparing it with the existing upper bounds, the capacity of the channel is characterized for a wide range of channel parameters. Such an idea of characterizing the capacity is further extended to study the two-user state-dependent multiple access channel with a helper. By comparing the derived inner and outer bounds, the channel parameters are partitioned into appropriate cases, and for each case, either segments on the capacity region boundary or the full capacity region are characterized. [ABSTRACT FROM PUBLISHER]

Cloud radio access networks (C-RAN) enable a network platform for beyond the fifth generation of communication networks (B5G), which incorporates the advances in cloud computing technologies to modern radio access networks. Recently, rate splitting multiple access (RSMA), relying on multi-antenna rate splitting (RS) at the transmitter and successive interference cancellation (SIC) at the receivers, has been shown to manage the interference in multi-antenna communication networks efficiently. This paper considers applying RSMA in C-RAN. We address the practical challenge of a transmitter that only knows the statistical channel state information (CSI) of the users. To this end, the paper investigates the problem of stochastic coordinated beamforming (SCB) optimization to maximize the ergodic sum-rate (ESR) in the network. Furthermore, we propose a scalable and robust RS scheme where the number of the common streams to be decoded at each user scales linearly with the number of users, and the common stream selection only depends on the statistical CSI. The setup leads to a challenging stochastic and non-convex optimization problem. A sample average approximation (SAA) and weighted minimum mean square error (WMMSE) based algorithm is adopted to tackle the intractable stochastic non-convex optimization and guarantee convergence to a stationary point asymptotically. The numerical simulations demonstrate the efficiency of the proposed RS strategy and show a gain up to 27% in the achievable ESR compared with state-of-the-art schemes, namely treating interference as noise (TIN) and non-orthogonal multiple access (NOMA) schemes. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of coordinating several agents through their actions, focusing on an asymmetric observation structure with two agents. Specifically, one agent knows the past, present, and future realizations of a state that affects a common payoff function, while the other agent either knows the past realizations of nothing about the state. In both cases, the second agent is assumed to have strictly causal observations of the first agent’s actions, which enables the two agents to coordinate. These scenarios are applied to distributed power control; the key idea is that a transmitter may embed information about the wireless channel state into its transmit power levels so that an observation of these levels, e.g., the signal-to-interference-plus-noise ratio, allows the other transmitter to coordinate its power levels. The main contributions of this paper are twofold. First, we provide a characterization of the set of feasible average payoffs when the agents repeatedly take long sequences of actions and the realizations of the system state are i.i.d.. Second, we exploit these results in the context of distributed power control and introduce the concept of coded power-control. We carry out an extensive numerical analysis of the benefits of coded power control over alternative power-control policies, and highlight a simple yet non-trivial example of a power control code. [ABSTRACT FROM PUBLISHER]

Multiple antenna techniques that allow energy beamforming have been looked upon as a possible candidate for increasing the transfer efficiency between the energy transmitter (ET) and the energy receiver in wireless power transfer. This paper introduces a novel scheme that facilitates energy beamforming by utilizing received signal strength indicator (RSSI) values to estimate the channel. First, in the training stage, the ET will transmit using each beamforming vector in a codebook, which is predefined using a Cramer-Rao lower bound analysis. RSSI value corresponding to each beamforming vector is fed back to the ET, and these values are used to estimate the channel through a maximum likelihood analysis. The results that are obtained are remarkably simple, requires minimal processing, and can be easily implemented. The paper also validates the analytical results numerically, as well as experimentally, and it is shown that the proposed method achieves impressive results. [ABSTRACT FROM AUTHOR]

In this paper, we study the capacity and symbol error probability (SEP) of generalized spatial modulation (GSM) multiple-input multiple-output (MIMO) using measured channels that are obtained by channel sounding in an indoor office environment at 60GHz. Spatial modulation (SM) and GSM are emerging low-complexity MIMO schemes that have been extensively researched for low-GHz (below 6GHz) communications. Recently, they have been considered and shown to be promising also for (mmWave) communications. In the simplest possible case, they require only one RF chain both at the transmitter (TX) and receiver (RX), and thus, are especially attractive for mmWave communications, in which the number of RF chains needs to be as low as possible. Despite of some early works on the theoretical analysis of SM/GSM for mmWave communications, there have been no investigations using real-world channel data. We focus on the office line-of-sight (LOS) scenario and investigate three problems: 1) the performance of GSM using the extracted LOS component of measured channels; 2) the impact of non-LOS NLOS components on the performance of GSM; and 3) possible simple modulation and reception algorithms for GSM that rely only on the LOS component of the channel. The results being reported in this paper not only validate the main claims of previous studies based on ideal pure LOS channels, but also lead to novel findings. One major conclusion is that NLOS components are harmful to the SEP of GSM and should be avoided. As another important outcome, our results strongly motivate the use of precoding in GSM systems to simultaneously improve the channel capacity and reduce the physical size of MIMO arrays (thus eliminating one major issue of LOS GSM). [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]

Millimeter wave (mmWave) frequency spectrum offers orders of magnitude greater spectrum to mitigate the severe spectrum shortage in conventional cellular bands. To overcome the high propagation loss in the mmWave band, massive multiple-input and multiple-output (MIMO) can be adopted at both transmitter and receiver to provide large beamforming gains. At the same time, hybrid architecture is applied to reduce the huge power consumption caused by devices operating at radio frequency (RF). However, because of the hybrid architecture and large number of antennas, it is hard to obtain the channel state information (CSI) which is crucial for obtaining desirable beamforming gains. Off-grid error and sparsity pattern (SP) estimation error are two main limiting factors of the performance of most existing compressive sensing (CS) based channel estimation (CE) algorithms. Off-grid error presents when the true angle does not lie on the discretized angle grid of mmWave channel in the spatial domain. In this paper, we first propose a fast Bayesian matching pursuit method with ‘virtual sparsity’ to improve the accuracy of SP estimation and name it as the improved Bayesian matching pursuit (IBMP). Then an enhanced algorithm, named off-grid IBMP (OG-IBMP), is developed to mitigate the off-grid problem, followed by a theoretical analysis of OG-IBMP. This method iteratively updates the selected grid points and updates the corresponding parameters based on the maximum a posteriori (MAP) criterion. Numerical simulations are performed to validate our theoretical analysis and evaluate the performance of the proposed method. Compared to other existing methods, the results show that our proposed OG-IBMP algorithm greatly reduces the off-grid error and significantly enhances the accuracy of the SP estimation with low computational complexity. [ABSTRACT FROM AUTHOR]

In a diffusion-based molecular communication network, transmitters and receivers communicate by using signalling molecules (or ligands) in a fluid medium. This paper assumes that the transmitter uses different chemical reactions to generate different emission patterns of signalling molecules to represent different transmission symbols, and the receiver consists of receptors. When the signalling molecules arrive at the receiver, they may react with the receptors to form ligand-receptor complexes. Our goal is to study the demodulation in this setup assuming that the transmitter and receiver are synchronised. We derive an optimal demodulator using the continuous history of the number of complexes at the receiver as the input to the demodulator. We do that by first deriving a communication model which includes the chemical reactions in the transmitter, diffusion in the transmission medium and the ligand-receptor process in the receiver. This model, which takes the form of a continuous-time Markov process, captures the noise in the receiver signal due to the stochastic nature of chemical reactions and diffusion. We then adopt a maximum a posteriori framework and use Bayesian filtering to derive the optimal demodulator. We use numerical examples to illustrate the properties of this optimal demodulator. [ABSTRACT FROM PUBLISHER]

This paper aims to characterize the capacity limits of a wireless cellular network with a full-duplex (FD) base-station (BS) and half-duplex user terminals, in which three independent messages are communicated: the uplink message m1 from the uplink user to the BS, the downlink message m2 from the BS to the downlink user, and the device-to-device (D2D) message m3 from the uplink user to the downlink user. From an information theoretical perspective, the overall network can be viewed as a generalization of the FD relay broadcast channel with a side message transmitted from the relay to the destination. We begin with a simpler case that involves the uplink and downlink transmissions of (m1, m2) only, and propose an achievable rate region based on a novel strategy that uses the BS as a FD relay to facilitate the interference cancellation at the downlink user. We also prove a new converse, which is strictly tighter than the cut-set bound, and characterize the capacity region of the scalar Gaussian FD network without a D2D message to within a constant gap. This paper further studies a general setup wherein (m1, m2, m3) are communicated simultaneously. To account for the D2D message, we incorporate Marton’s broadcast coding into the previous scheme to obtain a larger achievable rate region than the existing ones in the literature. We also improve the cut-set bound by means of genie and show that by using one of the two simple rate-splitting schemes, the capacity region of the scalar Gaussian FD network with a D2D message can already be reached to within a constant gap. Finally, a generalization to the vector Gaussian channel case is discussed. Simulation results demonstrate the advantage of using the BS as relay in enhancing the throughput of the FD cellular network. [ABSTRACT FROM AUTHOR]

In this paper, the design of a multiple-input multiple-output (MIMO) optical wireless communication (OWC) link based on vertical cavity surface emitting laser (VCSEL) arrays is systematically carried out with the aim to support data rates in excess of 1 Tb/s for the backhaul of sixth generation (6G) indoor wireless networks. The proposed design combines direct current optical orthogonal frequency division multiplexing (DCO-OFDM) and a spatial multiplexing MIMO architecture. For such an ultra-high-speed line-of-sight (LOS) OWC link with low divergence laser beams, maintaining alignment is of high importance. In this paper, two types of misalignment error between the transmitter and receiver are distinguished, namely, radial displacement error and orientation angle error, and they are thoroughly modeled in a unified analytical framework assuming Gaussian laser beams, resulting in a generalized misalignment model (GMM). The derived GMM is then extended to MIMO arrays and the performance of the MIMO-OFDM OWC system is analyzed in terms of the aggregate data rate. Novel insights are provided into the system performance based on computer simulations by studying various influential factors such as beam waist, array configuration and different misalignment errors, which can be used as guidelines for designing short range Tb/s MIMO OWC systems. [ABSTRACT FROM AUTHOR]

This paper studies the continuous-time Poisson channel whose dark current is random and may change for every $\tau $ -second time interval, where the actual values of the dark current are known to the transmitter as channel-state information (CSI). In the limit where $\tau $ tends to zero, the capacity gain provided by both causal and noncausal CSI is shown to vanish linearly with $\tau $ , so CSI at the transmitter provides almost no capacity improvement. The paper also considers a related problem of the state-dependent very noisy channel. In the very noisy limit, the capacity gain provided by noncausal CSI is shown to be the same as that provided by causal CSI. [ABSTRACT FROM AUTHOR]

Broadcasting signals have been recognized as promising candidates for navigation and positioning needs. However, in most single frequency broadcasting networks, the transmitter confusion problem poses a huge obstacle. Not holding the transmitter identities, the receiver cannot determine the distance to the transmitters, let alone its own position. What’s worse, considering the existence of multipath propagation, the receiver is unable to distinguish line of sight (LOS) components from non line of sight components, which makes positioning even harder. In this paper, a two-step method is proposed to solve the positioning problem in single frequency networks (SFNs) under multipath propagation yet with direct path. First, a probability approach is proposed to identify all LOS components iteratively. Then, it is proved in this paper that a receiver can determine its position when receiving LOS signals from at least five transmitters without the knowledge of transmitter identities. Detailed analysis is carried out in this paper to derive error bounds and performance limits from different perspectives. Simulation results show that the proposed algorithm can achieve high accuracy of positioning across multiple environments. Besides, the proposed methodology is general, which can be used in any SFN or other wireless networks for positioning needs. [ABSTRACT FROM AUTHOR]

This paper studies simultaneous wireless information and power transfer (SWIPT) techniques for point-to-point multiple-input multiple-output channels, where a multi-antenna transmitter conveys information and energy at the same time to a multi-antenna receiver equipped with time switching (TS) circuits for an energy harvesting (EH) mode and an information decoding (ID) mode. Unlike conventional uniform TS (UTS) structure where all the receive antennas at the receiver employ a single TS circuit, in this paper, we propose a general dynamic TS (DTS) receiver architecture which has an individual TS circuit for each antenna. In the proposed DTS, the operation modes of the antennas can be dynamically changed to improve SWIPT performance. We aim to identify the achievable rate–energy (R–E) tradeoff of the DTS protocol for both linear and non-linear EH models by maximizing the information rate subject to the EH constraint. This results in joint optimization of the transmit covariance matrices and the time durations for the EH and the ID modes of the receive antennas, which is jointly non-convex in general. To tackle the non-convexity of the original problem, the successive convex approximation technique is adopted by addressing a series of approximated convex problems. As a result, efficient optimization algorithms are proposed for determining the boundary points of the achievable R–E region. We also provide a low-complexity algorithm which achieves near-optimal performance with much reduced complexity. Numerical results demonstrate that the proposed DTS presents significant performance gains over conventional UTS approaches. [ABSTRACT FROM AUTHOR]

Sending broadcast messages is an efficient means of communicating in emergency situations, especially during serious disasters. This paper focuses on the digital audio broadcast (DAB) system. First, several new techniques are reported to enhance the emergency warning message (EWM) receiving and display functionalities for both personal and public DAB terminals. Then, a novel bidirectional communication method between two DAB transmitters is proposed, to enable the communication to and from the disaster area and the outside. Experiments show that the EWM can be correctly sent to the intended DAB terminals within 0.2–3 s, and the existing public light emitting diode screens can be expanded as DAB EWM terminals without affecting their normal functions. The bidirectional multimedia communication between two DAB transmitters is also successfully demonstrated. The proposed techniques expand upon the DAB’s existing functionality, and can benefit more people during emergencies. [ABSTRACT FROM AUTHOR]

This paper proposes a broadcast strategy for the single-user slowly fading channel in which the transmission power is supplied by an energy harvesting unit. In this strategy, the channel state information (CSI) is known only to the receiver, and the transmitter is assumed to be oblivious to the CSI. The broadcast approach enables preventing outage events in the face of the lack of CSI at the transmitter. In the proposed broadcast approach, the transmitter splits its message into multiple superimposed information layers. This facilitates sustaining reliably decodable transmission rates adapted to the unknown state of the randomly-varying fading state of the channel. The objective is to characterize the optimal allocation of the randomly varying harvested power over time and across information layers in the contexts of maximizing the average communication rate and minimizing the likelihood of outage. First, the setting in which the transmitter has non-causal and complete information about the state of the energy harvesting process is considered. A closed-form characterization of the optimal allocation of power across layers is established, and an algorithm that analytically determines the exact optimal allocation of power over time is provided. Furthermore, an online algorithm is proposed for a setting in which the energy harvesting process is known only causally to the transmitter. [ABSTRACT FROM AUTHOR]

Over the past decade, the bulk of wireless traffic has shifted from speech to content. This shift creates the opportunity to cache part of the content in memories closer to the end users, for example in base stations. Most previous paper focuses on the reduction of load in the backhaul and core networks due to caching, i.e., on the benefits caching offers for the wireline communication link between the origin servers and the caches. In this paper, we are instead interested in the benefits caching can offer for the wireless communication link between the caches and the end users. To quantify the gains of caching for this wireless link, we consider an interference channel in which each transmitter is equipped with an isolated cache memory. Communication takes place in two phases, a content placement phase followed by a content delivery phase. The objective is to design both the placement and the delivery phases to maximize the rate in the delivery phase in response to any possible user demands. Focusing on the three-user case, we show that through careful joint design of these phases, we can reap three distinct benefits from caching: a load balancing gain, an interference cancellation gain, and an interference alignment gain. In our proposed scheme, load balancing is achieved through a specific file splitting and placement, producing a particular pattern of content overlap at the caches. This overlap allows to implement interference cancellation. Furthermore, it allows us to create several virtual transmitters, each transmitting a part of the requested content, which increases interference-alignment possibilities. [ABSTRACT FROM AUTHOR]

This paper proposes a low budget solution to detect and possibly track space debris and satellites in Low Earth Orbit. The concept consists of a space-borne radar installed on a cubeSat flying at low altitude and detecting the occultations of radio signals coming from existing satellites flying at higher altitudes. The paper investigates the feasibility and performance of such a passive bistatic radar system. Key performance metrics considered in this paper are: the minimum size of detectable objects, considering visibility and frequency constraints on existing radio sources, the receiver size, and the compatibility with current cubeSat's technology. Different illuminator types and receiver altitudes are considered under the assumption that all illuminators and receivers are on circular orbits. [ABSTRACT FROM AUTHOR]

Visible light communications (VLC) has been studied thoroughly in recent years as an alternative or complementary technology to radio frequency communications. The reliability of VLC channels highly depends on the availability and alignment of line of sight links. In this paper, we study the effect of random receiver orientation for mobile users over VLC downlink channels, which affects the existence and quality of line of sight links. Based on the statistics of the receiver location and relative orientation with respect to the transmitter LED, we develop an analytical framework to characterize the statistical distribution of VLC downlink channels, which is then utilized to obtain the outage probability and the bit error rate. Our analysis is generalized for arbitrary distributions of relative orientation and location for a single transmitter, and extended to multiple transmitter case for some certain scenarios. Extensive Monte Carlo simulations show a perfect match between the analytical and the simulation data in terms of both the statistical channel distribution and the resulting bit error rate. Our results also characterize the channel attenuation due to random receiver orientation and location for various scenarios of interest. [ABSTRACT FROM AUTHOR]

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]

Multiple-input multiple-output (MIMO) technology equips the transmitters with the multiple antennas. It can combine with energy harvesting (EH) to lift the spectrum efficiency and make use of a greener energy resource. A power grid is added to serve as a supplementary source to regulate the not-so-stable harvested energy supply of the system. Besides the MIMO technology being used, the power allocated to the user provided by both EH and the power grid is subject to the epoch power upper bound constraints. The background of these constraints comes from field requirements, such as avoiding the saturation of power allocated to the user(s), avoiding system-level out-of-band power leakage, and reducing interference with other transmitter(s) due to the non-linearity generated via the transmitting mechanisms to the user(s). The epoch power upper bound constraints make this problem more challenging, with the controllable power grid energy budget and its allocation. This paper applies our recently proposed geometric water-filling with group upper bounded power constraints and recursion machinery to form the proposed algorithm for solving the proposed throughput maximization problem. Our algorithm is precisely defined, and further provides the exact solution via the lower degree polynomial complexity. This point is very suitable for the massive MIMO system. To the best of our knowledge, no prior algorithm has been reported in the open literature to solve the targeted problem in this paper. [ABSTRACT FROM PUBLISHER]

This paper studies the two-user causal cognitive interference channel (CCIC), where two transmitters aim to communicate independent messages to two different receivers via a common channel. One source, referred to as the cognitive, is capable of overhearing the other source, referred to as the primary, through a noisy in-band link and thus can assist in sending the primary’s data. The authors of this paper recently characterized to within a constant gap the capacity of the symmetric Gaussian CCIC in: 1) the strong interference regime and 2) for a subset of the weak interference regime when the cooperation link is larger than a given threshold. This paper characterizes to within a constant gap the capacity for the symmetric Gaussian CCIC in the regime that was still open. To this end, two novel outer bounds of the types 2 R\mathsf {p}+ R\mathsf {c} and R\mathsf {p}+2 R\mathsf {c} are derived for the class of injective semideterministic CCICs, where the noises at the different source-destination pairs are independent. These outer bounds, as well as an achievable rate region based on Gelfand-Pinsker binning, superposition coding, and simultaneous decoding at the receivers, are then specialized to the Gaussian noise case. It is shown that the novel outer bounds are necessary to characterize the capacity within a constant gap when the cooperation link is weaker than the direct links, that is, in this regime unilateral cooperation leaves some system resources underutilized. [ABSTRACT FROM PUBLISHER]

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]

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]

This paper presents multi-user (MU) linear precoding methods for massively distributed antenna system (DAS) with polarized antennas, where mobile stations (MSs) are spatially grouped and the distributed antenna (DA) ports with a polarized-antenna are connected to a central base station (BS). While the (slowly-changing) long-term channel state information (CSI) (i.e., large scale fading and polarization) can be accurately estimated at the transmit-side, the short-term CSI (instantaneous channel response) is available at the transmit-side with quantization errors due to the limited feedback. Accordingly, the utilization of a large number of DA ports is not always beneficial due to the imperfect short-term CSI at the transmitter (CSIT). In this paper, we first derive the asymptotic achievable rate and signal-to-leakage-and-noise ratio (SLNR) for the MU linear precoding in the massive DAS, which depends on the long-term CSIT and the number of feedback bits, and propose a transmit DA port selection based on the asymptotic SLNR performance. Here, the number of selected DA ports can be also optimized according to the long-term CSIT and the number of feedback bits. Furthermore, we also propose a polarization selection strategy at each DA port (equipped with multi-polarized antennas) so as to exploit the polarization diversity. Through the simulation, we confirm that the proposed MU precoding with the DA port selection outperforms the conventional precoding schemes for the DAS and, furthermore, the proposed polarization selection strategy achieves a rate performance comparable to the DAS with a (single polarized antenna) node density twice as large. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the secure relay beamforming problems for the amplify-and-forward (AF) relay network, where the transmitter sends the information to the receiver with the help of a multiple-antenna relay in the presence of an eavesdropper. We first study the secrecy rate maximization (SRM) problem in the case of complete channel state information (CSI). The rank-1 relay beamformer, which has been solved in our previous work in “Secure relay beamforming with imperfect channel side information,” IEEE Trans. Veh. Technol., vol. 62, no. 5, pp. 2140–2155, June 2013, is rigorously proved to be globally optimal. Then, we turn to the case of partial eavesdropper’s CSI (ECSI), where the uncertainty of ECSI is characterized as a bounded region, and study the worst-case secrecy rate maximization (WCSRM) problem. Different from the common spherical uncertainty region, the uncertainty region adopted in our paper imposes independent constraints on the channel gain and direction. With the proposed uncertainty region, we give an in-depth analysis of the WCSRM problem. We solve the rank-1 relay beamformer in an explicit form and move a step further by establishing the sufficient conditions for the global optimality of the rank-1 solution. Besides, the rank-2 relay beamformer with a special singular value decomposition (SVD) structure is also considered. By reducing the optimization variables into single variable, we show that the proposed rank-2 solution can be solved by simple line search. The asymptotic optimality of the proposed rank-2 relay beamformer in the high relay power region is also proved under mild conditions. Finally, numerical results are presented to verify the analysis in the paper. [ABSTRACT FROM PUBLISHER]

This paper studies a cognitive radio network (CRN), in which a multiple-input single-output (MISO) secondary transmitter (SU-Tx) aims to send confidential messages to its receiver (SU-Rx) in the presence of unknown eavesdroppers, while having to control its generated interference to the primary users (PUs) under a given threshold. Because the eavesdroppers are unknown, this paper considers the artificial noise (AN) approach or masked beamforming to provide the information secrecy. The objective of this paper is to maximize the power of AN in order to degrade the eavesdroppers, subject to the signal-to-interference-plus-noise ratio (SINR) constraint at the SU-Rx, as well as the interference temperature limits (ITLs) for the PUs. In the case of perfect channel state information (CSI), we reveal that the optimal strategy for the information-bearing signal is beamforming. Imperfect CSI cases of bounded and stochastic uncertainties are investigated. In the case of ellipsoid-bounded errors, we derive the equivalent forms for the SINR and ITL constraints and then transform the optimization problem into a form of semidefinite programming (SDP). For the case of probabilistic CSI uncertainties, we propose an outage-constrained robust formulation where the CSI errors are Gaussian distributed. With the aid of two kinds of Bernstein-type inequalities, we reexpress the probabilistic constraints into deterministic forms, which results in a safe approximate solution. [ABSTRACT FROM PUBLISHER]