{"title":"Resource tradeoffs in distributed subspace tracking over the wireless medium","authors":"M. Nokleby, W. Bajwa","doi":"10.1109/GlobalSIP.2013.6737018","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737018","url":null,"abstract":"This paper studies distributed subspace tracking in wireless networks based on consensus averaging. Most prior approaches to this require the exchange of many inter-node messages between the arrival of new measurements, forcing communications to happen at a faster timescale than measurements. By contrast, this paper proposes a technique, termed hierarchical subspace tracking, which leverages recent advances in consensus over wireless networks in order to track subspaces when communications and measurements occur on the same timescale. It is shown that the resource consumption of hierarchical subspace tracking scales slowly in the size of the network. Further, it is shown that the convergence speed of hierarchical subspace tracking is the same as if measurements were known globally.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116113070","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":"Cyclostationarity-based wideband spectrum sensing using random sampling","authors":"Lingchen Zhu, Chenchi Luo, J. McClellan","doi":"10.1109/GlobalSIP.2013.6737123","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737123","url":null,"abstract":"Cognitive radio (CR) systems offer higher spectrum utilization by opportunistically allocating the unused spectrum from primary users to secondary users. For CR it is vital to perform fast and accurate spectrum sensing in a wideband and noisy channel. Cyclic feature detection performs well in signal detection and is also highly robust to noise uncertainty. However, it requires a high sampling rate when operating over a wideband channel. Based on the sparsity of the cyclic spectrum, compressive sampling technique can extend sparse reconstruction to its case. This paper develops a simpler cyclic spectrum recovery method based on random sampling and demonstrates faster and better performance. Recent research on discrete random sampling provides a new connection between sub-Nyquist sampling and aliasing as a noise floor that can be dynamically shaped by different distributions of sampling times. Practical analog-to-digital converters can implement these random sampling schemes. Thus, a reduced hardware complexity cyclic feature detector based on the reconstructed cyclic spectrum is proposed to identify the spectrum occupancy within the entire wideband.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114365629","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":"Neural network modulation, dynamics, and plasticity","authors":"C. Fink, M. Zochowski, V. Booth","doi":"10.1109/GlobalSIP.2013.6737023","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737023","url":null,"abstract":"Brain networks are unique in their capacity to modify synaptic structure while at the same time modulating neuronal firing properties. We investigated the interaction of these plastic network properties with overall network dynamics in large, biophysical neuronal network models. We modulated firing properties of individual neurons by simulating changing levels of acetylcholine (ACh), a key neurotransmitter whose level varies across waking and sleep states. When synaptic connection strengths were allowed to evolve according to a spike timing-dependent plasticity rule, results showed that ACh-induced changes in cellular properties led to different network activity patterns that resulted in either overall synaptic strengthening or weakening. These results suggest that the effect of ACh on neuron firing could contribute to hypothesized sleep-related synaptic renormalization in the brain.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114388454","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":"On constant gaps for the K-pair user two-way Gaussian interference channel with interaction","authors":"Zhiyu Cheng, N. Devroye","doi":"10.1109/GlobalSIP.2013.6737041","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737041","url":null,"abstract":"In a K-pair-user two-way Gaussian interference channel (IC), 2K messages and 2K transmitters/receivers form a Gaussian K-user IC in the forward direction (K messages) and another Gaussian K-user IC in the backward direction (K messages) which operate simultaneously in full-duplex mode. All nodes are permitted to interact, i.e. adapt current channel inputs to past received signals. We derive a new sum-rate outer bound for linear deterministic and Gaussian noise channels allowing for interaction, but show that for symmetric scenarios and certain interference regimes (moderately weak and strong), non-interactive schemes achieve to within a constant gap of this outer bound. That is, interaction for symmetric channels in certain interference regimes may only improve the sum-rate by a constant number of bits per channel use.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128284546","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":"Optimal deployment of caches in the plane","authors":"M. Mitici, J. Goseling, M. D. Graaf, R. Boucherie","doi":"10.1109/GlobalSIP.2013.6737028","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737028","url":null,"abstract":"We consider wireless caches placed in the plane according to a homogeneous Poisson process. A data file is stored at the caches, which have limited storage capabilities. Clients can contact the caches to retrieve the data. The caches store the data according to one of the two data allocation strategies: partitioning & coding. We consider the Pareto front of the expected deployment cost of the caches and the expected cost of a client retrieving the data from the caches. We show that there is a strong trade-off between the expected retrieval and the expected deployment cost under the partitioning and the coding strategies. We also show that under coding, it is optimal to deploy a high number of caches, each with low storage capacity.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128761990","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":"Optimizing feedback in energy harvesting MISO communication channels","authors":"Rajeev Gangula, D. Gesbert, Deniz Gündüz","doi":"10.1109/GlobalSIP.2013.6736889","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736889","url":null,"abstract":"In this work,1 we consider the optimization of feedback in a point-to-point MISO channel with an energy harvesting (EH) receiver (RX). The RX is interested in feeding back the channel state to the transmitter (TX) to help improve the transmission rate, yet must spend the harvested energy wisely to do so. The objective is to maximize the throughput by a deadline, subject to EH constraints at the RX. The throughput metric considered is an upper bound on the ergodic capacity of beamforming with limited feedback. The optimization problem is shown to be concave and a simple algorithm for obtaining the optimal feedback bit allocation policy is devised. Numerical results show that the optimal feedback policy obtained for the modified problem outperforms the naive scheme for the original problem.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116296341","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":"Path planning using a neuron array integrated circuit","authors":"Scott Koziol, S. Brink, J. Hasler","doi":"10.1109/GlobalSIP.2013.6736978","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736978","url":null,"abstract":"Neuromorphic Engineering is an interdisciplinary field which combines concepts from fields such as biology, neuroscience, computer science and engineering. The goal of this field is to design systems that are based on the principles of biological nervous systems. This paper presents hardware results for path planning using a neuron array integrated circuit. The algorithm is explained and experimental results are presented showing 100% correct performance for a large number of maze environment scenarios. Although there is still more work to be completed before this is a fielded system, this work represents an new application of a neuromorphic Integrated Circuit and the results demonstrate definite potential.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116479884","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":"Sub-Nyquist power spectrum reconstruction and support detection for cognitive radios","authors":"Deborah Cohen, Yonina C. Eldar","doi":"10.1109/GlobalSIP.2013.6737115","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737115","url":null,"abstract":"In order to respond to the ever-increasing demand for new spectral bands, the concept of Cognitive Radio (CR) has emerged, exploiting the spectrum sparsity. Opportunistic users could exploit temporarily vacant bands after detecting the absence of activity of their owners. One of the most crucial tasks in the CR cycle is therefore spectrum sensing and detection which should be reliable and efficient. Yet, CRs typically deal with wideband signals whose Nyquist rates are very high. In this paper, we propose to reconstruct the power spectrum of such signals from sub-Nyquist samples, rather than the signal itself as done in previous work, in order to perform detection. We consider both sparse and non sparse signals as well as blind and non blind detection in the sparse case. For each one of those scenarii, we derive the minimal sampling rate allowing perfect power spectrum reconstruction in a noise-free environment and provide spectrum recovery techniques that achieve those rates. Simulations demonstrate spectrum recovery and support detection at the minimal rate in noise-free settings and show the impact of the signal-to-noise ratio (SNR) on the performance of our detector.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114683713","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":"Optimal control of gene regulatory networks with uncertain intervention effects","authors":"Mohammadmahdi R. Yousefi, I. Ivanov","doi":"10.1109/GlobalSIP.2013.6736826","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736826","url":null,"abstract":"Optimal control policies for Markovian gene regulatory networks assume that external intervention is 100% specific to control genes. In practice, however, this effect may be unpredictable in the sense that intervention may also target alternative genes. Our goal is to find an optimal control policy that performs well in such cases. We model this by an uncertainty class of controlled networks corresponding to different affected genes, governed by a probability distribution representing our confidence in the intervention specificity to each gene, and optimize relative to this uncertainty class.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"32 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124385498","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":"Scalable successive-cancellation hardware decoder for polar codes","authors":"Alexandre J. Raymond, W. Gross","doi":"10.1109/GlobalSIP.2013.6737143","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737143","url":null,"abstract":"Polar codes, discovered by Arikan, are the first error-correcting codes with an explicit construction to provably achieve channel capacity, asymptotically. However, their error-correction performance at finite lengths tends to be lower than existing capacity-approaching schemes. Using the successive-cancellation algorithm, polar decoders can be designed for very long codes, with low hardware complexity, leveraging the regular structure of such codes. We present an architecture and an implementation of a scalable hardware decoder based on this algorithm. This design is shown to scale to code lengths of up to N = 220 on an Altera Stratix IV FPGA, limited almost exclusively by the amount of available SRAM.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131961950","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}