Interleaving and Channels with Unknown Memory.
| dc.contributor.author | Hughes, Brian | en_US |
| dc.contributor.author | Narayan, Prakesh | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:34:34Z | |
| dc.date.available | 2007-05-23T09:34:34Z | |
| dc.date.issued | 1985 | en_US |
| dc.description.abstract | Communications channels which have unknown, time-varying parameters frequently arise in practice. In certain instances, such as in jammed channels, the duration of memory is not known, and memory is not known, and may also be time-varying. Most models of jammed channels which appear in the literature, however, assume that the jammer is restricted to memoryless jamming techniques; this restriction is usually rationalized by arguing that the use of interleaving by the transmitter is sufficient to destroy channel memory. In this paper, the ability of interleaving to eliminate channel memory is investigated by comparing the capacity of jammed channels with memory and random interleaving with that of similar memoryless, jammed channels. | en_US |
| dc.format.extent | 289010 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4417 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1985-44 | en_US |
| dc.title | Interleaving and Channels with Unknown Memory. | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1