EP3560104A1

EP3560104A1 - Method and device for correcting low-latency errors for retrieving data packets

Info

Publication number: EP3560104A1
Application number: EP17832531.2A
Authority: EP
Inventors: Tuan TRAN THAI; Christophe Burdinat; Cédric Thienot
Original assignee: Expway SA
Current assignee: Expway SA
Priority date: 2016-12-22
Filing date: 2017-12-21
Publication date: 2019-10-30
Also published as: CN110121840A; FR3061379A1; KR20190099045A; JP2020503742A; FR3061379B1; CN110121840B; WO2018115775A1; US20190319645A1

Abstract

The invention relates to a method for transmitting data, comprising the steps of: encoding data to be transmitted in the form of source symbols (S) grouped into a data block (DB), distributing the source symbols of the data block among sub-blocks (SB), calculating for each sub-block a respective repair symbol (R1-R9) by means of a linear combination of source symbols of the sub-block, and transmitting the data block in a stream of data blocks, by successively transmitting each sub-block of the data block, each sub-block being transmitted by transmission of the source symbols of the sub-block, followed by the repair symbol of the sub-block.

Description

METHOD AND DEVICE FOR CORRECTING LOW LATENCY ERRORS FOR RECOVERING DATA PACKETS

The present invention relates to the transmission of data in a communication channel between a transmitting device and a receiving device, and in particular, the implementation of an error correction mechanism or loss of data.

Many error correction codes have been proposed to ensure the reliability of file or data flow transmissions by transmission channels introducing data loss or corruption.

In the field of mobile networks, and in particular in point-to-multipoint and broadcast communications, the direct error correction of the application layer AL-FEC (Forward Error Correction) plays a key role in ensuring a distribution reliable large-scale content. AL-FEC has even been defined as mandatory by the 3rd Generation Partnership Project (3GGP) for Extended Multimedia Broadcast Services (eMBMS). Among the codes used for AL-FEC error correction, Reed-Solomon (RS) coding is commonly used. This coding belongs to the category of maximum distance separable (MDS) codes which make it possible to reconstitute k source symbols out of n transmitted symbols including nk repair symbols. In the case of a packet data transmission protocol, files, data streams, or data blocks are transmitted in the form of data packets divided into symbols which may or may not be of the same size. The size of a symbol can be expressed in number of bits. The repair symbols RS are obtained by operations performed on a Galois field GF (Galois Field) such as GF (2 ^m ). Thus, the repair symbols are computed by a linear combination of the source symbols using coefficients belonging to the body GF (2 ^m ). Typically, repair symbol calculations are performed on the GF ( ²⁸ ) body, which limits the size n of the processed data blocks to less than 256 symbols.

The block AL-FEC encodings have the disadvantage of requiring to wait for the repair symbols transmitted at the end of a data block to be able to restore a lost or erroneous symbol in the data block. The recovery time of a source symbol can therefore reach the reception time of a data block, if the error occurs on the first source symbol of the data block. Similarly, the access time to a stream of data blocks can reach the reception duration of a block if the instant of access to the stream occurs between the instants receiving start of the first and second source symbols. On the other hand, all the source symbols of a data block have the same high level of protection, since all the repair symbols are calculated from all the source symbols of the block.

There are other codings such as LDPC (Low Density Parity Check),

Raptor / RaptorQ that support larger block sizes. However, in real-time applications, latency constraints limit the size of the data blocks. Block-based AL-FEC encodings are widely used because of their multiple performance advantages, particularly in terms of repair capacity, complexity and flexibility. On the other hand, block-based ALFEC encodings have a high latency of repair. If one of the first symbols in a data block is erroneous or lost, it can not be restored until the repair symbols at the end of the block are received.

Convolutional encodings have also been proposed, applying a sliding window mechanism. According to such coding, the repair symbols are computed on the fly, on the source symbols belonging to the sliding window, and sent after the source symbols of the window. For example, a repair symbol is calculated on at most W source symbols and sent all k source symbols, k <W. The restoration of a lost or erroneous source symbol can therefore be performed as soon as a repair symbol is received. , before all source symbols are received. In return, this type of coding raises an access latency problem, when a terminal accesses a data stream of a broadcast transmission or point-to-multipoint transmission, after the start of the transmission. Indeed, the terminal must wait at least W source symbols before receiving the first exploitable repair symbol. In addition, each loss of source symbol increases the access time to the data stream of k + 1 source symbols. A drifting effect occurs when the symbol loss rate approaches the ratio of the number of repair symbols to the number of source symbols transmitted. In this case, it is not possible to restore lost or erroneous symbols.

It is therefore desirable to provide a type of coding having a low latency of restoring a lost or erroneous source symbol, while offering low access latency, and a sufficient level of protection for each source symbol.

Embodiments are provided for a method of transmitting data, comprising: encoding data to be transmitted as source symbols grouped into data blocks, allocating each data block a number of repair symbols, and each block of data: divide the source symbols of the data block into sub-blocks, the number of sub-blocks being equal to the number of repair symbols allocated to the data block, assigning a repair symbol to each sub-block of the data block, calculating the repair symbol of each sub-block of the data block by a linear combination of source symbols of the sub-block and the preceding sub-block source symbols in the data block, and transmit the data block in a stream of data blocks, successively transmitting each sub-block of the data block, each sub-block -block being transmitted by transmitting the source symbols of the sub-block, followed by the repair symbol of the sub-block.

According to one embodiment, each repair symbol of the data block is computed by a linear combination of at least a portion of the source symbols of the data block, so that each source symbol of the data block is used to compute the same number, to a close, of repair symbols of the data block.

According to one embodiment, each repair symbol of the data block is calculated by a linear combination of all the previously transmitted source symbols of the data block.

According to one embodiment, a plurality of repair symbols calculated from at least a portion of the source symbols of the last sub-block of the data block are transmitted at the end of the data block.

According to one embodiment, each sub-block of the data block comprises the same number, to a close, of source symbols.

According to one embodiment, the data block comprises as many sub-blocks as repair symbols transmitted at the end of the data block.

According to one embodiment, the method comprises steps of defining a format of the data block, consisting in: defining a first number of repair symbols to be transmitted at the end of the data block, determining a number of sub-blocks of the data block according to the first number and a number of repair symbols allocated to the data block, or determine the number of repair symbols allocated to the data block according to the number of sub-blocks of the data block and of the first number, calculating a minimum number of source symbols per sub-block by dividing the number of source symbols in the data block by the number of sub-blocks, the minimum number of source symbols being set equal to the largest lower integer or equal to the result obtained from the division, and calculate a difference between the number of source symbols of the data block and the product of the number of sub-blocks in the data block by the number m inimum of source symbols by sub-block, the deviation defining a number of source symbols to be added in the sub-blocks of the data block. According to one embodiment, the gap defines a number of sub-blocks of the data block comprising a number of source symbols equal to the minimum number of source symbols per sub-block, increased by one.

According to one embodiment, the method comprises the steps of: receiving from a user terminal in point-to-point mode, a message signaling poor reception conditions, and transmitting to the terminal in point-to-point mode, in response to the message, at least one repair symbol for each block of data transmitted after the receipt of the message.

Embodiments may also relate to a method of receiving data transmitted in accordance with the previously defined transmission method, the receiving method comprising successive steps of receiving the source symbol sub-blocks of a data block, receiving each sub-block being followed by receiving a repair symbol associated with the sub-block, each repair symbol corresponding to a linear combination of the source symbols of the sub-block associated with the repair symbol.

According to one embodiment, the receiving method comprises the steps of: detecting a missing or erroneous source symbol in the data block, and upon receiving a first repair symbol following the missing or erroneous source symbol, calculating the missing or erroneous source symbol by solving an equation resulting from the equality between the first repair symbol and a linear combination corresponding to the first repair symbol.

According to one embodiment, the reception method comprises the steps of: detecting bad reception conditions of data blocks transmitted in a multicast mode,

transmit in a point-to-point mode, to a server, a message signaling poor reception conditions, and receive in point-to-point mode, for data blocks received in the multicast mode, additional repair symbols that can be used to calculate symbols missing sources in the received data blocks.

Embodiments may also relate to a data transmission device configured to implement the previously defined transmission method.

Embodiments may also relate to a data receiving device configured to implement the reception method defined above.

Exemplary embodiments of the invention will be described in the following, by way of nonlimiting example, with reference to the appended figures among which: FIG. 1 schematically represents a data transmission system,

FIG. 2 diagrammatically represents a conventional format for transmitting data generated in a transmission device of the transmission system,

FIG. 3 illustrates a method for calculating repair symbols of the format represented in FIG. 2,

FIG. 4 diagrammatically represents another conventional format for transmitting data generated in the transmission device of the transmission system,

FIG. 5 illustrates a data transmission format and a method for calculating repair symbols of the format shown in FIG. 4,

FIG. 6 represents steps of a procedure for determining a data transmission format, according to one embodiment,

FIG. 7 illustrates an exemplary data transmission format obtained using the procedure shown in FIG. 6,

FIG. 8 represents steps of a procedure for determining a data transmission format, according to another embodiment,

FIGS. 9 to 14 illustrate examples of data transmission formats obtained using the procedure illustrated in FIG. 8, and examples of methods of calculating the repair symbols,

FIGS. 15 to 23 show curves illustrating the performances obtained using the data transmission formats presented above. FIG. 24 schematically represents a content broadcasting system with several mobile terminals.

Figure 1 schematically shows a data transmission system. An IDT input data file or stream is provided to a TDV transmitter device configured to transmit the IDT input data to a RDV receiver device over a communication channel CH. The receiving device is configured to provide ODT output data corresponding to the input data. The TDV transmitter device comprises an ISG symbol generator, an ENC encoder module, and an XMT transmission module. The ISG symbol generator is configured to generate source symbols representing the IDT input data, in the form of M-bit binary words. Thus the input data can be represented as 2 ^M different source symbols. The value of the parameter M is adapted to the communication system. The source symbols produced by the ISG symbol generator are provided to the ENC encoding module for encoding and then supplied to the XMT transmission module. The ENC encoding module is configured to assemble the source symbols into data blocks including repair symbols. The transmission module XMT is configured to put the data of the data blocks received from the encoding module ENC into a transmission format adapted to the transmission channel CH. The transmission channel CH may be a real-time channel, for example a link formed through the Internet, or a content-broadcasting link to a plurality of terminals, or a point-to-point link for transmitting voice or voice. the image.

The receiver device RDV comprises a reception module REC, a decoding module DEC, and a assembly module DASM for restoring the transmitted data IDT in their initial format. The reception module REC converts the signals transmitted by the transmission channel CH into symbols comprising source symbols and repair symbols. The decoding module DEC detects errors or the possible absence of symbols in the symbols produced by the reception module REC, and attempts to reconstruct any missing or erroneous source symbols using the repair symbols received. For example, errors can be detected using parity bits in transmitted symbols. The assembly module DASM assembles the source symbols provided by the DEC decoder module to generate ODT output data corresponding to the input data IDT transmitted.

FIG. 2 represents a conventional format of a data block DB [k, k + r] that can be provided by the encoding module ENC. The data block DB comprises k source symbols S [1] to S [k], followed by r (= nk) repair symbols Rl [l, k] to Rr [l, k]. FIG. 3 illustrates the method of calculating the repair symbols R1 [1, k] to R1 [1, k] in the case of a data block format at k = 49 source symbols S [1] -S [49 ], and r = 9 repair symbols. In Fig. 3, each repair symbol R1 [1, k] to R1 [1, k] is represented by an arrow extending over all the source symbols from which it is calculated. Thus, each of the repair symbols RI [1,49] to R9 [1,49] is calculated from the 49 source symbols of the DB data block [49,58]. The repair symbols Rp [i, j] can be calculated by a respective linear combination of the source symbols, by the following equation: p [i. j] = Σ a _p , S [l] (1) l = i

in which has _p! represents coefficients chosen randomly in the body

GF (2 ^m ), with m = 8, for example, and p is between 1 and (nk). The coefficients α, ρ _ΐ can be gathered in a matrix of size kx (nk), the coefficients a _p! source symbols S [l] not taken into account in the calculation of the repair symbol Rp being zero. In this case, the repair symbols can be obtained by the following equation: Rp = Σ a _p | S [1] (2)

1 = 1

The matrix of coefficients α _ρ! and parameters defining the format of the transmitted data blocks can be transmitted to the DEC decoding module.

In the example of FIG. 3, if one of the first source symbols S [i] is lost or erroneous, it is necessary to wait for the reception of at least the first repair symbol RI [1,49] (if the block received DB data has no other errors), to be able to restore the lost or erroneous source symbol. Indeed, it is necessary to have at least one repair symbol for each source symbol to restore, so that such a restoration is possible by the resolution of a system of x equations with unknown x (x being the number of source symbols to be restored). Thus, the coding format illustrated in FIGS. 2 and 3 makes it possible to restore at most 9 source symbols that are erroneous or lost in a data block of 49 source symbols. Furthermore, the access time to a stream of data blocks B [49,58] may be close to the transmission time of two data blocks if the instant of access to the stream implies a number of source symbols that are missing or erroneous. greater than r = 9 in a first received data block, and if at least one error is detected in a second received data block.

FIG. 4 represents another conventional format of an SST symbol stream [k, w] that can be provided by the encoding module ENC. The symbol flow comprises a succession of groups of k source symbols S [1] -S [k], S [k + 1] -S [2k], S [n-k + 1] -S [nk], each group being followed by a repair symbol R [kw, k], R [2k-w, 2k], Rl [nkw, nk], calculated on the w previous source symbols in the data stream, with w> k.

FIG. 5 illustrates the method of calculating the repair symbols R1 [nk-w, nk] (with n = 1, 2, ...), for an SST data stream [3, 15], that is, that is, when the repair symbols are calculated from the source symbols belonging to a sliding window of w (= 15) source symbols S and where a repair symbol is issued after a group SB [nk-2, nk] of k (= 3) source symbols. In FIG. 5, each repair symbol R [xw, x] is represented by an arrow extending over the w source symbols from which they are calculated. Thus, the repair symbol R [7.21] is transmitted after the source symbol group SB [18.21] and is calculated from the source symbols S [7] to S [21]. The next repair symbol R [10,24] in the SST flow [3,15] is transmitted after the source symbol group SB [21,24] and is calculated from the source symbols S [10] to S [24 ]. Repair symbols R [i, j] can also be calculated by equation (1) or (2) · In the example of Figure 5, it is possible to restore a lost or erroneous source symbol upon receipt of the next repair symbol. The restore latency of a source symbol is therefore less than the reception time of k = 3 source symbols. The access time to a first source symbol of an SST stream [3,15] is at least equal to the reception duration of w = 15 symbols, if a source symbol is missing in the first group of 3 source symbols received. Moreover, the access time to a source symbol of the stream can be infinite, if the transmission of the stream produces at least one error in each of the successive groups SB [nk-2, nk] of 3 source symbols on which are calculated the repair symbols.

According to one embodiment, the restoration and access latencies are reduced by dividing the bulk data stream and dividing each transmitted data block into subblocks and assigning each subblock a block. of data, a repair symbol that is transmitted immediately following the last source symbol of the sub-block. Any remaining repair symbols are transmitted after the last sub-block of the data block.

Fig. 6 shows steps S1-S4 of a PI procedure for defining a data block format, according to one embodiment. In particular, the PI procedure makes it possible to determine a number of NB sub-blocks and a number of KB source symbols per sub-block. The PI procedure can be implemented in the ENC encoding module. The PI procedure is based on a division of a data block into a number of sub-blocks equal to the number of repair symbols assigned to the data block. The PI procedure receives as input the number of source symbols k present in the data block and the total number n of symbols in the data block, including repair symbols. In step S1, the number of sub-blocks NB is set equal to the number of repair symbols allocated to the data block, ie n - k. In step S2, the number KB of source symbols per sub-block of the data block is calculated by the following equation:

KB = FL (k / (nk)) (3) in which the function FL (x) provides the large integer less than or equal to the number x. In step S3, a difference Δ between the number k of source symbols in the data block and the product of the numbers KB is NB is calculated. The number Δ represents the number of remaining source symbols, not assigned to one of the sub-blocks of the data block, if all the sub-blocks of the data block comprise KB source symbols. The number Δ is used to specify that the division of the sub-block data block comprises Δ sub-blocks of (KB + 1) source symbols and (NB-Δ) sub-blocks of KB source symbols. The Δ sub-blocks of (KB + 1) source symbols can be indifferently positioned at the beginning or at the end of the data block. Alternatively, Δ source symbols can be removed from one of the sub-blocks, for example the first or the last sub-block of the data block. At step S4, the PI procedure ends by providing the numbers KB, NB and Δ. The PI procedure therefore results in a division of each block of data into Δ sub-blocks of (KB + 1) source symbols and (NB -Δ) sub-blocks SB of KB source symbols.

For example, the data block comprises NB - Δ first SB sub-blocks each gathering KB source symbols from (b-KB + 1) to ((b + 1) -KB), b varying from 0 to (ΝΒ-Δ- 2), and Δ last SB sub-blocks each gathering (KB + 1) source symbols from (b-KB + b - NB + A - 1) to ((b + 1) -KB + b - NB + Δ), b varying from (ΝΒ-Δ-1) to (NB-1).

Thus, the latency of repair or access to the data stream, in the event of loss of p source symbols (p <nk) in a data block, is less than the reception time of the p repair symbols R [i, j ] of the data block. Of course, if the number of source symbols lost in a data block is greater than the number (n - k) of repair symbols per data block, the data block being received is not repairable; it is therefore necessary to wait for the reception of the next data block.

FIG. 7 represents an exemplary format of a data block DB defined by the procedure PI and a mode of calculation of the repair symbols. In this example, the data block comprises k = 49 source symbols for a total of n = 58 symbols, ie n - k = 9 repair symbols R1 to R9. The PI procedure makes it possible to define a division of the DB data block into NB = 9 sub-blocks each comprising KB = 5 source symbols, with a difference of Δ = 4 source symbols to be distributed in some of the sub-blocks. The Δ (= 4) source symbols to be distributed in the sub-blocks can be added for example to the last 4 sub-blocks of the DB data block. As a result, the data block DB comprises sub-blocks SB [1-5] (including the source symbols 1 to 5 of the DB data block), SB [6-10], SB [11-15], SB [16-20], SB [21-25], each comprising 5 source symbols, and the sub-blocks SB [26-31], SB [32-37], SB [38-43] and SB [44- 49] each comprising 6 source symbols. The first repair symbol R1 [1,5], obtained by a linear combination of the source symbols S [1] to S [5], is transmitted immediately after the first sub-block SB [1-5], either following the source symbol S [5]. The second repair symbol R1 [l, 10], obtained by a linear combination of the source symbols S [1] to S [10], is transmitted immediately after the second sub-block SB [6- 10], and so on. .

In the example of FIG. 7, the latency of repair or access to the data stream, in the event of the loss of a source symbol, is less than the reception time of 5 source symbols and the repair symbol that follows.

It should be noted that in the example of FIG. 7, the source symbols S [1] to S [5] of the first sub-block SB [1,5] are protected by all the repair symbols R1-R9 assigned to the DB data block. On the other hand, the source symbols S [44] to S [49] of the last sub-block SB [44,49] are protected only by the last repair symbol R9. It may therefore be desirable to increase the number of source symbol repair symbols protecting the last SB sub-block [44,49] of the DB data block. For this purpose, Figure 8 shows steps S 10 to S 13 of a procedure P2 for determining a data block format, according to another embodiment. In particular, the procedure P2 makes it possible to determine the number NB of sub-blocks SB per block of data and the number of source symbols KB per sub-block from the number k of source symbols per block of data, of the total number n of symbol by data block and a number Q of repair symbols to be assigned to the last sub-block of each data block. The parameters KB and NB provided by the PI procedure (FIG. 6) are then considered as minimum values for the number KB and maximum for the number NB. In the PI procedure, the number Q of repair symbols allocated to the last sub-block is set to 1.

In step S10, the number NB of sub-blocks is calculated by subtracting the quantity Q - 1 from the number n - k of repair symbols per block of data. In step S11, the number KB of source symbols is calculated by dividing the number k of source symbols by data block by the number NB of sub-blocks obtained in step S10. The number KB is set equal to largest integer less than the result of k / NB division. Thus, the numbers NB and KB are obtained by the following equations:

NB = n - k - Q + 1, KB = FL (k / NB) (4) In step S 12, the difference Δ between the number k of source symbols in the data block and the product of numbers KB is NB. Thus, the number Δ is equal to k - NB x KB. In step S13, the procedure P2 returns the numbers KB, NB and Δ thus calculated. Thus, the procedure P2 makes it possible to define a division of a data block of k source symbols and (nk) repair symbols, comprising for example (NB - Δ) sub-blocks including KB source symbols and Δ sub-blocks comprising ( KB + 1) source symbols, each sub-block being followed by a repair symbol R [i, j] calculated on at least a part of the previous source symbols in the data block, for example by equation (1) or (2). The parameters KB, NB and Δ thus calculated can be transmitted to the DEC decoding module so that it can locate the sub-blocks and the repair symbols in the transmitted data blocks.

If the parameter Q is set to 1, the procedure P2 provides a number NB of sub-blocks NB equal to n - k (number of repair symbols in a data block), and a number KB of source symbols per sub -block equal to FL (k / (n - k)), according to the format defined by the procedure Pl. In the example with k = 49 and n = 58, the procedure P2 provides a number NB of sub-blocks equal to 9, and a number KB of source symbols per sub-block equal to 5 with a difference Δ equal to 4. We find thus the data block format of Figure 7. If we set the parameter Q to nk, the procedure P2 provides a number NB of sub-blocks SB equal to 1, and therefore a number KB of source symbols by sub-units. block equal to the number k of source symbols in the data block. We thus find the format of Figure 3, without division of the data block into sub-blocks.

Of course, it may be provided that the number NB of sub-blocks in each data block is fixed, and thus provided at the input of the procedure P2. In this case, step S 10 is replaced by a step of calculating the number r of repair symbols per data block, or the total number n of symbols per data block. Thus, the number r of repair symbols per data block is equal to the number NB of sub-blocks per data block plus the number Q1 of repair symbols to be added at the end of the data block, not counting the repair symbol. assigned to the last sub-block of the data block. In step S 13, the procedure P2 then provides the number r of repair symbols or the total number n of symbols per data block, instead of the number NB of sub-blocks per data block. It may also be provided to set the number r of repair symbols per data block and to determine the number Q of repair symbols at the end of the data block, depending on the number r and the number NB of sub-blocks by block of data.

FIG. 9 represents an exemplary format of a data block DB with 49 source symbols and 9 repair symbols, obtained by the procedure P2. In this example, the number Q of repair symbols at the end of the data block DB is chosen equal to 3. The procedure P2 makes it possible to define a division of the data block DB into NB = 7 sub-blocks each comprising KB = 7 source symbols, the difference Δ being zero. The data block DB of FIG. 9 thus comprises sub-blocks SB [1, 7], SB [8, 14], SB [15, 21], SB [22, 28], SB [29, 35], SB [36,42] and SB [42,49], each sub-block being immediately followed by a repair symbol, respectively R1 [1,7], R2 [1,4], R3 [1,221], R4 [1,28], R5 [1,35], R6 [1,442] and R7 [1,449]. The last sub-block SB [42,49] is followed by three repair symbols R7 [1,49], R8 [1,49] and R9 [1,49], according to the parameter Q chosen equal to 3.

Thus, the latency repair or access to such a data block, in case of loss of a source symbol is less than or equal to the reception time 7 source symbols plus a repair symbol.

It should be noted in the examples of FIGS. 7 and 9 that the source symbols of the first sub-block SB [1,5], SB [1,7] are protected by all the repair symbols allocated to the data block DB. On the other hand, the last sub-block SB [44, 49], SB [43,49] of the data block DB is protected by only one repair symbol R9 [1,49] in the example of the figure 7, and by the three repair symbols R7 [1,49], R8 [1,49] and R9 [1,490] in the example of FIG. 9. if the number of source symbols lost at the beginning of the block is greater than the number of repair symbols, it is not possible to restore the lost source symbols of the DB data block, which requires waiting for the reception of the source symbols the next block of data.

It may be desirable to standardize the number of repair symbols protecting each source symbol in the data block. For this purpose, consider for example the case where the data block is divided into NB sub-blocks with the NB - Δ first sub-blocks SB each comprising KB source symbols from (b-KB + 1) to ((b + 1 ) -KB), b varying from 0 to (ΝΒ-Δ-2), and the last Δ sub-blocks SB each comprising (KB + 1) source symbols from (b-KB + b - NB + Δ-1) to ((b + 1) -KB + b - NB + Δ), b varying from (ΝΒ-Δ-1) to (NB-1). The last NB-1 repair symbols can be calculated according to the source symbols from (b-KB + 1) to k, when b is less than (ΝΒ-Δ-1), and (b-KB + b - NB + Δ - 1) to k, when b is greater than (ΝΒ-Δ-2). As the number of source symbols from which some repair symbols are calculated is reduced, the calculation of the repair symbols and the restoration calculations of a source symbol are simplified.

Thus, FIG. 10 shows an exemplary format of a data block DB with 49 source symbols and 9 repair symbols, derived from the format of FIG. 9, and in which each source symbol is protected by Q (= 3) symbols. of repair. The size and distribution of the sub-blocks in the data block DB is unchanged from the format shown in FIG. 9. The repair symbols R1 to R3 are always calculated from the first source symbol S [1] of the block of DB data. On the other hand, the repair symbols R4 [8.28], R5 [15.35], R6 [22, 42] and R7 [29.49] are calculated from the 21 preceding source symbols, the repair symbol R8 [ 36,49] is calculated from the last 14 source symbols S [36] to S [49] of the data block DB, and the repair symbol R9 [43,49] is calculated from the last 7 source symbols S [ 43] to S [49] of the DB data block.

In the example of FIG. 10, if more than three source symbols are lost in the first sub-block SB [1,7] of the DB data block, it is not possible to restore the lost source symbols. On the other hand, it is possible to restore a source symbol lost in the following three sub-blocks SB [8,14], SB [15,21], SB [22,28] as soon as the repair symbol R4 [8, 28] which does not require the knowledge of the symbols of the first sub-block then considered as lost.

FIG. 11 shows an exemplary format of a data block DB with 49 source symbols and 9 repair symbols, obtained by the procedure P2. In this example, the number Q of repair symbols at the end of the data block DB is chosen equal to CL ((n - k) / 2), ie 5, the function CL (x) representing the smallest integer greater than or equal to the number x. The procedure P2 makes it possible to define a division of the data block DB into NB = 5 sub-blocks each comprising KB = 9 source symbols, the difference Δ being equal to 4. As a result, the choice of Q set at 5 leads to a division of the data block DB into a sub-block of 9 source symbols and 4 sub-blocks of 10 source symbols . Thus, the data block DB of FIG. 11 comprises 4 sub-blocks SB [1,10], SB [11,20], SB [21,30], SB [31,40] comprising 10 source symbols and one sub-block -block SB [41,49] of 9 source symbols, each sub-block being immediately followed by a repair symbol R1 [1,10], R2 [1,20], R3 [1,30], R4 [1 , 40] and R5 [1,49]. The last sub-block SB [41, 49] is followed by five repair symbols R5 [1.49], R6 [1.49], R7 [1.49], R8 [1.49] and R9 [1, 49], according to the parameter Q chosen equal to 5.

As before, it is possible in this format to standardize the number of repair symbols per source symbol. Thus, FIG. 12 shows an exemplary format of a DB data block with 49 source symbols and 9 repair symbols, derived from the format of FIG. 11, and in which each source symbol is protected by five repair symbols. The size and distribution of the sub-blocks in the data block DB is unchanged from the format shown in FIG. 11. The repair symbols R1 to R5 are all calculated from the first source symbol S [1] of the block of DB data. On the other hand, the other repair symbols R6 [11,49], R7 [21,49], R8 [31,49] and R9 [41,49] are respectively calculated from the source symbols S [1 1], S [21], S [31] and S [41].

FIG. 13 shows an exemplary format of a data block DB with 49 source symbols and 9 repair symbols, obtained by the procedure P2, when the number Q of repair symbols at the end of the data block DB is chosen. equal to 6. The procedure P2 makes it possible to define a division of the data block DB into NB = 4 sub-blocks each comprising KB = 12 source symbols, the number Δ being equal to 1. This distribution therefore implies adding a source symbol in one of the sub-blocks, for example the last sub-block. The data block DB of FIG. 13 thus comprises 3 sub-blocks SB [1,12], SB [13,24] and SB [25,36] comprising 12 source symbols and an SB sub-block [37,49] of 13 source symbols, each sub-block being immediately followed by a repair symbol RI [1,12], R2 [1,24], R3 [1,36] and R4 [1,49]. The last sub-block SB [37,49] is followed by six repair symbols R4 [1,4,], R5 [1,49], R6 [1,49], R7 [1,49], R8 [1, 49] and R9 [1,49], according to the parameter Q chosen equal to 6.

As before, it is possible in this format to standardize the number of repair symbols per source symbol. Thus, FIG. 14 shows an exemplary format of a DB data block with 49 source symbols and 9 repair symbols, derived from the format of FIG. 13, and in which each source symbol is protected by six repair symbols. The size and distribution of the sub-blocks in the data block DB is unchanged from the format shown in FIG. 13. The repair symbols R1 to R6 are always calculated from the first source symbol S [l] of the DB data block. On the other hand, the other repair symbols R7 [13,49], R8 [25,49] and R9 [37,49] are calculated from the source symbols S [13], S [25] and S [37], respectively.

Figures 15 to 18 show variation curves of the probability of lost symbol RT repair time, for different data block formats. These curves were obtained by simulating a transmission of blocks of 100 source symbols and 125 symbols in total, with a bit rate of 1 Mb / s. The transmission time was set at 100 ms. Each measurement was obtained by simulating the transmission of 10 ⁷ source symbols, or 10 ⁵ blocks of data. Symbol losses are obtained from a Bernouilli loss model. The repair time of a source symbol corresponds to the time between the moment when the source symbol should have been received in the absence of an error and the moment when the source symbol is restored.

Figure 15 shows curves C1 to C5 of variation in repair probability versus repair time, when all repair symbols are transmitted at the end of the data block (Figure 3). Curves C1 to C5 were obtained with symbol loss rates at 1, 5, 10, 15 and 20%, respectively. From the Cl curve, the repair probability is 0.4 and 1, for repair times of about 50 ms and 90 ms, respectively. The lost symbol repair time gradually increases as the symbol loss rate increases. Thus, according to curve C2, the repair time goes to about 820 ms and 92 ms with probabilities of 0.4 and 1, respectively. From curve C3, the repair time increases to about 91 ms and 96 ms, with probabilities of 0.4 and 1, respectively. From curve C4, the repair time increases to about 94 ms and 98 ms, with probabilities of 0.4 and 1, respectively. From curve C5, the repair time increases to about 96 ms and 100 ms with probabilities of 0.4 of 1, respectively.

FIG. 16 shows curves Ci 1 to C 15 of variation in the probability of repair of symbols lost as a function of the repair time, when the format of the transmitted data blocks comprises as many sub-blocks as of repair symbols at the end of the block of data, and when all the sub-blocks are protected substantially by the same number of repair symbols (Figure 12). Curves Ci to C15 were obtained with symbol loss rates at 1, 5, 10, 15 and 20%, respectively. From the curves Ci l to C15, the lost symbol repair time is between about 3 and 7 ms, with a probability of 0.4. From the Ci 1 curve, the repair probability is 1 for a symbol repair time lost at approximately 16 ms. This repair time increases gradually as the symbol loss rate increases. Thus, according to the curve C12, the symbol repair time lost reaches about 50 ms with a probability close to 1. According to the curve Cl 3, this repair time goes to about 50 ms and 96 ms with probabilities of 0.9 and 1, respectively. From curve C14, the lost symbol repair time increases to about 74 ms and 98 ms with probabilities of 0.8 and 1, respectively. From curve C15, the lost symbol repair time increases to approximately 84 ms and 98 ms with probabilities of 0.8 and 1, respectively. The format of FIG. 12 thus displays much better performance in terms of lost symbol repair latency than the conventional format of FIG.

Fig. 17 shows curves C21 to C25 of variation in the probability of repairing symbols lost as a function of the repair time, when the format of the transmitted data blocks comprises two or three repair symbols at the end of the data block (Figs. 9 or 10). Curves C21 to C25 were obtained with symbol loss rates of 1, 5, 10, 15 and 20%, respectively. From curves C21 to C25, the repair time is less than about 7 ms, with a probability of 0.6. From curve C21, the repair probability is 1 to about 10 ms. The repair time increases gradually as the rate of symbol loss increases. According to curve C22, the repair time reaches about 20 ms with a probability close to 1. According to the curve C23, the repair time goes to about 46 ms with a probability of 1. According to curve C24 , the repair time increases to approximately 80 ms with a probability of 1. According to curve C25, the repair time is less than 70 ms when the probability is higher than 0.95, and reaches 98 ms with a probability of 1. The format of Figure 9 or 10 therefore has better performance in terms of repair latency than the format of Figure 12.

Fig. 18 shows curves C31 to C35 of variation in the probability of repairing symbols lost as a function of the repair time, when the format of the data blocks transmitted comprises as many sub-blocks as repair symbols (FIG. 7). Curves C31 to C35 were obtained with symbol loss rates at 1, 5, 10, 15 and 20%, respectively. From curves C31 to C35, the repair time is less than about 10 ms, with a probability of 0.8. From curve C31, the repair probability is 1 to about 7 ms. The repair time increases gradually as the rate of symbol loss increases. According to the curve C32, the lost symbol repair time reaches about 20 ms with a probability close to 1. According to the curve C33, this repair time goes to about 34 ms with a probability of 1. the curve C34, this repair time goes to about 56 ms with a probability of 1. According to the curve C35, this repair time is less than 30 ms when the probability is greater than 0.95, and reaches 74 ms with a probability of 1. The format Figure 7 therefore shows better performance in terms of repair latency than the format of Figure 9 or 10.

Figures 19 to 23 show variation curves of the probability of access time to a data stream, for different data block formats. These curves were also obtained by simulating a transmission of blocks of 100 source symbols and 125 symbols in total, with a bit rate of 1 Mb / s. The transmission time was set at 100 ms. Each measurement was obtained by simulating the transmission of 10 ⁷ source symbols, or 10 ⁵ blocks of data. Symbol losses are obtained from a Bernouilli loss model. The access time to the data stream is calculated assuming that the access time to the flow occurs in the 50 ^th symbol of the second source block of transmitted data. In the absence of a symbol loss between the instant of access to the data stream and the moment of reception of the last symbol of the first data block received, or of the sliding window, the access time to the stream is fixed. at 0 ms. FIG. 19 represents curves C41 to C45 of variation of the probability of data flow access time, when the format of the data blocks transmitted comprises a single sub-block, all the repair symbols being transmitted at the end. from the data block (Figure 3). Curves C41 to C45 were obtained with symbol loss rates at 1, 5, 10, 15 and 20%, respectively. Curves C41 to C45 show that the access time does not exceed about 150 ms (reached with a probability of 1). According to the curve C41, the access time is zero with a probability slightly greater than 0.6. The access time reaches 50 ms with a probability of about 0.75, and reaches 150 ms with a probability greater than 0.85. From curve C42, the access time to the data stream is less than 150 ms with a probability of less than about 0.12. According to the curves C43 to C45, the access time is less than 150 ms with a probability close to 0.

FIG. 20 represents curves C51 to C55 of variation of the access time probability, when the format of the transmitted data blocks comprises as many sub-blocks as repair symbols grouped at the end of the data block (FIG. or 12). Curves C51 to C55 were obtained with symbol loss rates at 1, 5, 10, 15 and 20%, respectively. From curves C51 to C55, the access time is less than about 50 ms, with a probability greater than 0.75. According to the curve C51, the access time is zero with a probability close to 0.6. According to the curves C51, C52, the access time at 50 ms is reached with a probability close to 1. According to the curve C53, the probability of 1 is reached with an access time of about 100 ms. From curves C54 and C55, the probability of 1 is reached with an access time of about 150 ms. According to the curve C54, the access time is between 50 and 150 ms with a probability greater than 0.9. According to curve C55, the access time is between 50 and 150 ms with a probability greater than 0.75. The format of Figure 9 or 10 therefore has better performance in terms of access latency than the format of Figure 3.

Fig. 21 shows curves C61 to C65 of varying the access time probability, when the format of the transmitted data blocks comprises two or three repair symbols at the end of the data block (Figs. 9 or 10). Curves C61 to C65 were obtained with symbol loss rates at 1, 5, 10, 15 and 20%, respectively. From curves C61 to C65, the access time is less than about 50 ms, with a probability greater than 0.9. According to the curve C61, the access time is zero with a probability close to 0.6. According to the curves C61, C62, C63, the access time at 50 ms is reached with a probability close to 1. According to the curve C64, the probability of 1 is reached with an access time of approximately 130 ms. According to curve C65, the access time increases to about 150 ms with a probability greater than 0.95. The format of Figure 9 or 10 therefore has better performance in terms of access latency than the format of Figure 11 or 12.

FIG. 22 represents curves C71 to C75 of variation of the access time probability, when the format of the transmitted data blocks comprises as many sub-blocks as of repair symbols (FIG. 7). Curves C71 to C75 were obtained with symbol loss rates at 1, 5, 10, 15 and 20%, respectively. From curves C71 to C75, the access time is less than about 50 ms, with a probability greater than 0.95. According to the curve C71, the access time is zero with a probability close to 0.6. According to the curves C71, C72, the access time at 50 ms is reached with a probability close to 1. According to the curve C73, the probability of 1 is reached with an access time of about 70 ms. From curves C74, C75, the probability of 1 is reached with an access time of about 150 ms. According to curve C74, the access time is between 50 and 150 ms with a probability greater than 0.9. According to curve C75, the access time is between 50 and 150 ms with a probability greater than 0.8. The format of Figure 7 therefore has better performance in terms of access latency than the format of Figure 9 or 10.

From the curves of Figures 19 to 22, the access time JT to a data stream is limited to a value less than about 150 ms in the case where the data is organized into data blocks.

FIG. 23 represents curves C81 to C84 of variation of the access time probability, when the format of the data blocks transmitted is in the form of that of FIG. 5 with a window w of 50 source symbols. Curves C81 to C84 were obtained with symbol loss rates at 1, 5, 10 and 15%, respectively. At symbol loss rates of 20% and above, the access time to the data stream tends to infinity. According to the curve C81, the access time is zero with a probability close to 0.6, and slightly greater than 50 ms with a probability of 1. The curve C82 reaches a probability close to 1, with an access time of about 80 ms. From the curve C83, a probability close to 1 is reached with an access time of about 150 ms. According to curve C84, a probability close to 1 is reached with an access time of about 500 ms. The format of Figure 5 therefore presents poorer performance in terms of access latency than the other formats studied.

According to one embodiment, a content server comprising or coupled to the TDV transmitter device, broadcasts multi-broadcast (multicast) content to a set of terminals such as mobile terminals, including the RDV receiver device. Thus, FIG. 24 represents an example of such a CNTP content server connected to an IPN network, such as the Internet network, via an MBMS server implementing a Multimedia Broadcast Multicast Service (MBMS) or eMBMS service. (enhanced MBMS). The UE terminals are connected each of the UTRN mobile networks which are connected to the IPN network via MGW gateways. The content provided by the CNTP server is broadcast in accordance with one of the formats described above. Some of the UEs with poor reception conditions may send on a return channel a return message signaling poor reception conditions to the CNTP content server. Thus, the return message may indicate a packet loss rate, a residual loss rate after exploitation of the repair symbols, characteristics relating to the quality of the received signal.

In response, the CNTP content server sends to terminals that have reported poor reception conditions, on unicast channels, one or more additional repair symbols for each data block sent by the content server's TDV sending device. CNTP for a certain period. Thus, the CNTP content server can transmit multi-broadcast content to several tens of thousands of UE terminals, and transmit in point-to-point mode additional repair symbols to several hundred UE terminals reporting bad reception conditions. quality. These provisions make it possible to provide a multicast content service, while guaranteeing reception quality, without using a large bandwidth on point-to-point channels, since only repair symbols are transmitted by these channels.

The sending to the server by a terminal of a return message indicating good reception conditions may terminate the sending of additional repair symbols for this terminal. In addition to this sending being stopped at the end of the transmission of the broadcasted content, it may also be terminated at the end of a certain period. The terminals then always have the possibility issue new return messages signaling poor reception conditions, to trigger again the sending of additional repair symbols in point-to-point broadcast mode.

Note that the processing of the signaling messages of good or bad reception conditions, and the transmission of supplementary repair symbols, may be performed by a server other than the CNTP content server, for example a server such as the MBMS server, ensuring the dissemination of the content to EU terminals. Furthermore, the multicast service can be implemented by other means and other protocols than those illustrated by way of example in FIG. 24. For example, the multicast service can be implemented in a WiFi network.

It will be apparent to those skilled in the art that the present invention is capable of various alternative embodiments and various applications. In particular, it can be expected to assign two (or more) repair symbols to each sub-block. However, this solution can be considered as not optimum in terms of correction latency, compared to the solution of doubling the number of sub-blocks per block of data and assigning a single repair symbol to each sub-block.

On the other hand, the source symbols from which each of the repair symbols are calculated are not necessarily consecutive in the data block, and do not necessarily include the source symbol transmitted immediately before the repair symbol.

Claims

A method of transmitting data, comprising the steps of: encoding data to be transmitted in the form of source symbols (S) grouped into data blocks (DBs),

assign each data block a number of repair symbols (R1-R9), and for each block of data:

distributing the source symbols of the data block into sub-blocks (SB), the number of sub-blocks being equal to the number of repair symbols allocated to the data block,

assign a repair symbol to each sub-block of the data block, calculate the repair symbol of each sub-block of the data block by a linear combination of source symbols of the sub-block and the source symbols of previous sub-blocks in the data block, and

transmitting the data block in a stream of data blocks, successively transmitting each sub-block of the data block, each sub-block being transmitted by transmitting the source symbols of the sub-block, followed by the repair symbol of the sub-block .

The method of claim 1, wherein each repair symbol (R1-R9) of the data block is computed by a linear combination of at least a portion of the source symbols (S) of the data block, so that each source symbol of the data block is used to calculate the same number, at a close, of repair symbols of the data block.

The method of claim 1, wherein each repair symbol (R1-R9) of the data block (DB) is computed by a linear combination of all previously transmitted source symbols (S) of the data block.

4. Method according to one of claims 1 to 3, wherein several repair symbols (R) calculated from at least part of the source symbols (S) of the last sub-block (SB [.., 49] ) of the data block, (DB) are transmitted at the end of the data block.

5. Method according to one of claims 1 to 4, wherein each sub-block (SB) of the data block (DB) comprises the same number, to a close, of source symbols (S).

6. Method according to one of claims 1 to 5, wherein the data block (DB) comprises as many sub-blocks (SB) as repair symbols (R) transmitted at the end of the data block.

7. Method according to one of claims 1 to 6, comprising steps of defining a format of the data block (DB), consisting of:

define a first number (Q) of repair symbols (R) to be transmitted at the end of the data block,

determining a number (NB) of sub-blocks (SB) of the data block according to the first number and a number of repair symbols allocated to the data block, or determining the number (nk) of repair symbols (R ) allocated to the data block according to the number of sub-blocks of the data block and the first number,

calculating a minimum number (KB) of source symbols (S) per sub-block by dividing the number (k) of source symbols in the data block by the number of sub-blocks, the minimum number of source symbols being set equal to greater integer less than or equal to the result obtained from the division, and

calculating a difference (Δ) between the number of source symbols of the data block and the product (NB KB) of the number of sub-blocks in the data block by the minimum number of source symbols per sub-block, the difference defining a number of source symbols to be added in the sub-blocks of the data block.

The method according to claim 7, wherein the deviation (Δ) defines a number of sub-blocks (SB) of the data block (DB) comprising a number of source symbols (S) equal to the minimum number (KB). of source symbols per sub-block, increased by one.

9. Process according to one of claims 1 to 8, comprising the steps of:

receiving from a user terminal (UE) in point-to-point mode, a message signaling poor reception conditions, and

transmitting to the terminal in point-to-point mode, in response to the message, at least one repair symbol (R) for each block of data transmitted after receiving the message.

Method for receiving data transmitted in accordance with the transmission method according to one of claims 1 to 9, the reception method comprising successive steps of receiving the sub-blocks (SB) of source symbols (S) of a block. data (DB), the reception of each sub-block being followed by the reception a repair symbol (R) associated with the sub-block, each repair symbol corresponding to a linear combination of the source symbols of the sub-block associated with the repair symbol.

The method of claim 10, comprising the steps of: detecting a missing or erroneous source symbol (S) in the data block, and

upon receipt of a first repair symbol (R) following the missing or erroneous source symbol, calculating the missing or erroneous source symbol by solving an equation resulting from the equality between the first repair symbol and a linear combination corresponding to the first symbol of repair.

The method of claim 10 or 11, comprising steps of:

detect bad reception conditions of data blocks transmitted in a multicast mode,

transmit in point-to-point mode, to a server (CNTP, MBMS), a message signaling poor reception conditions, and

receiving in point-to-point mode, for data blocks (DBs) received in the multicast mode, additional repair symbols usable for calculating missing source symbols (S) in the received data blocks.

Data transmission device configured to implement the method according to one of claims 1 to 9.

14. Data receiving device configured to implement the method according to one of claims 10 to 12.