Parallel access by butterfly networks for any degree permutation polynomial and ARP interleavers
| Autor: | Daniela Tarniceriu, Lucian Trifina |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
0209 industrial biotechnology
Speedup Degree (graph theory) Computer Networks and Communications Computer science Applied Mathematics 020206 networking & telecommunications Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology Communications system Permutation 020901 industrial engineering & automation Quadratic equation Control and Systems Engineering Simple (abstract algebra) Signal Processing 0202 electrical engineering electronic engineering information engineering Algebraic number Permutation polynomial Algorithm Computer Science::Information Theory |
| Zdroj: | Journal of the Franklin Institute. 356:3139-3168 |
| ISSN: | 0016-0032 |
| Popis: | Using more processors for parallel turbo decoding is an important issue to speed up the processing at the receiver of a communication system. Butterfly networks used to map the addresses of extrinsic values represent an elegant and simple solution in parallel turbo decoding. Recently, it has been shown that quadratic permutation polynomial (QPP) interleavers allow an easy way to compute the control bits for a butterfly network. In this paper we show that not only QPP interleavers, but any degree permutation polynomial (PP) interleavers and almost regular permutation (ARP) interleavers also allow the same easy way to compute the control bits required in butterfly networks. As a consequence, it is useful to apply the butterfly networks in parallel turbo decoding when using these performant algebraic interleavers. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect