{"title":"Retrodirective distributed transmit beamforming with two-way source synchronization","authors":"R. Preuss, D. Brown","doi":"10.1109/CISS.2010.5464801","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464801","url":null,"abstract":"Distributed transmit beamforming has recently been proposed as a technique in which several single-antenna sources cooperate to form a virtual antenna array and simultaneously transmit with phase-aligned carriers such that the passband signals coherently combine at an intended destination. The power gains of distributed transmit beamforming can provide increased range, rate, energy efficiency, and/or security, as well as reduce interference. Distributed transmit beamforming, however, typically requires precise synchronization between the sources with timing errors on the order of picoseconds. In this paper, a new two-way synchronization protocol is developed to facilitate precise source synchronization and retrodirective distributed transmit beamforming. The two-way synchronization protocol is developed under the assumption that all processing at each source node is performed with local observations in local time. An analysis of the statistical properties of the phase and frequency estimation errors in the two-way synchronization protocol and the resulting power gain of a distributed transmit beamformer using this protocol is provided. Numerical examples are also presented characterizing the performance of distributed transmit beamforming in a system using two-way source synchronization. The numerical results demonstrate that near-ideal beamforming performance can be achieved with low synchronization overhead.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132546143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Minimum subspace approximation property for sparse approximations in finite dimension","authors":"A. Aldroubi, R. Tessera","doi":"10.1109/CISS.2010.5464979","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464979","url":null,"abstract":"We find necessary and sufficient conditions that a class of subspaces C must satisfy so that a solution exits to the problem of finding the subspace V ∈ C that best approximate a set of data F ∈ ℝ<sup>d</sup>.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116961027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Stabilization of linear dynamical systems with scalar quantizers under communication constraints","authors":"Jin-wen Zhu, S. Stańczak, G. Reissig","doi":"10.1109/CISS.2010.5464711","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464711","url":null,"abstract":"This paper addresses a feedback stabilization problem for linear time-invariant dynamical systems where the feedback control loop is closed over a noiseless time-variant and rate-limited communication link. In contrast to the previous work, we assume a set of scalar quantizers and propose a method for stabilizing the system at reduced data rates.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114407438","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient cooperative detection for wireless sentinel networks","authors":"Qiong Shi, C. Comaniciu","doi":"10.1109/CISS.2010.5464935","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464935","url":null,"abstract":"In this paper, we propose an energy efficient cooperative detection scheme for wireless sentinel networks monitoring for surreptitious wireless communications. Our solution exploits the multiuser diversity in the network by proposing a cooperative randomized monitoring approach for individual sentinel nodes, that leads to more efficient resource expenditure and good detection and intruder localization performance for the network. A game theoretic framework is proposed to analyze the achievable operating point for the system. Simulation results show very good detection performance together with increased localization accuracy and energy efficient operation.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115896287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mixed operators in compressed sensing","authors":"M. Herman, D. Needell","doi":"10.1109/CISS.2010.5464909","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464909","url":null,"abstract":"Applications of compressed sensing motivate the possibility of using different operators to encode and decode a signal of interest. Since it is clear that the operators cannot be too different, we can view the discrepancy between the two matrices as a perturbation. The stability of ℓ1-minimization and greedy algorithms to recover the signal in the presence of additive noise is by now well-known. Recently however, work has been done to analyze these methods with noise in the measurement matrix, which generates a multiplicative noise term. This new framework of generalized perturbations (i.e., both additive and multiplicative noise) extends the prior work on stable signal recovery from incomplete and inaccurate measurements of Candès, Romberg and Tao using Basis Pursuit (BP), and of Needell and Tropp using Compressive Sampling Matching Pursuit (CoSaMP). We show, under reasonable assumptions, that the stability of the reconstructed signal by both BP and CoSaMP is limited by the noise level in the observation. Our analysis extends easily to arbitrary greedy methods.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121628841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
I. Esnaola, R. Carrillo, J. Garcia-Frías, K. Barner
{"title":"Orthogonal Matching Pursuit based recovery for correlated sources with partially disjoint supports","authors":"I. Esnaola, R. Carrillo, J. Garcia-Frías, K. Barner","doi":"10.1109/CISS.2010.5464901","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464901","url":null,"abstract":"Compressed sensing (CS) can be applied in distributed scenarios, where the objective is to independently compress several signals that are characterized by presenting a sparse correlation. In this case, the compressed version of each signal is produced without knowledge of the other signals. The decoder has access to the compressed versions of all the signals of interest and recovers them by exploiting the signal correlations. Motivated by the idea of incorporating prior information in distributed CS we propose to study the effects of including signal support correlation information in the reconstruction process. We investigate the performance improvement obtained by jointly recovering two correlated sources, compared to single source recovery, in terms of number of samples (measurements) required to encode the signal for successful recovery. To perform recovery, we modify the OMP algorithm to jointly recover two correlated sources with partially disjoint support. The final reconstruction algorithm is an iterative process that incorporates prior information of the sources, resembling joint source channel digital coding schemes, where probabilistic information is iteratively exchanged. The study is carried out by means of numerical simulations of synthetic signals with a probabilistic model.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121943827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"State estimation from space-time point process observations with an application in optical beam tracking","authors":"A. Komaee","doi":"10.1109/CISS.2010.5464949","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464949","url":null,"abstract":"A stochastic model is considered which involves a linear system driven by Wiener process and the observations of a space-time point process whose intensity depends on the state of this linear system. It is shown that the problem of estimating the state of this continuous-time system can be reduced to estimating the state of a discrete-time linear stochastic system with a Gaussian process noise and a generally non-Gaussian measurement noise. Two types of estimators are developed for this discrete-time system: a linear minimum mean squared estimator and a nonlinear estimator based on the successive projection of the posterior density of the state vector on a Gaussian family of density functions. These discrete-time estimators are employed to determine two classes of estimators for the original continuous-time system. An application to optical beam tracking is presented.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116779756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Compressive sampling for streaming signals with sparse frequency content","authors":"P. Boufounos, M. Salman Asif","doi":"10.1109/CISS.2010.5464848","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464848","url":null,"abstract":"Compressive sampling (CS) has emerged as significant signal processing framework to acquire and reconstruct sparse signals at rates significantly below the Nyquist rate. However, most of the CS development to-date has focused on finite-length signals and representations. In this paper we discuss a streaming CS framework and greedy reconstruction algorithm, the Streaming Greedy Pursuit (SGP), to reconstruct signals with sparse frequency content. Our proposed sampling framework and the SGP are explicitly intended for streaming applications and signals of unknown length. The measurement framework we propose is designed to be causal and implementable using existing hardware architectures. Furthermore, our reconstruction algorithm provides specific computational guarantees, which makes it appropriate for real-time system implementations. Our experimental results on very long signals demonstrate the good performance of the SGP and validate our approach.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115287314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. D. Park, David J. Miller, J. Doherty, S. C. Thompson
{"title":"Feasibility of range estimation using sonar LPI","authors":"J. D. Park, David J. Miller, J. Doherty, S. C. Thompson","doi":"10.1109/CISS.2010.5464926","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464926","url":null,"abstract":"Using a detailed waveform-based simulation framework, a study on the feasibility of LPI sonar is performed for covert range estimation. A frequency selective channel filter is applied for realistic ocean simulation. The platform uses matched filtering and the target uses energy detection for processing the received signal. The objective of the platform is to estimate the range to the target while ensuring that the target still fails to detect the platform's pinging LPI waveform. A platform-target encounter scenario was designed for Monte Carlo simulation. Evaluation of system parameters was performed to assess for the feasible conditions for covert range estimation.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122682992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Complex sparse projections for compressed sensing","authors":"A. A. Moghadam, H. Radha","doi":"10.1109/CISS.2010.5464917","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464917","url":null,"abstract":"Sparse projections for compressed sensing have been receiving some attention recently. In this paper, we consider the problem of recovering a k-sparse signal (x) in an n-dimensional space from a limited number (m) of linear, noiseless compressive samples (y) using complex sparse projections. Our approach is based on constructing complex sparse projections using strategies rooted in combinatorial design and expander graphs. We are able to recover the non-zero coefficients of the k-sparse signal (x) iteratively using a low-complexity algorithm that is reminiscent of well-known iterative channel decoding methods. We show that the proposed framework is optimal in terms of sample requirements for signal recovery (m = O (k log(n/k))) and has a decoding complexity of O (m log(n/m)), which represents a tangible improvement over recent solvers. Moreover we prove that using the proposed complex-sparse framework, on average 2k ≪ m ≤ 4k real measurements (where each complex sample is counted as two real measurements) suffice to recover a k-sparse signal perfectly.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129762715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}