Interleaver for use in turbo coding
An interleaver (100) is for re-arranging in each of L cycles a first set of K data elements into a second set of K data elements using a permutation vector which defines, based on the calculation in each cycle of a cm, an even number of pairs of positions of in the first set to be swapped, wherein c...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | An interleaver (100) is for re-arranging in each of L cycles a first set of K data elements into a second set of K data elements using a permutation vector which defines, based on the calculation in each cycle of a cm, an even number of pairs of positions of in the first set to be swapped, wherein cm satisfies a quadratic congruence condition. A processor (103) computes for each of the L cycles a value of the sequence cm and, based on the value, a set of indexes indicating at least two pairs of elements to be swapped, 15 and a processor (101) swaps in each cycle pairs of indicated elements, the swapping of pairs in each cycle being done together in a parallel swapping operation. |
|---|