pwc-archive/papers-with-abstracts huggingface dataset:
A Low-Power Spike Detector Using In-Memory Computing for Event-based Neural Frontend
Authors: Ye Ke, Arindam Basu
Date: 2024-05-14 00:00:00

With the sensor scaling of next-generation Brain-Machine Interface (BMI) systems, the massive A/D conversion and analog multiplexing at the neural frontend poses a challenge in terms of power and data rates for wireless and implantable BMIs. While previous works have reported the neuromorphic compression of neural signal, further compression requires integration of spike detectors on chip. In this work, we propose an efficient HRAM-based spike detector using In-memory computing for compressive event-based neural frontend. Our proposed method involves detecting spikes from event pulses without reconstructing the signal and uses a 10T hybrid in-memory computing bitcell for the accumulation and thresholding operations. We show that our method ensures a spike detection accuracy of 92-99% for neural signal inputs while consuming only 13.8 nW per channel in 65 nm CMOS.
Hybrid Event-Frame Neural Spike Detector for Neuromorphic Implantable BMI
Authors: Vivek Mohan, Wee Peng Tay, Arindam Basu
Date: 2024-05-14 00:00:00

This work introduces two novel neural spike detection schemes intended for use in next-generation neuromorphic brain-machine interfaces (iBMIs). The first, an Event-based Spike Detector (Ev-SPD) which examines the temporal neighborhood of a neural event for spike detection, is designed for in-vivo processing and offers high sensitivity and decent accuracy (94-97%). The second, Neural Network-based Spike Detector (NN-SPD) which operates on hybrid temporal event frames, provides an off-implant solution using shallow neural networks with impressive detection accuracy (96-99%) and minimal false detections. These methods are evaluated using a synthetic dataset with varying noise levels and validated through comparison with ground truth data. The results highlight their potential in next-gen neuromorphic iBMI systems and emphasize the need to explore this direction further to understand their resource-efficient and high-performance capabilities for practical iBMI settings.
Orthogonal Delay-Doppler Division Multiplexing Modulation with Tomlinson-Harashima Precoding
Authors: Yiyan Ma, Akram Shafie, Jinhong Yuan, Guoyu Ma, Zhangdui Zhong, Bo Ai
Date: 2024-05-14 00:00:00

The orthogonal delay-Doppler (DD) division multiplexing(ODDM) modulation has been recently proposed as a promising modulation scheme for next-generation communication systems with high mobility. Despite its benefits, ODDM modulation and other DD domain modulation schemes face the challenge of excessive equalization complexity. To address this challenge, we propose time domain Tomlinson-Harashima precoding (THP) for the ODDM transmitter, to make the DD domain single-tap equalizer feasible, thereby reducing the equalization complexity. In our design, we first pre-cancel the inter-symbolinterference (ISI) using the linear time-varying (LTV) channel information. Second, different from classical THP designs, we introduce a modified modulo operation with an adaptive modulus, by which the joint DD domain data multiplexing and timedomain ISI pre-cancellation can be realized without excessively increasing the bit errors. We then analytically study the losses encountered in this design, namely the power loss, the modulo noise loss, and the modulo signal loss. Based on this analysis, BER lower bounds of the ODDM system with time domain THP are derived when 4-QAM or 16-QAM modulations are adopted for symbol mapping in the DD domain. Finally, through numerical results, we validate our analysis and then demonstrate that the ODDM system with time domain THP is a promising solution to realize better BER performance over LTV channels compared to orthogonal frequency division multiplexing systems with single-tap equalizer and ODDM systems with maximum ratio combining.
Dynamic Rate Splitting Grouping for Antifragile Responses to Wireless Network Disruptions
Authors: Kevin Weinberger, Aydin Sezgin
Date: 2024-05-13 00:00:00

The reliance on wireless network architectures for applications demanding high reliability and fault tolerance is growing. These architectures heavily depend on wireless channels, making them susceptible to impairments and blockages. Ensuring functionality, particularly for safety-critical applications, demands robust countermeasures at the physical layer. In response, this work proposes the utilization of a dynamic Rate Splitting (RS) grouping approach as a resilience mechanism during blockages. RS effectively manages interference within networks but faces challenges during outages and blockages, where system performance can deteriorate due to the lowest decoding rate dictating the common rate and increased interference from fewer available channel links. As a strategic countermeasure, RS is leveraged to mitigate the impact of blockages, maintaining system efficiency and performance amidst disruptions. In fact, the introduction of new RS groups enables the exploration of novel solutions to the resource allocation problem, potentially outperforming those adopted before the occurrence of a blockage. As it turns out, by employing the dynamic RS grouping, the network exhibits an antifragile recovery response, showcasing the network's ability to not only recover from disruptions but also surpass its initial performance.
Show Me the Way: Real-Time Tracking of Wireless Mobile Users with UWB-Enabled RIS
Authors: Kevin Weinberger, Simon Tewes, Aydin Sezgin
Date: 2024-05-13 00:00:00

The integration of Reconfigurable Intelligent Surfaces (RIS) in 6G wireless networks offers unprecedented control over communication environments. However, identifying optimal configurations within practical constraints remains a significant challenge. This becomes especially pronounced, when the user is mobile and the configurations need to be deployed in real time. Leveraging Ultra-Wideband (UWB) as localization technique, we capture and analyze real-time movements of a user within the RIS-enabled indoor environment. Given this information about the system's geometry, a model-based optimization is utilized, which enables real-time beam steering of the RIS towards the user. However, practical limitations of UWB modules lead to fluctuating UWB estimates, causing the RIS beam to occasionally miss the tracked user. The methodologies proposed in this work aim to increase the compatibility between these two systems. To this end, we provide two key solutions: beam splitting for obtaining more robust RIS configurations and UWB estimation correction for reducing the variations in the UWB data. Through comprehensive theoretical and experimental evaluations in both stationary and mobile scenarios, the effectiveness of the proposed techniques is demonstrated. When combined, the proposed methods improve worst-case tracking performance by a significant 17.5dB compared to the conventional approach.
Improved Downlink Channel Estimation in Time-Varying FDD Massive MIMO Systems
Authors: Sajad Daei, Mikael Skoglund, Gabor Fodor
Date: 2024-05-13 00:00:00

In this work, we address the challenge of accurately obtaining channel state information at the transmitter (CSIT) for frequency division duplexing (FDD) multiple input multiple output systems. Although CSIT is vital for maximizing spatial multiplexing gains, traditional CSIT estimation methods often suffer from impracticality due to the substantial training and feedback overhead they require. To address this challenge, we leverage two sources of prior information simultaneously: the presence of limited local scatterers at the base station (BS) and the time-varying characteristics of the channel. The former results in a redundant angular sparsity of users' channels exceeding the spatial dimension (i.e., the number of BS antennas), while the latter provides a prior non-uniform distribution in the angular domain. We propose a weighted optimization framework that simultaneously reflects both of these features. The optimal weights are then obtained by minimizing the expected recovery error of the optimization problem. This establishes an analytical closed-form relationship between the optimal weights and the angular domain characteristics. Numerical experiments verify the effectiveness of our proposed approach in reducing the recovery error and consequently resulting in decreased training and feedback overhead.
Exploiting Spatial and Temporal Correlations in Massive MIMO Systems Operating Over Non-Stationary Aging Channels
Authors: Sajad Daei, Gabor Fodor, Mikael Skoglund
Date: 2024-05-13 00:00:00

This work investigates a multi-user, multi-antenna uplink wireless system, in which multiple users transmit signals to a base station. Prior research has explored the potential for linear growth in spectral efficiency by employing multiple transmit and receive antennas. This gain depends heavily on the quality of channel state information and the number of uncorrelated antennas. However, spatial correlations, arising from closely-spaced antennas and channel aging effects -- stemming from the difference between the channel state at pilot and data time instances -- can substantially counteract these benefits, and degrade the transmission rate, especially in non-stationary environments. To address these challenges, this work introduces a real-time beamforming framework to compensate for the spatial correlation and channel aging effects. First, a channel estimation scheme leveraging temporal channel correlations and considering mobile device velocity and antenna spacing is developed. Subsequently, an expression approximating the average spectral efficiency -- which depends on pilot spacing, pilot and data powers, and beamforming vectors -- is obtained. By maximizing this expression, optimal parameters are identified. Numerical results demonstrate the effectiveness of the proposed approach compared to prior works. Interestingly, the optimal pilot spacing remains unaffected by large-scale channel parameters and the velocities of interfering users. The impact of interference components also diminishes with an increasing number of transmit antennas.
Joint Precoding for RIS-Assisted Wideband THz Cell-Free Massive MIMO Systems
Authors: Xin Su, Ruisi He, Peng Zhang, Bo Ai
Date: 2024-05-13 00:00:00

Terahertz (THz) cell-free massive multiple-input-multiple-output (mMIMO) networks have been envisioned as a prospective technology for achieving higher system capacity, improved performance, and ultra-high reliability in 6G networks. However, due to severe attenuation and limited scattering in THz transmission, as well as high power consumption for increased number of access points (APs), further improvement of network capacity becomes challenging. Reconfigurable intelligent surface (RIS) has been introduced as a low-cost solution to reduce AP deployment and assist in data transmission. However, due to the ultra-wide bandwidth and frequency-dependent characteristics of RISs, beam split effect has become an unavoidable obstacle. To compensate the severe performance degradation caused by beam split effect, we introduce additional time delay (TD) layers at both access points (APs) and RISs. Accordingly, we propose a joint precoding framework at APs and RISs to fully unleash the potential of the considered network. Specifically, we first formulate the joint precoding as a non-convex optimization problem. Then, given the location of unchanged RISs, we adjust the time delays (TDs) of APs to align the generated beams towards RISs. After that, with knowledge of the optimal TDs of APs, we decouple the optimization problem into three subproblems of optimizing the baseband beamformers, RISs and TDs of RISs, respectively. Exploiting multidimensional complex quadratic transform, we transform the subproblems into convex forms and solve them under alternate optimizing framework. Numerical results verify that the proposed method can effectively mitigate beam split effect and significantly improve the achievable rate compared with conventional cell-free mMIMO networks.
Goal-oriented compression for $L_p$-norm-type goal functions: Application to power consumption scheduling
Authors: Yifei Sun, Hang Zou, Chao Zhang, Samson Lasaulce, Michel Kieffer
Date: 2024-05-13 00:00:00
Tasks: Data Compression, Quantization, Scheduling

Conventional data compression schemes aim at implementing a trade-off between the rate required to represent the compressed data and the resulting distortion between the original and reconstructed data. However, in more and more applications, what is desired is not reconstruction accuracy but the quality of the realization of a certain task by the receiver. In this paper, the receiver task is modeled by an optimization problem whose parameters have to be compressed by the transmitter. Motivated by applications such as the smart grid, this paper focuses on a goal function which is of $L_p$-norm-type. The aim is to design the precoding, quantization, and decoding stages such that the maximum of the goal function obtained with the compressed version of the parameters is as close as possible to the maximum obtained without compression. The numerical analysis, based on real smart grid signals, clearly shows the benefits of the proposed approach compared to the conventional distortion-based compression paradigm.
A Low-rank Projected Proximal Gradient Method for Spectral Compressed Sensing
Authors: Xi Yao, Wei Dai
Date: 2024-05-13 00:00:00
Tasks: compressed sensing, Computational Efficiency

This paper presents a new approach to the recovery of a spectrally sparse signal (SSS) from partially observed entries, focusing on challenges posed by large-scale data and heavy noise environments. The SSS reconstruction can be formulated as a non-convex low-rank Hankel recovery problem. Traditional formulations for SSS recovery often suffer from reconstruction inaccuracies due to unequally weighted norms and over-relaxation of the Hankel structure in noisy conditions. Moreover, a critical limitation of standard proximal gradient (PG) methods for solving the optimization problem is their slow convergence. We overcome this by introducing a more accurate formulation and a Low-rank Projected Proximal Gradient (LPPG) method, designed to efficiently converge to stationary points through a two-step process. The first step involves a modified PG approach, allowing for a constant step size independent of signal size, which significantly accelerates the gradient descent phase. The second step employs a subspace projection strategy, optimizing within a low-rank matrix space to further decrease the objective function. Both steps of the LPPG method are meticulously tailored to exploit the intrinsic low-rank and Hankel structures of the problem, thereby enhancing computational efficiency. Our numerical simulations reveal a substantial improvement in both the efficiency and recovery accuracy of the LPPG method compared to existing benchmark algorithms. This performance gain is particularly pronounced in scenarios with significant noise, demonstrating the method's robustness and applicability to large-scale SSS recovery tasks.
Networked ISAC for Low-Altitude Economy: Transmit Beamforming and UAV Trajectory Design
Authors: Gaoyuan Cheng, Xianxin Song, Zhonghao Lyu, Jie Xu
Date: 2024-05-13 00:00:00
Tasks: ISAC

This paper studies the exploitation of networked integrated sensing and communications (ISAC) to support low-altitude economy (LAE), in which a set of networked ground base stations (GBSs) transmit wireless signals to cooperatively communicate with multiple authorized unmanned aerial vehicles (UAVs) and concurrently use the echo signals to detect the invasion of unauthorized objects in interested airspace. Under this setup, we jointly design the cooperative transmit beamforming at multiple GBSs together with the trajectory control of authorized UAVs and their GBS associations, for enhancing the authorized UAVs' communication performance while ensuring the sensing requirements for airspace monitoring. In particular, our objective is to maximize the average sum rate of authorized UAVs over a particular flight period, subject to the minimum illumination power constraints for sensing over the interested airspace, the maximum transmit power constraints at individual GBSs, and the flight constraints at UAVs. This problem is non-convex and challenging to solve, due to the involvement of integer variables and the coupling of optimization variables. To solve this non-convex problem, we propose an efficient algorithm by using the techniques of alternating optimization (AO), successive convex approximation (SCA), and semi-definite relaxation (SDR). Numerical results show that the obtained transmit beamforming and UAV trajectory designs in the proposed algorithm efficiently balance the tradeoff between the sensing and communication performances, thus significantly outperforming various benchmarks.
AquaIntellect: A Semantic Self-learning Framework for Underwater Internet of Things Connectivity
Authors: Ananya Hazarika, Mehdi Rahmati
Date: 2024-05-12 00:00:00
Tasks: Model Optimization, Self-Learning

The emerging paradigm of Non-Conventional Internet of Things (NC IoT), which is focused on the usefulness of information as opposed to the notion of high volume data collection and transmission, will be an important and dominant part of human life in the near future. This paper proposes a novel semantic-based approach for addressing the unique challenges posed by underwater NC IoT. We present an intelligent sensing strategy for exploring the semantics of the underwater environment by judiciously selecting the data to transmit, thereby minimizing redundancy for utmost relevant data transmission. We introduce an evolutionary function for the selection of the semantic-empowered messages relevant to the specific task within a minimum Age of Information (AoI), a freshness metric of the collected information, and for monitoring the underwater environment for performance optimization. A DNN-empowered Bayesian integrated with an adaptive surrogate model optimization will determine the optimal placement strategy of the sensors and the uncertainty level of the underwater landscape. An Adaptive Expected Improvement (AEI) mechanism is introduced to predict the optimal arrival rate for enabling a synchronized data sensing and transmission ecosystem, ensuring efficiency and timeliness. Simulation results show that the proposed solution outperforms conventional approaches.
AdaptNet: Rethinking Sensing and Communication for a Seamless Internet of Drones Experience
Authors: Ananya Hazarika, Mehdi Rahmati
Date: 2024-05-12 00:00:00
Tasks: Integrated sensing and communication, ISAC, Multi-agent Reinforcement Learning

In the evolving era of Unmanned Aerial Vehicles (UAVs), the emphasis has moved from mere data collection to strategically obtaining timely and relevant data within the Internet of Drones (IoDs) ecosystem. However, the unpredictable conditions in dynamic IoDs pose safety challenges for drones. Addressing this, our approach introduces a multi-UAV framework using spatial-temporal clustering and the Frechet distance for enhancing reliability. Seamlessly coupled with Integrated Sensing and Communication (ISAC), it enhances the precision and agility of UAV networks. Our Multi-Agent Reinforcement Learning (MARL) mechanism ensures UAVs adapt strategies through ongoing environmental interactions and enhancing intelligent sensing. This focus ensures operational safety and efficiency, considering data capture and transmission viability. By evaluating the relevance of the sensed information, we can communicate only the most crucial data variations beyond a set threshold and optimize bandwidth usage. Our methodology transforms the UAV domain, transitioning drones from data gatherers to adept information orchestrators, establishing a benchmark for efficiency and adaptability in modern aerial systems.
A Compact Delay Model for OTS Devices
Authors: M. M. Al Chawa, R. Tetzlaff, D. Bedau, J. W. Reiner, D. A. Stewart, M. K. Grobis
Date: 2024-05-12 00:00:00
Tasks: model

This paper presents a novel compact delay model of Ovonic Threshold Switch (OTS) devices that works efficiently for circuit simulations. The internal state variable of the two terminal devices is estimated using a delay system that uses a few electrical components related to a suggested equivalent circuit of the device. Finally, we tested the proposed model against measured data from devices fabricated by Western Digital Research.
Exploiting Movable Antennas in Multicast Communications
Authors: Zhenqiao Cheng, Nanxi Li, Jianchi Zhu, Chongjun Ouyang, Xingqi Zhang
Date: 2024-05-12 00:00:00
Tasks: Position

This article investigates the integration of movable antennas (MAs) into multicast communication systems. By discretizing the motion of the MAs, a novel MA-assisted multicast transmission architecture is formulated. An alternating optimization (AO) algorithm based on successive convex approximation is proposed to optimize the transmit beamforming and antenna positions. To gain further insights, the two-user case is examined, and a closed-form expression for the optimal beamformer is derived. On this basis, a low-complexity greedy search algorithm is developed to optimize the placement of the MAs. Furthermore, under the assumption of a line-of-sight propagation environment, a branch-and-bound algorithm is designed to determine the globally optimal antenna configuration with reduced complexity compared to exhaustive search. Numerical simulations confirm that the proposed methods effectively enhance the achievable multicast rate.
Deep Learning-aided Parametric Sparse Channel Estimation for Terahertz Massive MIMO Systems
Authors: jinhong Kim, Yongjun Ahn, Seungnyun Kim, Byonghyo Shim
Date: 2024-05-12 00:00:00

Terahertz (THz) communications is considered as one of key solutions to support extremely high data demand in 6G. One main difficulty of the THz communication is the severe signal attenuation caused by the foliage loss, oxygen/atmospheric absorption, body and hand losses. To compensate for the severe path loss, multiple-input-multiple-output (MIMO) antenna array-based beamforming has been widely used. Since the beams should be aligned with the signal propagation path to achieve the maximum beamforming gain, acquisition of accurate channel knowledge, i.e., channel estimation, is of great importance. An aim of this paper is to propose a new type of deep learning (DL)-based parametric channel estimation technique. In our work, DL figures out the mapping function between the received pilot signal and the sparse channel parameters characterizing the spherical domain channel. By exploiting the long short-term memory (LSTM), we can efficiently extract the temporally correlated features of sparse channel parameters and thus make an accurate estimation with relatively small pilot overhead. From the numerical experiments, we show that the proposed scheme is effective in estimating the near-field THz MIMO channel in THz downlink environments.