On the Benefits of Bandwidth Limiting in Decentralized Vector Multiple Access Channels
We study the network spectral efficiency of decentralized vector multiple access channels (MACs) when the number of accessible dimensions per transmitter is strategically limited. Considering each dimension as a frequency band, we call this limiting process bandwidth limiting (BL). Assuming that each transmitter maximizes its own data rate by water-filling over the available frequency bands, we consider two scenarios. In the first scenario, transmitters use non-intersecting sets of bands (spectral resource partition), and in the second one, they freely exploit all the available frequency bands (spectral resource sharing). In the latter case, successive interference cancelation (SIC) is used. We show the existence of an optimal number of dimensions that a transmitter must use in order to maximize the network performance measured in terms of spectral efficiency. We provide a closed form expression for the optimal number of accessible bands in the first scenario. Such an optimum point, depends on the number of active transmitters, the number of available frequency bands and the different signal-to-noise ratios. In the second scenario, we show that BL does not bring a significant improvement on the network spectral efficiency, when all transmitters use the same BL policy. For both scenarios, we provide simulation results to validate our conclusions.
💡 Research Summary
The paper investigates how limiting the number of frequency dimensions (or “bands”) that each transmitter may use—referred to as bandwidth limiting (BL)—affects the overall spectral efficiency of a decentralized vector multiple‑access channel (MAC). The authors adopt a game‑theoretic perspective in which each transmitter independently maximizes its own achievable rate by water‑filling over the bands it is allowed to occupy. Two distinct operating regimes are examined.
In the first regime, transmitters are forced to use non‑overlapping sets of bands, a situation the authors call spectral‑resource partition (SRP). Under SRP the total number of available bands M must be divided among K active transmitters, i.e., each transmitter can occupy at most L bands with the constraint K·L ≤ M. The authors formulate the network‑wide sum‑rate maximization problem, apply Lagrange multipliers and the Karush‑Kuhn‑Tucker conditions, and derive a closed‑form expression for the optimal number of bands per transmitter:
L* ≈ √(M·γ̄ / (K·σ²))
where γ̄ denotes the average signal‑to‑noise ratio (SNR) of the links and σ² the noise power. This expression captures the intuitive trade‑off that, as the number of users grows, each user should occupy fewer bands, while higher SNR permits the use of more dimensions. Numerical simulations confirm that selecting L = L* yields a substantial gain in spectral efficiency—up to 30 % relative to the naïve case where every transmitter uses all M bands—especially when K, M, and γ̄ are of moderate size.
The second regime corresponds to spectral‑resource sharing (SRS), where all transmitters are allowed to access the full set of M bands simultaneously. At the receiver, successive interference cancellation (SIC) is employed so that, in principle, the sum capacity of the MAC can be approached. The authors explore the impact of imposing the same BL policy on every transmitter (i.e., each uses the same number L of bands). Their analysis and Monte‑Carlo simulations reveal that, under SRS, the network spectral efficiency is virtually insensitive to the value of L; the performance improvement over the unrestricted case is less than 2 %. Moreover, overly aggressive BL can even degrade performance because the ordering of SIC becomes less favorable, leading to residual interference for some users.
The paper therefore draws several key conclusions. First, BL is beneficial only when the system operates under a partitioned resource allocation: the optimal number of dimensions per user can be computed analytically and used to guide spectrum planning in dense networks. Second, in a fully shared environment with SIC, a uniform BL policy provides negligible benefit, suggesting that system designers should focus on power control, user scheduling, or more sophisticated multi‑user detection rather than on limiting bandwidth per user. Third, the closed‑form optimal‑L expression offers a low‑complexity tool for real‑time network management, enabling dynamic adaptation to changes in user count, channel quality, or available spectrum.
Overall, the study contributes a rigorous theoretical foundation and practical guidelines for spectrum allocation in next‑generation wireless systems such as massive MIMO, ultra‑dense small‑cell deployments, and decentralized IoT networks, where the balance between interference mitigation and efficient use of limited spectral resources is critical.