Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.24180

RIS-Assisted D-MIMO for Energy-Efficient 6G Indoor Networks

Akshay Vayal Parambath·Jose Flordelis·Venkatesh Tentu·Charitha Madapatha·Fredrik Rusek·Erik Bengtsson·Tommy Svensson
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose an alternating optimization framework for maximizing energy efficiency (EE) in reconfigurable intelligent surface (RIS) assisted distributed MIMO (D-MIMO) systems under both coherent and non-coherent reception modes. The framework jointly optimizes access point (AP) power allocation and RIS phase configurations to improve EE under per-AP power and signal-to-interference-plus-noise ratio (SINR) constraints. Using majorization-minimization for power allocation together with per-element RIS adaptation, the framework achieves tractable optimization of this non-convex problem. Simulation results for indoor deployments with realistic power-consumption models show that the proposed scheme outperforms equal-power and random-scatterer baselines, with clear EE gains. We evaluate the performance of both reception modes and quantify the impact of RIS phase-shift optimization, RIS controller architectures (centralized vs. per-RIS control), and RIS size, providing design insights for practical RIS-assisted D-MIMO deployments in future 6G networks.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Akshay Vayal Parambath, Jose Flordelis, Venkatesh Tentu, Charitha Madapatha, Fredrik Rusek, Erik Bengtsson, Tommy Svensson. 2026-03-25. RIS-Assisted D-MIMO for Energy-Efficient 6G Indoor Networks. https://arxiv.org/abs/2603.24180

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗