{"title":"Computable performance guarantees for compressed sensing matrices.","authors":"Myung Cho, Kumar Vijay Mishra, Weiyu Xu","doi":"10.1186/s13634-018-0535-y","DOIUrl":"10.1186/s13634-018-0535-y","url":null,"abstract":"<p><p>The null space condition for <i>ℓ</i><sub>1</sub> minimization in compressed sensing is a necessary and sufficient condition on the sensing matrices under which a sparse signal can be uniquely recovered from the observation data via <i>ℓ</i><sub>1</sub> minimization. However, verifying the null space condition is known to be computationally challenging. Most of the existing methods can provide only upper and lower bounds on the proportion parameter that characterizes the null space condition. In this paper, we propose new polynomial-time algorithms to establish upper bounds of the proportion parameter. We leverage on these techniques to find upper bounds and further develop a new procedure-tree search algorithm-that is able to precisely and quickly verify the null space condition. Numerical experiments show that the execution speed and accuracy of the results obtained from our methods far exceed those of the previous methods which rely on linear programming (LP) relaxation and semidefinite programming (SDP).</p>","PeriodicalId":49203,"journal":{"name":"Eurasip Journal on Advances in Signal Processing","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5829123/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35882808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nenad Vukmirović, Miloš Janjić, Petar M Djurić, Miljko Erić
{"title":"Position estimation with a millimeter-wave massive MIMO system based on distributed steerable phased antenna arrays.","authors":"Nenad Vukmirović, Miloš Janjić, Petar M Djurić, Miljko Erić","doi":"10.1186/s13634-018-0553-9","DOIUrl":"https://doi.org/10.1186/s13634-018-0553-9","url":null,"abstract":"<p><p>In this paper, we propose a massive MIMO (multiple-input-multiple-output) architecture with distributed steerable phased antenna subarrays for position estimation in the mmWave range. We also propose localization algorithms and a multistage/multiresolution search strategy that resolve the problem of high side lobes, which is inherent in spatially coherent localization. The proposed system is intended for use in line-of-sight indoor environments. Time synchronization between the transmitter and the receiving system is not required, and the algorithms can also be applied to a multiuser scenario. The simulation results for the line-of-sight-only and specular multipath scenarios show that the localization error is only a small fraction of the carrier wavelength and that it can be achieved under reasonable system parameters including signal-to-noise ratios, antenna number/placement, and subarray apertures. The proposed concept has the potential of significantly improving the capacity and spectral/energy efficiency of future mmWave massive MIMO systems.</p>","PeriodicalId":49203,"journal":{"name":"Eurasip Journal on Advances in Signal Processing","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13634-018-0553-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"36223997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Joint source and relay optimization for interference MIMO relay networks.","authors":"Muhammad R A Khandaker, Kai-Kit Wong","doi":"10.1186/s13634-017-0453-4","DOIUrl":"https://doi.org/10.1186/s13634-017-0453-4","url":null,"abstract":"<p><p>This paper considers multiple-input multiple-output (MIMO) relay communication in multi-cellular (interference) systems in which MIMO source-destination pairs communicate simultaneously. It is assumed that due to severe attenuation and/or shadowing effects, communication links can be established only with the aid of a relay node. The aim is to minimize the maximal mean-square-error (MSE) among all the receiving nodes under constrained source and relay transmit powers. Both one- and two-way amplify-and-forward (AF) relaying mechanisms are considered. Since the exactly optimal solution for this practically appealing problem is intractable, we first propose optimizing the source, relay, and receiver matrices in an alternating fashion. Then we contrive a simplified <i>semidefinite programming (SDP) solution</i> based on the error covariance matrix decomposition technique, avoiding the high complexity of the iterative process. Numerical results reveal the effectiveness of the proposed schemes.</p>","PeriodicalId":49203,"journal":{"name":"Eurasip Journal on Advances in Signal Processing","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13634-017-0453-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37782785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jeyarajan Thiyagalingam, Lykourgos Kekempanos, Simon Maskell
{"title":"MapReduce particle filtering with exact resampling and deterministic runtime.","authors":"Jeyarajan Thiyagalingam, Lykourgos Kekempanos, Simon Maskell","doi":"10.1186/s13634-017-0505-9","DOIUrl":"https://doi.org/10.1186/s13634-017-0505-9","url":null,"abstract":"<p><p>Particle filtering is a numerical Bayesian technique that has great potential for solving sequential estimation problems involving non-linear and non-Gaussian models. Since the estimation accuracy achieved by particle filters improves as the number of particles increases, it is natural to consider as many particles as possible. MapReduce is a generic programming model that makes it possible to scale a wide variety of algorithms to Big data. However, despite the application of particle filters across many domains, little attention has been devoted to implementing particle filters using MapReduce. In this paper, we describe an implementation of a particle filter using MapReduce. We focus on a component that what would otherwise be a bottleneck to parallel execution, the resampling component. We devise a new implementation of this component, which requires no approximations, has <i>O</i>(<i>N</i>) spatial complexity and deterministic <i>O</i>((log<i>N</i>)<sup>2</sup>) time complexity. Results demonstrate the utility of this new component and culminate in consideration of a particle filter with 2<sup>24</sup> particles being distributed across 512 processor cores.</p>","PeriodicalId":49203,"journal":{"name":"Eurasip Journal on Advances in Signal Processing","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13634-017-0505-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37603016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel aliasing-free subband information fusion approach for wideband sparse spectral estimation.","authors":"Ji-An Luo, Xiao-Ping Zhang, Zhi Wang","doi":"10.1186/s13634-017-0494-8","DOIUrl":"https://doi.org/10.1186/s13634-017-0494-8","url":null,"abstract":"<p><p>Wideband sparse spectral estimation is generally formulated as a multi-dictionary/multi-measurement (MD/MM) problem which can be solved by using group sparsity techniques. In this paper, the MD/MM problem is reformulated as a single sparse indicative vector (SIV) recovery problem at the cost of introducing an additional system error. Thus, the number of unknowns is reduced greatly. We show that the system error can be neglected under certain conditions. We then present a new subband information fusion (SIF) method to estimate the SIV by jointly utilizing all the frequency bins. With orthogonal matching pursuit (OMP) leveraging the binary property of SIV's components, we develop a SIF-OMP algorithm to reconstruct the SIV. The numerical simulations demonstrate the performance of the proposed method.</p>","PeriodicalId":49203,"journal":{"name":"Eurasip Journal on Advances in Signal Processing","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13634-017-0494-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37616329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ondrej Slučiak, Hana Straková, Markus Rupp, Wilfried Gansterer
{"title":"Distributed Gram-Schmidt orthogonalization with simultaneous elements refinement.","authors":"Ondrej Slučiak, Hana Straková, Markus Rupp, Wilfried Gansterer","doi":"10.1186/s13634-016-0322-6","DOIUrl":"https://doi.org/10.1186/s13634-016-0322-6","url":null,"abstract":"<p><p>We present a novel distributed QR factorization algorithm for orthogonalizing a set of vectors in a decentralized wireless sensor network. The algorithm is based on the classical Gram-Schmidt orthogonalization with all projections and inner products reformulated in a recursive manner. In contrast to existing distributed orthogonalization algorithms, all elements of the resulting matrices <b>Q</b> and <b>R</b> are computed simultaneously and refined iteratively after each transmission. Thus, the algorithm allows a trade-off between run time and accuracy. Moreover, the number of transmitted messages is considerably smaller in comparison to state-of-the-art algorithms. We thoroughly study its numerical properties and performance from various aspects. We also investigate the algorithm's robustness to link failures and provide a comparison with existing distributed QR factorization algorithms in terms of communication cost and memory requirements.</p>","PeriodicalId":49203,"journal":{"name":"Eurasip Journal on Advances in Signal Processing","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13634-016-0322-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"34369530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Branko Kovačević, Zoran Banjac, Ivana Kostić Kovačević
{"title":"Robust adaptive filtering using recursive weighted least squares with combined scale and variable forgetting factors.","authors":"Branko Kovačević, Zoran Banjac, Ivana Kostić Kovačević","doi":"10.1186/s13634-016-0341-3","DOIUrl":"https://doi.org/10.1186/s13634-016-0341-3","url":null,"abstract":"<p><p>In this paper, a new adaptive robustified filter algorithm of recursive weighted least squares with combined scale and variable forgetting factors for time-varying parameters estimation in non-stationary and impulsive noise environments has been proposed. To reduce the effect of impulsive noise, whether this situation is stationary or not, the proposed adaptive robustified approach extends the concept of approximate maximum likelihood robust estimation, the so-called M robust estimation, to the estimation of both filter parameters and noise variance simultaneously. The application of variable forgetting factor, calculated adaptively with respect to the robustified prediction error criterion, provides the estimation of time-varying filter parameters under a stochastic environment with possible impulsive noise. The feasibility of the proposed approach is analysed in a system identification scenario using finite impulse response (FIR) filter applications.</p>","PeriodicalId":49203,"journal":{"name":"Eurasip Journal on Advances in Signal Processing","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13634-016-0341-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"34369529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A parameter estimation algorithm for LFM/BPSK hybrid modulated signal intercepted by Nyquist folding receiver.","authors":"Zhaoyang Qiu, Pei Wang, Jun Zhu, Bin Tang","doi":"10.1186/s13634-016-0387-2","DOIUrl":"https://doi.org/10.1186/s13634-016-0387-2","url":null,"abstract":"<p><p>Nyquist folding receiver (NYFR) is a novel ultra-wideband receiver architecture which can realize wideband receiving with a small amount of equipment. Linear frequency modulated/binary phase shift keying (LFM/BPSK) hybrid modulated signal is a novel kind of low probability interception signal with wide bandwidth. The NYFR is an effective architecture to intercept the LFM/BPSK signal and the LFM/BPSK signal intercepted by the NYFR will add the local oscillator modulation. A parameter estimation algorithm for the NYFR output signal is proposed. According to the NYFR prior information, the chirp singular value ratio spectrum is proposed to estimate the chirp rate. Then, based on the output self-characteristic, matching component function is designed to estimate Nyquist zone (NZ) index. Finally, matching code and subspace method are employed to estimate the phase change points and code length. Compared with the existing methods, the proposed algorithm has a better performance. It also has no need to construct a multi-channel structure, which means the computational complexity for the NZ index estimation is small. The simulation results demonstrate the efficacy of the proposed algorithm.</p>","PeriodicalId":49203,"journal":{"name":"Eurasip Journal on Advances in Signal Processing","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13634-016-0387-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"34720437","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Data Fusion for Improved Respiration Rate Estimation.","authors":"Shamim Nemati, Atul Malhotra, Gari D Clifford","doi":"10.1155/2010/926305","DOIUrl":"https://doi.org/10.1155/2010/926305","url":null,"abstract":"<p><p>We present an application of a modified Kalman-Filter (KF) framework for data fusion to the estimation of respiratory rate from multiple physiological sources which is robust to background noise. A novel index of the underlying signal quality of respiratory signals is presented and then used to modify the noise covariance matrix of the KF which discounts the effect of noisy data. The signal quality index, together with the KF innovation sequence, is also used to weight multiple independent estimates of the respiratory rate from independent KFs. The approach is evaluated on both a realistic artificial ECG model (with real additive noise), and on real data taken from 30 subjects with overnight polysomnograms, containing ECG, respiration and peripheral tonometry waveforms from which respiration rates were estimated. Results indicate that our automated voting system can out-perform any individual respiration rate estimation technique at all levels of noise and respiration rates exhibited in our data. We also demonstrate that even the addition of a noisier extra signal leads to an improved estimate using our framework. Moreover, our simulations demonstrate that different ECG respiration extraction techniques have different error profiles with respect to the respiration rate, and therefore a respiration rate-related modification of any fusion algorithm may be appropriate.</p>","PeriodicalId":49203,"journal":{"name":"Eurasip Journal on Advances in Signal Processing","volume":null,"pages":null},"PeriodicalIF":1.9,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2010/926305","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9869529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}