TW200926671A - Method of data transmission using HARQ - Google Patents

Method of data transmission using HARQ Download PDF

Info

Publication number
TW200926671A
TW200926671A TW097141674A TW97141674A TW200926671A TW 200926671 A TW200926671 A TW 200926671A TW 097141674 A TW097141674 A TW 097141674A TW 97141674 A TW97141674 A TW 97141674A TW 200926671 A TW200926671 A TW 200926671A
Authority
TW
Taiwan
Prior art keywords
data
redundancy
transmission
redundancy version
versions
Prior art date
Application number
TW097141674A
Other languages
Chinese (zh)
Inventor
Bong-Hoe Kim
Dong-Wook Roh
Joon-Kui Ahn
Dong-Youn Seo
Hak-Seong Kim
Hyun-Wook Park
Dae-Won Lee
Original Assignee
Lg Electronics Inc
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 Lg Electronics Inc filed Critical Lg Electronics Inc
Publication of TW200926671A publication Critical patent/TW200926671A/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/1812Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1819Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0033Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0067Rate matching
    • 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/1607Details of the supervisory signal
    • H04L1/1621Group acknowledgement, i.e. the acknowledgement message defining a range of identifiers, e.g. of sequence numbers
    • 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/1867Arrangements specially adapted for the transmitter end
    • H04L1/1874Buffer management

Landscapes

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

Abstract

A method of transmitting data from a user terminal to a base station using a hybrid automatic repeat request (HARQ) scheme with a plurality of redundancy versions of said data, each of the redundancy versions (RV) indicating a transmission start position of a data block in a circular buffer is disclosed. For each retransmission, the redundancy version to be used by considering the previously used redundancy version and a predetermined sequence is determined. Within one sequence, at least two redundancy versions following each other have non consecutive start positions.

Description

200926671 六、發明說明: 【發明所屬之技術領域】 本發明是有關於無線通訊,並且特別是有關於一種利 用混合式自動重覆請求(HARQ)之資料傳輸方法。 【先前技術】 可利用錯誤校正法則以確保通訊可靠性。該錯誤校正 法則的範例包含向前錯誤校正(FEC)法則及自動重覆請求 (HRQ)法則。在該FEC法則裡,傳送器藉由利用一額外錯 誤校正碼以對資訊位元編碼,然後#送該等資訊位元。一 接收器解調變該等所收信號,然後對該錯誤校正碼進行編 碼,並且接著將所傳資訊加以復原。根據該解碼程序,可 對所收信號錯誤進行校正。相對地,在該ARQ法則裡該傳 送器則是藉由重傳資料以進行錯誤校正。該ARQ法則的範 例包含停止並等待(SAW)、go-back-N (GBN)、選擇性重覆 (SR)等等。 渦輪碼即為一種錯誤校正碼。該渦輪碼含有一遞迴系 統性迴旋轉編碼器及一交錯器。一四分多項式擾組(QPP) 交錯器係一交錯器範例,其可用以在當實作該渦輪碼時協 助進行平行解碼。已知該QPP交錯器僅在當一資料區塊具 有一特定大小時維持一良好效能。資料區塊的大小愈大, 200926671 該渦輪碼的效能即愈佳。然而,為有助於實作 當在實 際通訊系統中一資料區塊具有一大於一特定大小的大小 時,會藉由將該資料區塊劃分成數個較小資料區塊以進行 編瑪 經劃分的較小資料區塊稱為數碼區塊。一般說來,該 •等數碼區塊具有相同大小《不過,由於在該QPP交錯器内 的大小限制之故,在複數個數碼區塊中可能會有一戋更多 ® 的數碼區塊具有不同大小。執行交錯處理之目的是在於降 低當經由一無線頻道以傳送資料時所出現之突波錯誤的影 響。在經傳送後’該經交錯之資科係對映至一實際無線電 資源。當實際進行傳輸時是利用一固定量值的無線電資 源。從而,一經編碼之數碼區塊需要進行速率匹配處理。 一般說來,可藉由扎註或重覆作業以完成此速率匹配處 理。可按數碼區塊為單位以進行該速率匹配處理,而該數 碼區塊係經編碼,即類似於第三代夥伴計晝(3Gpp)的寬帶 劃碼多重接取(WCDMA)。 *> 該FEC法則的優點為微小時間延遲’並且無須在傳送 /接收末端之間進行資訊交換。然而該fec法則的缺點是 在良好頻道環境中系統效率性會劣化《可利用該ARQ法 則以改善傳輸可靠性。不過該aRq法則的缺點是在於出 現時間延遲’並且當在不良頻道環境中系統效率性會劣 200926671 化。為解決此等缺點,可藉由合併該FEC及該ARQ以提 議一種混合式自動重覆請求(HARQ)法則。根據該HARQ法 則’決定一實體層所接收之資料中是否含有無可復原錯 誤,並且在當出現一錯誤時請求重傳,藉此改善效能。 e ❹ 可將HARQ式重傳法則分類為同步harq及非同步 HARQ。同步HARQ係一其中是在一傳送器及一接收器已 知之時點處進行資料重傳的法則。而在該同步harq法則 裡可省略像疋HARQ處理器編號的訊令。非同步HARQ 係其中疋在任意時點處配置用於重傳之資源的法則。在 該非同步HARQ法則中,會因—額外訊令而出現開支。200926671 VI. Description of the Invention: [Technical Field] The present invention relates to wireless communication, and more particularly to a data transmission method using hybrid automatic repeat request (HARQ). [Prior Art] Error correction rules can be utilized to ensure communication reliability. Examples of this error correction rule include the Forward Error Correction (FEC) rule and the Automatic Repeat Request (HRQ) rule. In the FEC rule, the transmitter encodes the information bits by using an additional error correction code and then # sends the information bits. A receiver demodulates the received signals, then encodes the error correction code, and then recovers the transmitted information. According to the decoding procedure, the received signal error can be corrected. In contrast, in the ARQ rule, the transmitter performs error correction by retransmitting the data. Examples of the ARQ rule include stop and wait (SAW), go-back-N (GBN), selective repeat (SR), and the like. The turbo code is an error correction code. The turbo code includes a recursive system rotary encoder and an interleaver. A quadrant polynomial scrambling (QPP) interleaver is an interleaver paradigm that can be used to assist in parallel decoding when implementing the turbo code. The QPP interleaver is known to maintain a good performance only when a data block has a particular size. The larger the size of the data block, the better the performance of the turbo code in 200926671. However, in order to facilitate the implementation, when a data block has a size larger than a specific size in the actual communication system, the data block is divided into a plurality of smaller data blocks to perform the division of the code division. The smaller data block is called a digital block. In general, the digital blocks of the same size have the same size. However, due to the size limitation in the QPP interleaver, there may be more than one digital block in different digital blocks having different sizes. . The purpose of performing interleaving is to reduce the effects of glitch errors that occur when transmitting data over a wireless channel. After being transmitted, the interlaced assets are mapped to an actual radio resource. A fixed amount of radio resources is utilized when actually transmitting. Thus, a coded digital block requires rate matching processing. In general, this rate matching process can be accomplished by placing or repeating the job. The rate matching process can be performed in units of digital blocks, and the code blocks are encoded, i.e., similar to the third generation partner (3Gpp) wideband coded multiple access (WCDMA). *> The advantage of this FEC rule is a small time delay' and there is no need to exchange information between the transmit/receive ends. However, the disadvantage of the fec rule is that system efficiency is degraded in a good channel environment. The ARQ rule can be utilized to improve transmission reliability. However, the disadvantage of the aRq rule is that the time delay occurs and the system efficiency is inferior in a bad channel environment. To address these shortcomings, a hybrid automatic repeat request (HARQ) rule can be proposed by combining the FEC and the ARQ. According to the HARQ rule, it is determined whether or not a material received by a physical layer contains an unrecoverable error, and a retransmission is requested when an error occurs, thereby improving performance. e H The HARQ-style retransmission rule can be classified into synchronous harq and asynchronous HARQ. Synchronous HARQ is one of the rules for data retransmission at a point when the transmitter and receiver are known. In the synchronous harq rule, the command like the HARQ processor number can be omitted. The asynchronous HARQ is a rule in which resources for retransmission are configured at any point in time. In this non-synchronous HARQ rule, expenses will arise due to additional orders.

而根據傳送屬性’可將該HARQ分類成調適性HARQ F調適HARQ。該傳輪屬性包含資源配置、調變法則、 傳送區塊大小等等。在該調適性裡,根據頻道條件 的變化而①’傳輸屬性會完全地或部分地改變。在該非調 適& HARQ裡,會持續地運用用於第一傳輸的傳輸屬性, 而與頻道條件的變化無關。 备並未自所收貝料中偵測到錯誤時,該接收器傳送一 確MACK)信㈣為1應信號,並因此向該傳送器通知 成功接收。當自所㈣料中制到錯誤時該接收器傳送 —負確知(NACK)㈣作為1應㈣,並因此向該傳送器 通知偵知錯誤。該傳送器可在當收到該Μ·信號時重傳 200926671 該資料 HARQ式接收器基本上會嘗試進行所收資料的錯誤 校正’並且藉由利用一錯誤偵測碼以決定是否應執行重 .傳。該錯誤债測碼可為一循環冗餘檢查(CRC)e當經由一 CRC偵測程序而自該所收資料偵測到一錯誤時,該接收器 會將該NACKi言號傳送至該傳送器。當收到該NACK信號 時該傳送器會根據HARQ模式(亦即一追逐合併模式或一 ❹遞增冗餘(IR)模式)以傳送-適當重傳資料。 根據表不所重傳之資料區塊特徵的冗餘版本(rv),該 HARQ模式可分货成追逐合併模式及伙模式。在該追逐合 併模式裡,為獲得—, ^仏唬對雜訊比(SNR),會將該經偵得錯 誤資料口併於所重傳資料,而非抛除該經谓得錯誤資料。 而在該IH模式下’會連同所重傳資料而遞增地傳送額外的 、冗餘資訊,藉以獲得一編碼增益並且減少因重傳作業而導 當在該m模式下使用循環緩衝器逮率匹配處理時該 rv通常表示-自-循環緩衝器所傳送或重傳之資料區塊 的傳輸起點位置。亦即,a # & 』即在該循環緩衝器中必須定義出一 特定數量之傳輸起點位置,甘The HARQ can be classified into an adaptive HARQ F adaptation HARQ according to the transmission attribute. The transport attribute includes resource configuration, modulation rules, transport block size, and so on. In this adaptability, the 1' transmission attribute changes completely or partially depending on the channel condition. In this non-adaptive & HARQ, the transmission properties for the first transmission are continuously applied regardless of changes in channel conditions. When the error is not detected in the received bedding, the receiver transmits a true MACK) signal (4) as a 1 signal, and thus informs the transmitter of successful reception. The receiver transmits a negative error (NACK) (4) as a 1 (4) when an error is made from the (4) material, and thus notifies the transmitter of the detection error. The transmitter can retransmit 200926671 when receiving the Μ· signal. The HARQ-type receiver basically attempts to perform error correction of the received data' and uses an error detection code to determine whether the weight should be performed. pass. The error debt test code may be a cyclic redundancy check (CRC). When an error is detected from the received data via a CRC detection procedure, the receiver transmits the NACKi message to the transmitter. . When the NACK signal is received, the transmitter will transmit-properly retransmit the data according to the HARQ mode (i.e., a chase merge mode or an incremental redundancy (IR) mode). According to the redundancy version (rv) of the data block feature that is not retransmitted, the HARQ mode can be classified into a chase merge mode and a buddy mode. In the chase merge mode, in order to obtain -, ^ 仏唬 to the noise ratio (SNR), the error data port will be detected and the data will be retransmitted instead of throwing the wrong data. In the IH mode, additional and redundant information is incrementally transmitted along with the retransmitted data to obtain a coding gain and reduce the use of the circular buffer capture rate in the m mode due to the retransmission operation. The rv typically represents the transmission start position of the data block transmitted or retransmitted by the self-loop buffer. That is, a # & 』 means that a certain number of transmission start positions must be defined in the circular buffer.

X 而其中該特定數量是等於RV 的數量。當頻道條件不良眸g卩士、^ 民時即有必要進行重傳。所不欲者 係,每當進行資料重傳時,仍谋 仍運用在第一傳輸中所使用的 200926671 編碼速率、調變法則及資源配置而無 、又管。廷是因為並無 法將當重傳資料時而改變的頻道條件適當地納入考量。因 此,若該編瑪速率或調變法則在時間上有所變化則會需 要-種傳送資料的方法,從而能夠藉由調適性地選定該資 料的傳輸起點位置以提高一錯誤校正速率。 【發明内容】 本發明提供一種藉由有效地選定一冗餘版本利用混 合式自動重覆請求(HARQ)以提高錯誤校正料的資料傳 輸方法。. 本發明亦提供-種根據在—同步HARQ中之傳輸編 號利用一預定冗餘版本以進行資料傳送的方法。 益術解決方竿 根據本發明之一具體實施例,本文說明一種將資料自 一使用者終端傳送至一基地台的方法。此方法是利用一種 藉該資料之複數個冗餘版本的混合式自動重覆請求(HARQ) 法則’該等几餘版本(Rv)各者是表示在—循環缓衝器内一 資料區塊的傳輸起點位置。該方法包含在該使用者終端中 進行下W步驟’即藉—第—5C餘版本利用該HARQ法則以 執行該資料的第―傳輸;藉各種冗餘版本利用該HARQ法 200926671 則以執行該資料的至少一重傳;以及對於各次重傳,藉由 考量先前所用之冗餘版本及-預定序列以決定所使用的冗 餘版本。在-序列裡,至少兩個彼此依循的冗餘版本擁有 非連續的起點位置。 雋 * 在一具體實施例裡,該序列係經循環地運用於執行重 k 覆重傳作業。 有利地該等複數個冗餘版本包含四個冗餘版本,而 在該循環緩衝器中個別地具有四個不同起點位置。 在-具體實施例裡,該序列係,考量到其起點位置, 由按下列次序而設定之冗餘版本所構成:第一、第三、第 四及第二冗餘版本。 或另者’具第一起點位置的冗餘版本僅運用於第一傳 輸而重傳則疋,考量到其起點位置利用一由按下列次 • “設定之冗餘版本所構成的序列來執行:第三第四及 第二冗餘版本。 . 4 —具體實施例裡,-冗餘版本係特定地用於該第一 傳輪。 有利地~有該等冗餘版本皆擁有相同大小,並且在 該循環緩衝器中具備經等距分隔的起點位置。 在另一具體實施例禮,該方法更包含,在該使用者終 進行下列步驟.自該基地台接收排程資訊;根據該排 之起點位置的起 ❹ Ο 200926671 程資sft選定一冗餘游士 ·计 錢版本,藉-敎冗餘版本 以及藉由考量該逡中wm 餘版本執行進+ 該敎㈣㈣用多個冗 餘版本執仃進一步的資料重傳。 有利地’該排程資訊包含—所選定冗餘版本的指示器。 、或另者,該排程資訊包含一目前通訊情況的指示器, 並且選定—具—緊鄰該所傳最後冗餘版本 點位置之冗餘版本。 ,. ·. 又在另一具體實施例裡,該排程資訊包含一新資料指 示器卿),並且該使用者終端在#收到時即執行一第一傳 輸。 —- 本發明亦為有關於一相對應使用者終端、一基地台及 一通訊系統。 有利效果 可^兩混合式自動重覆請求(HARQ)的效率性,即使是 並未提供排程資訊亦然。可儘可能快速地傳送一循環緩衝 器的資料’因此可改善資料傳送產通量。此外,可增加利 用一同步HARQ之上鏈傳輸的效率性》 【實施方式】 第1圖顯示一無線通訊系統。該無線通訊系統可為廣 200926671 泛地佈署以提供各種通訊服務,像是語音、封包資料等等。 現參照第1圖’該無線通訊系統包含一基地台(BS)20 以及至少一使用者設備(UE) 10。該UE 1〇可為固定式或行 動式,並且可按如另一術語所稱謂,像是一行動台(Mg)、 一使用者終端(UT)、一用戶台(SS)、一無線裝置等等。談 • BS 20 一般說來係一固定站台,其與該UE 1〇相通訊,並 且可按如另一術語所稱謂,像是一 Node-B、一基地收發器 β 系統(BTS)、一接取點等等。在該BS 20的覆蓋範圍之内可 有一或更多的細胞。 下鏈是表示一自該BS 20至該UE 10的通訊鏈結,而 上鏈則是表示一自該UE 10至該BS 20的通訊鏈結。在下 鏈裡’一傳送器可為該BS 20的一部份,並且一接收器可 為該UE 10的一部份。而在上鏈裡,該傳送器可為該υΕ1〇 的一部份’並且該接收器可為該BS 20的一部份。 ❹ 可利用不同的多重接取法則以進行下鏈及上鏈傳輸。 例如,可利用正交劃頻多重接取(OFDM)以進行下鏈傳輸, 並可利用單一載波-劃頻多重接取(SC-FDMA)以進行上鏈 傳輪。 在該無線通訊系統中所運用的多重接取法則方面並無 限制。該等多重接取法則可為基於劃碼多重接取(CDma)、 劃時多重接取(TDMA)、劃頻多重接取(FDMA)、單一載波 200926671 -FDMA(SC-FDMA)、正交劃頻多重接取(〇fdMA)或是其他 的眾知調變法則。在這些調變法則裡,接收自多個使用者 的號係經解調變以提局該通訊系統的容量。而為簡便之 目的’後文中將說明該OFDMA式無線通訊系統。 該OFDMA法則是利用複數個正交子載波。此外,該 OFDM法則是利用反快速傅黎葉轉換(IFFT)與快速傅黎葉 ❹X and where the specific number is equal to the number of RVs. When the channel conditions are not good, it is necessary to retransmit. Unwanted, every time data retransmission is performed, the 200926671 encoding rate, modulation law, and resource configuration used in the first transmission are still used. The court is unable to properly consider the channel conditions that were changed when the information was retransmitted. Therefore, if the marshalling rate or modulation law changes in time, a method of transmitting data is required, so that an error correction rate can be improved by adaptively selecting the transmission starting position of the data. SUMMARY OF THE INVENTION The present invention provides a data transmission method for improving error correction materials by efficiently selecting a redundancy version using a hybrid automatic repeat request (HARQ). The present invention also provides a method for utilizing a predetermined redundancy version for data transfer based on a transmission number in a synchronous HARQ. The present invention describes a method of transmitting data from a user terminal to a base station in accordance with an embodiment of the present invention. The method utilizes a hybrid automatic repeat request (HARQ) rule of a plurality of redundant versions of the data. 'These versions (Rv) are each represented by a data block in the -circulation buffer. Transfer start position. The method includes performing, in the user terminal, performing the following steps: “borrowing—the 5th C version uses the HARQ rule to perform the first transmission of the data; and using the redundancy version to utilize the HARQ method 200926671 to execute the data. At least one retransmission; and for each retransmission, the redundancy version used is determined by considering the redundancy version and the predetermined sequence used previously. In the -sequence, at least two redundant versions that follow each other have a non-contiguous starting position.隽 * In one embodiment, the sequence is cyclically applied to perform a heavy k retransmission operation. Advantageously, the plurality of redundancy versions comprise four redundancy versions, and in the circular buffer individually there are four different starting positions. In a particular embodiment, the sequence, taking into account its starting position, consists of a redundancy version set in the following order: first, third, fourth and second redundancy versions. Or the other version of the redundancy version with the first starting position is only used for the first transmission and retransmitted, considering the starting point position with a sequence consisting of the following: • The set redundancy version: Third and second redundancy versions. 4 - In a specific embodiment, a redundancy version is specifically used for the first transmission wheel. Advantageously, there are such redundancy versions all having the same size and The circular buffer has an equidistantly separated starting position. In another embodiment, the method further comprises: performing, in the user, performing the following steps: receiving schedule information from the base station; according to the starting point of the row The starting position of the position Ο 200926671 Cheng sft selected a redundant version of the voyage · money version, borrowed - 敎 redundancy version and by considering the w w w 余 余 执行 执行 执行 敎 敎 敎 敎 敎 敎 敎 敎 敎 敎 敎 敎 敎 敎 敎 敎 敎 敎 敎 四 四 四 四 四 四 四 四 四 四Further data retransmission. Advantageously - the schedule information includes - an indicator of the selected redundancy version, or alternatively, the schedule information includes an indicator of the current communication condition, and is selected - immediately adjacent to the office Pass the last redundancy A redundancy version of the location of the point. In another embodiment, the schedule information includes a new data indicator, and the user terminal performs a first transmission when it is received. The invention is also related to a corresponding user terminal, a base station and a communication system. Advantageous effects can be achieved by the efficiency of two hybrid automatic repeat request (HARQ), even if schedule information is not provided. Also, the data of a circular buffer can be transmitted as quickly as possible 'thus, the data transmission throughput can be improved. In addition, the efficiency of using a synchronous HARQ uplink transmission can be increased. [Embodiment] FIG. 1 shows a Wireless communication system. The wireless communication system can be widely deployed for the wide 200926671 to provide various communication services, such as voice, packet data, etc. Referring now to Figure 1 'the wireless communication system includes a base station (BS) 20 and At least one user equipment (UE) 10. The UE 1 may be fixed or mobile, and may be referred to as another term, such as a mobile station (Mg), a user terminal (UT), and a User station SS), a wireless device, etc. Talks BS 20 is generally a fixed station that communicates with the UE 1 and can be referred to as another term, such as a Node-B, a base transceiver a beta system (BTS), an access point, etc. There may be one or more cells within the coverage of the BS 20. The lower chain represents a communication link from the BS 20 to the UE 10, and The uplink is a communication link from the UE 10 to the BS 20. In the lower chain, a transmitter can be part of the BS 20, and a receiver can be part of the UE 10. In the upper chain, the transmitter can be part of the '1〇 and the receiver can be part of the BS 20.不同 Different multiple access rules can be used for downlink and uplink transmission. For example, Quadrature Frequency Division Multiple Access (OFDM) may be utilized for downlink transmission, and single carrier-frequency multiple access (SC-FDMA) may be utilized for uplink transmission. There are no restrictions on the multiple access rules used in this wireless communication system. The multiple access rules may be based on coded multiple access (CDma), timed multiple access (TDMA), frequency multiply access (FDMA), single carrier 200926671 -FDMA (SC-FDMA), orthogonal Frequency multiple access (〇fdMA) or other well-known modulation laws. In these modulation laws, the number received from multiple users is demodulated to refer to the capacity of the communication system. For the sake of simplicity, the OFDMA type wireless communication system will be described later. The OFDMA law utilizes a plurality of orthogonal subcarriers. In addition, the OFDM algorithm utilizes inverse fast Fourier transform (IFFT) and fast Fourier transforms.

轉換(FFT)之間的正交性。傳送器藉由執行IFFT以傳送資 料。接收器藉由對一所收信號執行FFT以復原原始資料。 傳送器是利用IFFT以合併複數個子載波,並且接收器是利 用FFT以分割複數個子載波。根據該〇fdm法則可在一 寬帶頻道之頻率選擇性衰退環境中降低該接收器的複雜 度,同時可藉由運用$-子載波而異之頻道特徵,透過在 頻域中的選擇性排程處理以改善頻譜效率性…OF。· 法則係一0聰式多重接取法則。根據該OFDMA法則, 可藉由將不同子餘配置Η個使用者以更有效率地使用 一無線電資源。 罘2圖係一區塊圖,其中 一 一 不—頻道編碼程序。在 -其中-數碼區塊是在經頻道編碼、交錯及速率.匹配肩 複數個資料串流之格式所傳送的情況。該㈣ ' 具有特定大小之杳姐Orthogonality between conversions (FFTs). The transmitter transmits the data by performing an IFFT. The receiver recovers the original data by performing an FFT on a received signal. The transmitter uses IFFT to combine a plurality of subcarriers, and the receiver uses the FFT to partition a plurality of subcarriers. According to the 〇fdm rule, the complexity of the receiver can be reduced in a frequency selective fading environment of a wideband channel, and the channel characteristics can be different by using the $-subcarrier, and the selective scheduling in the frequency domain can be transmitted. Processing to improve spectral efficiency...OF. · The law is a 0-cognitive multiple access rule. According to the OFDMA law, a radio resource can be used more efficiently by configuring different sub-compartments for each user. The 罘2 diagram is a block diagram, one of which is not a channel coding procedure. The -in-digital block is transmitted in the format of channel encoding, interleaving, and rate matching. The (four) 'sister with a certain size

私乂 料£塊以供進行頻道編碼處理C 數個數碼區塊可具有相 』大〗、’或者可具有不同大小 12 200926671 參照第2圖,其中一頻道編碼器110對一輸入數碼區 塊執行頻道編碼。該頻道編碼器110可利用一满輪碼。該 渦輪碼含有一遞迴系統性迴旋轉編碼器及一交錯器。該渦 輪碼自該輸入數碼區塊而按位元方式產生多個系統性位元 ' 及對位(parity)位元。在此可假設藉由利用一 1/3數碍速率 • 而產生出一個系統性區塊S及兩個對位區塊P1及P2。該 系統性區塊為一系統性位元集合。該對位區塊為一對位位 ❹ 元集合。 一交錯器120對該經頻道編碼之數碼區塊執行交錯處 理’藉此降低一突波錯誤的影響。該交錯器120可對該等 系統性區塊S及該等兩個對位區塊pi及P2執行交錯處理。 一速率匹配單元130匹配該經頻道編碼之數碼區塊以The private data block is for channel coding processing. C. The digital blocks may have a large size, or may have different sizes. 12 200926671 Referring to FIG. 2, one channel encoder 110 performs an input digital block. Channel code. The channel encoder 110 can utilize a full wheel code. The turbo code includes a recursive systemic rotary encoder and an interleaver. The turbo code generates a plurality of systematic bits 'and parity bits in a bitwise manner from the input digital block. Here, it can be assumed that a systematic block S and two alignment blocks P1 and P2 are generated by utilizing a 1/3 number of collision rates. The systematic block is a systemic set of bits. The alignment block is a set of a pair of bit units. An interleaver 120 performs interleaving processing on the channel encoded digital blocks' thereby reducing the effects of a glitch error. The interleaver 120 can perform interleaving processing on the systematic blocks S and the two alignment blocks pi and P2. A rate matching unit 130 matches the channel coded digital block to

利適配於一無線電資源的大小。可按一經頻道編碼之數碼 區塊為單位以進行該速率匹配處理。或另者,可藉由劃分 這兩個對位區塊P1及P2的方式來執行該速率匹配處理。 第3圖顯示一在一循環緩衝器中,於一利用速率匹配 處理之系統中根據一冗餘版本(RV)的傳輸起點位置。在此 將假設一渦輪碼之編碼速率為1/3,並且一用於資料傳輸作 業的排程個體存在於一接收器内β亦即,當該接收器將一 資料傳送格式及資源指示器(TFRI)傳送至—傳送器時其 中該資源指示器為-用以指示資源和待由該傳送器所傳送 13 200926671 之資料的傳送格式夕4t _ 払不器’該傳送器即根據該TFRI進杆 資料傳送。後文中 T疋將冗餘版本略稱為一 RV。 參照於第3圖, „ 圃一循環緩衝器在水平方向上含有36 邏輯資料區塊。在直曾Adapted to the size of a radio resource. This rate matching process can be performed in units of channel-coded digital blocks. Alternatively, the rate matching process can be performed by dividing the two alignment blocks P1 and P2. Figure 3 shows the transmission start position according to a redundancy version (RV) in a system using rate matching processing in a circular buffer. Here, it will be assumed that the coding rate of a turbo code is 1/3, and a schedule individual for data transmission operations exists in a receiver β, that is, when the receiver will transmit a data transmission format and resource indicator ( TFRI) is transmitted to the transmitter where the resource indicator is - indicating the resource and the transmission format of the data to be transmitted by the transmitter 13 200926671 夕 4t _ 払 该 该 该 该 该 该 该 该 该 该 该Data transfer. In the following text, T疋 will refer to the redundancy version as an RV. Referring to Figure 3, „ 圃 a circular buffer contains 36 logical data blocks in the horizontal direction.

、等之中,該等邏輯資料區塊的1/3部 份(亦即12個資料F ^塊)為系統性區塊,而該等邏輯資料區 塊的後續2/3部份Ρη〜* 物(亦即24個資料區塊)則為對位區塊。在 此有四個RV,亦目卩dp ❹ P RV0至RV3。可藉由將一總循環緩衝 器大]除以該等RV之數量以獲得該等RV間的間距。當利 自#f覆凊求(HARQ)之資料傳輸失敗時,即決定 該RV。一貝料區塊的傳輸或重傳起點位置是根據該RV而 改變。 該等RV0至rV3為指示不同傳輸或重傳起點位置的冗 餘版本。在第0冗餘版本(底下稱為RV0)的情況下,是自 該循環緩衝器之内第2資料區塊開始進行傳輸。在第!冗 餘版本(底下稱為1〇^丨)的情況下,是自該循環緩衝器之内 第11資料區塊開始進行傳輸。在第2冗餘版本(底下稱為 RV2)的情況下’是自該循環緩衝器之内第2〇資料區塊開始 進行傳輸。而在第3冗餘版本(底下稱為RV3)的情況下, 是自該循環緩衝器之内第29資料區塊開始進行傳輸。 在此既已假設該渦輪碼的編碼速率為1/3,並且rv的 數量為4。然而’該等僅為示範性目的,且因而在本發明 200926671 中可運用不同的編碼速率、不同的RV數量以及不同的Rv 起點位置。 對於第一傳輸的排程資訊(即如一排程准允)則必須加 以傳送。對於重傳的排程資訊則為選擇性傳送。即以其中 並無對於重傳之排程資訊的情況而言,是需由該使用者終 端獨立地定義一待用於傳輸作業的RV。And 1/3 of the logical data blocks (that is, 12 data F ^ blocks) are systematic blocks, and the subsequent 2/3 parts of the logical data blocks are 〜η~* The object (that is, 24 data blocks) is the alignment block. There are four RVs here, as well as dp ❹ P RV0 to RV3. The spacing between the RVs can be obtained by dividing a total circulator buffer by the number of the RVs. The RV is determined when the data transmission from the #fQ request (HARQ) fails. The transmission or retransmission starting position of a block of material changes according to the RV. These RV0 to rV3 are redundant versions indicating the locations of different transmission or retransmission starting points. In the case of the 0th redundancy version (hereinafter referred to as RV0), the transmission is started from the second data block in the circular buffer. In the first! In the case of the redundant version (hereinafter referred to as 1〇^丨), the transmission starts from the 11th data block in the circular buffer. In the case of the second redundancy version (hereinafter referred to as RV2), the transmission is started from the second data block in the circular buffer. In the case of the third redundancy version (hereinafter referred to as RV3), the transmission starts from the 29th data block in the circular buffer. Here, it has been assumed that the turbo code has a coding rate of 1/3 and the number of rvs is four. However, these are for exemplary purposes only, and thus different encoding rates, different numbers of RVs, and different Rv starting positions may be utilized in the present invention 200926671. For the schedule information of the first transmission (that is, as scheduled), it must be transmitted. For retransmission schedule information, it is selective transmission. That is, in the case where there is no schedule information for retransmission, it is necessary for the user terminal to independently define an RV to be used for the transmission job.

❹ 後文中將說明一種在一 HARQ程序中藉由調適地選定 一 RV以進行資料重傳的方法。 例如’可藉由在-循環緩衝器中決待用於第一傳 輸及資料重傳的固定Rv,而Ml料料,以利用該 HARQ來傳送資料。即如第3圖所示,可將整 衝 器劃分為一闳中叙θ从玫 策術 董、資料區塊,藉以決定Rv的固定傳 輸起點位置。在此情況下 虽絰決定以儘可能快速地傳送 該循環緩衝35 &咨冰立 衡15的資料時,可改善產通量。 若第3圖之循環緩衝器的油 ,,.^ 盗的總大小為4,則根據該編碼 速率由該循環緩衝器所佔 佩的局部可如底下表1所示。 [表1]❹ A method of adaptively selecting an RV for data retransmission in a HARQ program will be described later. For example, the fixed Rv for the first transmission and the data retransmission can be determined in the -cyclic buffer, and the M1 material is used to transmit the data using the HARQ. That is, as shown in Fig. 3, the squeezing device can be divided into a 闳 θ θ from the meditation master and the data block, thereby determining the fixed transmission starting position of the Rv. In this case, although it is decided to transmit the data of the circulation buffer 35 & ice balance 15, as quickly as possible, the throughput can be improved. If the total size of the oil of the circular buffer of Fig. 3 is 4, the portion occupied by the circular buffer according to the encoding rate can be as shown in Table 1 below. [Table 1]

15 20092667115 200926671

表H可選定—組待用时縛輸中㈣定rv,即如 用於第傳1與編碼速率無關。在此將假設rvg為一總是 用於第一傳輪的RV。 I:表 2] ~—---- Τχ編號 ----— ' —--- 第—Rv組合 ^L, 2 __ 4 ---- 第一 Rv組合 LRv〇_ RV2 RV1 RV3 ~~~~~~-- RV2 RV3 RV1 根據表2, 係經選定為該第 會有4次傳輸。在該第一 rv組合裡,RV0 一 Tx編號’ RV2經選定為該第二Τχ編號 16 200926671 等等。第三及第四Τχ編號裡的選定RV則為個別地於該第 一與該第二RV組合之間相異。 而自一第5傳輸Τχ編號開始,可重覆表2的一 RV集 合,或者可藉由定義一新的固定RV組合以傳送資料。在 ' 此情況下,即使是傳送對於重傳的排程資訊且該編碼速率 ’ 因而有所改變,亦仍根據先前的固定RV集合以傳送資料。 底下表5顯示當進行五次以上傳輸時的RV組合(亦即第三 e 至第六RV組合)。 [表3] Τχ編號 1 2 3 4 5 6 7 第三RV組合 RV0 RV2 RV1 RV3 RV0 RV2 RV1 第四RV組合 RV0 RV2 RV1 RV3 RV2 RV1 RV3 第五RV組合 RV0 RV2 RV3 RV1 RV0 RV2 RV3 第六RV組合 RV0 RV2 RV3 RV1 RV2 RV3 RV1 現參照表3,在一第三RV組合裡,上述表1的第一通 孔組合被重覆兩次。在一第四RV組合裡,上述表1的第 一 RV組合重覆兩次,然在第二重覆中排除掉具有系統性 位元的RVO。在一第五RV組合裡,上述表2的第二RV組 合重覆兩次。在一第六RV組合裡,上述表1的第二RV組 17 200926671 合重覆兩次,然在第二重覆中排除掉具有系統性位元的 RV0 〇 據此,當經決定以儘可能快速地傳送該循環緩衝器的 資料時,可改善產通量。前述固定RV組合僅為示範性目 ' 的。因此,可根據Tx編號改變該RV組合。 即如另一範例’可根據一編碼速率以預定一 RV組合, 並且之後在當傳送用於重傳的排程資訊時,可考量到經改 ❹ 變之編碼速率而藉由選定一 RV以傳送利用該HARQ的資 料。 假設該RV集合係根據一初始編碼速率(CR)尚決定, 即如表4所示。 [表4] 編碼速率 基於Tx編號的RV組合 2/3<CRO<l RV0->RV1->RV2->RV3 4/9<CRl<2/3 RV0->RV2->RV1->RV3 l/3<CR2<4/9 RV0->RV3->RV2->RV1 參照表4,根據一先前RV以決定一次一 RV。例如, 若該先前RV為RV2,則當藉一 RV0的編碼速率傳送資料 時,該次一 RV即為RV3。表5顯示一種其中當根據該編 18 200926671 碼速率以決定一 RV組合時,即如上述表4所示,在傳送 供以重傳之排程資訊時編碼速率改變的情況下而選擇RV 之方法。 [表5] Τχ編號 1 2 3 4 編碼速率 CR0 CR1 CR1 CR2 RV RV0 RV1 RV3 RV0Table H can be selected—the group is inactive when it is used. (4) The rv is used, that is, the first transmission is independent of the coding rate. It will be assumed here that rvg is an RV that is always used for the first pass. I: Table 2] ~—---- ΤχNumber----- '---- The first-Rv combination ^L, 2 __ 4 ---- The first Rv combination LRv〇_ RV2 RV1 RV3 ~~~ ~~~-- RV2 RV3 RV1 According to Table 2, it is selected that there will be 4 transmissions. In the first rv combination, RV0 - Tx number ' RV2 is selected as the second number 16 200926671 and so on. The selected RVs in the third and fourth numbers are individually different between the first and second RV combinations. Starting from a 5th transmission number, an RV set of Table 2 may be repeated, or a new fixed RV combination may be defined to transmit data. In this case, even if the schedule information for retransmission is transmitted and the encoding rate is changed, the data is still transmitted according to the previous fixed RV set. The bottom table 5 below shows the RV combination (i.e., the third e to sixth RV combination) when five or more transmissions are performed. [Table 3] Τχ No. 1 2 3 4 5 6 7 Third RV combination RV0 RV2 RV1 RV3 RV0 RV2 RV1 Fourth RV combination RV0 RV2 RV1 RV3 RV2 RV1 RV3 Fifth RV combination RV0 RV2 RV3 RV1 RV0 RV2 RV3 Sixth RV combination RV0 RV2 RV3 RV1 RV2 RV3 RV1 Referring now to Table 3, in a third RV combination, the first via combination of Table 1 above is repeated twice. In a fourth RV combination, the first RV combination of Table 1 above is repeated twice, while the RVO with systematic bits is excluded from the second overlap. In a fifth RV combination, the second RV combination of Table 2 above is repeated twice. In a sixth RV combination, the second RV group 17 200926671 of Table 1 above is repeated twice, but the RV0 with systematic bits is excluded in the second overlap, according to which, when determined as possible When the data of the circular buffer is quickly transmitted, the throughput can be improved. The aforementioned fixed RV combination is for exemplary purposes only. Therefore, the RV combination can be changed according to the Tx number. That is, as another example, a predetermined RV combination may be combined according to a coding rate, and then when the schedule information for retransmission is transmitted, the modified coding rate may be considered to be transmitted by selecting an RV. Use the HARQ data. It is assumed that the RV set is determined based on an initial coding rate (CR), as shown in Table 4. [Table 4] The encoding rate is based on the Tx numbered RV combination 2/3 <CRO<l RV0->RV1->RV2->RV3 4/9<CRl<2/3 RV0->RV2->RV1 ->RV3 l/3<CR2<4/9 RV0->RV3->RV2-> RV1 Referring to Table 4, one RV is determined based on a previous RV. For example, if the previous RV is RV2, then when the data is transmitted by the encoding rate of RV0, the next RV is RV3. Table 5 shows a method in which RV is selected when the RV combination is determined according to the code rate of 200926671, that is, as shown in Table 4 above, when the coding rate is changed when the schedule information for retransmission is transmitted. . [Table 5] Τχ No. 1 2 3 4 Coding rate CR0 CR1 CR1 CR2 RV RV0 RV1 RV3 RV0

現參照表5,第一 Tx編號;具有一編4速率CR0,且因 而該第一傳輸係根據上述表4而決定為RV0。由於該編碼 速率在第二Τχ編號處改變為CR1,因此次一 RV被決定為 RV1。此係為在一該編碼速率改變之時點處,藉由選擇一 緊鄰該最後RV的RV而根據所改變之編碼速率來調控一資 料量值。 該編碼速率在一第三ΤΧ編號處係維持於CR1。因此, 可根據基於CR1之RV組合以決定一 RV序列。由於該先 前RV為RV1,因此根據上述表4決定該次一 RV為RV3。 該編碼速率在一最後第四Τχ編號處改變成CR2。因而會再 度地選定RV0,其為次於RV3的RV。據此,可根據一先 前RV及一編碼速率,藉由調適地選定一 RV以改善傳輸效 19 200926671 率性。 編碼速率的變化僅為一其中該方法包含選定一緊鄰該 先前所傳RV之RV而與目前所用RV組合無關的通訊狀況 範例。其他像是一調變變化等等的預定通訊狀況亦可引發 此具體實施例。 在上鏈傳輸的情況下’可利用一同步HARQ以減少訊 令開支《在此情況下,可藉由利用一預定RV以減少訊令 ® 開支。此外’可改善HARQ的產通量β 現將說明報告一選定RV的訊令方法。 在一同步HAR(J裡,一在此該等傳送/接收末端進行資 料傳送的時間點為已知。因而,若於該等傳送/接收末端之 間明確地決定一 RV序列,則對於Rv的訊令即無必要。藉Referring now to Table 5, the first Tx number; has a 4 rate CR0, and thus the first transmission is determined to be RV0 according to Table 4 above. Since the coding rate is changed to CR1 at the second frame number, the next RV is determined to be RV1. This is to adjust a data amount according to the changed coding rate by selecting an RV immediately adjacent to the last RV at a point in time at which the coding rate is changed. The coding rate is maintained at CR1 at a third number. Therefore, an RV sequence can be determined based on the RV combination based on CR1. Since the previous RV is RV1, the next RV is determined to be RV3 according to Table 4 above. The encoding rate is changed to CR2 at the last fourth Τχ number. Therefore, RV0 is again selected, which is the RV next to RV3. Accordingly, an RV can be selected adaptively according to a prior RV and a coding rate to improve the transmission efficiency. The change in coding rate is only one example of a communication situation in which the method includes selecting an RV that is immediately adjacent to the previously transmitted RV and is independent of the RV combination currently used. Other predetermined communication conditions, such as a modulation change, etc., may also trigger this particular embodiment. In the case of uplink transmission, a synchronous HARQ can be utilized to reduce the modem expenditure. In this case, the command + expenditure can be reduced by utilizing a predetermined RV. In addition, the improved throughput of HARQ, β, will now describe the reporting method for a selected RV. In a synchronous HAR (J, the point in time at which the data transmission is performed at the transmission/reception end is known. Therefore, if an RV sequence is explicitly determined between the transmission/reception ends, then for Rv The order is unnecessary.

由考量此點’ gp需要一種藉由利用先前控制資訊而無額外 訊令以報告一 RV的方法。 例如’可利用一新資料指示器(NDI)以報告一 RVe當 ,送資料區塊時,$咖為報告―目前所傳送之資料區塊 是否為-新資料區塊所必要的訊令。在此方法中,該RV 係利用該麵所内隱地報告,而非顯明地報告該rv。因 此,可減少因額外RV訊令所造成的開支。 表6顯示一當利用表 NDI以選定一 RV的方法。 3之第三RV組合時根據〗位元 在此,若該NDI為】,則這表示 20 200926671 則這表示重傳。當然, 新的資料傳輪;然若該NDI為〇 亦可按其他方式進行。 [表6] ---- _ Tx編號 1 2 3 4 5 6 7 第三RV組合 NDI 1 0 0 0 0 0 0 • · · RV RV0 RV2 RV1 RV3 RV0 RV2 RV1 • · · 現參照表6 ’在一第一 Τχ編號處該NDI為1,而這表 示為新資料。由於此為第一傳輸’因而是利用RV0以傳送 資料。之後’該NDI連續地表示0’這意味著重傳。因此, 對於該第二Τχ編號的次一 RV係藉由一先前rv (RV0),即 如在該第三RV組合中,而經決定為RV2。 即如另一範例’可利用一重傳序列編號(RSN)以報告_ RV °在該同步HArq的情況下’該等傳送/接收末端傳送 資料區塊的時間點為已知。因此,可利用該RSN而非該 NDI來報告該RV ^在此情況下’該RSN之一特定數值係 經定義為表示第一傳輸。若該RSN為1位元資訊,則該 RSN可為〇或1’其中「〇」表示第一傳輸而「1」則表示 重傳。 若該RSN為一 2位元資訊,則「0」表示第一傳輸, 21 200926671 並且可根據一按「0->l->2->3」之序列的RSN以進行傳輸。 在第四傳輸之後,該RSN可連續地維持在「3」。此一訊令 方法係運用於該第三代夥伴計晝(3 GPP)的高速上鏈封包接 取(HSUPA)中。該RSN係自一傳送器傳送至一接收器。 ' 表7顯示一當利用上述表3之第四及第五RV組合時 - 根據一 1位元RSN以選定一 RV的方法。 © [表 7] Τχ編號 1 2 3 4 5 6 7 第四RV組合 RSN 0 1 1 1 1 1 1 RV RV0 RV2 RV1 RV3 RV2 RV1 RV3 第五RV組合 RSN 0 1 1 1 1 1 1 RV RV0 RV2 RV1 RV3 RV0 RV2 RV1 現參照表7,該RSN在第一 Tx編號處為0,而這表示 第一傳輸。該RSN在第二至第七Τχ編號處則完全為1,而 這表示重傳。在此情況下,可根據上述表3的第四及第五 RV組合以決定該RV。 即如前述,並非總是傳送該RSN,而僅在當排程資訊 存在時方予傳送。因此,即使是在傳輸過程中間並未傳送 該RSN,該接收器考量到此情況亦仍必須利用該RSN。 22 200926671 表8顯示一當利用上述表3之第三及第四RV組合時 根據一 2位元RSN以選定一 RV的方法。 [表8] Tx編號 1 2 3 4 5 6 7 • · · 第三R V組合 RSN 0 1 2 3 3 3 3 • · * RV RV0 RV2 RV1 RV3 RV0 RV2 RV1 • « · 第四RV組合 RSN 0 1 2 3 1 2 3 RV RV0 RV2 RV1 RV3 RV2 RV1 RV3 • · ❹ 現參照表8,當利用一第三RV組合時’若該rSN為3, 則實際傳送的RV可根據一 Tx編號而有所改變。這必須在 該傳送器與該接收器之間事先協商同意。例如,可利用一 目前所傳之子訊框編號。當利用一第四RV、組合時,該RSN 及所傳RV具有一 1: i匹配關係。因此,可自經納入在用 於重傳之排程資訊内的RSN以獲悉該Rv。亦即,當該rsn 為按一 2位元所表示時,該RSN是按 3、3…或〇、丨、2、3、卜2、3…之形式所傳送並且指 配一對應於各RSN的RV。 *過,會有-其中並未傳送用於重傳之排程資訊的情 況。因此’當並無RSN時,可根據一運用在緊隨先1傳輸 23 200926671 之RV選定一待用於重傳的RV並按不同方式加以運用。表 9顯示一在其中,當利用上述表3之第三及第四RV組合 時,由於並未傳送用於重傳之排程資訊而無RSN的情況下 選定一 RV之方法。 [表9] 第三RV組合 第四RV組合 第 i-1 RV 第i RV 第 i-1 RV 第i RV RV0 RV2 RVO(僅第一傳輸) RV2(僅第一傳輸) RV1 RV3 RV1 RV3 RV2 RV1 RV2 RV1 RV3 RVO RV3 RV2 現參照表9,在一第三RV組合裡,於一其中第(i-1) RV 為RV0以及由於並未在第iTx編號處傳送用以重傳之排程 資訊而無RSN的情況下,一第iRV係藉由考量一先前RV0 且根據一第三RV組合之序列而經選定為RV2,其係一次 於該RV0的RV。此外,在一第四RV組合裡,於一其中第 (i-1) RV為RV3以及由於並未在第iTx編號處傳送用以重 傳之排程資訊而無RSN的情況下,一第i RV係藉由考量 一先前RV3且根據一第四RV組合之序列而經選定為 24 200926671 RV2 ’其係一次於該RV3的RV。 接著說明一顯明地報告一 RV的訊令方法。底下表1〇 顯示根據上述表3之第四rv組合以顯明地報告該rv的訊 令方法。 [表 10] Τχ編键 ί 1 2 3 4 5 6 7 第四 RV組合 RV 數值 0 2 1 3 2 1 3 RV RVO RV2 RV1 RV3 RV2 RV1 RV3Taking this into consideration, gp requires a way to report an RV by using previous control information without additional commands. For example, 'a new data indicator (NDI) can be used to report a RVe. When sending a data block, $coffee is the report - whether the data block currently transmitted is the necessary information for the new data block. In this method, the RV uses the face to report implicitly, rather than explicitly reporting the rv. As a result, expenses incurred by additional RV orders can be reduced. Table 6 shows a method of using the table NDI to select an RV. The third RV of 3 is combined according to the bit. Here, if the NDI is 】, this means 20 200926671 and this means retransmission. Of course, the new data transmission wheel; if the NDI is 〇, it can be carried out in other ways. [Table 6] ---- _ Tx No. 1 2 3 4 5 6 7 Third RV combination NDI 1 0 0 0 0 0 0 • · · RV RV0 RV2 RV1 RV3 RV0 RV2 RV1 • · · Refer to Table 6 ' At the first Τχ number, the NDI is 1, and this is represented as new material. Since this is the first transmission', RV0 is utilized to transmit the data. Then 'the NDI continuously indicates 0' which means retransmission. Therefore, the next RV for the second frame number is determined to be RV2 by a previous rv (RV0), as in the third RV combination. That is, as another example, a retransmission sequence number (RSN) can be utilized to report _ RV ° in the case of the synchronization HARq. The time point at which the transmission/reception end transmits the data block is known. Thus, the RSN can be utilized instead of the NDI to report the RV. ^ In this case, a particular value of the RSN is defined to represent the first transmission. If the RSN is 1-bit information, the RSN may be 〇 or 1' where "〇" indicates the first transmission and "1" indicates retransmission. If the RSN is a 2-bit information, "0" indicates the first transmission, 21 200926671 and may be transmitted according to an RSN of a sequence of "0->l->2->3". After the fourth transmission, the RSN can be continuously maintained at "3". This method is used in the High Speed Uplink Packet Access (HSUPA) of the 3rd Generation Partnership Project (3 GPP). The RSN is transmitted from a transmitter to a receiver. 'Table 7 shows a method of selecting an RV based on a 1-bit RSN when using the fourth and fifth RV combinations of Table 3 above. © [Table 7] Τχ No. 1 2 3 4 5 6 7 Fourth RV combination RSN 0 1 1 1 1 1 1 RV RV0 RV2 RV1 RV3 RV2 RV1 RV3 Fifth RV combination RSN 0 1 1 1 1 1 1 RV RV0 RV2 RV1 RV3 RV0 RV2 RV1 Referring now to Table 7, the RSN is 0 at the first Tx number, and this represents the first transmission. The RSN is exactly 1 at the second to seventh number, and this means retransmission. In this case, the RV can be determined according to the fourth and fifth RV combinations of Table 3 above. That is, as mentioned above, the RSN is not always transmitted, but only when the schedule information exists. Therefore, even if the RSN is not transmitted in the middle of the transmission process, the receiver must still use the RSN in consideration of this situation. 22 200926671 Table 8 shows a method of selecting an RV based on a 2-bit RSN when using the third and fourth RV combinations of Table 3 above. [Table 8] Tx No. 1 2 3 4 5 6 7 • · · Third RV combination RSN 0 1 2 3 3 3 3 • · * RV RV0 RV2 RV1 RV3 RV0 RV2 RV1 • « · Fourth RV combination RSN 0 1 2 3 1 2 3 RV RV0 RV2 RV1 RV3 RV2 RV1 RV3 • · ❹ Referring to Table 8, when using a third RV combination 'If the rSN is 3, the actual transmitted RV can be changed according to a Tx number. This must be agreed in advance between the transmitter and the receiver. For example, a sub-frame number currently being transmitted can be utilized. When a fourth RV is used, the RSN and the transmitted RV have a 1: i matching relationship. Therefore, the Rv can be learned from the RSN included in the schedule information for retransmission. That is, when the rsn is represented by one 2-bit, the RSN is transmitted in the form of 3, 3... or 〇, 丨, 2, 3, Bu 2, 3, ... and the assignment corresponds to each RSN. RV. *Over, there will be - where the schedule information for retransmission is not transmitted. Therefore, when there is no RSN, an RV to be used for retransmission can be selected and used in a different manner according to an RV that is used in the first transmission 23 200926671. Table 9 shows a method in which an RV is selected in the case where the third and fourth RV combinations of the above Table 3 are used, and the schedule information for retransmission is not transmitted without the RSN. [Table 9] Third RV combination Fourth RV combination i-1th RV i-th RV i-1th RV i-th RV RV0 RV2 RVO (first transmission only) RV2 (first transmission only) RV1 RV3 RV1 RV3 RV2 RV1 RV2 RV1 RV3 RVO RV3 RV2 Referring now to Table 9, in a third RV combination, the (i-1) RV is RV0 and the schedule information for retransmission is not transmitted at the iTx number. In the absence of RSN, an iRV is selected as RV2 by considering a previous RV0 and according to a sequence of a third RV combination, once at the RV of the RV0. Further, in a fourth RV combination, in the case where the (i-1)th RV is RV3 and the schedule information for retransmission is not transmitted at the i-thx number without the RSN, an i-th The RV is selected as 24 200926671 RV2 'by the RV of the RV3 by considering a previous RV3 and according to a sequence of a fourth RV combination. Next, a method of explicitly reporting an RV command will be described. The following table 1 〇 shows the fourth rv combination according to Table 3 above to explicitly report the rv signaling method. [Table 10] Τχ 键 1 2 3 4 5 6 7 Fourth RV combination RV value 0 2 1 3 2 1 3 RV RVO RV2 RV1 RV3 RV2 RV1 RV3

上述所有功能皆可根據用以執行該等功能的軟體或程 式碼而由一處理器,像是一微處理器、一控制器一微控 參制II及-應用特定積體電路(ASIC),所執行。該程式碼可 依本發明說明為基礎而設計、開發及實作,並且此為熟諸 本項技藝之人士所眾知者。 ♦ 纟發明雖既已參照於其多項示範性具體實施例所特定 地顯示並描述,然熟諳本項技藝之人士將能瞭解確可在形 式及細節上進行各式變化,而不致恃離按如後載之申請專 利範圍所定義的本發明精神與範圍。該等示範性具體實施 例應被視為僅具說明性質,而非為限制性之目的。因此, 25 200926671 本發明之範圍並非由本發明詳細說明所定義然為依據後 載之申請專利範圍,同時在該範圍内的所有差異皆將獲設 釋為納入在本發明之内。 【圖式簡單說明】 第1圖顯示一無線通訊系統。 第2圖係一區塊圖,其中顯示一頻道編碼程序。 第3圖顯示一在一循環緩衝器中,於一利用速率匹配 處理之系統中根據一冗餘版本(RV)的傳輸起點位置。 【主要元件符號說明】 10 使用者設備(UE) 2〇 基地台(BS) 頻道編碼器 12〇交錯器 130速率匹配單元 26All of the above functions may be performed by a processor, such as a microprocessor, a controller, a microcontroller, and an application specific integrated circuit (ASIC), depending on the software or code used to perform the functions. Executed. The code may be designed, developed, and implemented based on the teachings of the present invention and is well known to those skilled in the art. 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 。 The spirit and scope of the invention as defined by the appended claims. The exemplary embodiments are to be considered in all respects as illustrative and not restrictive. Therefore, the scope of the present invention is not intended to be limited by the scope of the present invention, and all the differences within the scope of the invention are intended to be included in the invention. [Simple description of the diagram] Figure 1 shows a wireless communication system. Figure 2 is a block diagram showing a channel encoding procedure. Figure 3 shows the transmission start position according to a redundancy version (RV) in a system using rate matching processing in a circular buffer. [Main component symbol description] 10 User equipment (UE) 2〇 Base station (BS) channel encoder 12〇 interleaver 130 rate matching unit 26

Claims (1)

200926671 七、申請專利範圍: 1. 一種藉由資料之複數個冗餘版本,利用—混合式自動 重覆請求(HARQ)法則以將該資料自一使甩者終端傳送至 一基地台的方法,該等冗餘版本(11¥)之各者指示在一循環 緩衝器中一資料區塊的傳輸起點位置,該方法包含在該使 用者終端内執行如下步驟: 藉一第一冗餘版本,利用該HARQ法則執行該資料的 一第一傳輸;以及 藉各種冗餘版本’利用該HARQ法則執行該資料的至 少一重傳, 其中該方法更包含,對於各次重傳,藉由考量先前所 用之儿餘版本及一預定序列’決定所使用的該冗餘版本, 並且其中在一序列裡’至少兩個彼此跟隨的冗餘版本具有 非連續的起點位置。 2. 如申請專利範圍第1項所述之方法,其中該序列係經 循環地使用以執行重覆的重傳作業。 3. 如申請專利範圍第1項所述之方法,其中該等複數個 冗餘版本包含四個冗餘版本,而在該循環缓衝器中個別地 具有四個不同起點位置。 27200926671 VII. Scope of application for patents: 1. A method of transmitting the data from a terminal to a base station by means of a multiple redundancy version of the data using a hybrid automatic repeat request (HARQ) rule. Each of the redundancy versions (11¥) indicates a transmission start position of a data block in a circular buffer, the method comprising performing the following steps in the user terminal: utilizing a first redundancy version, utilizing The HARQ rule performs a first transmission of the data; and performs, by means of the various redundancy versions, at least one retransmission of the data using the HARQ rule, wherein the method further comprises, for each retransmission, by considering the previously used The remaining version and a predetermined sequence 'determine the redundancy version used, and wherein in a sequence 'at least two redundant versions following each other have a non-contiguous starting position. 2. The method of claim 1, wherein the sequence is used cyclically to perform repeated retransmission operations. 3. The method of claim 1, wherein the plurality of redundancy versions comprise four redundancy versions, and wherein the circular buffer has four different starting positions individually. 27 200926671 4.如申請專利範圍第3項所述 按下列次序設定之冗餘版本考量 一、第三、第四及第二冗餘版本 之方法,其中該序列係由 到其起點位置所構成:第 5·如申請專利範圍 點位置的冗餘版本僅 起點位置,利用一由 序列來執行:第三、 第3項所述之太、土 方去,其中具有第一起 用於第—傳輸;而重傳則是考量到其 %㈣Μ之冗餘版本所構成的 第四及第二冗餘版本。 6.如申請專利範圍第1項所述之方法 係特定地用於該第一傳輸。 其中一冗餘版本 .如申請專利範圍第 餘版本皆擁有相同大小 距分隔的起點位置。 1項所述之方法, 其中所有該等冗 並且在該猶環緩衝器中具備經等 更包含在該使用 8.如申請專利範圍第1項所述之方法 者終端處執行下列步驟: 自該基地台接收排程資訊; 根據該排程資訊選定一冗餘版本; 28 200926671 藉該選定冗餘版本執行一傳輸;以及 藉由考量該選定冗餘版本及該預定序列,利用多個冗 餘版本執行進一步的資料重傳β 9·如申請專利範圍第8項所述之方法其中該排程資訊 * 包含一所選定之冗餘版本的指示器。 © 1G.如中請專利ϋ圍第8項所述之方法,其中該排程資訊 包含一目前通訊情況的指示器,並且選定一冗餘版本其 具有一緊鄰該所傳最後冗餘版本之起點位置的起點位置。 11. 如申請專利範圍第8項所述之方法,其中該排程資訊 包含一新資料指示器,並且該使用者終端在收到該新資料 指示器時執行一第一傳輸。 Ο 12. —種使用者終端,其係經調適以藉資料之複數個冗餘 版本利用一混合式自動重覆請求(HARQ)法則來傳送該資 料,該等冗餘版本(RV)之各者表示在一循環緩衝器内一資 料區塊的傳輸起點位置,該使用者終端包含一控制器,其 係經調適以: 藉一第一冗餘版本利用該HARQ法則,執行該資料的 29 200926671 第一傳輸;以及 藉各種冗餘版本利用該HARQ法則,執行該資料的至 少一重傳, 其中該控制器係更經調適以:對於各次重傳,藉由考 量先則所用之冗餘版本及一預定序列決定所使用的冗餘版 脅 本;及其中在一序列裡,至少兩個彼此跟隨的冗餘版本具 有非連續的起點位置》 〇 13.如申請專利範圍第12項所述之終端其中該序列係經 循環地使用’以執行重覆的重傳作業^ 14.如中請專利範圍第12項所述之終端,其中該等複數個 冗餘版本包含四個冗餘版本,而在該循環緩衝器中個別地 具有四個不同起點位置。 其中該序列係由 點位置所構成: 15.如申請專利範圍第14項所述之方法, 按下列次序而設定之冗餘版本考量到其起 第一、第三、第四及第二冗餘版本。 16·如申請專利範圍第14項所 、冷端,其中具有第一也 點位置的該冗餘版本僅用於第一值 、 ^ 得輸;而重傳則是考量到 30 200926671 其起點位置,制_由按下列次序設定之冗餘版本 的序列來執行:第三、第四及第二冗餘版本。構成 17.如申請專利範圍第12項所述之終端,其中一冗餘版 係特定地用於該第一傳輸。 小,並且在該循環緩衝器中具備經等 。:版聰Γ.’其…… 距分隔的起點位置 19·如中請專㈣圍第12項所述之終端,其中該控制器係 更經調適以: 自該基地台接收排程資訊; 根據該排程資訊選定一冗餘版本; 藉該選定冗餘版本執行一傳輸;以及 藉由考量該選定冗餘版本及該預定序列,利用多個冗 、版本執行更的資料重傳。 2〇·如申 包含一所 π專利範圍第19項所述之終端,其中該排程資訊 選定之冗餘版本的指示器。 31 200926671 21.如申請專利範圍第19項所述之終端,其中該排程資訊 包含一目前通訊情況的指示器’並且選定一具一冗餘版 本,其緊鄰該所傳最後冗餘版本之起點位置的起點位置。 22.如申請專利範圍第19項所述之終端其中該排程資訊 • 包含一新資料指示器,並且該使用者終端在收到該新資料 指示器時執行一第一傳輸。 23· —種基地台,其係經調適以藉資料之複數個冗餘版本 利用一混合式自動重覆請求(HARQ)法則來傳送該資料該 等冗餘版本(RV)之各者表示在一循環緩衝器内一資料區塊 的傳輸起點位置,該基地台包含一控制器,其係經調適以: 藉一第一冗餘版本利用該HARQ法則執行該資料的第 一傳輸;以及 m 藉各種冗餘版本利用該HARQ法則執行該資料的至少 一重傳, - 其中該控制器係更經調適以:對於各次重傳,藉由考 量先前所用之冗餘版本及一預定序列,決定所使用的冗餘 版本;及其中在一序列裡,至少兩個彼此跟隨的冗餘版本 具有非連續的起點位置。 32 200926671 24. —種資料傳輸系統,其藉資料之複數個冗餘版本利用 一混合式自動重覆請求(HARQ)法則,於一基地台與至少一 使用者終端之間進行資料傳輸,其中該使用者終端係一如 申請專利範圍第12項所述之使用者終端,並且該基地台係 , 一如申請專利範圍第23項所述之基地台。 ❹ 33200926671 4. A method for considering the first, third, fourth and second redundancy versions of the redundancy version set in the following order as described in claim 3, wherein the sequence consists of its starting position: 5. If the redundancy version of the patent application point location is only the starting point, it is executed by a sequence: the third, the third item, the earth, the earthwork, which has the first for the first transmission; and the retransmission It is considered to be the fourth and second redundancy versions of the redundancy version of its % (four). 6. The method of claim 1 is specifically for the first transmission. One of the redundant versions, such as the first version of the patent application, has the same starting point for the separation of the size. The method of claim 1, wherein all such verbose and equated in the quasar buffer are further included in the method of using the method described in claim 1. The base station receives the schedule information; selects a redundancy version according to the schedule information; 28 200926671 performs a transmission by using the selected redundancy version; and utilizes multiple redundancy versions by considering the selected redundancy version and the predetermined sequence Performing further data retransmissions. [beta] The method of claim 8, wherein the schedule information* includes an indicator of a selected redundancy version. The method of claim 8, wherein the schedule information includes an indicator of the current communication condition, and the selected redundancy version has a starting point immediately adjacent to the last redundant version of the transmission. The starting point of the location. 11. The method of claim 8, wherein the schedule information includes a new data indicator, and the user terminal performs a first transmission upon receipt of the new data indicator. Ο 12. A user terminal adapted to transfer the data using a hybrid automatic repeat request (HARQ) rule by a plurality of redundancy versions of the data, each of the redundancy versions (RV) Representing a transmission start position of a data block in a circular buffer, the user terminal includes a controller adapted to: use the HARQ rule to perform the data by a first redundancy version 29 200926671 a transmission; and utilizing the HARQ rule by using various redundancy versions to perform at least one retransmission of the data, wherein the controller is further adapted to: for each retransmission, by considering the redundancy version used first and one The predetermined sequence determines the redundancy version of the threat used; and in a sequence, at least two redundant versions following each other have a non-contiguous starting position. 〇13. The terminal of claim 12, wherein The sequence is used cyclically to perform repeated retransmission operations. 14. The terminal of claim 12, wherein the plurality of redundancy versions includes four redundancy versions. In this case, there are four different starting positions individually in the circular buffer. Wherein the sequence consists of point locations: 15. As described in claim 14, the redundancy version set in the following order takes into account the first, third, fourth and second redundancy version. 16· If the cold end, in the cold end, the redundant version with the first point location is only used for the first value, ^ is lost; and the retransmission is considered to be the starting position of 30 200926671, The system is executed by a sequence of redundancy versions set in the following order: third, fourth and second redundancy versions. Composition 17. The terminal of claim 12, wherein a redundancy version is specifically for the first transmission. Small, and has equals in the circular buffer. :版聪Γ.'its... From the starting point of the separation 19·If the terminal is as described in item 12 of the special (4), the controller is more adapted to: receive scheduling information from the base station; The schedule information selects a redundancy version; performing a transmission by the selected redundancy version; and performing more data retransmission with multiple redundancy and versions by considering the selected redundancy version and the predetermined sequence. 2〇·如申 Contains a terminal as described in item 19 of the π patent scope, wherein the schedule information is an indicator of the selected redundancy version. 31 200926671 21. The terminal of claim 19, wherein the schedule information includes an indicator of current communication status and selects a redundancy version that is immediately adjacent to the beginning of the last redundant version of the transmission. The starting point of the location. 22. The terminal of claim 19, wherein the schedule information comprises a new data indicator, and the user terminal performs a first transmission upon receipt of the new data indicator. A base station adapted to transmit the data using a hybrid automatic repeat request (HARQ) rule by means of a plurality of redundant versions of the data. The redundancy versions (RV) are each represented in a a transmission start position of a data block in the circular buffer, the base station including a controller adapted to: perform a first transmission of the data by using the HARQ rule by a first redundancy version; and The redundancy version uses the HARQ rule to perform at least one retransmission of the data, wherein the controller is further adapted to: for each retransmission, by considering the previously used redundancy version and a predetermined sequence, determining the used A redundancy version; and in a sequence, at least two redundant versions following each other have non-contiguous starting positions. 32 200926671 24. A data transmission system that utilizes a hybrid automatic repeat request (HARQ) rule to perform data transmission between a base station and at least one user terminal by means of a plurality of redundancy versions of the data, wherein The user terminal is the user terminal as described in claim 12, and the base station is as the base station described in claim 23 of the patent application. ❹ 33
TW097141674A 2007-10-29 2008-10-29 Method of data transmission using HARQ TW200926671A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US98323607P 2007-10-29 2007-10-29
KR1020080001946A KR20090043414A (en) 2007-10-29 2008-01-07 Method of data transmission using harq

Publications (1)

Publication Number Publication Date
TW200926671A true TW200926671A (en) 2009-06-16

Family

ID=40854259

Family Applications (1)

Application Number Title Priority Date Filing Date
TW097141674A TW200926671A (en) 2007-10-29 2008-10-29 Method of data transmission using HARQ

Country Status (4)

Country Link
JP (1) JP2010538574A (en)
KR (1) KR20090043414A (en)
CN (1) CN101843025A (en)
TW (1) TW200926671A (en)

Families Citing this family (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102479159A (en) * 2010-11-25 2012-05-30 大唐移动通信设备有限公司 Caching method and equipment of multi-process HARQ (Hybrid Automatic Repeat Request) data
CN102255710B (en) * 2011-04-15 2014-01-29 电信科学技术研究院 Method and device for storing encoding block
CN103312473B (en) * 2012-03-06 2017-09-29 中兴通讯股份有限公司 Reduce the method and apparatus that HARQ merges failure
CN103916225B (en) * 2013-01-06 2017-06-20 中兴通讯股份有限公司 Mixed automatic retransfer redundancy versions adaptive selection method and device
ES2764216T3 (en) 2013-12-03 2020-06-02 Lg Electronics Inc Methods and devices for transmitting uplink in wireless access system that supports machine-type communication
WO2017193260A1 (en) * 2016-05-09 2017-11-16 华为技术有限公司 Data transmission method and device
CN108270525B (en) * 2016-12-30 2021-02-12 华为技术有限公司 Redundancy version transmission method and equipment
WO2018141292A1 (en) * 2017-02-06 2018-08-09 华为技术有限公司 Data processing method and device
CN108400838B (en) * 2017-02-06 2021-05-18 华为技术有限公司 Data processing method and device
TWI714824B (en) * 2017-02-06 2021-01-01 聯發科技股份有限公司 Method and apparatus for communication
WO2018170840A1 (en) * 2017-03-23 2018-09-27 Panasonic Intellectual Property Corporation Of America Method, apparatus and system
CN108809498B (en) * 2017-05-05 2021-01-29 华为技术有限公司 Communication method and communication device
CN109039529B (en) * 2017-06-09 2021-01-29 华为技术有限公司 Data transmission method and data transmission device
CN109257137B (en) * 2017-07-12 2021-03-05 普天信息技术有限公司 Method and device for selecting redundancy version during data transmission
KR102176388B1 (en) * 2017-08-10 2020-11-10 노키아 테크놀로지스 오와이 Method and device
CN112073160B (en) * 2017-09-29 2021-12-31 华为技术有限公司 Design scheme for redundancy versions in communication systems
WO2019071393A1 (en) * 2017-10-09 2019-04-18 Nokia Shanghai Bell Co., Ltd. Natural/reverse order symbol mapping for redundancy versions
WO2019093840A1 (en) * 2017-11-10 2019-05-16 엘지전자 주식회사 Method for transmitting or receiving wireless signal in wireless communication system and apparatus therefor
CN110730054A (en) * 2018-07-16 2020-01-24 普天信息技术有限公司 Retransmission method and system for repeated transmission of service channel based on HARQ
CN113726487B (en) * 2020-05-26 2022-09-02 中国联合网络通信集团有限公司 Method and device for determining redundancy version

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2375606B1 (en) * 2001-03-26 2017-09-13 LG Electronics Inc. Method of transmitting or receiving a data packet in a packet data communication system using hybrid automatic repeat request
JP4413869B2 (en) * 2006-01-17 2010-02-10 株式会社エヌ・ティ・ティ・ドコモ Wireless communication apparatus and transmission method

Also Published As

Publication number Publication date
KR20090043414A (en) 2009-05-06
CN101843025A (en) 2010-09-22
JP2010538574A (en) 2010-12-09

Similar Documents

Publication Publication Date Title
TW200926671A (en) Method of data transmission using HARQ
US11101932B2 (en) Telecommunications apparatus and methods
US20090125774A1 (en) Method of data transmission using harq
JP5444230B2 (en) Asynchronous hybrid ARQ process indication in MIMO wireless communication system
JP3926248B2 (en) Transmission / reception apparatus and method for packet retransmission in a wireless communication system
US7397861B2 (en) Mapping strategy for OFDM-based systems using H-ARQ
EP2141851A2 (en) Automatic retransmission controller and retransmission block recombination apparatus
US20110055652A1 (en) Method for conducting harq with a wireless communications system
US8448038B2 (en) Method for transmitting data using HARQ
EP2266239A2 (en) Selection of retransmission settings for harq in wcdma and lte networks
WO2011050301A2 (en) Method and apparatus for a two-way relaying scheme with physical layer network coding
CN101242248A (en) Method and apparatus for transmitting reverse ACK/NACK for forward control channel
Cipriano et al. Overview of ARQ and HARQ in beyond 3G systems
WO2008111795A2 (en) Methods of transmitting data using a plurality of harq process channesl sequentially
EP2068482A2 (en) Methods and devices for scalable reception in wireless communication systems
TWI419502B (en) Methods for subblock generation, apparatuses for performing point-to-multipoint (ptm) transmission and apparatuses for performing subblock generation in a wireless communication system
WO2010048747A1 (en) A method for receiving feedback in multi-channel harq, and an apparatus and equipment thereof
KR101140091B1 (en) Method for performing a harq in a radio communication system
KR101548744B1 (en) Method for transmitting data using HARQ
KR101117002B1 (en) Method for performing a harq in a radio communication system
CN101527620A (en) Method for retransmitting data, method for receiving data, communication system and correlative devices
WO2012159819A1 (en) Method for retransmitting data from a first network to a second network node in a radio communication system, first network node and second network node thereof
CN101150385A (en) A data transmission method and transmitter
Yang et al. A hybrid automatic repeat request (HARQ) with turbo codes in OFDM system
JP2010022049A (en) Retransmission method for data, and communication device