Search
Filters
total: 80
Search results for: CRAMER-RAO LOWER BOUND
-
On DoA estimation for rotating arrays using stochastic maximum likelihood approach
PublicationThe flexibility needed to construct DoA estimators that can be used with rotating arrays subject to rapid variations of the signal frequency is offered by the stochastic maximum likelihood approach. Using a combination of analytic methods and Monte Carlo simulations, we show that for low and moderate source correlations the stochastic maximum likelihood estimator that assumes noncorrelated sources has accuracy comparable to the...
-
Asynchronous Method of Simultaneous Object Position and Orientation Estimation with Two Transmitters
PublicationThis paper proposes an object location method for all types of applications, including the Internet of Things. The proposed method enables estimations of the position and orientation of an object on a plane or in space, especially during motion, by means of location signals transmitted simultaneously from two transmitters placed on the object at a known distance from each other. A mathematical analysis of the proposed method and...
-
Position and Orientation Estimation in Radio Network With Groups of Locally Synchronized Nodes
PublicationThis article presents a positioning system with groups of locally synchronized nodes. A mobile object is equipped with a group of several synchronized receivers that are able to measure the difference in the time of arrival of signals from reference transmitters. The reference transmitters are synchronized only in local groups, with no global synchronization between groups. It is assumed that the synchronous operation of transmitters...
-
Approximate Cramér–Rao bound on Doppler error in correlation-processing relatively narrowband noise radar
PublicationThe paper studies limitations on accuracy of Doppler estimation in continuous-wave noise radar with correlation processing. Second order properties of output of the correlation receiver are evaluated and an approximate Cram´er-Rao bound on errors of Doppler measurement is derived. The accuracy of Doppler measurements is found to be affected by the following factors: power spectral density of noise signal, frequency response of the...
-
Experimental evaluation of estimator mean square error curve for cognitive tracking radar
PublicationTo make decisions, cognitive radar must rely on predictions of its own performance. In the literature, these predictions are usually based on some form of Cram\'er-Rao lower bound. This approach is scientifically sound, but it also brings a possibility of the cognitive controller overestimating radar performance. It therefore makes sense to back theoretical predictions with careful experiments which will verify their applicability....
-
Sensor Position Estimation Method for IoT Using Mobile Reference Node
PublicationThe paper proposes an innovative method of locating objects for the Internet of Things (IoT). The proposed method allows the position of a fixed measuring sensor (MS) to be estimated using one mobile base station with a known position moving around the MS. The mathematical analysis of the method, and three algorithms — Newton’s (NA), gradient descent (GD) and genetic (GA) — for solving the system of non-linear positional equations...
-
Statistically efficient smoothing algorithm for time-varying frequency estimation
PublicationThe problem of extraction/elimination of a nonstationary sinusoidal signal from noisy measurements is considered. This problem is usually solved using adaptive notch filtering (ANF) algorithms. It is shown that the accuracy of frequency estimates can be significantly increased if the results obtained from ANF are backward-time filtered by an appropriately designed lowpass filter. The resulting adaptive notch smoothing (ANS) algorithm...
-
Metoda pomiarowa dla dwuczęstotliwościowej tomografii elektroimpedancyjnej.
PublicationW referacie przedstawiono technikę pomiaru prądu/napięcia sinusoidalnego zastosowaną w tomografie elektroimpedancyjnym (TEI). Prezentowany TEI, którego konstrukcja bazuje na układzie tzw. elektrody aktywnej, zaliczany jest do grupy systemów równoległo-szeregowych. Układ elektrody aktywnej umieszczony jest bezpośrednio przy elektrodzie. Identyfikacja parametrów mierzonego sygnału przemiennego następuje w układzie elektrody...
-
From the multiple frequency tracker to the multiple frequency smoother
PublicationThe problem of extraction/elimination of nonstationary sinusoidalsignals from noisy measurements is considered. This problem is usually solved using adaptive notch filtering (ANF)algorithms. It is shown that the accuracy of frequency estimates can be significantly increased if the results obtained from ANF are backward-time filtered by an appropriately designed lowpass filter. The resulting adaptive notch smoothing (ANS)algorithm...
-
Optimal and suboptimal algorithms for identification of time-varying systems with randomly drifting parameters
PublicationNoncausal estimation algorithms, which involve smoothing, can be used for off-line identification of nonstationary systems. Since smoothingis based on both past and future data, it offers increased accuracy compared to causal (tracking) estimation schemes, incorporating past data only. It is shown that efficient smoothing variants of the popular exponentially weighted least squares and Kalman filter-based parameter trackers can...
-
On the lower smoothing bound in identification of time-varying systems
PublicationIn certain applications of nonstationary system identification the model-based decisions can be postponed, i.e. executed with a delay. This allows one to incorporate in the identification process not only the currently available information, but also a number of ''future'' data points. The resulting estimation schemes, which involve smoothing, are not causal. Assuming that the infinite observation history is available, the paper...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
A lower bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
A lower bound on the double outer-independent domination number of a tree
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
TDOA versus ATDOA for wide area multilateration system
PublicationThis paper outlines a new method of a location service (LCS) in the asynchronous wireless networks (AWNs) where the nodes (base stations) operate asynchronously in relation to one another. This method, called asynchronous time difference of arrival (ATDOA), enables the calculation of the position of the mobile object (MO) through the measurements taken by a set of non-synchronized fixed nodes and is based on the measurement of...
-
Lower bound on the domination number of a tree.
PublicationW pracy przedstawiono dolne ograniczenie na liczbę dominowania w drzewach oraz przedstawiono pełną charakterystykę grafów ekstremalnych.
-
Lower bound on the paired domination number of a tree
PublicationW pracy przedstawione jest ograniczenie dolne dla liczby dominowania parami oraz scharakteryzowane są wszystkie drzewa ekstremalne.
-
Lower bound on the weakly connected domination number of a tree
PublicationPraca dotyczy dolnego ograniczenia liczby dominowania słabo spójnego w drzewach (ograniczenie ze względu na ilość wierzchołków i ilość wierzchołków końcowych w drzewie).
-
Distinguishing views in symmetric networks: A tight lower bound
PublicationThe view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers n ≥ D ≥ 1, there exists a port-labeled network with at most n nodes and diameter at most D which contains a pair of nodes whose (infinite) views are different, but whose views truncated to depth Omega( D log(n/ D )) are identical.
-
Lower bound on the distance k-domination number of a tree
PublicationW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.