Turbo interleaving apparatus and method
DCFirst Claim
Patent Images
1. A turbo encoder comprising:
- a first encoder for encoding a frame of input information bits to generate first coded symbols;
an interleaver for receiving the information bits and interleaving the information bits position such that an information bit existing at the last position of the frame is shifted to a position preceding the last position for not generating Critical Information Sequence Pattern (CISP); and
a second encoder for encoding the interleaved information bits to generate second coded symbols.
2 Assignments
Litigations
0 Petitions
Accused Products
Abstract
A 2-dimensional interleaving method is disclosed. The method comprises dividing a frame of input information bits into a plurality of groups and sequentially storing the divided groups in a memory; permuting the information bits of the groups according to a given rule and shifting an information bit existing at the last position of the last group to a position preceding the last position; and selecting the groups according to a predetermined order, and selecting one of the information bits in the selected group.
60 Citations
16 Claims
-
1. A turbo encoder comprising:
-
a first encoder for encoding a frame of input information bits to generate first coded symbols;
an interleaver for receiving the information bits and interleaving the information bits position such that an information bit existing at the last position of the frame is shifted to a position preceding the last position for not generating Critical Information Sequence Pattern (CISP); and
a second encoder for encoding the interleaved information bits to generate second coded symbols. - View Dependent Claims (2, 3, 4)
a controller for writing the information bits sequentially in memory and dividing the information bits into R groups each having the C information bits;
permuting the address of the information bit written in a jth row (where, j=0,1,2, . . . , R−
1) to positions Cj(i) in the row in accordance with an algorithm given byi) C(i)=[g0×
C(i−
1)] mod p, i=1,2, . . . , (p−
2) and C(0)=1ii) Cj(i)=C([i×
pj] mod (p−
1)),j=0,1,2, . . . , (R−
1), i=0,1,2, . . . , (p−
1), Cj(p−
1)=0, and Cj(p)=piii) exchange CR−
1(p) with CR−
1(0)where p (prime number) indicates a prime number which is closest to K/R, g0 (primitive root) indicates a predetermined number corresponding to p, and pj indicates a primitive number set.
-
-
3. The turbo encoder as claimed in claim 2, wherein the interleaver comprises:
-
a memory for storing the information bit frame sequentially;
a randomizer for permuting the address of the stored informnation bits according as shifting the address of an informnation bit existing at the last position to a position preceding the last position in the last group.
-
-
4. The turbo encoder as claimed in claim 3, wherein the randomizer exchanges an information bit address existing at the last position of the last group with an information bit address existing at a first position of the last group.
-
5. A device for permuting information bit addresses of an input frame which have R groups each having C information bits in a prime interleaver (PIL) used as an internal interleaver for a turbo encoder, the device comprising:
-
a memory for storing the information bit frame sequentially;
a randomizer for permuting the addresses of the information bit and changing the address of an last information bit to a position preceding the position in the last group. - View Dependent Claims (6)
-
-
7. A device for interleaving a frame of K information bits which have R groups each having C information bits in a PIL interleaver used as an internal interleaver for a turbo encoder, the device comprising:
-
a controller for writing input information bits of a frame in a memory sequentially and permuting the position of the information bits written in a jth row (where, j can be 0,1,2, . . . , or R−
1) to position Cj(i) in the row in accordance with an algorithm given byi) permute a base sequence C(i)=[g0×
C(i−
1)] mod p, i=1,2, . . . , (p−
2) and C(0)=1ii) perform row permutation Cj(i)=C([i×
pj] mod (p−
1)), j=0,1,2, . . . , (R−
1), i=0,1,2, . . . , (p−
1), Cj(p−
1)=0, and Cj(p)=piii) exchange CR−
1(p) with CR−
1(0)where p (prime number) indicates a prime number which is closest to K/R, g0 (primitive root) indicates a predetermined number corresponding to p, and pj indicates a primitive number set.
-
-
8. A 2-dimensional interleaving method comprising the steps of:
-
storing a frame of K input information bits into a memory sequentially and dividing an information bits into R groups each having C information bits;
permuting the information bits addresses of the each group according to a given rule; and
changing an information bit address existing at the last position of the last group to a address preceding the last position. - View Dependent Claims (9, 10)
determining a minimum prime number p which is closest to K/R, sequentially writing input sequences of information bits of a frame in a memory; selecting a primitive root g0 corresponding to the minimum prime number p, and generating a base sequence C(i) for intra-row permuting the input sequences written in the rows in accordance with
-
-
10. The 2-dimensional interleaving method as claimed in claim 8, wherein an information bit address existing at the last position of the last group is exchanged with an information bit address existing at a first position of the last group.
-
11. A 2-dimensional interleaving method comprising the steps of:
-
writing input sequences of a frame of input information bits which have R groups each having C information bits in a memory;
permuting the address of the information bits written in memory according to a given rule;
shifting an address of an information bit written in the last position of the last group to a position preceding the last group. - View Dependent Claims (12)
-
-
13. A method for interleaving a frame of input information bits which have R groups each having C information bits in a PIL interleaver used as an internal interleaver for a turbo encoder, the method comprising the steps of:
-
a) permuting the information bits position of the groups according to predetermined PIL interleaving rule;
b) changing an information bit existing at the last position of the frame to a position preceding the last position. - View Dependent Claims (14, 15)
i) calculating C(i)=[g0×
c(i−
1)] mod p, i=1,2, . . . , (p−
2) and C(0)=1ii) calculating Cj(i)=C([i×
pj] mod(p−
1)), where j=0,1,2, . . . , (R−
1), i=0,1,2, . . . , (p−
1), Cj(p−
1)=0, and Cj(p)=piii) exchanging CR−
1(p) with CR−
1(0)where p (prime number) indicates a prime number which is closest to K/R, g0 (primitive root) indicates a predetermined number corresponding to p, pj indicates a primitive number set, and cj(i) is the input bit position of an ith output after the permutation of a jth row.
-
-
16. A 2-dimensional interleaving method comprising the steps of:
-
sequentially writing input sequences of information bits of the frame in an R×
C rectangular matrix;
selecting a primitive root g0 corresponding to the minimum prime number p, and generating a base sequence c(i) for intra-row permuting the input sequences written in the rows in accordance with
-
Specification