Interleaving method and system

An interleaving system for transmitting data, the system comprising:

• a write address value calculation unit which sequentially calculates write address values in a memory for sequentially storing data according to a predetermined write address value calculation process;
• and
• a read write address value calculation unit which sequentially calculates read address values of the memory for sequentially reading data according to a predetermined read address value calculation process,
• wherein the memory has N data banks, each data bank has M storage spaces, there are D interleaving target data having data numbers A,
• N, M and D are integers not less than one, and A is an integer not less than zero,
• the storing data includes storing the data at storage spaces of data banks, the storage spaces corresponding to integer values obtained by dividing the data numbers A by a result of dividing the total number of data D by the number of storage spaces M, and obtaining the data banks corresponding to remainders obtained by dividing the data numbers A by the result of dividing the total number of data D by the number of storage spaces M, and
• the reading data comprises determining integer values E corresponding to remainders obtained by dividing a sum of readout numbers B and a cyclic interleaving value Q by the number of storage spaces M according to readout order by data bank, determining integer values C and remainders S by dividing the integer values E by a tone interleaving value L, determining the read address values by multiplying the remainders S by the result of the number of storage spaces M divided by the tone interleaving value L, and adding the integer values C and reading data corresponding to the read address values, M being an integer not less than one, L being integers not less than zero and not more than M, B and Q being integers not less than zero, L being an integer not less than two, S being an integer not less than zero and not more than L, and C being an integer not less than zero.

A deinterleaving method corresponding to a reverse process of an interleaving method for transmitting data stored in data banks, the deinterleaving method comprising:

• recognizing readout numbers B in order of reading and receiving data;
• calculating integer values E corresponding to remainders obtained by dividing sums of the readout numbers B and a cyclic interleaving value Q for each data bank by a number of storage spaces M;
• calculating integer values C and remainders S by dividing the integer values E by a tone interleaving value L;
• calculating space address values by multiplying the remainders S by a result of the number of storage spaces M divided by the tone interleaving value L, and adding the integer values C;
• and
• storing received data at storage spaces corresponding to the calculated space address values, M being an integer not less than one, E being integers not less than zero and not more than M, B and Q being integers not less than zero, L being an integer not less than two, S being an integer not less than zero and not more than L, and C being an integer not less than zero.

An interleaving method employing at least one interleaving in transmitting data, the interleaving method comprising:

• storing data at write address values of a memory which are sequentially calculated according to a predetermined write address value calculation process;
• and
• reading data stored at read address values of the memory which are sequentially calculated according to a predetermined read address value calculation process, wherein the memory has N data banks, each data bank has M storage spaces, there are D interleaving target data having data numbers A,
• wherein N, M and D are integers not less than one, and A is an integer not less than zero,
• the storing data includes storing the data at storage spaces of data banks, the storage spaces corresponding to integer values obtained by dividing the data numbers A by a result of dividing the total number of data D by the number of storage spaces M and obtaining the data banks corresponding to remainders obtained by dividing the data numbers A by the result of dividing the total number of data D by the number of storage spaces M, and
• the reading data comprises determining integer values E corresponding to remainders obtained by dividing a sum of readout numbers B and a cyclic interleaving value Q by the number of storage spaces M according to readout order by data bank, determining integer values C and remainders S by dividing the integer values E by a tone interleaving value L, determining the read address values by multiplying the remainders S by the result of the number of storage spaces M divided by the tone interleaving value L, and adding the integer values C and reading data corresponding to the read address values, M being an integer not less than one, E being integers not less than zero and not more than M, B and Q being integers not less than zero, L being an integer not less than two, S being an integer not less than zero and not more than L, and C being an integer not less than zero.

An interleaving system employing at least one interleaving in transmitting data, the interleaving method comprising:

• a write address value calculation unit for sequentially calculating write address values of a memory for sequentially storing data according to a predetermined write address value calculation process;
• and
• a read write address value calculation unit for sequentially calculating read address values of the memory for sequentially reading data according to a predetermined read address value calculation process,
• wherein the memory has N data banks, each data bank has M storage spaces, there are D interleaving target data having data numbers A, and the storing data includes storing the data at storage spaces of data banks,
• N, M and D are integers not less than one, and A is an integer not less than zero,
• the storage spaces corresponding to integer values obtained by dividing the data numbers A by a result of dividing the total number of data D by the number of storage spaces M, and obtaining the data banks corresponding to remainders obtained by dividing the data numbers A by a result of dividing the total number of data D by the number of storage spaces M, and
• the read address value calculation unit calculates integer values E corresponding to remainders obtained by dividing addition values of readout numbers B and a cyclic interleaving value Q by the number of storage spaces M according to readout order by data bank, calculates integer values C and remainders S by dividing the integer values E by a tone interleaving value L, and calculating the read address values by multiplying the remainders S by the result of the number of storage spaces M divided by the tone interleaving value L, and adding the integer values C, M being an integer not less than one, E being integers not less than zero and not more than M, B and Q being integers not less than zero, L being an integer not less than two, S being an integer not less than zero and not more than L, and C being an integer not less than zero.

A deinterleaving method corresponding to a reverse process of an interleaving method employing at least one interleaving in transmitting data stored in data banks, the deinterleaving method comprising:

• recognizing readout numbers B in order of reading and receiving data;
• calculating integer values E corresponding to remainders obtained by dividing sums of the readout numbers B and a cyclic interleaving value Q for each data bank by a number of storage spaces M;
• calculating integer values C and remainders S by dividing the integer values E by a tone interleaving value L;
• calculating space address values by multiplying the remainders S by a result of the number of storage spaces M divided by the tone interleaving value L, and adding the integer values C;
• and
• storing received data at storage spaces corresponding to the calculated space address values, M being an integer not less than one, E being integers not less than zero and not more than M, B and Q being integers not less than zero, L being an integer not less than two, S being an integer not less than zero and not more than L, and C being an integer not less than zero.