Bill Moran
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bill Moran has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Barbara F. La Scala
Melbourne Systems Laboratory, Electrical and Electronic Engineering, University of Melbourne, Australia
2 shared publications - Mark R. Morelande
Melbourne Systems Laboratory, Department of Electrical and Electronic Engineering, The University of Melbourne, Australia
2 shared publications - Xuezhi Wang
Melbourne Systems Laboratory, Dept of Electrical and Electronic Engineering, The University of Melbourne, Melbourne, Australia
2 shared publications - Craig O. Savage
Electrical and Electronic Engineering, University of Melbourne, Australia
1 shared publication Elena Kalashyan
1 shared publication- John Kitchen
DSTO, Edinburgh, South Australia, Australia
1 shared publication
Latest Publications
- Open Access
Intercept Capacity: Unknown Unitary Transformation
We consider the problem of intercepting communications signals between Multiple-Input Multiple-Output (MIMO) communication systems. To correctly detect a transmitted message it is necessary to know the gain matrix that represents the channel between the transmitter and the receiver. However, even if the receiver has knowledge of the message symbol set, it may not be possible to estimate the channel matrix. Blind Source Separation (BSS) techniques, such as Independent Component Analysis (ICA) can go some way to extracting independent signals from individual transmission antennae but these may have been preprocessed in a manner unknown to the receiver. In this paper we consider the situation where a communications interception system has prior knowledge of the message symbol set, the channel matrix between the transmission system and the interception system and is able to resolve the transmissionss from independent antennae. The question then becomes: what is the mutual information available to the interceptor when an unknown unitary transformation matrix is employed by the transmitter.
Open AccessIntercept Capacity: Unknown Unitary Transformation
We consider the problem of intercepting communications signals between Multiple-Input Multiple-Output (MIMO) communication systems. To correctly detect a transmitted message it is necessary to know the gain matrix that represents the channel between the transmitter and the receiver. However, even if the receiver has knowledge of the message symbol set, it may not be possible to estimate the channel matrix. Blind Source Separation (BSS) techniques, such as Independent Component Analysis (ICA) can go some way to extracting independent signals from individual transmission antennae but these may have been preprocessed in a manner unknown to the receiver. In this paper we consider the situation where a communications interception system has prior knowledge of the message symbol set, the channel matrix between the transmission system and the interception system and is able to resolve the transmissionss from independent antennae. The question then becomes: what is the mutual information available to the interceptor when an unknown unitary transformation matrix is employed by the transmitter.
- 1 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 39 (15312216) , 425-430
Hyperbolic Positioning Using RIPS Measurements for Wireless Sensor Networks
Measurements based on a Radio Interferometric Positioning System (RIPS) can determine distance differences between pairs of motes in a wireless sensor network. Such measurements allow one to localise motes in the network when the locations of at least three motes are known. In the 2-dimensional case, a RIPS trilateration approach, which we describe in this paper, appears to be the most efficient way of localising all motes with respect to a set of known anchors. An important issue associated with this method is the sensitivity of the trilateration to RIPS measurement noise. In this paper we present an analytic study of the impact of RIPS measurement noise on the localisation error, the results of which can be used as a guide for choosing RIPS measurements that minimise the localisation error. A simulated example demonstrates the underlying idea, and its effectiveness.
- 1 November 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 39 (15312216) , 425-430
Hyperbolic Positioning Using RIPS Measurements for Wireless Sensor Networks
Measurements based on a Radio Interferometric Positioning System (RIPS) can determine distance differences between pairs of motes in a wireless sensor network. Such measurements allow one to localise motes in the network when the locations of at least three motes are known. In the 2-dimensional case, a RIPS trilateration approach, which we describe in this paper, appears to be the most efficient way of localising all motes with respect to a set of known anchors. An important issue associated with this method is the sensitivity of the trilateration to RIPS measurement noise. In this paper we present an analytic study of the impact of RIPS measurement noise on the localisation error, the results of which can be used as a guide for choosing RIPS measurements that minimise the localisation error. A simulated example demonstrates the underlying idea, and its effectiveness.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15206149) , III-1417-1417
An Unscented Transformation for Conditionally Linear Models
A new method of applying the unscented transformation to conditionally linear transformations of Gaussian random variables is proposed. This method exploits the structure of the model to reduce the required number of sigma points. A common application of the unscented transformation is to nonlinear filtering where it used to approximate the moments required in the Kalman filter recursion. The proposed procedure is applied to a nonlinear filtering problem which involves tracking a falling object.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (15206149) , III-1417-1417
An Unscented Transformation for Conditionally Linear Models
A new method of applying the unscented transformation to conditionally linear transformations of Gaussian random variables is proposed. This method exploits the structure of the model to reduce the required number of sigma points. A common application of the unscented transformation is to nonlinear filtering where it used to approximate the moments required in the Kalman filter recursion. The proposed procedure is applied to a nonlinear filtering problem which involves tracking a falling object.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (15206149) , II-1105-1105
Performance Bounds and Algorithms for Tracking with a Radar Array
Target tracking using a radar array system is considered. A signal model which includes the effects of path loss, signal delay, Doppler shift and angle-of-arrival is adopted. The conventional approach to radar tracking assumes that the raw measurements are processed to produce a collection of candidate target detections. We propose a new approach in which the raw received measurements are used for tracking. Performance bounds and a simulation analysis of filters developed for each model demonstrate the performance gains which can be achieved by tracking with raw sensor measurements.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (15206149) , II-1105-1105
Performance Bounds and Algorithms for Tracking with a Radar Array
Target tracking using a radar array system is considered. A signal model which includes the effects of path loss, signal delay, Doppler shift and angle-of-arrival is adopted. The conventional approach to radar tracking assumes that the raw measurements are processed to produce a collection of candidate target detections. We propose a new approach in which the raw received measurements are used for tracking. Performance bounds and a simulation analysis of filters developed for each model demonstrate the performance gains which can be achieved by tracking with raw sensor measurements.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 188-192
Node Self-Localisation in Large Scale Sensor Networks
Efficient collaborative self-localisation is a vital component of large scale sensor network applications. This paper presents a computationally efficient algorithm for performing this task using radio interferometric positioning. In this way it is possible to localise the nodes in the network without needing additional sensors. Simulation results show performance that is similar to that obtained with a centralised approach but with significantly lower computation and transmission costs.
- 1 February 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 188-192
Node Self-Localisation in Large Scale Sensor Networks
Efficient collaborative self-localisation is a vital component of large scale sensor network applications. This paper presents a computationally efficient algorithm for performing this task using radio interferometric positioning. In this way it is possible to localise the nodes in the network without needing additional sensors. Simulation results show performance that is similar to that obtained with a centralised approach but with significantly lower computation and transmission costs.
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. iii, 1-8
Multitarget Tracking Using Virtual Measurement of Binary Sensor Networks
Networks of small low-cost sensors for target tracking are becoming increasingly important for many applications. A major problem is that these small sensors usually have limited observability due to power constraints and the transition between sensor observation and target states is nonlinear. As a consequence, nonlinear filtering techniques, such as particle filtering, are often chosen by researchers in this context. We focus on a network of sensors where each sensor provides binary data at each epoch: target present or target absent. At this point it is not clear that existing approaches can effectively handle the tracking of multiple targets using such networks. In addition, algorithmic computational complexity is an issue if particle filters are used. In this paper, we present a new method, the virtual measurement (VM) approach, for multi-target tracking using distributed binary sensor networks. The central idea of this approach is to define a mapping between the space of binary sensor observations and the so-called VM space, such that, any point within a VM space is a transform of the target state, as if it were generated by an equivalent "large sensor". With VMs, conventional multi-target tracking (MTT) algorithms can be used in a straightforward way for tracking multiple targets over the sensing field of binary sensor networks. Computer simulated examples of MTT demonstrate the effectiveness and robustness of the VM approach
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. iii, 1-8
Multitarget Tracking Using Virtual Measurement of Binary Sensor Networks
Networks of small low-cost sensors for target tracking are becoming increasingly important for many applications. A major problem is that these small sensors usually have limited observability due to power constraints and the transition between sensor observation and target states is nonlinear. As a consequence, nonlinear filtering techniques, such as particle filtering, are often chosen by researchers in this context. We focus on a network of sensors where each sensor provides binary data at each epoch: target present or target absent. At this point it is not clear that existing approaches can effectively handle the tracking of multiple targets using such networks. In addition, algorithmic computational complexity is an issue if particle filters are used. In this paper, we present a new method, the virtual measurement (VM) approach, for multi-target tracking using distributed binary sensor networks. The central idea of this approach is to define a mapping between the space of binary sensor observations and the so-called VM space, such that, any point within a VM space is a transform of the target state, as if it were generated by an equivalent "large sensor". With VMs, conventional multi-target tracking (MTT) algorithms can be used in a straightforward way for tracking multiple targets over the sensing field of binary sensor networks. Computer simulated examples of MTT demonstrate the effectiveness and robustness of the VM approach
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Optimal Scheduling for State Estimation Using a Terminal Cost Function
In this paper we consider state estimation problems where there are multiple independent processes evolving but the estimation scheme can only select a limited set of processes to measure at each time step. Within a Gauss-Markov framework, we show the optimality of a scheduling scheme under various scenarios. These types of problems are common in sensor scheduling applications
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Optimal Scheduling for State Estimation Using a Terminal Cost Function
In this paper we consider state estimation problems where there are multiple independent processes evolving but the estimation scheme can only select a limited set of processes to measure at each time step. Within a Gauss-Markov framework, we show the optimality of a scheduling scheme under various scenarios. These types of problems are common in sensor scheduling applications
- Open Access
- 1 January 2006
- Published by Defense Technical Information Center (DTIC)
Radar Performance of Temporal and Frequency Diverse Phase-Coded Waveforms
One major accomplishment in this project was the development of the CLUSTer Error Reduction (CLUSTER) model's formalism. The updated equations can be downloaded at http://love.psy.utexas.edu/love/cluster.pdf. One popular approach to modeling human category learning in the face of challenging data has been to propose models containing multiple systems. These systems could include prototype, exemplar, or rule-based components, as well as gating mechanisms that determine how to combine the outputs from these systems or components. CLUSTER takes a complex systems approach in which systems emerge out of the learners interactions with their environment. One claim is that what appears as separate cognitive systems are all based on cluster representations that follow from CLUSTER's recruitment and learning rules.
- 1 January 2006
- Published by Defense Technical Information Center (DTIC)
Open AccessRadar Performance of Temporal and Frequency Diverse Phase-Coded Waveforms
One major accomplishment in this project was the development of the CLUSTer Error Reduction (CLUSTER) model's formalism. The updated equations can be downloaded at http://love.psy.utexas.edu/love/cluster.pdf. One popular approach to modeling human category learning in the face of challenging data has been to propose models containing multiple systems. These systems could include prototype, exemplar, or rule-based components, as well as gating mechanisms that determine how to combine the outputs from these systems or components. CLUSTER takes a complex systems approach in which systems emerge out of the learners interactions with their environment. One claim is that what appears as separate cognitive systems are all based on cluster representations that follow from CLUSTER's recruitment and learning rules.