On the Design of Multi-Edge Type Low-Density Parity-Check Codes

Jeong, Suhwang; Ha, Jeongseok

doi:10.1109/tcomm.2019.2927567

Cited by 8 publications

(3 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since performing two decoding processes in (13) are considered to have higher decoding complexity, we propose to simplify it using the concept of Cascaded LDPC codes [25], such that we only have both a single equivalent G 1eq and H 1eq .…”

Section: Sldpc1 Codes Structurementioning

confidence: 99%

Deriving equivalent structure of elements for low density parity check codes construction

Zaeni

Muzhofi

Solehudin

et al. 2023

IJEECS

View full text Add to dashboard Cite

This paper proposes a method to derive equivalent coding structures of elements to construct low density parity check (LDPC) codes. We propose stairs LDPC (SLDPC) codes to demonstrate the effectiveness of the proposed method, which is expected to be beneficial for short block-length transmissions, but providing high coding rate. The equivalent coding structures are both for transmitter and receiver to: (i) reduce the encoding and decoding computational complexity, and (ii) search possibility of finding new coding scheme and observe their performances. We evaluate the validity of the method by confirming the equality in performances of the SLDPC codes in terms of bit-error-rate (BER) followed by investigation on their performance gaps to the Shannon limit via a series of computer simulations. The results show that the SLDPC codes have the same BER performance with that of the low density generator matrix (LDGM) codes confirming the validity of the proposed equivalent matrix derivation. This result indicates that different graphs can provide the same performances, because their equivalent matrices are the same. This result is expected to open new insight for the designing simple channel coding for short block-length LDPC codes having high coding rate for future less power consumption applications.

show abstract

Section: Sldpc1 Codes Structurementioning

confidence: 99%

Deriving equivalent structure of elements for low density parity check codes construction

Zaeni

Muzhofi

Solehudin

et al. 2023

IJEECS

View full text Add to dashboard Cite

show abstract

“…The design of MET-LDPC code involves solving an optimization problem [27,28]. The optimization algorithm searches between all the valid degree distributions to find a code close to the threshold.…”

Section: Met-ldpc Codes For Use In Cv-qkd Implementationsmentioning

confidence: 99%

Multiedge-type low-density parity-check codes for continuous-variable quantum key distribution

et al. 2021

View full text Add to dashboard Cite

Continuous-variable quantum key distribution (QKD) utilizes an ensemble of coherent states of light to distribute secret encryption keys between two parties. An essential ingredient of the QKD protocol is highly efficient information reconciliation. To achieve highly efficient reconciliation, error-correcting codes with a low channel coding rate are inevitable in the most common schemes of multilevel coding and multistage decoding (MLC-MSD) and multidimensional reconciliation. Multiedge-type (MET) low-density parity-check (LDPC) codes are well suited for highly efficient reconciliation at low rates. Here, we calculate the optimal channel coding rates in the MLC-MSD scheme for reverse reconciliation, introduce the concept of generalized extrinsic information transfer charts for MET-LDPC codes, which constitute a simple and fast asymptotic analysis tool, and present a set of MET-LDPC codes with asymptotic efficiency >97% for channel coding rates 0.1, 0.05, 0.02, and 0.01. We believe that our codes will find wide application in implementations of continuous-variable quantum key distribution based on Gaussian modulation.

show abstract

“…The LDPC codes is a strong and efficient group of error correction codes which can achieve the channel capacity and small BER values, when large enough code lengths are utilized [15]. In this work, we employ an extension of LDPC codes which are proper to network scenarios and called multiedge type LDPC codes [16][17]. These graph-based codes are able to decode jointly and simultaneously the correlated data coming from separate links and channels.…”

mentioning

confidence: 99%

Reliability Analysis of the Joint LDPC Decoding Algorithms over the Multiple Access Channels

Nangir¹

2021

jist

View full text Add to dashboard Cite

The joint Low Density Parity-Check (LDPC) decoding schemes iteratively decode the received data from multiple channels. Mostly, the available data in different channels are correlated and there is kind of dependency between the links or channels. In recent decades, the graph-based codes have been considered for the communication network scenarios. The performance of these codes is close to the existing theoretical bounds and their complexity is not high which cause the possibility of real world implementation and exploitation. The Multiple Access Channel (MAC) scenario with multiple senders which aim to send correlated data to a single receiver is considered. An analysis on the reliability of the Bit Error Rate (BER) performance of the Joint Sum-Product (JSP) decoding algorithm is presented for a two-link case, which can be extended to higher number of links. The effect of parameter variations on the BER performance is studied. These parameters include: the total number of iterations, the codeword length, the total number of rounds, and the coding rate in the JSP algorithm. An optimal value of the parameters is selected during the design procedure of a communication network by considering its limitations and complexity criterion. The JSP algorithm is a reliable scheme for jointly decoding of noisy binary data from different origins.

show abstract

On the Design of Multi-Edge Type Low-Density Parity-Check Codes

Cited by 8 publications

References 33 publications

Deriving equivalent structure of elements for low density parity check codes construction

Deriving equivalent structure of elements for low density parity check codes construction

Multiedge-type low-density parity-check codes for continuous-variable quantum key distribution

Reliability Analysis of the Joint LDPC Decoding Algorithms over the Multiple Access Channels

Contact Info

Product

Resources

About