Abstract | ||
---|---|---|
In this paper we propose a technique to implement in a parallel fashion a turbo decoder based on an arbitrary permutation, and to expand its interleaver in order to produce a family of prunable S-random interleavers suitable for parallel implementations. We show that the spread properties of the obtained interleavers are almost optimal and we prove by simulation that they are very competitive in t... |
Year | DOI | Venue |
---|---|---|
2007 | 10.1109/LCOMM.2007.061131 | IEEE Communications Letters |
Keywords | Field | DocType |
Turbo codes,Merging,Iterative decoding,Throughput,Delay,Multimedia systems,Read-write memory,Adaptive coding,Modulation coding,Algorithm design and analysis | Interlacing,Error floor,Computer science,Decoder architecture,Permutation,Parallel computing,Turbo code,Turbo decoder,Real-time computing,Soft-decision decoder,Decoding methods | Journal |
Volume | Issue | ISSN |
11 | 2 | 1089-7798 |
Citations | PageRank | References |
4 | 0.53 | 3 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Alberto Tarable | 1 | 86 | 13.42 |
Libero Dinoi | 2 | 52 | 5.17 |
Sergio Benedetto | 3 | 26 | 2.91 |