US20070250637A1 - Method and Apparatus for Reducing Jitter in a Receiver of a Selective Combining System - Google Patents
Method and Apparatus for Reducing Jitter in a Receiver of a Selective Combining System Download PDFInfo
- Publication number
- US20070250637A1 US20070250637A1 US11/380,420 US38042006A US2007250637A1 US 20070250637 A1 US20070250637 A1 US 20070250637A1 US 38042006 A US38042006 A US 38042006A US 2007250637 A1 US2007250637 A1 US 2007250637A1
- Authority
- US
- United States
- Prior art keywords
- receiver
- received
- cell
- sequence
- pdus
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/40—Network security protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
- H04L1/1685—Details of the supervisory signal the supervisory signal being transmitted in response to a specific request, e.g. to a polling signal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1832—Details of sliding window management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/187—Details of sliding window management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/64—Hybrid switching systems
- H04L12/6418—Hybrid transport
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/22—Traffic shaping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
- H04L47/263—Rate modification at the source after receiving feedback
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/27—Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/28—Flow control; Congestion control in relation to timing considerations
- H04L47/283—Flow control; Congestion control in relation to timing considerations in response to processing delays, e.g. caused by jitter or round trip time [RTT]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/04—Scheduled or contention-free access
- H04W74/06—Scheduled or contention-free access using polling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
- H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Definitions
- the present invention is a method for reducing data streams jittering in a receiver of a selective combining system, in particular a method of avoiding the receiver temporarily storing packets that have been successfully received and not delivering the packets to an upper layer, hence causing delays in processing data streams.
- multimedia services are mostly limited to Short Messaging Services (SMS) with each message containing no more than 160 characters, and only simple ring tones are allowed, which are about 3 to 20 Kbytes, or other small data to be downloaded.
- SMS Short Messaging Services
- 3 rd generation mobile network technology has been developed with the rising of processor core performance and multimedia services in mobile communications have catered to a higher data transmission capacity and also a larger variety of types of multimedia services have been developed.
- the Universal Mobile Telecommunications System can provide Multimedia Broadcast and Multicast Service (MBMS), which transmits service content (e.g., television programs, movies, commercials) from servers to each user equipment through different cells in Unacknowledged Mode (UM).
- MBMS Multimedia Broadcast and Multicast Service
- Each user equipment may be located under coverage of many different cells. In other words, a user equipment can receive a same service content from different cells.
- RLC Radio Link Control
- a Selective Combining Function also called a Duplicate Avoidance and Reordering Function
- PDUs Protocol Data Units
- the RLC entity executes duplicate PDU detecting, discarding and reordering operations according to Sequence Numbers (SNs) of the PDUs.
- SNs Sequence Numbers
- Variable VR(UDR) represents an SN of a next PDU that is expected to be received in sequence.
- Variable VR(UDH) represents an SN of a highest numbered PDU that has been received by the Duplicate Avoidance and Reordering Function.
- Parameter DAR_Window_Size indicates a size of a receiving window of the Duplicate Avoidance and Reordering Function.
- the RLC entity executes the Duplicate Avoidance and Reordering Function according to the variable VR(UDR) and a receiving window of the Duplicate Avoidance and Reordering Function where a receivable range of the receiving window is from (VR(UDH) ⁇ DAR_Window_Size+1) to VR(UDH).
- a receivable range of the receiving window is from (VR(UDH) ⁇ DAR_Window_Size+1) to VR(UDH).
- the received PDU is stored in the buffer.
- the variable VR(UDH) is set to be the SN of the received PDU so as to advance the receiving window, PDUs with SNs smaller than (VR(UDH) ⁇ DAR_Window_Size+1) are discarded from the buffer and delivered to an upper layer for further operations, and the variable VR(UDR) is set to be equal to (VR(UDH) ⁇ DAR_Window_Size+1) when the variable VR(UDR) is smaller than (VR(UDH) ⁇ DAR_Window_Size+1).
- the PDU with the SN equal to the variable VR(UDR) in the buffer and all PDUs with consecutive SNs after the SN (i.e. from VR(UDR)+1) are discarded and delivered to the upper layer for further operations.
- the variable VR(UDR) is set to be equal to a highest SN of the PDUs that have been delivered to the upper layer plus 1.
- the Duplicate Avoidance and Reordering Function discards the duplicate PDU.
- cells are not in synchronization, so there is a time difference between cells transmissions even if service contents are identical.
- signals transmitted by some cells arrive ‘slower’ and signals transmitted by some cells arrive ‘faster’, meaning that signals of some cells are ‘slower’ and signals of some cells are ‘faster’ to the receiver.
- the receiver does not successfully receive some PDUs, the receiver cannot process any successfully received PDUs of a service content that are sequentially later than the missing PDUs but store the successfully received PDUs in a buffer.
- the receiver waits for a slower neighboring cell to transmit PDUs that are missing.
- the successfully received PDUs are kept in the buffer and are not delivered to an upper layer until the missing ones are successfully received.
- the receiver like a user equipment, wireless communication device
- the receiver moves into a ‘slower’ cell. Since the ‘slower’ cell has a slower timing sequence of PDUs, the successfully received PDUs need to be stored in the buffer longer. This causes delay in replaying the service content.
- the receiver moves into a ‘faster’ cell instead, there are PDUs that the receiver cannot get so that a data stream will jump forward.
- this kind of delaying or jittering situations affect program fluency, deteriorate broadcasting quality and reduce user interest.
- FIG. 1 to FIG. 3 are diagrams representing variables and SNs of received PDUs of a receiver that moves between a faster cell A and a slower cell B.
- packets transmitted by the cell A are ahead of those transmitted by the cell B by 9 Transmission Time Intervals (TTIs), and parameter DAR_Window_Size is 10.
- TTIs Transmission Time Intervals
- DAR_Window_Size is 10.
- each square represents a TTI, which is set to be 20 milliseconds (ms) in general.
- the first and second rows represent SNs of PDUs the receiver received from the cell A and the cell B respectively, where shaded squares denote PDUs that are not successfully received.
- the third and fifth rows represent values of the variable VR(UDH) and the variable VR(UDR) respectively.
- the fourth row is a value of (VR(UDH) ⁇ DAR_Window_Size+1), which is a start point of the receiving window.
- the sixth row represents SNs of PDUs that are delivered to the upper layer from the buffer.
- the seventh row represents SNs of PDUs that the receiver replays at the end. Additionally, contiguous shaded squares mean PDUs cannot be received due to the receiver moving out of coverage of a cell, and a single shaded square represents a SN of a PDU that is missing during radio transmission.
- Update timing of each row is illustrated as follows.
- the variable VR(UDH) of the third row is updated when data of the first and second rows are received.
- the fourth row is calculated and updated as the third row is updated.
- the sixth row shows SNs (may be more than 1) to be delivered to the upper layer when the first and second rows received data at a previous TTI (previous column). (In practice, delivering PDUs to upper layer does not take 20 ms.
- FIG. 1 to FIG. 3 are for illustration purpose only and are not drawn according to a detailed time scale.)
- the variable VR(UDR) in the fifth row is updated after delivering data of the sixth row to the upper layer.
- the time difference shown in FIG. 1 to FIG. 3 is one square, which represents 20 ms, but the time difference can be longer or shorter in real practice.
- UMTS provides MBMS in UM and the receiver is able to receive the same PDU from different cells.
- the RLC entity of the receiver can initiate the Duplicate Avoidance and Reordering Function, which discards duplicate PDUs.
- packets sent from some cells arrive at the receiver slower than packets sent from other cells.
- the receiver moves into a slower cell and if a packet is lost, there is a time delay due to storing the incomplete PDU sequence in the buffer and hence the service content is replayed with an obvious interruption, which affects program fluency and frustrates users.
- the receiver moves into a faster cell, the receiver cannot receive several PDUs and the received data stream is jumped forward, which causes discontinuity in program content and deteriorate program quality.
- a jitter reducing method in a receiver of a selective combining system includes determining a slowest cell corresponding to the receiver in the selective combining system, treating a plurality of missing packets as being received when a data stream transmitted by the slowest cell is detected to comprise the plurality of missing packets and a sequence number of a first packet in the plurality of missing packets is a sequence number of a next packet that is expected to be received in sequence, and delivering a received packet following the plurality of missing packets in sequence to an upper layer.
- FIG. 1 to FIG. 3 are diagrams representing variables and SNs of received PDUs when a receiver moves between a faster cell and a slower cell in UMTS of the prior art.
- FIG. 4 is a block diagram of a mobile communications device.
- FIG. 5 is a schematic diagram of the program code in FIG. 4 .
- FIG. 6 is a flow chart of a procedure of a first embodiment for reducing data stream jittering in a selective combining system in the present invention.
- FIG. 7 to FIG. 9 are diagrams representing variables and SNs of received PDUs when a receiver moves between a faster cell and a slower cell according to the procedure in FIG. 6 .
- FIG. 10 is a flow chart of a procedure of a second embodiment for reducing data stream jittering in a selective combining system in the present invention.
- FIG. 11 to FIG. 13 are diagrams representing variables and SNs of received PDUs when a receiver moves between a faster cell and a slower cell according to the procedure in FIG. 10 .
- FIG. 14 is a flow chart of a procedure of a third embodiment for reducing data stream jittering in a selective combining system in the present invention.
- the present invention is for a selective combining system, which can combine PDUs transmitted from different sources (cells), through initiating a Duplicate Avoidance and Reordering Function, to form a single ordered PDU sequence.
- the following descriptions are for use in a mobile communications system, such as UMTS mentioned above.
- FIG. 4 is a block diagram of a mobile communications device 400 .
- FIG. 4 only shows an input device 402 , an output device 404 , a control circuit 406 , a central processor 408 , a storage device 410 , a program code 412 , and a transceiver 414 of the mobile communications device 400 .
- the control circuit 406 executes the program code 412 stored in the storage device 410 with the central processor 408 , and then controls operations of the mobile communications device 400 .
- the mobile communications device 400 can receive signals inputted by users through the input device 402 , or output signals like images, sounds etc. through the output device 404 (such as monitor, speaker etc.).
- the transceiver 414 is used for receiving radio signals and delivering received radio signals to the control circuit 406 or transmitting signals submitted from the control circuit 406 in a radio manner.
- the transceiver 414 is known as a part of Layer one, whereas the control circuit 406 is an application of Layer two and Layer three.
- FIG. 5 is a schematic diagram of the program code 412 in FIG. 4 .
- the program code 412 comprises an application program layer 500 , a Layer three interface 502 , a Layer two interface 506 , and a Layer one interface 518 .
- the Layer two interface 506 stores a plurality of Service Data Units (SDUs) 508 submitted from the Layer three interface 502 in a buffer 512 .
- the Layer two interface 506 generates a plurality of PDUs 514 according to the SDUs 508 stored in the buffer 512 and outputs the generated PDUs 514 to a destination through the Layer one interface 518 .
- SDUs Service Data Units
- the signal is received through the Layer one interface 518 and the Layer one interface 518 delivers PDUs 514 to the Layer two interface 506 .
- the Layer two interface 506 reassembles the PDUs 514 to SDUs 508 and stores the SDUs 508 in the buffer 512 .
- the Layer two interface 506 delivers the SDUs 508 stored in the buffer 512 to the Layer three interface 502 .
- the 3 rd generation mobile communications system UMTS can provide MBMS, which transmits service content (e.g. movies, music, commercials and other multimedia information) from servers to each user equipment through different cells in UM.
- service content e.g. movies, music, commercials and other multimedia information
- the Layer two interface 506 of the program code 412 is able to initiate a Selective Combining Function, also called a Duplicate Avoidance and Reordering Function, which efficiently combines Protocol Data Units (PDUs), which may be transmitted from different sources (cells) and/or repetitively transmitted from a same source, to form a single ordered PDU sequence.
- PDUs Protocol Data Units
- the present invention provides a duplicate avoidance and reordering program code 509 to reduce jittering occurred in data streaming and improves program quality.
- FIG. 6 is a flow chart of a procedure 600 of a first embodiment for reducing data stream jittering in a selective combining system.
- the selective combining system can be a mobile communications system, such as UMTS, operating in UM.
- the procedure 600 can be compiled into the duplicate avoidance and reordering program code 509 .
- the procedure 600 comprises following steps.
- Step 602 start.
- Step 604 determine a slowest cell among all cells that can provide service to a receiver in the selective combining system, a timing sequence of the data stream transmitted by the slowest cell is behind or equal to timing sequences of data streams transmitted by all cells that are capable of providing services to the receiver.
- Step 606 when a data stream transmitted by the slowest cell is detected to comprise a plurality of missing packets and a sequence number of a first packet in the plurality of missing packets is a sequence number of a next packet that is expected to be received in sequence, treat the plurality of missing packets as being successfully received.
- Step 608 deliver a received packet following the plurality of missing packets in sequence to an upper layer.
- Step 610 end.
- the receiver determines a slowest cell according to timing sequences of data streams transmitted by all available cells.
- the slowest cell transmits a data stream with a timing sequence that is behind or equal to timing sequences of data streams from other cells. If the data stream transmitted by the slowest cell comprises at lease one missing packet, and a first missing packet has an SN equal to an SN of a next PDU that is expected to be received (i.e. the variable VR(UDR)), the plurality of missing packets is treated as received.
- the present invention considers this missing packet as received, so that the receiver can deliver packets after the missing packet in sequence to an upper layer.
- the variable VR(UDR) is incremented by the number of missing packets, so that the receiver determines the missing packets as received. Consequently, the procedure 600 avoids the receiver from holding successfully received packets in the buffer unnecessarily and hence achieves a purpose of reducing data stream Littering.
- a first row and a second row are the same as displayed in the first row and the second row (i.e. SNs of PDUs received by the receiver from the cell A and the cell B respectively) in FIG. 1 to FIG. 3 .
- They have the same symbols, numbers, and descriptions to have a clear comparison between the procedure 600 of the present invention and the prior art.
- the prior art waits for the variable VR(UDR) to be out of the receiving window of the Duplicate Avoidance and Reordering Function before delivering the following stored PDUs to the upper layer and, thus, affects the program fluency.
- the receiver determines a situation as described above.
- the step 608 is not executed and the variable VR(UDR) is updated as it is in the prior art.
- the receiver reduces jittering in data streams that deteriorates program quality.
- the procedure 600 is a solution only for a mobile that can determine the “globally” slowest cell among all cells that can provide services.
- the global slowest cell is not easy to track when the mobile moves around. Therefore, the present invention provides another jitter reducing method for data streams that only requires a slowest cell in local area to be determined, i.e., a local slowest cell.
- FIG. 10 is a flow chart of a procedure 1000 of a second embodiment for reducing data stream jittering in a selective combining system.
- the selective combining system can be a mobile communications system, such as UMTS, operating in UM.
- the procedure 1000 can be compiled into the duplicate avoidance and reordering program code 509 .
- the procedure 1000 comprises following steps.
- Step 1002 start.
- Step 1004 determine a local slowest cell among neighboring cells that can provide service to a receiver in the selective combining system, a timing sequence of the data stream transmitted by the local slowest cell is behind or equal to timing sequences of data streams transmitted by all neighboring cells that are currently capable of providing services to the receiver.
- Step 1006 when a data stream transmitted by the local slowest cell is detected to comprise a plurality of missing packets and a sequence number of a first packet in the plurality of missing packets is a sequence number of a next packet that is expected to be received in sequence, treat the plurality of missing packets as being received.
- Step 1008 deliver a received packet following the plurality of missing packets in sequence to an upper layer.
- Step 1010 end.
- the receiver determines a local slowest cell according to timing sequences of data streams transmitted by all neighboring cells.
- the local slowest cell transmitting a data stream with a timing sequence that is behind or equal to timing sequences of data streams from other neighboring cells.
- a cell having a slowest timing sequence of data streams among all neighboring cells is the local slowest cell where “the neighboring cells” is in a term indicating that the receiver can receive services from the cells currently.
- a set of the neighboring cells can be affected by a movement of the receiver, landscapes, land materials etc. and is not the present invention emphasis, so it will not be explained further here.
- the data stream transmitted by the local slowest cell comprises at lease one missing packet, and a first missing packet has an SN equal to an SN of a next PDU that is expected to be received (i.e. the variable VR(UDR))
- the plurality of missing packets are treated as received. This means that, if the receiver cannot receive a next expected packet from the local slowest cell, the present invention considers this missing packet as received, so that the receiver can deliver packets after the missing packet in sequence to an upper layer. This enables other successfully received packets following the missing packet to be delivered to the upper layer and avoids program interruptions as in the prior arts.
- the variable VR(UDR) is incremented by the number of missing packets, so that the receiver determines the missing packets as received.
- the procedure 1000 avoids the receiver from holding successfully received packets in the buffer unnecessarily and hence achieves a purpose of reducing data stream jittering.
- the ‘local slowest cell’ is a cell whose timing sequence of data streams is behind timing sequences of data streams transmitted from any neighboring cells, and it is different from the ‘slowest cell’ described in the procedure 600 .
- a first row and a second row are the same as displayed in the first row and the second row (i.e. SNs of PDUs received by the receiver from the cell A and the cell B respectively) in FIG. 1 to FIG. 3 .
- They have the same symbols, numbers, and descriptions to have a clear comparison between the procedure 1000 of the present invention and the prior art.
- the receiver first determines the local slowest cell according to timing sequences of data streams transmitted at different time points from all neighboring cells.
- the cell B 2 is the local slowest cell while, at time point 310 , the local slowest cell is a cell A 2 because the cell B 2 is not a neighboring cell at this time point.
- the prior art waits for the variable VR(UDR) to be out of the receiving window of the Duplicate Avoidance and Reordering Function before delivering the following stored PDUs to the upper layer and significantly affects program fluency.
- the procedure 1000 maintains program fluency and improves program quality.
- the local slowest cell is the cell A 2 .
- FIG. 14 is a flow chart of a procedure 1400 of a third embodiment for reducing data stream jittering in a selective combining system.
- the selective combining system can be a mobile communications system, such as UMTS, operating in UM.
- the procedure 1400 comprises following steps.
- Step 1402 start.
- Step 1404 determine a minimum transition time period required to change to another cell in the selective combining system.
- Step 1406 keep a maximum time difference of transmitting packets between cells to be less than or equal to the minimum transition time.
- Step 1408 end.
- a network transmitter determines a minimum transition time required for a receiver to change to another cell, then keeps a time difference of transmitting packets between cells to be less than or equal to the minimum transition time. For example, in FIG. 1 to FIG. 3 , a minimum transition time required for changing cells is 2 TTIs, therefore the network transmitter controls a time difference between the cell A and the cell B from 9 TTIs, as shown in FIG. 1 to FIG. 3 , to be within 2 TTIs.
- the receiving window size of the Duplicate Avoidance and Reordering Function can be set to be a value corresponds to the time difference.
- the receiver is able to receive the same PDU from different cells.
- the RLC entity of the receiver can initiate the Duplicate Avoidance and Reordering Function, which discards and reorders duplicate PDUs.
- cells are not in synchronization so that there is a time difference between cells transmission even if service contents are identical.
- the present invention considers this missing packet as received so that the receiver can deliver packets after the missing packet in sequence to upper layer for replay.
- the present invention maintains program replay fluency and improves program quality. Additionally, the present invention keeps a time difference of transmitting between cells to be less than or equal to a minimum transition time required to change cells, to avoid data losses when the receiver moves and changes cells. Therefore, the present invention can reduce jittering in data streams in a selective combining system and have a better program quality with more fluent service contents replaying.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Databases & Information Systems (AREA)
- Mobile Radio Communication Systems (AREA)
- Communication Control (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
A jitter reducing method in a receiver of a selective combining system includes determining a slowest cell corresponding to the receiver in the selective combining system, treating a plurality of missing packets as being received when a data stream transmitted by the slowest cell is detected to comprise the plurality of missing packets and a sequence number of a first packet in the plurality of missing packets is a sequence number of a next packet that is expected to be received in sequence, and delivering a received packet following the plurality of missing packets in sequence to an upper layer.
Description
- This application claims the benefit of U.S. Provisional Application No. 60/594,697, filed Apr. 29, 2005, and included herein by reference.
- 1. Field of the Invention
- The present invention is a method for reducing data streams jittering in a receiver of a selective combining system, in particular a method of avoiding the receiver temporarily storing packets that have been successfully received and not delivering the packets to an upper layer, hence causing delays in processing data streams.
- 2. Description of the Prior Art
- With advances of mobile communications devices in recent years, there are various applications for entertainment and information services. In a 2nd generation (2G) mobile communications system, multimedia services are mostly limited to Short Messaging Services (SMS) with each message containing no more than 160 characters, and only simple ring tones are allowed, which are about 3 to 20 Kbytes, or other small data to be downloaded. Now the 3rd generation mobile network technology has been developed with the rising of processor core performance and multimedia services in mobile communications have catered to a higher data transmission capacity and also a larger variety of types of multimedia services have been developed.
- For example, according to a communications protocol specification developed by the 3rd Generation Partnership Project (3GPP), the Universal Mobile Telecommunications System (UMTS) can provide Multimedia Broadcast and Multicast Service (MBMS), which transmits service content (e.g., television programs, movies, commercials) from servers to each user equipment through different cells in Unacknowledged Mode (UM). Each user equipment may be located under coverage of many different cells. In other words, a user equipment can receive a same service content from different cells. Thus, in order to have the user equipment correctly process the service content and take advantage of this multi-route transmission characteristic, a Radio Link Control (RLC) entity of a UMTS receiver (i.e. the user equipment) in the prior art is able to initiate a Selective Combining Function, also called a Duplicate Avoidance and Reordering Function, efficiently combining Protocol Data Units (PDUs) that may be transmitted from different sources (cells) and/or duplicating transmission from a same source to form a single order of a PDU sequence. After initiating the Duplicate Avoidance and Reordering Function, the RLC entity executes duplicate PDU detecting, discarding and reordering operations according to Sequence Numbers (SNs) of the PDUs. For more detailed description of the operations, please refer to following statements.
- First, to support the Duplicate Avoidance and Reordering Function, state variables and protocol parameters below are defined by the specification of the communications protocol described above:
- 1. Variable VR(UDR): represents an SN of a next PDU that is expected to be received in sequence.
- 2. Variable VR(UDH): represents an SN of a highest numbered PDU that has been received by the Duplicate Avoidance and Reordering Function.
- 3. Parameter DAR_Window_Size: indicates a size of a receiving window of the Duplicate Avoidance and Reordering Function.
- The RLC entity executes the Duplicate Avoidance and Reordering Function according to the variable VR(UDR) and a receiving window of the Duplicate Avoidance and Reordering Function where a receivable range of the receiving window is from (VR(UDH)−DAR_Window_Size+1) to VR(UDH). After initiating the Duplicate Avoidance and Reordering Function, if an SN of a received PDU lies inside the receiving window and the SN is smaller than the variable VR(UDR), or there is a PDU with the same SN existing in a buffer, then the received PDU is discarded. Conversely, if the SN of the received PDU is larger than or equal to the variable VR(UDR) and there is no PDU with the same SN existing in the buffer, then the received PDU is stored in the buffer. In addition, if the SN of the received PDU lies outside the receiving window, the received PDU is stored in the buffer, the variable VR(UDH) is set to be the SN of the received PDU so as to advance the receiving window, PDUs with SNs smaller than (VR(UDH)−DAR_Window_Size+1) are discarded from the buffer and delivered to an upper layer for further operations, and the variable VR(UDR) is set to be equal to (VR(UDH)−DAR_Window_Size+1) when the variable VR(UDR) is smaller than (VR(UDH)−DAR_Window_Size+1). Furthermore, if there is a PDU with an SN equal to the updated variable VR(UDR) existing in the buffer, the PDU with the SN equal to the variable VR(UDR) in the buffer and all PDUs with consecutive SNs after the SN (i.e. from VR(UDR)+1) are discarded and delivered to the upper layer for further operations. Finally, the variable VR(UDR) is set to be equal to a highest SN of the PDUs that have been delivered to the upper layer plus 1.
- From the above description, as the receiver receives a same PDU from different sources, the Duplicate Avoidance and Reordering Function discards the duplicate PDU. However, cells are not in synchronization, so there is a time difference between cells transmissions even if service contents are identical. For a specific receiver, signals transmitted by some cells arrive ‘slower’ and signals transmitted by some cells arrive ‘faster’, meaning that signals of some cells are ‘slower’ and signals of some cells are ‘faster’ to the receiver. Thus, when the receiver does not successfully receive some PDUs, the receiver cannot process any successfully received PDUs of a service content that are sequentially later than the missing PDUs but store the successfully received PDUs in a buffer. The receiver waits for a slower neighboring cell to transmit PDUs that are missing. The successfully received PDUs are kept in the buffer and are not delivered to an upper layer until the missing ones are successfully received. Now, suppose the receiver (like a user equipment, wireless communication device) moves into a ‘slower’ cell. Since the ‘slower’ cell has a slower timing sequence of PDUs, the successfully received PDUs need to be stored in the buffer longer. This causes delay in replaying the service content. In contrast, if the receiver moves into a ‘faster’ cell instead, there are PDUs that the receiver cannot get so that a data stream will jump forward. When broadcasting sports games, movies, songs or music, this kind of delaying or jittering situations affect program fluency, deteriorate broadcasting quality and reduce user interest.
- For illustration, please refer to
FIG. 1 toFIG. 3 .FIG. 1 toFIG. 3 are diagrams representing variables and SNs of received PDUs of a receiver that moves between a faster cell A and a slower cell B. Suppose that packets transmitted by the cell A are ahead of those transmitted by the cell B by 9 Transmission Time Intervals (TTIs), and parameter DAR_Window_Size is 10. InFIG. 1 toFIG. 3 , each square represents a TTI, which is set to be 20 milliseconds (ms) in general. The first and second rows represent SNs of PDUs the receiver received from the cell A and the cell B respectively, where shaded squares denote PDUs that are not successfully received. The third and fifth rows represent values of the variable VR(UDH) and the variable VR(UDR) respectively. The fourth row is a value of (VR(UDH)−DAR_Window_Size+1), which is a start point of the receiving window. The sixth row represents SNs of PDUs that are delivered to the upper layer from the buffer. The seventh row represents SNs of PDUs that the receiver replays at the end. Additionally, contiguous shaded squares mean PDUs cannot be received due to the receiver moving out of coverage of a cell, and a single shaded square represents a SN of a PDU that is missing during radio transmission. - Update timing of each row is illustrated as follows. The variable VR(UDH) of the third row is updated when data of the first and second rows are received. The fourth row is calculated and updated as the third row is updated. The sixth row shows SNs (may be more than 1) to be delivered to the upper layer when the first and second rows received data at a previous TTI (previous column). (In practice, delivering PDUs to upper layer does not take 20 ms.
FIG. 1 toFIG. 3 are for illustration purpose only and are not drawn according to a detailed time scale.) The variable VR(UDR) in the fifth row is updated after delivering data of the sixth row to the upper layer. There is a fixed time difference between the replay value of the seventh row and the value of the sixth row. The time difference shown inFIG. 1 toFIG. 3 is one square, which represents 20 ms, but the time difference can be longer or shorter in real practice. - When the system is providing a service of broadcasting a data stream, since a program is a continuous data stream with only one PDU from the data stream being played at a TTI, when a replay software receives a plurality of PDUs at the same time, PDUs that have not been replayed are temporarily stored in a buffer controlled by the replay software and replayed one by one. In the prior art, only when it is assured that a missing PDU cannot be obtained (i.e. after the missing PDU had moved outside the receiving window), the Duplicate Avoidance and Reordering Function is allowed to deliver the following PDU or a plurality of PDUs to the upper layer from the buffer. This procedure leads to discontinuity in program replays.
- For example, in
FIG. 1 toFIG. 3 , between atime point 100 and atime point 102, the receiver is out of a coverage of the cell A so that the receiver cannot receive PDUs with SN=30 to 55 from the cell A. Suppose that the receiver does not receive a PDU with SN=31 from the cell B at thetime point 120, and a receiving window size of the Duplicate Avoidance and Reordering Function is 10. PDUs with SN=32 to 41 are temporarily stored until atime point 110, when the PDUs with SN=32 to 41 altogether are delivered to the upper layer. This means that after a PDU with SN=30 been replayed at atime point time point 140. In other words, since the receiver moves out of the coverage of the faster cell A, the receiver can only receive the data stream from the slower cell B. If the receiver cannot receive the PDU with SN=31 at thetime point 120, there is a long interruption in replaying the data stream. Hence an original interval of 1 TTI (20 ms) is delayed to be 10 TTIs (200 ms) and causes discontinuity in program replay and affects program quality. Similarly, after replaying a PDU with SN=76 at atime point 150, there is a delay of 8 TTIs before replaying a PDU with SN=78 at atime point 160. In even worse cases, if the receiving window size of the Duplicate Avoidance and Reordering Function is large (for instance, DAR_Window_Size=64), there can be a data stream delay longer than 1 second that leads to obvious program interruptions, which may get users frustrated. - Furthermore, suppose that the receiver is out of the coverage of the cell B between the time points 104 and 106, so that the receiver cannot receive PDUs with SN=49 to 63 from the cell B. This means that, the receiver cannot receive PDUs with SN=49 to 55 from the cell A nor the cell B. Therefore, after the receiver replays a PDU with SN=48 at a
time point 142, the receiver immediately replays a PDU with SN=56 at a next TTI (i.e. a time point 144), meaning jumping forward 7 TTIs in comparison to an original replay timing. Again, if the receiving window of the Duplicate Avoidance and Reordering Function is large (for instance, DAR_Window_Size=64), there can be a jump larger than 1 second, leading to obvious program pauses and frustrated users. - In summary, UMTS provides MBMS in UM and the receiver is able to receive the same PDU from different cells. For better data receiving efficiency, the RLC entity of the receiver can initiate the Duplicate Avoidance and Reordering Function, which discards duplicate PDUs. However, since different cells may have time difference for a same packet, packets sent from some cells arrive at the receiver slower than packets sent from other cells. In the prior art, if the receiver moves into a slower cell and if a packet is lost, there is a time delay due to storing the incomplete PDU sequence in the buffer and hence the service content is replayed with an obvious interruption, which affects program fluency and frustrates users. Additionally, if the receiver moves into a faster cell, the receiver cannot receive several PDUs and the received data stream is jumped forward, which causes discontinuity in program content and deteriorate program quality.
- A jitter reducing method in a receiver of a selective combining system, the method includes determining a slowest cell corresponding to the receiver in the selective combining system, treating a plurality of missing packets as being received when a data stream transmitted by the slowest cell is detected to comprise the plurality of missing packets and a sequence number of a first packet in the plurality of missing packets is a sequence number of a next packet that is expected to be received in sequence, and delivering a received packet following the plurality of missing packets in sequence to an upper layer.
- These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings.
-
FIG. 1 toFIG. 3 are diagrams representing variables and SNs of received PDUs when a receiver moves between a faster cell and a slower cell in UMTS of the prior art. -
FIG. 4 is a block diagram of a mobile communications device. -
FIG. 5 is a schematic diagram of the program code inFIG. 4 . -
FIG. 6 is a flow chart of a procedure of a first embodiment for reducing data stream jittering in a selective combining system in the present invention. -
FIG. 7 toFIG. 9 are diagrams representing variables and SNs of received PDUs when a receiver moves between a faster cell and a slower cell according to the procedure inFIG. 6 . -
FIG. 10 is a flow chart of a procedure of a second embodiment for reducing data stream jittering in a selective combining system in the present invention. -
FIG. 11 toFIG. 13 are diagrams representing variables and SNs of received PDUs when a receiver moves between a faster cell and a slower cell according to the procedure inFIG. 10 . -
FIG. 14 is a flow chart of a procedure of a third embodiment for reducing data stream jittering in a selective combining system in the present invention. - The present invention is for a selective combining system, which can combine PDUs transmitted from different sources (cells), through initiating a Duplicate Avoidance and Reordering Function, to form a single ordered PDU sequence. The following descriptions are for use in a mobile communications system, such as UMTS mentioned above.
- First of all, please refer to
FIG. 4 .FIG. 4 is a block diagram of amobile communications device 400. For simplicity,FIG. 4 only shows aninput device 402, anoutput device 404, acontrol circuit 406, acentral processor 408, astorage device 410, aprogram code 412, and atransceiver 414 of themobile communications device 400. In themobile communications device 400, thecontrol circuit 406 executes theprogram code 412 stored in thestorage device 410 with thecentral processor 408, and then controls operations of themobile communications device 400. Themobile communications device 400 can receive signals inputted by users through theinput device 402, or output signals like images, sounds etc. through the output device 404 (such as monitor, speaker etc.). Thetransceiver 414 is used for receiving radio signals and delivering received radio signals to thecontrol circuit 406 or transmitting signals submitted from thecontrol circuit 406 in a radio manner. In a structure of a communications protocol, thetransceiver 414 is known as a part of Layer one, whereas thecontrol circuit 406 is an application of Layer two and Layer three. - Please refer to
FIG. 5 .FIG. 5 is a schematic diagram of theprogram code 412 inFIG. 4 . Theprogram code 412 comprises anapplication program layer 500, a Layer threeinterface 502, a Layer twointerface 506, and a Layer oneinterface 518. When transmitting signals, the Layer twointerface 506 stores a plurality of Service Data Units (SDUs) 508 submitted from the Layer threeinterface 502 in abuffer 512. Then, the Layer twointerface 506 generates a plurality ofPDUs 514 according to theSDUs 508 stored in thebuffer 512 and outputs the generatedPDUs 514 to a destination through the Layer oneinterface 518. In reverse, when receiving a radio signal, the signal is received through the Layer oneinterface 518 and the Layer oneinterface 518 deliversPDUs 514 to the Layer twointerface 506. The Layer twointerface 506 reassembles thePDUs 514 toSDUs 508 and stores theSDUs 508 in thebuffer 512. At last, the Layer twointerface 506 delivers theSDUs 508 stored in thebuffer 512 to the Layer threeinterface 502. - The 3rd generation mobile communications system UMTS can provide MBMS, which transmits service content (e.g. movies, music, commercials and other multimedia information) from servers to each user equipment through different cells in UM. In order to have the
mobile communications device 400 correctly process the service content, the Layer twointerface 506 of theprogram code 412 is able to initiate a Selective Combining Function, also called a Duplicate Avoidance and Reordering Function, which efficiently combines Protocol Data Units (PDUs), which may be transmitted from different sources (cells) and/or repetitively transmitted from a same source, to form a single ordered PDU sequence. In this case, the present invention provides a duplicate avoidance andreordering program code 509 to reduce jittering occurred in data streaming and improves program quality. - Please refer to
FIG. 6 .FIG. 6 is a flow chart of aprocedure 600 of a first embodiment for reducing data stream jittering in a selective combining system. The selective combining system can be a mobile communications system, such as UMTS, operating in UM. Theprocedure 600 can be compiled into the duplicate avoidance andreordering program code 509. Theprocedure 600 comprises following steps. - Step 602: start.
- Step 604: determine a slowest cell among all cells that can provide service to a receiver in the selective combining system, a timing sequence of the data stream transmitted by the slowest cell is behind or equal to timing sequences of data streams transmitted by all cells that are capable of providing services to the receiver.
- Step 606: when a data stream transmitted by the slowest cell is detected to comprise a plurality of missing packets and a sequence number of a first packet in the plurality of missing packets is a sequence number of a next packet that is expected to be received in sequence, treat the plurality of missing packets as being successfully received.
- Step 608: deliver a received packet following the plurality of missing packets in sequence to an upper layer.
- Step 610: end.
- According to the
procedure 600 of the present invention, the receiver determines a slowest cell according to timing sequences of data streams transmitted by all available cells. The slowest cell transmits a data stream with a timing sequence that is behind or equal to timing sequences of data streams from other cells. If the data stream transmitted by the slowest cell comprises at lease one missing packet, and a first missing packet has an SN equal to an SN of a next PDU that is expected to be received (i.e. the variable VR(UDR)), the plurality of missing packets is treated as received. This means that, if the receiver cannot receive a next expected packet from the slowest cell, the present invention considers this missing packet as received, so that the receiver can deliver packets after the missing packet in sequence to an upper layer. This enables other successfully received packets following the missing packet to be delivered to the upper layer and avoids program interruptions as in the prior arts. In real practices, the variable VR(UDR) is incremented by the number of missing packets, so that the receiver determines the missing packets as received. Consequently, theprocedure 600 avoids the receiver from holding successfully received packets in the buffer unnecessarily and hence achieves a purpose of reducing data stream Littering. - For example, please refer to
FIG. 7 toFIG. 9 . As displayed inFIG. 7 toFIG. 9 , a first row and a second row (i.e. SNs of PDUs received by the receiver from a cell A1 and a cell B1 respectively) are the same as displayed in the first row and the second row (i.e. SNs of PDUs received by the receiver from the cell A and the cell B respectively) inFIG. 1 toFIG. 3 . They have the same symbols, numbers, and descriptions to have a clear comparison between theprocedure 600 of the present invention and the prior art. - From
FIG. 7 toFIG. 9 , a time sequence of a data stream transmitted by the cell B1 is behind the cell A1. Therefore, theprocedure 600 first determines that the cell B1 is the slowest cell followed by the receiver determining a packet with SN=31 is missing from the data sequence transmitted by the slowest cell B1 at a time point 722 (should have been received at atime point 720 but was not), and the variable VR(UDR) is equal to 31. Therefore, the receiver increments the variable VR(UDR) by a number of jumped PDUs, which is 1 in this case, so that at atime point 220 the variable VR(UDR) is set to be 32. This means that the receiver considers the PDU with SN=31 as received and delivers a PDU with SN=32 to the upper layer for further operations. - Even though the PDU with SN=31 was not received by the receiver, users do not sense a discontinuity in program replays as every TTI is very short (20 ms) and not replaying the PDU with SN=31 (from a
time point 730 to a time point 740) is not significant. In other words, when the receiver cannot receive the PDU with SN=31 from the slowest cell B1 and the variable VR(UDR) equals 31, the present invention considers the PDU with SN=31 as received, so that PDUs with SN=32 or more are not held in a buffer unnecessarily and instead are delivered to the upper layer without delay. This maintains program replay fluency and improves program quality. In comparison, the prior art waits for the variable VR(UDR) to be out of the receiving window of the Duplicate Avoidance and Reordering Function before delivering the following stored PDUs to the upper layer and, thus, affects the program fluency. - Similarly, when the receiver cannot receive the PDU with SN=77 from the slowest cell B1 at a
time point 235 and the variable VR(UDR) is equal to 77, the receiver considers the PDU with SN=77 as received, i.e. incrementing the variable VR(UDR) by 1 so that at atime point 240, the variable VR(UDR) is set to be 78, and at atime point 250 the PDU with SN=78 is delivered to the upper layer for replay. Thus, the PDUs with SN=78 and greater are not held in a buffer but are delivered to the upper layer without delay. - Additionally, from
FIG. 7 toFIG. 9 , between a time point of 742 and a time point of 748, the receiver cannot receive PDUs with SN=49 to 63 from the slowest cell B1, but it is not known until atime point 750. At thetime point 750, after the receiver receives a PDUs with SN=64, the receiver then determines a situation as described above. Thus, between the time point of 742 and the time point of 748, a determining requirement of thestep 606 in theprocedure 600 does not stand, thestep 608 is not executed and the variable VR(UDR) is updated as it is in the prior art. After the receiver replays a PDUs with SN=48 at atime point 232, there are 7 TTIs passing by before replaying a PDUs with SN=56 at atime point 234. This means, a time interval between replaying the PDUs with SN=48 and replaying the PDUs with SN=56 exactly equals to the original time interval between the two PDUs. The user senses a part of the program is discontinued, but there is no time jump as the program resumes later. The 7 TTIs between thetime point 232 and thetime point 234 correspond to the missing PDUs with SN=49 to 55. After the receiver replays the PDUs with SN=48 at thetime point 232, the receiver does not replay the PDUs with SN=56 immediately at a next TTI of thetime point 232 so that the user will not be confused by discontinuity of the service content. - With the
procedure 600 of the present invention, the receiver reduces jittering in data streams that deteriorates program quality. But theprocedure 600 is a solution only for a mobile that can determine the “globally” slowest cell among all cells that can provide services. The global slowest cell is not easy to track when the mobile moves around. Therefore, the present invention provides another jitter reducing method for data streams that only requires a slowest cell in local area to be determined, i.e., a local slowest cell. - Please refer to
FIG. 10 .FIG. 10 is a flow chart of aprocedure 1000 of a second embodiment for reducing data stream jittering in a selective combining system. The selective combining system can be a mobile communications system, such as UMTS, operating in UM. Theprocedure 1000 can be compiled into the duplicate avoidance andreordering program code 509. Theprocedure 1000 comprises following steps. - Step 1002: start.
- Step 1004: determine a local slowest cell among neighboring cells that can provide service to a receiver in the selective combining system, a timing sequence of the data stream transmitted by the local slowest cell is behind or equal to timing sequences of data streams transmitted by all neighboring cells that are currently capable of providing services to the receiver.
- Step 1006: when a data stream transmitted by the local slowest cell is detected to comprise a plurality of missing packets and a sequence number of a first packet in the plurality of missing packets is a sequence number of a next packet that is expected to be received in sequence, treat the plurality of missing packets as being received.
- Step 1008: deliver a received packet following the plurality of missing packets in sequence to an upper layer.
- Step 1010: end.
- According to the
procedure 1000 of the present invention, the receiver determines a local slowest cell according to timing sequences of data streams transmitted by all neighboring cells. The local slowest cell transmitting a data stream with a timing sequence that is behind or equal to timing sequences of data streams from other neighboring cells. This means that a cell having a slowest timing sequence of data streams among all neighboring cells is the local slowest cell where “the neighboring cells” is in a term indicating that the receiver can receive services from the cells currently. A set of the neighboring cells can be affected by a movement of the receiver, landscapes, land materials etc. and is not the present invention emphasis, so it will not be explained further here. - If the data stream transmitted by the local slowest cell comprises at lease one missing packet, and a first missing packet has an SN equal to an SN of a next PDU that is expected to be received (i.e. the variable VR(UDR)), the plurality of missing packets are treated as received. This means that, if the receiver cannot receive a next expected packet from the local slowest cell, the present invention considers this missing packet as received, so that the receiver can deliver packets after the missing packet in sequence to an upper layer. This enables other successfully received packets following the missing packet to be delivered to the upper layer and avoids program interruptions as in the prior arts. In real practices, the variable VR(UDR) is incremented by the number of missing packets, so that the receiver determines the missing packets as received. Consequently, the
procedure 1000 avoids the receiver from holding successfully received packets in the buffer unnecessarily and hence achieves a purpose of reducing data stream jittering. It is noted that the ‘local slowest cell’ is a cell whose timing sequence of data streams is behind timing sequences of data streams transmitted from any neighboring cells, and it is different from the ‘slowest cell’ described in theprocedure 600. - For example, please refer to
FIG. 11 toFIG. 13 . As displayed inFIG. 11 toFIG. 13 , a first row and a second row (i.e. SNs of PDUs received by the receiver from a cell A2 and a cell B2 respectively) are the same as displayed in the first row and the second row (i.e. SNs of PDUs received by the receiver from the cell A and the cell B respectively) inFIG. 1 toFIG. 3 . They have the same symbols, numbers, and descriptions to have a clear comparison between theprocedure 1000 of the present invention and the prior art. According to theprocedure 1000 of the present invention, the receiver first determines the local slowest cell according to timing sequences of data streams transmitted at different time points from all neighboring cells. - At a
time point 1120 and atime point 1235, the cell B2 is the local slowest cell while, attime point 310, the local slowest cell is a cell A2 because the cell B2 is not a neighboring cell at this time point. The receiver determines a packet with SN=31 is missing from the data sequence transmitted by the local slowest cell B2 at a time point 1122 (should have been received at atime point 1120 but was not), and the variable VR(UDR) is equal to 31. Therefore, the receiver increments the variable VR(UDR) by a number of jumped PDUs, which again is 1 in this case, so that at atime point 1220 the variable VR(UDR) is set to be 32. This means that the receiver considers the PDU with SN=31 as received and can deliver a PDU with SN=32 to the upper layer for further operations. Even though the PDU with SN=31 was not received by the receiver, users will not sense a discontinuity in program replays as every TTI is very short (20 ms) and not replaying the PDU with SN=31 (from atime point 1130 to a time point 1140) is not significant. In other words, when the receiver cannot receive the PDU with SN=31 from the local slowest cell B2 and the variable VR(UDR) equals 31, the present invention considers the PDU with SN=31 as received, so that PDUs with SN=32 or greater are not held in the buffer unnecessarily, rather are delivered to the upper layer without delay. This maintains program replay fluency and improves program quality. - In comparison, the prior art waits for the variable VR(UDR) to be out of the receiving window of the Duplicate Avoidance and Reordering Function before delivering the following stored PDUs to the upper layer and significantly affects program fluency.
- Similarly, when the receiver cannot receive the PDU with SN=77 from the local slowest cell B2 at a
time point 1235 and the variable VR(UDR) is equal to 77, the receiver considers the PDU with SN=77 as received, i.e. incrementing the variable VR(UDR) by 1 so that at atime point 1240, the variable VR(UDR) is set to be 78, and at atime point 1250 the PDU with SN=78 is delivered to the upper layer for replay. Thus, the PDUs with SN=78 and greater are not held in the buffer but are delivered to the upper layer without further delay. Thus, theprocedure 1000 maintains program fluency and improves program quality. - In addition, when at the
time point 312, the local slowest cell is the cell A2. The receiver receives a PDU with SN=68, so that the receiver determines a PDU with SN=67 was not received from the local slowest cell A2 at atime point 310, and the variable VR(UDR) is 67. Therefore, the receiver considers the PDU with SN=67 as received, i.e., the receiver increments the variable VR(UDR) by 1 so that at thetime point 320, the variable VR(UDR) is set to be 68 and the PDU with SN=68 is delivered to the upper layer at atime point 330 for replay. Note that at thetime point 320, the receiver had considered the PDU with SN=67 as received (but actually it was not received). Thus, after replaying a PDU with SN=66 at thetime point 350, the receiver jumps to replay the PDU with SN=68 so that jittering does not have significant affects (only jumps one TTI). Other than that, at atime point 360, there is a short blank between a PDU with SN=74 and a PDU with SN=75. The short blank also has limited affects on program replaying. - Furthermore, as the receiver changes cells, the receiver cannot receive PDUs with SN=49 to 55. Hence after the receiver replays a PDUs with SN=48 at a
time point 1232, there are 7 TTIs going by before replaying a PDUs with SN=56 at atime point 1234. This means, a time interval between replaying the PDUs with SN=48 and replaying the PDUs with SN=56 exactly equals to a time interval originally between the two PDUs so that the user senses a part of the program is discontinued, but there are no time jumps as the program resumes later. The 7 TTIs between thetime point 1232 and thetime point 1234 correspond to the missing PDUs with SN=49 to 55. After the receiver replays the PDU with SN=48 at thetime point 232, the receiver does not replay the PDU with SN=56 immediately at a next TTI of thetime point 1232 so that the user, due to the time continuity of the service content, will not be confused. However in some situations, if a time delay is long, it affects a fluency in service content replaying and causes user inconvenience. Therefore, the present invention provides another embodiment to solve the described problem. - Please refer to
FIG. 14 .FIG. 14 is a flow chart of aprocedure 1400 of a third embodiment for reducing data stream jittering in a selective combining system. The selective combining system can be a mobile communications system, such as UMTS, operating in UM. Theprocedure 1400 comprises following steps. - Step 1402: start.
- Step 1404: determine a minimum transition time period required to change to another cell in the selective combining system.
- Step 1406: keep a maximum time difference of transmitting packets between cells to be less than or equal to the minimum transition time.
- Step 1408: end.
- Therefore, according to the
procedure 1400 of the present invention, a network transmitter determines a minimum transition time required for a receiver to change to another cell, then keeps a time difference of transmitting packets between cells to be less than or equal to the minimum transition time. For example, inFIG. 1 toFIG. 3 , a minimum transition time required for changing cells is 2 TTIs, therefore the network transmitter controls a time difference between the cell A and the cell B from 9 TTIs, as shown inFIG. 1 toFIG. 3 , to be within 2 TTIs. This can be achieved by keeping the timing sequence of the cell B the same and shifting the timing sequence of the cell A back 7 TTIs so that an SN of thetime point 102 should be changed to 48 from 55 as shown, and there will be no large data losses in transition times later. In addition, after keeping a transmitting time difference between cells in an appropriate range, the receiving window size of the Duplicate Avoidance and Reordering Function can be set to be a value corresponds to the time difference. - In summation, for MBMS applications, the receiver is able to receive the same PDU from different cells. For better data receiving efficiency, the RLC entity of the receiver can initiate the Duplicate Avoidance and Reordering Function, which discards and reorders duplicate PDUs. However, cells are not in synchronization so that there is a time difference between cells transmission even if service contents are identical. In the present invention, if the receiver cannot receive a next expected packet from a slowest cell, the present invention considers this missing packet as received so that the receiver can deliver packets after the missing packet in sequence to upper layer for replay. This avoids the prior art problem of having other successfully received packets that are after the missing packet in sequence being held in a buffer and not sent to the upper layer, which leads to delay in data stream processing or replaying. The present invention maintains program replay fluency and improves program quality. Additionally, the present invention keeps a time difference of transmitting between cells to be less than or equal to a minimum transition time required to change cells, to avoid data losses when the receiver moves and changes cells. Therefore, the present invention can reduce jittering in data streams in a selective combining system and have a better program quality with more fluent service contents replaying.
- Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims.
Claims (10)
1. A jitter reducing method in a receiver of a selective combining system, the method comprising:
determining a slowest cell corresponding to the receiver in the selective combining system;
treating a plurality of missing packets as being received, when a data stream transmitted by the slowest cell is detected to comprise the plurality of missing packets and a sequence number of a first packet in the plurality of missing packets is a sequence number of a next packet that is expected to be received in sequence; and
delivering a received packet following the plurality of missing packets in sequence to an upper layer.
2. The method of claim 1 wherein treating the plurality of missing packets as being received is incrementing the sequence number of the next packet that is expected to be received in sequence by a number of the plurality of missing packets.
3. The method of claim 2 wherein the number of the plurality of missing packets is 1.
4. The method of claim 1 wherein a timing sequence of the data stream transmitted by the slowest cell is behind or equal to timing sequences of data streams transmitted by all other cells that are capable of providing services to the receiver.
5. The method of claim 1 wherein a timing sequence of the data stream transmitted by the slowest cell is behind or equal to timing sequences of data streams transmitted by all neighboring cells that are currently capable of providing services to the receiver.
6. The method of claim 1 wherein the receiver is operating in Unacknowledged Mode (UM).
7. A receiving device comprising a central processing unit in electrical communications with a memory, the memory comprising program code for implementing the method of claim 1 .
8. A jitter reducing method in a selective combining system, the method comprising:
determining a minimum transition time period required to change to another cell in the selective combining system; and
keeping a maximum time difference of transmitting packets between cells to be less than or equal to the minimum transition time.
9. The method of claim 8 further comprising setting a size of a duplicate avoidance and reordering function window according to the minimum transition time.
10. The method of claim 9 wherein the selective combining system is operating in Unacknowledged Mode (UM).
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/380,420 US20070250637A1 (en) | 2005-04-29 | 2006-05-24 | Method and Apparatus for Reducing Jitter in a Receiver of a Selective Combining System |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US59469705P | 2005-04-29 | 2005-04-29 | |
US11/380,420 US20070250637A1 (en) | 2005-04-29 | 2006-05-24 | Method and Apparatus for Reducing Jitter in a Receiver of a Selective Combining System |
Publications (1)
Publication Number | Publication Date |
---|---|
US20070250637A1 true US20070250637A1 (en) | 2007-10-25 |
Family
ID=36763126
Family Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/379,576 Abandoned US20060245430A1 (en) | 2005-04-29 | 2006-04-21 | Method and Apparatus of a Procedure for Receiving Window Size Reconfiguration in a Communication System |
US11/380,654 Active 2028-05-19 US8134993B2 (en) | 2005-04-29 | 2006-04-28 | Method and apparatus for polling transmission status in a wireless communication system |
US11/380,420 Abandoned US20070250637A1 (en) | 2005-04-29 | 2006-05-24 | Method and Apparatus for Reducing Jitter in a Receiver of a Selective Combining System |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/379,576 Abandoned US20060245430A1 (en) | 2005-04-29 | 2006-04-21 | Method and Apparatus of a Procedure for Receiving Window Size Reconfiguration in a Communication System |
US11/380,654 Active 2028-05-19 US8134993B2 (en) | 2005-04-29 | 2006-04-28 | Method and apparatus for polling transmission status in a wireless communication system |
Country Status (9)
Country | Link |
---|---|
US (3) | US20060245430A1 (en) |
EP (2) | EP1718016A2 (en) |
JP (2) | JP2006311543A (en) |
KR (2) | KR20060113567A (en) |
CN (2) | CN1855887A (en) |
AT (1) | ATE459170T1 (en) |
DE (1) | DE602006012393D1 (en) |
ES (1) | ES2340602T5 (en) |
TW (3) | TW200642375A (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090168723A1 (en) * | 2007-11-27 | 2009-07-02 | Qualcomm Incorporated | Method and apparatus for handling out-of-order packets during handover in a wireless communication system |
US8355331B2 (en) | 2008-03-17 | 2013-01-15 | Lg Electronics Inc. | Method for transmitting PDCP status report |
US10051230B2 (en) | 2007-08-29 | 2018-08-14 | Samsung Electronics Co., Ltd. | Method for connecting an external apparatus and multimedia replaying apparatus using the same |
Families Citing this family (39)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4934666B2 (en) * | 2005-05-04 | 2012-05-16 | エルジー エレクトロニクス インコーポレイティド | Method for transmitting control information in wireless communication system and method for updating transmission window using the same |
US8040836B2 (en) * | 2006-05-26 | 2011-10-18 | Microsoft Corporation | Local network coding for wireless networks |
KR100996069B1 (en) * | 2006-11-27 | 2010-11-22 | 삼성전자주식회사 | Method and apparatus for data transmission of radio link control layer in mobile telecommunication |
US8243645B2 (en) | 2007-02-14 | 2012-08-14 | Innovative Sonic Limited | Method and apparatus for enhancing transmission efficiency in a wireless communications system |
JP4896073B2 (en) * | 2007-05-15 | 2012-03-14 | イノヴァティヴ ソニック リミテッド | Method and apparatus for polling data transmission status in a wireless communication system |
US8159965B2 (en) * | 2007-05-18 | 2012-04-17 | Innovative Sonic Limited | Method of comparing state variable or packet sequence number for a wireless communications system and related apparatus |
US8774203B2 (en) * | 2007-06-07 | 2014-07-08 | Intel Corporation | One-way message notification with out-of-order packet delivery |
KR101341515B1 (en) | 2007-06-18 | 2013-12-16 | 엘지전자 주식회사 | Method of updating repeatedly-transmitted information in wireless communicaiton system |
KR101486352B1 (en) | 2007-06-18 | 2015-01-26 | 엘지전자 주식회사 | Method of controlling uplink synchronization state at a user equipment in a mobile communication system |
WO2008156314A2 (en) | 2007-06-20 | 2008-12-24 | Lg Electronics Inc. | Effective system information reception method |
EP2186247A4 (en) | 2007-08-10 | 2014-01-29 | Lg Electronics Inc | Method for controlling harq operation in dynamic radio resource allocation |
KR101479341B1 (en) | 2007-08-10 | 2015-01-05 | 엘지전자 주식회사 | Effective reception method in wireless communication system providing a MBMS service |
KR101514841B1 (en) | 2007-08-10 | 2015-04-23 | 엘지전자 주식회사 | Method for re-attempting a random access effectively |
KR101490253B1 (en) | 2007-08-10 | 2015-02-05 | 엘지전자 주식회사 | Method of transmitting and receiving control information in a wireless communication system |
US8488523B2 (en) | 2007-08-14 | 2013-07-16 | Lg Electronics Inc. | Method of transmitting and processing data block of specific protocol layer in wireless communication system |
KR100937432B1 (en) | 2007-09-13 | 2010-01-18 | 엘지전자 주식회사 | Method of allocating radio resources in a wireless communication system |
KR101461970B1 (en) | 2007-09-13 | 2014-11-14 | 엘지전자 주식회사 | Method of performing polling procedure in a wireless communication system |
KR101435844B1 (en) | 2007-09-18 | 2014-08-29 | 엘지전자 주식회사 | Method of transmitting a data block in a wireless communication system |
KR101396062B1 (en) | 2007-09-18 | 2014-05-26 | 엘지전자 주식회사 | Effective data block transmission method using a header indicator |
KR101513033B1 (en) | 2007-09-18 | 2015-04-17 | 엘지전자 주식회사 | A method for qos guarantees in a multilayer structure |
KR101591824B1 (en) | 2007-09-18 | 2016-02-04 | 엘지전자 주식회사 | Method of performing polling procedure in a wireless communication system |
US8687565B2 (en) | 2007-09-20 | 2014-04-01 | Lg Electronics Inc. | Method of effectively transmitting radio resource allocation request in mobile communication system |
KR20090041323A (en) | 2007-10-23 | 2009-04-28 | 엘지전자 주식회사 | Method of effectively transmitting identification information of terminal during the generation of data block |
KR101487557B1 (en) | 2007-10-23 | 2015-01-29 | 엘지전자 주식회사 | Method for transmitting data of common control channel |
TWI394399B (en) * | 2007-10-28 | 2013-04-21 | Innovative Sonic Ltd | Method and apparatus for counting transmission times of a pdu |
KR20090043465A (en) | 2007-10-29 | 2009-05-06 | 엘지전자 주식회사 | A method for repairing an error depending on a radio bearer type |
US8879399B2 (en) * | 2008-02-01 | 2014-11-04 | Samsung Electronics Co., Ltd. | Method and system for managing data transfer |
KR20090087773A (en) * | 2008-02-13 | 2009-08-18 | 삼성전자주식회사 | Apparatus and method for retransmittion packet data unit and reporting status in a mobile communication system |
US8958411B2 (en) | 2008-03-17 | 2015-02-17 | Lg Electronics Inc. | Method of transmitting RLC data |
JP5348138B2 (en) * | 2008-10-24 | 2013-11-20 | 日本電気株式会社 | Packet loss frequency measurement system, packet loss frequency measurement method and program |
US8295159B2 (en) * | 2009-01-14 | 2012-10-23 | Qualcomm Incorporated | Timer poll retransmission expiry in a wireless communication system |
US8228938B2 (en) * | 2009-02-02 | 2012-07-24 | Samsung Electronics Co., Ltd. | Method and apparatus for preventing a miss-detection of duplicated packets and an out-of-sequence delivery to the higher layer in unacknowledged mode operation |
JP5147898B2 (en) * | 2010-06-10 | 2013-02-20 | 株式会社エヌ・ティ・ティ・ドコモ | Radio control apparatus and communication control method |
US9420475B2 (en) * | 2013-02-08 | 2016-08-16 | Intel Deutschland Gmbh | Radio communication devices and methods for controlling a radio communication device |
US20160014803A1 (en) * | 2014-07-09 | 2016-01-14 | Qualcomm Incorporated | Systems and methods for traffic information signaling in a wireless communications network |
RU2748764C1 (en) * | 2018-02-14 | 2021-05-31 | Телефонактиеболагет Лм Эрикссон (Пабл) | Transmitter and method for communication performed in it |
WO2019245179A1 (en) * | 2018-06-20 | 2019-12-26 | Lg Electronics Inc. | Method for processing a packet located outside of window by reception end in wireless communication system and an apparatus therefor |
US20200059504A1 (en) * | 2018-08-19 | 2020-02-20 | Pixart Imaging Inc. | Schemes capable of synchronizing native clocks and audio codec clocks of audio playing for bluetooth wireless devices |
CN113645177A (en) * | 2020-05-11 | 2021-11-12 | 同响科技股份有限公司 | Method and system for maintaining real-time audio stream playback delay in reliable transmission network |
Citations (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5740173A (en) * | 1996-02-28 | 1998-04-14 | Telefonaktiebolaget Lm Ericsson | Asynchronous transfer mode (ATM) cell arrival monitoring system |
US5878041A (en) * | 1995-09-19 | 1999-03-02 | Fujitsu Limited | Error handling in transmission of data that cannot be retransmitted |
US6085085A (en) * | 1996-03-27 | 2000-07-04 | Qualcomm Incorporated | Method and apparatus for performing preferred system selection |
US20030198220A1 (en) * | 2002-04-18 | 2003-10-23 | Gross Jonathan H. | Method for reducing packet data delay variation in an internet protocol network |
US20040038686A1 (en) * | 2001-04-05 | 2004-02-26 | Theodore Buot | Allocation period determination for packet data |
US20040062260A1 (en) * | 2002-09-30 | 2004-04-01 | Raetz Anthony E. | Multi-level jitter control |
US20050086404A1 (en) * | 2001-10-12 | 2005-04-21 | Wolf-Dietrich Weber | Method and apparatus for scheduling a resource to meet quality-of-service restrictions |
US7020123B2 (en) * | 2000-03-29 | 2006-03-28 | Samsung Electronics Co., Ltd. | Method and apparatus for transmitting and receiving wireless packet |
US7065168B2 (en) * | 1998-09-04 | 2006-06-20 | Fujitsu Limited | Jitter reduction |
US7388883B2 (en) * | 2002-05-06 | 2008-06-17 | Innovative Sonic Limited | Abnormal case handling for acknowledged mode transmission and unacknowledged mode transmission |
US7417991B1 (en) * | 2003-12-18 | 2008-08-26 | Avaya Inc. | Network quality estimation |
US20080275905A1 (en) * | 2007-05-04 | 2008-11-06 | Nokia Corporation | Media stream recording into a reception hint track of a multimedia container file |
Family Cites Families (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
TW496058B (en) | 1997-07-08 | 2002-07-21 | Ericsson Telefon Ab L M | Technique for providing a secure link in a mobile communication system |
US6038633A (en) * | 1997-08-15 | 2000-03-14 | Compaq Computer Corporation | System and method for providing a dual interrupt mechanism to designate the occurrence and termination of an event |
US6230013B1 (en) | 1997-11-26 | 2001-05-08 | Telefonaktiebolaget Lm Ericsson (Publ) | Diversity handling moveover for CDMA mobile telecommunications |
JP3444224B2 (en) | 1999-03-23 | 2003-09-08 | ヤマハ株式会社 | Packet transfer device |
US6922393B2 (en) | 2001-01-10 | 2005-07-26 | Asustek Computer Inc. | Data discarding request acknowledgement in a wireless communications protocol |
US6687248B2 (en) | 2001-01-10 | 2004-02-03 | Asustek Computer Inc. | Sequence number ordering in a wireless communications system |
TW578402B (en) | 2001-04-03 | 2004-03-01 | Asustek Comp Inc | Window-based polling scheme for a wireless communications protocol |
EP1263160A1 (en) * | 2001-06-01 | 2002-12-04 | Telefonaktiebolaget Lm Ericsson | Method and transmitter for an efficient packet data transfer in a transmission protocol with repeat requests |
KR100765121B1 (en) | 2001-11-24 | 2007-10-11 | 엘지전자 주식회사 | Polling method of Protocol Data Unit of transmission buffer |
US6717927B2 (en) * | 2002-04-05 | 2004-04-06 | Interdigital Technology Corporation | System for efficient recovery of node B buffered data following serving high speed downlink shared channel cell change |
KR100434054B1 (en) * | 2002-04-26 | 2004-06-04 | 엘지전자 주식회사 | Polling method of radio link control |
US7227856B2 (en) * | 2002-08-13 | 2007-06-05 | Innovative Sonic Limited | Method for handling timers after an RLC reset or re-establishment in a wireless communications system |
US7706405B2 (en) * | 2002-09-12 | 2010-04-27 | Interdigital Technology Corporation | System for efficient recovery of Node-B buffered data following MAC layer reset |
KR100802619B1 (en) * | 2002-11-07 | 2008-02-13 | 엘지전자 주식회사 | Method for receiving data in a receiver under radio link control protocolprocessing method for rlc reception window |
EP1465369A1 (en) * | 2003-03-31 | 2004-10-06 | Matsushita Electric Industrial Co., Ltd. | Reset synchronisation method for a retransmission protocol |
CN1577256A (en) | 2003-07-29 | 2005-02-09 | 群光电子股份有限公司 | Programmable radio receiver and computer system for programming receiving module |
US8855572B2 (en) * | 2004-06-16 | 2014-10-07 | Qualcomm Incorporated | Method and apparatus for link control in wireless communications |
US7558243B2 (en) | 2004-09-15 | 2009-07-07 | Innovative Sonic Limited | Enhanced polling method for preventing deadlock in a wireless communications system |
US7525908B2 (en) * | 2004-09-24 | 2009-04-28 | M-Stack Limited | Data unit management in communications |
EP1811727A3 (en) | 2005-02-07 | 2008-03-26 | Samsung Electronics Co., Ltd. | Method and apparatus for transmitting a status report for retransmission control in a mobile communication system |
KR20080090191A (en) | 2007-04-04 | 2008-10-08 | 엘지전자 주식회사 | Navigation method, and navigation system |
-
2006
- 2006-03-30 CN CNA2006100715851A patent/CN1855887A/en active Pending
- 2006-04-11 CN CNB2006100753815A patent/CN100479359C/en active Active
- 2006-04-20 JP JP2006116832A patent/JP2006311543A/en active Pending
- 2006-04-21 US US11/379,576 patent/US20060245430A1/en not_active Abandoned
- 2006-04-27 EP EP06008828A patent/EP1718016A2/en not_active Withdrawn
- 2006-04-27 EP EP06008830.9A patent/EP1718017B2/en active Active
- 2006-04-27 TW TW095115121A patent/TW200642375A/en unknown
- 2006-04-27 TW TW095115123A patent/TWI308827B/en active
- 2006-04-27 AT AT06008830T patent/ATE459170T1/en not_active IP Right Cessation
- 2006-04-27 JP JP2006123295A patent/JP2006311564A/en not_active Withdrawn
- 2006-04-27 ES ES06008830T patent/ES2340602T5/en active Active
- 2006-04-27 TW TW095115128A patent/TW200638711A/en unknown
- 2006-04-27 DE DE602006012393T patent/DE602006012393D1/en active Active
- 2006-04-28 US US11/380,654 patent/US8134993B2/en active Active
- 2006-05-01 KR KR1020060039276A patent/KR20060113567A/en not_active Application Discontinuation
- 2006-05-01 KR KR1020060039275A patent/KR100779753B1/en active IP Right Grant
- 2006-05-24 US US11/380,420 patent/US20070250637A1/en not_active Abandoned
Patent Citations (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5878041A (en) * | 1995-09-19 | 1999-03-02 | Fujitsu Limited | Error handling in transmission of data that cannot be retransmitted |
US5740173A (en) * | 1996-02-28 | 1998-04-14 | Telefonaktiebolaget Lm Ericsson | Asynchronous transfer mode (ATM) cell arrival monitoring system |
US6085085A (en) * | 1996-03-27 | 2000-07-04 | Qualcomm Incorporated | Method and apparatus for performing preferred system selection |
US7065168B2 (en) * | 1998-09-04 | 2006-06-20 | Fujitsu Limited | Jitter reduction |
US7020123B2 (en) * | 2000-03-29 | 2006-03-28 | Samsung Electronics Co., Ltd. | Method and apparatus for transmitting and receiving wireless packet |
US20040038686A1 (en) * | 2001-04-05 | 2004-02-26 | Theodore Buot | Allocation period determination for packet data |
US20050086404A1 (en) * | 2001-10-12 | 2005-04-21 | Wolf-Dietrich Weber | Method and apparatus for scheduling a resource to meet quality-of-service restrictions |
US20030198220A1 (en) * | 2002-04-18 | 2003-10-23 | Gross Jonathan H. | Method for reducing packet data delay variation in an internet protocol network |
US7388883B2 (en) * | 2002-05-06 | 2008-06-17 | Innovative Sonic Limited | Abnormal case handling for acknowledged mode transmission and unacknowledged mode transmission |
US20040062260A1 (en) * | 2002-09-30 | 2004-04-01 | Raetz Anthony E. | Multi-level jitter control |
US7417991B1 (en) * | 2003-12-18 | 2008-08-26 | Avaya Inc. | Network quality estimation |
US20080275905A1 (en) * | 2007-05-04 | 2008-11-06 | Nokia Corporation | Media stream recording into a reception hint track of a multimedia container file |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10051230B2 (en) | 2007-08-29 | 2018-08-14 | Samsung Electronics Co., Ltd. | Method for connecting an external apparatus and multimedia replaying apparatus using the same |
US20090168723A1 (en) * | 2007-11-27 | 2009-07-02 | Qualcomm Incorporated | Method and apparatus for handling out-of-order packets during handover in a wireless communication system |
US10924970B2 (en) | 2007-11-27 | 2021-02-16 | Qualcomm Incorporated | Method and apparatus for handling out-of-order packets during handover in a wireless communication system |
US11647435B2 (en) | 2007-11-27 | 2023-05-09 | Qualcomm Incorporated | Method and apparatus for handling out-of-order packets during handover in a wireless communication system |
US8355331B2 (en) | 2008-03-17 | 2013-01-15 | Lg Electronics Inc. | Method for transmitting PDCP status report |
Also Published As
Publication number | Publication date |
---|---|
EP1718017B1 (en) | 2010-02-24 |
US20060245430A1 (en) | 2006-11-02 |
CN1855887A (en) | 2006-11-01 |
US8134993B2 (en) | 2012-03-13 |
EP1718017B2 (en) | 2020-10-28 |
KR20060113566A (en) | 2006-11-02 |
EP1718017A2 (en) | 2006-11-02 |
ATE459170T1 (en) | 2010-03-15 |
EP1718017A3 (en) | 2008-01-23 |
JP2006311564A (en) | 2006-11-09 |
ES2340602T3 (en) | 2010-06-07 |
TW200642375A (en) | 2006-12-01 |
TWI308827B (en) | 2009-04-11 |
ES2340602T5 (en) | 2021-06-25 |
EP1718016A2 (en) | 2006-11-02 |
DE602006012393D1 (en) | 2010-04-08 |
JP2006311543A (en) | 2006-11-09 |
CN100479359C (en) | 2009-04-15 |
US20060245410A1 (en) | 2006-11-02 |
TW200642348A (en) | 2006-12-01 |
CN1855800A (en) | 2006-11-01 |
TW200638711A (en) | 2006-11-01 |
KR100779753B1 (en) | 2007-11-26 |
KR20060113567A (en) | 2006-11-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20070250637A1 (en) | Method and Apparatus for Reducing Jitter in a Receiver of a Selective Combining System | |
EP3118855B1 (en) | Audio synchronous playing method, device and system | |
US9288263B2 (en) | Two tier multiple sliding window mechanism for multidestination media applications | |
FI116816B (en) | Streaming media | |
US6697356B1 (en) | Method and apparatus for time stretching to hide data packet pre-buffering delays | |
US20070091206A1 (en) | Methods, systems and computer program products for accessing downloadable content associated with received broadcast content | |
CN101682562B (en) | Method and apparatus for modifying playback timing of talkspurts within a sentence without affecting intelligibility | |
US20080040759A1 (en) | System And Method For Establishing And Maintaining Synchronization Of Isochronous Audio And Video Information Streams in Wireless Multimedia Applications | |
CN104486638A (en) | Access network handover for a mobile television system | |
KR100988874B1 (en) | Method of comparing state variable or packet sequence number for a wireless communications system and related apparatus | |
US8520521B2 (en) | Method and apparatus for initiating a storage window in a wireless communications system | |
US8355720B2 (en) | Application and transport adaptation for a wireless communication prior to a reselection | |
CN102084652B (en) | Method and apparatus for selective caching of burst stream transmission | |
CN113347578B (en) | Audio data transmission method, device and system, storage medium and earphone | |
CN114827681B (en) | Video synchronization method, device, electronic equipment, terminal equipment and storage medium | |
CN104244063A (en) | Conversion method and device of multiple playing devices | |
US20130227062A1 (en) | Apparatus and method of displaying a contents using for key frame in a terminal | |
CN106303563A (en) | The online playing method and device of Streaming Media | |
US20110305266A1 (en) | Method which permits a block-based file to be played out during transmission | |
CN101536501A (en) | A method and receiving unit for fast change of services | |
US20170019353A1 (en) | Two tier multiple sliding window mechanism for multidestination media applications | |
CN114979793A (en) | Live broadcast data transmission method, device, system, equipment and medium | |
US9413664B1 (en) | Resuming media objects delivered via streaming services upon data loss events | |
CN113037853A (en) | Data processing method, device, equipment and storage medium | |
CN101141639A (en) | Method and device for identifying stream media video frame boundary |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: ASUSTEK COMPUTER INC., TAIWAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:JIANG, SAM SHIAW-SHIANG;REEL/FRAME:017557/0746 Effective date: 20060420 |
|
AS | Assignment |
Owner name: INNOVATIVE SONIC LIMITED, VIRGIN ISLANDS, BRITISH Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ASUSTEK COMPUTER INC.;REEL/FRAME:020146/0762 Effective date: 20071112 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |