Search arXivSearch

arXiv · 2201.00122

A Relaxed Energy Function Based Analog Neural Network Approach to Target Localization in Distributed MIMO Radar

Abstract

Analog neural networks are highly effective to solve some optimization problems, and they have been used for target localization in distributed multiple-input multiple-output (MIMO) radar. In this work, we design a new relaxed energy function based neural network (RNFNN) for target localization in distributed MIMO radar. We start with the maximum likelihood (ML) target localization with a complicated objective function, which can be transformed to a tractable one with equality constraints by introducing some auxiliary variables. Different from the existing Lagrangian programming neural network (LPNN) methods, we further relax the optimization problem formulated for target localization, so that the Lagrangian multiplier terms are no longer needed, leading to a relaxed energy function with better convexity. Based on the relaxed energy function, a RNFNN is implemented with much simpler structure and faster convergence speed. Furthermore, the RNFNN method is extended to localization in the presence of transmitter and receiver location errors. It is shown that the performance of the proposed localization approach achieves the Cramér-Rao lower bound (CRLB) within a wider range of signal-to-noise ratios (SNRs). Extensive comparisons with the state-of-the-art approaches are provided, which demonstrate the advantages of the proposed approach in terms of performance improvement and computational complexity (or convergence speed).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaoyu Zhao, Jun Li, Qinghua Guo. 2022-10-19. A Relaxed Energy Function Based Analog Neural Network Approach to Target Localization in Distributed MIMO Radar. https://arxiv.org/abs/2201.00122

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

KEEP EXPLORING

Related papers

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

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

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