The development of polarization-adjusted convolutional (PAC) codes has introduced a class of efficient designs for short packet transmission. In this contribution, aiming at more flexible code length and rate matching for time-varying channel scenarios, a low-complexity puncturing algorithm for PAC codes is proposed. Specifically, we introduce a Gaussian approximation (GA) algorithm for PAC codes and propose a GA-based optimization method for punctured patterns. Building on this, we present a Gaussian inverse mapping method based on partial order, utilizing a recursive approach to construct the initial set, which significantly reduces the search complexity. Subsequently, we develop a recursive puncturing algorithm based on partial order. Finally, we integrate this method with Reed-Muller (RM) rules, further reducing the complexity.

In the global navigation satellite system (GNSS), identifying not only single but also compound jamming signals is crucial for ensuring reliable navigation and positioning, particularly in future wireless communication scenarios such as the space-air-ground integrated network (SAGIN). However, conventional techniques often struggle with low recognition accuracy and high computational complexity, especially under low jamming-to-noise ratio (JNR) conditions. To overcome the challenge of accurately identifying compound jamming signals embedded within GNSS signals, we propose ACSNet, a novel convolutional neural network designed specifically for this purpose. Unlike conventional methods that tend to exhibit lower accuracy and higher computational demands, particularly in low JNR environments, ACSNet addresses these issues by integrating asymmetric convolution blocks, which improve sensitivity to subtle signal variations while reducing the number of parameters by approximately 50% compared to symmetric convolutional designs. Simulations demonstrate that ACSNet significantly improves accuracy in low JNR regions and shows robust resilience to power ratio (PR) variations. It achieves an overall accuracy of 91.84% and a Kappa coefficient (×100) of 90.82, and notably reaches near 100% recognition accuracy when the JNR is greater than or equal to −9 dB, confirming its effectiveness and efficiency for practical GNSS interference management applications.

With the burgeon deployment of the fifth-generation new radio (5 G NR) networks, the codebook plays a crucial role in enabling the base station (BS) to acquire the channel state information (CSI). Different 5 G NR codebooks incur varying overheads and exhibit performance disparities under diverse channel conditions, necessitating codebook adaptation based on channel conditions to reduce feedback overhead while enhancing performance. However, existing methods of 5 G NR codebooks adaptation require significant overhead for model training and feedback or fall short in performance. To address these limitations, this letter introduces a federated reservoir computing framework designed for efficient codebook adaptation in computationally and feedback resource-constrained mobile devices. This framework utilizes a novel series of indicators as input training data, striking an effective balance between performance and feedback overhead. Compared to conventional models, the proposed codebook adaptation via federated reservoir computing (CA-FedRC), achieves rapid convergence and significant loss reduction in both speed and accuracy. Extensive simulations under various channel conditions demonstrate that our algorithm not only reduces resource consumption of users but also accurately identifies channel types, thereby optimizing the trade-off between spectrum efficiency, computational complexity, and feedback overhead.

To enhance straggler resilience in federated learning (FL) systems, a semi-decentralized approach has been recently proposed, enabling collaboration between clients. Unlike the existing semi-decentralized schemes, which adaptively adjust the collaboration weight according to the network topology, this letter proposes a deterministic coded network that leverages wireless diversity for semi-decentralized FL without requiring prior information about the entire network. Furthermore, the theoretical analyses of the outage and the convergence rate of the proposed scheme are provided. Finally, the superiority of our proposed method over benchmark methods is demonstrated through comprehensive simulations.

In this paper, we investigate the problem of distributed learning (DL) in the presence of Byzantine attacks. For this problem, various robust bounded aggregation (RBA) rules have been proposed at the central server to mitigate the impact of Byzantine attacks. However, current DL methods apply RBA rules for the local gradients from the honest devices and the disruptive information from Byzantine devices, and the learning performance degrades significantly when the local gradients of different devices vary considerably from each other. To overcome this limitation, we propose a new DL method to cope with Byzantine attacks based on coded robust aggregation (CRA-DL). Before training begins, the training data are allocated to the devices redundantly. During training, in each iteration, the honest devices transmit coded gradients to the server computed from the allocated training data, and the server then aggregates the information received from both honest and Byzantine devices using RBA rules. In this way, the global gradient can be approximately recovered at the server to update the global model. Compared with current DL methods applying RBA rules, the improvement of CRA-DL is attributed to the fact that the coded gradients sent by the honest devices are closer to each other. This closeness enhances the robustness of the aggregation against Byzantine attacks, since Byzantine messages tend to be significantly different from those of honest devices in this case. We theoretically analyze the convergence performance of CRA-DL. Finally, we present numerical results to verify the superiority of the proposed method over existing baselines, showing its enhanced learning performance under Byzantine attacks.

In this paper, we consider the problem of federated learning (FL) with devices that have intermittent connectivity to the central server. For this problem, the concept of semi-decentralized FL has been proposed in the literature. This paradigm allows non-straggler devices to relay the gradients computed by the stragglers to the server, and enables realization of gradient coding (GC) to mitigate the negative impact of the stragglers that fail to communicate directly to the central server. However, for GC in semi-decentralized FL, the communication overhead caused by information transmission among the devices is significant. To overcome this shortcoming, inspired by the existing communication-optimal exact consensus algorithm (CECA), we propose a new communication-efficient semi-decentralized FL method (COFFEE). In each round, the devices exchange information by taking a certain number of steps towards communication-optimal exact consensus, ensuring that each device obtains the average of the gradients computed by both its previous neighbors and itself. Afterwards, the non-stragglers transmit the local average result to the server for global aggregation to update the global model. We analyze the convergence performance and the communication overhead of COFFEE analytically. Building on this, to further enhance learning performance under a specific communication overhead, we propose an enhanced version of COFFEE with an adaptive aggregation rule at the central server, referred to as A-COFFEE, which adjusts to the straggler pattern of the devices over training rounds. Experiments are conducted to verify that the proposed methods outperform the baseline methods.

This work studies gradient coding (GC) in the context of distributed training problems with unreliable communication. We propose cooperative GC (CoGC), a novel gradient-sharing-based GC framework that leverages cooperative communication among clients. This approach eliminates the need for dataset replication, making it communication- and computation-efficient and suitable for federated learning (FL). By employing the standard GC decoding mechanism, CoGC yields strictly binary outcomes: the global model is either recovered exactly or the recovery is meaningless, with no intermediate outcomes. This characteristic ensures the optimality of the training and demonstrates strong resilience to client-to-server communication failures. However, due to the limited flexibility of the recovery outcomes, the decoding mechanism may also result in communication inefficiency and hinder convergence, especially when communication channels among clients are in poor condition. To overcome this limitation and further exploit the potential of GC matrices, we propose a complementary decoding mechanism, termed GC⁺, which leverages information that would otherwise be discarded during GC decoding failures. This approach significantly improves system reliability against unreliable communication, as the full recovery¹ of the global model dominates in GC⁺. To conclude, this work establishes solid theoretical frameworks for both CoGC and GC⁺. We assess the system reliability by outage analyses and convergence analyses for each decoding mechanism, along with a rigorous investigation of how outages affect the structure and performance of GC matrices. Finally, the effectiveness of CoGC and GC⁺ is validated through extensive simulations.

In this letter, we propose a new sparse linear array (SLA), termed delay coprime array (DCA), and correspondingly develop a low-complexity direction of arrival (DOA) estimation algorithm. In terms of structure, unlike existing SLAs, e.g., coprime array, DCA is composed of two “large-spaced” uniform linear arrays (ULAs) with shifted distance which is coprime with the inter-element spacing in the ULAs. In terms of algorithm, the proposed algorithm involves ambiguity and de-ambiguity stages and significantly improves estimation accuracy due to the active use of phase ambiguity instead of hastily suppressing ambiguity. Numerical results indicate that DOA estimation with DCA has comparable performance as the existing DOA estimation with SLAs, but with much lower complexity and simpler configuration. Admittedly, since the proposed method achieves fast calculation without using difference co-array, it losts the ability to identify more sources. Yet, owing to low complexity and simple configuration, DCA and the corresponding algorithm are expected to play a role in DOA estimation.

Benefiting from the outstanding advantages in speeding up task processing and saving energy consumption, vehicular edge computing has entered a period of rapid development. Given the sharp increase in application services, it is vital to fully utilize all available computation resources to guarantee personalized requirements from different users. Specially, a lot of idle vehicle resources can be exploited for task execution to improve the service experience. On the other hand, most works focus on the system performance and fail to guarantee diversified user demands. To this end, we propose a novel distributed collaborative computing scheme for task completion rate maximization (TCRM) in vehicular networks by taking into account both vertical and horizontal collaboration. The novelty of horizontal collaboration lies in the full use of available one-hop vehicle resources for task computing. In order to simultaneously guarantee the system-level performance and the user-level performance, TCRM aims to maximize the task completion rate while minimizing the energy consumption by intelligent resource optimization and task allocation. A TD3-based algorithm combined with the Dirichlet distribution is proposed to obtain the optimization decisions. Extensive simulations demonstrate that TCRM significantly improves performance compared to baseline algorithms.

In the rapidly advancing field of federated learning (FL), ensuring efficient FL task delegation while incentivizing FL client participation poses significant challenges, especially in wireless networks where FL participants' coverage is limited. Existing Contract Theory-based methods are designed under the assumption that there is only one FL server in the system (i.e., the monopoly market assumption), which in unrealistic in practice. To address this limitation, we propose Fairness-Aware Multi-Server FL task delegation approach (FAMuS), a novel framework based on Contract Theory and Lyapunov optimization to jointly address these intricate issues facing wireless multi-server FL networks (WMSFLN). Within a given WMSFLN, a task requester products multiple FL tasks and delegate them to FL servers which coordinate the training processes. To ensure fair treatment of FL servers, FAMuS establishes virtual queues to track their previous access to FL tasks, updating them in relation to the resulting FL model performance. The objective is to minimize the time-averaged cost in a WMSFLN, while ensuring all queues remain stable. This is particularly challenging given the incomplete information regarding FL clients' participation cost and the unpredictable nature of the WMSFLN state, which depends on the locations of the mobile clients. Extensive experiments comparing FAMuS against five state-of-the-art approaches based on two real-world datasets demonstrate that it achieves 6.91% higher test accuracy, 27.34% lower cost, and 0.63% higher fairness on average than the best-performing baseline.