Source: https://brevets-patents.ic.gc.ca/opic-cipo/cpd/fra/brevet/2298919/sommaire.html
Timestamp: 2020-07-14 03:51:39
Document Index: 473040816

Matched Legal Cases: ['Application No.\n30', 'art 21', 'art 21', 'art 21', 'art 21', 'art 21', 'art 21', 'art\n23', 'art 23', 'art 23', 'art 21', 'art 21', 'art 123', 'art 21']

Sommaire du brevet 2298919 - Base de données sur les brevets canadiens
Base de données sur les brevets canadiens / Sommaire du brevet 2298919
(11) CA 2298919
ENTRELACEMENT ET TURBOCAODAGE UTILISANT DES PERMUTATIONS DES NOMBRES PRIMAIRES
INTERLEAVING AND TURBO ENCODING USING PRIME NUMBER PERMUTATIONS
SUDA, HIROHITO (Japon)
SHIBUTANI, AKIRA (Japon)
NTT MOBILE COMMUNICATIONS NETWORK INC. (Non disponible)
NTT MOBILE COMMUNICATIONS NETWORK INC. (Japon)
11-42137 Japon 1999-02-19
11-98160 Japon 1999-04-05
Procédé d'entrelacement incluant la réception d'une séquence de données ayant une pluralité de blocs ayant chacun une longueur basée sur un nombre premier P ; la génération de données de permutation de séquence par l'exécution d'une opération donnée sur des éléments d'un champ de Galois d'une caractéristique P et la permutation des résultats de l'opération donnée, de sorte que des données de permutation de séquence soient générées ; et la permutation d'une séquence de données de la séquence de données en conformité avec les données de permutation de séquence.
An interleaving method includes receiving a data sequence having a plurality of blocks each having a length based on a prime number P; generating sequence permutation data by performing a given operation on elements of a Galois field of a characteristic P and permuting results of the given operation, so that sequence permutation data are generated; and permuting a sequence of data of the data sequence in accordance with the sequence permutation data.
1. An interleaving method which interleaves digital data having
K bits by using an interleaver having a buffer arranged in a
two-dimensional matrix, comprising the steps of:
generating a prime number P based on. the number K of bits of
the data and a number N of rows of the interleaver so that a number of
columns of the interleaver is determined by the prime number P;
permuting the data in each of the rows of the interleaver in
accordance with a sequence permutation table which is generated
peculiarly to each of said rows based on a primitive root of said prime
permuting an order of said rows based on a predetermined
inter-permutation pattern; and
reading out the data from the buffer of said matrix.
2. An interleaving method comprising the steps of:
(a) generating a prime number P;
(b) dividing an input sequence into N blocks B1, B2, ..., BN each
having a length equal to P where N is an integer equal to or greater than
(c) generating first sequence permutation data in which elements
of a Galois field of a characteristic P are arranged in an order of values
of exponent parts of a power notation of the elements;
(d) generating (N - 1) integers p1, p2, ..., PN-1 which are mutually
prime with respect to (P - 1);
(e) generating second through Nth sequence permutation data by
repeating, i times (i = 1 - (N - 1)), a process for generating ith
sequence permutation data by cyclically reading data in the first
sequence permutation data at intervals of pi;
(f) permuting data in the blocks B1 - BN in accordance with the
first through Nth sequence permutation data; and
(g) reading permuted data from the blocks B1 - BN in a given
3. The interleaving method as claimed in claim 2, wherein the
given order of the step (g) is based on a value of an error floor in turbo
4. The interleaving method as claimed in claim 2, wherein: there
are provided k numbers of N where k is an integer equal to or greater
than 2; the steps (c) through (e) generate K sets of first through Nth
sequence permutation data; and the step (f) selects one of the K sets of
first through Nth sequence permutation data, a selected set of first
through Nth sequence permutation data being related to one of the k
numbers of N which provides best performance.
(c) generating wroth sequence permutation data in which
elements of a Galois field of a characteristic P are arranged in an order
of values of exponent parts of a power notation of the elements;
(d) generating N integers p1, p2, ..., pN which are mutually prime
with respect to a primitive root used in the power notation;
(e) generating first through Nth sequence permutation data by
repeating, i times (i = 1 - N), a process for generating ith sequence
permutation data which is a sequence of values of exponent parts in
power notation of elements obtained by adding q i to data of the zeroth
sequence permutation data;
6. The interleaving method as claimed in claim 5, wherein the
7. The interleaving method as claimed in claim 5, wherein: there
8. An interleaving method comprising the steps of:
having a length equal to (P - 1) where N is an integer equal to or greater
than 2;
sequence permutation data at intervals of p1;
(f) permuting data in the blocks B1 - B N in accordance with the
(g) reading permuted data from the blocks B 1 - B N in a given
9. The interleaving method as claimed in claim 8, wherein the
10. The interleaving method as claimed in claim 8, wherein:
there are provided k numbers of N where k is an integer equal to or
greater than 2; the steps (c) through (e) generate K sets of first through
Nth sequence permutation data; and the step (f) selects one of the K sets
of first through Nth sequence permutation data, a selected set of first
11. An interleaving method comprising the steps of:
(b) dividing an input sequence into N blocks B1, B2, ..., B N each
having a length equal to (P + 1 ) where N is an integer equal to or
12. The interleaving method as claimed in claim 11, wherein the
13. The interleaving method as claimed in claim 11, wherein:
14. An interleaving apparatus which interleaves digital data
having K bits by using' a buffer arranged in a two-dimensional matrix,
means for generating a prime number P based on the number K
of bits of the data and a number N of rows of the interleaver so that a
number of columns of the interleaver is determined by the prime
means for permuting the data in each of the rows of the
interleaver in accordance with a sequence permutation table, which is
generated peculiarly to each of said rows based on s primitive root of
means for permuting an order of said rows based on a
predetermined inter-permutation pattern; and
means for reading out the data from the buffer of said matrix.
15. An interleaving apparatus comprising:
first means for generating a prime number P;
second means for dividing an input sequence into N blocks B1,
B2, ..., B N each having a length equal to P where N is an integer equal to
or greater than 2;
third means for generating first sequence permutation data in
which' elements of a Galois field of a characteristic P are arranged in an
order of values of exponent parts of a power notation of the elements;
fourth means for generating (N - 1) integers p1, p2, ..., p N-1:
which are mutually prime with respect to (P - 1);
fifth means for generating second through Nth sequence
permutation data by repeating, i times (i = 1 - (N - 1)), a process for
generating ith sequence permutation data by cyclically reading data in
the first sequence permutation data at intervals of p i;
sixth means for permuting data in the blocks B1 - B N in
accordance with the first through Nth sequence permutation data; and
seventh means for reading permuted data from the blocks B1 - B N
16. The interleaving apparatus as claimed in claim 15, wherein
the given order of the seventh means is based on a value of an error
floor in turbo codes.
17. The interleaving apparatus as claimed in claim 15, wherein:
greater than 2; the third through fifth means generate K sets of first
through Nth sequence permutation data; and the sixth means selects one
of the K sets of first through Nth sequence permutation data, a selected
set of first through Nth sequence permutation data being related to one
of the k numbers of N which provides best performance.
18. An interleaving apparatus comprising:
third means for generating zeroth sequence permutation data in
which elements of a Galois field of a characteristic P are arranged in an
fourth means for generating N integers p1, p2, ..., p N which are
mutually prime with respect to a primitive root used in the power
fifth means for generating first through Nth sequence
permutation data by repeating, i times (i = 1 - N), a process for
generating ith sequence permutation data which is a sequence of values
of exponent parts in power notation of elements obtained by adding q i to
data of the zeroth sequence permutation data;
19. The interleaving apparatus as claimed in claim 18, wherein
20. The interleaving apparatus as claimed in claim 18, wherein:
21. An interleaving apparatus comprising:
B2, ..., B N each having a length equal to (P - 1) where N is an integer
equal to or greater than 2;
fourth means for generating (N - 1) integers p1, p2, ..., p N-1
seventh means for reading permuted data from the blocks B1 - B N in a
22. The interleaving apparatus as claimed in claim 21, wherein
23. The interleaving apparatus as claimed in claim 21, wherein:
24. A turbo encoding method in which an interleaving method is
employed in a turbo encoder to interleave digital data having K bits by
using an interleaver having a buffer arranged in a two-dimensional
matrix, the interleaving method comprising the steps of:
generating a prime number P based on the number K of bits of
reading out the data from the buffer in a column direction of said
25. The turbo encoding method as claimed in claim 24, further
adding bits to an input sequence applied to the turbo encoder if a
number of bits of the input sequence is less than a given number of bits;
deleting bits from an encoded sequence so that an output
sequence of the turbo encoder has the same number of bits as the input
26. The turbo encoding method as claimed in claim 25, wherein
the step of adding bits employs a bit repetition method.
27. A turbo encoding method comprising, as an interleaving
method employed in a turbo encoder, the interleaving method
(d) generating (N - 1) integers p1, p2, ..., p N-1 which are mutually
sequence permutation data at intervals of p i;
(g) reading permuted data from the blocks B1 - B N in a given
28. The turbo encoding method as claimed in claim 27, further
29. The turbo encoding method as claimed in claim 28, wherein
30. A turbo encoding method comprising, as an interleaving
(b) dividing an input sequence into N blocks B1, B2, .. , B N each
(c) generating zeroth sequence permutation data in which
(d) generating N integers p1, p2, ..., p N which are mutually prime
31. The turbo encoding method as claimed in claim 30, further
32. The turbo encoding method as claimed in claim 31, wherein
33. A turbo encoding method comprising, as an interleaving
prime with respect to (P -1);
34. The turbo encoding method as claimed in claim 33, further
comprising the steps of: adding bits to an input sequence applied to the
turbo encoder if a number of bits of the input sequence is less than a
given number of bits; and deleting bits from an encoded sequence so
that an output sequence of the turbo encoder has the same number of
bits as the input sequence.
35. The turbo encoding method as claimed in claim 34, wherein
36. A turbo encoding method comprising, as an interleaving
having a length equal to (P + 1) where N is an integer equal to or
of a Galois field of a characteristic P are arranged in an order of values-
37. The turbo encoding method as claimed in claim 36, further
38. The turbo encoding method as claimed in claim 37, wherein
39. A turbo encoder comprising:
an interleaving apparatus interleaving digital data having K bits
by using a buffer arranged in a two-dimensional matrix,
said interleaving apparatus comprising:
generated peculiarly to each of said rows based on a primitive root of
40. The turbo encoder as claimed in claim 39, further
comprising: means for adding bits to an input sequence applied to the
given number of bits; and means for deleting bits from an encoded
sequence so that an output sequence of the turbo encoder has the same
number of bits as the input sequence.
41. The turbo encoder as claimed in claim 40, wherein the means
for adding bits employs a bit repetition method.
42. A turbo encoder including a plurality of encoders and an
interleaving apparatus, the interleaving apparatus comprising:
fourth means for generating (N - 1) integers p1, p2 , . . . , p N-1
43. The turbo encoder as claimed in claim 42, further
44. The turbo encoder as claimed in claim 43, wherein the means
45. A turbo encoder including a plurality of encoders and an
fourth means for generating N integers p1, p2 ..., p N which are mutually
prime with respect to a primitive root used in the power notation;
generating ith sequence permutation data which is a sequence of
values of exponent parts in power notation of elements obtained by
adding q i to data of the zeroth sequence permutation data;
46. The turbo encoder as claimed in claim 45, further
47. The turbo encoder as claimed in claim 46, wherein the means
48. A turbo encoder including a plurality of encoders and an
fourth means for generating (N - 1) integers p1, p2, . . . , P N-1
which are mutually prime with respect to (P - 1 );
49. The turbo encoder as claimed in claim 48, further
50. The turbo encoder as claimed in claim 49, wherein the means
51. An interleaving apparatus comprising:
second means for dividing an input sequence into N
blocks B1, B2, ..., B N each having a length equal to (P + 1)
where N is an integer equal to or greater than 2;
third means for generating first sequence
permutation data in which elements of a Galois field of a
characteristic P are arranged in an order of values of
exponent parts of a power notation of the elements;
fourth means for generating (N - 1) integers p1,
p2, ..., p N-1 which are mutually prime with respect to (P - 1) ;
fifth means for generating second through Nth
sequence permutation data by repeating, i times
(i = 1 - (N - 1)), a process for generating ith sequence
permutation data by cyclically reading data in the first
sixth means for permuting data in the blocks
B1 - B N in accordance with the first through Nth sequence
permutation data; and
seventh means for reading permuted data from the
blocks B1 - B N in a given order.
52. The interleaving apparatus as claimed in claim 51,
wherein the given order of the seventh means is based on a
value of an error floor in turbo codes.
53. The interleaving apparatus as claimed in claim 51,
wherein: there are provided k numbers of N where k is an
integer equal to or greater than 2; the third through fifth
means generate K sets of first through Nth sequence
permutation data; and the sixth means selects one of the K
sets of first through Nth sequence permutation data, a
selected set of first through Nth sequence permutation data
being related to one of the k numbers of N which provides
54. A turbo encoder including a plurality of encoders
and an interleaving apparatus, the interleaving apparatus
55. The turbo encoder as claimed in claim 54, further
comprising: means for adding bits to an input sequence
applied to the turbo encoder if a number of bits of the
input sequence is less than a given number of bits; and
means for deleting bits from an encoded sequence so that an
output sequence of the turbo encoder has the same number of
56. The turbo encoder as claimed in claim 54, wherein
the means for adding bits employs a bit repetition method.
CA 02298919 2004-O1-14
27879-155
INTERLEAVING AND TURBO ENCODING USING PRIME
turbo encoding technique that effectively copes with a
burst error. More particularly, the present invention is
concerned with an interleaving method, an interleaving
apparatus, a turbo encoding method, and a turbo encoder in
which pruning is not performed at all or only a small
number of bits is pruned away, so that computational
complexity can be reduced.
The present invention can be applied to fields
required to improve reliability of communications using
error correction codes, such as digital transmissions and
digital recording. The present invention is particularly
effective in fields which require flexibility of
communications such as multimedia.
Recently, a turbo encoder has been proposed
which utilizes a code having high capability in error
correction. Such a turbo encoder is made up of a
plurality of encoders, which are coupled together via an
interleaves (which is means for performing interleaving
processing) in order to reduce the correlation between
redundant sequences associated with the respective
encoders. The interleaves is a key element which
determines the performance of turbo encoding.
Figs. lA and 1B show an example of the turbo
encoder. As shown in Fig. lA, the turbo encoder includes
recursive systematic convolutional encoders 12 (RSC1) and
CA 02298919 2000-02-17
13 (RSC2), and an interleaver 11. As shown in Fig. 1B,
each of the~encoders 12 and 13 is made up of adders 14 and
15 and delay elements (D) 16 and 17 connected as shown
therein. The turbo encoder receives an input data
sequence d (K bits) and outputs encoded data sequences X1
- X3. In order to reduce the correlation between the
redundant bits X1 and X2, the interleaver 11 is provided
at the input side of the encoder (RSC2) 13. As shown in
Fig. 1C, a turbo decoder is made up to two decoders 1 and
2, two interleavers 3 and 4, and a deinterleaver 5.
In digital systems, permutation in interleaving
is performed on a given unit basis of bit or symbol. The
permutation is implemented by using a buffer or a pattern
for permutation. When the buffer is used, data is written
therein and is then read therefrom in a different sequence.
When the pattern for permutation is used, data is permuted
by referring to the pattern, which describes information
concerning a permutation based on interleaving. The
pattern described will be referred to as an interleave
A description will now be given of bit-based
permutation processing using the interleave pattern.
Fig. 2 shows interleaving of a 16-bit sequence.
In Fig. 2, a 16-bit sequence 67 is interleaved on the bit
25 unit basis by referring to an interleave pattern table 68,
which defines a sequence of interleaving. More
particularly, the zeroth to 15th bits of the sequence 67
is written into a two-dimensional buffer by the interleave
pattern table 68, and is then read therefrom in the order
of 0, 8, 4, 12, ..., as indicated by an arrow in Fig. 2.
Thus, a bit sequence after interleaving is obtained as
The interleaver involved in interleaving is
required to have the following three capabilities of:
(1) handling a variety of frame lengths (for
example, thousands to ten thousands);
(2) producing the interleaved sequence with a
small number of parameters; and
(3) reducing computational complexity in
creating the interleave pattern.
As to the first capability, if the parameters
are merely prepared for all of the different frame lengths,
10 a huge number of parameters will be prepared, and a huge
memory capacity will be required to store the parameters.
Thus, the above is impractical. There is another
disadvantage that it takes a long time to compute
respective optimal parameters for each of the different
frame lengths.
The above problems may be solved by designing
interleavers with a small number of parameters. This is
related to the second capability. Interleavers equal in
number to a power of 2 are prepared and pruning of data is
20 performed. However, pruning of data requires an increased
number of parameters for optimization, and the
interleavers may not have good performance with respect to
all of the frame lengths. That is, the interleavers have
good performance for some frame lengths but do not operate
well for other frame lengths.
Reduction in the amount of data to be pruned
away is also related to the third capability. In this
regard, the present inventors have proposed an improvement
in pruning and performance (International Application No.
30 PCT/JP98/05027). However, even the proposed improvement
has high computational complexity in producing the
interleave patterns.
In one aspect, the present invention provides an
improved interleaving technique having the above-mentioned
three capabilities.
an interleaving method, an interleaving apparatus, a turbo
encoding method and a turbo encoder capable of efficiently
achieving randomization of input sequences of a variety of
frame lengths with reduced computational complexity.
interleaving method comprising the steps of: receiving a
data sequence having a plurality of blocks each having a
length based on a prime number P; generating sequence
permutation data by performing a given operation on elements
of a Galois field of a characteristic P and permuting
results of the given operation, so that sequence permutation
data are generated; and permuting a sequence of data of the
data sequence in accordance with the sequence permutation
there is provided an interleaving method which interleaves
digital data having K bits by using an interleaver having a
buffer arranged in a two-dimensional matrix, comprising the
steps of: generating a prime number P based on the number K
of bits of the data and a number N of rows of the
interleaver so that a number of columns of the interleaver
is determined by the primer number P; permuting the data in
each of the rows of the interleaver in accordance with a
sequence permutation table which is generated peculiarly to
each of said rows based on a primitive root of said prime
number P; permuting the order of said rows based on a
predetermined inter-permutation pattern; and reading out the
data from the buffer of said matrix.
The invention provides, in a further aspect, an
interleaving method comprising the steps of: (a) generating
a prime number P; (b) dividing an input sequence into
N blocks B1, Bz, ..., BN each having a length equal to
P where N is an integer equal to or greater than 2; (c)
generating first sequence permutation data in which elements
of a Galois field of a characteristic P are arranged in an
order of values of exponent parts of a power notation of the
elements; (d) generating (N - 1) integers pl, pz, .... prr-1
which are mutually prime with respect to (P - 1); (e)
generating second through Nth sequence permutation data by
repeating, i times (i - 1 - (N - 1)), a process for
generating ith sequence permutation data by cyclically
reading data in the first sequence permutation data at
intervals of pi; (f) permuting data in the blocks B1 - BN in
accordance with the first through Nth sequence permutation
data; and (g) reading permuted data from the blocks B1 - BN
The invention also provides an interleaving method
comprising the steps of: (a) generating a prime number P;
(b) dividing an input sequence into N blocks B1, Bz, ..., BN
each having a length equal to P where N is an integer equal
to or greater than 2; (c) generating zeroth sequence
exponent parts of a power notation of the elements; (d)
generating N integers pl, pz, ..., pN which are mutually
prime with respect to a primitive root used in the power
notation; (e) generating first through Nth sequence
permutation data by repeating, i times (i - 1 - N), a
process for generating ith sequence permutation data which
is a sequence of values of exponent parts in power notation
of elements obtained by adding qi to data of the zeroth
sequence permutation data; (f) permuting data in the blocks
B1 - BN in accordance with the first through Nth sequence
permutation data; and (g) reading permuted data from the
blocks B1 - BN in a given order.
There is also provided an interleaving method
(b) dividing an input sequence into N blocks B1, B2, ..., BN
each having a length equal to (P - 1) where N is an integer
equal to or greater than 2; (c) generating first sequence
generating (N - 1) integers pl, p2, . . . , pN_1 which are
mutually prime with respect to (P - 1); (e) generating
second through Nth sequence permutation data by repeating,
i times (i - 1 - (N - 1)), a process for generating ith
sequence permutation data by cyclically reading data in the
first sequence permutation data at intervals of pi; (f)
permuting data in the blocks B1 - BN in accordance with the
first through Nth sequence permutation data; and (g) reading
permuted data from the blocks B1 - BN in a given order,
according to another aspect of the invention.
invention, there is provided an interleaving method
each having a length equal to (P + 1) where N is an integer
generating (N - 1) integers pl, pz, . - - ,
prr-1 which are
second through Nth sequence permutation data by repeating, i
times (i = 1 - (N - 1)), a process for generating ith
permuted data from the blocks B1 - BN in a given order.
there is provided an interleaving apparatus which
interleaves digital data having K bits by using a buffer
arranged in a two-dimensional matrix, comprising: means for
the data and a number N of rows of the interleaver so that a
number of columns of the interleaver is determined by the
primer number P; means for permuting the data in each of the
rows of the interleaver in accordance with a sequence
permutation table, which is generated peculiarly to each of
said rows based on a primitive root of the prime number P;
means for permuting the order of said rows based on a
predetermined inter-permutation pattern; and means for
interleaving apparatus comprising: first means for
generating a prime number P; second means for dividing an
input sequence into N blocks B1, Bz, ..., BN each having a
length equal to P where N is an integer equal to or greater
than 2; third means for generating first sequence
exponent parts of a power notation of the elements; fourth
means for generating (N - 1) integers pl, pz, . . . , pN_1 which
are mutually prime with respect to (P - 1); fifth means for
repeating, i times (i = 1 - (N - 1)), a process for
intervals of pl; sixth means for permuting data in the blocks
permutation data; and seventh means for reading permuted
data from the blocks B1 - BN in a given order.
The invention also provides an interleaving
apparatus comprising: first means for generating a prime
number P; second means for dividing an input sequence into
N blocks B1, Bz, . . . , BN each having a length equal to
P where N is an integer equal to or greater than 2; third
means for generating zeroth sequence permutation data in
which elements of a Galois field of a characteristic P are
arranged in an order of values of exponent parts of a power
notation of the elements; fourth means for generating N
integers pl, pz, ..-, pN which are mutually prime with
respect to a primitive root used in the power notation;
permutation data by repeating, i times (i = 1 - N), a
sequence permutation data; sixth means for permuting data in
the blocks B1 - BN in accordance with the first through Nth
sequence permutation data; and seventh means for reading
There is also provided an interleaving apparatus
comprising: first means for generating a prime number P;
second means for dividing an input sequence into N blocks
B1, B2, ..., BN each having a length equal to (P - 1) where N
is an integer equal to or greater than 2; third means for
elements; fourth means for generating (N - 1) integers
pl, p2, ..., pN_1 which are mutually prime with respect to
(P - 1); fifth means for generating second through Nth
sequence permutation data at intervals of pi; sixth means for
first through Nth sequence permutation data; and seventh
means for reading permuted data from the blocks B1 - BN in a
given order, according to another aspect of the invention.
invention, there is provided a turbo encoding method in
which an interleaving method is employed in a turbo encoder
to interleave digital data having K bits by using an
interleaver having a buffer arranged in a two-dimensional
primer number P; permuting the data in each of the rows of
the interleaver in accordance with a sequence permutation
table which is generated peculiarly to each of said rows
based on a primitive root of said prime number P; permuting
the order of said rows based on a predetermined
inter-permutation pattern; and reading out the data from the
buffer in a column direction of said matrix.
there is provided a turbo encoding method comprising, as an
interleaving method employed in a turbo encoder, the
N blocks B1, B2, . . . , BN each having a length equal to
elements; (d) generating (N - 1) integers pl, p2, . . . , pN-1
The invention provides, in a further aspect, a
turbo encoding method comprising, as an interleaving method
employed in a turbo encoder, the interleaving method
The invention also provides a turbo encoding
method comprising, as an interleaving method employed in a
turbo encoder, the interleaving method comprising the steps
of: (a) generating a prime number P; (b) dividing an input
sequence into N blocks B1, Bz, .-., BN each having a length
equal to (P - 1) where N is an integer equal to or greater
than 2; (c) generating first sequence permutation data in
notation of the elements; (d) generating (N - 1) integers pl,
pz, ..., pN_1 which are mutually prime with respect to
(P - 1); (e) generating second through Nth sequence
permutation data by repeating, i times (i = 1 - (N - 1)), a
process for generating ith sequence permutation data by
cyclically reading data in the first sequence permutation
data at intervals of pi; (f) permuting data in the blocks
There is also provided a turbo encoding method
comprising, as an interleaving method employed in a turbo
encoder, the interleaving method comprising the steps of:
(a) generating a prime number P; (b) dividing an input
sequence into N blocks B1, Bz, ..., BN each having a length
equal to (P + 1) where N is an integer equal to or greater
notation of the elements; (d) generating (N - 1) integers
P1. pz, .~., pN-1 which are mutually prime with respect to
blocks B1 - BN in a given order, according to another aspect
invention, there is provided a turbo encoder comprising: a
plurality of encoders; and an interleaving apparatus
interleaving digital data having K bits by using a buffer
arranged in a two-dimensional matrix, said interleaving
apparatus comprising: means for generating a prime number P
based on the number K of bits of the data and a number N of
rows of the interleaver so that a number of columns of the
interleaver is determined by the primer number P; means for
accordance with a sequence permutation table, which is
generated peculiarly to each of said rows based on a
primitive root of the prime number P; means for permuting
inter-permutation pattern; and means for reading out the
there is provided a turbo encoder including a plurality of
encoders and an interleaving apparatus, the interleaving
means for generating first sequence permutation data in
notation of the elements; fourth means for generating
(N - 1.) integers pl, pz, . . . , pN_1 which are mutually prime
with respect to (P - 1); fifth means for generating second
through Nth sequence permutation data by repeating,
i times (i = 1 - (N - 1)), a process for generating ith
first sequence permutation data at intervals of pi; sixth
means for permuting data in the blocks B1 - BN in accordance
with the first through Nth sequence permutation data; and
seventh means for reading permuted data from the blocks
B1 - BN in a given order .
turbo encoder including a plurality of encoders and an
interleaving apparatus, the interleaving apparatus
B1, Bz, ..., BN each having a length equal to P where N is an
integer equal to or greater than 2; third means for
generating zeroth sequence permutation data in which
elements of a Galois field of a characteristic P are
integers pl, pz, ..., pN which are mutually prime with
The invention also provides a turbo encoder
including a plurality of encoders and an interleaving
apparatus, the interleaving apparatus comprising: first
means for generating a prime number P; second means for
dividing an input sequence into N blocks B1, B2, ..., BN each
having a length equal to P where N is an integer equal to or
greater than 2; third means for generating first sequence
means for generating (N - 1) integers pl, p2, . . . ,
prr-1 which
intervals of pi; sixth means for permuting data in the blocks
In a further aspect the present invention
provides a turbo encoding method comprising, as an
interleaving method as described above.
The present invention also provides, in another
aspect, a turbo encoder comprising: a plurality of
encoders; and the interleaving apparatus as described above.
present invention will more apparent from the following
Figs. lA and 1B are block diagrams of a
conventional turbo encoder;
Fig. 2 is a diagram of a conventional
interleaving method of interleaving a 16-bit input data
Fig. 3 is a block diagram of a turbo encoder
Fig. 5 is a diagram illustrating a first
possible configuration of an interleaves shown in Fig. 3;
Fig. 6 shows prime numbers less than 150 and
associated primitive roots;
Figs. 7A and 7B respectively show examples of
sequence permutation tables;
Fig. 8 is a diagram illustrating a second
possible configuration of the interleaves shown in Fig. 3;
Fig. 9 is a diagram illustrating a third
Fig. 10 is a flowchart of the turbo encoder
Fig. 11 is a graph for explaining an error floor
in turbo codes;
Fig. 12 is a block diagram of a turbo encoder
Fig. 13 is a diagram illustrating a fourth
possible configuration of the interleaver shown in Fig. 3;
Figs. 14A, 14B and 14C respectively show
examples of sequence permutation tables used in the fourth
DESCRIPTTON OF THE P FFERRED EMBODTMEN'T'S
A description will be given, with reference to
the accompanying drawings, of embodiments of the present
In Fig. -3, parts that are the same as those shown in the
previously described figures are given the same reference
The turbo encoder shown in Fig. 3 differs from
that shown in Fig. lA in the following:
(a) a bit addition process part 21 is newly
(b) an interleaver of a new configuration is
A detailed description will be given of the
turbo encoder shown in Fig. 3 by further referring to a
flowchart of Fig. 10.
As preprocessing of interleaving, the bit
addition process part 21 adjusts the input sequence so
that it has a suitable number of bits for interleaving
(steps 101 - 103 shown in Fig. 10).
The bit addition process can be implemented by
various types of conventional error correction coding. In
this case, the bit addition process part 21 is a CRC
encoder. Of the various types of conventional error
10 correction coding, it is preferable to use a type of bit
repetition in which bits are periodically repeated because
it is flexible and is easily implemented.
A detailed description will be given of the bit
repetition in a case where the number of bits input to the
turbo encoder is NIN (which corresponds to K in Fig. 3).
The bit repetition includes the following four steps (1) -
At step (1), N~, is divided by 8, and the
resultant value n is obtained. The reason why NIN is
20 divided by 8 will be described later. At step (2), the
prime number P that is greater than n and closest to n is
obtained. At step (3), the difference between 8 times of
P and NIN is calculated, and the resultant value is denoted
as a: At step (4), a bits (dummy bits) are added to NIN
bits of the input sequence.
An example for NIN = 650 will be described below.
At step (1), n = 650/8 = 81.25. At step (2), the prime
number that is greater than 81.25 (= n) and closest
thereto is 83 from a table shown in Fig. 4. That is, P =
30 83. At step (3), 83*8 = 664, and thus a = 14. That is,
the number of dummy bits to be added to NIN is 14. At step
(4), 14 dummy bits are added to the input sequence of 650
(=NIN) bits. For example, the 14 dummy bits are added to
the end of the 650-bit input sequence.
The number (NIN + a) of bits thus obtained, that
is, the number (K + a) of bits in Fig. 3 is divided by 8
without exception, and the quotient is always the prime
number. The reason why 8 is used is that the number of
rows of a two-dimensional array handled at a first stage
of interleaving performed in the interleaves 22 is equal
to 8, as will be described in detail later. It is
possible to employ an arbitrary number such as 10 or 20
when the two-dimensional array used in the interleaves 22
has 10 or 20 rows. In such a case, 10 or 20 is used at
the aforementioned steps (1) - (3).
It can be seen from the above description that
the process performed by the bit addition process part 21
obtains the number of rows of the two-dimensional array at
step 101 shown in Fig. 10, and determines the number of
columns thereof which is the prime number, and adds, to
the input sequence, the number of dummy bits equal to the
difference between the product of the numbers of rows and
columns and the number of bits of the input sequence.
Besides the bit repetition, it is possible to
use block codes or convolutional codes in order to
implement the bit addition process. It is also possible
to employ a simple method of adding known bits to a known
Interleaves 22
The interleaves 22 has, for example, one of
three different configurations described below.
30 Fig. 5 shows the first configuration of the
interleaves 22. The interleaves 22 having the first
configuration includes the first, second and third stages
41, 42 and 43. The first stage 41 corresponds to step 104
shown in Fig. 10. The second stage 42 corresponds to
steps 105 - 108 shown in Fig. 10. The third stage 43
corresponds to step 109 shown in Fig. 10.
~1) First stage 41:
5 An input sequence 40 (that is the output of the
bit addition process part 21 and consists of, for example
664 bits) is divided into N. In Fig. 5, the 664-bit input
sequence 40 is divided into eight blocks B1 - B8, which are
then written into a two-dimensional array (buffer), which
10 consists of 8 rows and 83 columns. It will be noted that
the 664-bit input sequence 40 includes 650 information
bits and 14 dummy bits. The input sequence 40 of 664 bits
can be divided by 8 and the quotient thereof is the prime
number 83. Thus, the number of rows of the two-
15 dimensional buffer is 8, and the number of columns thereof
is the prime number 83.
_(2Ji Second stage 42:
An intra-permutation is performed, as will be
described later. In the intra-permutation, the sequence
20 of the bits arranged in each row is permuted.
~3) Third stage 43:
An inter-permutation is performed in which the
order of the rows arranged in the two-dimensional buffer
is permuted. The inter-permutation uses, for example, a
25 inter permutation pattern obtained by learning (directed
to lengthening the free distance). One row is the unit of
the inter-permutation.
After the first through third stages are
performed, data is read from the two-dimensional buffer in
30 the longitudinal direction (column direction) at step 110
shown in Fig. 10, whereby an interleaved coded sequence 44
A further description will now be given of the
second stage 42.
The intra-permutation at the second stage 42
uses a table created by the following steps S1 - S7 as an
address table, and processes input data written into the
two-dimensional buffer by referring to the address table.
Step S1 is to obtain the primitive root g° of
the Galois field of the characteristic P (which
corresponds to the number of columns and is equal to 83 in
the case shown in Fig. 5) at step 105 shown in Fig. 10,
and to create a table t0 described in the order of
exponential (power) notation of the primitive root in
which the elements of the Galois field are expressed by
anti-logarithms, which are arranged in the order of
exponential notation. The primitive root go of the Galois
field of the characteristic P can be chosen from the table
shown in Fig. 6. In other words, step S1 is to compute a
mapping sequence c(i) for intra-row permutation defined
c(i) _ (gol) (mode)
where i = 0, 1, 2, ..., (P-2), and c(P-1) = 0.
In the case of P = 83, the primitive root go
(which corresponds to q in Fig. 6) of 83 is 2, and the
elements of the associated Galois field are 0, 1, 2, ...,
82. Thus, c(0), c(1), c(2), ..., c(82) are as follows:
c(0), c(1), c(2), ..., c(82)
30 - 2°(mod83) , 21(mod83) , 22(mod83) , . . . , 28z(mod83)
- 1, 2, 4, 8, 16, 32, 64, 45, 7, 14, .. , 42, 0
The table t0 can be formed from the above one-
dimensional sequence, as shown in Fig. 7B, in which the
combination of the numerals arranged in the transverse-
axis and longitudinal-axis directions of the table t0
describes the exponent. For example, the combination of
numerals of 1 and 6 respectively in the transverse- and
longitudinal-axis directions indicates an exponent of 16.
It can be seen from the table t0 that the results of, for
example, 2z(mod83) and 216(mod83) are respectively 4 and 49.
The result of 282(mod83) is set equal to 0.
The table t0 is defined as a sequence
permutation table for the first row of the two-dimensional
buffer. Step S2 corresponds to a case when a parameter I
indicative of the row number is set equal to 1 at step 106
shown in Fig. 10. That is, the numbers defined in the
sequence permutation table t0 indicate the bit allocations
after permutation. As shown in Fig. 7B, the sequence
permutation table t0 includes the one-dimensional sequence
(pattern) starting from the left uppermost position
Table t0: 1, 2, 4, 8, 16, ..., 42, 0 ...(1)
For example, let us assume that the input data
25 mapped into the first row of the two-dimensional buffer is
A0, A1, A2, A3, ..., A82 ...(2)
The bits in the first row of the two-dimensional buffer
are permuted by referring to the sequence permutation
table t0. For example, bits AO and A1 which correspond to
"1" and "2" in the sequence permutation table t0 are
placed in the original positions even after permutation.
Bit A2 which corresponds to "4" in the table t0 is
permuted so as to be located in the fourth position after
permutation. Similarly, bit A3 which corresponds to "8"
in the table t0 is permuted so as to be located in the
eighth position after permutation. Bit A82 which
corresponds to the last number "0" in the table t0 is
placed in the original position. The above permutation is
performed at step 107 shown in Fig. 10.
The data obtained after permutation of sequence
(2) has the following sequence:
A0, A1, A72, A2, A27, A76, A8, ..., A82 ...(3)
Sten S3:
Step S3 is to obtain (N - 1) numbers (integers)
which have the mutually prime relationship with respect to
(P - 1) where N is an integer greater than 2 and denotes
the number of rows. In the example being considered, P =
83 and N = 8. Thus, 7 (= 8 - 1) integers which are
numbers pl, p2, p3, p4, p5, p6 and p7 that have the
mutually prime relationship with respect to 82 (= P - 1 =
83 - 1) are obtained. The 7 integers pl, p2, p3, p4, p5,
p6 and p7 are respectively 3, 5, 7, 11, 13, 17 and 19 (1
and 2 are excluded).
At step 108 of Fig. 10, it is determined whether
I is smaller than N (the number of rows). If the answer
of step 108 is YES, the process returns to step 107. In
the example being considered, I is incremented by 1 and is
then equal to 2. Then, a sequence permutation table for
permutation of data in the second row is created as
follows. Data is cyclically read from the sequence
permutation table t0 one by one at intervals of pl, and a
sequence thus obtained is denoted as tl. For example,
when data is circularly read from the sequence permutation
table t0 at intervals of 3, the sequence tl is obtained:
tl: 1, 16, 7, 29, 49, ... ...(4)
The sequence t1 thus obtained is formed into sequence
permutation table tl.
10 The above process is also performed by computing
the following (mathematically equivalent thereto):
c(i) _ (911) (mod83)
15 where gl is the primitive root obtained from gl =
( gol ) ( mod83 ) .
Stey~ S5:
The table tl obtained at step S4 is defined as a
sequence permutation table which is referred to when the
20 order of data arranged in the second row of the two-
dimensional buffer is permuted.
Steps 4 and 5 are repeated by using p2, p3, p4,
p5, p6 and p7, so that sequences t2 - t7 can be obtained.
25 The sequences t2 - t7 are formed into tables t2 - t7,
which are defined as sequence permutation tables referred
to at the time of permutation of the third to eighth rows
of the two-dimensional buffer. That is, steps 106 - 108
shown in Fig. 10 can be described as follows.
30 First, prime numbers li which satisfy the
following are obtained where i = 2 - r, and r is the
number of rows of the two-dimensional array:
(i) (83-1, li) = 1 (82 and li are mutually
prime); and
(ii) li > 6.
5 For r = 8, the prime numbers 12 - 18 are those to
be obtained, and are respectively 7, 11, 13, 17, 19, 23
and 19 from the table shown in Fig. 6. Then, the pieces
of data in the table t0 are cyclically read one by one at
intervals of li, so that the sequence permutation tables
10 t2 - t7 can be created. In this case, the number "0"
located at the end of the table t0 is excluded in the read
StP,~ 7:
The data arranged in the first through eighth
15 rows of the two-dimensional buffer in which the blocks B1
- Be are written are permuted in accordance with the
sequence permutation tables t0 - t7. More particularly,
the sequence of the data of the block B1 is permuted in
accordance with the sequence permutation table t0.
20 Similarly, the sequence of the data of the block BZ is
permuted in accordance with the sequence permutation table
tl. The same process is carried out for each of the
blocks BZ - B,. Finally, the sequence of the data of the
block Be is permuted in accordance with the sequence
25 permutation table t8.
As described above, the sequence permutation
tables t0 - t7 are created, and then the permutation
process for the blocks B1 - Be is performed. Alternatively,
as shown in Fig. 10, the creation of the sequence
30 permutation table and the permutation process are
successively carried out for every block.
The process of the second stage can be designed
so that the sequence permutation tables are prepared and
recorded beforehand and the permutation process refers to
the tables recorded beforehand.
(Second configuration of the interleaves 22)
A description will now be given of the second
configuration of the interleaves 22, which is the same as
that above except for the second stage. The permutation
process of the second stage is implemented by referring to
tables created by steps S11 - S15 described below.
Step S11 is the same as the aforementioned step
S1. That is, step S11 is to obtain the primitive root go
of the Galois field of the characteristic P and to create
a table TO described in the order of exponential notation
of the primitive root in which the elements of the Galois
15 field are expressed by anti-logarithms, which are arranged
in the order of exponential notation. It will be noted
that table TO is the same as table t0 shown in Fig. 7B.
Step S12 is to obtain eight integers which have
the mutually prime relationship with respect to the
primitive root go and are equal in number to the rows of
the two-dimensional buffer. Let the eight numbers be
denoted as ql, q2, q3, q4, q5, q6, q7 and q8. When the
prime number P is equal to 83, for example, the primitive
root is equal to 2 and the eight integers which are prime
numbers are obtained as follows:
3, 5, 7, 11, 13, 17, 19 and 21
(except for 1 and 2).
30 The prime number ql is added (mode) to each of
the items of data of the table TO obtained at step 512.
When the table TO defines the following sequence:
T0: 1, 2, 4, 8, 16, ..., 42, 0, ...(5)
the resultant sequence for ql = 3 is as follows:
4, 5, 7, 11, 19, ..., 3 ...(6).
Then, the anti-logarithm values thus obtained
are converted into values in exponential notation. The
following are obtained by a table of Fig. 7A that is the
reverse operation of Fig. 7B:
- 2, 27, 8, 24, ..., 7, 72 ...(7).
Sequence (7) thus obtained is formed in a table,
which is used as a sequence permutation table T1 for the
first row of the two-dimensional buffer.
Similarly, step S13 is repeated using q2, q3, q4,
q5, q6, q7 and q8, so that sequence permutation tables T2
- T8 respectively used for permutation of the second
20 through eight rows of the two-dimensional buffer can be
The intra-permutation of the blocks B1 - B8 is
performed in accordance with the sequence permutation
tables T1 - T8.
It is possible to prepare and record the
sequence permutation tables T1 - T8 beforehand in a memory.
30 Fig. 9, of the third configuration of the interleaver 22.
Referring to Fig. 9, an input sequence 80
consisting of 1140 bits is written into an interleaver 600
having a two-dimensional buffer of a 72 x 16 array. Then,
each row of the 72 x 16 interleaves 600 is read for every
16 bits. The first row of the interleaves 600 is
interleaved by using a 4 x 4 interleaves 610, and the
second row thereof is interleaved by using a 6 x 3
5 interleaves 620. Similarly, the third row of the
interleaves 600 is interleaved by an 8 x 2 interleaves 630.
That is, the respective rows are interleaved by the
different interleavers. Alternatively, an identical
interleaves may be used to interleave each of the rows of
10 the two-dimensional array. It is also possible to use an
identical interleaves for some rows of the two-dimensional
Then, the data thus interleaved are read in the
longitudinal direction (0, 16, 32, 48, ...), so that an
15 output data sequence 90 can be obtained.
Since the last row of the buffer consists of
only four bits, a 4 x 1 interleaves is applied thereto.
However, the 4 x 4 or 2 x 2 interleaves may be used for
the last row. The data of the last row can be read
20 therefrom in the order of 1136, 1137, 1138 and 1139.
However, in Fig. 9, the data of the last row are read in
the reverse order, namely, 1139, 1138, 1137 and 1136.
It is also possible to read data from the 72 x
16 interleaves except for the last row and to thereafter
25 read the data of the last row and place them at given
The interleaves 22 can be formed of any of the
first through third configurations. After the interleaved
data is produced by the interleaves 22, step 110 of Fig.
30 10, that is, the third state 43 shown in Figs. 5 and 8 is
In the first and second configurations of the
interleaves 22, the process at step 110 shown in Fig. 10
can be modified so as to prevent occurrence of a pattern
which causes an error floor of the turbo codes.
Fig. 11 is a graph showing an error floor. The
error floor denotes a phenomenon in which the bit error
rate (BER) is not improved as much as the S/N ratio is
improved. In the graph of Fig. 11, the error floor starts
to occur when the bit error rate is equal to 10-' to 10-e,
and is not much improved even when the bit error rate is
10 With the above phenomenon in mind, it is
preferable to read the data from the two-dimensional array
(buffer) in a fixed order but any of a plurality of
predetermined orders. That is, it is preferable to
determine the order of reading the data from the two-
dimensional buffer after the intra-permutation on the
basis of the value of the error floor. Thus, it is
possible to suppress the occurrence of the error floor in
the turbo codes. If the input sequence is divided into 10
blocks B1 - Blo , the data is read from the blocks Blo , B9 , Be ,
2 0 B, , B6 , Bs , B4 ~ B3 , Bz and Bl in this order . I f the input
sequence is divided into 20 blocks B1 - Bzo, the data is
read from the blOCkS B19 , B9 , B14 , B4 , Bo , BZ , Bs , B., , Bi2 , Bie
Bis , Bis , Bl , Bis , B3 , Bi , Bs , Bii , B8 and Bio in this Order .
It is also possible to read the data from Bl9 , B9 , B14 , B4 ,
2 5 Bo , Bz , Bs , B~ , Bl2 , Ble , Blo , Be , Bis ~ Bm ~ Bs ~ Bi ~ Bis ~ Bs ~
and Bll .
One of the predetermined orders of reading the
data is selected so that the occurrence of the error floor
can be suppressed. As described above, when the input
30 sequence is divided into 10 blocks, data written into the
two-dimensional buffer is read therefrom in the reverse
direction. This is simple and is implemented easily.
The conventional turbo encoder shown in Fig. lA
receives the K-bit input sequence and outputs the (3*K +
T1 + T2)-bit encoded output where T1 is the number of tail
bits output from RSC1, and T2 is the number of tail bits
output from RSC2.
In contrast, in the turbo encoder shown in Fig.
3, the bit addition process part 21 adds the a dummy bits
to the N bits of the input sequence, so that the (N + a)
bits are applied to the interleaves 22, RSC1 and RSC2.
10 That is, 3a bits are auxiliary bits in total. In order to
delete the 3a auxiliary bits, the puncturing process part
23 performs a puncturing process for the 3a auxiliary bits.
A method of periodically deleting the redundant bits is
generally used for the puncturing process suitable for the
15 turbo codes. The above method can be applied to the
puncturing process part 23. Thus, the output of the
puncturing process part 23 receives (3K + 3a + Tl + T2)
bits and outputs (3K + T1 and T2) to the next stage.
20 Fig. 12 is a block diagram of a turbo encoder
In Fig. 12, parts that are the same as those shown in Fig.
3 are given the same reference numbers. The turbo encoder
shown in Fig. 12 has the bit addition process part 21 that
25 is placed at the input side of only the interleaves 22.
That is, the encoded sequence X1 is the same as the input
data sequence from an information source. Further, the
RSC1 processes the input data sequence from the
information source as per se. In order to delete the
30 dummy bits added to the input data sequence by the bit
addition process part 21, a pruning process part 123 is
provided between the interleaves 22 a.nd the RSC 2. The
interleaves 22 has one of the aforementioned first through
third configurations. Now, a fourth configuration of the
interleaves 22 will be described.
The fourth configuration of the interleaves 22
can be obtained by slightly modifying the first or second
configuration. Such a modification is an improvement in
obtaining the prime number, namely, the number of columns
of the two-dimensional array. This will be described in
The bit addition process part 21 operates as
follows. At step (1), NIN is divided by 8, and the
resultant value n is obtained. At step (2), the prime
number P that is greater than n and closest to n is
obtained. Further, (P - 1) and (P + 1) are prepared.
Then, one of the numbers P, (P - 1) and (P + 1) that is
15 equal to or greater than n and is closest to n is chosen.
At step (3), the difference between 8 times of P and NON is
calculated, and the resultant value is denoted as a. At
step (4), 4 bits (dummy bits) are added to NIN bits of the
20 An example for NIN = 660 will be described below.
At step (1), n = 660/8 = 82.25 (the quotient is 82, and
the remainder is 4). At step (2), the prime number P that
is greater than 82.25 (= n) and closest thereto is 83 from
the table shown in Fig. 4. Further, (P - 1) - 82, and (P
25 + 1) - 84. Since the number 83 is greater than 82.25 and
is closed thereto, the number 83 is chosen. At step (3),
83*8 = 664, and thus a = 4. That is, the number of dummy
bits to be added to NIN is 4. At step (4), 4 dummy bits
are added to the input sequence of 660 (=NIN) bits. For
30 example, the 4 dummy bits are added to the end of the 660-
bit input sequence.
is, the number of (K + a) bits in Fig. 3 is divided by 8
without exception, and the quotient is always any of the
prime number P, (P - 1) and (P + 1).
If the prime number P is chosen at step (2), the
sequence permutation tables can be created by the manner
that has been described with reference to Fig. 5. However,
if (P - 1) or (P + 1) is chosen, for example, if 82 or 84
is chosen, the two-dimensional array has 82 or 84 columns,
and thus the sequence permutation tables associated with P
- 83 are not used. The sequence permutation tables
10 suitable for 82 or 84 columns can be created by modifying
the aforementioned sequence permutation table t0 for 83
columns, as described below.
Fig. 14A shows the sequence permutation table t0
for the first row of the two-dimensional array having 83
15 columns, which is the same as that shown in Fig. 7B. The
sequence permutation table for the first row of the array
having 82 columns (let t0_1 be that table) is obtained by
deleting "0" located at the end of the sequence of the
table t0 for 83 columns. That is, the one-dimensional
20 sequence t0_1 for 82 columns is as follows:
t0_1: 1, 2, 4, 8, 16, ..., 42.
The table t0_1 ranges from element 1 to element
25 82, and 1 is subtracted from each of all the elements.
The resultant table ranges from element 0 to element 81,
and is used as the sequence permutation table t0_1 for the
first row for 82 columns.
The sequence permutation table for the first row
30 of the array having 84 columns (let t0+1 be that table) is
obtained by adding the prime number P to the position next
"0" located at the end of the sequence for 83 columns.
That is, the one-dimensional sequence t0,1 for 84 columns
t0+1: 1, 2, 4, 8, 16, ..., 42, 0, 83.
5 By executing steps 106 - 108 shown in Fig. 10,
sequence permutation tables tl - t7, tl_1 - t7_1, and tl,~ -
t7+1 for the second through eight rows of the arrays having
83, 82 and 84 columns can be created, respectively. It is
possible to create and record the above tables beforehand.
10 The use of (P - 1) and (P + 1) makes it possible
to decrease the difference between the number of the input
data sequence and the number of bits (equal to the number
of columns) processed by the interleaves 22 and to reduce
the number of bits to be deleted by the pruning process.
15 The process of the fourth configuration of the
interleaves 22 shown in Fig. 12 can be applied to the
interleaves 22 shown in Fig. 3.
Another modification can be made. In the first
and second embodiments of the present invention, the input
20 data sequence is divided into the fixed number of blocks.
This can be modified so that k different numbers of blocks
for division can be used where k is an integer equal to or
greater than 2. Thus, k interleavers are created, and one
of them which brings the best performance is chosen and
25 used.
Let us consider a case where k = 10 and 20 and
the input data sequence applied to the interleaves 22
consists of 640 bits. For k = 10, the 640-bit input data
sequence is divided into 10 blocks, and the sequence
30 permutation tables for the 10 blocks are labeled #1. For
k = 20, the 640-bit input data sequence is divided into 20
32-bit blocks, and the sequence permutation tables for the
20 blocks are labeled #2. Then, one of the sets #1 and #2
of interleavers which provides the better bit error rate
and/or the frame error rate is selected. The input data
sequences consisting of different numbers of bits should
be divided into different numbers of blocks in terms of
5 the bit/frame error rate. That is, the number of blocks
is adaptively changed taking into consideration the number
of bits forming the input data sequence. Thus, it is
possible to improve the performance of the turbo encoder.
specifically described embodiments, variations and
modifications, and other variations and modifications may
be made without departing from the scope of the present
Date de délivrance prévu 2006-04-18
(22) Dépôt 2000-02-17
(41) Mise à la disponibilité du public 2000-08-19
(45) Délivré 2006-04-18
Expiré 2020-02-17
Enregistrement de documents 100,00 $ 2000-02-17
Dépôt 300,00 $ 2000-02-17
Taxe de maintien en état - Demande - nouvelle loi 2 2002-02-18 100,00 $ 2002-01-28
Taxe de maintien en état - Demande - nouvelle loi 3 2003-02-17 100,00 $ 2003-01-03
Taxe de maintien en état - Demande - nouvelle loi 4 2004-02-17 100,00 $ 2004-01-07
Taxe de maintien en état - Demande - nouvelle loi 5 2005-02-17 200,00 $ 2005-01-13
Taxe de maintien en état - Demande - nouvelle loi 6 2006-02-17 200,00 $ 2006-01-11
Taxe Finale 300,00 $ 2006-01-31
Taxe de maintien en état - brevet - nouvelle loi 7 2007-02-19 200,00 $ 2007-01-08
Taxe de maintien en état - brevet - nouvelle loi 8 2008-02-18 200,00 $ 2008-01-07
Taxe de maintien en état - brevet - nouvelle loi 9 2009-02-17 200,00 $ 2009-01-13
Taxe de maintien en état - brevet - nouvelle loi 10 2010-02-17 250,00 $ 2010-01-13
Taxe de maintien en état - brevet - nouvelle loi 11 2011-02-17 250,00 $ 2011-01-24
Taxe de maintien en état - brevet - nouvelle loi 12 2012-02-17 250,00 $ 2012-01-16
Taxe de maintien en état - brevet - nouvelle loi 13 2013-02-18 250,00 $ 2013-01-09
Taxe de maintien en état - brevet - nouvelle loi 14 2014-02-17 250,00 $ 2014-01-08
Taxe de maintien en état - brevet - nouvelle loi 15 2015-02-17 450,00 $ 2015-01-28
Taxe de maintien en état - brevet - nouvelle loi 16 2016-02-17 450,00 $ 2016-01-27
Taxe de maintien en état - brevet - nouvelle loi 17 2017-02-17 450,00 $ 2017-01-25
Taxe de maintien en état - brevet - nouvelle loi 18 2018-02-19 450,00 $ 2018-01-24
Taxe de maintien en état - brevet - nouvelle loi 19 2019-02-18 450,00 $ 2019-01-23
SUDA, HIROHITO
Dessins 2004-01-14 14 280
Revendications 2004-01-14 19 595
Description 2004-01-14 33 1 319
Abrégé 2000-02-17 1 15
Description 2000-02-17 24 943
Dessins représentatifs 2000-08-15 1 29
Revendications 2000-02-17 24 715
Dessins 2000-02-17 14 282
Revendications 2005-02-10 22 702
Page couverture 2000-08-15 1 55
Dessins représentatifs 2006-03-21 1 34
Page couverture 2006-03-21 1 63
Poursuite-Amendment 2004-01-14 38 1 333
Cession 2000-02-17 3 128
Correspondance 2000-03-07 65 2 131
Poursuite-Amendment 2003-09-08 2 71
Poursuite-Amendment 2004-10-01 2 36
Poursuite-Amendment 2005-02-10 9 284
Correspondance 2006-01-31 1 38