Youqiang Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Youqiang Hu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Francis Chung Ming Lau
The Hong Kong Polytechnic University
3 shared publications - Yi Chai
Chongqing University
3 shared publications - Yong Li
College of Computer Science, Chongqing University, Chongqing, China
3 shared publications - Lei Huang
School of Computer Science and Technology, Huaiyin Normal University, Huai’an 223300, China
2 shared publications - Rui Liu
College of Computer Science, Chongqing University, Chongqing, China
2 shared publications - Shuiqing Xu
Hefei University of Technology
2 shared publications
Latest Publications
- 14 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72 (10) , 6001-6013
Error-Correcting Codes With Large Field Size Under Non-Binary Segmented Burst Deletion/Insertion Channels and Unknown Codeword Boundaries
In this paper, we construct non-binary codes of length N which correct errors under a non-binary segment- N maxburst- D deletion and maxburst- S insertion (NB-SBDI( N, D, S )) channel without knowing the codeword boundaries. In this NB-SBDI( N, D, S ) channel, at most a single non-binary burst (a block of consecutive bits/symbols) of deletions or insertions of length up to D or S , respectively, exists in a block of N consecutive non-binary symbols. One code named as BM-DB-MDS consists of a maximum distance separable (MDS) code, a block of periodic de Bruijn (DB) symbols, and a block of proposed periodic binary marker (BM) patterns with a period of S + D + 2. The other code called BM-MDS code consists of a BM code and an MDS code. We show that the rates of BM-DB-MDS and BM-MDS codes achieve λ/λ+1 (1 - 1/2 t ), λ ∈ N + and 1 - 1/ t , respectively, when N → +∞, where λ represent the MDS code shortening factor, and 1/ t is the rough proportion of the maximum length of burst deletions or insertions allowed in a code.
- 14 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72 (10) , 6001-6013
Error-Correcting Codes With Large Field Size Under Non-Binary Segmented Burst Deletion/Insertion Channels and Unknown Codeword Boundaries
In this paper, we construct non-binary codes of length N which correct errors under a non-binary segment- N maxburst- D deletion and maxburst- S insertion (NB-SBDI( N, D, S )) channel without knowing the codeword boundaries. In this NB-SBDI( N, D, S ) channel, at most a single non-binary burst (a block of consecutive bits/symbols) of deletions or insertions of length up to D or S , respectively, exists in a block of N consecutive non-binary symbols. One code named as BM-DB-MDS consists of a maximum distance separable (MDS) code, a block of periodic de Bruijn (DB) symbols, and a block of proposed periodic binary marker (BM) patterns with a period of S + D + 2. The other code called BM-MDS code consists of a BM code and an MDS code. We show that the rates of BM-DB-MDS and BM-MDS codes achieve λ/λ+1 (1 - 1/2 t ), λ ∈ N + and 1 - 1/ t , respectively, when N → +∞, where λ represent the MDS code shortening factor, and 1/ t is the rough proportion of the maximum length of burst deletions or insertions allowed in a code.
- Open Access
- 1 February 2024
- Published by KEAI Publishing in Digital Communications and Networks
- Vol. 10 (1) , 217-226
Doped low-density parity-check codes
- 1 February 2024
- Published by KEAI Publishing in Digital Communications and Networks
- Vol. 10 (1) , 217-226
Open AccessDoped low-density parity-check codes
- Open Access
- 30 August 2022
- Published by MDPI AG in Electronics
- Vol. 11 (17) , 2717
Decoding Quadratic Residue Codes Using Deep Neural Networks
In this paper, a low-complexity decoder based on a neural network is proposed to decode binary quadratic residue (QR) codes. The proposed decoder is based on the neural min-sum algorithm and the modified random redundant decoder (mRRD) algorithm. This new method has the same asymptotic time complexity as the min-sum algorithm, which is much lower than the difference on syndromes (DS) algorithm. Simulation results show that the proposed algorithm achieves a gain of more than 0.4 dB when compared to the DS algorithm. Furthermore, a simplified approach based on trapping sets is applied to reduce the complexity of the mRRD. This simplification leads to a slight loss in error performance and a reduction in implementation complexity.
- 30 August 2022
- Published by MDPI AG in Electronics
- Vol. 11 (17) , 2717
Open AccessDecoding Quadratic Residue Codes Using Deep Neural Networks
In this paper, a low-complexity decoder based on a neural network is proposed to decode binary quadratic residue (QR) codes. The proposed decoder is based on the neural min-sum algorithm and the modified random redundant decoder (mRRD) algorithm. This new method has the same asymptotic time complexity as the min-sum algorithm, which is much lower than the difference on syndromes (DS) algorithm. Simulation results show that the proposed algorithm achieves a gain of more than 0.4 dB when compared to the DS algorithm. Furthermore, a simplified approach based on trapping sets is applied to reduce the complexity of the mRRD. This simplification leads to a slight loss in error performance and a reduction in implementation complexity.
- 7 March 2018
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 37 (10) , 4584-4598
Uncertainty Inequalities for the Linear Canonical Hilbert Transform
- 7 March 2018
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 37 (10) , 4584-4598
Uncertainty Inequalities for the Linear Canonical Hilbert Transform
- Open Access
- 13 October 2016
- Published by Springer Nature in SpringerPlus
- Vol. 5 (1) , 1-12
The analysis of decimation and interpolation in the linear canonical transform domain
Decimation and interpolation are the two basic building blocks in the multirate digital signal processing systems. As the linear canonical transform (LCT) has been shown to be a powerful tool for optics and signal processing, it is worthwhile and interesting to analyze the decimation and interpolation in the LCT domain. In this paper, the definition of equivalent filter in the LCT domain have been given at first. Then, by applying the definition, the direct implementation structure and polyphase networks for decimator and interpolator in the LCT domain have been proposed. Finally, the perfect reconstruction expressions for differential filters in the LCT domain have been presented as an application. The proposed theorems in this study are the bases for generalizations of the multirate signal processing in the LCT domain, which can advance the filter banks theorems in the LCT domain.
- 13 October 2016
- Published by Springer Nature in SpringerPlus
- Vol. 5 (1) , 1-12
Open AccessThe analysis of decimation and interpolation in the linear canonical transform domain
Decimation and interpolation are the two basic building blocks in the multirate digital signal processing systems. As the linear canonical transform (LCT) has been shown to be a powerful tool for optics and signal processing, it is worthwhile and interesting to analyze the decimation and interpolation in the LCT domain. In this paper, the definition of equivalent filter in the LCT domain have been given at first. Then, by applying the definition, the direct implementation structure and polyphase networks for decimator and interpolator in the LCT domain have been proposed. Finally, the perfect reconstruction expressions for differential filters in the LCT domain have been presented as an application. The proposed theorems in this study are the bases for generalizations of the multirate signal processing in the LCT domain, which can advance the filter banks theorems in the LCT domain.
- 16 April 2015
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 34 (12) , 3979-3997
Spectral Analysis of Sampled Band-Limited Signals in the Offset Linear Canonical Transform Domain
- 16 April 2015
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 34 (12) , 3979-3997
Spectral Analysis of Sampled Band-Limited Signals in the Offset Linear Canonical Transform Domain