1. Field of the Invention
This invention relates to a method for Hybrid Automatic Repeat Request reordering in Enhanced Uplink Dedicated Channel in WCDMA (Wideband Code Division Multiple Access) mobile communication system.
2. Description of the Related Art
Enhanced Up-link Dedicated Channel (simplified as EUDCH hereinafter) is a research project under standardization proposed by version 6 of 3rd Generation Partner Project (3GPP). The purpose of EUDCH is to improve the up-link capacity of the system through efficient management and planning for up-link transmission resources of the wireless network, and to make it applicable to the transmission of data service with high bursts. It improves the percentage of coverage and the throughput of the cell, improves uplink transmission rate as well as reduces uplink delay through improving the performance of uplink dedicated transfer channel. Main technologies adopted are as follows:
Hybrid Automatic Repeat Request (HARQ) is one of the main technologies. This invention proposes the application method of the HARQ technology in EUDCH with emphasis on the operating method for reordering.
In the existing WCDMA mobile communication system, the standard about detailed operating method for HARQ in EUDCH doesn't exist yet. In principle, HARQ operation in EUDCH can be regarded as the inverse process of the HARQ operation in High Speed Data Packet Access (HSDPA). In the following, the relevant definition of the HARQ reordering in HSDPA will be explained.
The MAC-hs handles the HSDPA specific functions. In the model below the MAC-hs comprises the following entities:
101 HARQ: The HARQ entity is responsible for handling the MAC functions relating to the HARQ protocol. The HARQ functional entity handles all the tasks that are required for hybrid ARQ. It is responsible for generating ACKs or NACKs. The detailed configuration of the hybrid ARQ protocol is provided by RRC over the MAC-Control SAP.
102 Reordering Queue distribution: The reordering queue distribution function routes the MAC-hs PDUs to the correct reordering buffer based on the Queue ID.
103 Reordering: The reordering entity reorders received MAC-hs PDUs according to the received TSN. MAC-hs PDUs with consecutive TSNs are delivered to the disassembly function upon reception. MAC-hs PDUs are not delivered to the disassembly function if MAC-hs PDUs with lower TSN are missing. There is one reordering entity for each Queue ID configured at the UE.
104 Disassembly: The disassembly entity is responsible for the disassembly of MAC-hs PDUs. When a MAC-hs PDU is disassembled the MAC-hs header is removed, the MAC-d PDUs are extracted and any present padding bits are removed. Then the MAC-d PDUs are delivered to higher layer.
The associated signalling shown in the figure illustrates the exchange of information between layer 1 and layer 2.
At the receiver, there are two buffers, i.e. a soft combining buffer at the physical layer and a re-ordering buffer at the MAC layer. The soft combining buffer is used to combine retransmissions and decode the data These two buffers are both located in the receiver, i.e. the UE (User Equipment).
If the existing HARQ reordering technology is applied to EUDCH, following two problems may be resulted in:
1) It is not preferable to dispose both soft combining buffer and reordering buffer at the Node B. Considering the case of soft handoff, each Node B in active set is receiving uplink data and the data correctly received by each Node B or not may be different. So it is unnecessary to set a reordering buffer at each Node B, which makes latency too long and results in delay in one aspect, and in another aspect may result in waste of the buffer space. Only if one Node B correctly receives the data, the data can be directly sent to the SRNC (Serving Radio Network Controller) and reordered uniformly at the SRNC, which can obtain the most effective diversity gain.
2) In some cases, the reodering buffer can result in perpetual data loss and then result in the queue hole. In conclusion, following several situations may happen:
If preferable measure isn't adopted to deal with the above several cases, it will result in queue stop, thus correctly received data can't be sent upward and the buffer overflows.
The purpose of this invention is to provide a solution with separate models, i.e. separating the soft combining e buffer from the reordering buffer. The soft combining buffer is located in the Node B and the reordering buffer is located in the SRNC respectively. Thus not only the diversity gain of many Node Bs is ensured, but also the queue latency is reduced and the buffer space is saved.
To realize the above purposes, a method for the HARQ reordering in Uplink Channel of telecommunication system includes plurality of Node Bs having soft combine buffers respectively and a RNC having reordering buffer, control each of the Node Bs comprising following steps:
receiving, at the Node Bs, packet data from mobile terminal and storing the received data in the soft combining buffer respectively;
decoding the received data with channel decoder in each Node Bs;
transmitting an Acknowledge or Non-acknowledge information to the mobile terminal;
transmitting, at the Node Bs, the decoded data to the RNC;
buffering each decoded data in the reordering buffer; and
reordering the decoded data in the RNC.
To achieve the above purposes, a method for the HARQ reordering in Uplink Channel of telecommunication system includes Node B having soft combining buffer and a RNC having reordering buffer, comprising following steps:
receiving, at the Node B, packet data from mobile terminal and storing the received data in the soft combining buffer;
decoding the received data with channel decoder in Node B;
transmitting an Acknowledge or Non-acknowledge information to the mobile terminal;
transmitting, at the Node B, the decoded data to the RNC;
buffering the decoded data in the reordering buffer; and
reordering the decoded data in the RNC.
To achieve the above purposes, a telecommunication system having hybrid automatic repeat request (HARQ) function, the system comprising;
plurality of Node Bs, at least one of the Node Bs communicates with a terminal, for receiving packet data from a mobile terminal, decoding the packet data and transmitting acknowledgement signal or non-acknowledgement signal to the terminal according to the decoding result;
the mobile terminal for transmitting the packet data and repeating transmission of the packet data when the terminal receive the non-acknowledgement signal; and
a RNC for controlling the Node Bs, receiving decoded data from the Node B, reordering the packet data according to a packet sequence of the packet data,
wherein, the Node B having soft combining buffer buffering the packet data and combining first transmission packet data and second transmission packet data when the Node B receive the packet data again.
The soft combining buffer have two combining method, the first one is chase combining method which combines same packet dada received from first transmission and second transmission. And second another one is IR (incremental redundancy) which combine different version of same packet data.
Aiming at the second problem in the existing technology, this invention proposes three solutions of the operation mechanism.
a) Timer mechanism
b) Window mechanism
c) Soft combination buffer state indicatiing (SBI) mechanism
These three mechanisms are independent with each other and can be used separately. But in order to reach the optimal performance, the three mechanisms shall be used simultaneously as a combination scheme to maximally eliminate the blocking state and to reach the optimal effect.
The introduction of SBI mechanism needs the support of the new Iub and Iur signaling. This invention proposes an improved DCH data frame structure.
This invention proposes the corresponding MAC-EU (Medium Access Control—Enhanced Uplink) entity structure by adopting the separation technology of the soft combination buffer and the reordering buffer. This separation model can not only ensure the diversity gain, but also reduce the receiving delay and save the buffer space. Three mechanisms are proposed (timer mechanism, window mechanism and SBI mechanism) to prevent the blocking of the reordering buffer, which degrades the blocking to the least level, improves the receiving efficiency and improves the system performance. The invention needs to modify the data frame structure on the Iub interface and the Iur interface to support the new SBI mechanism.
This invention is consisted of the contents of three aspects.
MAC-EU distributed scheme;
Reordering buffer blocking avoidance scheme; (including three mechanisms, i.e. the timer mechanism, the window mechanism, and the SBI mechanism)
New signaling scheme under the SBI mechanism;
In the following, the contents of each part will be explained in detail:
MAC-EU Distributed Scheme
In the soft handoff state, several Node Bs in the active set are receiving the uplink data, and the soft combining buffer must be located in the Node B to ensure the diversity gain. The reordering buffer shall be located in the SRNC. After each Node B correctly receives the packet, it will send the packet to the SRNC right away. If there are duplicate data, the SRNC will identify it according to the sequence number (TSN) and discard it automatically. All correctly received packets are queued uniformly in the SRNC.
Accordingly, as illustrated in
Reordering Buffer Blocking Avoidance Scheme
In order to avoid the blocking of the reordering buffer due to the losses of the certain PDUs, new operation mechanism needs to be defined. Here three mechanisms are proposed, which are introduced respectively in the following. These three mechanisms are independent with each other and can be used separately. But in order to reach the optimal performance, the three mechanisms shall be used simultaneously as a combination scheme to maximally eliminate the blocking state and to reach the optimal effect.
1) Timer Mechanism
Set a transmission timer (Timer T) at the UE, which is used to control the retransmission time and to prevent the unlimited retransmissions. So the UE can only perform retransmission before the termination of the timer. Each time when a new packet is sent, the Timer T is activated; When the UE receives an ACK, the counting stops. If the UE receives a NACK, it retransmits this packet until the timer expires. At this time, the UE gives up the retransmission and starts to send new packets. The time duration of the Timer T is configured by the upper layer.
At the receiver of the SRNC, each queue sets a reordering buffer, and it is the release timer (Timer R) that controls the latency of the empty position. Each time when a MAC-EU PDU is received, if the position with lower sequence number is empty, it cannot be sent upward to the upper layer, and then the Timer R is started up. If the Timer R expires and the position is still empty, it won't wait any more and the position is released. Subsequent data correctly received are delivered to the upper layer. The time duration of the Timer R is configured by the upper layer.
The operation rules for the SRNC reordering buffer under the timer mechanism will be explained in detail in the afterward embodiments (
2) Window Mechanism
If a window is defined at the UE, the MAC-EU PDU won't result in the confusion of the transmission sequence number (TSN) at the receiver. The size of the transmission window is set as TRANSMIT_WINDOW, whose maximum value is a half of the TSN length range. The upper layer determines the configuration of the TRANSMIT-WINDOW.
After the UE transmits a MAC-EU PDU with TSN=SN, all MAC-EU PDUs satisfying that TSN≦SN−TRANSMIT_WINDOW cannot be retransmitted, which can prevent the confusion of the sequence number at the receiver. The MAC-EU PDUs that have been given up by the sender won't be retransmitted forever.
If a receiving window is defined at the SRNC, receiving MAC-EU PDU within the window won't result in the window to slide forward. The size of the receiving window is set as RECEIVE_WINDOW, whose maximum value is a half of the TSN length range. The configuration of the RECEIVE_WINDOW is determined by the upper layer.
The operation rules for the SRNC reordering buffer under the window mechanism will be explained in detail in the afterward embodiments (
3) Soft Combining Buffer State Indicating (SBI) Mechanism
Even employing the timer mechanism and the window mechanism, some blocking cases still cannot be solved. Refer to the example in
After the packet with TSN of 2 fails in retransmission about several times, the UE gives up the retransmission and sends the new packets in the same process. At this time, the state of the reordering buffer is shown in the figure. The position with TSN of 2 is empty. The timer R stays in the counting state and the packets with TSN of 3 and 9 are blocked, unable to be sent to the upper layer. The receiving window isn't be pushed forward. In this situation, the SRNC cannot release the reordering buffer in time, and only through waiting for the termination of the timer or the sliding of the window, the position with TSN of 2 can be emptied, which will result in delay and blocking. At this time, if the SRNC knows the state of the soft combination buffer in the Node B, it can quickly release the reordering buffer to prevent the deadlock state. So, Node B needs to send the soft combination buffer state indication bit to the SRNC which can better prevent the blocking after knowing this information.
Each time when the Node B correctly receives a packet, it sends the packet to the SRNC right away. At the same time a SBI bit accompanied is sent in bundling with the data. The SBI bit has two states:
SBI=1: Indicate that all processes in the soft combination buffer are empty, i.e. no data need to be retransmitted.
SBI=0: All other states.
The operation rules for the SRNC reordering buffer under the SBI mechanism will be explained in detail in the afterward embodiments (
New signaling scheme under the SBI mechanism.
The introduction of the SBI bit results in the modification to the Iub and Iur data flow protocols. In the following embodiment (
In the model below the distributed MAC-EU comprises of the following entities:
501 Start.
502 The MAC-EU PDU with the TSN equaling to the SN is received, but as the position with lower TSN number is empty, it cannot be sent upward.
503 Detect whether there is a Timer R activated, and only one Timer R can be in the activate state at one time.
504 If no Timer R stays in the activate state at this time, start up the Timer R and the counting.
505 If the Timer R expires, detect whether the positions with higher TSN are still empty.
506 If the empty TSN is received before the Timer R expires, stop the Timer R and detect whether the empty positions with higher TSN are still exist.
507 If there is still empty position, all MAC-EU PDUs previous to the next empty position are all sent to the disassembly entity. Then re-start the Timer R at the empty position with the highest TSN and start counting.
508 If no other empty position exists, send all MAC-EU PDUs correctly received to the disassembly entity.
509 End.
601 Start.
602 The MAC-EU PDU with the TSN equaling to the SN is received.
603 Although the SN is within the receiving window, as the TSN has been received, the current MAC-EU PDU will be discarded.
604 If the SN is within the receiving window and this TSN hasn't been received before, put the MAC-EU PDU onto the corresponding TSN position.
605 If the SN is beyond the window, the SN becomes the highest boundary of the new window and the window slides forward. The MAC-EU PDUs beyond the window will all be sent to the disassembly entity.
606 All MAC-EU PDUs before the first empty position of the window will all be sent to the disassembly entity.
607 End.
701 Start.
702 The MAC-EU PDU with the TSN equaling to the SN is received.
703 Detect the SBI bit accompanied, if SBI=1, clear the reordering buffer corresponding to the queue and all MAC-EU PDU received are sent to the disassembly entity.
704 If SBI=0, do nothing.
705 End.
401 The MAC-EU PDU with TSN of 1 is correctly received, and the SBI bit accompanied is 1. As all processes have no data for retransmission at this time, all process buffers are empty.
402 The MAC-EU PDU with TSN of 3 is correctly received, and the SBI bit accompanied is 0. As the process 2 has data for retransmission, the process 2 is not empty.
403 The MAC-EU PDU with TSN of 4 is correctly received, and the SBI bit accompanied is 0. The reason is the same as above.
404 The MAC-EU PDU with TSN of 5 is correctly received, and the SBI bit accompanied is 0. The reason is the same as above.
405 The MAC-EU PDU with TSN of 6 is correctly received, and the SBI bit accompanied is 0. The reason is the same as above.
406 The MAC-EU PDU with TSN of 7 is correctly received, and the SBI bit accompanied is 0. The reason is the same as above.
407 The MAC-EU PDU with TSN of 8 is correctly received, and the SBI bit accompanied is 0. The reason is the same as above.
408 The MAC-EU PDU with TSN of 9 is correctly received, and the SBI bit accompanied is 1. As all processes have no data for retransmission at this time, all process buffers are empty.
801 Add a SBI bit for each TB in the DCH data frame structure to indicate the state of the soft combination buffer.
Number | Date | Country | Kind |
---|---|---|---|
03 1 03703 | Feb 2003 | CN | national |
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/KR2004/000320 | 2/17/2004 | WO | 00 | 9/25/2006 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2004/073273 | 8/26/2004 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
5805576 | Worley et al. | Sep 1998 | A |
6137784 | Wallerius et al. | Oct 2000 | A |
6192038 | Wallerius et al. | Feb 2001 | B1 |
6333936 | Johansson et al. | Dec 2001 | B1 |
6347091 | Wallentin et al. | Feb 2002 | B1 |
6349094 | Vastano et al. | Feb 2002 | B1 |
6374112 | Widegren et al. | Apr 2002 | B1 |
6678249 | Toskala et al. | Jan 2004 | B2 |
6678523 | Ghosh et al. | Jan 2004 | B1 |
7013143 | Love et al. | Mar 2006 | B2 |
7054316 | Cheng et al. | May 2006 | B2 |
7369521 | Frederiksen et al. | May 2008 | B2 |
20010018345 | Longoni et al. | Aug 2001 | A1 |
20020021698 | Lee et al. | Feb 2002 | A1 |
20020196760 | Malomsoky et al. | Dec 2002 | A1 |
20030045288 | Luschi et al. | Mar 2003 | A1 |
20030161280 | Gruhn et al. | Aug 2003 | A1 |
20040009786 | Terry | Jan 2004 | A1 |
20040052229 | Terry et al. | Mar 2004 | A1 |
20040116143 | Love et al. | Jun 2004 | A1 |
20040120306 | Wigard et al. | Jun 2004 | A1 |
20040228313 | Cheng et al. | Nov 2004 | A1 |
20050018644 | Gessner et al. | Jan 2005 | A1 |
20050022098 | Vayanos et al. | Jan 2005 | A1 |
20050054359 | Ishii et al. | Mar 2005 | A1 |
20050141477 | Tomita et al. | Jun 2005 | A1 |
20060268880 | Zhao et al. | Nov 2006 | A1 |
20080212588 | Yi et al. | Sep 2008 | A1 |
20090175222 | Yi et al. | Jul 2009 | A1 |
20090245272 | Peisa et al. | Oct 2009 | A1 |
Number | Date | Country |
---|---|---|
2361 392 | Oct 2001 | GB |
WO 0203600 | Jan 2002 | WO |
WO 0221757 | Mar 2002 | WO |
WO 02065797 | Aug 2002 | WO |
WO 02091659 | Nov 2002 | WO |
WO 02096006 | Nov 2002 | WO |
WO 02096044 | Nov 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20070042782 A1 | Feb 2007 | US |