Random linear network coding for time division duplexing
US8279781B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 28, 2009 |
| Grant date | Oct 2, 2012 |
| Priority date | — |
| Expiry date | Nov 29, 2029 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2001/0097
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receiver to acknowledge (ACK) the number of degrees of freedom, if any, that are required to decode correctly the information. Provided herein is an analysis of this problem to show that there is an optimal number of coded data packets, in terms of mean completion time, to be sent before stopping to listen. This number depends on the latency, probabilities of packet erasure and ACK erasure, and the number of degrees of freedom that the receiver requires to decode the data. This scheme is optimal in terms of the mean time to complete the transmission of a fixed number of data packets. It is shown that its performance is very close to that of a full-duplex system, while transmitting a different number of coded packets can cause large degradation in performance, especially if latency is high. Also described herein is the throughput performance of the novel system and tech…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.