2013 IEEE Global Conference on Signal and Information Processing最新文献

筛选
英文 中文
Critically-sampled perfect-reconstruction spline-wavelet filterbanks for graph signals 图信号的临界采样完美重构样条小波滤波器组
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6736918
Venkatesan N. Ekambaram, G. Fanti, B. Ayazifar, K. Ramchandran
{"title":"Critically-sampled perfect-reconstruction spline-wavelet filterbanks for graph signals","authors":"Venkatesan N. Ekambaram, G. Fanti, B. Ayazifar, K. Ramchandran","doi":"10.1109/GlobalSIP.2013.6736918","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736918","url":null,"abstract":"Inspired by first-order spline wavelets in classical signal processing, we introduce two-channel (low-pass and high-pass), critically-sampled, perfect-reconstruction filterbanks for signals defined on circulant graphs, which accommodate linear shift-invariant filtering. We then generalize to filters that process signals defined on noncirculant graphs. We apply these filters, which can be tuned to approximate desired frequency responses, to signals defined on synthetic graphs and examine their performance.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"36 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":"133189933","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}
引用次数: 28
Designing a clock cleaner with an on-demand digital sigma-delta modulator 设计一个带按需数字σ - δ调制器的时钟清洁器
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6736980
Leung Kin Chiu, P. Kavanagh
{"title":"Designing a clock cleaner with an on-demand digital sigma-delta modulator","authors":"Leung Kin Chiu, P. Kavanagh","doi":"10.1109/GlobalSIP.2013.6736980","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736980","url":null,"abstract":"We present the design of a digital clock cleaner that reduces clock jitter. Analog phase-locked loops (PLL) are traditionally used to clean clock jitter, but they consume high power and large chip area. A digital solution is more practical because it consumes less power, avoids using large analog components, and covers a wide frequency range. In this paper, we demonstrate a system that measures the instantaneous pulse width of the input clock, finds the average pulse width, and produces a non-jittery clock. We employ a digital sigma-delta modulator to low-pass filter the input pulse count because the DSDM is simple yet provides the narrow bandwidth to compute the average. It is also immune to quantization error and allows fast lock. To reduce power consumption, we activate the filter only when both the input and output counters are ready. We further reduce component count by implementing the DSDM as a three-cycle process. MATLAB- and RTL-level simulation results are presented.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"08 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":"133354273","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
Micromachined probes for on-wafer measurement of millimeter- and submillimeter-wave devices and components 用于毫米波和亚毫米波器件和组件的片上测量的微机械探头
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6736989
R. Weikle, N. S. Barker, A. Lichtenberger, M. Bauwens
{"title":"Micromachined probes for on-wafer measurement of millimeter- and submillimeter-wave devices and components","authors":"R. Weikle, N. S. Barker, A. Lichtenberger, M. Bauwens","doi":"10.1109/GlobalSIP.2013.6736989","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736989","url":null,"abstract":"Terahertz components and devices are typically interfaced with measurement instrumentation and characterized using fixtures equipped with waveguide flanges. Because such fixtures are known to introduce significant uncertainty and error in measurement, it is preferable to characterize such devices in-situ, where the device under test can be measured on-wafer, prior to dicing and separately from the circuit housing to which it is ultimately affixed. This is common practice in the RF and millimeter-wave region using probe stations equipped with coplanar launchers. Commercial coplanar waveguide probes have generally been available to the WR-2.2 band (325-500 GHz) but few options currently exist for on-wafer measurements above these frequencies. This paper describes recent work at the University of Virginia and Dominion Microprobes, Inc. to extend on-wafer measurement capabilities to terahertz frequencies through the design and implementation of coplanar probes based on silicon micromachining. At present micromachined on-wafer probes operating to WR1.2 (600 to 900 GHz) have been demonstrated and exhibit typical insertion losses lower than 7 dB with return loss of 15 dB or greater over a full waveguide band.","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":"131876406","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}
引用次数: 0
Workload analysis and efficient OpenCL-based implementation of SIFT algorithm on a smartphone 基于opencl的SIFT算法在智能手机上的工作负载分析和高效实现
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6737002
Guohui Wang, Blaine Rister, Joseph R. Cavallaro
{"title":"Workload analysis and efficient OpenCL-based implementation of SIFT algorithm on a smartphone","authors":"Guohui Wang, Blaine Rister, Joseph R. Cavallaro","doi":"10.1109/GlobalSIP.2013.6737002","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737002","url":null,"abstract":"Feature detection and extraction are essential in computer vision applications such as image matching and object recognition. The Scale-Invariant Feature Transform (SIFT) algorithm is one of the most robust approaches to detect and extract distinctive invariant features from images. However, high computational complexity makes it difficult to apply the SIFT algorithm to mobile applications. Recent developments in mobile processors have enabled heterogeneous computing on mobile devices, such as smartphones and tablets. In this paper, we present an OpenCL-based implementation of the SIFT algorithm on a smartphone, taking advantage of the mobile GPU. We carefully analyze the SIFT workloads and identify the parallelism. We implemented major steps of the SIFT algorithm using both serial C++ code and OpenCL kernels targeting mobile processors, to compare the performance of different workflows. Based on the profiling results, we partition the SIFT algorithm between the CPU and GPU in a way that best exploits the parallelism and minimizes the buffer transferring time to achieve better performance. The experimental results show that we are able to achieve 8.5 FPS for keypoints detection and 19 FPS for descriptor generation without reducing the number and the quality of the keypoints. Moreover, the heterogeneous implementation can reduce energy consumption by 41% compared to an optimized CPU-only implementation.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"21 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":"134302509","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}
引用次数: 46
Symmetric Nash equilibrium in a secondary spectrum market 二级频谱市场中的对称纳什均衡
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6737096
Shang-Pin Sheng, M. Liu
{"title":"Symmetric Nash equilibrium in a secondary spectrum market","authors":"Shang-Pin Sheng, M. Liu","doi":"10.1109/GlobalSIP.2013.6737096","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737096","url":null,"abstract":"The scarcity of spectrum resources and the desire to improve spectrum efficiency have led to extensive research and development in recent years in such concepts as dynamic spectrum access/sharing, open access, and secondary (spot or short-term) spectrum market. The secondary spectrum market allows the primary (spectrum owner) to sell/share underutilized spectrum to potential buyers so as to maximize usage of spectrum, e.g., using the auction mechanism [1], [2], [3]. In this paper, we propose a framework similar to [4] where the sellers propose contracts to the secondary spectrum buyers.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"2016 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":"134331471","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
Node removal vulnerability of the largest component of a network 网络中最大组成部分的节点移除漏洞
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6736946
Pin-Yu Chen, A. Hero
{"title":"Node removal vulnerability of the largest component of a network","authors":"Pin-Yu Chen, A. Hero","doi":"10.1109/GlobalSIP.2013.6736946","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736946","url":null,"abstract":"The connectivity structure of a network can be very sensitive to removal of certain nodes in the network. In this paper, we study the sensitivity of the largest component size to node removals. We prove that minimizing the largest component size is equivalent to solving a matrix one-norm minimization problem whose column vectors are orthogonal and sparse and they form a basis of the null space of the associated graph Laplacian matrix. A greedy node removal algorithm is then proposed based on the matrix one-norm minimization. In comparison with other node centralities such as node degree and betweenness, experimental results on US power grid dataset validate the effectiveness of the proposed approach in terms of reduction of the largest component size with relatively few node removals.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"16 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":"124879518","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}
引用次数: 24
Optimal resource allocation for energy harvesting two-way relay systems with channel uncertainty 信道不确定的能量采集双向中继系统资源优化分配
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6736886
Imtiaz Ahmed, A. Ikhlef, D. W. K. Ng, R. Schober
{"title":"Optimal resource allocation for energy harvesting two-way relay systems with channel uncertainty","authors":"Imtiaz Ahmed, A. Ikhlef, D. W. K. Ng, R. Schober","doi":"10.1109/GlobalSIP.2013.6736886","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736886","url":null,"abstract":"In this paper, we consider two-way decode-and-forward (DF) multiple access and time division broadcasting relaying protocols with energy harvesting (EH) nodes. We propose optimal offline joint energy and transmission time allocation schemes for the considered relaying protocols taking into account channel state uncertainty. The proposed joint energy and transmission time allocation schemes are obtained based on convex optimization problems and maximize the aggregate system throughput over a finite number of transmission intervals.We compare the optimal throughputs obtained for the multiple access and time division broadcasting protocols via simulations. Our results reveal that the proposed schemes are robust to imperfect channel state information and that multiple access broadcasting is less affected by low harvesting rate at the relay than time division broadcasting.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"14 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":"131992019","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}
引用次数: 18
Inference of functional connectivity in Neurosciences via Hawkes processes 霍克斯过程对神经科学中功能连通性的推断
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GLOBALSIP.2013.6736879
P. Reynaud-Bouret, V. Rivoirard, Christine Tuleau-Malot
{"title":"Inference of functional connectivity in Neurosciences via Hawkes processes","authors":"P. Reynaud-Bouret, V. Rivoirard, Christine Tuleau-Malot","doi":"10.1109/GLOBALSIP.2013.6736879","DOIUrl":"https://doi.org/10.1109/GLOBALSIP.2013.6736879","url":null,"abstract":"We use Hawkes processes as models for spike trains analysis. A new Lasso method designed for general multivariate counting processes [1] enables us to estimate the functional connectivity graph between the different recorded neurons.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"20 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":"131535673","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}
引用次数: 96
Efficient reconfigurable scheme for the recovery of sub-Nyquist sampled sparse multi-band signals 一种亚奈奎斯特采样稀疏多带信号恢复的高效可重构方案
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6737146
A. K. M. Pillai, H. Johansson
{"title":"Efficient reconfigurable scheme for the recovery of sub-Nyquist sampled sparse multi-band signals","authors":"A. K. M. Pillai, H. Johansson","doi":"10.1109/GlobalSIP.2013.6737146","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737146","url":null,"abstract":"Sub-Nyquist sampling makes use of sparsities in analog signals to sample them at a rate lower than the Nyquist rate. The reduction in sampling rate, however, comes at the cost of additional digital signal processing (DSP) which is required to reconstruct the uniformly sampled sequence at the output of the sub-Nyquist sampling analog-to-digital converter. At present, this additional processing is computationally intensive and time consuming and offsets the gains obtained from the reduced sampling rate. This paper focuses on sparse multi-band signals where the user band locations can change from time to time and the reconstructor requires real-time redesign. We propose a technique that can reduce the computational complexity of the reconstructor. At the same time, the proposed scheme simplifies the online reconfigurability of the reconstructor.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"6 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":"131958872","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
Networked optimization with adaptive communication 网络优化与自适应通信
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6736944
Konstantinos I. Tsianos, Sean F. Lawlor, J. Yu, M. Rabbat
{"title":"Networked optimization with adaptive communication","authors":"Konstantinos I. Tsianos, Sean F. Lawlor, J. Yu, M. Rabbat","doi":"10.1109/GlobalSIP.2013.6736944","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736944","url":null,"abstract":"Methods for distributed optimization are necessary to solve large-scale problems such as those becoming more common in machine learning. The communication cost associated with transmitting large messages can become a serious performance bottleneck. We propose a consensus-based distributed algorithm to minimize a convex separable objective. Each node holds one component of the objective function, and the nodes alternate between a computation phase, where local gradient steps are performed based on the local objective, and a communication phase, where consensus steps are performed to bring the local states into agreement. The nodes use local decision rules to adaptively determine when communication is not necessary. This results in significantly lower communication costs and allows a user to tradeoff the amount of communication with the accuracy of the final output. Experiments on a cluster using simulated and real datasets illustrate the tradeoff.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"12 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":"132322925","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}
引用次数: 19
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学术官方微信
小红书