Data transmission method and apparatus

[0001] The present invention relates to a data transmission method and apparatus and more particularly to video streaming applications.

[0002] In video and multimedia communications many applications exist in which video streams are delivered over non-reliable channels. Examples of such applications include personal computers, TV apparatus and computer cards, MPEG decoders and boards, multimedia transceiver systems and set-top receiver units, DVD devices, video recorders and CCD cameras, video signal equipment, frame grabbers and image capture boards, industrial and medical imaging products, video printers and projectors, or the like. It will therefore be appreciated that many kinds of video streaming applications in the consumer market as well as professional applications exist both in software and hardware.

[0003] A video stream consists of a flow of bit-packets called frames that contain information about the video picture itself as well as some meta information such as time stamps. The frames contain the video information in different formats depending on the video compression. Some of these frames can be used independently, so-called intra-coded frames or I-frames, while others depend on the preceding frame, so-called predictive-coded frames or P-frames.

[0004]FIG. 1 illustrates a conventional video streaming system. Video server <b>110</b> transmits video data through channel <b>150</b> to video client <b>160</b>. For this purpose, the video server <b>110</b> includes a transmitter buffer unit <b>130</b> which receives video frames with nearly no delay from video source application <b>120</b>. The bit rate of this internal transmission is only limited by the video source application's bit rate. In the transmitter buffer unit <b>130</b> the frames first undergo segmentation, i.e. splitting data packets by lower layer protocols into smaller segments with the number of segments depending on the length of the packet, which is variable and may for instance amount to 200 or 2,000 byte. This segmentation determines one part of the transmission time for the respective packet.

[0005] Once the frames have undergone segmentation the segments are sent on the channel in defined time slots according to the available channel bit rate. In unreliable channels 150 bit errors occur and the available channel bit rate varies in time, if the channel is shared by multiple users. This leads to a significant and variable propagation delay.

[0006] Access to the channel <b>150</b> is given to the transmitter buffer unit <b>130</b> by channel access controller <b>140</b>. As the bit rate of channel <b>150</b> is lower than the bit rate of the video stream received from video source application <b>120</b>, those segments which could not be sent are buffered by the transmitter buffer unit <b>130</b> in a first-in-first-out (FIFO) queuing discipline. The transmission buffer unit and the channel access controller are isolated entities and totally independent from the video application. Hence, the video source application <b>120</b> does not receive any feedback about the status of the frames as to whether they are already sent or whether they are buffered. All data will be sent by the transmitter buffer unit <b>130</b> in the order it arrived.

[0007] The segments or PDUs (protocol data units) transmitted by the video server <b>110</b> are received by the video client <b>160</b> in a receiver buffer unit <b>170</b>. The receiver buffer unit <b>170</b> includes a buffer for storing the received data, and also reassembles the frames from the segments. The video frames are then sent to video display application <b>180</b> which might for example likewise be a storage device or the like.

[0008] Two main problems occur in video transmissions over unreliable links. The first problem is that because of changes in the channel condition, the bit error rate may increase such that packet loss occurs. Since compressed video streams are extremely susceptible for packet loss, the video quality is decreased dramatically. The second problem may arise from the variable and sometimes very high delay of the video data which might lead to situations in which the delay requirements for the transmission are no longer fulfilled and the video performance again is decreased dramatically.

[0009] For reducing the packet loss several mechanisms exist in the prior art. One of these mechanisms is a method called automatic repeat request (ARQ), according to which the loss of a packet is detected in the receiver and the transmitter is informed accordingly. The transmitter then automatically repeats the transmission of the lost packet so that missing video frames are retransmitted. However, not all of the lost packets can be retransmitted because of the delay requirements and/or limited bandwidth of the transport channel. Moreover, such prior art systems lead to a higher delay which might not be tolerable in any case.

[0010] A prior art system for overcoming the second problem, i.e. the occurrence of a variable and sometimes very high channel delay, is called Real-Time Transport Protocol (RTP). To control the display times and cope with the real time requirements, this protocol adds some information to the video frames such as time stamps and sequence numbers, encapsulated in RTP packets. This information is used to send the video frames at the right time and in correct sequence. The receiver may perform some measurements, e.g. of delay jitter, and may signal the results to the source by means of the RTP control protocol (RTCP).

[0011] One approach to deal with both problems, i.e. packet loss and channel delay, is to improve the RTP technique such that only the I-frames are retransmitted and that before sending any frame a judgement is made whether the retransmitted I-frame would still arrive in time. Such integration of retransmission mechanisms in the RTP technique can be for instance done by using multi-purpose acknowledgement (MACK) packets which can be extended by protocol-specific fields. By restricting retransmission to I-frames and introducing a timer-based judgement for deciding whether to send a frame or to discard it, both problems are addressed, leading to an increased video quality because more frames can be displayed. The delay is kept in a reasonable range by discarding “old” frames, i.e. frames that would be received after expiration of their display time.

[0012] Such systems however, would have a significant degree of inadaptability because the retransmissions are limited to the I-frames even when enough free bandwidth is available to retransmit all frames. In certain channel conditions many correctly received P-frames are discarded at the video client, because the preceding P-frame was not received correctly.

[0013] Moreover, such techniques perform poorly because frames are sent which should have been discarded and vice versa. This is because the judgement whether to send a frame or to discard it is based on a fixed estimated transmission time which is set at the beginning of the transmission for every packet and is the same for all the packets, being independent of the channel status and the respective packet length. The fixed estimated transmission time is needed to calculate the time at which the frame would be received.

[0014] A similar method for selectively retransmitting missing data packets of a data stream is disclosed in U.S. Pat. No. 5,918,002. Retransmission is prioritized based on data types of the data packets. For example, since parent I-frames are needed to render dependent child P-frames, data packets which include I-frames are assigned higher priority for transmission and/or retransmission over data packets which include only P-frames. Moreover, the sequence of retransmission requests is priority-dependent.

[0015] Another technique which is concerned with resuming playback taking into consideration the different importance of I- and P-frames is disclosed in U.S. Pat. No. 5,784,527.

[0016] In U.S. Pat. No. 5,768,527 it is disclosed that upon detection of a lost packet the client device requests a number of multiple copies of the lost packet, with said number depending on the importance of the lost frame.

[0017] The mentioned prior art, however, leads to the above-described disadvantages when transmitting video data through an unreliable channel, that is, a reduced video stream quality due to a restricted capacity and because the prior art techniques may use the channel bandwidth inefficiently.

[0018] It is therefore the object of the invention to provide a method and an apparatus for receiving and transmitting video data forming a data stream leading to increased video quality when being operated on an unreliable channel.

[0019] This object is solved according to the invention as defined in the independent claims.

[0020] According to the invention, retransmission of lost data frames is performed based on a comparison of the priority level of the frame with a threshold value. This goes beyond the teaching of the prior art in that not only I-frames may be retransmitted. Consequently, by providing a priority threshold, the invention allows for adapting the transmission capability to a number of factors including actual channel properties. According to a preferred embodiment, the priority level of any data frame to be transmitted is compared with the threshold value. With the invention it is therefore possible to increase the video quality even when the priority threshold value is fixed.

[0021] The invention is therefore in particular advantageous when applied to compressed video (e.g. MPEG-4) streaming transmissions over unreliable (e.g. wireless) links.

[0022] Comparing the priority level of the missing data frame with a threshold value and transmitting the frame on the basis of the comparison result may advantageously be performed at the server side as well as the client side. If the decision is made in the client there is no need to send retransmission requests in those cases where the decision is denied, but the priority of the actual frame has to be transmitted. This leads to a most efficient use of the channel bandwidth in uplink direction, however the transmitted data in downlink direction is slightly increased.

[0023] On the other hand, when the transmission decision is done on the server side, the server receives feedback information which might be valuable. Moreover, the client would advantageously be of a more inexpensive constructional design.

[0024] Preferred embodiments of the invention are defined in the dependent claims.

[0025] If the transmission decision is done on the server side, it is advantageous when the client's retransmission requests include the reception times and frame lengths of two preceding data frames. Using this information, the server would be in the position to most efficiently update his knowledge about the channel state, keep the delay requirements and use the channel bandwidths.

[0026] Moreover, since in contrast to the prior art systems the transmission time of the packets is measured during the video streaming, they are no longer assumed to be the same for all packets. Changes in the transmission time may therefore lead to a dynamic adaptation of the video stream quality to changing channel conditions.

[0027] Independently of whether the transmission decision is performed on the transmitter or on the receiver side, priority levels are assigned to the data frames preferably based on the logical depth of multidependency. By this measure it is incidentally taken into consideration that those frames which are independent (I-frames) are the most important frames, whereas dependent frames are less important. Moreover, in contrast to the prior art, even the group of dependent frames is divided into more important and less important frames. This allows for fine tuning the retransmission behaviour to an extent which is not known from the prior art.

[0028] Another advantage of the present invention is that the improvement of the video quality may be increased by making the transmission decision dynamically. This is done according to a preferred embodiment of the invention by calculating the priority threshold value based on the measured available channel bandwidth. Additionally, the measured sending bit rate may be used. Consequently, the compensation for missing packets may be improved once again.

[0029] Furthermore, the invention may be combined with the requirement that a lost frame is retransmitted only when it is expectable that the retransmitted frame will still arrive in time. In particular in cases where the channel bandwidth is shared between several users or applications it is very important to transmit as little data as possible. This is true in particular because the user might pay for the used bandwidth, i.e. the transmitted bits. If there are video packets retransmitted which would not reach the receiver in time because of the high utilization of the channel, bandwidth is wasted. This bandwidth could be used either for the retransmission of frames which have a higher priority or by other users or applications.

[0030] The invention will now be described in more detail with reference to the accompanying drawings, in which:

[0031]FIG. 1 is a prior art video streaming system;

[0032]FIG. 2 is a video streaming system according to a preferred embodiment of the invention;

[0033]FIG. 3 is a graph illustrating the priority assignment to the frames according to the preferred embodiment of the invention;

[0034]FIG. 4 is a flow chart illustrating the process of sending a video stream;

[0035]FIG. 5 is a flow chart illustrating the retransmission decision in the process of sending a video stream as depicted in FIG. 4;

[0036]FIG. 6 is a flow chart illustrating a first example of the priority decision being part of the retransmission decision depicted in FIG. 5;

[0037]FIG. 7 is a flow chart illustrating a second example of the priority decision;

[0038]FIG. 8 is a flow chart illustrating a third example of the priority decision; and

[0039]FIG. 9 is a flow chart illustrating the process of receiving a video stream.

[0040] Referring now to FIG. 2, the video server <b>110</b> includes a video source application <b>120</b>, a transmission buffer unit <b>130</b> and a channel access controller <b>140</b> which function substantially as described in the context of the prior art video streaming system of FIG. 1. Similarly, the video client <b>160</b> includes a receiver buffer unit <b>170</b> and a video display application <b>180</b>. Data are sent from the video server <b>110</b> to the video client <b>160</b> through channel <b>150</b>.

[0041] The video client <b>160</b> further comprises loss detection unit <b>240</b>, which is connected to the receiver buffer unit <b>170</b>. Once the loss detection unit <b>240</b> detects that a frame is missing, it generates a retransmission request which preferably includes the reception times and frame lengths of two preceding data frames. For this purpose, the loss detection unit <b>240</b> stores during normal operation the time stamp and length of the most recent two packets. Once the retransmission request has been generated, which might be a non-acknowledgement (NACK) or a multi-purpose acknowledgement (MACK) packet, the request undergoes segmentation by transmitter buffer unit <b>250</b> and is sent under control of channel access controller <b>260</b> through channel <b>150</b> to video server <b>110</b>.

[0042] In the video server <b>110</b>, receiver buffer unit <b>230</b> receives the data and reassembles the request. The request is then forwarded to control unit <b>210</b>, and to the retransmission buffer <b>220</b>. The retransmission buffer buffers the I- and P-frames sent from the video source application <b>120</b> to the transmitter buffer unit <b>130</b> for retransmission purposes.

[0043] The control unit <b>210</b>, upon receiving the time and length information of the two most recent packets, updates the priority thresholds. When receiving video frames from the video source application <b>120</b> or the retransmission buffer <b>220</b>, it performs the transmission decision on the basis of the priority levels assigned to the data frames. The assignment of priorities to frames is illustrated in more detail in FIG. 3.

[0044] As apparent therefrom, according to the present invention I-frames have been given the highest priority since an I-frame can be displayed by video display application <b>180</b> independently from other frames. The first P-frame which closely follows the I-frame depends only on the preceding I-frame. The second P-frame depends on the first P-frame, and since the first P-frame depends on the I-frame, the second P-frame is two-fold dependent and therefore less important than the first P-frame. This scheme may be adopted for the following P-frames so that P-frames with higher depth of multidependency, i.e. later P-frames, are more unimportant and are therefore given the lower priority levels. In the embodiment of FIG. 3 the priority is set to 1/n for the n-th P-frame. It will however be appreciated by those of ordinary skill in the art that another functional dependency may be chosen.

[0045] Referring now to FIG. 4, the process of sending a video stream includes the step of receiving a video frame from the video source application <b>120</b> (step <b>410</b>). Then it is checked in step S<b>420</b> whether a retransmission request has been received. If no retransmission request has been received, the process proceeds with step S<b>440</b>, otherwise the information from the retransmission request is used to update the channel estimation first (step S<b>430</b>). In step S<b>440</b> the transmission decision is made, which will be described in detail in the next figures.

[0046] The transmission time of a frame consists of two parts. One part is independent of the length of the frame, whereas the other part is length dependent. The frame-length independent time consists mainly of the network delay, i.e. the propagation delay, and the buffering delay due to congestion. In contrast, the frame-length dependent delay is determined by the segmentation and the available bandwidth. The following equation describes the transmission delay of frame i:

<i>D</i>_i<i>t</i>₁<i>+i</i>_l<i>·t</i>₂,

[0047] where D_iis the transmission delay, l_iis the frame length in bits, t₁is the frame-length independent time₁and t₂is the frame-length dependent time per bit.

[0048] Assuming that the times t₁and t₂are nearly constant between two packet arrivals, the equation can be resolved when the transmission delays D, and D₂Of two preceding frames have been previously measured: <maths id="MATH-US-00001" num="1"><math overflow="scroll"><mrow><mrow><msub><mi>t</mi><mn>1</mn></msub><mo>=</mo><mfrac><mrow><mrow><msub><mi>D</mi><mn>2</mn></msub><mo></mo><msub><mi>l</mi><mn>1</mn></msub></mrow><mo>-</mo><mrow><msub><mi>D</mi><mn>1</mn></msub><mo></mo><msub><mi>l</mi><mn>2</mn></msub></mrow></mrow><mrow><msub><mi>l</mi><mn>1</mn></msub><mo>-</mo><msub><mi>l</mi><mn>2</mn></msub></mrow></mfrac></mrow><mo>,</mo><mstyle>&lt;mtext /&gt;</mstyle><mo></mo><mrow><msub><mi>t</mi><mn>2</mn></msub><mo>=</mo><mrow><mfrac><mrow><msub><mi>D</mi><mn>1</mn></msub><mo>-</mo><msub><mi>D</mi><mn>2</mn></msub></mrow><mrow><msub><mi>l</mi><mn>1</mn></msub><mo>-</mo><msub><mi>l</mi><mn>2</mn></msub></mrow></mfrac><mo>.</mo></mrow></mrow></mrow></math><img file="US20020004838A1-20020110-M00001.TIF" id="EMI-M00001" he="37.9323" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00001" attachment-type="nb" file="US20020004838A1-20020110-M00001.NB" /></attachments></maths>

[0049] It is consequently possible to calculate the transmission delay of a missing frame from the times t₁and t₂which are evaluated on the basis of the transmission delays of two preceding frames. For this purpose, loss detection unit <b>240</b> stores the reception times and packet lengths of the most recent frames. If an error occurs, these values and the values of the missing or erroneously received frame are transmitted to the video server <b>110</b>. This can be done either by attaching a Receiver Report to the NACK packet or by using a MACK packet. The overhead added by supplementing the NACK or MACK packet with such additional information is negligibly small.

[0050] If it is decided in step S<b>440</b> that the frame should be discarded, the process proceeds with step S<b>460</b>. If the frame should be sent to the transmission buffer <b>130</b>, step S<b>450</b> is executed. Then the sending bit rate is updated in step S<b>470</b> and the control unit <b>210</b> will wait for the next frame to receive from the video source application <b>120</b> or the retransmission buffer <b>220</b> (step S<b>410</b>).

[0051] The transmission decision of step S<b>440</b> will now be explained in more detail with reference to FIG. 5. Before comparing the priority with a threshold value, a mechanism is introduced to decide whether the frame should be sent or discarded according to an estimated arrival time since it is not necessary to send frames that are already too late. For that purpose, the arrival time of the frame is estimated, i.e. the transmission delay is calculated in step S<b>510</b>.

[0052] If it is then determined in step S<b>520</b> that the estimated arrival time is later than the desired time to display the video frame, the frame will be discarded instead of being transmitted. Otherwise, control unit <b>210</b> evaluates the priority of the missing frame as will be now explained in more detail.

[0053] Referring now to FIG. 6, control unit <b>210</b> first obtains the priority level of the frame in step S<b>610</b>, and then accesses the fixed threshold level in step S<b>620</b>. There should be two different priority levels. One for frames transmitted for the first time (possibly all frames are transmitted for the first time) and for the retransmissions. The fixed threshold levels have been defined at the time of transmission set-up according to the channel condition and video bit rate at that time. It is then decided in step S<b>630</b> whether the priority level of the frame exceeds the priority threshold level. Only if this is the case, the frame is transmitted. Otherwise, it is decided to discard the frame.

[0054] While this advantageously involves a minimum overhead and implementation effort only, it may be improved as apparent from FIG. 7. The process illustrated in FIG. 7 differs from that of FIG. 6 mainly in that not a fixed threshold level is used but that the priority threshold is calculated based on the measured available channel bandwidth (steps S<b>710</b>, S<b>720</b>). This scheme is based on the idea that, if only a small bandwidth of the channel is available, it might be better to send frames with higher priority only.

[0055] Since the available bandwidth is the reciprocal of t₂, the measurement of the available channel bandwidth can make use of the above-mentioned measurement of transmission delays: <maths id="MATH-US-00002" num="2"><math overflow="scroll"><mrow><msub><mi>B</mi><mi>ch</mi></msub><mo>=</mo><mrow><mfrac><mn>1</mn><msub><mi>t</mi><mn>2</mn></msub></mfrac><mo>.</mo></mrow></mrow></math><img file="US20020004838A1-20020110-M00002.TIF" id="EMI-M00002" he="18.00225" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00002" attachment-type="nb" file="US20020004838A1-20020110-M00002.NB" /></attachments></maths>

[0056] The available channel bandwidth B_chmeasured in step S<b>710</b> is then used in step S<b>720</b> to calculate the priority threshold value P_thaccording to the following equation: <maths id="MATH-US-00003" num="3"><math overflow="scroll"><mrow><msub><mi>P</mi><mi>th</mi></msub><mo>=</mo><mrow><mi>k</mi><mo>·</mo><mfrac><msub><mi>B</mi><mi>v</mi></msub><msub><mi>B</mi><mi>ch</mi></msub></mfrac></mrow></mrow></math><img file="US20020004838A1-20020110-M00003.TIF" id="EMI-M00003" he="18.00225" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00003" attachment-type="nb" file="US20020004838A1-20020110-M00003.NB" /></attachments></maths>

[0057] where B_vis the bandwidth needed for the video transmission if no retransmissions are performed at all,_land k is a factor to adapt the mechanism to the system and the bit error rate which is assumed to be fixed for the transmission. There should be two different k-factors. One for transmissions for the first time (possibly all frames should be transmitted for the first time) and one for the retransmissions.

[0058] Yet another improvement of the priority decision process may be achieved as illustrated in FIG. 8 by additionally measuring the bit rate of the sent frames in step S<b>810</b>. This improvement is based on the discovery that with bad channel conditions, i.e. high bit error rates, the number of frames to be retransmitted increases. It is therefore advantageous to monitor the amount of data that was sent to ensure that enough channel bandwidth is reserved to transmit at least the important frames. To estimate the bit rate of sent frames, an average bit rate over a number of preceding frames which were sent is calculated according to the following equation: <maths id="MATH-US-00004" num="4"><math overflow="scroll"><mrow><msub><mi>B</mi><mi>s</mi></msub><mo>=</mo><mrow><mfrac><mrow><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mi>q</mi></mrow><mi>p</mi></munderover><mo></mo><msub><mi>l</mi><mi>i</mi></msub></mrow><mrow><msub><mi>t</mi><mi>q</mi></msub><mo>-</mo><msub><mi>t</mi><mi>p</mi></msub></mrow></mfrac><mo>.</mo></mrow></mrow></math><img file="US20020004838A1-20020110-M00004.TIF" id="EMI-M00004" he="35.0406" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00004" attachment-type="nb" file="US20020004838A1-20020110-M00004.NB" /></attachments></maths>

[0059] In this equation, B_sis the bit rate of the sent frames, p and q denote the oldest and the most recently sent frames, and l_j, t_qand t_pare the previously stored lengths in bits and transmission times of the respective frames.

[0060] Using the bit rate B_sof sent frames measured in step S<b>810</b>, the priority threshold value P_this then calculated in step S<b>820</b>, similarly to the calculation described above: <maths id="MATH-US-00005" num="5"><math overflow="scroll"><mrow><msub><mi>P</mi><mi>th</mi></msub><mo>=</mo><mrow><mi>k</mi><mo>·</mo><mrow><mfrac><msub><mi>B</mi><mi>s</mi></msub><msub><mi>B</mi><mi>ch</mi></msub></mfrac><mo>.</mo></mrow></mrow></mrow></math><img file="US20020004838A1-20020110-M00005.TIF" id="EMI-M00005" he="18.00225" wi="216.027" img-format="tif" img-content="mf" /><attachments><attachment idref="MATHEMATICA-00005" attachment-type="nb" file="US20020004838A1-20020110-M00005.NB" /></attachments></maths>

[0061] While the transmission mechanisms on the basis of a priority decision have been described together with an arrival time estimation, it will be appreciated by those of ordinary skill in the art that the mechanisms may likewise be used independently from each other.

[0062]FIG. 9 illustrates the process of receiving a video stream in video client <b>160</b>. Upon detecting in step S<b>920</b> that a video frame is missing, a retransmission request is generated and transmitted in steps S<b>930</b> and S<b>940</b> as described above. While in the preferred embodiment, the retransmission decision is performed by control unit <b>210</b> of video server <b>110</b>, it will be appreciated by the skilled person that the decision whether a missing frame is to be retransmitted may likewise be performed at the receiver. For this purpose, the video client <b>160</b> would comprise a control unit (not shown) for calculating the priority threshold value and comparing the priority level of the missing frame with the threshold value. Only in case it is decided to retransmit the missing frame, a retransmission request would be sent from video client <b>160</b> to the video server <b>110</b>. The retransmission decision step S<b>440</b>, illustrated in FIGS. <b>5</b> to <b>8</b>, would then be incorporated into the process of receiving the video stream in FIG. 9 prior to the step S<b>930</b> of generating a retransmission request.