Turbo Codes over the Real Field
| dc.creator | Datta, Animesh | |
| dc.date | 2003-12-13 | |
| dc.date.accessioned | 2026-07-07T05:03:54Z | |
| dc.date.available | 2026-07-07T05:03:54Z | |
| dc.description | In this article we extend the idea of Turbo codes onto the Real Field. The channel is taken to result in block erasures and the only noise as being that due to quantization. The decoding in this case is reduced to reconstruction of the lost values. The encoding is done using critically sampled filter banks and introduction of an interleaver is found to reduce the mean square quantization error drastically. The permutation that gives the best recoverability is obtained in the 2 Channel case. Results are also obtained for M channel case. The algorithm for reconstruction of the lost values in the absence of quantization noise is obtained. | |
| dc.description | 13 pages, no figures | |
| dc.identifier | https://arxiv.org/abs/math/0312272 | |
| dc.identifier | http://arxiv.org/abs/math/0312272 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/69596 | |
| dc.subject | Combinatorics | |
| dc.subject | 94B10, 94A12, 60G35 | |
| dc.title | Turbo Codes over the Real Field | |
| dc.type | text |