SearcharxivSearch

arXiv subjects

Guojun Han

Publications and source records attributed to Guojun Han.

16 recordsLinked to original sources

GNN Based Joint Beamforming Design for Extremely Large-Scale RIS Assisted Near-Field ISAC Systems

This paper investigates an extremely large-scale reconfigurable intelligent surface (XL-RIS) assisted near-field integrated sensing and communication (ISAC) system, where a multi-antenna base station (BS) simultaneously sends unicast data to multiple single-antenna communication users (CUs) and senses multiple targets (TGTs). The BS, CUs and TGTs are \emph{all} assumed to be located in the near-field region of the XL-RIS. We aim to maximize the weighted sum rate (WSR) of all CUs, subject to the sensing beampattern gain constraint for each TGT, the transmit power constraint for the BS, and the unit modulus constraints on the XL-RIS phase shift. First, we develop a fractional programming (FP) based block coordinate descent (BCD) algorithm to obtain a locally optimal solution for such a non-convex joint design problem. Secondly, to address the high-dimensional spatial correlations and scalability of the XL-RIS near-field channels, we propose a customized graph neural network (GNN) scheme to generate the BS transmit beamforming variables and the XL-RIS reflecting coefficient vector for ISAC, where the near-field ISAC system is modeled as a heterogeneous graph comprising XL-RIS/CU/TGT nodes. The proposed GNN scheme can effectively learn the near-field channel state information (CSI) features, in which the message passing mechanism is employed to exchange CSI among these directly connected nodes in the graph. Furthermore, each XL-RIS/CU/TGT node maintains a feature vector for mapping to the BS transmit beamforming variables or the XL-RIS reflecting coefficient vector. Numerical results show that the proposed GNN-based beamforming design scheme achieves a better performance than the existing baselines, in terms of computational efficiency, feasibility, robustness, and the ability of generalization.

cs.IT

Rethinking Knowledge Distillation in Collaborative Machine Learning: Memory, Knowledge, and Their Interactions

Collaborative learning has emerged as a key paradigm in large-scale intelligent systems, enabling distributed agents to cooperatively train their models while addressing their privacy concerns. Central to this paradigm is knowledge distillation (KD), a technique that facilitates efficient knowledge transfer among agents. However, the underlying mechanisms by which KD leverages memory and knowledge across agents remain underexplored. This paper aims to bridge this gap by offering a comprehensive review of KD in collaborative learning, with a focus on the roles of memory and knowledge. We define and categorize memory and knowledge within the KD process and explore their interrelationships, providing a clear understanding of how knowledge is extracted, stored, and shared in collaborative settings. We examine various collaborative learning patterns, including distributed, hierarchical, and decentralized structures, and provide insights into how memory and knowledge dynamics shape the effectiveness of KD in collaborative learning. Particularly, we emphasize task heterogeneity in distributed learning pattern covering federated learning (FL), multi-agent domain adaptation (MADA), federated multi-modal learning (FML), federated continual learning (FCL), federated multi-task learning (FMTL), and federated graph knowledge embedding (FKGE). Additionally, we highlight model heterogeneity, data heterogeneity, resource heterogeneity, and privacy concerns of these tasks. Our analysis categorizes existing work based on how they handle memory and knowledge. Finally, we discuss existing challenges and propose future directions for advancing KD techniques in the context of collaborative learning.

cs.DC

Robust Beamforming Design for Secure Near-Field ISAC Systems

This letter investigates the robust beamforming design for a near-field secure integrated sensing and communication (ISAC) system with multiple communication users (CUs) and targets, as well as multiple eavesdroppers. Taking into account the channel uncertainty constraints, we maximize the minimum sensing beampattern gain for targets, subject to the minimum signal-to-interference-plus-noise ratio (SINR) constraint for each CU and the maximum SINR constraint for each eavesdropper, as well as the ISAC transmit power constraint. The formulated design problem is non-convex. As a low-complexity suboptimal solution, we first apply the S-Procedure to convert semi-infinite channel uncertainty constraints into linear matrix inequalities (LMIs) and then use the state-of-the-art sequential rank-one constraint relaxation (SROCR) method to address the rank-one constraints. The numerical results show that the proposed ISAC beamforming design scheme outperforms the existing semidefinite relaxation (SDR) and other baseline schemes, and it significantly enhances security and robustness for near-field ISAC systems.

cs.IT

Joint Mode Selection and Beamforming Designs for Hybrid-RIS Assisted ISAC Systems

This paper considers a hybrid reconfigurable intelligent surface (RIS) assisted integrated sensing and communication (ISAC) system, where each RIS element can flexibly switch between the active and passive modes. Subject to the signal-to-interference-plus-noise ratio (SINR) constraint for each communication user (CU) and the transmit power constraints for both the base station (BS) and the active RIS elements, with the objective of maximizing the minimum beampattern gain among multiple targets, we jointly optimize the BS transmit beamforming for ISAC and the mode selection of each RIS reflecting element, as well as the RIS reflection coefficient matrix. Such formulated joint hybrid-RIS assisted ISAC design problem is a mixed-integer nonlinear program, which is decomposed into two low-dimensional subproblems being solved in an alternating manner. Specifically, by using the semidefinite relaxation (SDR) technique along with the rank-one beamforming construction process, we efficiently obtain the optimal ISAC transmit beamforming design at the BS. Via the SDR and successive convex approximation (SCA) techniques, we jointly determine the active/passive mode selection and reflection coefficient for each RIS element. Numerical results demonstrate that the proposed design solution is significantly superior to the existing baseline solutions.

cs.IT

Simultaneously Transmitting and Reflecting (STAR) RIS Assisted Over-the-Air Computation Systems

The performance of over-the-air computation (AirComp) systems degrades due to the hostile channel conditions of wireless devices (WDs), which can be significantly improved by the employment of reconfigurable intelligent surfaces (RISs). However, the conventional RISs require that the WDs have to be located in the half-plane of the reflection space, which restricts their potential benefits. To address this issue, the novel family of simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RIS) is considered in AirComp systems to improve the computation accuracy across a wide coverage area. To minimize the computation mean-squared-error (MSE) in STAR-RIS assisted AirComp systems, we propose a joint beamforming design for optimizing both the transmit power at the WDs, as well as the passive reflect and transmit beamforming matrices at the STAR-RIS, and the receive beamforming vector at the fusion center (FC). Specifically, in the updates of the passive reflect and transmit beamforming matrices, closed-form solutions are derived by introducing an auxiliary variable and exploiting the coupled binary phase-shift conditions. Moreover, by assuming that the number of antennas at the FC and that of elements at the STAR-RIS/RIS are sufficiently high, we theoretically prove that the STAR-RIS assisted AirComp systems provide higher computation accuracy than the conventional RIS assisted systems. Our numerical results show that the proposed beamforming design outperforms the benchmark schemes relying on random phase-shift constraints and the deployment of conventional RIS. Moreover, its performance is close to the lower bound achieved by the beamforming design based on the STAR-RIS dispensing with coupled phase-shift constraints.

eess.SP

Dynamic Write-Voltage Design and Read-Voltage Optimization for MLC NAND Flash Memory

To mitigate the impact of noise and interference on multi-level-cell (MLC) flash memory with the use of low-density parity-check (LDPC) codes, we propose a dynamic write-voltage design scheme considering the asymmetric property of raw bit error rate (RBER), which can obtain the optimal write voltage by minimizing a cost function. In order to further improve the decoding performance of flash memory, we put forward a low-complexity entropy-based read-voltage optimization scheme, which derives the read voltages by searching for the optimal entropy value via a log-likelihood ratio (LLR)-aware cost function. Simulation results demonstrate the superiority of our proposed dynamic write-voltage design scheme and read-voltage optimization scheme with respect to the existing counterparts.

eess.SP

A Generalization of Array Codes with Local Properties and Efficient Encoding/Decoding

A maximum distance separable (MDS) array code is composed of $m\times (k+r)$ arrays such that any $k$ out of $k+r$ columns suffice to retrieve all the information symbols. Expanded-Blaum-Roth (EBR) codes and Expanded-Independent-Parity (EIP) codes are two classes of MDS array codes that can repair any one symbol in a column by locally accessing some other symbols within the column, where the number of symbols $m$ in a column is a prime number. By generalizing the constructions of EBR and EIP codes, we propose new MDS array codes, such that any one symbol can be locally recovered and the number of symbols in a column can be not only a prime number but also a power of an odd prime number. Also, we present an efficient encoding/decoding method for the proposed generalized EBR (GEBR) and generalized EIP (GEIP) codes based on the LU factorization of a Vandermonde matrix. We show that the proposed decoding method has less computational complexity than existing methods. Furthermore, we show that the proposed GEBR codes have both a larger minimum symbol distance and a larger recovery ability of erased lines for some parameters when compared to EBR codes. We show that EBR codes can recover any $r$ erased lines of a slope for any parameter $r$, which was an open problem in [2].

cs.IT

A New Frequency-Bin-Index LoRa System for High-Data-Rate Transmission: Design and Performance Analysis

As an attempt to tackle the low-data-rate issue of the conventional LoRa systems, we propose two novel frequency-bin-index (FBI) LoRa schemes. In scheme I, the indices of starting frequency bins (SFBs) are utilized to carry the information bits. To facilitate the actual implementation, the SFBs of each LoRa signal are divided into several groups prior to the modulation process in the proposed FBI-LoRa system. To further improve the system flexibility, we formulate a generalized modulation scheme and propose scheme II by treating the SFB groups as an additional type of transmission entity. In scheme II, the combination of SFB indices and that of SFB group indices are both exploited to carry the information bits. We derive the theoretical expressions for bit-error-rate (BER) and throughput of the proposed FBI-LoRa system with two modulation schemes over additive white Gaussian noise (AWGN) and Rayleigh fading channels. Theoretical and simulation results show that the proposed FBI-LoRa schemes can significantly increases the transmission throughput compared with the existing LoRa systems at the expense of a slight loss in BER performance. Thanks to the appealing superiorities, the proposed FBI-LoRa system is a promising alternative for high-data-rate Internet of Things (IoT) applications.

eess.SP

Design and Performance Analysis of a New STBC-MIMO LoRa System

LoRa is a modulation technology for low power wide area networks (LPWAN) with enormous potential in 5G era. However, the performance of LoRa system deteriorates seriously in fading-channel environments. To tackle this problem, in this paper we introduce multiple-input-multiple-output (MIMO) configuration employing space-time block coding (STBC) schemes into the LoRa system to formulate an STBC-MIMO LoRa system. Then, we investigate the theoretical performance of the proposed system over Rayleigh fading channels. To this end, we derive the distribution of the decision metric for the demodulator in the proposed system. Based on the above distribution, we propose the closed-form approximated bit error rate (BER) expression of the proposed system when perfect and imperfect channel information states (CSIs) are considered. In addition, we analyze the diversity order of the proposed system. The result demonstrates that the diversity order of the system in the imperfect CSI scenario with fixed channel estimate error variance is zero. However, in the imperfect CSI scenario with a decreasing channel estimate error variance and the perfect CSI scenario, the system can achieve full diversity. Finally, experimental results verify the accuracy of the theoretical analysis and the excellent performance of the proposed system. Due to such superiority, the proposed STBC-MIMO LoRa system can be considered as a good scheme for LPWAN.

eess.SP

Adaptive Gradient Coding

This paper focuses on mitigating the impact of stragglers in distributed learning system. Unlike the existing results designed for a fixed number of stragglers, we developed a new scheme called Adaptive Gradient Coding(AGC) with flexible tolerance of various number of stragglers. Our scheme gives an optimal tradeoff between computation load, straggler tolerance and communication cost. In particular, it allows to minimize the communication cost according to the real-time number of stragglers in the practical environments. Implementations on Amazon EC2 clusters using Python with mpi4py package verify the flexibility in several situations.

cs.IT

Design of Link-Selection Strategies for Buffer-Aided DCSK-SWIPT Relay System

Adaptive link selection for buffer-aided relaying can achieve significant performance gain compared with the conventional relaying with fixed transmission criterion. However, most of the existing link-selection strategies are designed based on perfect channel state information (CSI), which are very complex by requiring channel estimator. To solve this issue, in this paper, we investigate a buffer-aided differential chaos-shift-keying based simultaneous wireless information and power transfer (DCSK-SWIPT) relay system, where a decode-and-forward protocol is considered and the relay is equipped with a data buffer and an energy buffer. In particular, we propose two link-selection protocols for the proposed system based on harvested energy, data-buffer status and energy-shortage status, where the CSI is replaced by the harvested energy to avoid the channel estimation and the practical problem of the decoding cost at the relay is considered. Furthermore, the bit-error-rate (BER) and average-delay closed-form expressions of the proposed protocols are derived over multipath Rayleigh fading channels, which are validated via simulations. Finally, results demonstrate that both the proposed protocols not only provide better BER performance than the conventional DCSK system and DCSK-SWIPT relay system but also achieve better BER performance and lower average delay in comparison to the conventional signal-to-noise-ratio-based buffer-aided DCSK-SWIPT relay systems.

eess.SP

Design of an MISO-SWIPT-Aided Code-Index Modulated Multi-Carrier M-DCSK System for e-Health IoT

Code index modulated multi-carrier M-ary differential chaos shift keying (CIM-MC-M-DCSK) system not only inherits low-power and low-complexity advantages of the conventional DCSK system, but also significantly increases the transmission rate. This feature is of particular importance to Internet of Things (IoT) with trillions of low-cost devices. In particular, for e-health IoT applications, an efficient transmission scheme is designed to solve the challenge of the limited battery capacity for numerous user equipments served by one base station. In this paper, a new multiple-input-single-output simultaneous wireless information and power transfer (MISO-SWIPT) scheme for CIM-MC-M-DCSK system is proposed by utilizing orthogonal characteristic of chaotic signals with different initial values. The proposed system adopts power splitting mode, which is very promising for simultaneously providing energy and transmitting information of the user equipments without any external power supply. In particular, the new system can achieve desirable anti-multipath-fading capability without using channel estimator. Moreover, the analytical bit-error-rate expression of the proposed system is derived over multipath Rayleigh fading channels. Furthermore, the spectral efficiency and energy efficiency of the proposed system are analyzed. Simulation results not only validate the analytical expressions, but also demonstrate the superiority of the proposed system.

cs.NI

Received Signal Strength Based Wireless Source Localization with Inaccurate Anchor Position

Received signal strength (RSS)-based wireless localization is easy to implement at low cost. In practice,exact positions of anchors may not be available. This paper focuses on determining the location of a source in the presence of inaccurate positions of anchors based on RSS directly. We first use Taylor expansion and a min-max approach to get a maximum likelihood estimator of the coordinates of the source. Then we propose a relaxed semi-definite programming model to circumvent the non-convexity. We also propose a rounding algorithm considering both inaccurate source location and inaccurate anchor locations.Simulation results together with analysis are presented to validate the proposed method.

eess.SP

Outage-Limit-Approaching Protograph LDPC Codes for Slow-Fading Wireless Communications

Block-fading (BF) channel, also known as slow-fading channel, is a type of simple and practical channel model that can characterize the primary feature of a number of wireless-communication applications with low to moderate mobility. Although the BF channel has received significant research attention in the past twenty years, designing low-complexity outage-limit-approaching error-correction codes (ECCs) is still a challenging issue. For this reason, a novel family of protograph low-density parity-check (LDPC) codes, called root-protograph (RP) LDPC codes, has been conceived recently. The RP codes can not only realize linear-complexity encoding and high-speed decoding with the help of a quasi-cyclic (QC) structure, but also achieve near-outage-limit performance in a variety of BF scenarios. In this article, we briefly review the design guidelines of such protograph codes with the aim of inspiring further research activities in this area.

cs.IT

QoS-Aware Buffer-Aided Relaying Implant WBAN for Healthcare IoT: Opportunities and Challenges

Internet of Things (IoT) have motivated a paradigm shift in the development of various applications such as mobile health. Wireless body area network (WBAN) comprises many low-power devices in, on, or around the human body, which offers a desirable solution to monitor physiological signals for mobile-health applications. In the implant WBAN, an implant medical device transmits its measured biological parameters to a target hub with the help of at least one on-body device(s) to satisfy its strict requirements on size, quality of service (QoS, e.g., reliability), and power consumption. In this article, we first review the recent advances of conventional cooperative WBAN. Afterwards, to address the drawbacks of the conventional cooperative WBAN, a QoS-aware buffer-aided relaying framework is proposed for the implant WBAN. In the proposed framework, hierarchical modulations are considered to fulfill the different QoS requirements of different sensor data from an implant medical device. We further conceive some new transmission strategies for the buffer-aided signal-relay and multi-relay implant WBANs. Simulation results show that the proposed cooperative WBAN provides better performance than the conventional cooperative counterparts. Finally, some open research challenges regarding the buffer-aided multi-relay implant WBAN are pointed out to inspire more research activities.

cs.NI

Short Block-length Codes for Ultra-Reliable Low-Latency Communications

This paper reviews the state of the art channel coding techniques for ultra-reliable low latency communication (URLLC). The stringent requirements of URLLC services, such as ultra-high reliability and low latency, have made it the most challenging feature of the fifth generation (5G) mobile systems. The problem is even more challenging for the services beyond the 5G promise, such as tele-surgery and factory automation, which require latencies less than 1ms and failure rate as low as $10^{-9}$. The very low latency requirements of URLLC do not allow traditional approaches such as re-transmission to be used to increase the reliability. On the other hand, to guarantee the delay requirements, the block length needs to be small, so conventional channel codes, originally designed and optimised for moderate-to-long block-lengths, show notable deficiencies for short blocks. This paper provides an overview on channel coding techniques for short block lengths and compares them in terms of performance and complexity. Several important research directions are identified and discussed in more detail with several possible solutions.

cs.IT