An official website of the United States government
When the users in a MIMO broadcast channel experience different spatial transmit correlation matrices, a class of gains is produced that is denoted transmit correlation diversity. This idea was conceived for channels in which transmit correlation matrices have mutually exclusive eigenspaces, allowing non-interfering training and transmission. This paper broadens the scope of transmit correlation diversity to the case of partially and fully overlapping eigenspaces and introduces techniques to harvest these generalized gains. For the two-user MIMO broadcast channel, we derive achievable degrees of freedom (DoF) and achievable rate regions with/without channel state information at the receiver (CSIR). When CSIR is available, the proposed achievable DoF region is tight in some configurations of the number of receive antennas and the channel correlation ranks. We then extend the DoF results to the K-user case by analyzing the interference graph that characterizes the overlapping structure of the eigenspaces. Our achievability results employ a combination of product superposition in the common part of the eigenspaces, and pre-beamforming (rate splitting) to create multiple data streams in non-overlapping parts of the eigenspaces. Massive MIMO is a natural example in which spatially correlated link gains are likely to occur. We study the achievable downlink sum rate for a frequency-division duplex massive MIMO system under transmit correlation diversity.
more »
« less
On energy-delay tradeoff in uncoordinated MAC
Polyanskiy [1] proposed a framework for the MAC problem with a large number of users, where users employ a common codebook in the finite blocklength regime. In this work, we extend [1] to the case when the number of active users is random and there is also a delay constraint. We first define a random-access channel and derive the general converse bound. Our bound captures the basic tradeoff between the required energy and the delay constraint. Then we propose an achievable bound for block transmission. In this case, all packets are transmitted in the second half of the block to avoid interference. We then study treating interference as noise (TIN) with both single user and multiple users. Last, we derive an achievable bound for the packet splitting model, which allows users to split each packet into two parts with different blocklengths. Our numerical results indicate that, when the delay is large, TIN is effective; on the other hand, packet splitting outperforms as the delay decreases.
more »
« less
- Award ID(s):
- 1923803
- PAR ID:
- 10450265
- Date Published:
- Journal Name:
- Proc. 2023 Allterton conference
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We consider the problem of detecting the active wireless stations among a very large population. This problem is highly relevant in applications involving passive and active RFID tags and dense IoT settings. The state of the art mainly utilizes interference avoiding (e.g., CSMA-based) approaches with the objective of identifying one station at a time. We first derive basic limits of the achievable delay with interference avoiding paradigm. Then, we consider the setting in which each station is assigned a signature sequence, picked at random from a specific alphabet and active stations transmit their signatures simultaneously upon activation. The challenge at the detector is to detect all active stations from the combined signature signal with low probability of misdetection and false positives. We show that, such an interference embracing approach can substantially reduce the detection delay, at an arbitrarily low probability of both types of detection errors, as the number of stations scale. We show that, under a randomized activation model the collision embracing detection scheme achieves Theta(log^2(n)/log(log(n))) delay while the expected delay of existing CSMA schemes are Omega(log^2(n)) for a population of n stations. Finally, we discuss large-scale implementation issues such as the design of low-complexity detection schemes and present numerical investigations.more » « less
-
Joint communications and sensing (JCAS) is envisioned as a key feature in future wireless communications networks. In massive MIMO-JCAS systems, the very large number of antennas causes excessively high computational complexity in beamforming designs. In this work, we investigate a low-complexity massive multiple-input-multiple-output (MIMO)-JCAS system employing the maximum-ratio transmission (MRT) scheme for both communications and sensing. We first derive closed-form expressions for the achievable communications rate and Cram´er–Rao bound (CRB) as functions of the large-scale fading channel coefficients. Then, we develop a power allocation strategy based on successive convex approximation to maximize the communications sum rate while guaranteeing the CRB constraint and transmit power budget. Our analysis shows that the introduction of sensing functionality increases the beamforming uncertainty and inter-user interference on the communications side. However, these factors can be mitigated by deploying a very large number of antennas. The numerical results verify our findings and demonstrate the power allocation efficiency.more » « less
-
null (Ed.)The robust principles of treating interference as noise (TIN) when it is sufficiently weak, and avoiding it when it is not, form the background of this work. Combining TIN with the topological interference management (TIM) framework that identifies optimal interference avoidance schemes, we formulate a TIM-TIN problem for multilevel topological interference management, wherein only a coarse knowledge of channel strengths and no knowledge of channel phases is available to transmitters. To address the TIM-TIN problem, we first propose an analytical baseline approach, which decomposes a network into TIN and TIM components, allocates the signal power levels to each user in the TIN component, allocates signal vector space dimensions to each user in the TIM component, and guarantees that the product of the two is an achievable number of signal dimensions available to each user in the original network. Next, a distributed numerical algorithm called ZEST is developed. The convergence of the algorithm is demonstrated, leading to the duality of the TIM-TIN problem in terms of generalized degrees-of-freedom (GDoF). Numerical results are also provided to demonstrate the superior sum-rate performance and fast convergence of ZEST.more » « less
-
With the rapid growth of Internet of Things (IoT) applications in recent years, there is a strong need for wireless uplink scheduling algorithms that determine when and which subset of a large number of users should transmit to the central controller. Different from the downlink case, the central controller in the uplink scenario typically has very limited information about the users. On the other hand, collecting all such information from a large number of users typically incurs a prohibitively high communication overhead. This motivates us to investigate the development of an efficient and low-overhead uplink scheduling algorithm that is suitable for large-scale IoT applications with limited amount of coordination from the central controller. Specifically, we first characterize a capacity outer bound subject to the sampling constraint where only a small subset of users are allowed to use control channels for system state reporting and wireless channel probing. Next, we relax the sampling constraint and propose a joint sampling and transmission algorithm, which utilizes full knowledge of channel state distributions and instantaneous queue lengths to achieve the capacity outer bound. The insights obtained from this capacity-achieving algorithm allow us to develop an efficient and low-overhead scheduling algorithm that can strictly satisfy the sampling constraint with asymptotically diminishing throughput loss. Moreover, the throughput performance of our proposed algorithm is independent of the number of users, a highly desirable property in large-scale IoT systems. Finally, we perform extensive simulations to validate our theoretical results.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- The DOI is not currently available.
