{"title":"Bayesian time series matching and privacy","authors":"Ke Li, H. Pishro-Nik, D. Goeckel","doi":"10.1109/ACSSC.2017.8335645","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335645","url":null,"abstract":"A user's privacy can be compromised by matching the statistical characteristics of an anonymized trace of interest to prior behavior of the user. Here, we address this matching problem from first principles in the Bayesian case, where user parameters are drawn from a known distribution, to understand the relationship between the length of the observed traces, the characteristics of the distribution defining the differences between user behavior, and user privacy. First, we establish optimal tests (of two hypotheses and extended to multiple hypotheses as well) for the cases with: 1) continuous alphabets, in particular i.i.d. Gaussian observations with a different (unknown) mean for each user, where the means are drawn from a general a priori distribution; 2) binary alphabets where i.i.d. observations are drawn from a Bernoulli distribution, with each user having an (unknown) probability of being in the \"0\" state drawn from some certain a priori distribution. Next, for the case with Gaussian observations, we provide general (non-asymptotic) bounds to the performance of the tests and also employ these to show the scaling behavior of privacy. Finally, we present simulation results to demonstrate the accuracy of our analytical bounds.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126163407","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":"Conjugate gradients based stochastic adaptive filters","authors":"C. Radhakrishnan, A. Singer","doi":"10.1109/ACSSC.2017.8335621","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335621","url":null,"abstract":"Reliable execution of optimization algorithms is an essential requirement in both digital signal processing (DSP) and machine learning applications. DSP systems designed using nanoscale process technologies are susceptible to transient errors. In addition, power saving techniques like voltage over-scaling can also cause reliability issues in circuits. These errors often manifest themselves as large magnitude errors at the application level and can considerably slow down the convergence speed of the chosen algorithm. In this work we explore the behavior of Conjugate Gradient (CG) algorithm under stochastic computational errors. The expanding subspace property and modular redundancy is exploited to develop a robust conjugate gradient based method with applications in adaptive filtering and machine learning.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123247579","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":"Detection of almost-cyclostationarity: An approach based on a multiple hypothesis test","authors":"Stefanie Horstmann, D. Ramírez, P. Schreier","doi":"10.1109/ACSSC.2017.8335636","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335636","url":null,"abstract":"This work presents a technique to detect whether a signal is almost cyclostationary (ACS) or wide-sense stationary (WSS). Commonly, ACS (and also CS) detectors require a priori knowledge of the cycle period, which in the ACS case is not an integer. To tackle the case of unknown cycle period, we propose an approach that combines a resampling technique, which handles the fractional part of the cycle period and allows the use of the generalized likelihood ratio test (GLRT), with a multiple hypothesis test, which handles the integer part of the cycle period. We control the probability of false alarm based on the known distribution of the individual GLRT statistic, results from order statistics, and the Holm multiple test procedure. To evaluate the performance of the proposed detector we consider a communications example, where simulation results show that the proposed technique outperforms state-of-the-art competitors.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116422688","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":"Novel combinatorial coding results for DNA sequencing and data storage","authors":"Clayton Schoeny, Frederic Sala, L. Dolecek","doi":"10.1109/ACSSC.2017.8335392","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335392","url":null,"abstract":"Due to its incredible density and durability, DNA storage is a promising storage medium with the potential to handle the problems associated with the current exponential growth of data. However, DNA is an exotic storage technology, and as such, it can experience types of errors that typically do not occur in traditional storage devices such as, for example, insertions and deletions. We build upon a previous work by Schoeny et al. to construct an efficient non-binary burst-deletion correcting code. By setting the alphabet size to 4, this code is specifically suited for correcting burst-deletions in DNA storage.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117104866","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":"A graph diffusion LMS strategy for adaptive graph signal processing","authors":"Roula Nassif, C. Richard, Jie Chen, A. H. Sayed","doi":"10.1109/ACSSC.2017.8335711","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335711","url":null,"abstract":"Graph signal processing allows the generalization of DSP concepts to the graph domain. However, most works assume graph signals that are static with respect to time, which is a limitation even in comparison to classical DSP formulations where signals are generally sequences that evolve over time. Several earlier works on adaptive networks have addressed problems involving streaming data over graphs by developing effective learning strategies that are well-suited to dynamic data scenarios, in a manner that generalizes adaptive signal processing concepts to the graph domain. The objective of this paper is to blend concepts from adaptive networks and graph signal processing to propose new useful tools for adaptive graph signal processing.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129818206","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":"Robust real-time sound pressure level stabilizer for multi-channel hearing aids compression for dynamically changing acoustic environment","authors":"Yiya Hao, Ram Charan, G. Bhat, I. Panahi","doi":"10.1109/ACSSC.2017.8335706","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335706","url":null,"abstract":"Multi-channel compression is one among the most popular techniques of hearing aids of mapping the wide dynamic range of speech signals into the reduced dynamic range of hearing impaired listeners effectively. Most of the Multi-Channel Compressors are particularly designed to manage certain loudness pattern, but it's quite difficult to efficiently capture the dynamically changing acoustics in Real-Time. The proposed method circumvents this problem by providing a contraption to estimate the fluctuating sound pressure level (SPL) and converting it into the desired SPL suitable for Multi-channel compression. This objective of stabilizing the SPL is achieved by incorporating a rapid voice activated detection (VAD), a root mean square (RMS) estimator, a moving average (MA) rectifier and a SPL regulator. Proposed SPL Stabilizer provides the hearing aids compressor with a comparatively constant SPL level input in Real-Time, and there by improves the quality and intelligibility of compression output signal.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129150711","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":"From massive MIMO to C-RAN: The OpenAirInterface 5G testbed","authors":"F. Kaltenberger, Xiwen Jiang, R. Knopp","doi":"10.1109/ACSSC.2017.8335413","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335413","url":null,"abstract":"5G will be much more than just a new radio interface — 5G will fundamentally change the way networks are operated. Traditional telecoms equipment will be replaced successively with general purpose computing platforms. This change will affect both the core network and the radio network, where it is also called cloud-RAN (C-RAN). The C-RAN architecture allows for flexible splits between different processing elements in the radio network, for an optimal trade-off between processing in the cloud or in the remote radio unit (RRU). OpenAirInterface (OAI) is an open source initiative that today provides Rel-8/Rel-10 3GPP compliant reference implementation of eNodeB, UE, RRH and EPC that runs on general purpose computing platforms. Already today OAI offers several functional splits for its 4G radio stack, for example between the Radio Cloud Center (RCC) and a Remote Radio Unit (RRU). Moreover, Eurecom is currently deploying a C-RAN network at its premises in Sophia-Antipolis, France, using a low-cost solution for RRU based on off-the-shelf equipment. In this paper we are going to describe the OAI C-RAN architecture with a special emphasis on the possibilities to do multi-cell distributed MIMO processing. In particular we will show how to we can apply our recently developed TDD reciprocity calibration scheme to this distributed setting and integrate it seamlessly into the normal LTE operation.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129432827","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":"Sketched covariance testing: A compression-statistics tradeoff","authors":"Gautam Dasarathy, P. Shah, Richard Baraniuk","doi":"10.1109/ACSSC.2017.8335428","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335428","url":null,"abstract":"Hypothesis testing of covariance matrices is an important problem in multivariate analysis. Given n data samples and a covariance matrix ∑0, the goal is to determine whether or not the data is consistent with this matrix. In this paper we introduce a framework that we call sketched covariance testing, where the data is provided after being compressed by multiplying by a \"sketching\" matrix A chosen by the analyst. We propose a statistical test in this setting and quantify an achievable sample complexity as a function of the amount of compression. Our result reveals an intriguing achievable tradeoff between the compression ratio and the statistical information required for reliable hypothesis testing; the sample complexity increases as the fourth power of the amount of compression.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"341 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124213454","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":"Wideband spectrum sensing measurement results using tunable front-end and FPGA implementation","authors":"Xusong Wang, S. Chaudhari, M. Laghate, D. Cabric","doi":"10.1109/ACSSC.2017.8335389","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335389","url":null,"abstract":"In this work, we implement a wideband spectrum sensing receiver using Analog Devices AD9361 RF frontend that can be tuned to frequencies from 70MHz to 6GHz with 30.72MHz bandwidth. An energy detection based spectrum sensing algorithm is implemented on Xilinx Kintex-7 FPGA in a pipelined architecture in order to continuously obtain data capture from the RF frontend without any missed samples and reduced latency. The wideband spectrum sensing algorithm uses 8192 FFT bins and provides center frequency and bandwidth of up to 8 non-overlapping frequency bands. The proposed architecture provides frequency resolution of 37.5kHz, time resolution of 8.53ms and latency of 8.78ms.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123673526","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":"Sensor selection and power allocation via maximizing Bayesian fisher information for distributed vector estimation","authors":"Mojtaba Shirazi, Alireza Sani, A. Vosoughi","doi":"10.1109/ACSSC.2017.8335580","DOIUrl":"https://doi.org/10.1109/ACSSC.2017.8335580","url":null,"abstract":"In this paper we study the problem of distributed estimation of a Gaussian vector with linear observation model in a wireless sensor network (WSN) consisting of K sensors that transmit their modulated quantized observations over orthogonal erroneous wireless channels (subject to fading and noise) to a fusion center, which estimates the unknown vector. Due to limited network transmit power, only a subset of sensors can be active at each task period. Here, we formulate the problem of sensor selection and transmit power allocation that maximizes the trace of Bayesian Fisher Information Matrix (FIM) under network transmit power constraint, and propose three algorithms to solve it. Simulation results demonstarte the superiority of these algorithms compared to the algorithm that uniformly allocates power among all sensors.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121208869","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}