The evolution of massive multiple-input multiple-output (MIMO), such as holographic MIMO and reconfigurable intelligent surface (RIS), is one of the hottest topics in the sixth generation (6G) mobile communication systems. In this area, the network node may be equipped with much more antenna elements and/or transmit-receive units (TxRUs) than its presence in current deployment. To obtain accurate channel estimation for these nodes, using high-density pilot may result in tremendous downlink overhead, so pilot reduction is a key area to investigate. In this work, we design a low-density frequency-aware antenna selection pattern and a transformer (TF)-based channel estimator that is deployed at the user equipment (UE) side to recover the channel. Compared to the two-sided model where the pilot transmission is based on a neural network (NN) that is jointly optimized with the UE side channel estimator, the proposed design is more convenient for practical implementation. The simulation results suggest that our proposed pattern can achieve similar channel estimation performance as the two-sided model and can save 50% pilot overhead compared to the conventional method. Moreover, we demonstrate that our proposed design is robust against different antenna selection patterns.

Recently, the Degrees-of-Freedom (DoFs) region of multiple-input-single-output (MISO) networks with imperfect channel state information at the transmitter (CSIT) has attracted significant attention. An achievable scheme, known as rate-splitting (RS), integrates common-message-multicasting and private-message-unicasting. In this paper, focusing on the general K-cell MISO IC with an arbitrary CSIT quality of each interfering link, we first identify the DoF region achieved by RS. Second, we introduce a novel scheme, so called topological RS (TRS), whose novelties compared with RS lie in a multi-layer structure and in transmitting multiple common messages to be decoded by groups of users rather than all users. The design of TRS is motivated by a novel interpretation of the K-cell IC with imperfect CSIT as a weighted sum of a series of partially connected networks. We show that the DoF region achieved by TRS yields the best known result so far, and we find the maximal sum DoF via hypergraph fractional packing. Finally, for a realistic scenario where each user is connected to three dominant transmitters, we identify the sufficient condition where TRS strictly outperforms conventional schemes, and show that TRS is optimal for some CSIT qualities.

We focus on a two-receiver multiple-input-multiple-output (MIMO), broadcast channel (BC), and interference channel (IC) with an arbitrary number of antennas at each node. We assume an imperfect knowledge of local channel state information at the transmitters, whose error decays with the signal-to-noise-ratio. With such configuration, we characterize the achievable degrees-of-freedom (DoF) regions in both BC and IC, by proposing a rate-splitting (RS) approach, which divides each receiver's message into a common part and a private part. Compared with the RS scheme designed for the symmetric MIMO case, the novelties of the proposed block lie in: 1) delivering additional non-ZF-precoded private symbols to the receiver with the greater number of antennas and 2) a space-time implementation. These features provide more flexibilities in balancing the common-message-decodabilities at the two receivers, and fully exploit asymmetric antenna arrays. Besides, in IC, we modify the power allocation designed for the asymmetric BC based on the signal space, where the two transmitted signals interfere with each other. We also derive an outer-bound for the DoF regions and show that the proposed achievable DoF regions are optimal under some antenna configurations and channel state information at the transmitter side qualities.

This paper considers a K-user multiple-input multiple-output (MIMO) interference channel (IC) where 1) the channel state information obtained by the transmitters (CSIT) is completely outdated and 2) the number of transmit antennas at each transmitter, i.e., M is greater than the number of receive antennas at each user, i.e., N. The usefulness of the delayed CSIT was first identified in a K-phase retrospective interference alignment (RIA) scheme proposed by Maddah-Ali and Tse for the multiple-input single-output broadcast channel, but the extension to the MIMO IC is a non-trivial step as each transmitter only has the message intended for the corresponding user. Recently, Abdoli et al. focused on a single-input single-output IC and solved such bottleneck by inventing a K-phase RIA with distributed overheard interference retransmission. In this paper, we propose two K-phase RIA schemes suitable for the MIMO IC by generalizing and integrating some key features of both Abdoli's and Maddah-Ali's works. The two schemes jointly yield the best known sum degrees-of-freedom (DoF) performance so far. For the case (M/N)≥K, the achieved sum DoF is asymptotically given by (64/15)N when K→∞.

We consider a K-user multiple-input singleoutput (MISO) broadcast channel (BC) where the channel state information (CSI) of user i(i = 1,2, .. ., K) may be instantaneously perfect (P), delayed (D), or not known (N) at the transmitter with probabilities λPi, λDi, and λNi, respectively. In this setting, according to the three possible CSI at the transmitter (CSIT) for each user, knowledge of the joint CSIT of the K users could have at most 3K states. In this paper, given the marginal probabilities of CSIT (i.e., λPi, λDi, and λNi), we derive an outer bound for the degrees of freedom (DoF) region of the K-user MISO BC. Subsequently, we tighten this outer bound by considering a set of inequalities that capture some of the 3K states of the joint CSIT. One of the consequences of this set of inequalities is that for K ≥ 3, it is shown that the DoF region is not completely characterized by the marginal probabilities in contrast to the two-user case. Afterwards, the tightness of these bounds is investigated through the discussion on the achievability. Finally, a two user multiple-input multipleoutput BC having CSIT among P and N is considered in which an outer bound for the DoF region is provided, and it is shown that in some scenarios, it is tight.

This paper considers a K-user Multiple-Input-Single-Output (MISO) Interference Channel (IC), where the channel state information obtained by the transmitters (CSIT) is perfect, but completely outdated. A Retrospective Interference Alignment (RIA) using such delayed CSIT was proposed by Maddah-Ali et. al for the MISO Broadcast Channel (BC), but the extension to the MISO IC is a non-trivial step as each transmitter only has the message intended for the corresponding user. Recently, Abdoli et.al focused on a Single-Input-Single-Output (SISO) IC and solved such bottleneck by inventing a distributed higher order symbol generation. Our main work is to extend Abdoli's work to the MISO case by integrating some features of Maddah-Ali's scheme. The achieved sum Degrees-of-Freedom (DoF) performance is asymptotically given by 64/15 when K→∞, outperforming all the previously known results.

We consider a K-user multiple-input single-output (MISO) broadcast channel (BC) where the channel state information (CSI) of user i(i = 1, 2, ..., K) may be either instantaneously perfect (P), delayed (D) or not known (N) at the transmitter with probabilities λ P i , λ D i and λ N i , respectively. In this setting, according to the three possible CSIT for each user, knowledge of the joint CSIT of the K users could have at most 3 K states. Although the results by Tandon et al. show that for the symmetric two user MISO BC (i.e., λ Q i = λ Q , ∀ i ∈ {1, 2}, Q ∈ {P, D, N}), the Degrees of Freedom (DoF) region depends only on the marginal probabilities, we show that this interesting result does not hold in general when K ≥ 3. In other words, the DoF region is a function of all the joint probabilities. In this paper, given the marginal probabilities of CSIT, we derive an outer bound for the DoF region of the K-user MISO BC. Subsequently, we investigate the achievability of the outer bound in some scenarios. Finally, we show the dependence of the DoF region on the joint probabilities.

To enhance the multiplexing gain of two-receiver Multiple-Input-Single-Output Broadcast Channel with imperfect channel state information at the transmitter (CSIT), a class of Rate-Splitting (RS) approaches has been proposed recently, which divides one receiver's message into a common and a private part, and superposes the common message on top of Zero-Forcing precoded private messages. In this paper, with quantized CSIT, we study the ergodic sum rate of two schemes, namely RS-S and RS-ST, where the common message(s) are transmitted via a space and space-time design, respectively. Firstly, we upper-bound the sum rate loss incurred by each scheme relative to Zero-Forcing Beamforming (ZFBF) with perfect CSIT. Secondly, we show that, to maintain a constant sum rate loss, RS-S scheme enables a feedback overhead reduction over ZFBF with quantized CSIT. Such reduction scales logarithmically with the constant rate loss at high Signal-to-Noise-Ratio (SNR). We also find that, compared to RS-S scheme, RS-ST scheme offers a further feedback overhead reduction that scales with the discrepancy between the feedback overhead employed by the two receivers when there are alternating receiver-specific feedback qualities. Finally, simulation results show that both schemes offer a significant SNR gain over conventional single-user/multiuser mode switching when the feedback overhead is fixed.

Since Maddah-Ali and Tse showed that the completely stale transmitter-side channel state information (CSIT) still benefits the Degrees of Freedom (DoF) of the Multiple-Input-Multiple-Output (MISO) Broadcast Channel (BC), there has been much interest in the academic literature to investigate the impact of imperfect CSIT on DoF region of time correlated broadcast channel. Even though the research focus has been on time correlated channels so far, a similar but different problem concerns the frequency correlated channels. Indeed, the imperfect CSIT also impacts the DoF region of frequency correlated channels, as exemplified by current multi-carrier wireless systems. This contribution, for the first time in the literature, investigates a general frequency correlated setting where a two-antenna transmitter has imperfect knowledge of CSI of two single-antenna users on two adjacent subbands. A new scheme is derived as an integration of Zero-Forcing Beamforming (ZFBF) and the scheme proposed by Maddah-Ali and Tse. The achievable DoF region resulted by this scheme is expressed as a function of the qualities of CSIT.

In this contribution, we focus on a frequency domain two-user Multiple-Input-Single-Output Broadcast Channel (MISO BC) where the transmitter has imperfect and (un)matched Channel State Information (CSI) of the two users in two subbands. We provide an upper-bound to the Degrees-of-Freedom (DoF) region, which is tight compared to the state of the art. By decomposing the subbands into subchannels according to the CSI feedback qualities, we interpret the DoF region as the weighted-sum of that in each subchannel. Moreover, we study the sum DoF loss when employing sub-optimal schemes, namely Frequency Division Multiple Access (FDMA), Zero-Forcing Beamforming (ZFBF) and the S33/2scheme proposed by Tandon et al. The results show that by switching among the sub-optimal strategies, we can obtain at least 80% and 66.7% of the optimal sum DoF performance for the unmatched and matched CSIT scenario respectively.

In this paper, a joint channel-and-queue-aware relay selection and resource allocation scheme at the scheduling phase in an OFDMA downlink cellular network is proposed. The scheme can choose the best relay to cooperate and allocate subchannels and power for the source and the relay for the selected packet which can maximize the proposed utility function waiting in the base station. Under the premise of satisfying the QoS requirement of the waiting service flow, the utility function consists of the overall power consumption of a packet when it is transmitted between base station to relay station and the relay station to destination and the queue's state. Furthermore, adaptive modulation and coding (AMC) is utilized as a result that the base station and relay station can allocate different power to achieve different bit rates and an ON-OFF model is used to form the traffic model. At the end of this paper, the detailed design and realization of our simulation is presented, and the numerical analysis is done to prove the strength of our proposed scheme.

Distributed and efficient relay selection and resource allocation are critical for large scale cooperative communication networks. To stimulate a potential relay station to cooperate with the source, a bargaining based relay selection and power allocation (BBRSPA) scheme is proposed. In this paper, Rubinstein-Stahl bargaining game is introduced to provide a possible solution to share the increased benefits, which are obtained at a source when a potential relay joins to help transmit its signals. In this scheme, both a source and a relay calculate the patience factor according to the change in its own service utility. By exchanging the patience factor, a source selects the relay which can provide the maximal extra utility for itself, the corresponding optimal power the chosen relay should allocate is also determined. Furthermore, if the chosen relay could get more utilities from cooperation, it will have incentive to do so. Moreover, the simulation results show the strength of our proposed scheme and prove that our BBRSPA scheme can achieve comparable performance to that employing centralized scheme.