Channel State Information At The Transmitter Research Articles

User-Perceived Capacity: Theory, Computation, and Achievable Policies

User-perceived throughput is a novel performance metric attracting a considerable amount of recent attention because it characterizes the quality of the experience in mobile multimedia services. For instance, it gives a data rate of video streaming with which a user will not experience any lag or outage in watching video clips. However, its performance limit remains open. In this paper, we are interested in the achievable upper bound of user-perceived throughput, also referred to as the user-perceived capacity, and how to achieve it in typical wireless channels. We find that the user-perceived capacity is quite limited or even zero with channel state information at the receiver (CSIR) only. When both CSIR and channel state information at the transmitter (CSIT) are available, the user-perceived throughput can be substantially improved by power or even rate adaptation. A constrained Markov decision process (CMDP)-based approach is conceived to compute the user-perceived capacity with joint power–rate adaptation. It is rigorously shown that the optimal policy obeys a threshold-based rule with time, backlog, and channel gain thresholds. With power adaptation only, the user-perceived capacity is equal to the hard-delay-constrained capacity in our previous work and achieved by joint diversity and channel inversion.

Transmitter Precoder Design to Improve the Performance of the MUSIC Algorithm

Using the MUSIC (MUltiple SIgnal Classification) algorithm to estimate the angle-of-arrival (AoA), we derive a new asymptotic error variance bound when the transmitted signal can be pre-processed. We next propose a precoder design to achieve this bound. However, such an optimal precoder requires channel state information at the transmitter (CSIT) exclusive of the receiver array which cannot be separately estimated practically. A more feasible precoder design, which leverages on the feedback CSIT estimated at the receiver, is next proposed. Using the performance of the optimal precoder which achieves the bound asymptotically as a benchmark, the practical precoder design performs closely to the optimal precoder even in high-resolution scenario. Both precoder schemes exhibit performance improvement compared with the case when no precoder is used.

Performance Analysis of SNR in MIMO OFDM Downlink System

The goal of future wireless communications systems is to provide a wide variety of high quality high-rate services with minimum requirements on spectrum, power consumption and hardware complexity. Toward this end, proper system structures as well as robust system designs are required to meet the challenges in wireless transmissions, such as multipath fading, limited spectrum resource, and interference. Recent research results have unveiled the multiple-input multiple-output (MIMO) system as a potential candidate to play a key role in future wireless. A MIMO wireless system is commonly deployed by using multiple transmit and receive antennas. Early work on multi-antenna systems involves the use of antenna arrays at the receiver to provide spatial diversity against the random destructive effect of fading. There is a recent rich literature on employing multiple antennas at the transmitter and achieving diversity through space-time coding when there is no channel state information at the transmitter (CSIT), or through transmit beam forming when there is perfect CSIT.

Link Adaptation for Rate Splitting Systems With Partial CSIT

Rate Splitting (RS) has emerged as a flexible multiple-access scheme for Multi-User Multiple-Input Multiple-Output (MU-MIMO) systems, generalizing more conventional approaches such as linear precoding or Non-Orthogonal Multiple Access (NOMA), and providing additional robustness against imperfect channel state information at the transmitter. Actual achievable rates cannot be pre-calculated when facing imperfect and/or outdated channel state information at the transmitter (CSIT), so practical real-time mechanisms in the form of link adaptation (LA) are required. The available CSIT is used to design the RS precoders, which can accommodate some degree of robustness, whereas the physical layer feedback reports the outcome of the decoding of the codewords, in the form of acknowledgement (ACK) or negative ACK (NACK), providing the additional meta-robustness needed when the statistical model of CSIT errors is not accurate, and/or the precoders cannot fully track the channel dynamics. We characterize the outage rate region of RS and analyze the convergence of the complete LA-RS system under partial CSIT (non-accurate and non-permanent), providing relevant insights for addressing the adaptation of private and common rates, designing robust precoders with throughput as relevant metric, and handling the time-variant CSIT quality.

Efficient Rate-Splitting Multiple Access for the Internet of Vehicles: Federated Edge Learning and Latency Minimization

Rate-Splitting Multiple Access (RSMA) has recently found favour in the multi-antenna-aided wireless downlink, as a benefit of relaxing the accuracy of Channel State Information at the Transmitter (CSIT), while in achieving high spectral efficiency and providing security guarantees. These benefits are particularly important in high-velocity vehicular platoons since their high Doppler affects the estimation accuracy of the CSIT. To tackle this challenge, we propose an RSMA-based Internet of Vehicles (IoV) solution that jointly considers platoon control and FEderated Edge Learning (FEEL) in the downlink. Specifically, the proposed framework is designed for transmitting the unicast control messages within the IoV platoon, as well as for privacy-preserving FEEL-aided downlink Non-Orthogonal Unicasting and Multicasting (NOUM). Given this sophisticated framework, a multi-objective optimization problem is formulated to minimize both the latency of the FEEL downlink and the deviation of the vehicles within the platoon. To efficiently solve this problem, a Block Coordinate Descent (BCD) framework is developed for decoupling the main multi-objective problem into two sub-problems. Then, for solving these non-convex sub-problems, a Successive Convex Approximation (SCA) and Model Predictive Control (MPC) method is developed for solving the FEEL-based downlink problem and platoon control problem, respectively. Our simulation results show that the proposed RSMA-based IoV system outperforms both the popular Multi-User Linear Precoding (MU–LP) and the conventional Non-Orthogonal Multiple Access (NOMA) system. Finally, the BCD framework is shown to generate near-optimal solutions at reduced complexity.

Information Rates for Channels with Fading, Side Information and Adaptive Codewords.

Generalized mutual information (GMI) is used to compute achievable rates for fading channels with various types of channel state information at the transmitter (CSIT) and receiver (CSIR). The GMI is based on variations of auxiliary channel models with additive white Gaussian noise (AWGN) and circularly-symmetric complex Gaussian inputs. One variation uses reverse channel models with minimum mean square error (MMSE) estimates that give the largest rates but are challenging to optimize. A second variation uses forward channel models with linear MMSE estimates that are easier to optimize. Both model classes are applied to channels where the receiver is unaware of the CSIT and for which adaptive codewords achieve capacity. The forward model inputs are chosen as linear functions of the adaptive codeword's entries to simplify the analysis. For scalar channels, the maximum GMI is then achieved by a conventional codebook, where the amplitude and phase of each channel symbol are modified based on the CSIT. The GMI increases by partitioning the channel output alphabet and using a different auxiliary model for each partition subset. The partitioning also helps to determine the capacity scaling at high and low signal-to-noise ratios. A class of power control policies is described for partial CSIR, including a MMSE policy for full CSIT. Several examples of fading channels with AWGN illustrate the theory, focusing on on-off fading and Rayleigh fading. The capacity results generalize to block fading channels with in-block feedback, including capacity expressions in terms of mutual and directed information.

Rate-Splitting Multiple Access-Based Satellite–Vehicular Communication System: A Noncooperative Game Theoretical Approach

Rate-Splitting Multiple Access (RSMA) has recently found favor in high-mobility scenarios due to the benefits of relaxing the accuracy of Channel State Information at the Transmitter (CSIT) while maintaining high spectral efficiency. These benefits are particularly important in Satellite-Vehicular Networks (SVNs), where the mobility of the vehicles significantly affects the estimation accuracy of the CSIT. To tackle this challenge, we propose an RSMA-based satellite-vehicular communication system for reliable data transmission. Specifically, we investigate the outage probability of the RSMA-based satellite-vehicular communication system under the Shadowed-Rician model. Considering the satellite-vehicular communication outage problem, an optimization problem is formulated to maximize the Weighted Sum Rate (WSR) of the communication system. However, due to communication overhead and privacy concerns, not all vehicles are willing to participate in interference management. In this study, we exploit an incentive mechanism to efficiently solve this problem. Specifically, we formulated a non-cooperative game to motivate users to report the CSIT and participate in the power allocation. In addition, we have proved the existence and uniqueness of Nash Equilibrium (NE) in the game formulated. Our simulation results show that the proposed non-cooperative game theoretical approach achieves the effectiveness of the RSMA-based satellite-vehicular system. The game theoretical framework is shown to motivate users to participate in interference management, so as to maximize their transmission rates.

Max-Min Fairness Precoder Design for Rate-Splitting Multiple Access: Impact of Imperfect Channel Knowledge

Rate-splitting multiple access (RSMA) is a key enabling technology for beyond 5G networks due to its robustness against imperfect channel knowledge. In this paper, we consider both the imperfect channel state information (CSI) at the receiver (CSIR) and imperfect CSI at the transmitter (CSIT) and propose a max-min fairness optimization framework relying on RSMA to guarantee each user's minimum level of quality of service (QoS). First, we formulate the max-min fairness optimization problem that has non-convexity. To transform the non-convex problem into a convex problem, we apply the semi-definite relaxation (SDR) and convex-concave procedure (CCP) to the proposed algorithm. From simulation results, we confirm that RSMA is still a robust scheme over conventional multiple access schemes for both imperfect CSIT and CSIR.

A Framework for Hardware Impairments-Aware Multi-Antenna Transceiver Design in IoT Systems via Majorization–Minimization

In view of the nonideality of communication links in the Internet of Things (IoT) originating from transceiver hardware impairments, in this article, we introduce a general framework for hardware impairments-aware multiantenna transceiver design, which considers different availabilities of CSI at the transmitter (CSIT) and the receiver (CSIR). The well-known Kronecker model is applied to characterize stochastic channel state information (CSI) errors. For each case, we aim to minimize the (average) total mean square error (MSE) of all data streams subject to the practical per-antenna power constraints. To address the nonconvexity of the formulated problem, we propose an efficient majorization–minimization (MM)-based iterative algorithm to transform the original problem into a series of convex subproblems with semiclosed-form optimal solutions. For low-complexity implementation, we also develop an alternative scheme for directly finding a high-quality suboptimal solution by considering both worst case hardware impairments and worst case CSI errors. In particular, since an explicit expression of the average total MSE for the perfect CSIR and imperfect CSIT case is hard to derive, we instead optimize its effective upper and lower bounds. The prospective applications of our work in the two currently popular multiple-input–multiple-output (MIMO) IoT scenarios are then discussed. Furthermore, we fundamentally reveal the MSE floor effect caused by both hardware distortion and CSI imperfection in the high-SNR regime. Numerical results illustrate the excellent average total MSE and average bit error rate (BER) performance of our proposed algorithms over the adopted benchmark schemes.

Secure Degrees of Freedom of the Three-User MIMO Broadcast Channel With Delayed CSIT

This paper investigates the sum-secure degrees-of-freedom (SDoF) of three-user multiple-input multiple-output (MIMO) broadcast channel with confidential messages (BCCM) and delayed channel state information at the transmitter (CSIT). Specifically, we obtain non-trivial sum-SDoF upper and lower bounds. Firstly, we derive the sum-SDoF upper bound by means of statistical equivalence property, security constraints, and permutations. Then, for the sum-SDoF lower bound, we leverage the artificial noise transmission and interference re-transmission to design two transmission schemes, which have holistic and sequential higher-order symbol generation, respectively. For these two schemes, we propose the redundancy reduction approach for security analysis, by which the minimal duration of artificial noise transmission phase of the scheme is obtained. To eliminate the redundant equations in security analysis, this approach first identifies the constituent equations, and then analyzes the rank of assemble of them. As a result, both the proposed sum-SDoF upper and lower bounds are tighter than the existing sum-SDoF upper and lower bounds, respectively. Furthermore, the proposed lower bound showcases a three-user coding gain.

Optimization of resource allocation in FDD massive MIMO systems

The performance of massive MIMO systems relies heavily on the availability of Channel State Information at the Transmitter (CSIT). A large amount of work has been devoted to reducing the CSIT acquisition overhead at the pilot training and/or CSI feedback stage. In fact, the downlink communication generally includes three stages, i.e., pilot training, CSI feedback, and data transmission. These three stages are mutually related and jointly determine the overall system performance. Unfortunately, there exist few studies on the reduction of CSIT acquisition overhead from the global point of view. In this paper, we integrate the Minimum Mean Square Error (MMSE) channel estimation, Random Vector Quantization (RVQ) based limited feedback and Maximal Ratio Combining (MRC) precoding into a unified framework for investigating the resource allocation problem. In particular, we first approximate the covariance matrix of the quantization error with a simple expression and derive an analytical expression of the received Signal-to-Noise Ratio (SNR) based on the deterministic equivalence theory. Then the three performance metrics (the spectral efficiency, energy efficiency, and total energy consumption) oriented problems are formulated analytically. With practical system requirements, these three metrics can be collaboratively optimized. Finally, we propose an optimization solver to derive the optimal partition of channel coherence time. Experiment results verify the benefits of the proposed resource allocation schemes under three different scenarios and illustrate the tradeoff of resource allocation between three stages.

Timely-Throughput Optimal Scheduling With Delayed CSIT for Chase Combining HARQ

We consider a cross-layer packet scheduling problem with hybrid ARQ (HARQ) in fading channels in which the channel state information at the transmitter (CSIT) is known only after one slot delay. Packets arrive according to a Bernoulli process at the transmitter, and each packet is required to be timely-delivered at the receiver, within a delay of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$d$</tex-math></inline-formula> time-slots, and is dropped, if the delay deadline is not met. Since the transmitter has only a delayed CSIT, a HARQ with Chase combining is employed for error recovery. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">The problem is to decide the transmit-energy in each time-slot such that the timely-throughput is maximum for a given average transmit-energy constraint.</i> We pose this problem as a constrained Markov decision process, and provide an optimum policy based on Lagrangian relaxation. The optimum Lagrangian multiplier is obtained using a subgradient method. We obtain the structure of the optimum policy, based on which we propose a computationally simple policy READER that requires no CSIT. We show that for large Doppler spread (or mobility), the timely-throughput of READER is close to the optimum policy. We also provide two more policies: an optimum policy assuming perfect CSIT with zero delay, and a naive randomization policy, and compare the throughput performance of the proposed policies.

Massive MIMO Precoding for Interference-Free Multi-Numerology Systems

Multi-numerology transmission is a promising multiple access scheme for flexible communication systems, which can simultaneously support users with different service requirements. To this end, both inter- and intra-numerology interference (inter-NI and intra-NI) should be suppressed, which is not straightforward. This paper proposes a novel zero-forcing (ZF) precoding design, which perfectly eliminates all the interference, for massive multiple-input multiple-output (MIMO) systems with multi-numerology. First of all, we express the signal-to-interference-plus-noise ratio (SINR) of the multi-numerology system with spectrum sharing. From the SINR representation, we identify the channels that precoders must nullify to suppress inter-NI. After that, we propose a ZF precoder suppressing both inter-NI and intra-NI perfectly. The lower bound of ergodic achievable rate with perfect channel state information at the transmitter (CSIT) is analyzed. Based on the lower bound of ergodic achievable rate, we present the feasible rate region. Also, we propose two power allocation schemes: user fairness and the ergodic sum rate maximization. The simulation results demonstrate the advantage of the proposed precoding design and verify our analysis results.

Statistical QoS Analysis of Reconfigurable Intelligent Surface-Assisted D2D Communication

This work performs the statistical QoS analysis of a Rician block-fading reconfigurable intelligent surface (RIS)-assisted D2D link in which the transmit node operates under delay QoS constraints. First, we perform mode selection for the D2D link, in which the D2D pair can either communicate directly by relaying data from RISs or through a base station (BS). Next, we provide closed-form expressions for the effective capacity (EC) of the RIS-assisted D2D link. When channel state information at the transmitter (CSIT) is available, the transmit D2D node communicates with the variable rate $r_t(n)$ (adjustable according to the channel conditions); otherwise, it uses a fixed rate $r_t$. It allows us to model the RIS-assisted D2D link as a Markov system in both cases. We also extend our analysis to overlay and underlay D2D settings. To improve the throughput of the RIS-assisted D2D link when CSIT is unknown, we use the HARQ retransmission scheme and provide the EC analysis of the HARQ-enabled RIS-assisted D2D link. Finally, simulation results demonstrate that: i) the EC increases with an increase in RIS elements, ii) the EC decreases when strict QoS constraints are imposed at the transmit node, iii) the EC decreases with an increase in the variance of the path loss estimation error, iv) the EC increases with an increase in the probability of ON states, v) EC increases by using HARQ when CSIT is unknown, and it can reach up to $5\times$ the usual EC (with no HARQ and without CSIT) by using the optimal number of retransmissions.

Sum-GDoF of Symmetric Multi-Hop Interference Channel Under Finite Precision CSIT Using Aligned-Images Sum-Set Inequalities

Aligned-Images Sum-set Inequalities are used in this work to study the Generalized Degrees of Freedom (GDoF) of the symmetric layered multi-hop interference channel under the robust assumption that the channel state information at the transmitters (CSIT) is limited to finite precision. First, the sum-GDoF value is characterized for the <inline-formula> <tex-math notation="LaTeX">$2\times 2\times 2$ </tex-math></inline-formula> setting that is comprised of 2 sources, 2 relays, and 2 destinations. It is shown that the sum-GDoF does not improve even if perfect CSIT is allowed in the first hop, as long as the CSIT in the second hop is limited to finite precision. The sum GDoF characterization is then generalized to the <inline-formula> <tex-math notation="LaTeX">$2\times 2\times \cdots \times 2$ </tex-math></inline-formula> setting that is comprised of <inline-formula> <tex-math notation="LaTeX">$L$ </tex-math></inline-formula> hops. Remarkably, for large <inline-formula> <tex-math notation="LaTeX">$L$ </tex-math></inline-formula>, the sum-GDoF value approaches that of the one-hop broadcast channel that is obtained by full cooperation among the two transmitters of the last hop, with finite precision CSIT. Previous studies of multi-hop interference networks either identified sophisticated GDoF optimal schemes under perfect CSIT, such as aligned interference neutralization and network diagonalization, that are powerful in theory but too fragile to be practical, or studied robust achievable schemes like classical amplify/decode/compress-and-forward without claims of information-theoretic optimality. In contrast, under finite precision CSIT, we show that the benefits of fragile schemes are lost, while a combination of classical random coding schemes that are simpler and much more robust, namely a rate-splitting between decode-and-forward and amplify-and-forward, is shown to be GDoF optimal. As such, this work represents another step towards bridging the gap between theory (optimality) and practice (robustness) with the aid of Aligned-Images Sum-set Inequalities.

Robust and Adaptive Power Allocation Techniques for Rate Splitting Based MU-MIMO Systems

Rate splitting (RS) systems can better deal with imperfect channel state information at the transmitter (CSIT) than conventional approaches. However, this requires an appropriate power allocation that often has a high computational complexity, which might be inadequate for practical and large systems. To this end, adaptive power allocation techniques can provide good performance with low computational cost. This work presents novel robust and adaptive power allocation technique for RS-based multiuser multiple-input multiple-output (MU-MIMO) systems. In particular, we develop a robust adaptive power allocation based on stochastic gradient learning and the minimization of the mean-square error between the transmitted symbols of the RS system and the received signal. The proposed robust power allocation strategy incorporates knowledge of the variance of the channel errors to deal with imperfect CSIT and adjust power levels in the presence of uncertainty. An analysis of the convexity and stability of the proposed power allocation algorithms is provided, together with a study of their computational complexity and theoretical bounds relating the power allocation strategies. Numerical results show that the sum-rate of an RS system with adaptive power allocation outperforms RS and conventional MU-MIMO systems under imperfect CSIT.

The DoF region of two‐user MIMO broadcast channel with delayed imperfect‐quality CSIT

The channel state information at the transmitter (CSIT) play an important role in the performance of wireless networks. The CSIT model can be delayed and imperfect-quality, since the feedback link has a delay and the channel state information (CSI) feedback has distortion. In this paper, we thus characterize the degrees-of-freedom (DoF) region of the two-user multiple-input multiple-output (MIMO) broadcast channel with delayed imperfect-quality CSIT, where the antenna configurations can be arbitrary. The converse proof of DoF region is based on the enhancement of physically degraded channel. The achievability proof of DoF region is through a novel transmission scheme design, where the duration of each phase and the amount of transmitted symbols are configured based on the imperfect-quality of delayed CSIT. As a result, we show that the DoF region with delayed imperfect-quality CSIT is located between the DoF region with no CSIT and the DoF region with delayed CSIT.

Secure GDoF of the Z-Channel With Finite Precision CSIT: How Robust are Structured Codes?

Under the assumption of perfect channel state information at the transmitters (CSIT), it is known that structured codes offer significant advantages for secure communication in an interference network, e.g., structured jamming signals based on lattice codes may allow a receiver to decode the sum of the jamming signal and the signal being jammed, even though they cannot be separately resolved due to secrecy constraints, subtract the aggregate jammed signal, and then proceed to decode desired codewords at lower power levels. To what extent are such benefits of structured codes fundamentally limited by uncertainty in CSIT? To answer this question, we explore what is perhaps the simplest setting where the question presents itself -- a Z interference channel with secure communication. Using sum-set inequalities based on Aligned Images bounds we prove that the GDoF benefits of structured codes are lost completely under finite precision CSIT. The secure GDoF region of the Z interference channel is obtained as a byproduct of the analysis.

Rate-Splitting Multiple Access for Multigateway Multibeam Satellite Systems With Feeder Link Interference

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.

Blind interference alignment: A comprehensive survey

SummaryInterference is a crucial impairment for trustworthy wireless communication. To overcome this interference problem, many interference management strategies have been established. Interference alignment (IA) is one such significant interference management approach that handles the positioning of signals so that they form an overlapping shadow at the unintended receivers; the desired interference‐free signals remain separable at the intended receivers. However, the need for global channel state information at the transmitter (CSIT) acts as a practical limitation for IA in the real‐world wireless communication system. IA can mitigate this limitation associated with channel state information with no CSIT, also termed as blind IA (BIA). Therefore, BIA is an interference management strategy that utilizes the concept of IA with no knowledge of CSIT. Therefore, based on the plethora of prevailing significant works, the objective of our paper is to provide a comprehensive survey to draw a picture of BIA in terms of network topologies, applications in different networks, trending research areas, degrees of freedom (DoF), open‐research problems, and future research directions.