Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2010.00803

Ranging success probability of PPP distributed automotive radar in presence of generalized fading

Sudharsan Parthasarathy·Rakshith Jagannath
View original source ↗Read source document ↗Export metadata ↓

Abstract

In automotive radar applications, multiple radars are used in all vehicles for improving the imaging quality. However this causes radar-to-radar interference from neighbouring vehicles, thus reducing the imaging quality. One metric to measure the imaging quality is ranging success probability. The ranging success probability is the probability that a multiple radar system successfully detects an object at a given range, under certain operating conditions. In state-of-the-art literature, closed form expressions for ranging success probability have been derived assuming no fading in desired signal component. Similarly in literature, though distribution of fading in interferers is assumed to be arbitrary, closed form expression is derived only for no-fading assumption in interferers. As fading is always present in a wireless channel, we have derived ranging success probability assuming desired channel experiences the popular Rayleigh fading. And we have assumed generalized $κ$-$μ$ shadowed fading for interfering channels that generalizes many popular fading models such as Rayleigh, Rician, Nakagami-$m$, $κ$-$μ$ etc. The interferers are assumed to be located on points drawn from a Poisson point process distribution. We have also studied how the relationship between shadowing component and number of clusters can affect the impact of LOS component on ranging success probability.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sudharsan Parthasarathy, Rakshith Jagannath. 2020-10-02. Ranging success probability of PPP distributed automotive radar in presence of generalized fading. https://arxiv.org/abs/2010.00803

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↗