2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)最新文献

筛选
英文 中文
User-Side Indoor Localization Using CSI Fingerprinting 使用CSI指纹的用户侧室内定位
Parham Kazemi, H. Al-Tous, Christoph Studer, O. Tirkkonen
{"title":"User-Side Indoor Localization Using CSI Fingerprinting","authors":"Parham Kazemi, H. Al-Tous, Christoph Studer, O. Tirkkonen","doi":"10.1109/spawc51304.2022.9833973","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833973","url":null,"abstract":"We consider a scalable User Equipment (UE)-side indoor localization framework that processes Channel State Information (CSI) from multiple Access Points (APs). We use CSI features that are resilient to synchronization errors and other hardware impairments. As a consequence our method does not require accurate network synchronization among APs. Increasing the number of APs considered by a UE profoundly improves fingerprint positioning, with the cost of increasing complexity and channel estimation time. In order to improve scalability of the framework to large networks consisting of multiple APs in many rooms, we train a multi-layer neural network that combines CSI features and unique AP identifiers of a subset of APs in range of a UE. We simulate UE-side localization using CSI obtained from a commercial raytracer. The considered method processing frequency selective CSI achieves an average positioning error of 60cm, outperforming methods that process received signal strength information only. The mean localization accuracy loss compared to a non-scalable approach with perfect synchronization and CSI is 20cm.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122596814","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
A Sequence-Based Compressed Sensing Receiver for Impulsive Frequency Shift Keying 基于序列的脉冲频移键控压缩感知接收机
Kathleen Yang, D. C. González, Yonina C. Eldar, M. Médard
{"title":"A Sequence-Based Compressed Sensing Receiver for Impulsive Frequency Shift Keying","authors":"Kathleen Yang, D. C. González, Yonina C. Eldar, M. Médard","doi":"10.1109/spawc51304.2022.9834017","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9834017","url":null,"abstract":"Modern communications often operate in the wideband fading regime due to the increasingly crowded frequency spectrum. However, obtaining channel state information in this regime is challenging and costly. We consider the use of impulsive frequency shift keying, which is a noncoherent capacity-achieving scheme, in order to avoid the costs and challenge of obtaining channel state information in this regime. To avoid the cost of a bank of frequency-selective filters, which is the optimal noncoherent receiver, we investigate a more practical and less costly sequence-based compressed sensing receiver where the number of filters can be reduced with the tradeoff of increasing the symbol error rate. We demonstrate that the performance of a chipping sequence-based compressed sensing receiver approaches the performance of a bank of frequency-selective filters as the number of sequences used for recovery increases.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123848121","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
Towards Real-time Radio-SLAM via Optimal Importance Sampling 通过最优重要性采样实现实时无线电slam
O. Kaltiokallio, R. Hostettler, J. Talvitie, Yu Ge, Hyowon Kim, H. Wymeersch, M. Valkama
{"title":"Towards Real-time Radio-SLAM via Optimal Importance Sampling","authors":"O. Kaltiokallio, R. Hostettler, J. Talvitie, Yu Ge, Hyowon Kim, H. Wymeersch, M. Valkama","doi":"10.1109/spawc51304.2022.9833982","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833982","url":null,"abstract":"In future cellular networks, it will be possible to estimate the channel parameters of non-line-of-sight propagation paths providing unique opportunities for simultaneous localization and mapping (SLAM) with commodity user equipments (UEs). Radio-SLAM generally relies on generating samples of the UE trajectory and constructing a trajectory-conditioned map. To reduce the number of samples and complexity, we propose an iterative method to approximate the optimal sampling density. The numerical results demonstrate that the added computational complexity of the proposed method can be easily justified by the more efficient use of particles. As an outcome, the presented filter nearly achieves the lower bound and still runs in real-time.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"58-60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129927193","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
Spatially redundant, precision-constrained transmit precoding for mmWave LoS MIMO 空间冗余,精度约束的毫米波LoS MIMO发射预编码
Ahmet Dundar Sezer, Upamanyu Madhow
{"title":"Spatially redundant, precision-constrained transmit precoding for mmWave LoS MIMO","authors":"Ahmet Dundar Sezer, Upamanyu Madhow","doi":"10.1109/spawc51304.2022.9833963","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833963","url":null,"abstract":"Line of sight (LoS) multi-input multi-output (MIMO) systems have attractive scaling properties with increase in carrier frequency, with the potential for 100+Gbps links over 10s to 100s of meters with the reasonable form using the millimeter wave (mmWave) and terahertz (THz) bands. We propose and investigate an approach to all-digital LoS MIMO which addresses the difficulty of limited available precision for digital-to-analog converters (DACs) and analog-to-digital converters (ADCs). In order to reduce dynamic range requirements at the receiver, we consider spatially redundant transmit precoding (more transmit antennas than number of spatially multiplexed data streams) with 1-bit DACs. We introduce a novel approach for attaining the higher dynamic range required for precoding over the air (OTA), which we term OTA-DAC: the 1-bit DACs for clusters of transmit elements synthesize approximations to zero-forcing precoding across clusters. We illustrate our ideas for 64×4 and 16×4 LoS MIMO systems, comparing with a benchmark approach of 1-bit quantized ZF precoding for transmit elements evenly spaced across the aperture. Our OTA-DAC approach substantially outperforms the benchmark, and does not exhibit the error floors incurred by the latter.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122283925","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
Device-free Movement Tracking using the UWB Channel Impulse Response with Machine Learning 利用超宽带信道脉冲响应与机器学习的无设备运动跟踪
Sitian Li, Alexios Balatsoukas-Stimming, A. Burg
{"title":"Device-free Movement Tracking using the UWB Channel Impulse Response with Machine Learning","authors":"Sitian Li, Alexios Balatsoukas-Stimming, A. Burg","doi":"10.1109/spawc51304.2022.9833950","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833950","url":null,"abstract":"Wireless communications systems are increasingly used for environmental sensing in addition to their main purpose of transmitting information. One way to use wireless communications systems for sensing is by using the channel impulse response (CIR) which captures the physical environment. Ultra-wideband (UWB) systems have a high-resolution CIR due to their large bandwidth, making them particularly attractive for sensing purposes, especially for device-free localization tasks. In this work, we use the temporary variation of the CIR on different delay bins over a time window as features in conjunction with machine learning techniques to detect the movement position and direction of people in an indoor environment.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"265 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116823998","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
Eavesdropping Game Based on Multi-Agent Deep Reinforcement Learning 基于多智能体深度强化学习的窃听博弈
Delin Guo, Lan Tang, Luxi Yang, Ying-Chang Liang
{"title":"Eavesdropping Game Based on Multi-Agent Deep Reinforcement Learning","authors":"Delin Guo, Lan Tang, Luxi Yang, Ying-Chang Liang","doi":"10.1109/spawc51304.2022.9833927","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833927","url":null,"abstract":"This paper considers an adversarial scenario between a legitimate eavesdropper and a suspicious communication pair. All three nodes are equipped with multiple antennas. The eavesdropper, which operates in a full-duplex model, aims to wiretap the dubious communication pair via proactive jamming. On the other hand, the suspicious transmitter, which can send artificial noise (AN) to disturb the wiretap channel, aims to guarantee secrecy. More specifically, the eavesdropper adjusts jamming power to enhance the wiretap rate, while the suspicious transmitter jointly adapts the transmit power and noise power against the eavesdropping. Considering the partial observation and complicated interactions between the eavesdropper and the suspicious pair in unknown system dynamics, we model the problem as an imperfect-information stochastic game. To approach the Nash equilibrium solution of the eavesdropping game, we develop a multi-agent reinforcement learning (MARL) algorithm, termed neural fictitious self-play with soft actor-critic (NFSP-SAC), by combining the fictitious self-play (FSP) with a deep reinforcement learning algorithm, SAC. The introduction of SAC enables FSP to handle the problems with continuous and high dimension observation and action space. The simulation results demonstrate that the power allocation policies learned by our method empirically converge to a Nash equilibrium, while the compared reinforcement learning algorithms suffer from severe fluctuations during the learning process.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115383408","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
A New Outage Probability Bound for IR-HARQ and Its Application to Power Adaptation 一种新的IR-HARQ停电概率界及其在功率自适应中的应用
Wenyu Wang, Kaiming Shen
{"title":"A New Outage Probability Bound for IR-HARQ and Its Application to Power Adaptation","authors":"Wenyu Wang, Kaiming Shen","doi":"10.1109/spawc51304.2022.9833932","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833932","url":null,"abstract":"This work proposes a novel upper bound on outage probability for the incremental redundancy hybrid automatic repeat request (IR-HARQ) protocol over block fading channels. The new bound is much tighter than the classical bound due to Laneman, especially when the transmit power is limited as is often the case in the Internet of Things (IoT). We demonstrate the practical use of this new bound by showing that it enables a geometric programming approach to power adaptation for IR-HARQ. Because the new bound approximates the outage probability much more exactly, the resulting new power adaptation scheme significantly outperforms those existing methods based on the classical bound.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114481541","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
Deep Reinforcement Learning for Spatial User Density-based AP Clustering 基于空间用户密度的AP聚类深度强化学习
Charmae Franchesca Mendoza, Stefan Schwarz, M. Rupp
{"title":"Deep Reinforcement Learning for Spatial User Density-based AP Clustering","authors":"Charmae Franchesca Mendoza, Stefan Schwarz, M. Rupp","doi":"10.1109/spawc51304.2022.9833939","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833939","url":null,"abstract":"Cell-free massive MIMO combines the benefits of massive MIMO and network densification to provide a uniformly good service throughout the coverage area. This is achieved by the joint transmission from multiple distributed access points (APs)/antennas, as well as by bringing them closer to the users. However, its canonical form where all APs are connected to only a single centralized processing unit (CPU) is not scalable and hard to realize in practice. Motivated by this, we propose a deep reinforcement learning-based approach for partitioning the APs in a multi-CPU cell-free MIMO network. We exploit the available spatial user density information when deciding which APs form the disjoint clusters that are associated to the CPUs. Our simulation results show that our framework dynamically allocates more APs (forms bigger AP clusters) in areas of larger user density, leading to a better performance when compared to small cells and predefined static AP groupings.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127410826","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
A Performance Comparison of Classical and Quantum Algorithm for Active User Detection 经典算法与量子算法在活跃用户检测中的性能比较
Muhammad Idham Habibie, J. Hamie, C. Goursaud
{"title":"A Performance Comparison of Classical and Quantum Algorithm for Active User Detection","authors":"Muhammad Idham Habibie, J. Hamie, C. Goursaud","doi":"10.1109/spawc51304.2022.9833942","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833942","url":null,"abstract":"The strong growth in the number of connected mobile devices has imposed new challenges in efficiently exploiting the available networks resources. Code Domain Non-Orthogonal Multiple Access (NOMA) technique appears as a tremendous efficient solution. Each device uses its assigned code to simultaneously transmit its data along with the user identifier, without any resource reservation exchange, saving precious wireless resources. However, this requires a receiver capable of blindly detecting the active users, which is highly complex. Driven by the promising superposition property of quantum architecture, the goal of this paper is to adapt and apply the quantum Grover algorithm for Active User Detection (AUD) purpose in the context of NOMA, to alleviate the search complexity. This adapted Grover’s algorithm is compared with the optimal classical Maximum Likelihood (ML) AUD receivers, as well as with the basic classical Conventional Correlation Receiver (CCR). A benchmark on the probability of AUD is assessed as a function of the Signal to Noise Ratio (SNR) of the received signal. We show that our adapted Grover’s algorithm is very promising in high SNR regime.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126062926","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
Joint Dynamic Wireless Edge Caching and User Association: A Stochastic Optimization Approach 联合动态无线边缘缓存与用户关联:一种随机优化方法
K. Ntougias, C. Psomas, Eleni Demarchou, I. Krikidis, I. Koutsopoulos
{"title":"Joint Dynamic Wireless Edge Caching and User Association: A Stochastic Optimization Approach","authors":"K. Ntougias, C. Psomas, Eleni Demarchou, I. Krikidis, I. Koutsopoulos","doi":"10.1109/spawc51304.2022.9834034","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9834034","url":null,"abstract":"Wireless edge caching alleviates the capacity burden imposed on the backhaul of dense cellular networks while reducing the user-perceived latency. In this paper, we consider the joint optimization of caching and user association (JCA) policies with respect to the total cache hit ratio, taking into account the limited radio and storage resources, the service requirements, and the quality of the wireless channels. In order to effectively capture the dynamic nature and randomness of the system under study, which is reflected respectively in the mobility and content preferences of the users as well as in the time-variance of the wireless channels due to fading, we use a stochastic optimization framework based on Lyapunov optimization. After formulating the corresponding dynamic JCA problem, we solve this NP-hard task by applying a low-complexity heuristic algorithm that alternates at each timeslot between the caching and user association problems. Numerical simulations highlight the performance gains of the proposed dynamic JCA scheme over its static and decoupled caching/user association counterparts and shed light on the effect of various parameters on the performance.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128082407","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学术官方微信