Abstract

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.

Highlights

  • Memory-Based Luby transform (LT) Codes for EfficientWith the advent of the fifth generation (5G) of the 3GPP mobile communication standard, it is expected that major content distributors (e.g., Google, Facebook, etc.) will exploit the network capabilities to provide and retrieve massive amounts of data

  • We develop the use of decoding success probability (DSP) to investigate the performance of the regular LT codes as well as the proposed scheme

  • We study the performance of LT codes in terms of decoding success probability (DSP)

Read more

Summary

Introduction

With the advent of the fifth generation (5G) of the 3GPP mobile communication standard, it is expected that major content distributors (e.g., Google, Facebook, etc.) will exploit the network capabilities to provide and retrieve massive amounts of data. Shaping the left degree distribution (i.e., the degrees of the source nodes) of LT codes improves the performance of the point-to-point communications [19]. This algorithm is referred to as memorybased-LT (MBLT). The concept of distributed fountain codes (DFC) has been used to send data from multiple sources to a destination through a common relay [20,21,22,23,24]. We present a novel approach to designing LT code over the Y-network where the concept of memory-based is applied at both sources, and the relay uses a buffer-and-forward strategy.

Preliminaries and Related Work
LT Encoding Process
LT Decoding Process
Degree Distributions of LT Codes
Encoding Process of the MBLT on the Y-Network
Performance Analysis
Decoding Success Probability
Optimization of LT Code Parameters
Numerical Results
LT Parameters
DSP and BER
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call