Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1912.06917

Dynamic Metasurface Antennas for MIMO-OFDM Receivers with Bit-Limited ADCs

Hanqing Wang·Nir Shlezinger·Yonina C. Eldar·Shi Jin·Mohammadreza F. Imani·Insang Yoo·David R. Smith
View original source ↗Read source document ↗Export metadata ↓

Abstract

The combination of orthogonal frequency modulation (OFDM) and multiple-input multiple-output (MIMO) systems plays an important role in modern communication systems. In order to meet the growing throughput demands, future MIMO-OFDM receivers are expected to utilize a massive number of antennas, operate in dynamic environments, and explore high frequency bands, while satisfying strict constraints in terms of cost, power, and size. An emerging technology to realize massive MIMO receivers of reduced cost and power consumption is based on dynamic metasurface antennas (DMAs), which inherently implement controllable compression in acquisition. In this work we study the application of DMAs for MIMO-OFDM receivers operating with bit-constrained analog-to-digital converters (ADCs). We present a model for DMAs which accounts for the configurable frequency selective profile of its metamaterial elements, resulting in a spectrally flexible hybrid structure. We then exploit previous results in task-based quantization to show how DMAs can be configured to improve recovery in the presence of constrained ADCs, and propose methods for adjusting the DMA parameters based on channel state information. Our numerical results demonstrate that the DMA-based receiver is capable of accurately recovering OFDM signals. In particular, we show that by properly exploiting the spectral diversity of DMAs, notable performance gains are obtained over existing designs of conventional hybrid architectures, demonstrating the potential of DMAs for MIMO-OFDM setups in realizing high performance massive antenna arrays of reduced cost and power consumption.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hanqing Wang, Nir Shlezinger, Yonina C. Eldar, Shi Jin, Mohammadreza F. Imani, Insang Yoo, David R. Smith. 2019-12-14. Dynamic Metasurface Antennas for MIMO-OFDM Receivers with Bit-Limited ADCs. https://arxiv.org/abs/1912.06917

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↗