Intra-row permutation for turbo code
AssigneeNortel Networks Limited
InventorsBin Li, Wen Tong
Life of this patent
Estimating the term…
Abstract
An interleaver in which a frame of data to be interleaved is stored in at least a portion of an array having R rows and C columns, the portion having Nr(l) rows and Nc(l) columns that satisfy the inequality Nr(l)×Nc(l−1)<L<Nr(l)×Nc(l) where Nc(l) is a prime number and Nc(l−1) is the highest prime number less than Nc(l). The elements of each row are permuted according to a predetermined mathematical relationship, and the rows are permuted according to predetermined mapping.
Claims20
A method of interleaving elements of frames of data, the method comprising:
- providing a storage array c of R rows and C columns, where R and C are positive integers;
- storing a frame of data comprising a plurality L of elements in a working array within the storage array c, the working array having Nr(l) rows and Nc(l) columns, where:
- Nr(l) is a positive integer no greater than R;
- Nc(l) is a prime number no greater than C;
- and
- Nr(l)×Nc(l−1)<L<Nr(l)×Nc(l);
- where Nc(l−1) is the highest prime number less than Nc(l), and
- for each row of the storage array c, permuting the elements of the row according to a predetermined mathematical relationship.
An interleaver for interleaving elements of frames of data, the interleaver comprising:
- a memory containing at least a storage array c of R rows and C columns, where R and C are positive integers;
- a memory read-write circuit storing a frame of data comprising a plurality L of elements in a working array within the storage array c, the working array having Nr(l) rows and Nc(l) columns, where:
- Nr(l) is a positive integer no greater than R;
- Nc(l) is a prime number no greater than C;
- and
- Nr(l)×Nc(l−1)<L<Nr(l)×Nc(l);
- where Nc(l−1) is the highest prime number less than Nc(l), and
- an ALU adapted, for each row of the storage array c, to permute the elements of the row according to a predetermined mathematical relationship.
An interleaver for interleaving elements of frames of data, the interleaver comprising:
- memory means containing at least a storage array c of R rows and C columns, where R and C are positive integers;
- memory read-write means for storing a frame of data comprising a plurality L of elements in a working array within the storage array c, the working array having Nr(l) rows and Nc(l) columns, where:
- Nr(l) is a positive integer no greater than R;
- Nc(l) is a prime number no greater than C;
- and
- Nr(l)×Nc(l−1)<L<Nr(l)×Nc(l);
- where Nc(l−1) is the highest prime number less than Nc(l), and
- logic means for permuting, for each row of the storage array c, the elements of the row according to a predetermined mathematical relationship.
Dependencies are inferred from the claim text.