Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2204.09958

RIS-Assisted Vehicular Network with Direct Transmission over Double-Generalized Gamma Fading Channels

Vinay Kumar Chapala·Arsalan Malik·S. M. Zafaruddin
View original source ↗Read source document ↗Export metadata ↓

Abstract

Reconfigurable intelligent surface (RIS) can provide stable connectivity for vehicular communications when direct transmission becomes significantly weaker with dynamic channel conditions between an access point and a moving vehicle. In this paper, we analyze the performance of a RIS-assisted vehicular network by coherently combining received signals reflected by RIS elements and direct transmissions from the source terminal over double generalized Gamma (dGG) fading channels. We present analytical expressions on the outage probability and average bit-error rate (BER) performance of the considered system by deriving exact density and distribution functions for the end-to-end signal-to-noise ratio (SNR) resulted from the finite sum of the direct link and product of channel coefficients each distributed according to the dGG. We also develop asymptotic analysis on the outage probability and average BER to derive diversity order for a better insight into the system performance at high SNR. We validate the derived analytical expressions through numerical and simulation results and demonstrate scaling of the system performance with RIS elements and a comparison to the conventional relaying techniques and direct transmissions considering various practically relevant scenarios.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vinay Kumar Chapala, Arsalan Malik, S. M. Zafaruddin. 2022-04-21. RIS-Assisted Vehicular Network with Direct Transmission over Double-Generalized Gamma Fading Channels. https://arxiv.org/abs/2204.09958

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↗