Spatially Coupled LDPC Codes Constructed by Parallelly Connecting Multiple Chains

Yang, Liu; Liu, Ying; Chi, Yuhao

doi:10.1109/lcomm.2015.2448090

Cited by 22 publications

(11 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(7, 0, 2, 13), (8, 4, 0, 13), (2,0,11,14), (12,3,0,8), (2,0,11,14), (0, 1, 4, 2), (1, 5, 6, 0), (1, 0, 8, 7), (5, 8, 0, 2), (2, 0, 9, 6).…”

Section: Construction Of Trade-based Ldpc Codesmentioning

confidence: 99%

“…Every block appears in 4 trades; the smallest cyclical trade CT 8 has volume 8: (0, 5, 4111, 56), (5, 0, 28, 58, 13), (2, 7, 43, 13, 58), (7, 2, 30, 60, 15), (4, 9, 45, 15, 60), (9,4,32,62,17), (6,11,47,17,62), (52, 47, 11, 41, 60).…”

Section: Construction Of Trade-based Ldpc Codesmentioning

confidence: 99%

“…In addition, for the time-invariant codes defining a protograph is not a simple task. One approach to propose protographs of SC-LDPC codes is connecting together several SC-LDPC code chains which causes an improvement in the decoding performance [11]. More recently, a research group [12] proved that properly choosing SC-LDPC code chains and connecting them at specific points give rise to an improvement in iterative decoding thresholds.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Trade-Based LDPC Codes

Amirzade¹,

Panario²,

Sadeghi³

2021

Preprint

View full text Add to dashboard Cite

LDPC codes based on multiple-edge protographs potentially have larger minimum distances compared to their counterparts, single-edge protographs. However, considering different features of their Tanner graph, such as short cycles, girth and other graphical structures, is harder than for Tanner graphs from single-edge protographs. In this paper, we provide a novel approach to construct the parity-check matrix of an LDPC code which is based on trades obtained from block designs. We employ our method to construct two important categories of LDPC codes; quasi-cyclic (QC) LDPC and spatially-coupled LDPC (SC-LDPC) codes.We use those trade-based matrices to define base matrices of multiple-edge protographs.The construction of exponent matrices corresponding to these base matrices has less complexity compared to the ones proposed in the literature. We prove that these base matrices result in QC-LDPC codes with smaller lower bounds on the lifting degree than existing ones.There are three categories of SC-LDPC codes: periodic, time-invariant and time-varying.Constructing the parity-check matrix of the third one is more difficult because of the time dependency in the parity-check matrix. We use a trade-based matrix to obtain the paritycheck matrix of a time-varying SC-LDPC code in which each downwards row displacement of the trade-based matrix yields syndrome matrices of a particular time. Combining the different row shifts the whole parity-check matrix is obtained.Our proposed method to construct parity-check and base matrices from trade designs is applicable to any type of super-simple directed block designs. We apply our technique to directed designs with smallest defining sets containing at least half of the blocks. To demonstrate the significance of our contribution, we provide a number of numerical and simulation results.

show abstract

“…(7, 0, 2, 13), (8, 4, 0, 13), (2,0,11,14), (12,3,0,8), (2,0,11,14), (0, 1, 4, 2), (1, 5, 6, 0), (1, 0, 8, 7), (5, 8, 0, 2), (2, 0, 9, 6).…”

Section: Construction Of Trade-based Ldpc Codesmentioning

confidence: 99%

Section: Construction Of Trade-based Ldpc Codesmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Trade-Based LDPC Codes

Amirzade¹,

Panario²,

Sadeghi³

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…However, NR has been introduced the low-latency use cases where different packet sizes, code rates and the robustness in performance against various fading effects are desired characteristics along with acceptable encoder/decoder complexity [1]. For instance, spatially coupled LDPC code has been developed for low-latency communications [2]; they are performed well at short-to-moderate packet sizes.…”

Section: Introductionmentioning

confidence: 99%

Convolutionally Coded SNR-Adaptive Transmission for Low-Latency Communications

Ilter

Yanıkömeroğlu

2018

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Fifth generation new radio aims to facilitate new use cases in wireless communications. Some of these new use cases have highly demanding latency requirements; many of the powerful forward error correction codes deployed in current systems, such as the turbo and low-density parity-check codes, do not perform well when the low-latency requirement does not allow iterative decoding. As such, there is a rejuvenated interest in noniterative/one-shot decoding algorithms. Motivated by this, we propose a signal-to-noise ratio-adaptive convolutionally coded system with optimized constellations designed specifically for a particular set of convolutional code parameters. Numerical results show that significant performance improvements in terms of bit-error-rate and spectral efficiency can be obtained compared to the traditional adaptive modulation and coding systems in low-latency communications.

show abstract

“…Protograph-based LDPC codes [7] possess several practical additional advantages, including smaller decoder memory requirements due to the simplified graph representation, high-speed decoding utilizing the parallel structure of the graph, and the ability to combine low error floors and good thresholds [8], [9].Spatial graph coupling needs not be limited to the connection of graphs to form a single chain. In [10]- [14], more general ensembles were proposed that are constructed by connecting together several individual SC-LDPC code chains. The resulting structures can be interpreted as longer SC-LDPC codes with varying coupling patterns.…”

mentioning

confidence: 99%

Continuous Transmission of Spatially Coupled LDPC Code Chains

Olmos

Mitchell

Truhachev

et al. 2017

IEEE Trans. Commun.

View full text Add to dashboard Cite

We propose a novel encoding/transmission scheme called continuous chain (CC) transmission that is able to improve the finite-length performance of a system using spatially-coupled low-density parity-check (SC-LDPC) codes. In CC transmission, instead of transmitting a sequence of independent codewords from a terminated SC-LDPC code chain, we connect multiple chains in a layered format, where encoding, transmission, and decoding are performed in a continuous fashion. The connections between chains are created at specific points, chosen to improve the finite-length performance of the code structure under iterative decoding. We describe the design of CC schemes for different SC-LDPC code ensembles constructed from protographs: a (J, K)-regular SC-LDPC code chain, a spatially-coupled repeat-accumulate (SC-RA) code, and a spatially-coupled accumulate-repeat-jagged-accumulate (SC-ARJA) code. In all cases, significant performance improvements are reported and it is shown that using CC transmission only requires a small increase in decoding complexity and decoding delay with respect to a system employing a single SC-LDPC code chain for transmission.

show abstract

Spatially Coupled LDPC Codes Constructed by Parallelly Connecting Multiple Chains

Cited by 22 publications

References 7 publications

Trade-Based LDPC Codes

Trade-Based LDPC Codes

Convolutionally Coded SNR-Adaptive Transmission for Low-Latency Communications

Continuous Transmission of Spatially Coupled LDPC Code Chains

Contact Info

Product

Resources

About