2018 IEEE Statistical Signal Processing Workshop (SSP)最新文献

筛选
英文 中文
Tempered Fractional Brownian Motion: Wavelet Estimation and Modeling of Turbulence in Geophysical Flows 调质分数布朗运动:地球物理流湍流的小波估计与模拟
2018 IEEE Statistical Signal Processing Workshop (SSP) Pub Date : 2018-06-01 DOI: 10.1109/SSP.2018.8450714
B. C. Boniece, Farzad Sabzikar, G. Didier
{"title":"Tempered Fractional Brownian Motion: Wavelet Estimation and Modeling of Turbulence in Geophysical Flows","authors":"B. C. Boniece, Farzad Sabzikar, G. Didier","doi":"10.1109/SSP.2018.8450714","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450714","url":null,"abstract":"Fractional Brownian motion (fBm) is a Gaussian, stationary-increment process whose self-similarity property is governed by the so-named Hurst parameter H ∈ (0,1). FBm is one of the most widely used models of scale invariance, and its instance H = 1/3 corresponds to the classical Kolmogorov spectrum for the inertial range of turbulence. Tempered fractional Brownian motion (tfBm) was recently introduced as a new canonical model that displays the so-named Davenport spectrum, a model that also accounts for the low frequency behavior of turbulence. The autocorrelation of its increments displays semi-long range dependence, i.e., hyperbolic decay over moderate scales and quasi-exponential decay over large scales. The latter property has now been observed in many phenomena, from wind speed to geophysics to finance. This paper introduces a wavelet framework to construct the first estimation method for tfBm. The properties of the wavelet coefficients and spectrum of tfBm are studied, and the estimator’s performance is assessed by means of Monte Carlo experiments. We also use tfBm to model geophysical flow data in the wavelet domain and show that tfBm provides a closer fit than fBm.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122908801","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}
引用次数: 3
On the Timing Synchronization under 1-Bit Quantization and Oversampling 1位量化和过采样下的定时同步
2018 IEEE Statistical Signal Processing Workshop (SSP) Pub Date : 2018-06-01 DOI: 10.1109/SSP.2018.8450761
Martin Schlüter, Meik Dörpinghaus, G. Fettweis
{"title":"On the Timing Synchronization under 1-Bit Quantization and Oversampling","authors":"Martin Schlüter, Meik Dörpinghaus, G. Fettweis","doi":"10.1109/SSP.2018.8450761","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450761","url":null,"abstract":"As the demand for communication systems with high data rates is increasing, large bandwidths, and thus high sampling rates, are required. As a consequence, the energy consumption of conventional high resolution analog-to-digital converters increases drastically. On the contrary, high resolution in time domain is less difficult to achieve than high resolution in amplitude domain. This motivates the design of communication systems with 1-bit quantization and oversampling. It has been shown that utilizing run-length limited sequences and faster-than-Nyquist signaling is beneficial in terms of achievable rate. However, it is an open question how receiver synchronization can be performed in such systems. In this work we assume perfect frame, frequency and phase synchronization and investigate the effect of a fixed but unknown time shift. Due to 1-bit quantization, standard timing estimation and interpolation cannot be applied. We show that oversampling w.r.t. the signaling rate compensates for the error introduced by the time shift. If the oversampling factor is an integer value, estimating the time shift becomes obsolete if the oversampling rate is sufficiently high.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127772115","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
Adaptive Step Size Momentum Method For Deconvolution 反卷积的自适应步长动量法
2018 IEEE Statistical Signal Processing Workshop (SSP) Pub Date : 2018-06-01 DOI: 10.1109/SSP.2018.8450762
Trung Vu, R. Raich
{"title":"Adaptive Step Size Momentum Method For Deconvolution","authors":"Trung Vu, R. Raich","doi":"10.1109/SSP.2018.8450762","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450762","url":null,"abstract":"In this paper, we introduce an adaptive step size schedule that can significantly improve the convergence rate of momentum method for deconvolution applications. We provide analysis to show that the proposed method can asymptotically recover the optimal rate of convergence for first-order gradient methods applied to minimize smooth convex functions. In a convolution setting, we demonstrate that our adaptive schedule can be implemented efficiently without adding computational complexity to traditional gradient schemes.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123106270","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}
引用次数: 2
Least-Squares Signal Synthesis From Modified S-Transform 基于改进s变换的最小二乘信号合成
2018 IEEE Statistical Signal Processing Workshop (SSP) Pub Date : 2018-06-01 DOI: 10.1109/SSP.2018.8450851
Yazan Abdoush, G. Pojani, G. Corazza
{"title":"Least-Squares Signal Synthesis From Modified S-Transform","authors":"Yazan Abdoush, G. Pojani, G. Corazza","doi":"10.1109/SSP.2018.8450851","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450851","url":null,"abstract":"The S-transform (ST) is a linear time-frequency representation containing characteristics from the short-time Fourier transform and the wavelet transform with a frequency-dependent localizing window. As other linear time-frequency representations, one of the main applications of the ST is time-frequency filtering, which necessitates devising efficient methods for signal reconstruction from modified representations. In this paper, an algorithm for least-squares synthesis from modified ST is presented, requiring the same computational complexity as the forward transform. Additionally, for the same purpose, another faster and more flexible method is developed by means of which the signal is reconstructed by using only part of the modified representation whose size is similar to that of the original signal and contains almost no redundant information.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"436 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123457524","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}
引用次数: 2
Sparse Bayesian Learning for Directions of Arrival on an FPGA 基于FPGA的稀疏贝叶斯到达方向学习
2018 IEEE Statistical Signal Processing Workshop (SSP) Pub Date : 2018-06-01 DOI: 10.1109/SSP.2018.8450684
H. Groll, C. Mecklenbräuker, P. Gerstoft
{"title":"Sparse Bayesian Learning for Directions of Arrival on an FPGA","authors":"H. Groll, C. Mecklenbräuker, P. Gerstoft","doi":"10.1109/SSP.2018.8450684","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450684","url":null,"abstract":"A direction of arrival (DOA) estimator based on sparse Bayesian learning (SBL) is implemented as a fixed-point arithmetic prototype for an FPGA platform. The prototype is developed from a known algorithm mainly using high-level synthesis with C++ based model specifications. The specialized equations of the algorithm are reduced to arithmetic operations considering the signal flow within the iterative structure. Cholesky factorization is used to solve the matrix inverse problem. Scheduling of each module is done as soon as possible to make use of the parallel FPGA architecture. Different fixed-point word length assumptions are explained and implementation results are shown in terms of resources and latency. Finally, a representative DOA source scenario is simulated and tested with the implemented prototype hardware in the loop. The comparison with a floating-point reference implementation is found to have good agreement with the fixed-point implementation.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"439 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122887464","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}
引用次数: 3
Signal-to-Noise-Ratio Analysis of Compressive Data Acquisition 压缩数据采集的信噪比分析
2018 IEEE Statistical Signal Processing Workshop (SSP) Pub Date : 2018-06-01 DOI: 10.1109/SSP.2018.8450796
R. Pribic, G. Leus, Christos Tzotzadinis
{"title":"Signal-to-Noise-Ratio Analysis of Compressive Data Acquisition","authors":"R. Pribic, G. Leus, Christos Tzotzadinis","doi":"10.1109/SSP.2018.8450796","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450796","url":null,"abstract":"Data acquisition in compressive sensing (CS) is commonly believed to be less complicated, and even less costly, while performing agreeably. There is a major lack of measureable foundations supporting this optimism as the performance and complexity of a CS sensor have hardly been quantified. We aim to fill the gap by computing the performance of diverse compressive data acquisition schemes by the output signal-to-noise ratio (SNR) they provide with the same input signal. The SNR is assessed analytically, and also confirmed numerically with simulated data. Only with a scheme of compressive data acquisition starting directly at reception (with no receiver noise yet), CS is less complicated and still performs as good as, if not better than, existing sensing.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126129015","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
Multi-Branch Binary Modulation Sequences For Interferer Rejection 用于抗干扰的多支路二进制调制序列
2018 IEEE Statistical Signal Processing Workshop (SSP) Pub Date : 2018-06-01 DOI: 10.1109/SSP.2018.8450861
Dian Mo, Marco F. Duarte
{"title":"Multi-Branch Binary Modulation Sequences For Interferer Rejection","authors":"Dian Mo, Marco F. Duarte","doi":"10.1109/SSP.2018.8450861","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450861","url":null,"abstract":"When the techniques of random modulation are used in wideband communication receivers, one can design spectrally shaped sequences that mitigate interferers while preserving messages to reduce distortion caused by amplifier nonlinearity and noise. For sampling rates that are too high for standard modulation, one can instead rely on multi-branch architectures involving multiple modulators working at reduced sampling rates. In this paper, we propose an algorithm to design a set of binary sequences to be used in multi-branch modulation to mitigate a strong interferer while allowing for stable message recovery. The implementation consists of a quadratic program that is relaxed into a semidefinite program combined with a randomized projection. While interferer signals are often modeled as a subspace under the discrete Fourier transform, spectrum leakage occurs when the signal contains so-called off-grid frequencies. The Slepian basis provides a much better-suited representation for such bandlimited signals that mitigates spectrum leakage. We use both representations during the evaluation of our design algorithm, where numerical simulations show the advantages of our sequence designs versus the state of the art.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129507291","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}
引用次数: 2
Sparse Power Factorization With Refined Peakiness Conditions 精细峰值条件下的稀疏功率分解
2018 IEEE Statistical Signal Processing Workshop (SSP) Pub Date : 2018-06-01 DOI: 10.1109/SSP.2018.8450850
Dominik Stöger, Jakob Geppert, F. Krahmer
{"title":"Sparse Power Factorization With Refined Peakiness Conditions","authors":"Dominik Stöger, Jakob Geppert, F. Krahmer","doi":"10.1109/SSP.2018.8450850","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450850","url":null,"abstract":"Many important signal processing tasks, like blind deconvolution and self-calibration, can be modeled as a bilinear inverse problem, meaning that the observation $y$ depends Iinearly on two unknown vectors $u$ and $v$. In many of these problems, at least one of the input vectors can be assumed to be sparse, i.e., to have only few non-zero entries. Sparse Power Factorization (SPF), proposed by Lee, Wu, and Bresler, aims to tackle this problem. Under the assumption that the measurements are random, they established recovery guarantees for signals with a significant portion of the mass concentrated in a single entry at a sampling rate, which scales with the intrinsic dimension of the signals. In this note we extend these recovery guarantees to a broader and more realistic class of signals, at the cost of a slightly increased number of measurements. Namely, we require that a significant portion of the mass is concentrated in a small set of entries (rather than just one entry).","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122578486","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}
引用次数: 2
Data Clustering Using Matrix Factorization Techniques for Wireless Propagation Map Reconstruction 基于矩阵分解技术的数据聚类无线传播图重构
2018 IEEE Statistical Signal Processing Workshop (SSP) Pub Date : 2018-06-01 DOI: 10.1109/SSP.2018.8450795
Junting Chen, U. Mitra
{"title":"Data Clustering Using Matrix Factorization Techniques for Wireless Propagation Map Reconstruction","authors":"Junting Chen, U. Mitra","doi":"10.1109/SSP.2018.8450795","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450795","url":null,"abstract":"This paper develops an efficient data clustering technique by transforming and compressing the measurement data to a low-dimensional feature matrix, based on which, matrix factorization techniques can be applied to extract the key parameters for data clustering. For the application of wireless propagation map reconstruction, a theoretical result is developed to justify that the feature matrix is a composite of several unimodal matrices, each containing key parameters for an individual propagation region. As a result, instead of iterating with $N$ data points at each step, the proposed scheme provides a low complexity online solution for data clustering based on the feature matrix with dimension much smaller than $N.$","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121299771","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}
引用次数: 2
Secrecy Capacity Analysis of Transmit-Receive Diversity Systems 收发分集系统的保密能力分析
2018 IEEE Statistical Signal Processing Workshop (SSP) Pub Date : 2018-06-01 DOI: 10.1109/SSP.2018.8450857
K. Maichalernnukul
{"title":"Secrecy Capacity Analysis of Transmit-Receive Diversity Systems","authors":"K. Maichalernnukul","doi":"10.1109/SSP.2018.8450857","DOIUrl":"https://doi.org/10.1109/SSP.2018.8450857","url":null,"abstract":"An exact closed-form expression is derived for the average secrecy capacity of transmit-receive diversity systems in Rayleigh fading channels. Moreover, a simple upper bound on this capacity and its asymptotic approximation are presented. Numerical results corroborating the theoretical analysis are also provided.","PeriodicalId":330528,"journal":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116428488","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
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学术官方微信