Improving the Decoding Speed of Packet Recovery in Network Coding

The reliability of communication channels is one of the most challenging tasks in wireless communication. Network coding (NC) has emerged as a compelling solution to improve throughput performance and reliability by sending coded packets and accepting valid ones at the receiver. Discarding corrupted...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE communications letters Ročník 25; číslo 2; s. 351 - 355
Hlavní autori: Nazari, Hosein K., Ghassabi, Kiana, Pahlevani, Peyman, Lucani, Daniel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.02.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
algebraic consistency rule
Algorithms
Coding
Complexity theory
Decoding
Encoding
Error correction
Forward error correction
Integrated circuits
Network coding
Network reliability
Packets (communication)
random linear network coding
Receivers
Recovery
Wireless communications
ISSN:1089-7798, 1558-2558
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The reliability of communication channels is one of the most challenging tasks in wireless communication. Network coding (NC) has emerged as a compelling solution to improve throughput performance and reliability by sending coded packets and accepting valid ones at the receiver. Discarding corrupted coded packets in NC often meant discarding potentially useful information. Thus, using forward error correction (FEC) in each coded packet makes the corrupted packets useful at the receiver. In this letter, we propose a fast decoding algorithm for packet recovery in NC (F-PRNC) using an algebraic consistency between the coded packets to detect their possible corrupted parts. We provided a complexity analysis of the F-PRNC and compared it with partial packet recovery schemes such as DAPRAC and S-PRAC. Our simulation result shows that F-PRNC exceeds both methods in a variety of conditions.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2020.3031011