In this work, we present bayesgrid, an open-source python toolbox for generating synthetic power transmission-distribution systems for any geographical location worldwide, using the publicly available data from OpenStreetMap (OSM). The toolbox is based on Bayesian Hierarchical Models (BHM) which is trained on existing distribution network databases to develop a probabilistic model and can be applied to any geographical location worldwide, leveraging transfer learning. Thanks to the BHM, the tool is capable of generating multiple instances of the distribution system for a same region. The generated networks contain three-phase phase-consistent unbalanced networks, radial topology and information on the nodal demand distributions. The generated network also contain the critical reliability indices, specifically the interruption duration and frequency of failure for individual grid components, allowing its application in reliability-related studies. The tool is demonstrated for different case studies generating synthetic network datasets for different geographical regions around the world. The framework allows saving the generated networks into open-source platforms: PandaPower and OpenDSS. We also present an application for computation of probabilistic hosting capacity using the synthetic networks.

Low Earth Orbit (LEO) satellite constellations in the 6G era are evolving into intelligent in-orbit computational platforms, forming Space Computing Power Networks (SCPNs) to deliver global-scale computing services. However, the intensive computation within SCPN incurs a significant ``unseen cost'': the frequent charge-discharge cycles accelerate the physical degradation of satellites' life-limiting and high-cost batteries, thereby threatening the long-term operational viability of such a system. Existing approaches, often relying on indirect metrics like Depth of Discharge (DoD) and neglecting the complex, nonlinear degradation process of battery aging, fail to accurately quantify this cost. To address this, we introduce a high-fidelity, physics-driven model that quantitatively links computational workload parameters to the nonlinear battery degradation. Building on this model, we formulate a degradation-aware scheduling problem and analyze heuristic policies across different energy regimes. Simulations reveal that the optimal strategy should be adaptive: in solar-rich conditions, a myopic policy maximizing instantaneous solar utilization is superior, whereas under energy scarcity, a reactive policy leveraging real-time battery state significantly extends lifetime.

Low Earth orbit (LEO) satellite constellations have become a critical enabler for global coverage, utilizing numerous satellites orbiting Earth at high speeds. By decomposing complex network services into lightweight service functions, network function virtualization (NFV) transforms global network services into diverse service function chains (SFCs), coordinated by resource-constrained LEOs. However, the dynamic topology of satellite networks, marked by highly variable inter-satellite link delays, poses significant challenges for designing efficient routing strategies that ensure reliable and low-latency communication. Many existing routing methods suffer from poor scalability and degraded performance, limiting their practical implementation. To address these challenges, this paper proposes a novel SFC routing approach that leverages the statistical properties of network link states to mitigate instability caused by instantaneous modeling in dynamic satellite networks. Through comprehensive simulations on end-to-end shortest-path propagation delays in LEO networks, we identify and validate the statistical stability of multi-hop routes. Building on this insight, we introduce the Stability-Aware Multi-Stage Graph Routing (SA-MSGR) algorithm, which incorporates pre-computed average delays into a multi-stage graph optimization framework. Extensive simulations demonstrate the superior performance of SA-MSGR, achieving significantly lower and more predictable end-to-end SFC delays compared to representative baseline strategies.

The Unscented Kalman Filter (UKF) is a ubiquitous tool for nonlinear state estimation; however, its performance is limited by the static parameterization of the Unscented Transform (UT). Conventional weighting schemes, governed by fixed scaling parameters, assume implicit Gaussianity and fail to adapt to time-varying dynamics or heavy-tailed measurement noise. This work introduces the Meta-Adaptive UKF (MA-UKF), a framework that reformulates sigma-point weight synthesis as a hyperparameter optimization problem addressed via memory-augmented meta-learning. Unlike standard adaptive filters that rely on instantaneous heuristic corrections, our approach employs a Recurrent Context Encoder to compress the history of measurement innovations into a compact latent embedding. This embedding informs a policy network that dynamically synthesizes the mean and covariance weights of the sigma points at each time step, effectively governing the filter's trust in the prediction versus the measurement. By optimizing the system end-to-end through the filter's recursive logic, the MA-UKF learns to maximize tracking accuracy while maintaining estimation consistency. Numerical benchmarks on maneuvering targets demonstrate that the MA-UKF significantly outperforms standard baselines, exhibiting superior robustness to non-Gaussian glint noise and effective generalization to out-of-distribution (OOD) dynamic regimes unseen during training.

This paper studies enhanced droop-free control strategies with sparse neighboring communication for achieving effective active power sharing of distributed energy resources (DERs) while maintaining the frequency stability of islanded microgrids. The normalized active power consensus (NAPC) based droop-free control can share the load among controllable DERs in proportion to their available capacities. However, existing literature exclusively takes the asymptotic stability of the NAPC based droop-free control for granted, lacking a comprehensive theoretical proof that is critical for ensuring its effective design and practical implementation. This paper, for the first time, provides a thorough theoretical proof of the asymptotic stability of two NAPC-based droop-free control schemes: ordinary NAPC (ONAPC) and amplifier-equipped NAPC (A-NAPC), by testifying that all effective eigenvalues have negative real parts. The effect of various system settings on the stability margins is further analyzed with respect to the average admittance of the electrical network, the sparseness of the communication network, and the average available capacity of controllable DERs. Based on the sensitivity of eigenvalues with respect to perturbations, a vulnerability analysis is conducted to identify the weaknesses in the microgrids. Case studies demonstrate that the available capacity of controllable DERs has the most decisive influence on the stability margin of NAPC-based droop-free control, while O-NAPC/ANAPC control scheme is more suitable for microgrids with DERs of larger/ smaller available capacities.

Whispered-to-normal (W2N) speech conversion aims to reconstruct missing phonation from whispered input while preserving content and speaker identity. This task is challenging due to temporal misalignment between whisper and voiced recordings and lack of paired data. We propose FlowW2N, a conditional flow matching approach that trains exclusively on synthetic, time-aligned whisper-normal pairs and conditions on domain-invariant features. We exploit high-level ASR embeddings that exhibits strong invariance between synthetic and real whispered speech, enabling generalization to real whispers despite never observing it during training. We verify this invariance across ASR layers and propose a selection criterion optimizing content informativeness and cross-domain invariance. Our method achieves SOTA intelligibility on the CHAINS and wTIMIT datasets, reducing Word Error Rate by 26-46% relative to prior work while using only 10 steps at inference and requiring no real paired data.

We investigate the use of zero-shot text-to-speech (ZS-TTS) as a data augmentation source for low-resource personalized speech synthesis. While synthetic augmentation can provide linguistically rich and phonetically diverse speech, naively mixing large amounts of synthetic speech with limited real recordings often leads to speaker similarity degradation during fine-tuning. To address this issue, we propose ZeSTA, a simple domain-conditioned training framework that distinguishes real and synthetic speech via a lightweight domain embedding, combined with real-data oversampling to stabilize adaptation under extremely limited target data, without modifying the base architecture. Experiments on LibriTTS and an in-house dataset with two ZS-TTS sources demonstrate that our approach improves speaker similarity over naive synthetic augmentation while preserving intelligibility and perceptual quality.

We prove a converse Lyapunov theorem for boundedness of reachability sets for a general class of control systems whose flow is Lipschitz continuous on compact intervals with respect to trajectory-dominated inputs. We show that this condition is satisfied by many semi-linear evolution equations. For ordinary differential equations, as a consequence of our results, we obtain a converse Lyapunov theorem for forward completeness, without a priori restrictions on the magnitude of inputs.

This work presents a general framework for the operationally driven optimal siting and sizing of battery energy storage systems in power transmission networks, aimed at enhancing their resource adequacy. The approach considers multi-period planning horizons, enforces network constraints at high temporal resolution, and targets large-scale meshed systems. The resulting computationally complex mixed-integer non-linear programming problem is reformulated as a mixed-integer second-order cone programming problem and solved via Generalized Benders Decomposition, with feasibility cuts enabling congestion management and voltage regulation under binding network limits. A tailored heuristic recovers an alternating-current power-flow-feasible operating point from the relaxed solution. The proposed formulation is parallelizable, yielding excellent computational performance, while featuring rigorous guarantees of convergence.

The KID_READOUT board, developed for the CONCERTO millimeter-wave astronomy instrument, implements FPGA-based digital frequency multiplexing to read out large arrays of Microwave Kinetic Inductance Detectors (MKIDs). The complexity of the implemented multirate DSP chain, which combines tones synthesis, interpolation, digital frequency translation, polyphase filter-bank (PFB) channelization, and digital down-conversion (DDC), makes analytical performance optimization difficult. To address this, we developed a cycle-and bitaccurate, Python-based digital twin of the FPGA readout firmware DSP chain. Using this model, we identified the origin of previously measured and unexplained spurs in the readout channels, tracing them to periodicity mismatches between the excitation and analysis paths and to insufficient suppression of negative-frequency components by the DDC filters. Based on these insights, we implemented a mitigation strategy that aligns the periodicities and improves the DDC filter characteristics, effectively eliminating the spurs with a minor increase in FPGA resource usage.

Noisy labels in distributed datasets induce severe local overfitting and consequently compromise the global model in federated learning (FL). Most existing solutions rely on selecting clean devices or aligning with public clean datasets, rather than endowing the model itself with robustness. In this paper, we propose FedCova, a dependency-free federated covariance learning framework that eliminates such external reliances by enhancing the model's intrinsic robustness via a new perspective on feature covariances. Specifically, FedCova encodes data into a discriminative but resilient feature space to tolerate label noise. Built on mutual information maximization, we design a novel objective for federated lossy feature encoding that relies solely on class feature covariances with an error tolerance term. Leveraging feature subspaces characterized by covariances, we construct a subspace-augmented federated classifier. FedCova unifies three key processes through the covariance: (1) training the network for feature encoding, (2) constructing a classifier directly from the learned features, and (3) correcting noisy labels based on feature subspaces. We implement FedCova across both symmetric and asymmetric noisy settings under heterogeneous data distribution. Experimental results on CIFAR-10/100 and real-world noisy dataset Clothing1M demonstrate the superior robustness of FedCova compared with the state-of-the-art methods.

The cross-domain oceanic connectivity ranging from underwater to the sky has become increasingly indispensable for a plethora of data-consuming maritime applications, such as maritime meteorological monitoring and offshore exploration. However, broadband implementations can be severely hindered by the isolation from terrestrial networks, limited satellite resources, and the fundamental inability of radio waves to bridge the water-air interface at high rates. To this end, this paper introduces an optical network bridging underwater, air and near space, which features a number of cooperative low-altitude platforms (LAPs), serving as compute-capable, sensing-aware, and mission-adaptive agents. The network architecture consists of three scenario-specific segments, i.e., water-air direct link, low-altitude mesh network, and the near-space access network. With coordinate sensing and intelligent control, the system tightly couples beam tracking and resource optimization, enabling resilient networking under high mobility and harsh maritime dynamics. Furthermore, we review enabling technologies spanning from water-air channel modeling, adaptive beam alignment under sea-surface perturbations, to swarm-intelligence networking for decentralized control, integrated pose-topology planning, and optical Integrated sensing and communication (ISAC) for near-space target detection and beam alignment. Finally, open issues are also highlighted, constituting a clear roadmap toward scalable, secure, and ultra-broadband oceanic optical networks.

Music Source Restoration (MSR) targets recovery of original, unprocessed instrument stems from fully mixed and mastered audio, where production effects and distribution artifacts violate common linear-mixture assumptions. This technical report presents the CP-JKU team's system for the MSR ICASSP Challenge 2025. Our approach decomposes MSR into separation and restoration. First, a single BandSplit-RoFormer separator predicts eight stems plus an auxiliary other stem, and is trained with a three-stage curriculum that progresses from 4-stem warm-start fine-tuning (with LoRA) to 8-stem extension via head expansion. Second, we apply a HiFi++ GAN waveform restorer trained as a generalist and then specialized into eight instrument-specific experts.

An anomalous back discharge movement phenomenon is induced by a set of dielectric barrier corona discharges (DBCD) at unipolar half-sine voltage waveforms, where the back discharge has a time delay that relates to the applied voltage level. An ionic wind model is employed to analyze the physical behavior. Theoretical explanation and quantitative analysis are presented in this study based on abundant experimental results of 5 typical insulating materials and a FEP insulating cable. A numerical model is derived, which indicates that the back discharge can be activated under a relatively low potential voltage level in this study. The results highlight that the back discharge movement phenomenon behaves distinctly under half-sine voltage with negative polarity, yielding a significantly different partial discharge (PD) pattern with positive polarity. Besides, PD amplitude dependent on dielectric thickness is demonstrated by plotting in phase resolved partial discharge (PRPD) pattern. Furthermore, comparative experiments are conducted with respect to the variation of air gap length and dielectric geometry, manifesting different influences on PD amplitude.

The integration of artificial intelligence as a design tool for metasurfaces, and the implementation of a deep-learning model pose a challenge in the development of an automated solution due to high resources requirements. The presented work introduces a network-layer solution to configure such environment for end user objectives, and for an underlying physical-layer technology. An architecture is developed to design an anomalous reflector by employing the Redhat Openshift AI (RHOAI) technology to support an automated machine learning operations (MLOps) framework in smart radio environments. This entails the design of lossless impenetrable metasurfaces characterized by a scalar surface impedance for an optimal anomalous reflection, achieved by optimizing the number of the Floquet modes through the utilization of a local power conservation constraint qualified as a fitness function. The metasurfaces design process is implemented by using a conditional generative adversarial network (cGAN). An extended cGAN with a surrogate model assists in a high-quality freeform metasurfaces design, where it introduces a swift simulation tool for the metasurfaces design process and analysis of the far-field model. The paper focuses on the challenges of building such a system, and potential abstraction layers. The training accuracy value of the proposed model demonstrates the feasibility and benefits of deploying in containerized environment of Red Hat Openshift in comparison with other deployments of ResNet-50 reported in literature.

In cell-free massive MIMO, centralized precoding is {theoretically known} to {remarkably} outperform its distributed counterparts, albeit {with} high implementation complexity. However, this letter highlights a practical limitation {often overlooked:} {widely used closed-form} centralized {precoders} are typically derived under a sum-power constraint, which often demands unrealistic power allocation that exceeds hardware capabilities. {When two simple heuristics (global power scaling and local normalization) are applied to enforce the per-AP instantaneous power constraint}, the centralized performance superiority disappears, making distributed precoding {a robust option}.

We propose a method to identify nonlinear acyclic networks in continuous time when the dynamics are located on the edges and all the nodes are excited. We show that it is necessary and sufficient to measure all the sinks to identify any tree in continuous time when the functions associated with the dynamics are analytic and satisfy $f(0)=0$, which is analogous to the discrete-time case. For general directed acyclic graphs (DAGs), we show that it is necessary and sufficient to measure all sinks, assuming that the dynamics are not linear (a condition that can be relaxed for trees). Then, based on the measurement of higher order derivatives and nonzero initial conditions, we introduce a method for the identification of trees, which allows us to recover the nonlinear functions located in the edges of the network under the assumption of dictionary functions. Finally, we propose a method to identify multiple parallel paths of the same length between two nodes, which allow us to identify any DAG when combined with the algorithm for the identification of trees. Several examples are added to illustrate the results.

The explosive growth of short video platforms has generated a massive surge in global traffic, imposing heavy financial burdens on content providers. While Peer-to-Peer Content Delivery Networks (PCDNs) offer a cost-effective alternative by leveraging resource-constrained edge nodes, the limited storage and concurrent service capacities of these peers struggle to absorb the intense temporal demand spikes characteristic of short video consumption. In this paper, we propose to minimize transmission costs by exploiting a novel degree of freedom, the inherent flexibility of server-driven playback sequences. We formulate the Optimal Video Ordering and Transmission Scheduling (OVOTS) problem as an Integer Linear Program to jointly optimize personalized video ordering and transmission scheduling. By strategically permuting playlists, our approach proactively smooths temporal traffic peaks, maximizing the offloading of requests to low-cost peer nodes. To solve the OVOTS problem, we provide a rigorous theoretical reduction of the OVOTS problem to an auxiliary Minimum Cost Maximum Flow (MCMF) formulation. Leveraging König's Edge Coloring Theorem, we prove the strict equivalence of these formulations and develop the Minimum-cost Maximum-flow with Edge Coloring (MMEC) algorithm, a globally optimal, polynomial-time solution. Extensive simulations demonstrate that MMEC significantly outperforms baseline strategies, achieving cost reductions of up to 67% compared to random scheduling and 36% compared to a simulated annealing approach. Our results establish playback sequence flexibility as a robust and highly effective paradigm for cost optimization in PCDN architectures.

Continuous efforts have been devoted to integrate millimeter wave (mmWave) and terahertz (THz) bands into future communication standards in order to overcome the bandwidth shortage problem and achieve high data rates, primarily through developing accompanying technologies that can overcome the severe propagation loss and blockage associated with increased carrier frequency. One of the most notable accompanying technologies is reconfigurable intelligent surface (RIS), which uses a large number of low-cost passive reflecting elements to reconfigure the propagation environments for improved communication performance and coverage. Despite its numerous benefits, RIS can make channel estimation more difficult due to its lack of radio frequency (RF) chains that can perform baseband signal processing. In addition, the cascaded channel structure of RIS-aided communication systems, which differs from that in conventional systems, brings about significant challenges in both channel estimation and beamforming. In this paper, we propose the joint channel estimation and beamforming optimization algorithm for RIS-aided multiple-input multipleoutput (MIMO) communication systems. By carefully exploiting the angular sparsity of mmWave/THz channels, our proposed algorithm successfully designs the RIS matrices that not only facilitate the channel estimation process but also achieve the passive beamforming gain through increased channel capacity. Simulation results demonstrate that our proposed algorithm provides the systems of interest with significant improvement in spectral efficiency.

Offline Reinforcement Learning (RL) is a promising approach for next-generation wireless networks, where online exploration is unsafe and large amounts of operational data can be reused across the model lifecycle. However, the behavior of offline RL algorithms under genuinely stochastic dynamics -- inherent to wireless systems due to fading, noise, and traffic mobility -- remains insufficiently understood. We address this gap by evaluating Bellman-based (Conservative Q-Learning), sequence-based (Decision Transformers), and hybrid (Critic-Guided Decision Transformers) offline RL methods in an open-access stochastic telecom environment (mobile-env). Our results show that Conservative Q-Learning consistently produces more robust policies across different sources of stochasticity, making it a reliable default choice in lifecycle-driven AI management frameworks. Sequence-based methods remain competitive and can outperform Bellman-based approaches when sufficient high-return trajectories are available. These findings provide practical guidance for offline RL algorithm selection in AI-driven network control pipelines, such as O-RAN and future 6G functions, where robustness and data availability are key operational constraints.

This paper develops a harmonic-domain framework for systems with variable fundamental frequency. A variable-frequency sliding Fourier decomposition is introduced in the phase domain, together with necessary and sufficient conditions for time- domain realizability. An exact harmonic-domain differential model is derived for general nonlinear systems under variable frequency, without assumptions on the frequency variation. An explicit parameter-varying approximation is then obtained, along with a tight error bound expressed in terms of local relative frequency variation, providing a non-conservative validity criterion and clarifying the limitations of classical heuristics. A main result shows that, for linear phase-periodic systems with affine frequency dependence, stability analysis and control synthesis can be carried out without approximation and without assumptions on the frequency variation, provided the frequency evolves within a prescribed interval. As a consequence, both problems reduce to harmonic Lyapunov inequalities evaluated at the two extreme frequency values, yielding a convex LMI characterization. The framework is illustrated on a variable-speed permanent magnet synchronous motor.

Speech deepfake detection (SDD) is essential for maintaining trust in voice-driven technologies and digital media. Although recent SDD systems increasingly rely on self-supervised learning (SSL) representations that capture rich contextual information, complementary signal-driven acoustic features remain important for modeling fine-grained structural properties of speech. Most existing acoustic front ends are based on time-frequency representations, which do not fully exploit higher-order spectral dependencies inherent in speech signals. We introduce a cyclostationarity-inspired acoustic feature extraction framework for SDD based on spectral correlation density (SCD). The proposed features model periodic statistical structures in speech by capturing spectral correlations between frequency components. In particular, we propose temporally structured SCD features that characterize the evolution of spectral and cyclic-frequency components over time. The effectiveness and complementarity of the proposed features are evaluated using multiple countermeasure architectures, including convolutional neural networks, SSL-based embedding systems, and hybrid fusion models. Experiments on ASVspoof 2019 LA, ASVspoof 2021 DF, and ASVspoof 5 demonstrate that SCD-based features provide complementary discriminative information to SSL embeddings and conventional acoustic representations. In particular, fusion of SSL and SCD embeddings reduces the equal error rate on ASVspoof 2019 LA from $8.28\%$ to $0.98\%$, and yields consistent improvements on the challenging ASVspoof 5 dataset. The results highlight cyclostationary signal analysis as a theoretically grounded and effective front end for speech deepfake detection.

Testing Ultra-Wideband (UWB) systems is challenging, as multiple devices need to coordinate over lossy links and the systems' behavior is influenced by timing, synchronization, and environmental factors. Traditional testing is often insufficient to capture these complex interactions, highlighting the need for an overarching testbed infrastructure that can manage devices, control the environment, and make measurements and test scenarios repeatable. In this work, we present a highly automated testbed architecture built on Robot Operating System Version 2, integrating device management with environmental control and measurement systems. It includes an optical reference system, a controllable Autonomous Guided Vehicle to position devices within the environment, and time synchronization via Network Time Protocol (NTP). The testbed achieves a Root Mean Squared Error of 4.8 mm for positioning repeatability and 0.493$°$ for the orientation, and our NTP-based synchronization approach achieves a timing accuracy of below 1 ms. All testbed functionality can be controlled remotely through simple Python scripts to allow automated orchestration tasks such as conducting complex measurement scenarios. We demonstrate this with a measurement campaign on UWB localization, showing how it enables repeatable, observable, and fully controlled wireless experiments.

Cloud-edge collaboration enhances machine perception by combining the strengths of edge and cloud computing. Edge devices capture raw data (e.g., 3D point clouds) and extract salient features, which are sent to the cloud for deeper analysis and data fusion. However, efficiently and reliably transmitting features between cloud and edge devices remains a challenging problem. We focus on point cloud-based object detection and propose a task-driven point cloud compression and reliable transmission framework based on source and channel coding. To meet the low-latency and low-power requirements of edge devices, we design a lightweight yet effective feature compaction module that compresses the deepest feature among multi-scale representations by removing task-irrelevant regions and applying channel-wise dimensionality reduction to task-relevant areas. Then, a signal-to-noise ratio (SNR)-adaptive channel encoder dynamically encodes the attribute information of the compacted features, while a Low-Density Parity-Check (LDPC) encoder ensures reliable transmission of geometric information. At the cloud side, an SNR-adaptive channel decoder guides the decoding of attribute information, and the LDPC decoder corrects geometry errors. Finally, a feature decompaction module restores the channel-wise dimensionality, and a diffusion-based feature upsampling module reconstructs shallow-layer features, enabling multi-scale feature reconstruction. On the KITTI dataset, our method achieved a 172-fold reduction in feature size with 3D average precision scores of 93.17%, 86.96%, and 77.25% for easy, moderate, and hard objects, respectively, over a 0 dB SNR wireless channel. Our source code will be released on GitHub at: https://github.com/yuanhui0325/T-PCFC.

Software-hardware co-design is essential for optimizing in-memory computing (IMC) hardware accelerators for neural networks. However, most existing optimization frameworks target a single workload, leading to highly specialized hardware designs that do not generalize well across models and applications. In contrast, practical deployment scenarios require a single IMC platform that can efficiently support multiple neural network workloads. This work presents a joint hardware-workload co-optimization framework based on an optimized evolutionary algorithm for designing generalized IMC accelerator architectures. By explicitly capturing cross-workload trade-offs rather than optimizing for a single model, the proposed approach significantly reduces the performance gap between workload-specific and generalized IMC designs. The framework is evaluated on both RRAM- and SRAM-based IMC architectures, demonstrating strong robustness and adaptability across diverse design scenarios. Compared to baseline methods, the optimized designs achieve energy-delay-area product (EDAP) reductions of up to 76.2% and 95.5% when optimizing across a small set (4 workloads) and a large set (9 workloads), respectively. The source code of the framework is available at https://github.com/OlgaKrestinskaya/JointHardwareWorkloadOptimizationIMC.

Radiative near-field (RNF) beamforming is vulnerable to blockages that disrupt Fresnel zones. This letter proposes an obstruction-unaware wavefront shaping strategy inspired by catastrophe optics. By superimposing a calibrated quartic phase, we generate a Pearcey-like wave packet that exhibits structural stability against perturbations. We establish a fair comparison protocol where the quartic beam is calibrated in free space to avoid exploiting obstruction knowledge. Numerical results demonstrate up to 8.5~dB SINR gain over conventional focusing for multi-user scenarios near the depth-of-focus limit. Crucially, this gain stems from improved channel conditioning under partial blockage, which mitigates the severe noise amplification inherent to zero-forcing precoding.

Audio-Visual Speech Recognition (AVSR) integrates acoustic and visual information to enhance robustness in adverse acoustic conditions. Recent advances in Large Language Models (LLMs) have yielded competitive automatic speech recognition performance and shown effectiveness for AVSR. However, prior approaches project audio and visual features independently or apply shallow fusion, limiting cross-modal alignment and complementary exchange while increasing the LLM's computational load. To address this, we propose AVUR-LLM, an LLM-based Audio-Visual Speech Recognition via Sparse Modality Alignment and Visual Unit-Guided Refinement. Experiments on LRS3 demonstrate state-of-the-art results for AVSR. Under additive-noise conditions at 0 dB SNR, it achieves 37% relative improvement over the baseline system.

A transmit pinching-antenna system (T-PASS) framework is proposed, in which a single pinched waveguide is employed to jointly serve one wired user equipment (UE) and multiple wireless UEs. The signal radiated by the pinching antennas (PAs) is used to serve the wireless UEs, whereas the residual guided signal at the waveguide termination is used to serve the wired UE. To facilitate T-PASS transmission and mitigate inter-user interference, a hybrid non-orthogonal multiple access (NOMA) scheme is introduced. Wireless UEs are scheduled by time-division multiple access (TDMA), and, in each slot, the scheduled wireless UE is paired with the wired UE through power-domain NOMA. Within this framework, the PA positions, PA radiation coefficients, power allocation, and TDMA time-slot allocation are jointly optimized to maximize a weighted sum rate (WSR). i) For the two-user case with one wired UE and one wireless UE, the optimal PA position and successive interference cancellation (SIC) decoding order are derived. Closed-form optimal power allocation is obtained, and a near-optimal PA radiation coefficient is determined through a low-complexity one-dimensional search. ii) For the multiuser case with one wired UE and multiple wireless UEs, four protocols with different PA-position and PA-radiation configurations are proposed. For each protocol, a low-complexity element-wise alternating optimization algorithm is developed to optimize the PA positions and radiation coefficients, while closed-form solutions are derived for the optimal power allocation and time-slot allocation. Numerical results are presented to show that: i) under typical T-PASS configurations, the wired UE is selected as the strong user in the optimal SIC decoding order; ii) the proposed T-PASS framework achieves a significantly higher WSR than conventional wireless-only PASS.

Hybrid Automatic Repeat Request (HARQ) schemes typically allocate all available resources to retransmit failed packets to ensure reliability. However, under stringent delay constraints, these schemes often exhibit low spectral efficiency and increased transmission latency. To address these challenges, this paper proposes an efficient Non-Orthogonal HARQ with Chase Combining (N-HARQ-CC) transmission strategy. Specifically, the proposed approach allocates a larger portion of retransmission resources to new data packets, reserving only a small fraction for retransmitting previously erroneous packets. This is based on the observation that only a small number of information bits are typically incorrect, enabling surplus communication resources to be utilized for transmitting new messages. The N-HARQ-CC scheme retransmits the same redundant version of a failed packet and employs Maximum Ratio Combining (MRC) for decoding. To minimize complex packet scheduling and decoding complexity, the proposed scheme limits superposition to at most two messages per transmission round. At the receiver, Successive Interference Cancellation (SIC) is used to decouple the superimposed messages. The proposed N-HARQ-CC system was implemented using GNU Radio and USRP platforms for validation. Compared to conventional Type-I HARQ and HARQ-CC schemes, the proposed scheme achieves a significant improvement in spectral efficiency of approximately 0.5 bps/Hz, aligning with the low-latency requirements of 6G networks.

The rapid deployment of large-scale low Earth orbit (LEO) satellite constellations has positioned direct-to-handset (D2H) communications as a key enabler of future non-terrestrial networks. However, the limited link budget of handheld devices makes broadband service delivery challenging, and multi-satellite cooperative transmission is often required to provide sufficient power gain. In practice, such cooperation is severely hindered by asynchronous reception across satellites. This paper analyzes the received-signal model under the 3rd Generation Partnership Project (3GPP) transmitter structure and shows that satellite-dependent propagation delays prevent simultaneous timing alignment for multiple user terminals (UTs). This timing mismatch induces severe inter-carrier interference (ICI) and inter-symbol interference (ISI), even from the intended signals, which fundamentally constrains the achievable cooperative gain. To address this issue, we propose a timing-aware satellite association strategy that enables cooperation only with satellites expected to satisfy a UT-side timing tolerance, thereby avoiding dominant asynchronous interference by design. Simulation results demonstrate that the proposed strategy improves throughput performance compared to single-satellite transmission and fully connected multi-satellite baselines.