Parallel encoding algorithm for LDPC codes based on block-diagonalization

Nozaki, Takayuki

doi:10.1109/isit.2015.7282788

Cited by 4 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Shibuya [59] proposed an encoding algorithm based on the block-triangularization via Dulmage-Mendelsohn decomposition. Nozaki [60] presented a parallel encoding algorithm based on block-diagonalization. Iketo and Nozaki [61,62] proposed an encoding algorithm based on block-triangularization.…”

Section: Other Encoding Algorithmsmentioning

confidence: 99%

LDPC Codes for Communication Systems: Coding Theoretic Perspective

Nozaki

Isaka

2022

IEICE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Other Encoding Algorithmsmentioning

confidence: 99%

LDPC Codes for Communication Systems: Coding Theoretic Perspective

Nozaki

Isaka

2022

IEICE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…This section introduces three representations for LDPC codes, namely, parity check matrix, Tanner graph and hypergraph, and gives the relationship between Tanner graph and hypergraph [2].…”

Section: A Hypergraph Representation For Ldpc Codementioning

confidence: 99%

“…. , H P,K ] [2]. More precisely, this algorithm breaks down the system of linear equations (1) into K systems of linear equations and parallelly solves those K systems of linear equations.…”

Section: Introductionmentioning

confidence: 99%

“…More precisely, this algorithm breaks down the system of linear equations (1) into K systems of linear equations and parallelly solves those K systems of linear equations. We showed in [2] that the total number of operations of this encoding algorithm approximately equals to Richardson and Urbanke's (RU) encoding algorithm [3]. Since this encoding algorithm simultaneously solves K systems of linear equations, the processing time of the encoding algorithm is 1/K of the RU encoding algorithm.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cutsize distributions of balanced hypergraph bipartitions for random hypergraphs

Nozaki

2016

2016 IEEE International Symposium on Information Theory (ISIT)

Self Cite

View full text Add to dashboard Cite

In a previous work, we presented a parallel encoding algorithm for low-density parity-check (LDPC) codes by partitioning hypergraph representation for the LDPC codes. The aim of this research is to analyze the processing time of this encoding algorithm. This paper clarifies that the processing time of the encoding algorithm depends on the minimum cutsize of balanced hypergraph partitions. Moreover, this paper gives the typical minimum cutsize and cutsize distribution for balanced hypergraph bipartitions of random hypergraphs defined from a regular LDPC ensemble.

show abstract

“…This EA is more efficient than the RU-EA. However, this EA has a possibility of abend [8], More precisely, there is a possibility that some diagonal submatrices become vertical, i.e., singular. 4) Nozaki [9] proposed a parallel EA by blockdiagonalization.…”

Section: Introductionmentioning

confidence: 99%

Efficient Encoding Algorithm of Binary and Non-Binary LDPC Codes Using Block Triangulation

Iketo,

Nozaki

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We propose an efficient encoding algorithm for the binary and non-binary low-density parity-check codes. This algorithm transforms the parity part of the parity-check matrix into a block triangular matrix with low weight diagonal submatrices by row and column permutations in the preprocessing stage. This algorithm determines the parity part of a codeword by block back-substitution to reduce the encoding complexity in the encoding stage. Numerical experiments show that this algorithm has a lower encoding complexity than existing encoding algorithms. Moreover, we show that this algorithm encodes the non-binary cycle codes in linear time.

show abstract

Parallel encoding algorithm for LDPC codes based on block-diagonalization

Cited by 4 publications

References 8 publications

LDPC Codes for Communication Systems: Coding Theoretic Perspective

LDPC Codes for Communication Systems: Coding Theoretic Perspective

Cutsize distributions of balanced hypergraph bipartitions for random hypergraphs

Efficient Encoding Algorithm of Binary and Non-Binary LDPC Codes Using Block Triangulation

Contact Info

Product

Resources

About