发布求助
文献互助 智能选刊 最新文献

2015 49th Asilomar Conference on Signals, Systems and Computers最新文献

筛选
英文 中文
Projected Nesterov's proximal-gradient signal recovery from compressive poisson measurements 从压缩泊松测量中预测Nesterov的近端梯度信号恢复
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421393
Renliang Gu, Aleksandar Dogandzic
{"title":"Projected Nesterov's proximal-gradient signal recovery from compressive poisson measurements","authors":"Renliang Gu, Aleksandar Dogandzic","doi":"10.1109/ACSSC.2015.7421393","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421393","url":null,"abstract":"We develop a projected Nesterov's proximal-gradient (PNPG) scheme for reconstructing sparse signals from compressive Poisson-distributed measurements with the mean signal intensity that follows an affine model with known intercept. The objective function to be minimized is a sum of convex data fidelity (negative log-likelihood (NLL)) and regularization terms. We apply sparse signal regularization where the signal belongs to a closed convex set within the domain of the NLL and signal sparsity is imposed using total-variation (TV) penalty. We present analytical upper bounds on the regularization tuning constant. The proposed PNPG method employs projected Nesterov's acceleration step, function restart, and an adaptive step-size selection scheme that aims at obtaining a good local majorizing function of the N LL and reducing the time spent backtracking. We establish O (k-2) convergence of the PNPG method with step-size backtracking only and no restart. Numerical examples demonstrate the performance of the PNPG method.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126292423","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}
引用次数: 4
Implementation of MU-MIMO schedulers on SoC SoC上MU-MIMO调度程序的实现
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421425
Ganesh Venkatraman, Janne Janhunen, M. Juntti
{"title":"Implementation of MU-MIMO schedulers on SoC","authors":"Ganesh Venkatraman, Janne Janhunen, M. Juntti","doi":"10.1109/ACSSC.2015.7421425","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421425","url":null,"abstract":"To avail the benefits of a multi-antenna system, multi-user (MU) multiple-input multiple-output (MIMO) systems multiplex different user data streams spatially over time- frequency resources. However, serving dozens of users with spatial multiplexing increases the scheduler complexity significantly. In this work, we demonstrate the computational requirements of different state-of-the-art MU-MIMO scheduling algorithms and evaluate the number of users that can be supported in real-time. To provide a fair comparison, we initially analyze the achievable sum rate of various scheduling algorithms using MATLAB for different MIMO configurations. We also propose a modification to the existing scheduling algorithm to improve the sum rate. We then implement the scheduling algorithms on Xilinx ZYNQ- ZC702 System-on-Chip (SoC) to illustrate the advantages.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126543078","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}
引用次数: 1
Oil-spill forensics using two-dimensional gas chromatography: Differentiating highly correlated petroleum sources using peak manifold clusters 使用二维气相色谱法的溢油取证:使用峰流形簇区分高度相关的石油来源
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421415
H. G. Damavandi, A. Gupta, C. Reddy, Robert Nelson
{"title":"Oil-spill forensics using two-dimensional gas chromatography: Differentiating highly correlated petroleum sources using peak manifold clusters","authors":"H. G. Damavandi, A. Gupta, C. Reddy, Robert Nelson","doi":"10.1109/ACSSC.2015.7421415","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421415","url":null,"abstract":"Petroleum forensics for apportioning the environmental impact of oil spills necessitate quantitative differentiation between highly correlated biomarker distributions of neighboring oil sources. (GC × GC) generates high-resolution images that represent the complex hydrocarbon peak profiles of these petroleum biomarkers. As such, source differentiation reduces to the complex challenge of disambiguating the source-specific biomarker peak profile against strong regional commonalities, which are challenging to decorrelate using statistical techniques. We propose signal processing innovations that enhance recent methods in petroleum fingerprinting to achieve quantitative source differentiation. Specifically, we propose three related techniques: Peak topography maps; Peak Manifold clustering techniques; and Baseline interference mitigation.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"452 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125783411","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}
引用次数: 6
Sparsity-aware distributed conjugate gradient algorithms for parameter estimation over sensor networks 用于传感器网络参数估计的稀疏感知分布共轭梯度算法
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421407
Tamara Guerra Miller, Songcen Xu, R. D. Lamare, V. Nascimento, Y. Zakharov
{"title":"Sparsity-aware distributed conjugate gradient algorithms for parameter estimation over sensor networks","authors":"Tamara Guerra Miller, Songcen Xu, R. D. Lamare, V. Nascimento, Y. Zakharov","doi":"10.1109/ACSSC.2015.7421407","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421407","url":null,"abstract":"This paper proposes distributed adaptive algorithms based on the conjugate gradient (CG) method and the diffusion strategy for parameter estimation over sensor networks. We develop sparsity-aware conventional and modified distributed CG algorithms using ℓ1 and log-sum penalty functions. The proposed sparsity-aware diffusion distributed CG algorithms have an improved performance in terms of mean square deviation (MSD) and convergence rate as compared with the consensus least-mean square (Diffusion-LMS) algorithm, the diffusion CG algorithms and a close performance to the diffusion distributed recursive least squares (Diffusion-RLS) algorithm. Numerical results show that the proposed algorithms are reliable and can be applied in several scenarios.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130876984","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}
引用次数: 7
Transform domain LMF algorithm for sparse system identification under low SNR 低信噪比下稀疏系统识别的变换域LMF算法
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421118
Murwan Bashir, A. Zerguine
{"title":"Transform domain LMF algorithm for sparse system identification under low SNR","authors":"Murwan Bashir, A. Zerguine","doi":"10.1109/ACSSC.2015.7421118","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421118","url":null,"abstract":"In this work, a transform domain Least Mean Fourth (LMF) adaptive filter for a sparse system identification, in the case of low Signal-to-Noise Ratio (SNR), is proposed. Unlike the Least Mean Square (LMS) algorithm, the LMF algorithm, because of its error nonlinearity, performs very well in these environments. Moreover, its transform domain version has an outstanding performance when the input signal is correlated. However, it lacks sparse information capability. To overcome this limitation, a zero attractor mechanism, based on the l1 norm is implemented to yield the Zero-Attractor Transform-Domain LMF (ZA-TD-LMF) algorithm. The ZA-TD-LMF algorithm ensures fast convergence and attracts all the filter coefficients to zero. Simulation results conducted to substantiate our claim are found to be very effective.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"80 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120896950","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}
引用次数: 4
Information theory of intercellular signal transduction 细胞间信号转导的信息论
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421095
A. Eckford, P. Thomas
{"title":"Information theory of intercellular signal transduction","authors":"A. Eckford, P. Thomas","doi":"10.1109/ACSSC.2015.7421095","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421095","url":null,"abstract":"The cells in the human body use intercellular signal transduction to organize themselves and regulate their work; multicellular life could not exist without it. In this paper, we discuss why information theory provides a useful toolbox to approach this problem. We also discuss how to calculate the capacity of intercellular signal transduction in some specific examples. Finally, we describe the challenges and future prospects of this avenue of research.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"41 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120923330","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}
引用次数: 5
Using mobility for increasing the energy efficiency of multihop communications 利用移动性提高多跳通信的能源效率
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421172
Fernando Rosas, M. M. Azari, Bertold Van den Bergh, R. Souza, S. Pollin, M. Verhelst
{"title":"Using mobility for increasing the energy efficiency of multihop communications","authors":"Fernando Rosas, M. M. Azari, Bertold Van den Bergh, R. Souza, S. Pollin, M. Verhelst","doi":"10.1109/ACSSC.2015.7421172","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421172","url":null,"abstract":"Mobile robots equipped with cameras and sensors produce large amounts of data, which needs to be transferred energy-efficiently due to battery limitations. While most literature focuses on heterogeneous ad-hoc sensor networks, we use controlled robot mobility to reduce the energy cost per successfully transferred bit over a multihop link. In particular, we analyze the trade-off between hopping and movement cost. Our main conclusion is that, according to the parameters of the network, either the most efficient solution for large link distances is single hop with mobility or multiple hops without mobility. Interestingly, a combination of both do not provide important energy savings.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126780425","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}
引用次数: 4
Achieving exact cluster recovery threshold via semidefinite programming under the stochastic block model 在随机块模型下，通过半定规划实现精确的集群恢复阈值
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421303
Yihong Wu, Jiaming Xu, B. Hajek
{"title":"Achieving exact cluster recovery threshold via semidefinite programming under the stochastic block model","authors":"Yihong Wu, Jiaming Xu, B. Hajek","doi":"10.1109/ACSSC.2015.7421303","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421303","url":null,"abstract":"Resolving a conjecture of Abbe, Bandeira and Hall, the authors have recently shown that the semidefinite programming (SDP) relaxation of the maximum likelihood estimator achieves the sharp threshold for exactly recovering the community structure under the binary stochastic block model of two equal-sized clusters. Extending the proof techniques, in this paper it is shown that SDP relaxations also achieve the sharp recovery threshold under the stochastic block model with a fixed number of equal-sized clusters.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121487391","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}
引用次数: 6
A low power radix-2 FFT accelerator for FPGA 用于FPGA的低功耗基数2 FFT加速器
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421167
Soumak Mookherjee, L. DeBrunner, V. DeBrunner
{"title":"A low power radix-2 FFT accelerator for FPGA","authors":"Soumak Mookherjee, L. DeBrunner, V. DeBrunner","doi":"10.1109/ACSSC.2015.7421167","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421167","url":null,"abstract":"This paper presents a low power FFT accelerator using a Radix-2 algorithm with an 8-parallel multi-path delay commutator. Hardware accelerators can achieve better performance and throughput compared to software FFT routines. Thus, FFT accelerators are used in many DSP processors. In this paper, a Radix-2 Multipath Delay Commutator (R2MDC) FFT accelerator is designed with 8-parallel processing of the input samples. The hardware utilization of the architecture is 100% requiring only 4 parallel butterflies. It increases the throughput to eight times that of the traditional R2MDC. Thus, it can achieve similar throughput while running at one eighth of the clock frequency for a regular MDC accelerator while roughly increasing the gate capacitance by 4 times. Thus, it can operate at a lower power than the regular Radix-2 MDC accelerator. We implement our design on the Xilinx Virtex FPGA and measure area, frequency, latency, throughput and power. We show that our design can operate at a similar rate while reducing the power by 25% on an FPGA compared to R2MDC.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"177 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120963268","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}
引用次数: 10
Dynamic scheduling for delay guarantees for heterogeneous cognitive radio users 异构认知无线电用户时延保证的动态调度
2015 49th Asilomar Conference on Signals, Systems and Computers Pub Date : 2015-11-01 DOI: 10.1109/ACSSC.2015.7421106
Ahmed E. Ewaisha, C. Tepedelenlioğlu
{"title":"Dynamic scheduling for delay guarantees for heterogeneous cognitive radio users","authors":"Ahmed E. Ewaisha, C. Tepedelenlioğlu","doi":"10.1109/ACSSC.2015.7421106","DOIUrl":"https://doi.org/10.1109/ACSSC.2015.7421106","url":null,"abstract":"We study an uplink multi secondary user (SU) system having statistical delay constraints, and an average interference constraint to the primary user (PU). SUs with heterogeneous interference channel statistics, to the PU, experience heterogeneous delay performances since SUs causing low interference are scheduled more frequently than those causing high interference. We propose a scheduling algorithm that can provide arbitrary average delay guarantees to SUs irrespective of their statistical channel qualities. We derive the algorithm using the Lyapunov technique and show that it yields bounded queues and satisfy the interference constraints. Using simulations, we show its superiority over the Max-Weight algorithm.","PeriodicalId":172015,"journal":{"name":"2015 49th Asilomar Conference on Signals, Systems and Computers","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127866853","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}
引用次数: 4
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信