YDYong Ding

Yong Ding

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yong Ding has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Flight Control of a Novel Distributed Tiltrotor UAV With Experiments

    by Li Yu, Yong Ding, Peng Wang, Jialong Zhang, Lei Ye

    Tiltrotor UAV is a hybrid aircraft that enjoys the advantages of both the conventional fixed‐wing and helicopter in a single platform. The design of a practical and efficient flight control system for this novel aircraft with a complex configuration is still a challenge. This paper proposes a practical fixed‐time control scheme for a novel distributed tiltrotor UAV to improve flight stability. Based on the analysis of the control principle, the dynamic model and control allocation are derived to address the coordinated control problems with redundant actuators. A fast fixed‐time sliding mode attitude controller is subsequently designed to improve the response speed and robustness of the control system. Furthermore, a smooth mode transition strategy is developed to guarantee the stable conversion between fixed‐wing and helicopter modes. Experiments are conducted under different modes to investigate the effectiveness of the proposed flight control scheme.


  • Open Access

    Blind Identification of Self‐Synchronous Scramblers for Reed–Solomon Codes in Non‐Cooperative Communications Using Soft‐Decision Information

    by Yong Ding, Lei Ye, Kun Han, Peng Wang, Li Yu, Jialong Zhang

    Blind identification of channel coding parameters is of paramount importance in non‐cooperative communication scenarios, where the receiver lacks prior knowledge of the transmitter's coding scheme. This paper specifically addresses the challenging problem of blindly identifying the feedback polynomial of a self‐synchronous scrambler applied to a Reed–Solomon (RS) code, a scenario commonly encountered in various communication standards. Existing methods, which primarily rely on matrix rank analysis, exhibit poor fault tolerance in the presence of channel noise and suffer from high computational complexity. To overcome these limitations, we propose a novel and improved fault‐tolerant identification method that leverages soft‐decision information. Firstly, we provide a rigorous theoretical proof establishing that if the reciprocal polynomial of a binary dual‐vector polynomial of the RS code is multiplied by the scrambler's feedback polynomial, the vector corresponding to the reciprocal of this product satisfies a parity‐check relationship with the rows of the scrambled sequence matrix. Building upon this foundational relationship, we construct an average parity check confidence metric from the received soft‐decision sequence. We then derive the exact theoretical statistical distribution of this metric under two distinct hypotheses: the presence of the correct scrambler and the absence thereof. Utilizing the minimum error probability criterion, we analytically derive the optimal detection threshold, thereby enabling high‐reliability identification of the scrambler's feedback polynomial. To validate the effectiveness and robustness of the proposed method, comprehensive simulations are conducted using a variety of RS codes, in conjunction with scramblers of different orders. The simulation results demonstrate that the proposed method achieves a significant performance gain of approximately 4 dB in fault tolerance compared to existing state‐of‐the‐art rank‐based methods. Moreover, the proposed algorithm eliminates the need for exhaustive descrambling trials, resulting in substantially lower computational complexity. The method also exhibits considerable robustness to inaccuracies in noise variance estimation and provides a flexible trade‐off between the required sequence length and the desired level of identification reliability. This work makes significant contributions to the field of non‐cooperative communication by providing a practical and efficient solution for blind scrambler identification in RS‐coded systems.

  • Open Access

    Joint Blind Identification of Cyclic Codes and Synchronization Scramblers From Synchronous Scrambling Sequences of Cyclic Codes Based on Soft Decision Information

    by Yong Ding, Lei Ye, Kun Han, Peng Wang, Li Yu, Jialong Zhan

    Reverse engineering intercepted signals to reconstruct the communication scheme employed by the transmitter is a critical challenge in non‐cooperative communications. This paper addresses the unsolved challenge of blindly identifying both the cyclic code and the synchronous scrambler from an unknown cyclic code's synchronous scrambling sequence. To tackle this problem, we propose a joint blind identification method based on soft decision information. First, by analyzing the characteristics of the cyclic code's synchronous scrambling sequence, we derive the parity‐check relationship and discover that detecting this relationship enables joint blind identification. Based on soft decision information, we introduce the average parity check conformity (APCC) as a metric for the probability of this parity check relationship holding in noisy environments and derive its approximate theoretical distribution. Finally, an optimal detection threshold is obtained using the minimum error probability criterion. This method also adaptively adjusts the received sequence length to achieve identification with arbitrary reliability. Experimental results demonstrate that the proposed soft decision‐based method achieves joint blind identification under noisy conditions. Crucially, our method not only exhibits approximately 2 dB higher fault tolerance than existing methods but also operates without requiring known parameters of the cyclic code.

  • Open Access

    Joint blind reconstruction of cyclic codes and self‐synchronous scramblers

    by Yong Ding, Zhiping Huang, Jing Zhou

    The inverse analysis of the intercepted signals to reconstruct the communication scheme used by the transmitter is a key problem in the non‐cooperative context. In this paper, the problem of blind reconstruction of cyclic codes and self‐synchronous scramblers is considered. There is no existing solution to this problem. To solve this problem, a joint blind reconstruction method for cyclic codes and self‐synchronous scramblers is proposed in this paper. A lemma is proposed and proved theoretically that the maximum common factor of the inverse polynomial of the polynomial form of the dual vectors of the self‐synchronous scrambled bit matrix is the product of the parity polynomial of the cyclic code and the feedback polynomial of the self‐synchronous scrambler. Using this lemma, the joint blind reconstruction of the cyclic code and the self‐synchronous scrambler is completed. Finally, a Gaussian elimination based on random column exchange and soft information (GERCESI) method is proposed, which can apply the proposed method to a noisy environment. Simulations prove that the fault‐tolerance performance of the GERCESI method proposed in this paper is at least 0.5 dB higher than that of the GJETP method.


  • Joint Blind Reconstruction of the Cyclic Codes and Self-Synchronous Scramblers in a Noisy Environment

    by Yong Ding, Zhiping Huang, Jing Zhou

    Reverse analysis of the intercepted signal to reconstruct the communication scheme used by the transmitter is a key problem in the non-cooperative context. In this paper, we propose a new algorithm for the joint blind reconstruction of the cyclic codes and self-synchronous scramblers directly using soft-decision sequences. First, we derive the conclusion that if the parity polynomial of the factor of the generator polynomial of the cyclic code and the feedback polynomial of the self-synchronous scrambler are multiplied, then the vector corresponding to the inverse polynomial of this product forms a parity-check relation with the row vector of the self-synchronously scrambled cyclic code bit matrix, which is constructed by the sequence of self-synchronously scrambled cyclic codes. To detect this parity-check relation, the concept of average parity-check probability (APCP) is defined, which uses the intercepted soft-decision sequence to measure the reliability of the parity-check relation. An optimal threshold based on the minimum error criterion is then derived. When the APCP is greater than this optimal threshold, the parity-check relation is considered to be detected, i.e., the corresponding irreducible polynomial is a factor of the generator polynomial of the cyclic code and the corresponding candidate feedback polynomial is the feedback polynomial of the self-synchronous scrambler. Therefore, the blind reconstruction problem in this paper is exactly equivalent to the hypothesis-testing problem. Simulation results show that the algorithm is more fault-tolerant than existing algorithms in noisy environments.


  • Open Access

    Blind recognition of sparse parity‐check matrices of low‐density parity‐check codes in the presence of noise

    by Yong Ding, Zhiping Huang, Jing Zhou

    This paper studies the blind recognition method of the sparse parity‐check matrices of low‐density parity‐check codes in noncooperative communication, which is critical to the reverse analysis of communication protocols using LDPC codes. In this paper, two improvements are made to the algorithm of Liu Qian et al. (2021) for this problem. Firstly, a Gaussian elimination method based on random column exchange and soft information is proposed to enhance the fault tolerance of the elimination process. Secondly, according to the sparse property of the parity‐check matrices of LDPC codes, a random extraction method is proposed to further improve the fault tolerance of the algorithm, and it is verified theoretically. Finally, simulations verify the superior performance of the algorithm proposed in this paper.


  • Open Access

    Blind identification of feedback polynomials for synchronous scramblers in a noisy environment

    by Yong Ding, Zhiping Huang, Jing Zhou

    This paper investigates blind identification methods for linear scramblers under non‐cooperative conditions, which are essential for the inverse analysis of communication protocols using scramblers. In this paper, a blind identification scheme for feedback polynomials of synchronous scramblers is proposed. A variable is first proposed that measures the correctness of the test polynomial by using the soft information of the received sequence, then the mean and variance of the variable in different cases are obtained, and finally the optimal threshold value to determine whether the test primitive polynomial is correct or not is obtained. That is, the blind identification problem is transformed into a hypothesis testing problem. The simulations verify that the proposed scheme requires a much smaller scrambled sequence length than existing blind identification schemes. Furthermore, the proposed scheme is more fault tolerant than existing schemes and has a signal‐to‐noise ratio (SNR) gain of at least 3 dB when the intercepted scrambled sequences are of the same length and high identification accuracy is achieved.


  • Open Access

    Fast reconstruction of feedback polynomials for synchronous scramblers in a noisy environment

    by Yong Ding, Zhiping Huang, Jing Zhou

    As one of the key technologies of modern communication, a linear scrambler is a technique to randomize the data to be transmitted at the bit layer to improve the timing recovery and confidentiality of the transmitted data. Therefore, the reconstruction of scramblers under non‐cooperative communication conditions has attracted extensive research interest. Existing efficient reconstruction methods are implemented by traversing the primitive polynomial of all orders, leading to extremely high computational complexity. Here, a fast reconstruction method for feedback polynomials of synchronous scramblers is proposed. The order of the feedback polynomial is first estimated by a hypothesis testing method, and then the primitive polynomial of the corresponding order is traversed to reduce the traversal range of the primitive polynomial, which greatly reduces the computational complexity of the reconstruction method. The simulation results verify the performance of the scheme.


  • Open Access

    An Improved Blind Recognition Method for Synchronization Position and Coding Parameters of k/n Rate Convolutional Codes in a Noisy Environment

    by Yong Ding, Zhiping Huang, Jing Zhou

    In digital communication systems, error correction codes are used to recover data that has been disturbed in a noisy environment. Convolutional code is a commonly used error correction code. In non-cooperative communication systems, it is very meaningful to blindly identify the synchronization position and coding parameters of convolutional codes. Existing reference had proposed a blind recognition algorithm for coding parameters of $k/n$ rate convolutional codes in a noisy environment, but it didn’t take into account the case where the received code words were not synchronized. In this paper, this problem is improved by using the quasi-correlation between the receive sequence and the check matrix to estimate the synchronization position, while obtaining the check matrix. It implements blind recognition of the synchronization position and coding parameters of $k/n$ rate convolutional codes in a noisy environment. Simulation experimental results show that the improved algorithm in this paper is effective.