Joe C. Chen

Bio: Joe C. Chen is an academic researcher from University of California, Los Angeles. The author has contributed to research in topics: Beamforming & Estimator. The author has an hindex of 9, co-authored 13 publications receiving 1304 citations.

Source localization and beamforming

Abstract: Distributed sensor networks have been proposed for a wide range of applications. The main purpose of a sensor network is to monitor an area, including detecting, identifying, localizing, and tracking one or more objects of interest. These networks may be used by the military in surveillance, reconnaissance, and combat scenarios or around the perimeter of a manufacturing plant for intrusion detection. In other applications such as hearing aids and multimedia, microphone networks are capable of enhancing audio signals under noisy conditions for improved intelligibility, recognition, and cuing for camera aiming. Previous developments in integrated circuit technology have allowed the construction of low-cost miniature sensor nodes with signal processing and wireless communication capabilities. These technological advances not only open up many possibilities but also introduce challenging issues for the collaborative processing of wideband acoustic and seismic signals for source localization and beamforming in an energy-constrained distributed sensor network. The purpose of this article is to provide an overview of these issues.

Maximum-likelihood source localization and unknown sensor location estimation for wideband signals in the near-field

Abstract: In this paper, we derive the maximum-likelihood (ML) location estimator for wideband sources in the near field of the sensor array. The ML estimator is optimized in a single step, as opposed to other estimators that are optimized separately in relative time-delay and source location estimations. For the multisource case, we propose and demonstrate an efficient alternating projection procedure based on sequential iterative search on single-source parameters. The proposed algorithm is shown to yield superior performance over other suboptimal techniques, including the wideband MUSIC and the two-step least-squares methods, and is efficient with respect to the derived Cramer-Rao bound (CRB). From the CRB analysis, we find that better source location estimates can be obtained for high-frequency signals than low-frequency signals. In addition, large range estimation error results when the source signal is unknown, but such unknown parameter does not have much impact on angle estimation. In some applications, the locations of some sensors may be unknown and must be estimated. The proposed method is extended to estimate the range from a source to an unknown sensor location. After a number of source-location frames, the location of the uncalibrated sensor can be determined based on a least-squares unknown sensor location estimator.

Acoustic Source Localization and Beamforming: Theory and Practice

Abstract: We consider the theoretical and practical aspects of locating acoustic sources using an array of microphones. A maximum-likelihood (ML) direct localization is obtained when the sound source is near the array, while in the far-field case, we demonstrate the localization via the cross bearing from several widely separated arrays. In the case of multiple sources, an alternating projection procedure is applied to determine the ML estimate of the DOAs from the observed data. The ML estimator is shown to be effective in locating sound sources of various types, for example, vehicle, music, and even white noise. From the theoretical Cramer-Rao bound analysis, we find that better source location estimates can be obtained for high-frequency signals than low-frequency signals. In addition, large range estimation error results when the source signal is unknown, but such unknown parameter does not have much impact on angle estimation. Much experimentally measured acoustic data was used to verify the proposed algorithms.

A maximum-likelihood parametric approach to source localizations

Abstract: Source localization using passive sensor arrays has been an active research problem for many years. Most near-field source localization algorithms involve two separate estimations, namely, relative time-delay estimations and source location estimation. A one-step maximum-likelihood parametric source localization algorithm is proposed based on the maximum correlation between time shifted sensor data at the true source location. The performance of the algorithm is evaluated and shown to approach the Cramer-Rao bound asymptotically in simulations.

A Wireless Time-Synchronized COTS Sensor Platform, Part II: Applications to Beamforming

Abstract: In recent years, sensor network system has been proposed for various applications. In the past, most reported systems involve custom-made hardware. In this paper, we consider the use of Compaq iPAQ 3760s with their build-in StrongARM processors, ROM and RAM memories, and microphones and codecs for acoustic acquisition and processing, plus external wireless Ethernet cards for radio communication to form a distributed sensor network to perform acoustical beamforming. Time synchronization among the microphones is achieved by the Reference-Broadcast Synchronization method of Elson-Estrin. Two beamforming algorithms, based on the time difference of arrivals (TDOAs) among the microphones and least-squares estimation of the TDOAs method, and the maximum-likelihood (ML) parameter estimation method, are used to perform source detection, enhancement, localization, delay-steered beamforming, and direction-of-arrival estimation. Theoretical CramerRao bound analysis of the system performance and experimental beamforming results using the iPAQs and the wireless network are reported.

Locating the nodes: cooperative localization in wireless sensor networks

Abstract: Accurate and low-cost sensor localization is a critical requirement for the deployment of wireless sensor networks in a wide variety of applications. In cooperative localization, sensors work together in a peer-to-peer manner to make measurements and then forms a map of the network. Various application requirements influence the design of sensor localization systems. In this article, the authors describe the measurement-based statistical models useful to describe time-of-arrival (TOA), angle-of-arrival (AOA), and received-signal-strength (RSS) measurements in wireless sensor networks. Wideband and ultra-wideband (UWB) measurements, and RF and acoustic media are also discussed. Using the models, the authors have shown the calculation of a Cramer-Rao bound (CRB) on the location estimation precision possible for a given set of measurements. The article briefly surveys a large and growing body of sensor localization algorithms. This article is intended to emphasize the basic statistical signal processing background necessary to understand the state-of-the-art and to make progress in the new and largely open areas of sensor network localization research.

Fine-grained network time synchronization using reference broadcasts

Abstract: Recent advances in miniaturization and low-cost, low-power design have led to active research in large-scale networks of small, wireless, low-power sensors and actuators. Time synchronization is critical in sensor networks for diverse purposes including sensor data fusion, coordinated actuation, and power-efficient duty cycling. Though the clock accuracy and precision requirements are often stricter than in traditional distributed systems, strict energy constraints limit the resources available to meet these goals.We present Reference-Broadcast Synchronization, a scheme in which nodes send reference beacons to their neighbors using physical-layer broadcasts. A reference broadcast does not contain an explicit timestamp; instead, receivers use its arrival time as a point of reference for comparing their clocks. In this paper, we use measurements from two wireless implementations to show that removing the sender's nondeterminism from the critical path in this way produces high-precision clock agreement (1.85 ± 1.28μsec, using off-the-shelf 802.11 wireless Ethernet), while using minimal energy. We also describe a novel algorithm that uses this same broadcast property to federate clocks across broadcast domains with a slow decay in precision (3.68 ± 2.57μsec after 4 hops). RBS can be used without external references, forming a precise relative timescale, or can maintain microsecond-level synchronization to an external timescale such as UTC. We show a significant improvement over the Network Time Protocol (NTP) under similar conditions.

Grassmannian beamforming for multiple-input multiple-output wireless systems

Abstract: Transmit beamforming and receive combining are simple methods for exploiting the significant diversity that is available in multiple-input multiple-output (MIMO) wireless systems. Unfortunately, optimal performance requires either complete channel knowledge or knowledge of the optimal beamforming vector; both are hard to realize. In this article, a quantized maximum signal-to-noise ratio (SNR) beamforming technique is proposed where the receiver only sends the label of the best beamforming vector in a predetermined codebook to the transmitter. By using the distribution of the optimal beamforming vector in independent and identically distributed Rayleigh fading matrix channels, the codebook design problem is solved and related to the problem of Grassmannian line packing. The proposed design criterion is flexible enough to allow for side constraints on the codebook vectors. Bounds on the codebook size are derived to guarantee full diversity order. Results on the density of Grassmannian line packings are derived and used to develop bounds on the codebook size given a capacity or SNR loss. Monte Carlo simulations are presented that compare the probability of error for different quantization strategies.