Searcharxiv⌕ Search

arXiv subjects

Alexander Fish

Publications and source records attributed to Alexander Fish.

46 records · Page 3Linked to original sources

The Incidence and Cross Methods for Efficient Radar Detection

The designation of the radar system is to detect the position and velocity of targets around us. The radar transmits a waveform, which is reflected back from the targets, and echo waveform is received. In a commonly used model, the echo is a sum of a superposition of several delay-Doppler shifts of the transmitted waveform, and a noise component. The delay and Doppler parameters encode, respectively, the distances, and relative velocities, between the targets and the radar. Using standard digital-to-analog and sampling techniques, the estimation task of the delay-Doppler parameters, which involves waveforms, is reduced to a problem for complex sequences of finite length N. In these notes we introduce the Incidence and Cross methods for radar detection. One of their advantages, is robustness to inhomogeneous radar scene, i.e., for sensing small targets in the vicinity of large objects. The arithmetic complexity of the incidence and cross methods is O(NlogN + r^3) and O(NlogN + r^2), for r targets, respectively. In the case of noisy environment, these are the fastest radar detection techniques. Both methods employ chirp sequences, which are commonly used by radar systems, and hence are attractive for real world applications.

cs.IT↗

Delay-Doppler Channel Estimation with Almost Linear Complexity

A fundamental task in wireless communication is Channel Estimation: Compute the channel parameters a signal undergoes while traveling from a transmitter to a receiver. In the case of delay-Doppler channel, a widely used method is the Matched Filter algorithm. It uses a pseudo-random sequence of length N, and, in case of non-trivial relative velocity between transmitter and receiver, its computational complexity is O(N^{2}log(N)). In this paper we introduce a novel approach of designing sequences that allow faster channel estimation. Using group representation techniques we construct sequences, which enable us to introduce a new algorithm, called the flag method, that significantly improves the matched filter algorithm. The flag method finds the channel parameters in O(mNlog(N)) operations, for channel of sparsity m. We discuss applications of the flag method to GPS, radar system, and mobile communication as well.

cs.IT↗

Computing the Matched Filter in Linear Time

A fundamental problem in wireless communication is the time-frequency shift (TFS) problem: Find the time-frequency shift of a signal in a noisy environment. The shift is the result of time asynchronization of a sender with a receiver, and of non-zero speed of a sender with respect to a receiver. A classical solution of a discrete analog of the TFS problem is called the matched filter algorithm. It uses a pseudo-random waveform S(t) of the length p, and its arithmetic complexity is O(p^{2} \cdot log (p)), using fast Fourier transform. In these notes we introduce a novel approach of designing new waveforms that allow faster matched filter algorithm. We use techniques from group representation theory to design waveforms S(t), which enable us to introduce two fast matched filter (FMF) algorithms, called the flag algorithm, and the cross algorithm. These methods solve the TFS problem in O(p\cdot log (p)) operations. We discuss applications of the algorithms to mobile communication, GPS, and radar.

cs.IT↗

Solvability of linear equations within weak mixing sets

We introduce a new class of "random" subsets of natural numbers, WM sets. This class contains normal sets (sets whose characteristic function is a normal binary sequence). We establish necessary and sufficient conditions for solvability of systems of linear equations within every WM set and within every normal set. We also show that partition-regular system of linear equations with integer coefficients is solvable in any WM set.

math.CO↗

Sumset Phenomenon in Countable Amenable Groups

Jin proved that whenever $A$ and $B$ are sets of positive upper density in $\Z$, $A+B$ is piecewise syndetic. Jin's theorem was subsequently generalized by Jin and Keisler to a certain family of abelian groups, which in particular contains $\Z^d$. Answering a question of Jin and Keisler, we show that this result can be extended to countable amenable groups. Moreover we establish that such sumsets (or -- depending on the notation -- "productsets") are piecewise Bohr, a result which for $G=\Z$ was proved by Bergelson, Furstenberg and Weiss. In the case of an abelian group $G$, we show that a set is piecewise Bohr if and only if it contains a sumset of two sets of positive upper Banach density.

math.DS↗

Continuous Measures on Homogenous Spaces

In this paper we generalize Wiener's characterization of continuous measures to compact homogenous manifolds. In particular, we give necessary and sufficient conditions on probability measures on compact semisimple Lie groups and nilmanifolds to be continuous. The methods use only simple properties of heat kernels.

math.DS↗

Equidistribution of Dilations of Polynomial Curves in Nilmanifolds

In this paper we study the asymptotic behaviour under dilations of probability measures supported on polynomial curves in nilmanifolds. We prove, under some mild conditions, effective equidistribution of such measures to the Haar measure. We also formulate a mean ergodic theorem for $\R^n$-representations on Hilbert spaces, restricted to a moving phase of low dimension. Furthermore, we bound the necessary dilation of a given smooth curve in $ \R^n$ so that the canonical projection onto $ \T^n $ is $ \eps$-dense.

math.DS↗

Solvability of Rado systems in D-sets

Rado's Theorem characterizes the systems of homogenous linear equations having the property that for any finite partition of the positive integers one cell contains a solution to these equations. Furstenberg and Weiss proved that solutions to those systems can in fact be found in every central set. (Since one cell of any finite partition is central, this generalizes Rado's Theorem.) We show that the same holds true for the larger class of $D$-sets. Moreover we will see that the conclusion of Furstenberg's Central Sets Theorem is true for all sets in this class.

math.DS↗

Liouville Random functions and normal sets

We define a random Liouville function (λ_Q) which depends on a random set (Q) of primes and prove that (A_Q = \{n \in \mathbb{N} | λ_Q(n) = -1 \}) is normal almost everywhere. This fact enables us to generate a family of normal sets such that the equation (xy =z) is not solvable inside them. Additionally we prove that equations (xy=z^2, x^2 + y^2 = square, x^2 - y^2 = square) are solvable in any normal set and for any equation (xy=cn^2) ((c > 1 ), is not a square) there exists a normal set (A_c) such that the equation is not solvable inside (A_c).

math.NT↗