Searcharxiv⌕ Search

arXiv subjects

Tony Q. S. Quek

Publications and source records attributed to Tony Q. S. Quek.

At least 145 records · Page 8Linked to original sources

Deep Learning-Based Decoding of Linear Block Codes for Spin-Torque Transfer Magnetic Random Access Memory (STT-MRAM)

Thanks to its superior features of fast read/write speed and low power consumption, spin-torque transfer magnetic random access memory (STT-MRAM) has become a promising non-volatile memory (NVM) technology that is suitable for many applications. However, the reliability of STT-MRAM is seriously affected by the variation of the memory fabrication process and the working temperature, and the later will lead to an unknown offset of the channel. Hence, there is a pressing need to develop more effective error correction coding techniques to tackle these imperfections and improve the reliability of STT-MRAM. In this work, we propose, for the first time, the application of deep-learning (DL) based algorithms and techniques to improve the decoding performance of linear block codes with short codeword lengths for STT-MRAM. We formulate the belief propagation (BP) decoding of linear block code as a neural network (NN), and propose a novel neural normalized-offset reliability-based min-sum (NNORB-MS) decoding algorithm. We successfully apply our proposed decoding algorithm to the STT-MRAM channel through channel symmetrization to overcome the channel asymmetry. We also propose an NN-based soft information generation method (SIGM) to take into account the unknown offset of the channel. Simulation results demonstrate that our proposed NNORB-MS decoding algorithm can achieve significant performance gain over both the hard-decision decoding (HDD) and the regular reliability-based min-sum (RB-MS) decoding algorithm, for cases without and with the unknown channel offset. Moreover, the decoder structure and time complexity of the NNORB-MS algorithm remain similar to those of the regular RB-MS algorithm.

cs.IT↗

Sustainable Placement with Cost Minimization in Wireless Digital Twin Networks

Digital twin (DT) technology has a high potential to satisfy different requirements of the ever-expanding new applications. Nonetheless, the DT placement in wireless digital twin networks (WDTNs) poses a significant challenge due to the conflict between unpredictable workloads and the limited capacity of edge servers. In other words, each edge server has a risk of overload when handling an excessive number of tasks or services. Overload risks can have detrimental effects on a network's sustainability, yet this aspect is often overlooked in the literature. In this paper, we aim to study the sustainability-aware DT placement problem for WDTNs from a cost minimization perspective. To this end, we formulate the DT placement-driven cost optimization problem as a chance-constrained integer programming problem. For tractability, we transform the original non-deterministic problem into a deterministic integer linear programming (ILP) problem using the sample average approximation (SAA) approach. We prove that the transformed problem remains NP-hard and thus finding a global optimal solution is very difficult. To strike a balance between time efficiency and performance guarantee, we propose an improved local search algorithm for this ILP by identifying high-quality starting states from historical search data and enhancing the search process. Numerical results show a lower cost and higher efficiency of our proposed method compared with the previous schemes.

cs.NI↗

Age-of-Information and Energy Optimization in Digital Twin Edge Networks

In this paper, we study the intricate realm of digital twin synchronization and deployment in multi-access edge computing (MEC) networks, with the aim of optimizing and balancing the two performance metrics Age of Information (AoI) and energy efficiency. We jointly consider the problems of edge association, power allocation, and digital twin deployment. However, the inherent randomness of the problem presents a significant challenge in identifying an optimal solution. To address this, we first analyze the feasibility conditions of the optimization problem. We then examine a specific scenario involving a static channel and propose a cyclic scheduling scheme. This enables us to derive the sum AoI in closed form. As a result, the joint optimization problem of edge association and power control is solved optimally by finding a minimum weight perfect matching. Moreover, we examine the one-shot optimization problem in the contexts of both frequent digital twin migrations and fixed digital twin deployments, and propose an efficient online algorithm to address the general optimization problem. This algorithm effectively reduces system costs by balancing frequent migrations and fixed deployments. Numerical results demonstrate the effectiveness of our proposed scheme in terms of low cost and high efficiency.

cs.NI↗

A New Channel Model for OAM Wireless Communication at 5.8 and 28 GHz

Orbital angular momentum (OAM) in electromagnetic (EM) waves can significantly enhance spectrum efficiency in wireless communications without requiring additional power, time, or frequency resources. Different OAM modes in EM waves create orthogonal channels, thereby improving spectrum efficiency. Additionally, OAM waves can more easily maintain orthogonality in line-of-sight (LOS) transmissions, offering an advantage over multiple-input and multiple-output (MIMO) technology in LOS scenarios. However, challenges such as divergence and crosstalk hinder OAM's efficiency. Additionally, channel modeling for OAM transmissions is still limited. A reliable channel model with balanced accuracy and complexity is essential for further system analysis. In this paper, we present a quasi-deterministic channel model for OAM channels in the 5.8 GHz and 28 GHz bands based on measurement data. Accurate measurement, especially at high frequencies like millimeter bands, requires synchronized RF channels to maintain phase coherence and purity, which is a major challenge for OAM channel measurement. To address this, we developed an 8-channel OAM generation device at 28 GHz to ensure beam integrity. By measuring and modeling OAM channels at 5.8 GHz and 28 GHz with a modified 3D geometric-based stochastic model (GBSM), this study provides insights into OAM channel characteristics, aiding simulation-based analysis and system optimization.

eess.SP↗

Symbiotic Sensing and Communication: Framework and Beamforming Design

In this paper, we propose a novel symbiotic sensing and communication (SSAC) framework, comprising a base station (BS) and a passive sensing node. In particular, the BS transmits communication waveform to serve vehicle users (VUEs), while the sensing node is employed to execute sensing tasks based on the echoes in a bistatic manner, thereby avoiding the issue of self-interference. Besides the weak target of interest, the sensing node tracks VUEs and shares sensing results with BS to facilitate sensing-assisted beamforming. By considering both fully digital arrays and hybrid analog-digital (HAD) arrays, we investigate the beamforming design in the SSAC system. We first derive the Cramer-Rao lower bound (CRLB) of the two-dimensional angles of arrival estimation as the sensing metric. Next, we formulate an achievable sum rate maximization problem under the CRLB constraint, where the channel state information is reconstructed based on the sensing results. Then, we propose two penalty dual decomposition (PDD)-based alternating algorithms for fully digital and HAD arrays, respectively. Simulation results demonstrate that the proposed algorithms can achieve an outstanding data rate with effective localization capability for both VUEs and the weak target. In particular, the HAD beamforming design exhibits remarkable performance gain compared to conventional schemes, especially with fewer radio frequency chains.

eess.SP↗

Pilot-Aided Joint Time Synchronization and Channel Estimation for OTFS

This letter proposes a pilot-aided joint time synchronization and channel estimation (JTSCE) algorithm for orthogonal time frequency space (OTFS) systems. Unlike existing algorithms, JTSCE employs a maximum length sequence (MLS) rather than an isolated signal as the pilot. Distinctively, JTSCE explores MLS's autocorrelation properties to estimate timing offset and channel delay taps. After obtaining delay taps, closed-form expressions of Doppler and channel gain for each propagation path are derived. Simulation results indicate that, compared to its counterpart, JTSCE achieves better bit error rate performance, close to that with perfect time synchronization and channel state information.

eess.SP↗

Trustworthy Image Semantic Communication with GenAI: Explainablity, Controllability, and Efficiency

Image semantic communication (ISC) has garnered significant attention for its potential to achieve high efficiency in visual content transmission. However, existing ISC systems based on joint source-channel coding face challenges in interpretability, operability, and compatibility. To address these limitations, we propose a novel trustworthy ISC framework. This approach leverages text extraction and segmentation mapping techniques to convert images into explainable semantics, while employing Generative Artificial Intelligence (GenAI) for multiple downstream inference tasks. We also introduce a multi-rate ISC transmission protocol that dynamically adapts to both the received explainable semantic content and specific task requirements at the receiver. Simulation results demonstrate that our framework achieves explainable learning, decoupled training, and compatible transmission in various application scenarios. Finally, some intriguing research directions and application scenarios are identified.

cs.IT↗

Wireless-Powered Mobile Crowdsensing Enhanced by UAV-Mounted RIS: Joint Transmission, Compression, and Trajectory Design

Mobile crowdsensing (MCS) enables data collection from massive devices to achieve a wide sensing range. Wireless power transfer (WPT) is a promising paradigm for prolonging the operation time of MCS systems by sustainably transferring power to distributed devices. However, the efficiency of WPT significantly deteriorates when the channel conditions are poor. Unmanned aerial vehicles (UAVs) and reconfigurable intelligent surfaces (RISs) can serve as active or passive relays to enhance the efficiency of WPT in unfavourable propagation environments. Therefore, to explore the potential of jointly deploying UAVs and RISs to enhance transmission efficiency, we propose a novel transmission framework for the WPT-assisted MCS systems, which is enhanced by a UAV-mounted RIS. Subsequently, under different compression schemes, two optimization problems are formulated to maximize the weighted sum of the data uploaded by the user equipments (UEs) by jointly designing the WPT and uploading time, the beamforming matrics, the CPU cycles, and the UAV trajectory. A block coordinate descent (BCD) algorithm based on the closed-form beamforming designs and the successive convex approximation (SCA) algorithm is proposed to solve the formulated problems. Furthermore, to highlight the insight of the gains brought by the compression schemes, we analyze the energy efficiencies of compression schemes and confirm that the gains gradually reduce with the increasing power used for compression. Simulation results demonstrate that the amount of collected data can be effectively increased in wireless-powered MCS systems.

eess.SP↗

Robust Transmission Design for RIS-Assisted Integrated Sensing and Communication Systems

As a critical technology for next-generation communication networks, integrated sensing and communication (ISAC) aims to achieve the harmonious coexistence of communication and sensing. The degrees-of-freedom (DoF) of ISAC is limited due to multiple performance metrics used for communication and sensing. Reconfigurable Intelligent Surfaces (RIS) composed of metamaterials can enhance the DoF in the spatial domain of ISAC systems. However, the availability of perfect Channel State Information (CSI) is a prerequisite for the gain brought by RIS, which is not realistic in practical environments. Therefore, under the imperfect CSI condition, we propose a decomposition-based large deviation inequality approach to eliminate the impact of CSI error on communication rate and sensing Cramér-Rao bound (CRB). Then, an alternating optimization (AO) algorithm based on semi-definite relaxation (SDR) and gradient extrapolated majorization-maximization (GEMM) is proposed to solve the transmit beamforming and discrete RIS beamforming problems. We also analyze the complexity and convergence of the proposed algorithm. Simulation results show that the proposed algorithms can effectively eliminate the influence of CSI error and have good convergence performance. Notably, when CSI error exists, the gain brought by RIS will decrease with the increase of the number of RIS elements. Finally, we summarize and outline future research directions.

cs.IT↗

Multi-User Pilot Pattern Optimization for Channel Extrapolation in 5G NR Systems

Pilot pattern optimization in orthogonal frequency division multiplexing (OFDM) systems has been widely investigated due to its positive impact on channel estimation. In this paper, we consider the problem of multi-user pilot pattern optimization for OFDM systems. In particular, the goal is to enhance channel extrapolation performance for 5G NR systems by optimizing multi-user pilot patterns in frequency-domain. We formulate a novel pilot pattern optimization problem with the objective of minimizing the maximum integrated side-lobe level (ISL) among all users, subject to a statistical resolution limit (SRL) constraint. Unlike existing literature that only utilizes ISL for controlling side-lobe levels of the ambiguity function, we also leverage ISL to mitigate multi-user interference in code-domain multiplexing. Additionally, the introduced SRL constraint ensures sufficient delay resolution of the system to resolve multipath, thereby improving channel extrapolation performance. Then, we employ the estimation of distribution algorithm (EDA) to solve the formulated problem in an offline manner. Finally, we extend the formulated multi-user pilot pattern optimization problem to a multiband scenario, in which multiband gains can be exploited to improve system delay resolution. Simulation results demonstrate that the optimized pilot pattern yields significant performance gains in channel extrapolation over the conventional pilot patterns.

eess.SP↗

Secure Semantic Communication via Paired Adversarial Residual Networks

This letter explores the positive side of the adversarial attack for the security-aware semantic communication system. Specifically, a pair of matching pluggable modules is installed: one after the semantic transmitter and the other before the semantic receiver. The module at transmitter uses a trainable adversarial residual network (ARN) to generate adversarial examples, while the module at receiver employs another trainable ARN to remove the adversarial attacks and the channel noise. To mitigate the threat of semantic eavesdropping, the trainable ARNs are jointly optimized to minimize the weighted sum of the power of adversarial attack, the mean squared error of semantic communication, and the confidence of eavesdropper correctly retrieving private information. Numerical results show that the proposed scheme is capable of fooling the eavesdropper while maintaining the high-quality semantic communication.

cs.IT↗

A Survey on Resource Management in Joint Communication and Computing-Embedded SAGIN

The advent of the 6G era aims for ubiquitous connectivity, with the integration of non-terrestrial networks (NTN) offering extensive coverage and enhanced capacity. As manufacturing advances and user demands evolve, space-air-ground integrated networks (SAGIN) with computational capabilities emerge as a viable solution for services requiring low latency and high computational power. Resource management within joint communication and computing-embedded SAGIN (JCC-SAGIN) presents greater complexity than traditional terrestrial networks. This complexity arises from the spatiotemporal dynamics of network topology and service demand, the interdependency of large-scale resource variables, and intricate tradeoffs among various performance metrics. Thus, a thorough examination of resource management strategies in JCC-SAGIN is crucial, emphasizing the role of non-terrestrial platforms with processing capabilities in 6G. This paper begins by reviewing the architecture, enabling technologies, and applications in JCC-SAGIN. Then, we offer a detailed overview of resource management modeling and optimization methods, encompassing both traditional optimization approaches and learning-based intelligent decision-making frameworks. Finally, we outline the prospective research directions in JCC-SAGIN.

cs.NI↗

Age-Threshold Slotted ALOHA for Optimizing Information Freshness in Mobile Networks

We optimize the Age of Information (AoI) in mobile networks using the age-threshold slotted ALOHA (TSA) protocol. The network comprises multiple source-destination pairs, where each source sends a sequence of status update packets to its destination over a shared spectrum. The TSA protocol stipulates that a source node must remain silent until its AoI reaches a predefined threshold, after which the node accesses the radio channel with a certain probability. Using stochastic geometry tools, we derive analytical expressions for the transmission success probability, mean peak AoI, and time-average AoI. Subsequently, we obtain closed-form expressions for the optimal update rate and age threshold that minimize the mean peak and time-average AoI, respectively. In addition, we establish a scaling law for the mean peak AoI and time-average AoI in mobile networks, revealing that the optimal mean peak AoI and time-average AoI increase linearly with the deployment density. Notably, the growth rate of time-average AoI under TSA is half of that under conventional slotted ALOHA. When considering the optimal mean peak AoI, the TSA protocol exhibits comparable performance to the traditional slotted ALOHA protocol. These findings conclusively affirm the advantage of TSA in reducing higher-order AoI, particularly in densely deployed networks.

cs.NI↗

Timeliness of Status Update System: The Effect of Parallel Transmission Using Heterogeneous Updating Devices

Timely status updating is the premise of emerging interaction-based applications in the Internet of Things (IoT). Using redundant devices to update the status of interest is a promising method to improve the timeliness of information. However, parallel status updating leads to out-of-order arrivals at the monitor, significantly challenging timeliness analysis. This work studies the Age of Information (AoI) of a multi-queue status update system where multiple devices monitor the same physical process. Specifically, two systems are considered: the Basic System, which only has type-1 devices that are ad hoc devices located close to the source, and the Hybrid System, which contains additional type-2 devices that are infrastructure-based devices located in fixed points compared to the Basic System. Using the Stochastic Hybrid Systems (SHS) framework, a mathematical model that combines discrete and continuous dynamics, we derive the expressions of the average AoI of the considered two systems in closed form. Numerical results verify the accuracy of the analysis. It is shown that when the number and parameters of the type-1 devices/type-2 devices are fixed, the logarithm of average AoI will linearly decrease with the logarithm of the total arrival rate of type-2 devices or that of the number of type-1 devices under specific condition. It has also been demonstrated that the proposed systems can significantly outperform the FCFS M/M/N status update system.

cs.IT↗

Explainable Semantic Communication for Text Tasks

Task-oriented semantic communication has gained increasing attention due to its ability to reduce the amount of transmitted data without sacrificing task performance. Although some prior efforts have been dedicated to developing semantic communications, the semantics in these works remains to be unexplainable. Challenges related to explainable semantic representation and knowledge-based semantic compression have yet to be explored. In this paper, we propose a triplet-based explainable semantic communication (TESC) scheme for representing text semantics efficiently. Specifically, we develop a semantic extraction method to convert text into triplets while using syntactic dependency analysis to enhance semantic completeness. Then, we design a semantic filtering method to further compress the duplicate and task-irrelevant triplets based on prior knowledge. The filtered triplets are encoded and transmitted to the receiver for completing intelligent tasks. Furthermore, we apply the propsed TESC scheme to two emblematic text tasks: sentiment analysis and question answering, in which the semantic codec is meticulously customized for each task. Experimental results demonstrate that 1) TESC scheme outperforms benchmarks in terms of Top-1 accuracy and transmission efficiency, and 2) TESC scheme enjoys about 150% performance gain compared to the traditional communication method.

eess.SP↗

The Role of Federated Learning in a Wireless World with Foundation Models

Foundation models (FMs) are general-purpose artificial intelligence (AI) models that have recently enabled multiple brand-new generative AI applications. The rapid advances in FMs serve as an important contextual backdrop for the vision of next-generation wireless networks, where federated learning (FL) is a key enabler of distributed network intelligence. Currently, the exploration of the interplay between FMs and FL is still in its nascent stage. Naturally, FMs are capable of boosting the performance of FL, and FL could also leverage decentralized data and computing resources to assist in the training of FMs. However, the exceptionally high requirements that FMs have for computing resources, storage, and communication overhead would pose critical challenges to FL-enabled wireless networks. In this article, we explore the extent to which FMs are suitable for FL over wireless networks, including a broad overview of research challenges and opportunities. In particular, we discuss multiple new paradigms for realizing future intelligent networks that integrate FMs and FL. We also consolidate several broad research directions associated with these paradigms.

cs.NI↗

Intelligent Hybrid Resource Allocation in MEC-assisted RAN Slicing Network

In this paper, we aim to maximize the SSR for heterogeneous service demands in the cooperative MEC-assisted RAN slicing system by jointly considering the multi-node computing resources cooperation and allocation, the transmission resource blocks (RBs) allocation, and the time-varying dynamicity of the system. To this end, we abstract the system into a weighted undirected topology graph and, then propose a recurrent graph reinforcement learning (RGRL) algorithm to intelligently learn the optimal hybrid RA policy. Therein, the graph neural network (GCN) and the deep deterministic policy gradient (DDPG) is combined to effectively extract spatial features from the equivalent topology graph. Furthermore, a novel time recurrent reinforcement learning framework is designed in the proposed RGRL algorithm by incorporating the action output of the policy network at the previous moment into the state input of the policy network at the subsequent moment, so as to cope with the time-varying and contextual network environment. In addition, we explore two use case scenarios to discuss the universal superiority of the proposed RGRL algorithm. Simulation results demonstrate the superiority of the proposed algorithm in terms of the average SSR, the performance stability, and the network complexity.

cs.NI↗

New Construction of $q$-ary Codes Correcting a Burst of at most $t$ Deletions

In this paper, for any fixed positive integers $t$ and $q>2$, we construct $q$-ary codes correcting a burst of at most $t$ deletions with redundancy $\log n+8\log\log n+o(\log\log n)+γ_{q,t}$ bits and near-linear encoding/decoding complexity, where $n$ is the message length and $γ_{q,t}$ is a constant that only depends on $q$ and $t$. In previous works there are constructions of such codes with redundancy $\log n+O(\log q\log\log n)$ bits or $\log n+O(t^2\log\log n)+O(t\log q)$. The redundancy of our new construction is independent of $q$ and $t$ in the second term.

cs.IT↗