Segmentation mechanism for a block encoder and method for encoding with a block encoder

The invention relates to methods and equipment for block encoders. As is well known, block encoders are frequently used for error correction. An example of a block encoder is a so-called turbo (en)coder, as disclosed in reference 1 .

FIG. 1 is a block chart of a turbo encoder TE which is connected to a corresponding turbo decoder TD via a (transmission) channel. A typical turbo encoder conveys the original information directly to the channel. These bits are called systematic bits. Additionally, the turbo encoder adds redun-dancy (parity) with simple encoders 1 and 2 , the latter of which is preceded by an interleaver P, which permutes the bits of the original information. However, details of the block encoder are not relevant for understanding the invention, and reference is made to relevant literature.

Unlike streaming encoders, block encoders process. one or more data blocks at a time. An input data block whose size exceeds the block size of the block encoder must be divided into smaller segments such that no segment is larger than the block size of the block encoder. This is why block encoders are particularly suitable for applications with a fixed input block size. A problem with block encoders is that they do not easily lend themselves to applications having a variable (dynamic) input block size. In other words, what to do with the last few segments of the input data block, remains an open question.

An object of the invention is to provide a mechanism for using block encoders with applications having a variable (dynamic) input block size. The mechanism should be generic in order to be applicable to a wide variety of block encoders.

This object is achieved with a method and equipment which are characterized by what is disclosed in the attached independent claims. Preferred embodiments of the invention are disclosed in the attached dependent claims.

A straightforward solution would be to fill the segment of the input data block to the block size of the block encoder. Assuming a block size of 8 kilobits (kb), a 14-kb input data block would be divided into a first segment of 8 kb and second (last) segment with a net size of 6 kb and 2 kb of fill (padding) bits. A benefit of this straightforward solution is that the block encoder does not have to adapt to varying input block sizes.

The invention is based on the idea that for an input data block whose size exceeds the block size of the block encoder:

1) before coding is started, the size of the input data block is determined; and

2) the input data block is divided into segments of approximately equal size such that no segment is larger than the block size of the block encoder.

An aspect of the invention is a segmentation device for segmenting an input data block for processing with a block encoder, wherein the block encoder is capable of processing consecutive coding blocks whose size has an upper limit which is smaller than the size of the input data block. The segmentation device is arranged to: determine the length of the input data block before applying any of its data to the block encoder; divide the input data block to a plurality of segments wherein all segments are of substantially equal size and no segment is larger than the upper limit; and to apply each segment to the block encoder.

According to a preferred embodiment of the invention, the input data block is divided into the least possible number of segments. In other words, the segments are as large as possible.

According to an alternative embodiment, the input data block is divided into 2 n segments where n is a positive integer.

According to yet another preferred embodiment of the invention, if dividing the input data block produces a last segment which is shorter than the remaining segments, the input data block or the last segment is padded with a few fill bits until the length of the last segment equals that of the remaining segments. However, in contrast to the straightforward solution, the last segment is not padded to the full block size of the block encoder (unless the remaining segments happen to be of that size too).

The invention will be described in more detail by means of preferred embodiments with reference to the appended drawing wherein:

FIG. 1 is a block chart of a turbo encoder; and

FIG. 2 illustrates dividing an input data block to a number of segments for the turbo encoder.

Various embodiments of the invention will be described in connection with a turbo encoder, an example of which is disclosed in reference 1 . However, details of the turbo encoder, or any other encoder, are not relevant for understanding the invention.

Implementing a turbo encoder (and the corresponding decoder) can be facilitated by limiting the length of the coding block. A reasonable value for the length of the coding block is 8192 bits including the user data, a possible error detection field (CRC) and the termination. The following naming conventions will be used:

N TAIL =the number of termination bits

T DELAY (seconds)=the length of the user data block

R DATA (bits per second)=the user data rate of the service

N EXTRA =the number of other bits added to the original user data (CRC etc.)

L CB =max length of the coding block.

The following condition has to be satisfied:

R DATA *T DELAY +N EXTRA +N TAIL ≦L CB   [1]

If this condition is not satisfied the data to be encoded must be segmented so that each separate segment satisfies the condition. The number of segments N S has to satisfy the condition:

round_up(( R DATA *T DELAY +N EXTRA ) IN S )+ N TAIL ≦L CB   [2]

It is preferable to choose the smallest N S satisfying the inequality [2]. N S can be calculated from:

N S =round_up(( R DATA *T DELAY +T EXTRA )/( L CB −N TAIL ))  [3]

It may happen that all the encoding blocks do not end up being of the same length, i.e. that (R DATA *T DELAY +N EXTRA )IN S is not an integer. In such a case, there are at least two possible solutions, which will be called algorithms A and B. In algorithm A, the last segment is allowed to have a different length than the other segments. In algorithm B, a number N FILL of fill bits (e.g. zeroes) are added to the input data so that (R DATA *T DELAY +N EXTRA +N FILL )IN S is the smallest possible integer. (Alternatively, the fill bits can be appended to the last segment after segmentation.)

Algorithm A

Algorithm A allows the last segment to be shorter than the other segments. Algorithm A uses the following Inputs:

R DATA =the user data rate (bits per second)

T DELAY =encoding user data block length (seconds)

N EXTRA =extra data to be appended to the user data before encoding (bits)

N TAIL =number of tail bits to be appended to the encoding blocks

Algorithm A produces the following outputs:

N S =number of segments

N TB =number of bits in the turbo encoder input blocks except the last one

N LAST — TB =number of bits in the last turbo encoder input block

In algorithm A the following computations will be performed:

Let N S =round 13 up((R DATA *T DELAY +N EXTRA )/(L CB −N TAIL ))

Let N TB =round_up((R DATA *T DELAY +N EXTRA )/N S )+N TAIL ;

Let N REM =remainder of (R DATA *T DELAY +N EXTRA )/N S ;

If N REM is not equal to zero then N LAST — TB =N TB −N S +N REM else N LAST — TB =N TB . End.

If algorithm A is used, an adaptive turbo interleaver is needed since the last input segment to the turbo encoder may be shorter than the others. The number of systematic bits in the output of the encoder is

R DATA *T DELAY +N EXTRA +N S *N TAIL   [4]

Thus there are no additional bits other than the ones due to the termination of each segment.

Algorithm B

As shown in FIG. 2, in algorithm B all input segments to the turbo encoder will be of equal size. The inputs to algorithm B are:

R DATA =the user data rate (bits per second)

T DELAY =encoding user data block length (seconds)

N EXTRA =extra data to be appended to the user data before encoding (bits)

N TAIL =number of tail bits to be appended to the encoding blocks

The outputs from algorithm B are:

N S =number of segments

N TB =number of bits in the turbo encoder input blocks

N FILL =number of fill bits (e.g. zero) in the last turbo encoder input block

In algorithm B, the following computations will be performed:

Let N S =round 13 up((R DATA *T DELAY +N EXTRA )/(L CB −N TAIL ))

Let N TB =round_up ((R DATA *T DELAY +N EXTRA )/N S )+N TAIL

Let N REM =remainder of (R DATA *T DELAY +N EXTRA )/N S

if N REM ≠0 then insert N FILL =(N S −N REM ) zero bits to the end of the input data else N FILL =0.

All input segments to the turbo encoder are of equal size and therefore the same turbo interleaver can be used for all segments. In this case the number of systematic bits over an entire channel interleaving block at the output of the turbo encoder is:

N S *(round_up(( R DATA *T DELAY +N EXTRA )/ N S )+ N TAIL )  [5]

Thus there may be some additional bits other than the termination bits.

Modification to algorithms A and B

In the above algorithms A and B, the length of input segment to the turbo encoder is maximised by choosing the smallest possible number of segments N S . In some cases it may be preferable to use a number of segments N S . which is a power of 2, but this will shorten the input segments to the turbo encoder. In this case, the first step of the above algorithms A and B would be replaced by the following three steps:

Let n S =round_up ((R DATA *T DELAY +N EXTRA )/(L CB −N TAIL ));

Let m=round_up (log 2 n S);

Let N S =2 m .

References

1. C. Berrou, A. Glavieux, P. Thitimajshima: Near Shannon limit error - correcting coding and decoding: Turbo - codes , IEEE International Conference on Communications, ICC 1993, Geneva, Switzerland 23-26 May, 1993, Vol. 2, pp. 1064-1070.

All references are incorporated herein by reference.