Systematic Network Coding for Time Division Duplexing

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2010

Autores

Daniel E. Lucani (Autor) FEUP; Muriel Medard (Autor) FEUP; Milica Stojanovic (Autor) FEUP

Ata de Conferência Internacional

Título: IEEE International Symposium on Information Theory (ISIT 2010), Austin TX, June 2010

Páginas: 2403-2407

IEEE International Symposium on Information Theory (ISIT 2010), Austin TX, June 2010

Austin TX, JUL 13-13, 2010

Classificação Científica

FOS: Ciências da engenharia e tecnologias > Engenharia electrotécnica, electrónica e informática

Outras Informações

Resumo (PT): We present a systematic network coding approach for time-division duplexing channels. In particular, we study the case of a node transmitting to a single receiver. We show that the use of systematic network coding using XORs can provide the same or close to the same performance in terms of completion time as a random linear network coding scheme that uses a large field size, with the added advantage of requiring fewer and simpler operations during the decoding process. We show that the average computation required to decode using systematic network coding in an erasure channel grows as O( M^3 Pe^3), where M is the number of original packets being coded together, and Pe is the packet erasure probability. This means that systematic network coding requires Pe^{-3} times fewer operations on average than random linear network coding with the same field size.

Abstract (EN): We present a systematic network coding approach for time-division duplexing channels. In particular, we study the case of a node transmitting to a single receiver. We show that the use of systematic network coding using XORs can provide the same or close to the same performance in terms of completion time as a random linear network coding scheme that uses a large field size, with the added advantage of requiring fewer and simpler operations during the decoding process. We show that the average computation required to decode using systematic network coding in an erasure channel grows as O( M^3 Pe^3), where M is the number of original packets being coded together, and Pe is the packet erasure probability. This means that systematic network coding requires Pe^{-3} times fewer operations on average than random linear network coding with the same field size.

Idioma: Inglês

Tipo (Avaliação Docente): Científica