Left degree distribution shaping for LT codes over the binary erasure channel

Hayajneh, Khaled F.; Yousefi, Shahram; Valipour, Mehrdad

doi:10.1109/qbsc.2014.6841213

Cited by 9 publications

(5 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In other words, fountain codes can work in the absence of a feedback channel, even in nasty channels [8][9][10]. Such codes work on erasure channels such as binary erasure channels (BECs) [9,11,12], as well as noisy channels such as AWGN channels [13][14][15] and fading channels [16,17].…”

Section: R S1 S2mentioning

confidence: 99%

Memory-Based LT Codes for Efficient 5G Networks and Beyond

Hayajneh

2021

Electronics

Self Cite

View full text Add to dashboard Cite

The next-generation networks (5G and beyond) require robust channel codes to support their high specifications, such as low latency, low complexity, significant coding gain, and flexibility. In this paper, we propose using a fountain code as a promising solution to 5G and 6G networks, and then we propose using a modified version of the fountain codes (Luby transform codes) over a network topology (Y-network) that is relevant in the context of the 5G networks. In such a network, the user can be connected to two different cells at the same time. In addition, the paper presents the necessary techniques for analyzing the system and shows that the proposed scheme enhances the system performance in terms of decoding success probability, error probability, and code rate (or overhead). Furthermore, the analyses in this paper allow us to quantify the trade-off between overhead, on the one hand, and the decoding success probability and error probability, on the other hand. Finally, based on the analytical approach and numerical results, our simulation results demonstrate that the proposed scheme achieves better performance than the regular LT codes and the other schemes in the literature.

show abstract

Section: R S1 S2mentioning

confidence: 99%

Memory-Based LT Codes for Efficient 5G Networks and Beyond

Hayajneh

2021

Electronics

Self Cite

View full text Add to dashboard Cite

show abstract

“…The MBLTE remembers two outcomes with values d = 1 and d = 2. When d = 1, it samples the input symbol with the highest instantaneous degree, which is defined in [20,21] as the highest degree at the time when the current output symbol is being constructed. When d = 2, it samples one input symbol from those with the highest instantaneous degrees, then another one from those symbols with the second highest instantaneous degree.…”

Section: Second-order Mbltementioning

confidence: 99%

“…These works mostly rely on either feedback channels or encoding/decoding operations with higher complexities, none of which is favorable to UDNs since: (i) due to the massive number of devices, leveraging the feedback channel may not be feasible, and (ii) low-power SBS, IoT, and sensory devices are not well-suited for high complexity encoding and decoding operations. Recently, memory-based LT encoders (MBLTEs) [20][21][22][23][24] were proposed for improving the bit-error-rate (BER)/frameerror-rate (FER) performance of LT codes with relatively short block-lengths at the cost of adding memory into the encoder while maintaining the same low encoding/decoding complexity as LT codes.…”

Section: Introductionmentioning

confidence: 99%

Delay-Efficient and Reliable Data Relaying in Ultra Dense Networks using Rateless Codes

Shang

Hashemi

Kim

et al. 2020

GLOBECOM 2020 - 2020 IEEE Global Communications Conference

View full text Add to dashboard Cite

We investigate the problem of delay-efficient and reliable data delivery in ultra-dense networks (UDNs) that constitute macro base stations (MBSs), small base stations (SBSs), and mobile users. Considering a two-hop data delivery system, we propose a partial decode-and-forward (PDF) relaying strategy together with a simple and intuitive amicable encoding scheme for rateless codes to significantly improve user experience in terms of end-to-end delay. Simulation results verify that our amicable encoding scheme is efficient in improving the intermediate performance of rateless codes. It also verifies that our proposed PDF significantly improves the performance of the decode-and-forward (DF) strategy, and that PDF is much more robust against channel degradation. Overall, the proposed strategy and encoding scheme are efficient towards delay-sensitive data delivery in the UDN scenarios.

show abstract

“…The error-floor performance of systematic LT codes transmitted over additive white Gaussian noise channels was improved in [18] by shaping the variable-node degree distribution. A similar approach was extended in [19] to improve the erasure floor performance of finite-length LT codes transmitted over erasure channels. However, these ideas cannot directly be extended to DLT codes due to the presence of a relay, which destroys the pattern of variable-node degrees at the relay.…”

Section: Erasure Floor Analysis Of Distributed Lt Codesmentioning

confidence: 99%

Erasure Floor Analysis of Distributed LT Codes

Hussain

Xiao

Rasmussen

2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

We investigate the erasure floor performance of distributed Luby transform (DLT) codes for transmission within a multi-source, single-relay, and single-destination erasure-link network. In general, Luby transform (LT) codes exhibit a high erasure floor due to poor minimum-distance properties, which can be improved by maximizing the minimum variable-node degree. The same behavior is observed for DLT codes, and therefore a new combining scheme at the relay is proposed to maximize the minimum variable-node degree in the decoding graph. Furthermore, the encoding process at the sources and the combining scheme at the relay are coordinated to improve the transmission overhead. To characterize the asymptotic performance of the proposed DLT codes, we derive closed-form density-evolution expressions, considering both lossless and lossy source-relay channels, respectively. To support the asymptotic analysis, we evaluate the performance of the proposed DLT codes by numerical examples and demonstrate that the numerical results correspond closely to the analysis. Significant improvements in both the erasure floor and transmission overhead are obtained for the proposed DLT codes, as compared to conventional DLT codes. Index Terms-Multi-source networks, distributed LT codes, buffer, relay combining, erasure floor. I. INTRODUCTIONR ELIABLE transmission over time-varying channels is a challenging task. For example, traditional fixed-rate channel error-control coding is inefficient, at best, subject to channel variations. A similar problem arises in broadcast and multicast transmissions where the channel links from the source to the receivers are time-invariant but different from each other. A promising approach is to employ a class of graph-based codes, termed fountain codes, first introduced in [1] as an efficient approach for reliable information delivery in broadcast and multicast transmission. These codes are rateless as the rate of the code can be adjusted on-the-fly.The first practical rateless coding scheme was the Luby transform (LT) code introduced in [2], exhibiting excellent overhead performance for transmission over a binary erasure channel Manuscript

show abstract

Left degree distribution shaping for LT codes over the binary erasure channel

Cited by 9 publications

References 22 publications

Memory-Based LT Codes for Efficient 5G Networks and Beyond

Memory-Based LT Codes for Efficient 5G Networks and Beyond

Delay-Efficient and Reliable Data Relaying in Ultra Dense Networks using Rateless Codes

Erasure Floor Analysis of Distributed LT Codes

Contact Info

Product

Resources

About