1,214 research outputs found

    Compressive wireless arrays for bearing estimation

    Get PDF
    Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the slim of the individual sensor processing results. When the sensors have high data sampling rates, arrays are tethered, creating a disadvantage for their deployment and also limiting their aperture size. In this paper, we develop the signal processing algorithms for randomly deployable wireless sensor arrays that are severely constrained in communication bandwidth. We focus on the acoustic bearing estimation problem and show that when the target bearings are modeled as a sparse vector in the angle space, low dimensional random projections of the microphone signals can be used to determine multiple source bearings by solving an l(1)-norm minimization problem. Field data results are shown where only 10 bits of information is passed from each microphone to estimate multiple target bearings

    Direction-of-Arrival Estimation Based on Sparse Recovery with Second-Order Statistics

    Get PDF
    Traditional direction-of-arrival (DOA) estimation techniques perform Nyquist-rate sampling of the received signals and as a result they require high storage. To reduce sampling ratio, we introduce level-crossing (LC) sampling which captures samples whenever the signal crosses predetermined reference levels, and the LC-based analog-to-digital converter (LC ADC) has been shown to efficiently sample certain classes of signals. In this paper, we focus on the DOA estimation problem by using second-order statistics based on the LC samplings recording on one sensor, along with the synchronous samplings of the another sensors, a sparse angle space scenario can be found by solving an ell1ell_1 minimization problem, giving the number of sources and their DOA's. The experimental results show that our proposed method, when compared with some existing norm-based constrained optimization compressive sensing (CS) algorithms, as well as subspace method, improves the DOA estimation performance, while using less samples when compared with Nyquist-rate sampling and reducing sensor activity especially for long time silence signal

    Sensor Signal and Information Processing II [Editorial]

    Get PDF
    This Special Issue compiles a set of innovative developments on the use of sensor signals and information processing. In particular, these contributions report original studies on a wide variety of sensor signals including wireless communication, machinery, ultrasound, imaging, and internet data, and information processing methodologies such as deep learning, machine learning, compressive sensing, and variational Bayesian. All these devices have one point in common: These algorithms have incorporated some form of computational intelligence as part of their core framework in problem solving. They have the capacity to generalize and discover knowledge for themselves, learning to learn new information whenever unseen data are captured

    Group sparsity based target localization for distributed sensor array networks

    Get PDF
    The target localization problem for distributed sensor array networks where a sub-array is placed at each receiver is studied, and under the compressive sensing (CS) framework, a group sparsity based two-dimensional localization method is proposed. Instead of fusing the separately estimated angles of arrival (AOAs), it processes the information collected by all the receivers simultaneously to form the final target locations. Simulation results show that the proposed localization method provides a significant performance improvement compared with the commonly used maximum likelihood estimator (MLE)
    • …
    corecore