arXiv - EE - Signal Processing最新文献

筛选
英文 中文
Efficient FPGA Implementation of an Optimized SNN-based DFE for Optical Communications 为光通信高效实现基于 SNN 的优化 DFE
arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.08698
Mohamed Moursi, Jonas Ney, Bilal Hammoud, Norbert Wehn
{"title":"Efficient FPGA Implementation of an Optimized SNN-based DFE for Optical Communications","authors":"Mohamed Moursi, Jonas Ney, Bilal Hammoud, Norbert Wehn","doi":"arxiv-2409.08698","DOIUrl":"https://doi.org/arxiv-2409.08698","url":null,"abstract":"The ever-increasing demand for higher data rates in communication systems\u0000intensifies the need for advanced non-linear equalizers capable of higher\u0000performance. Recently artificial neural networks (ANNs) were introduced as a\u0000viable candidate for advanced non-linear equalizers, as they outperform\u0000traditional methods. However, they are computationally complex and therefore\u0000power hungry. Spiking neural networks (SNNs) started to gain attention as an\u0000energy-efficient alternative to ANNs. Recent works proved that they can\u0000outperform ANNs at this task. In this work, we explore the design space of an\u0000SNN-based decision-feedback equalizer (DFE) to reduce its computational\u0000complexity for an efficient implementation on field programmable gate array\u0000(FPGA). Our Results prove that it achieves higher communication performance\u0000than ANN-based DFE at roughly the same throughput and at 25X higher energy\u0000efficiency.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251430","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
Symbol-Level Precoding-Based Self-Interference Cancellation for ISAC Systems 基于符号级预编码的 ISAC 系统自干扰消除
arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.08608
Shu Cai, Zihao Chen, Ya-Feng Liu, Jun Zhang
{"title":"Symbol-Level Precoding-Based Self-Interference Cancellation for ISAC Systems","authors":"Shu Cai, Zihao Chen, Ya-Feng Liu, Jun Zhang","doi":"arxiv-2409.08608","DOIUrl":"https://doi.org/arxiv-2409.08608","url":null,"abstract":"Consider an integrated sensing and communication (ISAC) system where a base\u0000station (BS) employs a full-duplex radio to simultaneously serve multiple users\u0000and detect a target. The detection performance of the BS may be compromised by\u0000self-interference (SI) leakage. This paper investigates the feasibility of SI\u0000cancellation (SIC) through the application of symbol-level precoding (SLP). We\u0000first derive the target detection probability in the presence of the SI. We\u0000then formulate an SLP-based SIC problem, which optimizes the target detection\u0000probability while satisfying the quality of service requirements of all users.\u0000The formulated problem is a nonconvex fractional programming (FP) problem with\u0000a large number of equality and inequality constraints. We propose a\u0000penalty-based block coordinate descent (BCD) algorithm for solving the\u0000formulated problem, which allows for efficient closed-form updates of each\u0000block of variables at each iteration. Finally, numerical simulation results are\u0000presented to showcase the enhanced detection performance of the proposed SIC\u0000approach.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251432","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
On the Restricted Isometry Property of Kronecker-structured Matrices 论克罗内克结构矩阵的限制等势特性
arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.08699
Yanbin He, Geethu Joseph
{"title":"On the Restricted Isometry Property of Kronecker-structured Matrices","authors":"Yanbin He, Geethu Joseph","doi":"arxiv-2409.08699","DOIUrl":"https://doi.org/arxiv-2409.08699","url":null,"abstract":"In this work, we study the restricted isometry property (RIP) of\u0000Kronecker-structured matrices, formed by the Kronecker product of two factor\u0000matrices. Previously, only upper and lower bounds on the restricted isometry\u0000constant (RIC) in terms of the RICs of the factor matrices were known. We\u0000derive a probabilistic measurement bound for the $s$th-order RIC. We show that\u0000the Kronecker product of two sub-Gaussian matrices satisfies RIP with high\u0000probability if the minimum number of rows among two matrices is $mathcal{O}(s\u0000ln max{N_1, N_2})$. Here, $s$ is the sparsity level, and $N_1$ and $N_2$\u0000are the number of columns in the matrices. We also present improved measurement\u0000bounds for the recovery of Kronecker-structured sparse vectors using\u0000Kronecker-structured measurement matrices. Finally, our analysis is further\u0000extended to the Kronecker product of more than two matrices.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251428","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
Low Complexity DoA-ToA Signature Estimation for Multi-Antenna Multi-Carrier Systems 多天线多载波系统的低复杂度 DoA-ToA 信号估计
arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.08650
Chandrashekhar Rai, Debarati Sen
{"title":"Low Complexity DoA-ToA Signature Estimation for Multi-Antenna Multi-Carrier Systems","authors":"Chandrashekhar Rai, Debarati Sen","doi":"arxiv-2409.08650","DOIUrl":"https://doi.org/arxiv-2409.08650","url":null,"abstract":"Accurate direction of arrival (DoA) and time of arrival (ToA) estimation is\u0000an stringent requirement for several wireless systems like sonar, radar,\u0000communications, and dual-function radar communication (DFRC). Due to the use of\u0000high carrier frequency and bandwidth, most of these systems are designed with\u0000multiple antennae and subcarriers. Although the resolution is high in the large\u0000array regime, the DoA-ToA estimation accuracy of the practical on-grid\u0000estimation methods still suffers from estimation inaccuracy due to the spectral\u0000leakage effect. In this article, we propose DoA-ToA estimation methods for\u0000multi-antenna multi-carrier systems with an orthogonal frequency division\u0000multiplexing (OFDM) signal. In the first method, we apply discrete Fourier\u0000transform (DFT) based coarse signature estimation and propose a low complexity\u0000multistage fine-tuning for extreme enhancement in the estimation accuracy. The\u0000second method is based on compressed sensing, where we achieve the\u0000super-resolution by taking a 2D-overcomplete angle-delay dictionary than the\u0000actual number of antenna and subcarrier basis. Unlike the vectorized 1D-OMP\u0000method, we apply the low complexity 2D-OMP method on the matrix data model that\u0000makes the use of CS methods practical in the context of large array regimes.\u0000Through numerical simulations, we show that our proposed methods achieve the\u0000similar performance as that of the subspace-based 2D-MUSIC method with a\u0000significant reduction in computational complexity.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251431","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
Fast Structured Orthogonal Dictionary Learning using Householder Reflections 利用豪斯顿反射进行快速结构化正交字典学习
arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.09138
Anirudh Dash, Aditya Siripuram
{"title":"Fast Structured Orthogonal Dictionary Learning using Householder Reflections","authors":"Anirudh Dash, Aditya Siripuram","doi":"arxiv-2409.09138","DOIUrl":"https://doi.org/arxiv-2409.09138","url":null,"abstract":"In this paper, we propose and investigate algorithms for the structured\u0000orthogonal dictionary learning problem. First, we investigate the case when the\u0000dictionary is a Householder matrix. We give sample complexity results and show\u0000theoretically guaranteed approximate recovery (in the $l_{infty}$ sense) with\u0000optimal computational complexity. We then attempt to generalize these\u0000techniques when the dictionary is a product of a few Householder matrices. We\u0000numerically validate these techniques in the sample-limited setting to show\u0000performance similar to or better than existing techniques while having much\u0000improved computational complexity.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251375","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
Train-On-Request: An On-Device Continual Learning Workflow for Adaptive Real-World Brain Machine Interfaces 按需训练:用于自适应真实世界脑机接口的设备上持续学习工作流程
arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.09161
Lan Mei, Cristian Cioflan, Thorir Mar Ingolfsson, Victor Kartsch, Andrea Cossettini, Xiaying Wang, Luca Benini
{"title":"Train-On-Request: An On-Device Continual Learning Workflow for Adaptive Real-World Brain Machine Interfaces","authors":"Lan Mei, Cristian Cioflan, Thorir Mar Ingolfsson, Victor Kartsch, Andrea Cossettini, Xiaying Wang, Luca Benini","doi":"arxiv-2409.09161","DOIUrl":"https://doi.org/arxiv-2409.09161","url":null,"abstract":"Brain-machine interfaces (BMIs) are expanding beyond clinical settings thanks\u0000to advances in hardware and algorithms. However, they still face challenges in\u0000user-friendliness and signal variability. Classification models need periodic\u0000adaptation for real-life use, making an optimal re-training strategy essential\u0000to maximize user acceptance and maintain high performance. We propose TOR, a\u0000train-on-request workflow that enables user-specific model adaptation to novel\u0000conditions, addressing signal variability over time. Using continual learning,\u0000TOR preserves knowledge across sessions and mitigates inter-session\u0000variability. With TOR, users can refine, on demand, the model through on-device\u0000learning (ODL) to enhance accuracy adapting to changing conditions. We evaluate\u0000the proposed methodology on a motor-movement dataset recorded with a\u0000non-stigmatizing wearable BMI headband, achieving up to 92% accuracy and a\u0000re-calibration time as low as 1.6 minutes, a 46% reduction compared to a naive\u0000transfer learning workflow. We additionally demonstrate that TOR is suitable\u0000for ODL in extreme edge settings by deploying the training procedure on a\u0000RISC-V ultra-low-power SoC (GAP9), resulting in 21.6 ms of latency and 1 mJ of\u0000energy consumption per training step. To the best of our knowledge, this work\u0000is the first demonstration of an online, energy-efficient, dynamic adaptation\u0000of a BMI model to the intrinsic variability of EEG signals in real-time\u0000settings.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251372","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
Turbo Equalization with Coarse Quantization using the Information Bottleneck Method 使用信息瓶颈法进行粗量化的 Turbo 均衡
arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.09004
Philipp Mohr, Jasper Brüggmann, Gerhard Bauch
{"title":"Turbo Equalization with Coarse Quantization using the Information Bottleneck Method","authors":"Philipp Mohr, Jasper Brüggmann, Gerhard Bauch","doi":"arxiv-2409.09004","DOIUrl":"https://doi.org/arxiv-2409.09004","url":null,"abstract":"This paper proposes a turbo equalizer for intersymbol interference channels\u0000(ISI) that uses coarsely quantized messages across all receiver components.\u0000Lookup tables (LUTs) carry out compression operations designed with the\u0000information bottleneck method aiming to maximize relevant mutual information.\u0000The turbo setup consists of an equalizer and a decoder that provide extrinsic\u0000information to each other over multiple turbo iterations. We develop simplified\u0000LUT structures to incorporate the decoder feedback in the equalizer with\u0000significantly reduced complexity. The proposed receiver is optimized for\u0000selected ISI channels. A conceptual hardware implementation is developed to\u0000compare the area efficiency and error correction performance. A thorough\u0000analysis reveals that LUT-based configurations with very coarse quantization\u0000can achieve higher area efficiency than conventional equalizers. Moreover, the\u0000proposed turbo setups can outperform the respective non-turbo setups regarding\u0000area efficiency and error correction capability.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251435","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
Using Ear-EEG to Decode Auditory Attention in Multiple-speaker Environment 利用耳电子脑电图解码多扬声器环境中的听觉注意力
arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.08710
Haolin Zhu, Yujie Yan, Xiran Xu, Zhongshu Ge, Pei Tian, Xihong Wu, Jing Chen
{"title":"Using Ear-EEG to Decode Auditory Attention in Multiple-speaker Environment","authors":"Haolin Zhu, Yujie Yan, Xiran Xu, Zhongshu Ge, Pei Tian, Xihong Wu, Jing Chen","doi":"arxiv-2409.08710","DOIUrl":"https://doi.org/arxiv-2409.08710","url":null,"abstract":"Auditory Attention Decoding (AAD) can help to determine the identity of the\u0000attended speaker during an auditory selective attention task, by analyzing and\u0000processing measurements of electroencephalography (EEG) data. Most studies on\u0000AAD are based on scalp-EEG signals in two-speaker scenarios, which are far from\u0000real application. Ear-EEG has recently gained significant attention due to its\u0000motion tolerance and invisibility during data acquisition, making it easy to\u0000incorporate with other devices for applications. In this work, participants\u0000selectively attended to one of the four spatially separated speakers' speech in\u0000an anechoic room. The EEG data were concurrently collected from a scalp-EEG\u0000system and an ear-EEG system (cEEGrids). Temporal response functions (TRFs) and\u0000stimulus reconstruction (SR) were utilized using ear-EEG data. Results showed\u0000that the attended speech TRFs were stronger than each unattended speech and\u0000decoding accuracy was 41.3% in the 60s (chance level of 25%). To further\u0000investigate the impact of electrode placement and quantity, SR was utilized in\u0000both scalp-EEG and ear-EEG, revealing that while the number of electrodes had a\u0000minor effect, their positioning had a significant influence on the decoding\u0000accuracy. One kind of auditory spatial attention detection (ASAD) method,\u0000STAnet, was testified with this ear-EEG database, resulting in 93.1% in\u00001-second decoding window. The implementation code and database for our work are\u0000available on GitHub: https://github.com/zhl486/Ear_EEG_code.git and Zenodo:\u0000https://zenodo.org/records/10803261.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251427","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
Finite Sample Analysis of Distribution-Free Confidence Ellipsoids for Linear Regression 线性回归无分布置信椭圆的有限样本分析
arXiv - EE - Signal Processing Pub Date : 2024-09-13 DOI: arxiv-2409.08801
Szabolcs Szentpéteri, Balázs Csanád Csáji
{"title":"Finite Sample Analysis of Distribution-Free Confidence Ellipsoids for Linear Regression","authors":"Szabolcs Szentpéteri, Balázs Csanád Csáji","doi":"arxiv-2409.08801","DOIUrl":"https://doi.org/arxiv-2409.08801","url":null,"abstract":"The least squares (LS) estimate is the archetypical solution of linear\u0000regression problems. The asymptotic Gaussianity of the scaled LS error is often\u0000used to construct approximate confidence ellipsoids around the LS estimate,\u0000however, for finite samples these ellipsoids do not come with strict\u0000guarantees, unless some strong assumptions are made on the noise distributions.\u0000The paper studies the distribution-free Sign-Perturbed Sums (SPS) ellipsoidal\u0000outer approximation (EOA) algorithm which can construct non-asymptotically\u0000guaranteed confidence ellipsoids under mild assumptions, such as independent\u0000and symmetric noise terms. These ellipsoids have the same center and\u0000orientation as the classical asymptotic ellipsoids, only their radii are\u0000different, which radii can be computed by convex optimization. Here, we\u0000establish high probability non-asymptotic upper bounds for the sizes of SPS\u0000outer ellipsoids for linear regression problems and show that the volumes of\u0000these ellipsoids decrease at the optimal rate. Finally, the difference between\u0000our theoretical bounds and the empirical sizes of the regions are investigated\u0000experimentally.","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142251426","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
Domain Adaptation for DoA Estimation in Multipath Channels with Interferences 在有干扰的多径信道中进行 DoA 估算的域自适应
arXiv - EE - Signal Processing Pub Date : 2024-09-12 DOI: arxiv-2409.07782
Amitay Bar, Joseph S. Picard, Israel Cohen, Ronen Talmon
{"title":"Domain Adaptation for DoA Estimation in Multipath Channels with Interferences","authors":"Amitay Bar, Joseph S. Picard, Israel Cohen, Ronen Talmon","doi":"arxiv-2409.07782","DOIUrl":"https://doi.org/arxiv-2409.07782","url":null,"abstract":"We consider the problem of estimating the direction-of-arrival (DoA) of a\u0000desired source located in a known region of interest in the presence of\u0000interfering sources and multipath. We propose an approach that precedes the DoA\u0000estimation and relies on generating a set of reference steering vectors. The\u0000steering vectors' generative model is a free space model, which is beneficial\u0000for many DoA estimation algorithms. The set of reference steering vectors is\u0000then used to compute a function that maps the received signals from the adverse\u0000environment to a reference domain free from interfering sources and multipath.\u0000We show theoretically and empirically that the proposed map, which is analogous\u0000to domain adaption, improves DoA estimation by mitigating interference and\u0000multipath effects. Specifically, we demonstrate a substantial improvement in\u0000accuracy when the proposed approach is applied before three commonly used\u0000beamformers: the delay-and-sum (DS), the minimum variance distortionless\u0000response (MVDR), and the Multiple Signal Classification (MUSIC).","PeriodicalId":501034,"journal":{"name":"arXiv - EE - Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142175927","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
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学术文献互助群
群 号:481959085
Book学术官方微信