Communication signal reconstruction technology represents a critical area of research within communication countermeasures and signal processing. Considering traditional OFDM signal reconstruction methods’ intricacy and suboptimal reconstruction performance, a dual discriminator CGAN model incorporating LSTM and Transformer is proposed. When reconstructing OFDM signals using the traditional CNN network, it becomes challenging to extract intricate temporal information. Therefore, the BiLSTM network is incorporated into the first discriminator to capture timing details of the IQ (In-phase and Quadrature-phase) sequence and constellation map information of the AP (Amplitude and Phase) sequence. Subsequently, following the addition of fixed position coding, these data are fed into the core network constructed based on the Transformer Encoder for further learning. Simultaneously, to capture the correlation between the two IQ signals, the VIT (Vision in Transformer) concept is incorporated into the second discriminator. The IQ sequence is treated as a single-channel two-dimensional image and segmented into pixel blocks containing IQ sequence through Conv2d. Fixed position coding is added and sent to the Transformer core network for learning. The generator network transforms input noise data into a dimensional space aligned with the IQ signal and embedding vector dimensions. It appends identical position encoding information to the IQ sequence before sending it to the Transformer network. The experimental results demonstrate that, under commonly utilized OFDM modulation formats such as BPSK, QPSK, and 16QAM, the time series waveform, constellation diagram, and spectral diagram exhibit high-quality reconstruction. Our algorithm achieves improved signal quality while managing complexity compared to other reconstruction methods.

Designing Low Earth Orbit (LEO) constellations for the continuous, collaborative observation of space objects in MEO/GEO is a complex optimization task, frequently limited by prohibitive computational costs. This study introduces an efficient surrogate-based framework to overcome this challenge. Our approach integrates Optimized Latin Hypercube Sampling (OLHS) with a Radial Basis Function (RBF) model to minimize the required number of satellites. In a comprehensive case study targeting 18 diverse space objects—including communication satellites in GEO (e.g., EUTELSAT, ANIK) and navigation satellites in MEO/IGSO from GPS, Galileo, and BeiDou constellations—the method proved highly effective and scalable. It successfully designed a 208-satellite Walker constellation that provides 100% continuous coverage over a 36-h period. Furthermore, the design ensures that each target is simultaneously observed by at least three satellites at all times. A key finding is the method’s remarkable efficiency and scalability: the optimal solution for this larger problem was found using only 46 high-fidelity function evaluations, maintaining a computational time that was 5–8 times faster than traditional global optimization algorithms. This research demonstrates that surrogate-assisted optimization can drastically lower the computational barrier in constellation design, offering a powerful tool for building cost-effective and robust Space Situational Awareness (SSA) systems.

Radio Environment Map (REM) construction is frequently constrained by sparse and unevenly distributed spectrum measurements. While existing completion methods primarily target Power Spectral Density (PSD) data under random missing patterns, the reconstruction of Reference Signal Received Power (RSRP) maps under structured data loss remains underexplored. This study addresses this gap by proposing a fully convolutional densely connected autoencoder(AE) for RSRP map completion. The encoder stacks dense blocks and transition layers, a bottleneck preserves the latent representation, and the decoder restores spatial resolution through transposed convolution. Both global and local skip connections are incorporated to fuse large-scale structure with fine-grained details. A composite loss function supervises observed and missing regions separately, which preserves the fidelity of known measurements while improving inference over unobserved grid points. Experiments on the public DeepREM dataset under random, spatial, and strip-wise missing patterns show that the method achieves the best or comparable completion accuracy in most tested settings, with the most pronounced performance gains over mainstream baselines under the challenging spatial block-missing case.

In geostationary Earth orbit high-throughput satellite beam hopping systems, dynamic non-uniform traffic causes inter-beam service imbalance. Existing scheduling methods primarily rely on instantaneous demand, causing long-term deprived beams to be repeatedly skipped and thereby accumulating delay and queuing risk. We propose a service urgency-aware framework, termed the beam-hopping urgency-aware resource scheduling architecture (BH-URSA). It constructs a unified service-urgency metric to characterize long-term service pressure, integrates link-state information into an interpretable base priority, and employs bounded-residual actor-critic learning to adaptively adjust the base priority. A greedy priority scheduler then generates feasible allocations under hard constraints. Simulations show that under medium load, the average completion delay drops to 0.251 slots, an 87.3% reduction over the baseline. Under high load, the 10th percentile tail service rate reaches 27.75%, improving by 21.11 and 22.90 percentage points over the Demand-Greedy and Probabilistic-BQP baselines, respectively, while maintaining a competitive demand satisfaction ratio and a drop rate comparable to the Demand-Greedy baseline. These results demonstrate that explicit long-term service-state modeling significantly improves delay and tail-service performance.