Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1611.02463

Single-Tap Precoders and Decoders for Multi-User MIMO FBMC-OQAM under Strong Channel Frequency Selectivity

François Rottenberg·Xavier Mestre·François Horlin·Jérôme Louveaux
View original source ↗Read source document ↗Export metadata ↓

Abstract

The design of linear precoders or decoders for multiuser (MU) multiple-input multiple-output (MIMO) filterbank multicarrier (FBMC) modulations in the case of strong channel frequency selectivity is presented. The users and the base station (BS) communicate using space division multiple access (SDMA). The low complexity proposed solution is based on a single tap per-subcarrier precoding/decoding matrix at the base station (BS) in the downlink/uplink. As opposed to classical approaches that assume flat channel frequency selectivity at the subcarrier level, the BS does not make this assumption and takes into account the distortion caused by channel frequency selectivity. The expression of the FBMC asymptotic mean squared error (MSE) in the case of strong channel selectivity derived in earlier works is developed and extended. The linear precoders and decoders are found by optimizing the MSE formula under two design criteria, namely zero forcing (ZF) or minimum mean squared error (MMSE). Finally, simulation results demonstrate the performance of the optimized design. As long as the number of BS antennas is larger than the number of users, it is shown that those extra degrees of freedom can be used to compensate for the channel frequency selectivity.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

François Rottenberg, Xavier Mestre, François Horlin, Jérôme Louveaux. 2016-11-08. Single-Tap Precoders and Decoders for Multi-User MIMO FBMC-OQAM under Strong Channel Frequency Selectivity. https://doi.org/10.1109/tsp.2016.2621722

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↗