Delay-Complexity Trade-off of Random Linear Network Coding in Wireless Broadcast

Su, Rina; Sun, Qifu Tyler; Zhang, Zhongshan

doi:10.1109/icc40277.2020.9148804

Cited by 4 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…x 7 +x 6 +x 4 +x+1 (6) The coefficients of each term in (5) could be seen as coding coefficients of new coded symbols. In (6), coefficients of each term could be seen as the data of new coded symbol. For example, the term x 7 can be represented as 1 =(m16+m15+m3).…”

Section: Decoding With Multiple Field Sizes and Reduction Methodsmentioning

confidence: 99%

“…The Reed-Solomon codes are linearized in [5] for reliability and security. An analysis of completion delay and decoding complexity was conducted for field-based systematic RLNC schemes in wireless broadcast in [6], and it is shown in [7] that network coding has the capability to improve network throughput by extending the traditional store and forward mechanism.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Content Distribution Network for Streaming Using Multiple Galois Fields

Hung

Kaushal

Hsiao

2021

2021 IEEE International Symposium on Circuits and Systems (ISCAS)

View full text Add to dashboard Cite

In this paper, the architecture of random linear network coding based on the hybrid coding in multiple Galois field sizes is proposed. Random linear network coding is an efficient network coding approach that enables network to generate independently and randomly linear mapping between input and output symbols over finite field. With the proposed reduction method, coded symbols and coefficients in higher degree of Galois field can be converted to symbols and coefficients in GF(2) so that hybrid coding in multiple Galois field sizes can be made possible. Therefore, peers in the heterogeneous environments can all benefit from the proposed content distribution network for streaming to better utilize the network resource.

show abstract

Section: Decoding With Multiple Field Sizes and Reduction Methodsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Content Distribution Network for Streaming Using Multiple Galois Fields

Hung

Kaushal

Hsiao

2021

2021 IEEE International Symposium on Circuits and Systems (ISCAS)

View full text Add to dashboard Cite

show abstract

“…On the other hand, the optimal scheme, i.e., RLNC achieves optimal transmission efficiency, which is a constant, at the cost of a considerable amount of computation. This is related to a high decoding complexity over the Galois Field (GF) [23]. From Figs.…”

Section: B Transmission Efficiency With Respect To the Number Of Rxsmentioning

confidence: 99%

A Unified Analysis on ARQ-Based Broadcast: A Road to the Optimum

Choi¹,

Kim

2021

IEEE Access

View full text Add to dashboard Cite

This paper presents a unified framework for Automatic Repeat reQuest (ARQ)-based retransmission schemes in multi-user broadcast environments. Two perspectives, namely, coded packet design and the enhancement of the ARQ protocol, are used to establish the unified framework. Consequently, the combined use of index coding and ARQ incorporated with memory is demonstrated to be beneficial toward performance enhancement in terms of transmission efficiency and memory overhead. Specifically, the asymptotic and finite transmission efficiencies of the index-coded ARQ incorporated with memory are analyzed to be close to the optimum over a wide range of packet error probabilities and the number of users, which is validated numerical evaluations. Furthermore, the use of index coding is analyzed to be also favourable in terms of memory overhead in comparison with the memory ARQ. Thus, index-coded ARQ with appropriate use of memory is shown to be a reasonable option in a practical sense, which sheds light on the possibility that multi-user coded ARQ can play a crucial role for a reliable broadcast beyond unicast.

show abstract

“…Herein, the completion delay refers to the total number of packets transmitted by the BS before every receiver is able recover all P original packets. Notice that the definition of completion delay is the same as the one in [21], which takes the initial P packets transmitted by the BS into account, so it is slightly different from the one in [9]. The packet number P divided by the completion delay is set as a measurement of throughput in [21].…”

Section: A System Modelmentioning

confidence: 99%

“…Thus, D can be regarded as the completion delay for the wireless broadcast system with P original packets, R receivers and independent erasure probability 1 − p r . According to Theorem 1 in [9],…”

Section: A Perfect Rlnc Without Buffermentioning

confidence: 99%

Completion Delay of Random Linear Network Coding in Full-Duplex Relay Networks

Su¹,

Sun²,

Zhang³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

As the next-generation wireless networks thrive, full-duplex and relaying techniques are combined to improve the network performance. Random linear network coding (RLNC) is another popular technique to enhance the efficiency and reliability in wireless communications. In this paper, in order to explore the potential of RLNC in full-duplex relay networks, we investigate two fundamental perfect RLNC schemes and theoretically analyze their completion delay performance. The first scheme is a straightforward application of conventional perfect RLNC studied in wireless broadcast, so it involves no additional process at the relay. Its performance serves as an upper bound among all perfect RLNC schemes. The other scheme allows sufficiently large buffer and unconstrained linear coding at the relay. It attains the optimal performance and serves as a lower bound among all RLNC schemes. For both schemes, closedform formulae to characterize the expected completion delay at a single receiver as well as for the whole system are derived. Numerical results are also demonstrated to justify the theoretical characterizations, and compare the two new schemes with the existing one.

show abstract

Delay-Complexity Trade-off of Random Linear Network Coding in Wireless Broadcast

Cited by 4 publications

References 16 publications

Content Distribution Network for Streaming Using Multiple Galois Fields

Content Distribution Network for Streaming Using Multiple Galois Fields

A Unified Analysis on ARQ-Based Broadcast: A Road to the Optimum

Completion Delay of Random Linear Network Coding in Full-Duplex Relay Networks

Contact Info

Product

Resources

About