TW200950396A - A method for acknowledging reception of data - Google Patents

A method for acknowledging reception of data Download PDF

Info

Publication number
TW200950396A
TW200950396A TW98103401A TW98103401A TW200950396A TW 200950396 A TW200950396 A TW 200950396A TW 98103401 A TW98103401 A TW 98103401A TW 98103401 A TW98103401 A TW 98103401A TW 200950396 A TW200950396 A TW 200950396A
Authority
TW
Taiwan
Prior art keywords
data packet
station
arq
period
predetermined
Prior art date
Application number
TW98103401A
Other languages
Chinese (zh)
Inventor
Matthew P J Baker
Timothy J Moulsley
Original Assignee
Koninkl Philips Electronics Nv
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Koninkl Philips Electronics Nv filed Critical Koninkl Philips Electronics Nv
Publication of TW200950396A publication Critical patent/TW200950396A/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements 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/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1822Automatic repetition systems, e.g. Van Duuren systems involving configuration of automatic repeat request [ARQ] with parallel processes

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

The present invention relates to a method for acknowledging reception of data transmitted over a channel from first station to a second station. The method comprising the steps of: (a) at the first station, transmitting a data packet to the second station according to an Automatic Repeat-Request ARQ process having a predetermined ARQ period; (b) at the second station, decoding the data packet, and transmitting an indication on whether the data packet has correctly been decoded; (c) at the first station, retransmitting said data packet, if the data packet has not been correctly decoded, wherein said method further comprises the step of: (d) increasing the length of the predetermined ARQ period if, at step (a) the data packet has been sent over a plurality of bundled data packets.

Description

200950396 . 六、發明說明: 【發明所屬之技術領域】 本發明係關於一種確認收到經由—值认 旰輸通道從一第—站 發送到一第二站的資料之方法。 本發明係關於例如電彳§網路,特为丨β umts。 ,、動電信網路,如 【發明内容】 本發明的一個目的是提出一種確認資 咖 料封包的方法’其 月t*靈活地調節該等資料封包的不同發 赞&amp;持續時間,同時減 少延遲並且避免引發不必要的重發。 站發送到一 為此提供一種確認收到經由一通道從—第 第二站的資料之方法,該方法包括以下步驟: ⑷在該第-站’根據-具有_預定自動重傳請求綱 週期的ARQ程序發送一資料封包至該第二站· (b)在該第二站’解碼該資料 μ + 寸钌包並發送一關於該資 料封包是否已被正確解碼的指示; ⑷在該第—站,如果該資料封包沒有被正確解碼,則 重發該資料封包,其中該方法進—步包括步驟⑷:如果在 步驟⑷該資料封包已經經由複數個拥束的資料封包發送, 則增加該預定ARQ週期的長度。 本發明的這些和其他態樣從以下描述的該等實施例將是 明顯的並且參考該等實施例闡明。 【實施方式】 見將以舉例的方式參考該等所附圖式更詳細地描述本發 138164.doc -4- 200950396 • 明。 在一包括一發送站和一接收站的通信系統中,資料被分 成封包並且以子訊框發送。如果該接收站未能解碼—資料 封包,則它可經由根據一混合自動重傳請求(harq)協定 . 發送一否定確認(NACK)而請求重發。 . 多個harq通道或程序可並行作業,使在一先前封包正 由該接收站解碼的同時能夠持續資料發送。每個11八贝〇程 φ 序被指派一編號以便識別哪個重發資料封包應與哪個先前 發送的封包在該接收器中結合。該序編號可與該 資料封包-起被發送或者從一已知時間參考諸如該子訊框 編號隱含地決定;後者方法包括更少的發送開銷並且還更 可靠,因為它避免了發送該HARQ程序編號中的錯誤,但 是它降低了靈活性。 在某些情況下,多個資料封包可被分組或「捆束」在一 起以用-單個4認(ACK)或說〖確認。該技術可被用於 # 例如在該發送站與該接收站之間的無線電通道品質較差以 及該發送站已經在最大發送功率下作業的情況下。一資料 塊然後可按經由在-捆束的資料封包中複數個連續子訊框 ' 發送的此方式編碼。 . 如果该捆束技術與一同步HARQ方案結合,則可能出現 -個問題。該同步HARQ方案將指定—組特定子訊框,其 中可發生資料封包的任何請求的重發,該組子訊框通常在 每個HARQ往返時間(RTT)中包括一子訊框,其中一harq RTT是N個子訊框的持續時間,其中N是作業中的臟q程 138164.doc 200950396 序的總數。然而,使用捆束意味著如果該HARQ ACK或 NACK是反映解碼整個捆束的資料封包的結果,那麼該 ACK/NACK必須被延遲,這繼而意味著在下個HARQ RTT 中該發送站在該指定子訊框的開頭可能沒有足夠時間組態 和執行該重發。該同步HARQ方案因此將指定該重發必須 被延遲直到下個RTT,這導致一長延遲及可能不滿意的服 務品質。該延遲在圖1中以舉例的方式說明,其中8個 HARQ程序被組態,導致一 8個子訊框的HARQ RTT,且其 中該接收站在發送回ACK或NACK之前需要一 3個子訊框的 週期以解碼一資料封包,以及該發送站需要一 3個子訊框 的週期以解碼一 ACK或NACK及組合該資料的一重發。因 此在該實例中,在該發送站收到該NACK與下個HARQ RTT中子訊框的開始之間沒有足夠的時間,其中該同步 HARQ作業指定該重發應該被發送。因此該重發必須被延 遲一整個HARQ RTT。 對此問題的一種已知解決方法是該接收站在解碼該捆束 的該第一包之後發送ACK或NACK,而無需等到解碼後面 的封包,如圖.2中所示。這不需要延遲該重發,但缺點是 如果該接收站在該捆束中最先收到的該資料封包的基礎上 未能解碼該捆束的資料封包,則將一直執行一重發,而在 很多情況下,當其連續資料封包全部被收到時,該接收站 可能有能力解碼該整個捆束,而不需要重發。 根據本發明,HARQ程序與計時參考之間的關係,係以 一取決於一捆束中包括的資料封包數目的方式修改。 138164.doc 200950396 • 在一第一實施例中,該修改包括加長該HARQ RTT。這 在圖3中說明,其中該重發能夠比圖1中的早6個子訊框發 送。該重發比圖2中的遲2個子訊框發生,但是需要重發的 概率被降低,因為該接收站已經能夠把該捆束中的所有封 包用於該解碼程序。 在一實施例中,該HARQ RTT加長的數量實質上等於在 一捆束中的子訊框數減去發送一沒有捆束的資料封包所用 的子訊框數的持續時間。 ® 在另一實施例中,該HARQ RTT的長度被完全進位成在 一捆束中包括的子訊框數的次一整數倍,大於未修改的 HARQ RTT或加長的HARQ RTT。該經修改的HARQ RTT的 長度可被設定使得小數量之經修改的HARQ RTT包括一與 稍大數量之未修改的HARQ RTT相等的持續時間。例如, 在圖3中,四個經修改的HARQ RTT具有與五個未修改的 HARQ RTT相同的持續時間。這在排定來自多個發送站的 _ 資料發送時可能是有利的,該等發送站其中一些使用梱束 以及其他一些沒有捆束。 在一些實施例中,將使用的捆束程度且因此HARQ RTT * 被修改的方式係經由一較高層協定之傳信而配置,如無線 .電資源控制(RRC)傳信。 在一些實施例中,該等HARQ程序與該計時參考之間的 關係可假設所有發送被捆束,使得連續子訊框組是與同一 HARQ程序編號相關。在其他實施例中,只有一子集的發 送被假設成捆束,其他HARQ程序獨立地作業;例如,在 138164.doc 200950396 此情況下’在—經修改的HARQ RTT中的該等HARQ程序 編號在圖3中所示的該實例的一變化(圖4中所示)中可以 分別是{〇, 0, 〇, 1, 2, 3, 4, 5, 6, 7}。 在圖3中所示的該實例的另一變化中,該等HARQ程序編 號可以是{〇, 〇, 〇, 1,1,1,2, 2, 2, 3}。 HARQg序與該計時參考之間的關係的修改可使得每個 拥束程度是與一不同關係相關,或一單個關係可以是與多 個捆束程度相關。 例如,如果每個捆束程度是與一不同關係相關,則當捆 束沒有被組態時,可應用一 8個子訊框的HARq RTT,而當 成對的資料封包被捆束時,應用一 9個子訊框的harq RTT,當3個資料封包—組被捆束時,應用一丨〇個子訊框 的HARQ RTT,以及當4個資料封包一組被捆束時,應用一 11個子訊框的HARQ RTT。或者,如果一單個關係是與多 個拥束程度相目’則當捆束沒有被組態時,可應用-8個 子訊框的HARQRtt,而當2、3或4個資料封包一組被拥束 時’應用-u個子訊框的HARQ RTT。因此,該關係可取 決於在-捆束中的資料封包數目是否大於或小於—臨界 值J心界值例如可以是被發送的或是預定的。 该發送站可以是一行動終端且該接收站可是一基地台, 或者反之亦然。該通作备餘I β … 观系統可以是-行動通信系統,如 UMTS之長期演進系統。 【圖式簡單說明】 圖1顯示具有一 長延遲的拥束和同步 混合自動重傳請求 J38164.doc 200950396200950396. VI. Description of the Invention: [Technical Field] The present invention relates to a method of confirming receipt of data transmitted from a first station to a second station via a value-for-value transmission channel. The present invention relates to, for example, an electric network, specifically 丨βumts. , a mobile telecommunications network, such as [Summary of the Invention] An object of the present invention is to provide a method for confirming the packaging of the coffee material, the month t* flexibly adjusts the different praises and durations of the data packets, and simultaneously reduces Delay and avoid causing unnecessary retransmissions. The station sends a method for confirming receipt of data from a second station via a channel, the method comprising the following steps: (4) at the first station 'according to having a predetermined automatic retransmission request period The ARQ program sends a data packet to the second station. (b) At the second station, 'decode the data μ + inch packet and send an indication as to whether the data packet has been correctly decoded; (4) at the first station And if the data packet is not correctly decoded, retransmitting the data packet, wherein the method further comprises the step (4): if the data packet has been sent through the plurality of bundled data packets in the step (4), adding the predetermined ARQ The length of the cycle. These and other aspects of the invention will be apparent from the description of the <RTIgt; [Embodiment] The present invention will be described in more detail by way of example with reference to the accompanying drawings, 138164.doc -4- 200950396. In a communication system including a transmitting station and a receiving station, data is divided into packets and transmitted in a subframe. If the receiving station fails to decode the data packet, it may request retransmission via a hybrid automatic repeat request (harq) protocol. A negative acknowledgement (NACK) is sent. Multiple harq channels or programs can operate in parallel to enable continuous data transmission while a previous packet is being decoded by the receiving station. Each 11 octave φ sequence is assigned a number to identify which retransmitted data packet should be combined with which previously sent packet in the receiver. The sequence number can be sent from the data packet or implicitly from a known time reference such as the subframe number; the latter method includes less transmission overhead and is more reliable because it avoids sending the HARQ An error in the program number, but it reduces flexibility. In some cases, multiple data packets can be grouped or "bundled" together - a single acknowledgment (ACK) or acknowledgment. This technique can be used, for example, if the radio channel between the transmitting station and the receiving station is of poor quality and the transmitting station has been operating at maximum transmit power. A data block can then be encoded in this manner sent via a plurality of consecutive sub-frames in the bundle of data packets. If the bundling technique is combined with a synchronous HARQ scheme, there may be a problem. The synchronous HARQ scheme will specify a group-specific subframe in which retransmission of any request for a data packet may occur, the group of subframes typically including a subframe in each HARQ round trip time (RTT), one of which is harq RTT is the duration of N subframes, where N is the total number of dirty q-ranges in the job 138164.doc 200950396. However, the use of bundling means that if the HARQ ACK or NACK is the result of reflecting the data packet decoding the entire bundle, then the ACK/NACK must be delayed, which in turn means that the sender is in the specified sub-HARQ RTT There may not be enough time at the beginning of the frame to configure and execute the retransmission. The synchronous HARQ scheme will therefore specify that the retransmission must be delayed until the next RTT, which results in a long delay and possibly unsatisfactory quality of service. The delay is illustrated by way of example in Figure 1, where 8 HARQ programs are configured, resulting in an HARQ RTT of 8 subframes, and wherein the receiving station requires a subframe of 3 before sending back an ACK or NACK. The cycle is to decode a data packet, and the transmitting station needs a period of one subframe to decode an ACK or NACK and combine a retransmission of the data. Thus, in this example, there is not enough time between the receipt of the NACK by the transmitting station and the start of the subframe in the next HARQ RTT, wherein the synchronous HARQ job specifies that the retransmission should be sent. Therefore, the retransmission must be delayed by an entire HARQ RTT. A known solution to this problem is that the receiving station sends an ACK or NACK after decoding the first packet of the bundle without waiting to decode the subsequent packet, as shown in Fig. 2. This does not need to delay the retransmission, but the disadvantage is that if the receiving station fails to decode the data packet of the bundle based on the data packet received first in the bundle, a retransmission will be performed all the time, and In many cases, when all of its continuous data packets are received, the receiving station may be able to decode the entire bundle without retransmission. In accordance with the present invention, the relationship between the HARQ program and the timing reference is modified in a manner that depends on the number of data packets included in a bundle. 138164.doc 200950396 • In a first embodiment, the modification includes lengthening the HARQ RTT. This is illustrated in Figure 3, where the retransmission can be sent 6 frames earlier than in Figure 1. This retransmission occurs more than the late 2 subframes in Figure 2, but the probability of requiring retransmission is reduced because the receiving station is already able to use all of the packets in the bundle for the decoding procedure. In one embodiment, the number of HARQ RTT extensions is substantially equal to the number of subframes in a bundle minus the number of subframes used to transmit an unbundled data packet. In another embodiment, the length of the HARQ RTT is fully rounded to a second integer multiple of the number of sub-frames included in a bundle, greater than the unmodified HARQ RTT or the extended HARQ RTT. The length of the modified HARQ RTT can be set such that a small number of modified HARQ RTTs include a duration equal to a slightly larger number of unmodified HARQ RTTs. For example, in Figure 3, the four modified HARQ RTTs have the same duration as the five unmodified HARQ RTTs. This may be advantageous when scheduling _ data transmissions from multiple transmitting stations, some of which use shackles and others that are not bundled. In some embodiments, the degree of bundling to be used, and thus the manner in which the HARQ RTT* is modified, is configured via a higher layer protocol signaling, such as wireless. Power Resource Control (RRC) signaling. In some embodiments, the relationship between the HARQ program and the timing reference may assume that all transmissions are bundled such that successive subframe groups are associated with the same HARQ program number. In other embodiments, only a subset of transmissions is assumed to be bundled, and other HARQ programs operate independently; for example, in 288164.doc 200950396 in this case, the HARQ program numbers in the modified HARQ RTT In a variation of this example (shown in Figure 4) shown in Figure 3, it may be {〇, 0, 〇, 1, 2, 3, 4, 5, 6, 7}, respectively. In another variation of the example shown in Figure 3, the HARQ program numbers can be {〇, 〇, 〇, 1, 1, 1, 2, 2, 2, 3}. The modification of the relationship between the HARQg sequence and the timing reference may be such that each degree of convergence is related to a different relationship, or a single relationship may be related to a plurality of binding levels. For example, if each bundling degree is related to a different relationship, an ARQ RTT of 8 sub-frames can be applied when the bundling is not configured, and when a pair of data packets are bundled, a 9 is applied. The harq RTT of a sub-frame, when three data packets are bundled, the HARQ RTT of one sub-frame is applied, and when one set of four data packets is bundled, an 11 sub-frame is applied. HARQ RTT. Or, if a single relationship is related to multiple degrees of confinement, then when the bundle is not configured, the HARQRtt of -8 sub-frames can be applied, and when a group of 2, 3 or 4 data packets is occupied When the bundle is 'apply-u sub-frame HARQ RTT. Thus, the relationship may depend on whether the number of data packets in the bundle is greater or less than - the critical value J threshold value may be, for example, sent or predetermined. The transmitting station can be a mobile terminal and the receiving station can be a base station, or vice versa. The general backup system can be a mobile communication system, such as the UMTS long term evolution system. [Simple diagram of the diagram] Figure 1 shows the clustering and synchronization hybrid automatic repeat request with a long delay. J38164.doc 200950396

HARQ ; 圖2顯示具有基於部分解碼的重發的捆束和同步HARQ ; 圖3顯示根據本發明的一實施例的捆束和同步HARQ ;及 圖4顯示根據本發明的一實施例的捆束和同步HARQ。 138164.docHARQ; Figure 2 shows bundle and synchronous HARQ with partial decoding based retransmission; Figure 3 shows bundle and synchronous HARQ according to an embodiment of the invention; and Figure 4 shows bundle according to an embodiment of the invention And synchronous HARQ. 138164.doc

Claims (1)

200950396 .七、申請專利範圍:200950396 . Seven, the scope of application for patents: 一種確認收到經由一通道從一第一站發送到—第二站的 資料之方法’該方法包括以下步驟: ⑷在該第-站’根據―具有—預定ARQ週期的自動重 傳請求ARQ程序發送—資料封包至該第二站; (b)在該第二站,解碼該資料封包,並發送—關於該資 料封包是否已被正確解碼的指示; (c)在該第一站,如果該資料封包沒有被正確解碼,則 重發該資料封包, 其中該方法進一步包括以下步驟: (d)如果在步驟(a)該資料封包已經經由複數個捆束的資 料封包發送,則增加該預定ARQ週期的長度。 2_根據請求項丨之方法,其中步驟(d)在步驟(a)之前執行。A method of acknowledging receipt of data transmitted from a first station to a second station via a channel. The method comprises the following steps: (4) at the first station 'according to an automatic retransmission request ARQ procedure having a predetermined ARQ period Sending a data packet to the second station; (b) at the second station, decoding the data packet and transmitting an indication of whether the data packet has been correctly decoded; (c) at the first station, if If the data packet is not correctly decoded, the data packet is retransmitted, wherein the method further comprises the following steps: (d) if the data packet has been sent through the plurality of bundled data packets in step (a), the predetermined ARQ is increased. The length of the cycle. 2_ According to the method of claim item, wherein step (d) is performed before step (a). 3. 根據請求項1之方法,其中該等捆束的資料封包需要一 第一時間量以被發送’且其中步驟(d)被執行使得該預定 ARQ週期的增加長度是該第一時間量的整數倍。 4. 根據請求項i之方法,其中該等捆束的資料封包需要一 第一時間量以被發送,且其中步驟(d)被執行使得該預定 ARQ週期的增加長度大於該第一時間量、解碼該等梱束 的封包所需之時間、發送一關於該資料封包是否已經被 正確解碼的指示的時間以及解碼該指示的時間的總和。 5_根據請求項1之方法,其中步驟(d)被執行使得該預定 ARQ週期的增加長度取決於在下個arq週期中排定多少 捆束的資料封包。 138164.doc 200950396 粑據月长項1之方法,其中該預定週期被增加了在 該等捆束的貝料封包巾的子訊框數減去發送—沒有摘束 的資料封包所用的子訊框數的持續時間。 7. 根據叫求項i之方法,其中該預定a叫週期的長度被完 全進位(round up)成在該等摘束的資料封包中包括的子訊 框數的次-整數 4 1= + 堂数借大於未增加長度的該預定ARQ週期 或具有增加長度的該預定ARQ週期。 8. 根據請求項1之方法,其中ARQ程序與一計時參考之間 的關係疋使知資料封包的每個捆束程度是與一不同關係 相關。 9. 根據請求項丨之方法,其中ARQ程序與一計時參考之間 的關係是使得一單個關係是與資料封包的多個捆束程度 相關。 10. 根據凊求項1之方法,其中ARq程序與一計時參考之間 的關係係取決於在一捆束中的資料封包數目是否大於或 小於一臨界值,該臨界值是被發送或是預先決定。 Π. —種無線電站,其包括用於執行在先前請求項中任一項 之方法的裝置。 138164.doc3. The method of claim 1, wherein the bundled data packets require a first amount of time to be sent 'and wherein step (d) is performed such that the increased length of the predetermined ARQ period is the first amount of time Integer multiple. 4. The method of claim i, wherein the bundled data packets require a first amount of time to be transmitted, and wherein step (d) is performed such that the increased length of the predetermined ARQ period is greater than the first amount of time, The sum of the time required to decode the bundled packets, the time at which an indication of whether the data packet has been correctly decoded, and the time at which the indication was decoded. The method according to claim 1, wherein the step (d) is performed such that the length of the increase of the predetermined ARQ period depends on how many bundled data packets are scheduled in the next arq period. 138164.doc 200950396 According to the method of month length item 1, wherein the predetermined period is increased by the number of sub-frames of the bundled bedding package minus the transmission - the sub-frame used for the data packet that is not picked up The duration of the number. 7. The method according to claim i, wherein the length of the predetermined a calling period is rounded up to a sub-integer of the number of sub-frames included in the extracted data packets 4 1 = + The number borrows the predetermined ARQ period that is greater than the unincremented length or the predetermined ARQ period that has an increased length. 8. The method of claim 1, wherein the relationship between the ARQ program and a timing reference is such that each bundle level of the data packet is associated with a different relationship. 9. The method of claim 1, wherein the relationship between the ARQ program and a timing reference is such that a single relationship is related to a plurality of bundle levels of the data packet. 10. The method of claim 1, wherein the relationship between the ARq program and a timing reference is dependent on whether the number of data packets in a bundle is greater than or less than a threshold, the threshold being sent or pre- Decide. A radio station comprising means for performing the method of any of the preceding claims. 138164.doc
TW98103401A 2008-02-06 2009-02-03 A method for acknowledging reception of data TW200950396A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
EP08305018 2008-02-06

Publications (1)

Publication Number Publication Date
TW200950396A true TW200950396A (en) 2009-12-01

Family

ID=40952515

Family Applications (1)

Application Number Title Priority Date Filing Date
TW98103401A TW200950396A (en) 2008-02-06 2009-02-03 A method for acknowledging reception of data

Country Status (2)

Country Link
TW (1) TW200950396A (en)
WO (1) WO2009098610A2 (en)

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6301249B1 (en) * 1998-08-04 2001-10-09 Opuswave Networks, Inc Efficient error control for wireless packet transmissions

Also Published As

Publication number Publication date
WO2009098610A3 (en) 2009-11-05
WO2009098610A2 (en) 2009-08-13

Similar Documents

Publication Publication Date Title
US12040898B2 (en) Method and arrangement for retransmission using HARQ
JP4198910B2 (en) Method for transmitting and receiving subpackets in a parallel channel encoder packet transmission system
CN103248464B (en) Uplink data transmission method and device
CN101801094B (en) Subframe binding transmission method, system and device in long-term evolution multi-carrier system
JP2016504798A (en) Communication apparatus and communication method
CN105897385A (en) Method for acknowledging transmission of RLC (Radio Link Control) data packet and RLC AM (Acknowledge Mode) entity sender
CN105934907A (en) Radio resource scheduling method and apparatus
CN108574564A (en) Mixed automatic retransmission request method and device
WO2013159597A1 (en) Data transmission method, user equipment, and base station
WO2013170464A1 (en) Method for transmitting or receiving uplink sps service data, user equipment, and base station
TW200950396A (en) A method for acknowledging reception of data