Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833998
Niklas Bulk, C. Bockelmann, A. Dekorsy
In industrial environments with a high density of end devices, a flexible and low-latency transmission scheme is necessary. NOMA is one of the key candidates to serve multiple end devices with a limited amount of resources. To enable successive user decoding in NOMA, careful power allocation is required. Typically, either user-fairness or good SNR performance for a single user is guaranteed. In this paper, we combine a NOMA scheme with constellation shaping to relax the SNR requirements and therefore ease the requirements on power allocation schemes.
{"title":"Combining NOMA with Hierarchical Distribution Matching","authors":"Niklas Bulk, C. Bockelmann, A. Dekorsy","doi":"10.1109/spawc51304.2022.9833998","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833998","url":null,"abstract":"In industrial environments with a high density of end devices, a flexible and low-latency transmission scheme is necessary. NOMA is one of the key candidates to serve multiple end devices with a limited amount of resources. To enable successive user decoding in NOMA, careful power allocation is required. Typically, either user-fairness or good SNR performance for a single user is guaranteed. In this paper, we combine a NOMA scheme with constellation shaping to relax the SNR requirements and therefore ease the requirements on power allocation schemes.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"32 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":"133016157","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}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833967
Kai Wan, Minquan Cheng, G. Caire
This paper studies the cache-aided multiple-input single-output (MISO) broadcast problem with one-shot linear delivery, where a server with L antennas and N files is connected to K single-antenna users (each with a memory of M files) through a wireless broadcast channel, with the objective to maximize the sum Degree-of-Freedom (sum-DoF) in the whole system. Recently, a construction structure, referred to as Multiple-antenna Placement Delivery Array (MAPDA), was proposed to construct coded caching schemes for this cacheaided MISO broadcast problem based on the joint design of coded caching and zero-forcing (ZF) precoding. In this paper, we first propose an upper bound on the sum-DoF of any MAPDA scheme given a fixed cache placement. Then, under a class of cyclic placements which leads to subpacketizations on the files linear with K, we propose two MAPDAs for the case L < KM/N achieving the sum-DoF 2L, which is order optimal within a factor of 2 when M/N ≤ 1/2 compared to the upper bound under the cyclic placement.
{"title":"Multiple-antenna Placement Delivery Array with Cyclic Placement","authors":"Kai Wan, Minquan Cheng, G. Caire","doi":"10.1109/spawc51304.2022.9833967","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833967","url":null,"abstract":"This paper studies the cache-aided multiple-input single-output (MISO) broadcast problem with one-shot linear delivery, where a server with L antennas and N files is connected to K single-antenna users (each with a memory of M files) through a wireless broadcast channel, with the objective to maximize the sum Degree-of-Freedom (sum-DoF) in the whole system. Recently, a construction structure, referred to as Multiple-antenna Placement Delivery Array (MAPDA), was proposed to construct coded caching schemes for this cacheaided MISO broadcast problem based on the joint design of coded caching and zero-forcing (ZF) precoding. In this paper, we first propose an upper bound on the sum-DoF of any MAPDA scheme given a fixed cache placement. Then, under a class of cyclic placements which leads to subpacketizations on the files linear with K, we propose two MAPDAs for the case L < KM/N achieving the sum-DoF 2L, which is order optimal within a factor of 2 when M/N ≤ 1/2 compared to the upper bound under the cyclic placement.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"35 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":"129033243","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}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833916
M. Laakso, A. Dowhuszko, R. Wichman
In Visible Light Communications (VLC) systems, the Light-Emitting Diode (LED) is the dominant source of non-linearity and memory effects, which are originated on phenomena that take place in both the electrical and optical domains. The impact that these LED non-idealities have on the received data symbols becomes even more notable with OFDM waveforms due to their high Peak-to-Average power Ratio (PAPR) of these signals. One simple way to address this problem consists in selecting a suitable Input Back-Off (IBO) value, forcing the LED to work in its linear region. However, such an approach limits the VLC system coverage, as it reduces the dynamic range of the OFDM signal that modulates the intensity of the optical wireless link. To provide a balance between these two conflicting goals, the use of digital predistortion can be considered instead, in order to compensate nonlinear distortion and memory effects that are added in the VLC transmitter. For this purpose, this paper studies the sources of nonlinearity and memory in phosphor-converted (PC)-LEDs in both electrical and optical domains. After that, different approaches are presented to model these effects in the PC-LED, namely the Wiener-Hammerstein, memory polynomial, and Convolutional Neural Network (CNN) models. Finally, the performance of each of these approaches for digital predistortion are experimentally evaluated in a software-defined VLC demonstrator, observing a notable improvement on the Error Vector Magnitude (EVM) when compared to the case in which no compensation is performed in transmission.
{"title":"Predistortion of OFDM signals for VLC systems using phosphor-converted LEDs","authors":"M. Laakso, A. Dowhuszko, R. Wichman","doi":"10.1109/spawc51304.2022.9833916","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833916","url":null,"abstract":"In Visible Light Communications (VLC) systems, the Light-Emitting Diode (LED) is the dominant source of non-linearity and memory effects, which are originated on phenomena that take place in both the electrical and optical domains. The impact that these LED non-idealities have on the received data symbols becomes even more notable with OFDM waveforms due to their high Peak-to-Average power Ratio (PAPR) of these signals. One simple way to address this problem consists in selecting a suitable Input Back-Off (IBO) value, forcing the LED to work in its linear region. However, such an approach limits the VLC system coverage, as it reduces the dynamic range of the OFDM signal that modulates the intensity of the optical wireless link. To provide a balance between these two conflicting goals, the use of digital predistortion can be considered instead, in order to compensate nonlinear distortion and memory effects that are added in the VLC transmitter. For this purpose, this paper studies the sources of nonlinearity and memory in phosphor-converted (PC)-LEDs in both electrical and optical domains. After that, different approaches are presented to model these effects in the PC-LED, namely the Wiener-Hammerstein, memory polynomial, and Convolutional Neural Network (CNN) models. Finally, the performance of each of these approaches for digital predistortion are experimentally evaluated in a software-defined VLC demonstrator, observing a notable improvement on the Error Vector Magnitude (EVM) when compared to the case in which no compensation is performed in transmission.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"254 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":"134361921","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}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833814
Husheng Li
In joint communications and sensing (JCS), which is a potential technology for the 6G wireless communication networks, the multiplexing of communication and sensing functions is of critical importance. In the signaling framework of orthogonal frequency division multiplexing (OFDM), if all subcarriers are used for communications (which can also be used for sensing as a byproduct), the randomness of data will add significant uncertainty to the sensing results; meanwhile, if deterministic signals are used for all subcarriers, in order to optimize the sensing performance, the function of communications is invalidated due to the loss of randomness. Therefore, it is proposed to multiplex the communication and sensing functions in different OFDM subcarriers. The mutual benefits of communication and sensing subcarriers are analyzed, in which communication subcarriers provide extra bandwidth and power for sensing, while sensing subcarriers with deterministic sensing signals are used as pilots for communication channel estimation. The allocation of power and subcarriers for communications and sensing is solved using the Edgeworth Box in economics. Numerical simulations are used to demonstrate the proposed multiplexing scheme in JCS.
{"title":"Dual-Function Multiplexing for Waveform Design in OFDM-Based Joint Communications and Sensing: An Edgeworth Box Framework","authors":"Husheng Li","doi":"10.1109/spawc51304.2022.9833814","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833814","url":null,"abstract":"In joint communications and sensing (JCS), which is a potential technology for the 6G wireless communication networks, the multiplexing of communication and sensing functions is of critical importance. In the signaling framework of orthogonal frequency division multiplexing (OFDM), if all subcarriers are used for communications (which can also be used for sensing as a byproduct), the randomness of data will add significant uncertainty to the sensing results; meanwhile, if deterministic signals are used for all subcarriers, in order to optimize the sensing performance, the function of communications is invalidated due to the loss of randomness. Therefore, it is proposed to multiplex the communication and sensing functions in different OFDM subcarriers. The mutual benefits of communication and sensing subcarriers are analyzed, in which communication subcarriers provide extra bandwidth and power for sensing, while sensing subcarriers with deterministic sensing signals are used as pilots for communication channel estimation. The allocation of power and subcarriers for communications and sensing is solved using the Edgeworth Box in economics. Numerical simulations are used to demonstrate the proposed multiplexing scheme in JCS.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"34 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":"124449054","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}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9834029
Abolfazl Zakeri, Mohammad Moltafet, Markus Leinonen, M. Codreanu
We develop online scheduling policies to minimize the sum average age of information (AoI) subject to transmission capacity and long-run average resource constraints in a multisource two-hop system, where independent sources randomly generate status update packets which are sent to the destination via a relay through error-prone links. A stochastic optimization problem is formulated and solved in known and unknown environments. For the known environment, an online nearoptimal low-complexity policy is developed using the driftplus-penalty method. For the unknown environment, a deep reinforcement learning policy is developed by employing the Lyapunov optimization theory and a dueling double deep Qnetwork. Simulation results show up to 136% performance improvement of the proposed policy compared to a greedy-based baseline policy.
{"title":"Minimizing the AoI in Multi-Source Two-Hop Systems under an Average Resource Constraint","authors":"Abolfazl Zakeri, Mohammad Moltafet, Markus Leinonen, M. Codreanu","doi":"10.1109/spawc51304.2022.9834029","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9834029","url":null,"abstract":"We develop online scheduling policies to minimize the sum average age of information (AoI) subject to transmission capacity and long-run average resource constraints in a multisource two-hop system, where independent sources randomly generate status update packets which are sent to the destination via a relay through error-prone links. A stochastic optimization problem is formulated and solved in known and unknown environments. For the known environment, an online nearoptimal low-complexity policy is developed using the driftplus-penalty method. For the unknown environment, a deep reinforcement learning policy is developed by employing the Lyapunov optimization theory and a dueling double deep Qnetwork. Simulation results show up to 136% performance improvement of the proposed policy compared to a greedy-based baseline policy.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"12 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":"124823406","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}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833951
Itsuki Watanabe, Takumi Takahashi, S. Ibi, Antti Tölli, S. Sampei
We propose a novel message passing de-quantization (MPDQ) algorithm for low-complexity uplink signal detection in mmWave large multi-user multi-input multi-output (MU-MIMO) systems with low-resolution analog-to-digital converters (ADCs) suffering from severe quantization errors. The proposed method consists of a de-quantization (DQ) step based on the Bussgang theorem and a Bayesian multi-user detection (MUD) via Gaussian belief propagation (GaBP), which detects the uplink signal while compensating for the quantized signal distortion. The efficacy is demonstrated by simulation results, which are shown to significantly outperform the current state-of-the-art (SotA) detection designed by Bussgang minimum mean square error (BMMSE) and generalized approximate message passing (GAMP) frameworks in 1-bit quantization, and approach the matched filter bound (MFB) performance.
{"title":"Gaussian Belief Propagation for mmWave Large MIMO Detection with Low-Resolution ADCs","authors":"Itsuki Watanabe, Takumi Takahashi, S. Ibi, Antti Tölli, S. Sampei","doi":"10.1109/spawc51304.2022.9833951","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833951","url":null,"abstract":"We propose a novel message passing de-quantization (MPDQ) algorithm for low-complexity uplink signal detection in mmWave large multi-user multi-input multi-output (MU-MIMO) systems with low-resolution analog-to-digital converters (ADCs) suffering from severe quantization errors. The proposed method consists of a de-quantization (DQ) step based on the Bussgang theorem and a Bayesian multi-user detection (MUD) via Gaussian belief propagation (GaBP), which detects the uplink signal while compensating for the quantized signal distortion. The efficacy is demonstrated by simulation results, which are shown to significantly outperform the current state-of-the-art (SotA) detection designed by Bussgang minimum mean square error (BMMSE) and generalized approximate message passing (GAMP) frameworks in 1-bit quantization, and approach the matched filter bound (MFB) performance.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"69 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":"124037864","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}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833813
Ayaka Urabe, K. Ishibashi, M. Salehi, Antti Tölli
This paper studies the performance of wireless coded caching over multiple-input and single-output (MISO) channels in a finite signal-to-noise power ratio (SNR) region when every user has a different cache memory size. We first propose multicast beamforming for the network with the conventional coded caching based on quadratic transform (QT) and then point out the non-optimality of the caching scheme when the spatial degree of freedom (DoF) is exploited. We hence formulate a new optimization problem to enhance the caching gain by minimizing the difference between the generated codewords. Numerical results confirm the non-optimality of the conventional coded caching in terms of the average transmission rate and the improvement of our proposed caching.
{"title":"Beamforming Design for Wireless Coded Caching with Different Cache Sizes","authors":"Ayaka Urabe, K. Ishibashi, M. Salehi, Antti Tölli","doi":"10.1109/spawc51304.2022.9833813","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833813","url":null,"abstract":"This paper studies the performance of wireless coded caching over multiple-input and single-output (MISO) channels in a finite signal-to-noise power ratio (SNR) region when every user has a different cache memory size. We first propose multicast beamforming for the network with the conventional coded caching based on quadratic transform (QT) and then point out the non-optimality of the caching scheme when the spatial degree of freedom (DoF) is exploited. We hence formulate a new optimization problem to enhance the caching gain by minimizing the difference between the generated codewords. Numerical results confirm the non-optimality of the conventional coded caching in terms of the average transmission rate and the improvement of our proposed caching.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"100 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":"122612804","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}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9834031
Zihang Cheng, Jorge Gómez-Ponce, Naveed A. Abbasi, A. Molisch
Multi-path components (MPCs) in wireless channels generally occur in clusters, i.e., groups of MPCs that have similar delay/angle characteristics. However, when those clusters are widely separated and have significantly different power, high-resolution parameter extraction (HRPE) algorithms based on serial interference cancellation, such as CLEAN, can miss some of the weaker clusters because they concentrate the path search in the strongest cluster. This effect can occur particularly in the presence of calibration error and/or diffuse scattering. To solve this problem, we propose a heuristic modification, Regional CLEAN (R-CLEAN) that employs cluster identification in the Fourier domain and limits the number of MPCs per cluster. We first demonstrate the effect, and the effectiveness of our proposed algorithm, on synthetic channels with calibration error or diffuse scattering. We then demonstrate it with a THz Multiple-Input-Multiple-Output (MIMO) measurement at 145 - 146 GHz. The proposed optimization and algorithm can thus be an essential step towards evaluating channels with multiple clusters.
{"title":"A High-resolution Parameter Extraction Algorithm for Multiple Clusters Channels","authors":"Zihang Cheng, Jorge Gómez-Ponce, Naveed A. Abbasi, A. Molisch","doi":"10.1109/spawc51304.2022.9834031","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9834031","url":null,"abstract":"Multi-path components (MPCs) in wireless channels generally occur in clusters, i.e., groups of MPCs that have similar delay/angle characteristics. However, when those clusters are widely separated and have significantly different power, high-resolution parameter extraction (HRPE) algorithms based on serial interference cancellation, such as CLEAN, can miss some of the weaker clusters because they concentrate the path search in the strongest cluster. This effect can occur particularly in the presence of calibration error and/or diffuse scattering. To solve this problem, we propose a heuristic modification, Regional CLEAN (R-CLEAN) that employs cluster identification in the Fourier domain and limits the number of MPCs per cluster. We first demonstrate the effect, and the effectiveness of our proposed algorithm, on synthetic channels with calibration error or diffuse scattering. We then demonstrate it with a THz Multiple-Input-Multiple-Output (MIMO) measurement at 145 - 146 GHz. The proposed optimization and algorithm can thus be an essential step towards evaluating channels with multiple clusters.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"5 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":"129287192","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}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9834020
Leila Ben Saad, Nama Ajay Nagendra, B. Beferull-Lozano
Graph convolutional neural networks (GCNNs) have emerged as a promising tool in the deep learning community to learn complex hidden relationships of data generated from non-Euclidean domains and represented as graphs. GCNNs are formed by a cascade of layers of graph filters, which replace the classical convolution operation in convolutional neural networks. These graph filters, when operated over real networks, can be subject to random perturbations due to link losses that can be caused by noise, interference and adversarial attacks. In addition, these graph filters are executed by finite-precision processors, which generate numerical quantization errors that may affect their performance. Despite the research works studying the effect of either graph perturbations or quantization in GCNNs, their robustness against both of these problems jointly is still not well investigated and understood. In this paper, we propose a quantized GCNN architecture based on neighborhood graph filters under random graph perturbations. We investigate the stability of such architecture to both random graph perturbations and quantization errors. We prove that the expected error due to quantization and random graph perturbations at the GCNN output is upper-bounded and we show how this bound can be controlled. Numerical experiments are conducted to corroborate our theoretical findings.
{"title":"Neighborhood Graph Neural Networks under Random Perturbations and Quantization Errors","authors":"Leila Ben Saad, Nama Ajay Nagendra, B. Beferull-Lozano","doi":"10.1109/spawc51304.2022.9834020","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9834020","url":null,"abstract":"Graph convolutional neural networks (GCNNs) have emerged as a promising tool in the deep learning community to learn complex hidden relationships of data generated from non-Euclidean domains and represented as graphs. GCNNs are formed by a cascade of layers of graph filters, which replace the classical convolution operation in convolutional neural networks. These graph filters, when operated over real networks, can be subject to random perturbations due to link losses that can be caused by noise, interference and adversarial attacks. In addition, these graph filters are executed by finite-precision processors, which generate numerical quantization errors that may affect their performance. Despite the research works studying the effect of either graph perturbations or quantization in GCNNs, their robustness against both of these problems jointly is still not well investigated and understood. In this paper, we propose a quantized GCNN architecture based on neighborhood graph filters under random graph perturbations. We investigate the stability of such architecture to both random graph perturbations and quantization errors. We prove that the expected error due to quantization and random graph perturbations at the GCNN output is upper-bounded and we show how this bound can be controlled. Numerical experiments are conducted to corroborate our theoretical findings.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"19 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":"127422725","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}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833931
Husheng Li
The communication signals sent from base stations (BSs) in 5G networks can be leveraged for radar sensing, by exploiting the illumination by data communication signals. The technique of interferometry imaging, which has been extensively used in radio astronomy, is used as the mathematical framework for the radar imaging, by exploiting the distances among cellular BSs. To address the near field imaging, different from the far field in radio astronomy, the hyperbola family of constant-distance-difference trajectory is derived. Numerical simulations are carried out for demonstrating the proposed algorithms.
{"title":"Interferometry Based Radar Imaging by Leveraging Cellular Communication Networks","authors":"Husheng Li","doi":"10.1109/spawc51304.2022.9833931","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833931","url":null,"abstract":"The communication signals sent from base stations (BSs) in 5G networks can be leveraged for radar sensing, by exploiting the illumination by data communication signals. The technique of interferometry imaging, which has been extensively used in radio astronomy, is used as the mathematical framework for the radar imaging, by exploiting the distances among cellular BSs. To address the near field imaging, different from the far field in radio astronomy, the hyperbola family of constant-distance-difference trajectory is derived. Numerical simulations are carried out for demonstrating the proposed algorithms.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"162 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":"126019806","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：