A Theory of Interleavers
| dc.contributor.author | Andrews, Kenneth | en_US |
| dc.contributor.author | Heegard, Chris | en_US |
| dc.contributor.author | Kozen, Dexter | en_US |
| dc.date.accessioned | 2007-04-23T18:09:54Z | |
| dc.date.available | 2007-04-23T18:09:54Z | |
| dc.date.issued | 1997-06 | en_US |
| dc.description.abstract | An interleaver is a hardware device commonly used in conjunction with error correcting codes to counteract the effect of burst errors. Interleavers are in widespread use and much is known about them from an engineering standpoint. In this paper we propose a mathematical model that provides a rigorous foundation for the theoretical study of interleavers. The model captures precisely such notions as block and convolutional interleavers, spread, periodicity, causality, latency, and memory usage. Using this model, we derive several optimality results on the latency and memory usage of interleavers. We describe a family of block interleavers and show that they are optimal with respect to latency among all block interleavers with a given spread. We also give tight upper and lower bounds on the memory requirements of interleavers. | en_US |
| dc.format.extent | 212623 bytes | |
| dc.format.extent | 237931 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR97-1634 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7289 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | A Theory of Interleavers | en_US |
| dc.type | technical report | en_US |