1) The document proposes a new technique for estimating the distance between two wireless nodes without exchanging time stamps. It models the measurement errors as the sum of a uniform and Gaussian distribution to account for clock imperfections.
2) An approximate maximum likelihood estimator (AMLE) is derived but poses a difficult optimization problem. Alternatively, a simple estimator is proposed based on the method of moments that uses statistics of the measurements.
3) Numerical simulations show the proposed technique has a considerable gain in accuracy compared to traditional and counter-based approaches, especially at high signal-to-noise ratios, and its estimates converge close to the theoretical value with sufficient measurement samples.
How to Use KENPAVE Software to find out the tensile and radial stresses acting due to wheel load.
KENPAVE Software used to analyse pavement design to check whether pavement is failed in Rutting or Fatigue due to repetitive cycles of loading.
Computing f-Divergences and Distances of\\ High-Dimensional Probability Densi...Alexander Litvinenko
Talk presented on SIAM IS 2022 conference.
Very often, in the course of uncertainty quantification tasks or
data analysis, one has to deal with high-dimensional random variables (RVs)
(with values in $\Rd$). Just like any other RV,
a high-dimensional RV can be described by its probability density (\pdf) and/or
by the corresponding probability characteristic functions (\pcf),
or a more general representation as
a function of other, known, random variables.
Here the interest is mainly to compute characterisations like the entropy, the Kullback-Leibler, or more general
$f$-divergences. These are all computed from the \pdf, which is often not available directly,
and it is a computational challenge to even represent it in a numerically
feasible fashion in case the dimension $d$ is even moderately large. It
is an even stronger numerical challenge to then actually compute said characterisations
in the high-dimensional case.
In this regard, in order to achieve a computationally feasible task, we propose
to approximate density by a low-rank tensor.
Signals and Systems is an introduction to analog and digital signal processing, a topic that forms an integral part of engineering systems in many diverse areas, including seismic data processing, communications, speech processing, image processing, defense electronics, consumer electronics, and consumer products.
How to Use KENPAVE Software to find out the tensile and radial stresses acting due to wheel load.
KENPAVE Software used to analyse pavement design to check whether pavement is failed in Rutting or Fatigue due to repetitive cycles of loading.
Computing f-Divergences and Distances of\\ High-Dimensional Probability Densi...Alexander Litvinenko
Talk presented on SIAM IS 2022 conference.
Very often, in the course of uncertainty quantification tasks or
data analysis, one has to deal with high-dimensional random variables (RVs)
(with values in $\Rd$). Just like any other RV,
a high-dimensional RV can be described by its probability density (\pdf) and/or
by the corresponding probability characteristic functions (\pcf),
or a more general representation as
a function of other, known, random variables.
Here the interest is mainly to compute characterisations like the entropy, the Kullback-Leibler, or more general
$f$-divergences. These are all computed from the \pdf, which is often not available directly,
and it is a computational challenge to even represent it in a numerically
feasible fashion in case the dimension $d$ is even moderately large. It
is an even stronger numerical challenge to then actually compute said characterisations
in the high-dimensional case.
In this regard, in order to achieve a computationally feasible task, we propose
to approximate density by a low-rank tensor.
Signals and Systems is an introduction to analog and digital signal processing, a topic that forms an integral part of engineering systems in many diverse areas, including seismic data processing, communications, speech processing, image processing, defense electronics, consumer electronics, and consumer products.
Low rank tensor approximation of probability density and characteristic funct...Alexander Litvinenko
Very often one has to deal with high-dimensional random variables (RVs). A high-dimensional RV can be described by its probability density (\pdf) and/or by the corresponding probability characteristic functions (\pcf), or by a function representation. Here the interest is mainly to compute characterisations like the entropy, or
relations between two distributions, like their Kullback-Leibler divergence, or more general measures such as $f$-divergences,
among others. These are all computed from the \pdf, which is often not available directly, and it is a computational challenge to even represent it in a numerically feasible fashion in case the dimension $d$ is even moderately large. It is an even stronger numerical challenge to then actually compute said characterisations in the high-dimensional case.
In this regard, in order to achieve a computationally feasible task, we propose to represent the density by a high order tensor product, and approximate this in a low-rank format.
Kyeong Soo Kim, Invited talk, 2016 International Conference on Internet of Things and 5G Mobile Technologies (2016 ICIOT-5GMT), Guangzhou University, Guangzhou, Nov. 27-28, 2016.
Joint blind calibration and time-delay estimation for multiband rangingTarik Kazaz
In this presentation, we focus on the problem of blind joint calibration of multiband transceivers and time-delay (TD) estimation of multipath channels. We show that this problem can be formulated as a particular case of covariance matching. Although this problem is severely ill-posed, prior information about radio-frequency chain distortions and multipath channel sparsity is used for regularization. This approach leads to a biconvex optimization problem, which is formulated as a rank-constrained linear system and solved by a simple group Lasso algorithm.
% This method is general and can be also applied for calibration of sensors arrays and in direction of arrival estimation.
Numerical experiments show that the proposed algorithm provides better calibration and higher resolution for TD estimation than current state-of-the-art methods.
Response Surface in Tensor Train format for Uncertainty QuantificationAlexander Litvinenko
We apply low-rank Tensor Train format to solve PDEs with uncertain coefficients. First, we approximate uncertain permeability coefficient in TT format, then the operator and then apply iterations to solve stochastic Galerkin system.
Cyclostationary analysis of polytime coded signals for lpi radarseSAT Journals
Abstract In Radars, an electromagnetic waveform will be sent, and an echo of the same signal will be received by the receiver. From this received signal, by extracting various parameters such as round trip delay, doppler frequency it is possible to find distance, speed, altitude, etc. However, nowadays as the technology increases, intruders are intercepting transmitted signal as it reaches them, and they will be extracting the characteristics and trying to modify them. So there is a need to develop a system whose signal cannot be identified by no cooperative intercept receivers. That is why LPI radars came into existence. In this paper a brief discussion on LPI radar and its modulation (Polytime code (PT1)), detection (Cyclostationary (DFSM & FAM) techniques such as DFSM, FAM are presented and compared with respect to computational complexity.
Keywords—LPI Radar, Polytime codes, Cyclostationary DFSM, and FAM
ABSTRACT: In this paper, we proposed a new identification algorithm based on Kolmogorov–Zurbenko Periodogram (KZP) to separate motions in spatial motion image data. The concept of directional periodogram is utilized to sample the wave field and collect information of motion scales and directions. KZ Periodogram enables us detecting precise dominate frequency information of spatial waves covered by highly background noises. The computation of directional periodogram filters out most of the noise effects, and the procedure is robust for missing and fraud spikes caused by noise and measurement errors. This design is critical for the closure-based clustering method to find cluster structures of potential parameter solutions in the parameter space. An example based on simulation data is given to demonstrate the four steps in the procedure of this method. Related functions are implemented in our recent published R package {kzfs}.
Time of arrival based localization in wireless sensor networks a non linear ...sipij
In this paper, we aim to obtain the location information of a sensor node deployed in a Wireless Sensor Network (WSN). Here, Time of Arrival based localization technique is considered. We calculate the position information of an unknown sensor node using the non- linear techniques. The performances of the techniques are compared with the Cramer Rao Lower bound (CRLB). Non-linear Least Squares and the Maximum Likelihood are the non-linear techniques that have been used to estimate the position of the unknown sensor node. Each of these non-linear techniques are iterative approaches, namely, Newton
Raphson estimate, Gauss Newton Estimate and the Steepest Descent estimate for comparison. Based on the
results of the simulation, the approaches have been compared. From the simulation study, Localization
based on Maximum Likelihood approach is having higher localization accuracy.
Blind separation of complex-valued satellite-AIS data for marine surveillance...IJECEIAES
In this paper, the problem of the blind separation of complex-valued Satellite-AIS data for marine surveillance is addressed. Due to the specific properties of the sources under consideration: they are cyclo-stationary signals with two close cyclic frequencies, we opt for spatial quadratic time-frequency domain methods. The use of an additional diversity, the time delay, is aimed at making it possible to undo the mixing of signals at the multi-sensor receiver. The suggested method involves three main stages. First, the spatial generalized mean Ambiguity function of the observations across the array is constructed. Second, in the Ambiguity plane, Delay-Doppler regions of high magnitude are determined and Delay-Doppler points of peaky values are selected. Third, the mixing matrix is estimated from these Delay-Doppler regions using our proposed non-unitary joint zero-(block) diagonalization algorithms as to perform separation.
Blind separation of complex-valued satellite-AIS data for marine surveillance...
Ranging
1. Ranging Without Time Stamps Exchanging
Mohammad Reza Gholami, Satyam Dwivedi, Magnus Jansson, and Peter H¨andel
ACCESS Linnaeus Centre, Department of Signal Processing,
KTH–Royal Institute of Technology, Stockholm, Sweden
Abstract
We investigate the range estimate between two wireless nodes without time stamps exchanging.
Considering practical aspects of oscillator clocks, we propose a new model for ranging in which
the measurement errors include the sum of two distributions, namely, uniform and Gaussian. We
then derive an approximate maximum likelihood estimator (AMLE), which poses a difficult global
optimization problem. To avoid the difficulty in solving the complex AMLE, we propose a simple
estimator based on the method of moments. Numerical results show a promising performance for
the proposed technique.
Introduction
• Wireless sensor networks: a significant growing technology in different areas
• Ranging based on (two-way time-of-arrival) TW-TOA by exchanging the time stamps
• Ranging based on TW-TOA is severely affected by an imperfect clock
• Affine function to model the local clock, parameterized by clock offset and clock
skew, the distance estimate between two nodes is mainly affected by an imperfect
clock skew
• In this study: no continuous clock reading, no communication during ranging
System Model
• TW-TOA between a master node equipped with a time-to-digital convertor (TDC)
and a slave node
• The clock of the slave node: Cs(t) = θ0 +wt, clock offset θ0, clock skew w = 1+ρ
• The relation between the clock skew and the oscillator frequency offset:
fs = fo ±∆ f +ξ(t),with the frequency of the slave node fs, nominal frequency fo,
offset ∆ f, perturbation ξ(t)
⇒Ts = 1
fo±∆f+ξ(t) ≈ To(1∓ρ)+ζ(t), ρ ∆ f/fo, ζ(t) = −ξ(t)/fo
• TW-TOA measurements: zk = d
c + TD
s
2 +nk, k = 1,...,N, nk ∼ N (0,σ2
)
c the speed of propagation, d the Euclidian distance between two nodes.
TD
s : processing delay in the slave node
nominal value for the delay TD
s = DT0 with D as an integer
• The total delay: TD
s = wDTo +εk with εk as a delay in detecting the signal presence.
The arrived signal at the slave node may be detected after εk.
• A natural way to model εk: εk ∼ U (0,wTo), for high SNRs, with high probability
time-of-arrival detection happens in the period that signal arrives.
• The ranging model: zk = d
c + wDTo
2 + εk
2 +nk, k = 1,...,N
Ranging Algorithms
1-Maximum Likelihood Estimator (MLE)
The measurements vector: z [z1,...,zN]T
. The pdf of z indexed:
pZ(z;θ) =
N
∏
k=1
wT0
x=0
pZk
(zk|x, θ)pεk
(x)dx =
N
∏
k=1
wT0
x=0
1
√
2πσwT0
exp −
(αk −x/2)2
2σ2
dx
with αk zk −d/c−wDT0/2 and θ [d,w,σ]. No closed-form expression for the
pZ(z;θ).
Using x
0 exp(−πt2
)dt ≈ 1
2 tanh 39x
2 − 111
2 arctan 35x
111 , an approximate MLE (AMLE):
maximize
σ; w; d
−N(wT0)+
N
∑
k=1
log tanh
39αk
2
√
2πσ
−
111
2
arctan(
35αk
111
√
2πσ
−tanh
39βk
2
√
2πσ
−
111
2
arctan(
35βk
111
√
2πσ
where βk = αk −wT0/2
• AMLE poses a difficult global optimization problem (Fig. 1)
40
45
50
55
60
0.9
1
1.1
1.2
−1500
−1000
−500
0
d
w
AMLEcostfunction
(a)
40
45
50
55
60
2
4
6
8
x 10
−9
−1200
−1000
−800
−600
−400
−200
0
d
σ
AMLEcostfunction
(b)
0.9
1
1.1
1.2
2
3
4
5
6
7
x 10
−9
−40
−35
−30
−25
−20
−15
wσ
AMLEcostfunction
(c)
Fig. 1. AMLE cost function for (a) d and w for fixed σ = 1/c, (b) d and σ for fixed w = 1.0001, and (c) w and σ for
fixed d = 50.
We now obtain the AMLE expression by solving an opti- where . Hence, an estimate of the
2-A Low Complexity Estimator Based on Method of Moment
Consider the relations between the unknown parameters and the following statistics:
µ1 Ezk =
d
c
+
D
2
+
1
4
wT0
µ2 E(zk − µ1)2
= σ2
+
(wT0)2
48
µ4 E(zk − µ1)4
= 3σ4
+σ2(wT0)2
8
+
(wT0)4
1280
The statistics µ1, µ2, and µ4 can be approximated by the means of ensemble averaging
µ1 ≈
∑N
k=1 zk
N
= S1, µ2 ≈
∑N
k=1(zk −S1)2
N
= S2, µ4 ≈
∑N
k=1(zk −S1)4
N
= S4.
From the statistics µ2 and µ3
a(wTo)4
= µ4 −3µ2
2
with a 1/1280−3/482
.
An estimate of the clock skew
w =
1
To
S4 −3S2
2
a
1/4
Alternatively, an estimate of the clock skew considering wK
= (1+ρ)K
≈ 1+Kρ,
w = 1+
aT4
o −S4 +3S2
2
4aT4
o
It can be shown that the estimator is asymptotically unbiased, i.e.,
E ˜w ≈ 1+ aT4
o −a(wT0)4
4aT4
o
≈ w, N ≫ 1
Estimates of the distance and the variance σ2
:
d = c S1 −
D
2
+
1
4
wT0
σ2
= S2 −
(wT0)2
48
Numerical Results & Conclusions
• Simulation parameters: the distance between a master and a slave node d = 30 [m]
f0 = 100 MHz, ρ = 0.0001 corresponding to 10 KHz frequency offset, D = 10
• Comparison between the proposed technique, traditional approach, and
counter-based technique
• TW-TOA measurements for 10 ms
• 1000 realizations of noise
0 0.5 1 1.5 2 2.5 3 3.5
x 10
−9
29.9
30
30.1
30.2
30.3
30.4
30.5
30.6
30.7
30.8
0.5 1 1.5 2
x 10
−9
30.75
30.7505
30.751
30.7515
Standard deviation of noise, σ
Meanofthedistanceestimate[m]
Proposed
Traditional
Counter-based
(a)
0 0.5 1 1.5 2 2.5 3 3.5
x 10
−9
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
Counter−based
Standard deviation of noise, σ
RMSE[m]
Proposed
Traditional
(b)
Fig. 2. Comparison between different approaches, (a) the
mean of distance estimate and (b) the RMSE of the esti-
mate.
• The proposed technique shows a
considerable gain, especially for
high SNRs
0 100 200 300 400 500
29.5
30
30.5
31
31.5
32
32.5
33
33.5
34
N
Ed[m]
Theoretical
Actual
Fig. 3. The mean of the distance estimate versus the num-
ber of samples N.
• After a sufficient number of
samples, e.g., 100 corresponding
to 1 micro second, the estimate is
very close to the theoretical value
Contact Information:
mohrg@kth.se