Search

We focus on coherent direction of arrival estimation of wideband sources based on spatial sparsity. This area of research is encountered in many applications such as passive radar, sonar, mining, and communication problems, in which an increasing attention has been devoted to improving the estimation accuracy and robustness to noise. By the development of super-resolution algorithms, narrowband direction of arrival estimation based on gridless sparse algorithms and atomic norm minimization has already been addressed. In this paper, a superresolution based method is proposed for coherent direction of arrival estimation of multiple wideband sources. First, unlike the conventional coherent methods, we develop a new focusing method to map the subband with the largest center frequency to the other ones, which leads to an accurate method with no requirement for initial estimates for DOAs. Then, we introduce an atomic norm problem by defining a new set of atoms and exploiting the signal joint sparsity of different frequency subbands in a continuous spatial domain. This problem is then cast as a semidefinite program, which leads to implementing a new coherent direction of arrival estimation method with higher resolution and more robustness to noise. Our method needs only one single snapshot for each frequency subband, leading to a small number of snapshots for the received wideband signal compared to the other coherent DOA techniques. Numerical simulations show the outperformance of the proposed method compared to the conventional ones.

We focus on developing an effective Direction Of Arrival (DOA) estimation method for wideband sources based on the gridless sparse concept. Previous coherent methods have been designed by dividing wideband frequencies into a few subbands which are transferred to a reference subband using focusing matrices. In this work, as opposed to the previous techniques, we propose a convex optimization problem that leads to an accurate wideband DOA estimation method with no need for any focusing matrix. Moreover, in this method, no initial DOA estimates are required and it can be used for any arbitrary linear arrays. Numerical simulations show that in comparison to some well-known techniques, the proposed method generates outstanding accuracy and better robustness to noise. The effectiveness of the method is also verified in presence of close adjacent sources.

In this paper the problem of blind super-resolution of sparse signals using arbitrary sampling scheme and atomic lift is discussed. After comprehensive description on blind superresolution problem, it is shown that using Prolate Spheroidal Wave Functions (PSWFs), it is possible to derive a new SemiDefinite Program (SDP) for the blind super-resolution problem. Unlike the previous results, the newly proposed SDP can localize spikes without magnitude recovery. Several numerical simulations were conducted to compare the performance of the proposed method with the recent related research., Comment: 5 pages, 4 figures

We experimentally demonstrate the principle of an on-chip submillimeter wave filter bank spectrometer, using superconducting microresonators as narrow band-separation filters. The filters are made of NbTiN/SiNx/NbTiN microstrip line resonators, which have a resonance frequency in the range of 614-685 GHz---two orders of magnitude higher in frequency than what is currently studied for use in circuit quantum electrodynamics and photodetectors. The frequency resolution of the filters decreases from 350 to 140 with increasing frequency, most likely limited by dissipation of the resonators., Comment: 4 pages, 3 figures, submitted to Applied Physics Letters

In this chapter we focus on slack reclamation and propose a new slack reclamation technique, Multiple Frequency Selection DVFS (MFS-DVFS). The key idea is to execute each task with a linear combination of more than one frequency such that this combination results in using the lowest energy by covering the whole slack time of the task. We have tested our algorithm with both random and real-world application task graphs and compared with the results in previous researches in [9] and [12-13]. The experimental results show that our approach can achieve energy almost identical to the optimum energy saving., Comment: Chapter 17- Book title: "Energy Efficient Distributed Computing", Edited by Albert Y.Zomaya, Young Choon Lee Wiley

In this paper, we propose an analytical method to model the dependency between configuration parameters and total execution time of Map-Reduce applications. Our approach has three key phases: profiling, modeling, and prediction. In profiling, an application is run several times with different sets of MapReduce configuration parameters to profile the execution time of the application on a given platform. Then in modeling, the relation between these parameters and total execution time is modeled by multivariate linear regression. Among the possible configuration parameters, two main parameters have been used in this study: the number of Mappers, and the number of Reducers. For evaluation, two standard applications (WordCount, and Exim Mainlog parsing) are utilized to evaluate our technique on a 4-node MapReduce platform.