Turbo interleaving apparatus and method
AssigneeSamsung Electronics Co., Ltd.
InventorsMin-Goo Kim, Beong-Jo Kim, Soon-Jae Choi, Young-Hwan Lee
Life of this patent
Estimating the term…
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.
Claims16
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.
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.
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 by
- i) permute a base sequence C(i)=[g0×C(i−1)] mod p, i=1,2, . . . , (p−2) and C(0)=1
- ii) 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)=p
- iii) 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.
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.
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.
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.
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
- C(i)=[g0×C(i−1)] mod p, i=1,2, . . . , (p−2), and C(0)=1;
- calculating a minimum prime integer set {qj}(j=0,1,2, . . . , R−1) by determining
- g.c.d{qj,p−1}=1
- qj>6,qj>q(j−1)
- where g.c.d is a greatest common divider and q0=1;
- intra-row permuting {qj} using
- pP(j)=qj, j=0,1, . . . , R−1
- where P(j) indicates a predetermined selecting order for selecting the R rows;
- when C=p+1, permuting sequences in a jth row in accordance with
- 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)=p,
- and if (K=C×R), then CR−1(p) is exchanged with CR−1(0)
- selecting R rows according to a predetermined order P(j), and selecting one input sequence from the selected row;
- and
- providing the selected input sequence as a read address for interleaving the information bits of the input frame.
Dependencies are inferred from the claim text.