In this work, we consider the self-calibration problem of joint calibration and direction-of-Arrival (DOA) estimation using acoustic sensor arrays. Unlike many previous iterative approaches, we propose solvers that can be readily used for both linear and non-linear arrays for jointly estimating the sensor gain, phase errors, and the source DOAs. We derive these algorithms for both the conventional element-space and covariance data models. We focus on sparse and regular arrays formed using scalar sensors as well as vector sensors. The developed algorithms are obtained by transforming the underlying non-linear calibration model into a linear model, and subsequently by using convex relaxation techniques to estimate the unknown parameters. We also derive identifiability conditions for the existence of a unique solution to the self-calibration problem. To demonstrate the effectiveness of the developed techniques, numerical experiments, and comparisons to the state-of-The-Art methods are provided. Finally, the results from an experiment that was performed in an anechoic chamber using an acoustic vector sensor array are presented to demonstrate the usefulness of the proposed self-calibration techniques.@en

To analyze and synthesize signals on networks or graphs, Fourier theory has been extended to irregular domains, leading to a so-called graph Fourier transform. Unfortunately, different from the traditional Fourier transform, each graph exhibits a different graph Fourier transform. Therefore to analyze the graph-frequency domain properties of a graph signal, the graph Fourier modes and graph frequencies must be computed for the graph under study. Although to find these graph frequencies and modes, a computationally expensive, or even prohibitive, eigendecomposition of the graph is required, there exist families of graphs that have properties that could be exploited for an approximate fast graph spectrum computation. In this work, we aim to identify these families and to provide a divide-and-conquer approach for computing an approximate spectral decomposition of the graph. Using the same decomposition, results on reducing the complexity of graph filtering are derived. These results provide an attempt to leverage the underlying topological properties of graphs in order to devise general computational models for graph signal processing.@en

Optimal sensor selection for source parameter estimation in energy harvesting Internet of Things (IoT) networks is studied in this paper. Specifically, the focus is on the selection of the sensor locations which minimizes the estimation error at a fusion center, and to optimally allocate power and bandwidth for each selected sensor subject to a prescribed spectral and energy budget. To do so, measurement accuracy, communication link quality, and the amount of energy harvested are all taken into account. The sensor selection is studied under both analog and digital transmission schemes from the selected sensors to the fusion center. In the digital transmission case, an information theoretic approach is used to model the transmission rate, observation quantization, and encoding. We numerically prove that with a sufficient system bandwidth, the digital system outperforms the analog system with a possibly different sensor selection. The design problem of interest is a Boolean non convex optimization problem, which is solved by relaxing the Boolean constraints. To efficiently round the obtained relaxed solution, we propose a randomized rounding algorithm which generalizes the existing algorithm.@en

Orthogonal signal-division multiplexing (OSDM) has recently emerged as a promising modulation scheme for underwater acoustic communications. Although providing more flexibility in system design, it suffers from a special interference structure over time-varying channels. To enable reliable OSDM equalization, we propose a joint channel impulse response and Doppler estimation algorithm in this paper. Compared to the existing method, which solves a nonconvex bilinear optimization problem iteratively in the frequency domain without a guarantee of global optimality, the proposed algorithm transforms the problem into a convex quadratic minimization in the time domain and can achieve a closed-form solution.@en

The design of feasible trajectories to traverse the k-space for sampling in magnetic resonance imaging (MRI) is important while considering ways to reduce the scan time. Over the recent years, non-Cartesian trajectories have been observed to result in benign artifacts and being less sensitive to motion. In this paper, we propose a generalized framework that encompasses projection-based methods to generate feasible non-Cartesian k-space trajectories. This framework allows to construct feasible trajectories from both random or structured initial trajectories, e.g., based on the traveling salesman problem (TSP). We evaluate the performance of the proposed methods by simulating the reconstruction of 128 × 128 and 256 × 256 phantom and brain MRI images in terms of structural similarity (SSIM) index and peak signal-to-noise ratio (PSNR) using compressed sensing techniques. It is observed that the TSP-based trajectories from the proposed projection method with constant acceleration parameterization (CAP) result in better reconstruction compared to the projection method with constant velocity parameterization (CVP) and this for a similar read-out time. Further, random-like trajectories are observed to be better than TSP-based trajectories as they reduce the read-out time while providing better reconstruction quality. A reduction in read-out time by upto 67% is achieved using the proposed projection with permutation (PP) method.@en