Show simple item record

Interleaving and Channels with Unknown Memory.

dc.contributor.authorHughes, Brianen_US
dc.contributor.authorNarayan, Prakeshen_US
dc.date.accessioned2007-05-23T09:34:34Z
dc.date.available2007-05-23T09:34:34Z
dc.date.issued1985en_US
dc.identifier.urihttp://hdl.handle.net/1903/4417
dc.description.abstractCommunications 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.extent289010 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1985-44en_US
dc.titleInterleaving and Channels with Unknown Memory.en_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record