Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

???????????? ?????? ???????????? ?????? LDPC ?????? ?????? ?????? ?????????

?????????

Published Jul 1, 2010• 0 citations
OpenAlex

Abstract

?????? ????????? ?????? ?????? ???????????? ???????????? ???????????? ???????????? ?????? ???????????? ????????? ??? ?????? ???????????? ?????? ???????????? ????????? ??????. ????????? ???????????? ?????? ???????????? ?????? ???????????? ??????????????? ???????????? ????????? ?????? ?????? ????????? ???????????? ??????. ?????? ?????? ????????? ?????? ?????? ????????? ??????-?????? ?????? ???????????? ?????? ?????? ???????????? ??????????????? ????????? ???????????? ??????????????? ????????? ????????? ??????. ??? ?????? ?????? ??????????????? LDPC ????????? ????????? ????????? ????????? ?????? ???????????? ??????????????? ???????????? ????????? ????????? ????????? ?????? ???????????? ????????????. ????????? ??? ??????????????? ???????????? ?????? ???????????? ?????? LDPC ?????? ?????? ????????? ????????? ????????? ????????????.

Related papers

???????????? ???????????? ????????? LDPC ?????? ?????? ??????

?????????

??? ??????????????? ???????????? ???????????? ????????? LDPC ?????? ?????? ????????? ????????????. ?????? ?????? ?????? ?????? ???????????? ???????????? ???????????? ????????? ?????? ???????????? ???????????? ????????? ?????? ?????? LDPC ?????? ????????? ????????????. ????????? LDPC ????????? ???????????? Tanner ???????????? ????????? ?????? ????????? ????????? LDPC ???????????? ???????????? ????????? ????????? ?????? ?????? ?????? ????????? ????????????. ?????? ?????????????????? ???????????? ???????????? ????????? LDPC ?????? ?????? ????????? ????????? ???????????? ??? ?????? ?????? ?????? ?????? ????????? ???????????????. ???????????? LDPC ????????? ????????? ???????????? ???-????????? ??? ???-?????? ??? ?????? ??? ?????? ?????? ??????????????? ????????? ????????? ?????? ?????? ??? ?????? ????????? ????????? ????????? ??? ?????????.

•May 1, 2012•0 citations

非规则LDPC码随机性结构的分布规律研究和在短环消除算法中的应用

义林 常, 林华 马, 晟达 王

Science in China Series F-Information Sciences (in Chinese)•Apr 1, 2007•0 citations

Parallel decoding of LDPC convolutional codes using OpenMP and GPU

Chi Ho Chan, Francis C. M. Lau

Recently, there have been different applications, namely 10GBase-T Ethernet, video broadcasting and satellite communication, utilizing low-density parity-check (LDPC) codes as the forward-error-correction codes. The main reason is that the error performance of LDPC codes can be very close to the Shannon limit. LDPC codes can be further categorized into LDPC block codes (LDPC-BCs) and LDPC convolutional codes (LDPC-CCs). It has also been discovered that LDPC-CCs usually outperform LDPC-BCs. Simulation of LDPC-BCs and LDPC-CCs can take a lot of time because the decoding algorithms are relatively complex. Fortunately, the decoding steps can be performed in parallel. In this paper, we create three different platforms for simulating the error performance of LDPC-CCs. The first two platforms are run on a Central Processing Unit (CPU) while the third one involves the use of a Graphics Processing Unit (GPU). We show that using GPU can improve the simulation speed substantially.

IEEE Symposium on Computers and Communications (ISCC)•Jul 1, 2012•7 citations

LDPC 부호의 양자화 복호 성능과 반복 횟수 통계

서영동, 공민한, 송문규

한국통신학회 학술대회논문집•Jul 1, 2008•0 citations

Generalised array low‐density parity‐check codes

R. Sobhani

In this study, using Group Permutation Low‐Density Parity‐Check (GP‐LDPC) codes, the authors generalise the concept of array Low‐Density Parity‐Check (LDPC) codes from fields of prime order to those of prime power order. In fact, they consider the additive group of the finite field GF( q ), q a prime power, as the underlying group for the GP‐LDPC code construction and since when q is a prime, the author's code construction method coincides with that of quasi‐cyclic array LDPC codes, they call their codes, generalised array LDPC (GA‐LDPC) codes. First, they prove that, like array LDPC codes, GA‐LDPC codes are quasi‐cyclic codes. Then, they analyse the girth of GA‐LDPC codes in a way similar to that for array LDPC codes and introduce some shortened GA‐LDPC codes with girths 8, 10 and 12. For many values of g , J and L , the lengths of ( J , L )‐regular shortened GA‐LDPC codes of girth g and rate at least 1 − J / L , constructed in this study, are smaller than the lengths of ( J , L )‐regular LDPC codes of girth g and rate at least 1 − J / L , constructed in the literature. Also, simulation results show that GA‐LDPC codes perform well with the iterative message‐passing decoding.

IET Communications•Jun 26, 2014•2 citations

On the Error Floor of the Code-Candidate for CCSDS Standard

Luiza R. Medova, Pavel S. Rybin, Ivan V. Filatov

In this paper we propose a simulation system for LDPC codes implemented on a field-programmable gate array device. The presented system includes an LDPC encoder, Gaussian noise generator and an LDPC decoder. An LDPC encoder and decoder are fully flexible and support different constructions of LDPC codes. It makes possible to obtain performance curves of a large number of LDPC codes and analyse their properties. We have found that the LDPC code proposed in [1] has an error floor higher than the LDPC code proposed by the experimental specification CCSDS 231.1-O-l. We have evaluated the performance of 2250 (128,256) LDPC codes with our simulation system and have found an LDPC code that outperforms the LDPC code from the experimental specification CCSDS 231.1-O-l.

International Conference on Engineering and Telecommunication (EnT)•Nov 1, 2019•0 citations
?????? ????????? ?????? ?????? ???????????? ???????????? ???????????? ???????????? ?????? ???????????? ????????? ??? ?????? ???????????? ?????? ???????????? ????????? ??????. ????????? ???????????? ?????? ???????????? ?????? ???????????? ??????????????? ???????????? ????????? ?????? ?????? ????????? ???????????? ??????. ?????? ?????? ????????? ?????? ?????? ????????? ??????-?????? ?????? ???????????? ?????? ?????? ???????????? ??????????????? ????????? ???????????? ??????????????? ????????? ????????? ??????. ??? ?????? ?????? ??????????????? LDPC ????????? ????????? ????????? ????????? ?????? ???????????? ??????????????? ???????????? ????????? ????????? ????????? ?????? ???????????? ????????????. ????????? ??? ??????????????? ???????????? ?????? ???????????? ?????? LDPC ?????? ?????? ????????? ????????? ????????? ????????????.
??? ??????????????? ???????????? ???????????? ????????? LDPC ?????? ?????? ????????? ????????????. ?????? ?????? ?????? ?????? ???????????? ???????????? ???????????? ????????? ?????? ???????????? ???????????? ????????? ?????? ?????? LDPC ?????? ????????? ????????????. ????????? LDPC ????????? ???????????? Tanner ???????????? ????????? ?????? ????????? ????????? LDPC ???????????? ???????????? ????????? ????????? ?????? ?????? ?????? ????????? ????????????. ?????? ?????????????????? ???????????? ???????????? ????????? LDPC ?????? ?????? ????????? ????????? ???????????? ??? ?????? ?????? ?????? ?????? ????????? ???????????????. ???????????? LDPC ????????? ????????? ???????????? ???-????????? ??? ???-?????? ??? ?????? ??? ?????? ?????? ??????????????? ????????? ????????? ?????? ?????? ??? ?????? ????????? ????????? ????????? ??? ?????????.
Recently, there have been different applications, namely 10GBase-T Ethernet, video broadcasting and satellite communication, utilizing low-density parity-check (LDPC) codes as the forward-error-correction codes. The main reason is that the error performance of LDPC codes can be very close to the Shannon limit. LDPC codes can be further categorized into LDPC block codes (LDPC-BCs) and LDPC convolutional codes (LDPC-CCs). It has also been discovered that LDPC-CCs usually outperform LDPC-BCs. Simulation of LDPC-BCs and LDPC-CCs can take a lot of time because the decoding algorithms are relatively complex. Fortunately, the decoding steps can be performed in parallel. In this paper, we create three different platforms for simulating the error performance of LDPC-CCs. The first two platforms are run on a Central Processing Unit (CPU) while the third one involves the use of a Graphics Processing Unit (GPU). We show that using GPU can improve the simulation speed substantially.
In this study, using Group Permutation Low‐Density Parity‐Check (GP‐LDPC) codes, the authors generalise the concept of array Low‐Density Parity‐Check (LDPC) codes from fields of prime order to those of prime power order. In fact, they consider the additive group of the finite field GF( q ), q a prime power, as the underlying group for the GP‐LDPC code construction and since when q is a prime, the author's code construction method coincides with that of quasi‐cyclic array LDPC codes, they call their codes, generalised array LDPC (GA‐LDPC) codes. First, they prove that, like array LDPC codes, GA‐LDPC codes are quasi‐cyclic codes. Then, they analyse the girth of GA‐LDPC codes in a way similar to that for array LDPC codes and introduce some shortened GA‐LDPC codes with girths 8, 10 and 12. For many values of g , J and L , the lengths of ( J , L )‐regular shortened GA‐LDPC codes of girth g and rate at least 1 − J / L , constructed in this study, are smaller than the lengths of ( J , L )‐regular LDPC codes of girth g and rate at least 1 − J / L , constructed in the literature. Also, simulation results show that GA‐LDPC codes perform well with the iterative message‐passing decoding.
In this paper we propose a simulation system for LDPC codes implemented on a field-programmable gate array device. The presented system includes an LDPC encoder, Gaussian noise generator and an LDPC decoder. An LDPC encoder and decoder are fully flexible and support different constructions of LDPC codes. It makes possible to obtain performance curves of a large number of LDPC codes and analyse their properties. We have found that the LDPC code proposed in [1] has an error floor higher than the LDPC code proposed by the experimental specification CCSDS 231.1-O-l. We have evaluated the performance of 2250 (128,256) LDPC codes with our simulation system and have found an LDPC code that outperforms the LDPC code from the experimental specification CCSDS 231.1-O-l.