Evaluation of Decoding Delay in the Perpetual Coding

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Mohammadi Sanaz; Pahlevani Peyman

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCED SIGNAL PROCESSING Year:2020 | Volume:4 | Issue:1 (5) Page(s): 111-119

Download Full-Text

Persian Verion

View:

146

Download:

Cites:

Information Journal Paper

Title

Evaluation of Decoding Delay in the Perpetual Coding

Author(s)

Mohammadi Sanaz | Pahlevani Peyman | Issue Writer Certificate

Keywords

Network

Channel Coding

RLNC

Perpetual

Decoding

Abstract

Perpetual coding is a sparse coding method in which coefficients are used in a structured way for coding operations. It has been shown that this method reduces the computational complexity of the random linear Network coding method. The purpose of this paper is to articulate a mathematical model to illustrate the performance of Perpetual coding, and to show that in a Perpetual coding with the presence of an erasure channel the number of linear dependent packet transmissions is highly dependent on a parameter called the width ( ) ω which represents the number of consecutive non-zero coding coefficients present in each coded packet after a pivot element. Then, a mathematical analytical model for the number of transmitted packets is provided, which predicts the number of packets until the second round. Finally, we obtain the probability of the packet’ s Decoding in round k and validate it by simulation. The results show that for low error probability and small (ω ) on the link, overhead value can even reach a number close to 70%. To reduce the transmitter overhead, the ( ) ω value must be selected correctly, and the correct choice of ( ) ω is highly dependent on the probability of channel error. Also, for  5, generation size g  256 and low erasure probability on the link, a destination can receive up to 70% overhead on average. Moreover, by increasing the width, the overhead decreases and for  60 it becomes negligible. We show that our mechanism reduces the delay by 37. 44 percent.

Cites

No record.

References

No record.

Cite

APA: Copy

Mohammadi, Sanaz, & Pahlevani, Peyman. (2020). Evaluation of Decoding Delay in the Perpetual Coding. JOURNAL OF ADVANCED SIGNAL PROCESSING, 4(1 (5) ), 111-119. SID. https://sid.ir/paper/964471/en

Vancouver: Copy

Mohammadi Sanaz, Pahlevani Peyman. Evaluation of Decoding Delay in the Perpetual Coding. JOURNAL OF ADVANCED SIGNAL PROCESSING[Internet]. 2020;4(1 (5) ):111-119. Available from: https://sid.ir/paper/964471/en

IEEE: Copy

Sanaz Mohammadi, and Peyman Pahlevani, “Evaluation of Decoding Delay in the Perpetual Coding,” JOURNAL OF ADVANCED SIGNAL PROCESSING, vol. 4, no. 1 (5) , pp. 111–119, 2020, [Online]. Available: https://sid.ir/paper/964471/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops