Shancheng Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shancheng Zhao has a total of 83 co-authors. Here are the top co-authors by number of shared publications:
- Jinming Wen
Jilin University
7 shared publications - Xiao Ma
Sun Yat-sen University
7 shared publications - Xinwei Zhao
College of Information Science and Technology, Jinan University, Guangzhou, China
5 shared publications - Xiujie Huang
College of Information Science and Technology, Jinan University, Guangzhou 510632, China
4 shared publications - Zhetao Li
Jinan University
4 shared publications - Dongming Pi
National and Local Joint Research Center of Network Security Detection and Protection Technology, College of Information Science and Technology, Jinan University, Guangzhou, China
3 shared publications
Latest Publications
- Open Access
A Reduced-Complexity Iterative Bounded Distance Decoder with Random Flipping for Product Codes
Product codes (PCs) are widely used in high-speed communication systems due to their attractive trade-off between error-correction performance and complexity. To further meet the rapidly growing demand for higher data rates, soft-aided hard-decision decoders (SA-HDDs) have been developed. In this paper, we present a reduced-complexity iterative bounded distance decoder with random flipping (RC-iBDD-RF) for PCs, an SA-HDD that improves the decoding performance while preserving low decoding complexity. RC-iBDD-RF introduces an enhanced reliability metric that incorporates channel log-likelihood ratios (LLRs) and memory from previous iterations to guide random flipping. In addition, an error-and-erasure decoding (EaED) module employing fixed filling patterns, rather than randomly generated ones, is used for post-processing to further reduce the residual error rate. The comparisons for BCH-based PCs show that RC-iBDD-RF achieves both performance gain and complexity reduction with only a slight increase in memory requirement. Moreover, the proposed complexity-storage weighted SNR metric confirms its superior complexity-performance trade-off over iBDD-RF.
Open AccessA Reduced-Complexity Iterative Bounded Distance Decoder with Random Flipping for Product Codes
Product codes (PCs) are widely used in high-speed communication systems due to their attractive trade-off between error-correction performance and complexity. To further meet the rapidly growing demand for higher data rates, soft-aided hard-decision decoders (SA-HDDs) have been developed. In this paper, we present a reduced-complexity iterative bounded distance decoder with random flipping (RC-iBDD-RF) for PCs, an SA-HDD that improves the decoding performance while preserving low decoding complexity. RC-iBDD-RF introduces an enhanced reliability metric that incorporates channel log-likelihood ratios (LLRs) and memory from previous iterations to guide random flipping. In addition, an error-and-erasure decoding (EaED) module employing fixed filling patterns, rather than randomly generated ones, is used for post-processing to further reduce the residual error rate. The comparisons for BCH-based PCs show that RC-iBDD-RF achieves both performance gain and complexity reduction with only a slight increase in memory requirement. Moreover, the proposed complexity-storage weighted SNR metric confirms its superior complexity-performance trade-off over iBDD-RF.
- 13 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 9246-9260
Soft-Aided Hard-Decision Decoding and Efficient Stall Pattern Search for Higher-Order Staircase Codes
Higher-order staircase codes form a class of generalized staircase codes in which each bit is protected by more than two component codes. Among them, the extended-Hamming-based higher-order staircase codes are promising candidates for applications that require high coding rate, low error floor, and low decoding complexity. Despite their potential, their performance is still limited by conventional decoding methods, and the structural properties of their minimum stall patterns are not fully understood. To address these issues, we first introduce a novel soft-aided bounded distance decoder (SA-BDD) based on constrained bit flipping (CBF), denoted as SA-BDD-CBF, which demonstrates an effective performance–complexity–latency tradeoff of the extended-Hamming-based higher-order staircase codes. With appropriate parameter, the complexity of SA-BDDCBF is at most 3.4 times that of BDD. This is significantly lower than those of the multiply-chained zipper code and the traditional staircase code, which require approximately 31 and 39 times the complexity of BDD, respectively. Meanwhile, its performance gaps to the comparable multiply-chained zipper code and the traditional staircase code is only 0.10–0.15 dB, demonstrating an effective trade-off between decoding complexity and performance. We then establish several properties of the stall patterns and leverage these properties to develop efficient algorithms to search for both intra- and inter-block stall patterns. These algorithms provide exact values or upper bounds on the minimum sizes of the stall patterns. Extensive simulation results confirm the advantages of the proposed SA-BDD-CBF. In particular, it achieves a gain of 0.4 dB, while the associated increase in complexity remains acceptable for practical deployment. Moreover, the searching algorithms determine the exact minimum sizes of the stall patterns for block sizes up to 10 and obtain upper bounds for block sizes larger than 10. These findings advance the practical deployment of higher-order staircase codes in future high-throughput communication systems.
- 13 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 9246-9260
Soft-Aided Hard-Decision Decoding and Efficient Stall Pattern Search for Higher-Order Staircase Codes
Higher-order staircase codes form a class of generalized staircase codes in which each bit is protected by more than two component codes. Among them, the extended-Hamming-based higher-order staircase codes are promising candidates for applications that require high coding rate, low error floor, and low decoding complexity. Despite their potential, their performance is still limited by conventional decoding methods, and the structural properties of their minimum stall patterns are not fully understood. To address these issues, we first introduce a novel soft-aided bounded distance decoder (SA-BDD) based on constrained bit flipping (CBF), denoted as SA-BDD-CBF, which demonstrates an effective performance–complexity–latency tradeoff of the extended-Hamming-based higher-order staircase codes. With appropriate parameter, the complexity of SA-BDDCBF is at most 3.4 times that of BDD. This is significantly lower than those of the multiply-chained zipper code and the traditional staircase code, which require approximately 31 and 39 times the complexity of BDD, respectively. Meanwhile, its performance gaps to the comparable multiply-chained zipper code and the traditional staircase code is only 0.10–0.15 dB, demonstrating an effective trade-off between decoding complexity and performance. We then establish several properties of the stall patterns and leverage these properties to develop efficient algorithms to search for both intra- and inter-block stall patterns. These algorithms provide exact values or upper bounds on the minimum sizes of the stall patterns. Extensive simulation results confirm the advantages of the proposed SA-BDD-CBF. In particular, it achieves a gain of 0.4 dB, while the associated increase in complexity remains acceptable for practical deployment. Moreover, the searching algorithms determine the exact minimum sizes of the stall patterns for block sizes up to 10 and obtain upper bounds for block sizes larger than 10. These findings advance the practical deployment of higher-order staircase codes in future high-throughput communication systems.
- 30 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 8267-8282
Spatially Coupled Convolutional Codes via Block-Oriented Accumulation: Analysis and Quantized Decoding
Construction of high-performance spatially coupled codes has received considerable attention recently. This paper presents a new construction of spatially coupled convolutional codes (SC-CC), in which the codewords of the underlying convolutional codes are coupled together with the block-oriented accumulator (BA). The resulting codes are referred to as the BA-based SC-CCs (BA-SC-CCs). First, we employ the extrinsic information transfer (EXIT) chart analysis to study the iterative decoding thresholds of BA-SC-CCs. Our analysis indicates that, with appropriate component convolutional codes, the iterative decoding thresholds of BA-SC-CCs can be within 0.1 dB of the channel capacities. Second, we prove that the free distance of a BA-SC-CC is greater than that of the underlying convolutional code. Third, we present a method to analyze the decoding error propagation phenomenon of BA-SC-CCs. To enhance the decoding performance, we finally introduce a quantized threshold-based Max-Log-MAP (T-Max-Log-MAP) decoder for CCs, which can be incorporated into the decoder of BA-SC-CCs. Extensive numerical results demonstrate the advantages of the proposed codes and the new quantized decoder. Specifically, terminated BA-SC-CCs perform comparably to the braided convolutional codes (BCC) and outperform regular spatially coupled low-density parity-check (SC-LDPC) codes and spatially coupled repeater-convolutional-combiner (SC-RCC) codes. Furthermore, the proposed quantized decoder performs better than the conventional quantized decoder.
- 30 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 8267-8282
Spatially Coupled Convolutional Codes via Block-Oriented Accumulation: Analysis and Quantized Decoding
Construction of high-performance spatially coupled codes has received considerable attention recently. This paper presents a new construction of spatially coupled convolutional codes (SC-CC), in which the codewords of the underlying convolutional codes are coupled together with the block-oriented accumulator (BA). The resulting codes are referred to as the BA-based SC-CCs (BA-SC-CCs). First, we employ the extrinsic information transfer (EXIT) chart analysis to study the iterative decoding thresholds of BA-SC-CCs. Our analysis indicates that, with appropriate component convolutional codes, the iterative decoding thresholds of BA-SC-CCs can be within 0.1 dB of the channel capacities. Second, we prove that the free distance of a BA-SC-CC is greater than that of the underlying convolutional code. Third, we present a method to analyze the decoding error propagation phenomenon of BA-SC-CCs. To enhance the decoding performance, we finally introduce a quantized threshold-based Max-Log-MAP (T-Max-Log-MAP) decoder for CCs, which can be incorporated into the decoder of BA-SC-CCs. Extensive numerical results demonstrate the advantages of the proposed codes and the new quantized decoder. Specifically, terminated BA-SC-CCs perform comparably to the braided convolutional codes (BCC) and outperform regular spatially coupled low-density parity-check (SC-LDPC) codes and spatially coupled repeater-convolutional-combiner (SC-RCC) codes. Furthermore, the proposed quantized decoder performs better than the conventional quantized decoder.
- 4 February 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (2) , 43
On the ability to approximate k-DSP of HKZ, BKZ and Slide reduction
- 4 February 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (2) , 43
On the ability to approximate k-DSP of HKZ, BKZ and Slide reduction
- Open Access
- 6 January 2026
- Published by Elsevier in Journal of Ethnopharmacology
- Vol. 360, 121140
Duhuo Jisheng decoction alleviates knee osteoarthritis via synovial mesenchymal stem cell-derived exosomes mediating the microRNA-194-5p/wnt signaling pathway
- 6 January 2026
- Published by Elsevier in Journal of Ethnopharmacology
- Vol. 360, 121140
Open AccessDuhuo Jisheng decoction alleviates knee osteoarthritis via synovial mesenchymal stem cell-derived exosomes mediating the microRNA-194-5p/wnt signaling pathway
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30, 3408-3412
Soft-Aided Hard-Decision Decoding With Deterministic Constrained Bit Flipping for Higher-Order Staircase Codes
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30, 3408-3412
Soft-Aided Hard-Decision Decoding With Deterministic Constrained Bit Flipping for Higher-Order Staircase Codes
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74, 14028-14038
Multi-Rate CRC-Aided TBCC via Bit Repetition: Construction and Decoding
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74, 14028-14038
Multi-Rate CRC-Aided TBCC via Bit Repetition: Construction and Decoding
- 26 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanobioscience
- Vol. 25 (2) , 259-269
Design and Analysis of Two-Layer Coding Scheme for DNA-Based Data Storage
DNA-based data storage has emerged as a compelling alternative to traditional media due to its ultra-high information density and long-term stability. However, the high read cost caused by the error-prone synthesis, storage, and sequencing processes remains a major bottleneck for practical deployment. To address this challenge, this paper proposes a read-cost-efficient coding framework that enhances reliability without increasing total redundancy. First, a novel two-layer intra-oligo coding scheme based on Bose–Chaudhuri–Hocquenghem (BCH) codes is presented, where index bits and data bits are respectively protected to mitigate base-level errors. Second, a semi-analytical optimization method based on the normal approximation of the finite-length coding rate is developed to allocate redundancy between index and data bits optimally under a fixed total code rate. The inter-oligo protection is further achieved through low-density parity-check (LDPC) codes to combat sequence-level errors.We then present extensive analytical and numerical results to show the effectiveness of the proposed analysis. Finally, we present numerical results to demonstrate that the concatenated code based on the optimized two-layer coding scheme significantly outperforms the concatenated code based on the single-layer coding scheme in terms of frame error rate (FER) under the same sequencing depth and total redundancy. These results underscore the advantages of the two-layer coding scheme and the optimization method for DNA-based data storage systems.
- 26 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanobioscience
- Vol. 25 (2) , 259-269
Design and Analysis of Two-Layer Coding Scheme for DNA-Based Data Storage
DNA-based data storage has emerged as a compelling alternative to traditional media due to its ultra-high information density and long-term stability. However, the high read cost caused by the error-prone synthesis, storage, and sequencing processes remains a major bottleneck for practical deployment. To address this challenge, this paper proposes a read-cost-efficient coding framework that enhances reliability without increasing total redundancy. First, a novel two-layer intra-oligo coding scheme based on Bose–Chaudhuri–Hocquenghem (BCH) codes is presented, where index bits and data bits are respectively protected to mitigate base-level errors. Second, a semi-analytical optimization method based on the normal approximation of the finite-length coding rate is developed to allocate redundancy between index and data bits optimally under a fixed total code rate. The inter-oligo protection is further achieved through low-density parity-check (LDPC) codes to combat sequence-level errors.We then present extensive analytical and numerical results to show the effectiveness of the proposed analysis. Finally, we present numerical results to demonstrate that the concatenated code based on the optimized two-layer coding scheme significantly outperforms the concatenated code based on the single-layer coding scheme in terms of frame error rate (FER) under the same sequencing depth and total redundancy. These results underscore the advantages of the two-layer coding scheme and the optimization method for DNA-based data storage systems.
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Broadcasting
- Vol. 72 (1) , 373-381
A Low-Complexity Serial List Viterbi Decoder of CRC-Aided TBCC for Broadcasting Services in 6G
In 6G broadcasting, there is an urgent need of a high-performance short-length channel code for hyper-reliable and low-latency communications (HRLLC). Among the available options, cyclic redundancy check-aided tail-biting convolutional code (CRC-TBCC) is recognized as a competitive candidate. To further enhance the competitiveness of CRC-TBCCs, this paper aims to design low-complexity serial list Viterbi decoders (SLVDs) for them. In the proposed decoder, we first apply regular sectionalization on the original trellis to obtain the sectionalized trellis (ST) and then remove all edges whose log-likelihood ratios (LLRs) are below a given threshold to obtain the edge-reduced ST (E-ST). The resulting decoder is termed E-ST-SLVD. We show that there exists an efficient method to determine the desired threshold for ST. We then analyze the decoding complexity the proposed decoder and the interrelationships among key parameters influencing decoding complexity. We finally present extensive numerical results to show that, with appropriate sectionalization length and threshold, the E-ST-SLVD admits a lower complexity than the original SLVD. Meanwhile, we have compared the decoding complexities of several competitive short-length codes for broadcasting to show the advantage of the proposed decoder. These result makes CRC-TBCC an attractive candidate for integrated broadcasting and mobile services in 6G.
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Broadcasting
- Vol. 72 (1) , 373-381
A Low-Complexity Serial List Viterbi Decoder of CRC-Aided TBCC for Broadcasting Services in 6G
In 6G broadcasting, there is an urgent need of a high-performance short-length channel code for hyper-reliable and low-latency communications (HRLLC). Among the available options, cyclic redundancy check-aided tail-biting convolutional code (CRC-TBCC) is recognized as a competitive candidate. To further enhance the competitiveness of CRC-TBCCs, this paper aims to design low-complexity serial list Viterbi decoders (SLVDs) for them. In the proposed decoder, we first apply regular sectionalization on the original trellis to obtain the sectionalized trellis (ST) and then remove all edges whose log-likelihood ratios (LLRs) are below a given threshold to obtain the edge-reduced ST (E-ST). The resulting decoder is termed E-ST-SLVD. We show that there exists an efficient method to determine the desired threshold for ST. We then analyze the decoding complexity the proposed decoder and the interrelationships among key parameters influencing decoding complexity. We finally present extensive numerical results to show that, with appropriate sectionalization length and threshold, the E-ST-SLVD admits a lower complexity than the original SLVD. Meanwhile, we have compared the decoding complexities of several competitive short-length codes for broadcasting to show the advantage of the proposed decoder. These result makes CRC-TBCC an attractive candidate for integrated broadcasting and mobile services in 6G.