Pavel Rybin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Pavel Rybin has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Alexey Frolov
Skolkovo Institute of Science and Technology, Moscow, Russia
16 shared publications - Kirill Andreev
Center for Next Generation Wireless and IoT, Skolkovo Institute of Science and Technology, Moscow, Russia
13 shared publications - Victor Vasil'Evich Zyablov
Russian Academy of Sciences
10 shared publications - Dmitry Artemasov
Center for Next Generation Wireless and IoT, Skolkovo Institute of Science and Technology, Moscow, Russia
3 shared publications - Fedor Ivanov
HSE University, Moscow, Russia
3 shared publications - Dmitry Artemasov
Center for Next Generation Wireless IoT Skolkovo Institute of Science and Technology Moscow Russia
2 shared publications
Latest Publications
- 1 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30 (10897798) , 482-486
Iterative Neural Rollback Chase–Pyndiah Decoding
The letter deals with iterative decoding of turbo product codes (TPC). We propose a transformer neural network (NN)-assisted rollback scheme, in which the NN identifies and suppresses extrinsic updates that are likely to introduce decoding errors. Experiments with turbo product code based on (256, 239) extended BCH codes demonstrate that the proposed method improves the bit error rate of Chase-Pyndiah (CP) decoding with $\boldsymbol {p = 6}$ by approximately $\boldsymbol {0.145}$ dB, significantly outperforming conventional CP decoding with $\boldsymbol {p = 7}$ , without modifying the CP decoding pipeline, thereby simplifying integration into existing systems.
- 1 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30 (10897798) , 482-486
Iterative Neural Rollback Chase–Pyndiah Decoding
The letter deals with iterative decoding of turbo product codes (TPC). We propose a transformer neural network (NN)-assisted rollback scheme, in which the NN identifies and suppresses extrinsic updates that are likely to introduce decoding errors. Experiments with turbo product code based on (256, 239) extended BCH codes demonstrate that the proposed method improves the bit error rate of Chase-Pyndiah (CP) decoding with $\boldsymbol {p = 6}$ by approximately $\boldsymbol {0.145}$ dB, significantly outperforming conventional CP decoding with $\boldsymbol {p = 7}$ , without modifying the CP decoding pipeline, thereby simplifying integration into existing systems.
- Open Access
Unsourced Random Access
Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transfers and video streaming. However, these networks are increasingly inadequate for the emerging era of machine-type communications (MTC). With a vast number of devices exhibiting sporadic traffic patterns consisting of short packets, the grant-based multiple access procedures utilized by existing networks lead to significant delays and inefficiencies. To address this issue the unsourced random access (URA) paradigm has been proposed. This paradigm assumes the devices to share a common encoder thus simplifying the reception process by eliminating the identification procedure. The URA paradigm not only addresses the computational challenges but it also considers the random access (RA) as a coding problem, i.e., takes into account both medium access protocols and physical layer effects. In this monograph we provide a comprehensive overview of the URA problem in noisy channels, with the main task being to explain the major ideas rather than to list all existing solutions.
Open AccessUnsourced Random Access
Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transfers and video streaming. However, these networks are increasingly inadequate for the emerging era of machine-type communications (MTC). With a vast number of devices exhibiting sporadic traffic patterns consisting of short packets, the grant-based multiple access procedures utilized by existing networks lead to significant delays and inefficiencies. To address this issue the unsourced random access (URA) paradigm has been proposed. This paradigm assumes the devices to share a common encoder thus simplifying the reception process by eliminating the identification procedure. The URA paradigm not only addresses the computational challenges but it also considers the random access (RA) as a coding problem, i.e., takes into account both medium access protocols and physical layer effects. In this monograph we provide a comprehensive overview of the URA problem in noisy channels, with the main task being to explain the major ideas rather than to list all existing solutions.
- 20 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (11) , 3700-3704
Generalized LDPC Codes With Low-Complexity Decoding and Fast Convergence
We consider generalized low-density parity-check (GLDPC) codes with component codes that are duals of Cordaro–Wagner codes. Two efficient decoding algorithms are proposed: one based on Hartmann–Rudolph processing, analogous to Sum-Product decoding, and another based on evaluating two hypotheses per bit, referred to as the Min-Sum decoder. Both algorithms are derived using latent variables and a appropriate message-passing schedule. A quantized, protograph-based density evolution procedure is used to optimize GLDPC codes for Min-Sum decoding. Compared to 5G LDPC codes, the proposed GLDPC codes offer similar performance at 50 iterations and significantly better convergence and performance at 10 iterations.
- 20 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (11) , 3700-3704
Generalized LDPC Codes With Low-Complexity Decoding and Fast Convergence
We consider generalized low-density parity-check (GLDPC) codes with component codes that are duals of Cordaro–Wagner codes. Two efficient decoding algorithms are proposed: one based on Hartmann–Rudolph processing, analogous to Sum-Product decoding, and another based on evaluating two hypotheses per bit, referred to as the Min-Sum decoder. Both algorithms are derived using latent variables and a appropriate message-passing schedule. A quantized, protograph-based density evolution procedure is used to optimize GLDPC codes for Min-Sum decoding. Compared to 5G LDPC codes, the proposed GLDPC codes offer similar performance at 50 iterations and significantly better convergence and performance at 10 iterations.
- Open Access
- 31 July 2025
- Published by Emerald Publishing in Foundations and Trends® in Communications and Information Theory
- Vol. 22 (5-6) , 605-842
Unsourced Random Access
Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transfers and video streaming. However, these networks are increasingly inadequate for the emerging era of machine-type communications (MTC). With a vast number of devices exhibiting sporadic traffic patterns consisting of short packets, the grant-based multiple access procedures utilized by existing networks lead to significant delays and inefficiencies. To address this issue the unsourced random access (URA) paradigm has been proposed. This paradigm assumes the devices to share a common encoder thus simplifying the reception process by eliminating the identification procedure. The URA paradigm not only addresses the computational challenges but it also considers the random access (RA) as a coding problem, i.e., takes into account both medium access protocols and physical layer effects. In this monograph we provide a comprehensive overview of the URA problem in noisy channels, with the main task being to explain the major ideas rather than to list all existing solutions.
- 31 July 2025
- Published by Emerald Publishing in Foundations and Trends® in Communications and Information Theory
- Vol. 22 (5-6) , 605-842
Open AccessUnsourced Random Access
Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transfers and video streaming. However, these networks are increasingly inadequate for the emerging era of machine-type communications (MTC). With a vast number of devices exhibiting sporadic traffic patterns consisting of short packets, the grant-based multiple access procedures utilized by existing networks lead to significant delays and inefficiencies. To address this issue the unsourced random access (URA) paradigm has been proposed. This paradigm assumes the devices to share a common encoder thus simplifying the reception process by eliminating the identification procedure. The URA paradigm not only addresses the computational challenges but it also considers the random access (RA) as a coding problem, i.e., takes into account both medium access protocols and physical layer effects. In this monograph we provide a comprehensive overview of the URA problem in noisy channels, with the main task being to explain the major ideas rather than to list all existing solutions.
- Open Access
Iterative Neural Rollback Chase-Pyndiah Decoding
Iterative decoding is essential in modern communication systems, especially optical communications, where error-correcting codes such as turbo product codes (TPC) and staircase codes are widely employed. A key factor in achieving high error correction performance is the use of soft-decision decoding for component codes. However, implementing optimal maximum a posteriori (MAP) probability decoding for commonly used component codes, such as BCH and Polar codes, is computationally prohibitive. Instead, practical systems rely on approximations, with the Chase-Pyndiah algorithm being a widely used suboptimal method. TPC are more powerful than their component codes and begin to function effectively at low signal-to-noise ratios. Consequently, during the initial iterations, the component codes do not perform well and introduce errors in the extrinsic information updates. This phenomenon limits the performance of TPC. This paper proposes a neural network-aided rollback Chase-Pyndiah decoding method to address this issue. A transformer-based neural network identifies cases where extrinsic updates are likely to introduce errors, triggering a rollback mechanism which prevents the update and keeps the component code message intact. Our results demonstrate that a neural network with a relatively small number of parameters can effectively distinguish destructive updates and improve decoding performance. We evaluate the proposed approach using TPC with (256, 239) extended BCH component codes. We show that the proposed method enhances the bit error rate performance of Chase-Pyndiah p=6 decoding, achieving a gain of approximately 0.145 dB in a TPC scheme with four full iterations, significantly outperforming conventional Chase p=7 decoding.
Open AccessIterative Neural Rollback Chase-Pyndiah Decoding
Iterative decoding is essential in modern communication systems, especially optical communications, where error-correcting codes such as turbo product codes (TPC) and staircase codes are widely employed. A key factor in achieving high error correction performance is the use of soft-decision decoding for component codes. However, implementing optimal maximum a posteriori (MAP) probability decoding for commonly used component codes, such as BCH and Polar codes, is computationally prohibitive. Instead, practical systems rely on approximations, with the Chase-Pyndiah algorithm being a widely used suboptimal method. TPC are more powerful than their component codes and begin to function effectively at low signal-to-noise ratios. Consequently, during the initial iterations, the component codes do not perform well and introduce errors in the extrinsic information updates. This phenomenon limits the performance of TPC. This paper proposes a neural network-aided rollback Chase-Pyndiah decoding method to address this issue. A transformer-based neural network identifies cases where extrinsic updates are likely to introduce errors, triggering a rollback mechanism which prevents the update and keeps the component code message intact. Our results demonstrate that a neural network with a relatively small number of parameters can effectively distinguish destructive updates and improve decoding performance. We evaluate the proposed approach using TPC with (256, 239) extended BCH component codes. We show that the proposed method enhances the bit error rate performance of Chase-Pyndiah p=6 decoding, achieving a gain of approximately 0.145 dB in a TPC scheme with four full iterations, significantly outperforming conventional Chase p=7 decoding.
- Open Access
Generalized LDPC codes with low-complexity decoding and fast convergence
We consider generalized low-density parity-check (GLDPC) codes with component codes that are duals of Cordaro-Wagner codes. Two efficient decoding algorithms are proposed: one based on Hartmann-Rudolph processing, analogous to Sum-Product decoding, and another based on evaluating two hypotheses per bit, referred to as the Min-Sum decoder. Both algorithms are derived using latent variables and an appropriate message-passing schedule. A quantized, protograph-based density evolution procedure is used to optimize GLDPC codes for Min-Sum decoding. Compared to 5G LDPC codes, the proposed GLDPC codes offer similar performance at 50 iterations and significantly better convergence and performance at 10 iterations.
Open AccessGeneralized LDPC codes with low-complexity decoding and fast convergence
We consider generalized low-density parity-check (GLDPC) codes with component codes that are duals of Cordaro-Wagner codes. Two efficient decoding algorithms are proposed: one based on Hartmann-Rudolph processing, analogous to Sum-Product decoding, and another based on evaluating two hypotheses per bit, referred to as the Min-Sum decoder. Both algorithms are derived using latent variables and an appropriate message-passing schedule. A quantized, protograph-based density evolution procedure is used to optimize GLDPC codes for Min-Sum decoding. Compared to 5G LDPC codes, the proposed GLDPC codes offer similar performance at 50 iterations and significantly better convergence and performance at 10 iterations.
- Open Access
- 31 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 629-641
Iterative Syndrome-Based Deep Neural Network Decoding
While the application of deep neural networks (DNNs) for channel decoding is a well-researched topic, most studies focus on hard output decoding, potentially restricting the practical application of such decoders in real communication systems. Modern receivers require iterative decoders, a pivotal criterion for which is the ability to produce soft output. In this paper, we focus on this property. We begin by modifying the syndrome-based DNN-decoding approach proposed by Bennatan et al. (2018). The DNN model is trained to provide soft output and replicate the maximum a posteriori probability decoder. To assess the quality of the proposed decoder’s soft output, we examine the iterative decoding method, specifically the turbo product code (TPC) with extended BCH (eBCH) codes as its component codes. A sequential training procedure for optimizing the behavior of component decoders is utilized. We illustrate that the described approach achieves exceptional performance results and is applicable for iterative codes with larger code lengths n=4096,k=2025, compared to state-of-the-art DNN-based methods. Finally, we address the issues of computational complexity and memory requirements of DNN-based decoding by analyzing the model’s compression limits through pruning and matrix decomposition methods.
- 31 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 629-641
Open AccessIterative Syndrome-Based Deep Neural Network Decoding
While the application of deep neural networks (DNNs) for channel decoding is a well-researched topic, most studies focus on hard output decoding, potentially restricting the practical application of such decoders in real communication systems. Modern receivers require iterative decoders, a pivotal criterion for which is the ability to produce soft output. In this paper, we focus on this property. We begin by modifying the syndrome-based DNN-decoding approach proposed by Bennatan et al. (2018). The DNN model is trained to provide soft output and replicate the maximum a posteriori probability decoder. To assess the quality of the proposed decoder’s soft output, we examine the iterative decoding method, specifically the turbo product code (TPC) with extended BCH (eBCH) codes as its component codes. A sequential training procedure for optimizing the behavior of component decoders is utilized. We illustrate that the described approach achieves exceptional performance results and is applicable for iterative codes with larger code lengths n=4096,k=2025, compared to state-of-the-art DNN-based methods. Finally, we address the issues of computational complexity and memory requirements of DNN-based decoding by analyzing the model’s compression limits through pruning and matrix decomposition methods.
- Open Access
On the Error-Reducing Properties of Superposition Codes
Next-generation wireless communication systems impose much stricter requirements for transmission rate, latency, and reliability. The peak data rate of 6G networks should be no less than 1 Tb/s, which is comparable to existing long-haul optical transport networks. It is believed that using long error-correcting codes (ECC) with soft-decision decoding (SDD) is not feasible in this case due to the resulting high power consumption. On the other hand, ECC with hard-decision decoding (HDD) suffers from significant performance degradation. In this paper, we consider a concatenated solution consisting of an outer long HDD code and an inner short SDD code. The latter code is a crucial component of the system and the focus of our research. Due to its short length, the code cannot correct all errors, but it is designed to minimize the number of errors. Such codes are known as error-reducing codes. We investigate the error-reducing properties of superposition codes. Initially, we explore sparse regression codes (SPARCs) with Gaussian signals. This approach outperforms error-reducing binary LDPC codes optimized by Barakatain, et al. (2018) in terms of performance but faces limitations in practical applicability due to high implementation complexity. Subsequently, we propose an LDPC-based superposition code scheme with low-complexity soft successive interference cancellation (SIC) decoding. This scheme demonstrates comparable performance to SPARCs while maintaining manageable complexity. Numerical results were obtained for inner codes with an overhead (OH) of 8.24% within a concatenated scheme (15% OH) with an outer hard-decision decoded staircase code (6.25% OH).
Open AccessOn the Error-Reducing Properties of Superposition Codes
Next-generation wireless communication systems impose much stricter requirements for transmission rate, latency, and reliability. The peak data rate of 6G networks should be no less than 1 Tb/s, which is comparable to existing long-haul optical transport networks. It is believed that using long error-correcting codes (ECC) with soft-decision decoding (SDD) is not feasible in this case due to the resulting high power consumption. On the other hand, ECC with hard-decision decoding (HDD) suffers from significant performance degradation. In this paper, we consider a concatenated solution consisting of an outer long HDD code and an inner short SDD code. The latter code is a crucial component of the system and the focus of our research. Due to its short length, the code cannot correct all errors, but it is designed to minimize the number of errors. Such codes are known as error-reducing codes. We investigate the error-reducing properties of superposition codes. Initially, we explore sparse regression codes (SPARCs) with Gaussian signals. This approach outperforms error-reducing binary LDPC codes optimized by Barakatain, et al. (2018) in terms of performance but faces limitations in practical applicability due to high implementation complexity. Subsequently, we propose an LDPC-based superposition code scheme with low-complexity soft successive interference cancellation (SIC) decoding. This scheme demonstrates comparable performance to SPARCs while maintaining manageable complexity. Numerical results were obtained for inner codes with an overhead (OH) of 8.24% within a concatenated scheme (15% OH) with an outer hard-decision decoded staircase code (6.25% OH).
- 3 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (9) , 2313-2317
Energy Efficiency of Unsourced Random Access Over the Binary-Input Gaussian Channel
We investigate the fundamental limits of the unsourced random access over the binary-input Gaussian channel. By fundamental limits, we mean the minimal energy per bit required to achieve the target per-user probability of error. The original method proposed by Y. Polyanskiy (2017) and based on Gallager’s trick does not work well for binary signaling. We utilize Fano’s method, which is based on the choice of the so-called “good” region. We apply this method for the cases of Gaussian and binary codebooks and obtain two achievability bounds. The first bound is very close to Polyanskiy’s bound but does not lead to any improvement. At the same time, the numerical results show that the bound for the binary case practically coincides with the bound for the Gaussian codebook. Thus, we conclude that energy-efficient schemes using binary modulation do exist.
- 3 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (9) , 2313-2317
Energy Efficiency of Unsourced Random Access Over the Binary-Input Gaussian Channel
We investigate the fundamental limits of the unsourced random access over the binary-input Gaussian channel. By fundamental limits, we mean the minimal energy per bit required to achieve the target per-user probability of error. The original method proposed by Y. Polyanskiy (2017) and based on Gallager’s trick does not work well for binary signaling. We utilize Fano’s method, which is based on the choice of the so-called “good” region. We apply this method for the cases of Gaussian and binary codebooks and obtain two achievability bounds. The first bound is very close to Polyanskiy’s bound but does not lead to any improvement. At the same time, the numerical results show that the bound for the binary case practically coincides with the bound for the Gaussian codebook. Thus, we conclude that energy-efficient schemes using binary modulation do exist.
- Open Access
Soft-Output Deep Neural Network-Based Decoding
Deep neural network (DNN)-based channel decoding is widely considered in the literature. The existing solutions are investigated for the case of hard output, i.e. when the decoder returns the estimated information word. At the same time, soft-output decoding is of critical importance for iterative receivers and decoders. In this paper, we focus on the soft-output DNN-based decoding problem. We start with the syndrome-based approach proposed by Bennatan et al. (2018) and modify it to provide soft output in the AWGN channel. The new decoder can be considered as an approximation of the MAP decoder with smaller computation complexity. We discuss various regularization functions for joint DNN-MAP training and compare the resulting distributions for [64, 45] BCH code. Finally, to demonstrate the soft-output quality we consider the turbo-product code with [64, 45] BCH codes as row and column codes. We show that the resulting DNN-based scheme is very close to the MAP-based performance and significantly outperforms the solution based on the Chase decoder. We come to the conclusion that the new method is prospective for the challenging problem of DNN-based decoding of long codes consisting of short component codes.
Open AccessSoft-Output Deep Neural Network-Based Decoding
Deep neural network (DNN)-based channel decoding is widely considered in the literature. The existing solutions are investigated for the case of hard output, i.e. when the decoder returns the estimated information word. At the same time, soft-output decoding is of critical importance for iterative receivers and decoders. In this paper, we focus on the soft-output DNN-based decoding problem. We start with the syndrome-based approach proposed by Bennatan et al. (2018) and modify it to provide soft output in the AWGN channel. The new decoder can be considered as an approximation of the MAP decoder with smaller computation complexity. We discuss various regularization functions for joint DNN-MAP training and compare the resulting distributions for [64, 45] BCH code. Finally, to demonstrate the soft-output quality we consider the turbo-product code with [64, 45] BCH codes as row and column codes. We show that the resulting DNN-based scheme is very close to the MAP-based performance and significantly outperforms the solution based on the Chase decoder. We come to the conclusion that the new method is prospective for the challenging problem of DNN-based decoding of long codes consisting of short component codes.