Zhiping Huang

Distributed beamforming in UAV swarms requires fast and accurate carrier-phase alignment under sparse connectivity and propagation-induced phase bias. This paper proposes a physics-aware decentralized synchronization framework for quasi-static UAV swarm beamforming by integrating momentum-accelerated Metropolis–Hastings consensus with position-aided phase pre-compensation. To preserve phase evolution on the circular manifold, a sinusoidal coupling law is adopted, while the momentum term improves convergence in sparse random geometric graphs. A propagation model is further established to characterize how geometric separation and ranging uncertainty translate into residual phase error and coherent power loss. Under small-signal conditions, local stability is analyzed, and Monte Carlo simulations are conducted to evaluate convergence, synchronization accuracy, robustness, and beam-focusing performance. Results show that, at 2.4 GHz with low-centimeter ranging uncertainty, the proposed method achieves sub-wavelength synchronization accuracy while providing an effective balance among convergence speed, accuracy, and complexity. Compared with standard Metropolis–Hastings, fixed-weight, and other accelerated consensus methods, the proposed scheme converges faster over most sparse topologies. Although its steady-state accuracy is slightly lower than that of filter-based predictive methods such as KF-DFPC in some cases, those schemes incur higher implementation and computational overhead. Therefore, from the perspectives of decentralized realization and practical deployment, the proposed method is more suitable for lightweight phase synchronization in distributed UAV swarms.

Signal-to-noise ratio (SNR) estimation plays a crucial role in communication systems, directly impacting the quality and reliability of signal transmission. This paper proposes a novel deep learning framework aimed at enhancing the accuracy and robustness of SNR estimation. The framework converts received signals into time–frequency matrices as feature inputs, effectively capturing both temporal and spectral characteristics through time–frequency analysis. Extensive experimental results across an SNR range of −5 dB to 15 dB demonstrate that our method achieves a mean squared error (MSE) that closely approaches the theoretical Cramér–Rao bound (CRB), comparable to data-aided (DA) maximum likelihood methods. A quantitative analysis reveals that, even under challenging conditions, such as a low SNR of −5 dB, the model maintains superior accuracy with a mean absolute error (MAE) as low as 0.352, significantly outperforming traditional M2M4 and NDA estimators. The model’s performance was systematically evaluated in a wide range of scenarios, encompassing various signal modulation formats, upsampling factors, multipath fading channels, frequency offsets, phase shifts, and roll-off factors. The evaluation highlights its exceptional generalization capability and robustness, with high performance and stability maintained even in challenging and dynamic environments.

Unmanned Aerial Vehicles (UAVs) are widely used in defense applications. Multiple UAVs equipped with jamming sources can form a sparse array. The sparse array can be quickly deployed and achieve an extensive range of effective jamming. At present, the jamming power in the target area is mainly calculated through the superposition of node waveforms. The algorithm needs to sequentially calculate the angle of the target position relative to each node to obtain the corresponding gain and then calculate the path loss by the transmission model to obtain the total jamming power, which has high algorithmic complexity and needs to recount the power every time after adjusting the position of the node. An equivalent transmitted power estimation algorithm based on the pattern multiplication theorem is proposed in this paper, which regards the sparse array as a whole directional jammer. The power in the target area can be estimated according to the jammer gain, the equivalent transmitted power, and the jamming distance. In the calculation of jamming power, the proposed array-based algorithm reduces the complexity by 50% compared with the waveform superposition algorithm, and the estimation variance of the jamming power is less than 1.4%.

Distributed beamforming has emerged as a pivotal technology in modern communication systems, radar applications, and collaborative electronic warfare. Through distributed collaboration, these jamming nodes composed of unmanned aerial vehicles (UAVs) can execute flexible electronic jamming toward wireless communication systems despite energy limitations. However, they encounter challenges such as time and positioning inaccuracies, which can diminish the synthesis power of jamming beams and reduce jamming effectiveness. This paper examines the impact of angle and distance errors on jamming effectiveness, deriving upper error bounds under various suppression coefficients. The findings offer practical guidelines for enhancing the precision and effectiveness of distributed beamforming systems in electronic warfare applications.

In this paper, we propose an Extended Kalman Filtering with phase noise reconstruction (EKF-PC) scheme to enhance the carrier recovery capability for probabilistic shaping of coherent optical communication systems with various shaping factors. We first investigate the weights of the shaping factor and the noise rejection window length of EKF-PC for PS-64QAM at a fixed signal-to-noise ratio (SNR). After that, we jointly optimize the shaping factor and the noise rejection window length to obtain the maximum achievable information rate at a variety of SNRs. Then, we numerically analyze the carrier recovery performance of the EKF-PC for different linewidths and SF conditions. Finally, we conduct simulation experiments to compare EKF-PC, PCPE, and other currently available Kalman CPE algorithms with the SFs of 0.02, 0.025, 0.03, and 0.035 under back-to-back (B2B) scenarios. The experimental results show that EKF-PC obtains an average SNR improvement of 0.13–0.5 dB compared to PCPE and an average performance improvement of 0.5–1 dB compared to other Kalman algorithms.

This paper proposes a novel and efficient low-complexity chromatic dispersion equalizer (CDE) based on finite impulse response (FIR) filter architecture for polarization-multiplexed coherent optical communication systems. The FIR filter coefficients are optimized by weights to reduce the energy leakage caused by the truncation effect, and then quantization is used uniformly to reduce the number of real number additions and real number multiplications by utilizing the diversity of the quantized coefficients. Using Optisystem 15 to build a coherent optical communication system for simulation and experimental demonstration, the results show that after the filter coefficients are optimized by weights. Compared with the time-domain chromatic dispersion equalizer (TD-CDE), the proposed design has a lower bit error rate (BER) and better equalization effect. When the transmission distance is 4000 km and the system quantization stages M = 16, the multiplication operation and addition operations reduce computing resources by 99% and 43%, and the BER only increases by 5%. Compared with frequency-domain chromatic dispersion equalizer (FD-CDE), widely used in long-distance communication, the multiplication operation reduces computing resources by 30%. The proposed method provides a new idea for high-performance CDE in long-distance coherent optical communication systems.

Chromatic dispersion equalization (CDE) in coherent optical communication systems is extremely critical for subsequent digital signal processing (such as frequency offset estimation and carrier phase recovery). Various methods mentioned in the published literature are not satisfactory when the signal bandwidth is limited. This paper proposes a way of using singular value decomposition least square (SVDLS) to obtain the optimal tap weight of the CDE filter and a method to introduce the adaptive mutation particle swarm optimizer (AMPSO) algorithm into the CDE. We show that the two proposed approaches are based on the best approximation of the frequency domain response of the designed and ideal CDE filter. Compared with the traditional CDE method, which needs to be implemented in the full frequency band, the two methods can be implemented in the narrow frequency band. The simulation shows that the effective bandwidth of the baseband signal is limited by squared-root-raised-cosine (SRRC) pulse shaping with a roll-off factor of 0.25 in different modulation formats (DP-QPSK, DP-16 QAM, DP-64 QAM) when the number of taps of the filter is 131, which is 37.5% less than the full frequency band. The designed filter is superior to the existing filter in terms of filtering effect and implementation complexity.

In optical communication systems, coherent detection is a standard method. The received signal enters the digital domain after passing through a time-interleaved analog-to-digital converter (TI-ADC). However, the time delay of the ADC brings noise into the signal, which decreases the signal quality; therefore, ADC calibration is essential. At present, there are many calibration methods for time delay, but their performances are not satisfactory at a high sampling frequency. This paper presents a method of time delay estimation and calibration in a coherent optical communication system. First, the expected maximum (EM) method is used to roughly estimate the time delay and then transfer the estimated value into the trained back propagation (BP) neural network to generate more accurate results. Second, the sampled signal is reconstructed, and then a finite impulse response (FIR) filter is designed to compensate for the time delay. There are several advantages of the proposed method compared with previous works: the convergence with a BP network is faster, the estimation accuracy is higher, and the calibration does not affect the sample operation of the ADC working in the background mode. In addition, the proposed calibration method does not need additional circuits and its low power consumption provides more sources for dispersion compensation, error correction, and other subsequent operations in the coherent optical communication system. Based on the quadrature phase shift keying (QPSK) system, the proposed method was implemented in a 16-channel/8-bit, 40-GS/s ADC. After estimation and calibration, the relative error of estimation was below 1%, the signal noise distortion rate (SNDR) reached 55.9 dB, the spurious free dynamic range (SFDR) improved to 61.2 dB, and the effective number of bits (ENOB) was 6.7 bits. The results demonstrate that the proposed method has a better calibration performance than other methods.

Nyquist signals with low roll-off factors pose a challenge for non-data-aided blind symbol rate estimation problems in long-haul applications. We adopted the nonlinear least squares (NLS) approach to estimate the symbol rate of low roll-off factor signals. This method tolerates chromatic dispersion and additive Gaussian noise. In addition, this method can operate below two samples per symbol, thus enabling low-power-consumption receivers. Simulation and experimental results show that the mean squared error is below ^{10^-4} with only 3000 samples needed for polarization-division-multiplexed (PDM) quadrature phase-shift keying (QPSK) or quadrature amplitude modulation (QAM) systems with a roll-off factor below 0.1 for an optical signal-to-noise ratio greater than 12 dB. Compared with the maximum likelihood estimation (MLE) method, our proposed method has a more robust performance under low roll-off factor signals and in low-sampling-rate scenarios. The mean squared error remains the same for a nominal symbol rate (i.e., the ratio of the symbol rate to the sampling rate, also widely known as oversampling rate) ranging from 0.1 to 0.9.

Symbol rate and chromatic dispersion (CD) are very important for optical performance monitoring. The CD, however, hinders the symbol rate detection. In this paper, we proposed a joint estimation of symbol rate and chromatic dispersion. We show that, when the signal conjugates and multiplies with the delayed replica, the spectral line can be restored. The proposed method provides a fast and simple solution for joint estimation as traditional tentative CD scanning is time consuming. The simulation shows that the root-mean-squared error (RMSE) for CD was 39.5 ps/nm and the symbol rate was 2.4 MHz. For the squared-root-raised-cosine (SRRC) pulse shape with a roll-off factor of 0.1, the experimental results show that 25,000 input samples were needed for an error-free estimation. The RMSE is 105.6 ps/nm and 63.5 kHz for CD and symbol rate, respectively.