August 2018
·
38 Reads
·
6 Citations
This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
August 2018
·
38 Reads
·
6 Citations
August 2018
·
19 Reads
·
4 Citations
July 2017
·
6 Reads
March 2017
·
19 Reads
·
15 Citations
November 2016
·
6 Reads
·
1 Citation
December 2013
·
19 Reads
·
5 Citations
Radar target identification based on resonant frequencies requires analysis of the “late-time” portion of the target signature: the period when early-time scattering has ceased, the resonant frequencies are well established, and the signal can still be distinguished from the noise. While target geometry can be used to determine the late-time commencement, for uncooperative radar target identification the determination must be made on the basis of the signal data alone. Intrinsic features of the Hankel matrix of the target impulse response, such as its rank and the distribution of its singular values, can be used to identify the late-time start prior to full matrix-pencil analysis of the optimal processing window. Results are presented from simulated target data.
December 2013
·
13 Reads
In a satellite navigation system such as the Global Positioning System (GPS), the receiver is required to determine its position accurately from time-difference-of-arrival (TDOA) measurements of incident signals. We will examine the receiver solution space of an estimator which is maximum-likelihood under the assumption of Gaussian measurement errors. We find the satellite position constraints which cause the receiver to have zero, one or two real solutions. We derive the equations for the boundary between the domains in which one and two solutions lie and find that there is a simple geometric interpretation.
January 2008
·
16 Reads
We consider a multiple-input, multiple-output (MIMO) communication system in which data streams are independently transmitted over a number of antennas and collectively decoded from a number of receiving antennas. The maximum-likelihood (ML) or sphere decoder is known to yield the lowest symbol error rate (SER). However, in the worst case, complexity is exponential in the number of antennas. Seeking to reduce complexity without greatly increasing the SER, we propose an approximate lattice decoder with polynomial arithmetic complexity. The decoder performs unconstrained nonlinear optimisation of a Jacobi theta function that approximates the log-likelihood function. Simulations demonstrate that this decoder performs nearly as well as the sphere decoder in terms of bit error rate (BER) and shows a significant performance enhancement compared to linear and lattice-reduced cancellers.
September 2006
·
304 Reads
·
38 Citations
Digital Signal Processing
In this paper, we examine the problem of fitting a circle to a set of noisy measurements of points on the circle's circumference. Delogne (Proc. IMEKO-Symp. Microwave Measurements 1972, 117-123) has proposed an estimator which has been shown by Kasa (IEEE Trans. Instrum. Meas. 25, 1976, 8-14) to be convenient for its ease of analysis and computation. Using Chan's circular functional model to describe the distribution of points, we perform a statistical analysis of the estimate of the circle's centre, assuming independent, identically distributed Gaussian measurement errors. We examine the existence of the mean and variance of the estimator for fixed sample sizes. We find that the mean exists when the number of sample points is greater than 3 and the variance exists when this number is greater than 4. We also derive approximations for the mean and variance for fixed sample sizes when the noise variance is small. We find that the bias approaches zero as the noise variance diminishes and that the variance approaches the Cramer-Rao lower bound.
February 2005
·
8 Reads
Recently, a novel transmission technique was proposed for delay-spread channels that guarantees a low peak-to-average power ratio while also having low computational complexity. In this paper, we extend the technique to systems where the symbol length or number of parallel channels is large, such as in very high speed digital subscriber line (VDSL) or multiple-input multiple-output (MIMO) systems respectively. While operational complexity is low, the computational cost of initialisation in a VDSL or MIMO channel appears, at first sight, to be prohibitive. We show that initialisation can be carried out efficiently. Having so enabled the technique, we present simulation results in a MIMO-VDSL environment which demonstrate its superiority in comparison to other popular techniques such as V-DMT and DMMT when clipping in the transmit power amplifier is a dominant consideration
... Hunde et al. [19] discuss a multi-target tracking system that addresses target initiation and termination processes with automatic track management feature. Vaughan et al. [20] conduct a statistical analysis that yields an accurate approximation of the false-track and track detection probabilities as a function of the threshold on the track-initiation statistic. Han et al. [21] propose a novel track initiation algorithm based on agglomerated hierarchical clustering and association coefficients. ...
August 2018
... To maximise the probability of intercept and avoid synchronisation, approaches for designing search strategies have been proposed, e.g. [8], [19]- [22]. However, these methods are only useful if the radars to be intercepted perform a periodic scan of the environment with a constant RF. ...
August 2018
... Thus, if F u has orthonormal columns, F H u r uc = d u + F H u w uc approximately recovers d u . The weighted power in (13) becomes P W = tr{G H A W GC} = tr{F H u Z H A W ZF u } + tr{R H pt A W R pt C pt }, which is minimized over the set of semiunitary matrices when F u comprises the K u least eigenvectors of Z H A W Z. Since F u has orthonormal columns, the products F u d u (at the transmitter) and F H u r uc (at the receiver) can be efficiently performed by resorting to Householder reflectors [41], taking 2K u K c + K 2 c complex multiplications each. ...
March 2017
... Recent literature provides methods to estimate the latetime response broadly based on three approaches namely Auto-Regressive (AR) filter-based approach [3], based on the formation of the Hankel matrix using the target scattered response [4], [5], [6], and Short-Time Matrix Pencil Method (ST-MPM) [2], [7]. All approaches provide a way to estimate the beginning of the late-time response without prior knowledge of the target geometry of orientation to improve the accuracy of resonance-based radar target recognition. ...
December 2013
... The test function z in Eq. (67) is called a tone detector in [Clarkson, 1997]. The test ζ for κ n = 1 is known as the semi-coherent statistic, which has been studied since 1960 [Reed and Swerling, 1962;Lank, Reed, and Pollon, 1973]. ...
... This method is not sensitive to outliers and it is relatively easy to implement. An example of a robust method is the Hough transform, which is mainly used in digital imaging [13], full LS, reduced LS, and modified LS [1], and Delogne-Kasa for noisy data [17]. When fitting a circle, the LS methods result in non-linear and implicit equations that can only be solved numerically, often following linearization techniques [4]. ...
September 2006
Digital Signal Processing
... The standard and desired pulse trains are applied to the counters and a measure of the desired frequency is obtained by multiplying the known standard frequency by the ratio between the desired count and the standard count obtained in the two digital counters [6,8]. The coincidence of pulses has been investigated over the last sixty years161718192021. In these works, is shown the connections of the coincidence of pulse of regular independent pulse trains with the number theory, particularly with linear congruence theory1617 and Diophantine approximations2021. ...
December 1997
IEEE Transactions on Information Theory
... For instance, if k i are generated from the Bernoulli missing model, which is frequently assumed in Refs. [7][8][9][10][11][12][13] , then the expected value of jSðfÞj 2 is given by 7 ...
January 1997