TW200945815A - Method for operation of synchronous HARQ in a wireless communicatino system - Google Patents

Abstract

A method of operating synchronous hybrid automatic repeat request (HARQ) between a transmitting station and a receiving station in a Time-Division Duplex (TDD) communication system includes configuring, at the transmitting station, a plurality of HARQ processes; transmitting data packets to the receiving station using the plurality of HARQ processes, wherein the data packets do not include HARQ process identification information; receiving, from the receiving station, a plurality of HARQ feedback packets indicative of whether the data packets were correctly received at the receiving station, wherein the plurality of HARQ feedback packets do not include HARQ process identification information and wherein the plurality of HARQ feedback packets are received in a downlink slot; and mapping, by the transmitting station, the plurality of HARQ feedback packets to the plurality of HARQ processes.

Description

200945815 i VI. Description of the Invention: TECHNICAL FIELD OF THE INVENTION The present invention relates to the field of wireless communications, and more particularly to a system and method for performing synchronous hybrid automatic repeat request in a wireless communication system. [Prior Art] In a wireless communication system, a wireless device can achieve communication without a line connection. As wireless systems have become relevant to people's lives, the demand for wireless communication systems that support multimedia services is growing, such as voice, audio, video, archives, and web downloads. To support these multimedia services, various wireless communication protocols used in wireless communication networks have been developed to meet the growing demand for multimedia services. One type of communication protocol is Wideband Code Division Multiple Access (W-CDMA), which is published in a third-generation partner program co-operated by several international standards development organizations. (3rd Generation Partnership Project, 3GPPTM). W-CDMA is a spread spectrum mobile air interface with a wide frequency band and uses Code Division Multiple Access (CDMA) for direct sequence. In some embodiments, W-CDMA can support the Universal Mobile Telecommunication System (UMTS). The UMTS communication system provides telephony and bearer services for connection-oriented (Point-to-Point, P2P) communication networks in Connectionless and Connection-oriented 200945815 (Connection-oriented). And communication between point-to-multipoint (p〇int_t〇_Multip〇int, P2MP). In some UMTS communication systems, the null intermediation access method can be constructed on a universal land radio access network (Universal).

On Terrestrial Radio Access Networks (UTRAN), UTRAN may also be called UMTS terrestrial radio access network (also known as UTRAN), or evolved UTRAN (Evolved UTRAN, E-TRAN), or long-term evolution. Technology (Long Term Evolution). A typical wireless communication system operates on a Frequency Division Duplex (FDD) or in a time division duplex (Time 〇Μ8ί〇η)

Duplex, TDD) mode. In an FDD system, an upUnk transmission or a downlink transmission operates in different channels, i.e., operates in different frequencies. The wireless device operating in this FDD system can transmit and receive simultaneously. However, in the TDD wireless communication system, the channels are used in turn by the uplink transmission and the downlink transmission so that they can operate on the same communication channel. In some systems, such as the upcoming fourth generation (4G) wireless system, TDD technology will have an advantage because TDD can effectively support asymmetric data exchange. For example, when the system transmits with asymmetry, the system can increase the spectrum usage. Please refer to FIG. 1 , which shows the signal flow chart of the traditional TDD frame structure taking the wireless rail system as an example. Frame 1 is composed of multiple periods that can be used for downlink and uplink transmission. It is called Transmission Time Intervals (TITIs) 1〇2. As shown in Figure 1, News 5 200945815

The TW5395PA frame 100 includes an upper chain frame 1〇4 and a lower chain frame 1〇6. When the upper key Sfl block 104 is used, the lower link point (n〇(le) 108 transmits the uplink transmission no, for example, to receive the upper link point 112. In the lower chain subframe 1〇6, the upper link point 112 is transmitted. The chain transmits U4, for example, such that the downlink point 1 〇 8 is received. The uplink subframe 104 and the downlink subframe 106 can each include any number of TTIs 102 'the size of the frame 1 可 can be changed. In some variations In the application, the structure of the frame can be dynamically adjusted according to the ratio of the uplink data to the downlink data to be transmitted. The protocol stack of the radio interface can include, for example, error detection. The method of measurement is Automatic Repeat Request (ARQ) and Hybrid Automatic Repeat Request (HARQ), which are used to control errors when the transmitted data passes through the wireless network. In the ARq, the receiver detects a frame error and requests retransmission. The HARQ is applied to the change of the ARQ error control method, and a forward error correction bit is added to correct the frame error. In some variant applications, ' HARQ can be set to operate using a Stop-And-Wait (SAW) mode, or a Selective Repeat (SR) mode. In SAW mode, in transmission or heavy Before passing the next data packet, the HARQ transmitter must wait for a HARQ return packet to be returned by the HARQ receiver, such as an acknowledgment signal (ACK) or a negative signal (NACK). In some variations, The new transmission and retransmission are distinguished using one of the 1-bit sequence number associated control signals'. The transmission channel may not be utilized while waiting for the HARQ return packet. 200945815 i ντ _/j:7jrrv

The transmitting device (or transmitting station) may include a HARQ transmitter (HARQ-like HARQ receiver (HARQ RX) mechanism. The HARQ transmitter and HARQ receiver mechanisms may be any combination of software and/or hardware, and are set to The transmitting and/or receiving apparatus performs the function of transmitting and/or receiving HARQ transmission. The HARQ transmitter and the HARQ receiver mechanism can be respectively set in the MAC sublayer of the transmitting and receiving apparatus. Referring to FIG. 2, It is shown as a traditional use of a HARQ program

e Signal flow diagram for transmission. In a variant application, the HARQ process is an example of a SAW protocol and can be used to control the transmission/retransmission of data. As shown in FIG. 2, the HARQ transmitter 202 transmits a data packet 204 to a HARQ receiver 206. The HARQ transmitter 202 can program the data packet 204 prior to transmission, and the HARQ receiver 206 can decode the data packet 204. If an error is detected, the received data packet 204' can be discarded and the HARQ receiver 206 can request a retransmission by transmitting a negative acknowledgement (NACK) 208 to the HARQ transmitter 202. Upon receiving the negative signal (NACK) 208, the HARQ transmitter 202

A data packet 204' is retransmitted to the HARQ receiver 206. After the HARQ receiver 206 correctly receives the retransmitted data packet 204', the HARQ receiver 206 transmits an acknowledgment signal (ACK) 210 to the HARQ transmitter 202. Thereafter, the HARQ transmitter 202 transmits a new data packet 212 to the HARQ receiver 206. In the SAW mode of multi-channel (i.e., using N parallel HARQ programs), HARQ can improve transmission efficiency by, for example, reducing the overhead of the control signal. While waiting for the 7 200945815 TW5395PA τ and HARQ return packet (ACK/NACK) of the previously transmitted data packet, other transmissions are possible. In a variant application, a HARQ program identifier (or HARQ program identification code (ID)) may be included in the transmission. Thus, the HARQ receiver 206 can identify the HARQ program in accordance with one of the received data packets. Please refer to FIG. 3, which is a flow chart of the §fL number conventionally used when multiple HARQ programs are used for transmission. As shown in FIG. 3, after the data packet 204 is transmitted by a first HARQ program, the HARq transmitter 2 〇 2 transmits a data packet 302 via a second HARQ program. After successfully receiving the data packet 302, the HARQ receiver 206 transmits an acknowledgment 〇 signal (ACK) 304 to the HARQ transmitter 2 〇 2. Thereafter, the HARQ transmitter 202 can transmit a new data packet 306 to the HARQ receiver 206. In order to comply with the IEEE 802.16 family of standards, ' HARQ can be set to be synchronous or asynchronous and has the function of adaptive or non-adaptive modulation, and can include coding methods applied to different forms of HARQ programs, such as continuous combining ( Chase combining), or progressive redundancy operation

(incremental redundancy operation). The operation of the 'HARQ transmission/retransmission' can be transmitted only for a predetermined time when it is implemented in the synchronous HARQ. In the FDD system, since the continuous uplink and downlink transmission are in different channels, the synchronous HARQ can be implemented using the same packet Round Trip Time (RTT). The HARQ program corresponding to a specific data packet or HARQ return packet is determined by a time slot. In a TDD system, since multiple data packets or HARQ return packets are received in a single time slot, only one return time slot may not be sufficient to determine the HARQ program identification code. In the embodiment disclosed by the present invention, it is used to overcome one or more of the problems mentioned above, 200945815. SUMMARY OF THE INVENTION According to one aspect of the present invention, a method is proposed for use in a Time-Division Duplex (TDD) communication system for performing synchronous mixing between a transfer station and a transfer station. Hybrid Automatic Repeat Request (HARQ). The method sets a plurality of HARQ programs at the transmitting station. The method utilizes the plurality of HARQ programs © to transmit a plurality of data packets to the receiving station, wherein the data packets do not contain HARQ program identification information. Moreover, the method receives a plurality of HARQ return packets from the receiving station to indicate whether the data packets are correctly received at the receiving station, wherein the plurality of return packets do not include the HARQ program identification information 'and many of them The HARQ return packets are received in the downlink slot. The method also maps the plurality of HARQ return packets to the plurality of HARQ programs by the transmitting station. According to another aspect of the present invention, a method is proposed for use in a TDD communication system for performing HARQ between a transmitting station and a pick-up station. The method receives a plurality of data packets from the transmitting station at the receiving station and is from a plurality of HARQ programs, wherein the data packets do not include HARQ program identification information. The receiving station generates a plurality of HARQ return packets to indicate whether the data packets are correctly received at the receiving station, wherein the HARQ return packets do not contain HARQ program identification information. The method also transmits, by the receiving station, the HARQ return packets at a predetermined time and does not transmit the HARQ program identification information. According to another aspect of the present invention, a method is proposed for use in a transmission 9 200945815

i WDJWA sends the station to set the HARQ program and applies it to the communication system with one of the receiving stations tdd. The method determines a return time slot Fj, wherein the return time slot Fi is one time slot when the receiving station provides a HARQ return data, and corresponds to the transmitting station in a uplink time slot i is transmitted to the receiving station by using a HARQ program. A data packet. The method determines a transmission time slot Ti, wherein the transmission time slot is a HaRq program for transmitting a data packet in the time slot of the transmitting station, and a transmission time slot of the next data packet. Moreover, the method determines the number of slots in a winding up, and is between the slot and the slot immediately before the transmission. Moreover, the method sets the number of HARQ programs, ❹ N is one of Ni, and the maximum value 'i is between Bu 1 and &, & is expressed as a number of time slots for the uplink in a frame. . According to another aspect of the present invention, a wireless communication station is proposed for wireless communication in a TDD communication system. The wireless communication station includes at least one memory and at least one processor. At least one memory is used to store data and instructions. At least one processor is set to access the memory. At least one processor is also configured to perform the following steps when executing the instructions. Set multiple HARQ programs. Moreover, at least one processor further uses a plurality of HARQ programs to transmit data packets, wherein the data packets do not include HARQ program identification information, and receive multiple HARQ return packets to indicate whether the data packets are correctly received. The plurality of return packets do not include HARQ program identification information, and wherein the plurality of HARq return packets are received in a slot time slot. At least one processor is further configured to map the plurality of HARQ return packets to the plurality of HARQ programs. According to another aspect of the present invention, a wireless communication station is proposed for wireless communication in a TDD communication system. The wireless communication station includes 200945815 1 w ^fjyjrrs. At least one memory and at least one processor. At least one memory is used to store data and instructions. At least one processor is set to access the memory. At least one processor is also configured to perform the following steps when executing the instructions. Receiving multiple data packets from multiple HARQ programs, wherein the data packets do not contain HARQ program identification information. At least one processor is further configured to generate a plurality of HARQ return packets to indicate whether the data packets are correctly received, wherein the HARQ return packets do not include HARQ program identification information, and are for a predetermined time. The HARQ ❹ return packets are transmitted and the HARQ program identification information is not transmitted. According to another aspect of the present invention, a transmitting station is proposed for use in a TDD communication system having a receiving station. The transfer station includes at least one memory and at least one processor. At least one memory is used to store data and instructions. At least one processor is set to access the memory. At least one memory is also set to perform the following steps when the instruction is executed. When determining the return, the return slot Fi is a time slot for the receiving station to provide a harq returning negative material, and corresponding to the transmitting station when the uplink is in a chain, the slot i is transmitted to the receiving station using a parameter HARQ匕 program. Packet. At least one processor is further configured to determine a transmission time slot Ti, wherein the transmission time slot is a HARQ program for transmitting data packets in the time slot i of the transmitting station, and a transmission time slot of the next data packet, and Determining the number Ni of one slot in the uplink, and between the slot i and the slot immediately before the slot A in the uplink, and at least one processor is used to set the HARQ program after executing the command. One of the numbers N is the maximum value of one of Ni, and the 丨 is between 丨=1 and 汪, where a is a number of time slots for the winding in a frame β 11 200945815 I W5395FA [Embodiment] In an embodiment of the present invention, a method and system are provided for mapping a HARQ return packet to one of the HARQ programs it responds to enable a HARQ receiver and a HARQ transmitter to be implemented in a TDD communication system. Synchronize HARQ. The base station (BS) may include a HARQ receiver, and the subscriber station (Subscriber Stati〇n, SS) may include a HARQ transmitter. Alternatively, the HARQ receiver can be placed in the subscriber station' and the HARQ transmitter can be placed in the base station. The receiving station receives the data packet from the transmitting station and replies to the transmitting station with a feedback packet. The transmitting station is configured to transmit a data packet to the receiving station and receive a return packet from the receiving station. Figure 4 is a flow chart showing the signal of the synchronous HARQ in the TDD communication system. Due to the limitations of the uplink and the downlink time, the lower and upper chain points are forced to delay their transmission until the appropriate uplink or downlink subframe. For example, the HARQ transmitter transmits a data packet 4〇4 after receiving the acknowledgment signal (ACK) 400 transmitted by the HARQ receiver 206 in response to the transmission of a data packet 402. However, until the downlink subframe 1〇6, the HARQ receiver 206 cannot transmit an acknowledgment signal (ACK) 406 to the HARQ transmitter 202. Thus, after processing the data packet 404 to determine if it was received correctly, the HARQ receiver 206 is forced to wait for a delay 408. Therefore, a downlink time slot may contain multiple acknowledgment signals and/or acknowledgment signals corresponding to multiple HARQ procedures. In some embodiments, when performing synchronous HARQ of multiple HARQ procedures in TDD, HARQ return packets (acknowledgement signals/denial signals) corresponding to multiple data packets of multiple HARQ programs may need to be decoupled in one 12 200945815 The time slot is transmitted. The reason may be that the sizes of the downlink subframe 1〇6 and the uplink subframe 104 are inconsistent, or the processing time of the HARQ transmitter and the HARQ receiver is inconsistent. For example, Figure 5 illustrates a signal flow diagram for multiple harq programs in a TDD system. The HARQ transmitter 202 uses the plurality of HARQ programs and can transmit the data packets 5, 502, and 504 in the time slots i, is, and 分别, respectively. Upon receipt of the data packet 502, the HARQ receiver 2〇6 processes the data packet 502 to determine if an error has occurred in the transmission. In one embodiment, the base station delay time dBs5〇6 is the delay required to process the data received by the base station. Next, the return 5〇8 is transmitted, for example, by the HARQ receiver 206 to the HARQ transmitter 2〇2. Due to the base station

The length of the delay time dBS 506 'return 508' includes only the HARQej return packet (confirmation signal/denial signal) corresponding to the data packet transmitted by the slot h of the uplink. After processing the data packet 502 in the base station delay time dBs5〇6 and the w HARQ receiver 206 can transmit the return 51包括 including the HARQ return packet corresponding to the data packet 5〇2, the Harq receiver 2〇6 will wait for additional The down key delays "512 until the lower key subframe/synchronously processes the data packet mV in the base station delay time dBs5〇6 and when the 'receiver 2〇6 can transmit the HARQ return packet corresponding to the data seal Upon returning to 510, the HARQ receiver delays "516 until the next key subframe 燐.i returns 5iG may also include an I4 packet 5186" HARQ return packet corresponding to the uplink. Although the unprocessed point processing ΗΓ Ι ' ^, in some pure structural towels, will result in the delay of the downlink point processing HARQ return packet (such as user station delay time 13 200945815 1 t dss), until the downlink point can be under One can use the upper chain time slot to transmit or retransmit data packets. Thus, the return received in a downlink time slot may include more than one HARQ procedure and more than one acknowledgement/denial signal for the data packet. Thus, in one embodiment, the return 510 received by the HARQ transmitter 2 可 2 may include an acknowledgement/denial signal corresponding to the data packets 502, 5〇4, and/or 518. In a conventional synchronous TDD system using multiple HARQ programs, an explicit HARQ program identification data (or HARQ program identification code) signal is included, and a HARQ return packet is included to enable the wireless communication station, for example, to The link point or the downlink point has the ability to decide to transmit a specific HARQ return packet, which corresponds to the HARQ program and/or data packet, with other HARQ return packets. However, due to the inclusion of the harq program identification code, the signal load is increased and the overall efficiency of the system is reduced. Please refer to FIG. 6A for a block diagram showing an example of a wireless communication system. Embodiments of the invention may be implemented in this system. In an embodiment Q, the wireless communication system 600 is a UMTS system. As shown in FIG. 6A, the exemplary wireless communication system 600 includes, for example, a core network 610; one or more radio network controllers 620, such as a radio network controller. 620a and 620b); - one or more base stations 630, such as: base stations 630a, 630b, 630c, 630d, and 630e; and one or more subscriber stations 640, such as subscriber stations 640a, 640b , 640c, 640d, 640e, and 640f. Need to know, in different wireless systems, you can also use the same terminology and functions. The core network 61 is, for example, a network or a group of communication networks for providing a general service. Core network 610, for example, is used to provide switching, routing, and transmission of user traffic. In addition, the core network 61 has, for example, a database and network management functions. In some embodiments, the core network is built on a Global System for Mobile System (Global System for

Mobile Communications, GSM) network architecture. The core network 61〇 includes, for example, any combination of wired and/or wireless connections. © Each radio network controller 620 is, for example, any type of communication device' and is used in an exemplary wireless communication system 600. In this field, many such communication devices have been developed. In the wireless communication system, each radio network controller 620 is for example responsible for resource management, action management, encryption, and the like. In addition, each radio network controller 62 is, for example, responsible for controlling one or more base stations 630. Although not shown in the figures, one or more radio network controllers 620 may be connected to the core network 610, for example, via one or more gateways and the like. Each radio network controller 620 includes, for example, one or more of the following components: a central processing unit (CPU) for executing computer executable instructions to execute various programs and methods; random access memory (random access memory) Memory, RAM) and read only memory (ROM) for accessing and storing data and computer program instructions; memory (memory or storage) for storing data and information; database 'for storing A table, list, or other data structure; and input/output devices, interfaces, and antennas, and the like. Each of these components is here 15 200945815

The IW5395FA field is well known to those of ordinary skill and is therefore not described in detail herein. The base station 630 is, for example, any type of communication device for transmitting data and/or communication to one or more subscriber stations 640 in a wireless communication system, and/or receiving data and/or communications via such subscriber stations. Many such communication devices have been developed in this field. In some embodiments, the base station 630 is also referred to as, for example, a point B (n〇de-B), a base transceiver system (BTS), and an access point, and the like. The communication between the base station 630 and the radio network controller 62A is, for example, a combination of any wired and/or wireless connection. The communication between the base station 63〇 and the subscriber station 640 is, for example, wireless communication. In an exemplary embodiment, the base station (4), for example, also has a broadcast/received work I, within a range in which the base station 630 can communicate with one or more subscriber stations 64. The range of broadcasts may vary depending on the power level (1), level, location, and interference (physical, electrical, etc.). The figure is a block diagram showing an example of the architecture of the base station 63〇. In the case of FIG. 6B, each base station 63 includes, for example, one or more of the following persons, at least one central processing unit 631, for performing computer execution instructions, and executing various programs and methods; random access memory 632 and reading only two 6 illusion 'used to access and store data and computer program instructions; memory table, , l L for storing data and information; database 635 for storing 637 π single or other data structure; and input / output device 636, the interface is usually the same. Each of these elements is well known in the art and is not described in detail herein. The device 640 refers to FIG. 6A. The subscriber station 640 is, for example, any type of ubiquitous for transmitting data and/or communication to a 16 200945815 or more base stations 630 in a wireless communication system, and/or via such users. Receive data and / or communications. In some exemplary embodiments, subscriber station 440 is, for example, a fixed antenna, or a mobile subscriber station, and may also be referred to as user equipment. The subscriber station 640 includes, for example, a server, a client, a mainfraine, a desktop computer, a laptop computer, a network computer, a workstation, a personal digital assistant (PDA), a tablet computer ( Tabletpc), scanner, call device, pager, camera, music device, etc. In one embodiment, subscriber station 640 is, for example, a mobile computing device. Section 6C_ is shown as a block diagram of the architecture of the subscriber station. As shown in FIG. 6C, each user σ 0 includes, for example, one or more of the following 70 to the central processing early 641, and uses the command to execute various programs and methods. The user can use the lamp to perform the pure deduction (four) w / random storage. The memory 642 and the read-only memory 644 are used to store the #material and the f-meter list, the list, or the (4)-like surname library storage map 647, to start the structure; and the input/output device 646, the interface has ii Each of these elements is well known in the art to those of ordinary skill and is not described in detail herein. With

Second, the way of logical connection I 610 ik ^ 44 As shown in Figure 6A, the logical connection between the core network interfaces Iu · Iφ is called "face Iu", the radio network control controller (four) and Or a plurality of radio network controllers 620 and a ground connection 5 = a logical connection between the interface & radio σ 630, for example, referred to as 17 200945815 IW5395FA < interface Iub; base station 630 and subscriber station The communication between the 640 is referred to as the interface Uu, for example. In an embodiment, the interfaces iu, iur and Iub can be implemented, for example, by an Asynchronous Transfer Mode (ATM). In an embodiment, the interface Uu can be, for example. By using W-CDMA, FIG. 7 is a flow chart showing an example of using a TDD synchronization mechanism in a TDD frame structure according to some embodiments of the present invention. In an exemplary TDD synchronization mechanism, The chain point has, for example, a HARQ receiver 702 'the lower link point has, for example, a HARQ transmitter 704. The HARQ receiver 702 and the HARQ transmitter 704 can be, for example, any combination of software and/or hardware components, and are configured to Make this transfer The receiving device performs the functions of the disclosed embodiment. For example, the HARQ receiver 702 and the HARQ transmitter 704 are respectively disposed in the MAC sublayer of the transmitting device and the receiving device, respectively. The transmission and reception of the receiver 702 and the HARQ transmitter 704 are performed in the time slot 706. The time slot 706 includes an upper key time slot 708 and a lower chain time slot 710, which are combined to form a frame 711. For example, 用户 is the subscriber station 640. The uplink point is, for example, the base station 630. When the exemplary TDD synchronization mechanism 700 is used, if the available slot number and the maximum number of harq programs are known, then one can be selected. HARQ program identification code. As shown in Fig. 7, in the exemplary tdD synchronization mechanism, not all time slots 706 are used for uplink transmission. Instead, some time slots 706 for uplink transmission (for example, The uplink time slot 708) can be used as the available time slot 712. As shown in Figure 7, a plurality of HARQ programs are each assigned a HARQ program identification code 714 and are looped in the available time slot 18 200945815

A TV is executed. In an embodiment, the HARQ transmitter 704 can determine the HARQ program identification code 714 corresponding to a transport data packet, and is determined according to the following formula (1): The HARQ program identifies the horse = the number of available time slots m〇 (The maximum number of j HARQ programs is shown in the exemplary mechanism 700 shown in Fig. 7. The maximum number of HARQ programs is set to 5. The data packet 716 is transmitted in slot 706 of the first apostrophe. The time slot 712 is available for number 8. After using the above formula (1) 'because 8 mod 5 = 3, the HARQ program identification code 714 for the data packet 716 is determined to be 3. Similarly, when the nth number is available In data packet 718 transmitted in slot 712, because um 〇d $ = 1, the HARQ program identification code 714 for data packet 718 is 1. In other embodiments, an exemplary TDD synchronization mechanism can also be used, as long as The HARQ program identification code 714 is related to a specific location in the frame 711, and the number of HARQ programs is selected to be a multiple of the size of the frame 71, wherein the size of the frame 711 depends on the slot 7 of the winding. 8 and the number of slots 71〇 in the lower chain. In the system, the HARq program identification code 714 can be determined by the following formula: HARQ program identification code = number of time slots m 〇 dHARQ program maximum number / Λ, (2) According to some embodiments, the decision can be made for the transmitting station ( The preferred number of HARQ procedures as set in the HARq Transmitter 704. Increasing the number of juxtaposed HARQ programs may increase the need for buffering and increase the demand for uplink signals, and may also result in excessively long round-trip transmission times ( R〇undtdp time, RTT). An excessively long RTT will result in the wrong selection of a modulation and coding 19 200945815 l (Modulation and Coding Scheme, MCS), and will receive the wrong packet. Similarly, when HARQ When the number of programs increases, Adaptive Modulation and Coding (AMC) will be lost due to excessive RTT. Furthermore, when applied to Frame Check Sequence (FCS), The HARQ status information may need to communicate with a new base station. In order to reduce the load on the uplink signal stream, the better number of HARQ programs will be limited. However, the settings are The number of HARQ programs must be large enough for all HARQ programs to have enough time to process the data. If too few HARQ programs are used, then the HARQ program waits for the HARQ return packets of the packet data it transmits. At the same time, the up key slot will be wasted. Fig. 8 is a flow chart showing an example of using a TDD synchronization mechanism in a TDD frame structure in accordance with some embodiments of the present invention. For example, as shown in FIG. 8, the HARQ transmitter 704 is configured to, for example, set a first HARQ program 802, a second HARQ program 804, a third HARQ program 806, and a fourth HARQ program 808. As shown, the base station delay time dBS used to process a data packet and the user station delay time dss used to process the HARQ return data are both Transmission Time Intervals (TITIs). In other embodiments, more or less processing time TTI may also be used as one or more base station delay times dBS and subscriber station delay times dss. As shown in FIG. 8, each of the HARQ programs 802, 804, 806, and 808 located at the HARQ transmitter 704 (e.g., subscriber station) transmits a data packet to the HARQ receiver 702. The HARQ receiver 702 receives all or part of the data packets and transmits the HARQ return 20 200945815 * »▼ 1-%. Packet or data 'in response to the data packets to indicate whether the data packets are correct and/or incorrect. The ground is received. The HARQ programs 802, 804, 806, and 808 are SAW HARQ programs and are set to be executed sequentially. For example, when transmitting the data packet and receiving the HARQ return packet, the second HARQ process 8〇4 is followed by the first HARQ process 802, and the third HARQ process 806 is followed by the second harq process 8〇4. And the fourth HARQ program 808 is connected after the third HARQ program 806. For example, as shown in FIG. 8, in time slot 1, the first HARQ program 802 transmits a data packet 81A to the HARQ receiver 7〇2. When the HARQ receiver 702 processes the data packet 810 in the time slot 2 with the time period dBS, the second HARQ program 8〇4 transmits a data packet gw to the HARQ receiver 702. In time slot 3, the third HARQ process 8〇6 transmits a data packet 818 to the HARQ receiver 702, while the HARQ receiver 702 processes the data packet 814. The 'HARQ receiver 7〇2 in the time slot 4 transmits a return 82〇 to the HARQ transmitter 704. The data packet included in the return 820 is the data packet processed by the HARq receiver 702, that is, the data packets 81 and 814, when the known base σ delay time dBS is taken up and the time slot 4 is reached. In accordance with an embodiment, the return 82 can be, for example, a bit map or other data structure that includes one or more HARQ return packets. In one embodiment, the HARQ receiver 702 continues to process the data packet 818 in the same time slot as when the return 820 is transmitted. In time slot 4 to time slot 8, the HARQ receiver 7〇2 continues to process the data packet. The HARQ transmitter 704 also continues to process the return 82. More specifically, in time slots 5, 6 and 7, HARQ programs 808, 802 and 21 200945815 804 transmit data packets 822, 824, and 826, respectively. In the implementation, no data packets will be processed in time slot 5, and data packets and 824 will be processed in time slots 6 and 7, respectively. In time slot 8, the eight-receiver 702 transmits a return 828 to the HARQ transmitter 704. Return The HARQ return packet including data packets 818, 822, and 824. In time slot 9, the HARQ transmitter 704 does not transmit any data packets because the second HARQ program 806 will then be used to transmit a data packet, but the third HARQ program 806 has just received the data packet. 818 returns, and there is no time to process this return to determine if a data packet 818 needs to be retransmitted, or if a new resource packet needs to be transmitted. Similarly, in some embodiments, the HARQ transmitter 7〇4 does not transmit data packets in certain time slots. For example, as shown in FIG. 8; when the third HARQ process processes the HARQ return packet of the 'negative packet 818' during the delay period dss of the subscriber station, no data packet is transmitted at time 9. The third HARQ program 8〇6 will transmit the data packet 830 in the sentence slot. Therefore, when too few HARQ programs are used in the frame structure, and the system needs to use the base station delay time dBs and the user station delay time dss, part of the transmission time slot will be wasted. In order to improve performance, in some embodiments, the preferred N of the HARQ program can be calculated and designed to be large enough to reduce and/or eliminate wasted wheel slots. 9 is a signal flow diagram of a system according to some embodiments of the present invention. The & system implements an example 12 algorithm for determining the number of HARQ programs set by the subscriber station, and is used for In the wireless communication system. In one embodiment, 'a is the upper slot of the frame 9〇〇. The number 22 b is the number of the lower slots in the frame 900. For example, as shown in Fig. 9, 'a is 3 and b is 1. This example algorithm can be used to determine the number of slots in the return chain, the slot Ti' in the transmission, and the number of slots in the chain.

Ni' and the transmitting station can determine the preferred number N of HARQ procedures to be set. The data packet 902 transmitted in time slot i is processed, for example, by the HARQ receiver 702 in the base station delay time dbs. Thus, the data packet 902 will be processed until time slot i+dbs. If the next time slot i+dbs+1 is the next time slot, the associated return 904 will be replied to the HARQ transmitter 7〇4 in this slot. Otherwise, the HARQ receiver 7〇2 will wait for an additional downlink delay dDL to transmit this associated return 9〇4. As shown in FIG. 9, for example, the base station delay time dbs is 3 TTIs, and since the next time slot after time i+3 is not the downlink time slot, the harq receiver 702 transmits the relevant return. In 904, it will wait for an additional down key delay dDL ' until the next available downlink time slot. When the return chain is returned, the slot Fi is a time slot when the HARQ receiver 7〇2 transmits the data packet ❹902 back to the HARQ transmitter 7〇4, wherein the data packet 9〇2 is attached to the winding time slot. i transmitted. In one embodiment, the position of the slot i in the frame during the winding is calculated, for example, by imod(a+b). According to an embodiment, the following formula (3) can be used to determine an additional downlink delay dD]L: dDL=aAi + dBs)^^{a^b) (3) For example, as shown in FIG. , dDL(i=2)=2. In an embodiment, the groove i is used to return to the lower key slot when the winding is performed. It can be determined according to the following formula (4): 23 200945815 l For example, as shown in Figure 9, Fi(4))=_{68} = 8. The HARQ transmitter 740 processes the associated return when the time slot & receive related return % HARQ transmitter 704 waits for the time slot Fi+dss. If the time slot Fi+dss is below the time slot and the time slot is the up key slot, an additional data transmission 906 will be performed. Otherwise, the HARq transmitter 7〇4 will wait for an additional uplink delay dUL to transmit additional data transmission ports. For example, 'as shown in Figure 9, 'because Fi+3 is lower than the last slot, the HARQ transmitter 704 will wait for additional before transmitting additional data transmissions 9〇6. Chain delay dUL. According to the embodiment, the additional uplink delay duL can be determined according to the formula. In more detail, in the embodiment, the additional uplink delay duL can be determined according to the following formula (7): dUL = b~{Fi^dss~-a)m〇^a + b) (5) For example, as shown in Figure 9, duL(4)=i(8) is deducted (4)= 1 °. The transmission slot Ti is the time slot for the user station to transmit additional data transmission 9〇6 ,, and use The same as the HARQ timing used to transmit the data packet 902 in the uplink time slot. If the subscriber station receives an acknowledgment signal, the additional data transmission 906 is, for example, a new data packet. If the subscriber station receives a repeal signal, it will retransmit a data packet at this time, for example, retransmit the data packet. 902. According to an exemplary embodiment, the transmission time slot Tj can be determined according to a formula. In more detail, 'in one embodiment' the transmission time slot Ti can be determined, for example, according to the following formula (6): 7; = max{ /5; + +1, /5; + dss + (ό - {F^ Dss - α) mod(a+6))+1} ( 6 ) 24 200945815 For example, as shown in Fig. 9, Ti(i=2)= max{12, 13} = 13 〇 according to an example In an embodiment, the number Ni of the slots in the winding can be determined according to a formula, which is between the slot i of the winding and the slot between the slots immediately before the transmission. In more detail, in an embodiment, the number of time slots of the upper chain may be determined according to the following formula (7):

= Tt -i~bx ( i \ V _a + b_ _a + b J (7) For example, as shown in Figure 9, Ni(i=2) = 8. As shown, 8

A winding time slot appears between the time slot i and the time slot 12: the time slots 2, 3, 5, 6, 7, 9, 10 and 11. In an exemplary embodiment, the number N of HARQ programs to be determined by the subscriber station cannot be less than that of all uplink slots i. As described above, when the number N of HARQ programs increases, buffering, retransmission, and signal loading may increase, and errors may occur. However, too few HARQ programs will degrade performance due to wasted time slots. Furthermore, if the slot i and the lower slot slot j have the same position in the frame 900, i φ mod(a+b)j mod(a+b) ', then % will be equal to Nj. Thus, in a preferred embodiment, the preferred number N of HARQ programs can be determined according to the following formula (8): N = max{Ni, i = 1 to a} (8) by using the above formula (8) , (7), (6), and (4) to determine one or more of N, Ni, Ti, and Fi, and the HARQ receiver (such as a base station) can determine the HARQ program to be set. Number N. In an embodiment, the HARQ transmitter can use, for example, the exemplary algorithm ' to determine the number of HARQ programs that have been or will be set by the HARQ transmitter. 25 200945815 1 W53V5m NN Determine the number of HARQ programs N Thereafter, the HARQ transmitter then uses the plurality of HARQ procedures N to transmit the data packet to the HARQ receiver. In one embodiment, the data packet does not include HARQ program identification information (also known as HARQ program identification code), and the jjARQ receiver (or base station) receives or attempts to receive the data packet. In some embodiments, upon receipt of the data packet, the HARQ receiver determines the HARQ program identification code for the data packet transmitted by the HARQ transmitter.

According to an exemplary embodiment, the HARQ program identification code for one or more data packets may be determined according to a formula. More specifically, the HARQ program identification code used for the data received by the slot X during the uplink can be determined according to the following formula (9): HARQ program identification code = x - bx X a + b

Mod N (9) Similarly 'when the HARQ receiver receives the data packet from the HARQ transmitter and does not receive a clear HARQ program identification humiliation

The time can still determine the HARQ program identification code. Therefore, for an uplink HARQ transmission, the base station can receive one of the received data without receiving an explicit HARQ program identification code from the subscriber station.

The packet determines the HARQ program identification code. Similarly, for downlink HARQ transmission, the subscriber station can determine the HARQ program identification code according to one of the received data packets without receiving the HARQ program identification code from one of the base stations. Figure 10 is a flow chart of a system that implements an exemplary algorithm to determine a HARQ procedure in accordance with the HARQ return 26 200945815 data transmitted by the chain time slot. In one embodiment, the HARQ receiver 702, for example, generates a bit map of the HARQ return packet to indicate whether the data packets are correctly received in the base station. In one embodiment, both the bit map and the return packet do not contain H A R Q program identification information. The HARQ receiver 702 transmits this bit map to the HARq transmitter 704. The HARQ transmitter 704 receives this bit map, e.g., in the downlink slot k, and the downlink slot k includes kl, 匕, and . In an exemplary embodiment, the HARQ receiver 7〇2 and/or the ❹HARQ transmitter 704 is configured to map the downlink timing slots to transmit the HARQ return packets, and corresponds to the uplink. The data packet transmitted in the heart of the slot. Sk&k can be mapped according to the following formula (10): If k mod (a+b) = 卜贝J Sk {i where i is between k-dbs-a-1 to k-i-1 Chain time slot}; otherwise ❷ k - m code is k-dbs_ 1 key time slot}. (1〇) The return packet corresponding to the group uplink time slot Sk can be combined with the -bit map: 'and generated by the HARQ receiver' and the bit map generated is at the predetermined time (for example, the next The chain slot k) is transmitted to the transmitter 704. In the embodiment, the upper slot time is caused by :A being shot into the bit map. In an embodiment, the bit map can be used after the bit map is received. The HARQ transmitter 704 uses the exemplary formula (10) to mosquito the slot. As shown in Fig. 10, the exemplary signal flow chart shows that the base delay time dbs 1002 is 6, the a system is 5 and the b system is 3. Therefore, if 27 200945815 1 ^ 8 ^ people to the formula (1G), because 8 mod 8 is not equal to a + 1 (= 6), s two on the ::: slot to make the return of the corresponding upper chain time slot Sk is Sk= {up key #1}. In another example, if the equation (10) is 14m 〇 d8, the chamber μ & ^ d is equal to 6, so that the groove Sk in the winding time is the time slot between, ie, the time slot 2, 3, 4 and 5. The receiver 7〇2 and the job transmitter 704 can be, for example, a soft or a combination of (4) and mosquitoes to enable the transmission and/or device to perform the functions of the disclosed embodiments. Perform the above performance

The ARQ receiver uses, for example, one or more of the base stations 630, the processing unit 63, the random access memory 632, the read only memory 633, the 4 input/output devices 636, and the antenna 638. The HARQ transmitter uses, for example, one or more central processing units 64 of the subscriber station 64, a random access memory 642, a read only memory 643, a memory 644, an input/output device 646, and an antenna 648.

The disclosure of the above embodiments of the present invention mainly describes uplink HARQ transmission, wherein the receiving station is a base station and the transmitting station is a subscriber station. This arrangement corresponds to 3GPP's LTE, and the HARQ system is constructed for asynchronous retransmission of the uplink path and asynchronous retransmission of the downlink path. However, those having ordinary knowledge in accordance with embodiments of the present invention should be aware that they are also applicable to downlink HARQ transmission, where the receiving station is a subscriber station and the transmitting station is a base station. Please refer to FIG. 11 , which is a schematic diagram of a frame of a wireless communication system according to an embodiment of the invention. In one embodiment, the transport time slot between the transmitting station and the receiving station is defined as a plurality of frames in accordance with the IEEE 802.16m specification. Each frame includes U winding time slots, D lower chain time slots, Ngi 28 .200945815 1 VV jjyjrrt. first idle time slots, Ng 2 second idle time slots, and % first slots, where U, D , Ngl, Ng2 and Ng3 are natural numbers. For example, the HARQ transmitter 7〇4, and the HARQ receiver 7〇2, execute several HARQ programs. In each HARQ program, the 1 transmitter 704' transmits the data packet to the HARQ receiver 7〇2, and the operation is performed in the u uplink time slots in each frame, the HARQ receiver, the 7〇2, and the reply return. The packet is packetized to the HARQ transmitter 7〇4, and the operation is performed in the D downlink time slots in each frame. ° • The parameter NA_MAP is further defined in the 1EEE 802.16m specification to indicate that there is a downlink time slot with a reply resource configuration information A_MAp in each of the D downlink time slots in each frame. The receiver 702' replies back to the return packet to the HARQ transmitter 7〇4, and the operation is performed in the slot with the reply resource configuration information in the winter MAp. For example, the parameter NA_MAP has a value, in other words, In J, the parent downlink time slot has the reply resource configuration information :A: MAP, and the hARq receiver 702 replies back the packet to 1^]1 (3 transmitter 704, the operation can be performed in each frame Any of the lower key time slots. Figure 12 is a flow chart of a system in accordance with some embodiments of the present invention. The system implements an exemplary algorithm for determining the harq transmitter 704, and HARQ reception. The number of HARQ programs executed between the controllers 702. For example, U, D, Ngl, Ng2, and Ng3 have values of 3, 2 1, 2, and 2, respectively, and each frame has one time slot. The third time slot, the third and fourth time slots, and the eighth and ninth time slots respectively correspond to ^ An idle time slot, Ngs second idle time slots, and Ng three third idle time slots '1st time slot and 2nd time slot and 5th to 7th time slots respectively correspond to d 29 200945815 1 w * downlink Time slot and U-winding time slot. Each time slot in each frame is indicated by, for example, a frame index i and a sub-frame index j, where the value of j is between Between 0 and 9. According to the frame index i and the subframe index j, a corresponding global index (Global Index) k ° can be obtained. Please refer to FIG. 13 , which illustrates the flow of the exemplary algorithm according to the embodiment. The exemplary algorithm includes the following steps. First, as step (a), one of the plurality of HARQ programs outputs HARQ in the u-th chain time slot of the 1-1th frame. Packet, I is a natural number, u Ο is a natural number less than or equal to U, and the starting value of u is 1. For example, 1=1 'the index of the frame corresponding to the i-th winding time slot and the number of times The frame index j satisfies: i=Il=0; j=5 and the corresponding global index k is equal to K, where K is a natural number. For example, K is equal to 5. Then, as in step (b) Corresponding to this HARQ program (the u-th uplink time slot output data packet of the 1-1st frame), the corresponding initial Ο retransmission time slot is calculated, and the global index thereof is equal to, for example, rk. Step (c), calculating according to the global index fK of the earliest retransmission time slot, the global index ruler of the uth uplink time slot, and the value 1;, 〇, 乂 1, ]^2, and 1^3 The number of time slots Νκ between the slots in the u-th winding and the earliest re-transmission. Then, as in step (d), increment u and repeat the foregoing steps to obtain U uplink time slots corresponding to a frame (for example, a frame corresponding to frame index 1_1) (for example, corresponding to the global index is The number of U-chain time slots for the three winding time slots of κ, K+1, and K+2. Then, as step (e)' 30 200945815, the number N of one of the programs to be set is calculated based on the number of slots in the pen. Next, an example will be given to further describe the foregoing steps. Further, in the step (e) of calculating the number N, for example, the number N is set to be the largest value among the number of time slots in the pen winding. For example, the case of step (e) is as follows: ^ N = max{Nj,j = D + Ngl + N?2to D + Ngl+ Ng2+ U-1} (") Ο ❷ where j is the second The frame index, ND+Ng% to ND+Ng+Ng2+U丨, respectively, is the number of time slots for the pen. Please refer to FIG. 14 for a partial flow chart of an exemplary continuation algorithm according to the present embodiment. In the step (计算) for calculating the number of slots Ν κ in the winding, for example, the following steps are included. First, as step (cl), according to the global index K of the u-th up key slot and the earliest retransmission time slot The global cable 丨 rtK' calculates the number of time slots between the earliest retransmission winding time slot and the u-th winding time slot, the frame index of the u-th winding time slot and the earliest retransmission ^ The frame index of the chain time slot. Then, as in step (c2), according to the value D, υ,

Ngi, Ng2, and Ngs calculate the frame length of each frame and the number of non-winding slots in each frame. Then, as in step (C3), according to the number of the total time slot between the last retransmission time slot and the uth uplink time slot, the frame index of the uth upper key time slot, the earliest retransmission The index of the frame of the last key slot, the frame length of each frame, and the number of non-winding slots in each frame, when calculating the winding

The number of slots Νκ° For example, steps (cl)-(c3) can be expressed by the following equation: Nk = rtK - K - (D + Ngl + Ng2 + NJ X .D^U + Ngl+N^N^H^W +Ngl+N'^-11 〇2) 31 200945815

*. ΤΤ μ/·/ ^ IV where K is the global index of the U-winding time slot; rtK is the earliest re-transmission of the global index of the winding time slot; Νκ for this u-th winding The number of slots in the slot between the slot and the corresponding one of the earliest retransmission keys; rtK-K corresponds to the total number of slots between the earliest retransmission slot and the U-up chain slot; +U+Ngi+Ng2+Ng3 corresponds to the long-term frame of each frame; D+Ngl+Ng2+Ng3 corresponds to the number of non-winding slots in each frame; __^_ and _ίκ_

D + U + WnJ iD + U + Ny+W respectively correspond to the frame index of the U-th chain time slot and the frame index of the earliest retransmission chain time slot. Referring to Figure 15, a partial flow chart of an exemplary algorithm in accordance with the present embodiment is shown. The step of calculating the earliest retransmission uplink time slot (bj includes, for example, the following steps. First, as step (bl), corresponding to the HARQ program of the u-th uplink time slot output data packet, the corresponding return is calculated. The lower key time slot, whose corresponding global index is equal to, for example, fK. Then, as in step (b2), corresponding to the HARQ program, the corresponding upper chain delay time step is calculated as step (b3), according to the earliest returning downlink time slot. Here,

The Q time and the delay of the transfer station determine the earliest retransmission time slot. Later, reference is made to "16®", which is illustrated in accordance with the exemplary embodiment of the present embodiment: a flow chart. The steps to determine the earliest retransmission time slot, such as the following steps. First, as in step (b31), according to the global index of the slot in the example chain and the global index of the transfer station delay = key time slot, the delay time of the transmission station, and the first delay after the delay of the B' leaf The overall operation of the chain operation time (four). = 32 200945815 After step (b33)', set the earliest retransmission time slot to correspond to the global index of the earliest up-key operation ready time and the largest value in the global index of the earliest up-key operation ready time after this delay. Time slot. For example, the steps (b31)-(b33) can be expressed by the following formula: y (13) rtK = max{ fK ten (10) + l, fK + Ding + Dul +1} where K is the u-th winding The global index of the slot; ~ the earliest retransmission of the global index of the uplink time slot; fK is the earliest return global index of the downlink time slot; Tms is the delay time of the transmission station; du1 is the uplink delay time: fk +Tms+l corresponds to the earliest winding operation ready time; fK+Tms+D 1+1 corresponds to the earliest winding operation ready time after this delay.

Referring to Figure 17, a partial flow chart of an exemplary algorithm in accordance with the present embodiment is shown. The step (b2) of calculating the uplink delay time includes, for example, the following steps. First, as step (b21), based on the values D'u'Ny, Ng2, and Ng3, the frame length of each frame and the maximum value of the uplink delay time are calculated. Then, as in step (b22), the global index of the earliest winding operation ready time is calculated based on the global index fK of the earliest returning down slot and the delay time of the transmitting station. Then, as in step (b23), the global index of the earliest uplink operation ready time is corrected based on a global index offset. Then, as in step (b24)', the uplink delay time is calculated based on the maximum value of the uplink delay time, the length of the frame, and the global index of the earliest winding operation ready time after correction. For example, steps (b21)-(b24) can be expressed by the following equation: (fK + Tms + l + Ng3) modp + U + Ngl + 3⁄4 + Ng3) (14) where K is the second u-winding The global index of the slot, Dui for this uplink delay time ' ί κ is the earliest return global index of the downlink slot; Tros for this 33 200945815 1 TT r\ transmission station delay time; D + U + Ngl + Ng2 + Ng3 The frame length of each frame. Degree; D+Ngl+Ng2+Ng3 is the maximum value of the uplink delay time. fk+Tms+l is the global index of the earliest uplink operation ready time. n This is the global index. Offset; fK+Tms+l+Ng3 is the global index of the earliest 1-chain operation ready time after correction. Applying this global index offset (=Νρ) to correct the global index of the earliest uplink operation ready time (=fK+Tms+1) and perform a remainder operation relative to the frame length (Mod Operation). At this point, the earliest winding operation ready time is found - the distance dt' is used to indicate the distance between the time slot and the previous winding time slot before the earliest winding operation is ready. For example, fK is equal to 21, Tms is equal to 6, the global index of the earliest winding operation ready time is equal to 28, and the corresponding distance dt is equal to 0 (=28+2 mod 10), indicating that this earliest winding operation is ready before time. The distance between one time slot (k=27) and the previous winding time slot (k=27) is one time slot. This maximum delay time is obtained by subtracting the maximum value of the uplink delay time (= D + Ngl + Ng 2 + Ng 3 = 7) from the distance = 0). Referring to Figure 18, there is shown a partial flow chart of an exemplary algorithm in accordance with the present embodiment. The step (b1) for calculating the earliest returning to the lower chain time slot includes, for example, the following steps. First, as step (bn), corresponding to the harq program of the u-th up key time slot output data packet, the corresponding chain delay time is calculated. Then, as step (bl2), the earliest returning time slot is determined based on the downlink delay time and the delay time of the shuttle. Referring to Figure 19, a partial flow chart of an exemplary algorithm in accordance with the present embodiment is shown. The step of determining the earliest returning of the downlink packet <bl2) includes, for example, the following steps. First, as step (bl2a), the global index of the earliest downlink operation ready time is calculated according to the global index of the last 34 200945815 winding time slot and the delay time of the shuttle. Then, as step (bl2b), a global index of the earliest downlink operation ready time after the delay is calculated based on the global index of the u-th winding time slot, the delay time of the shuttle station, and the downlink delay time. Then, as step (bl2c), the earliest return chain time slot is set to the time slot corresponding to the global index of the earliest downlink operation ready time and the maximum value of the global index of the earliest downlink operation ready time after the delay. For example, 'step (bl2a)-(bl2c) can be expressed by the following formula: ❹ f^maxiK + Rbs + i'K + R^+Dm+l} (15) where 'K is the u-th winding time slot The global index; fK is the earliest return global index of the downlink time slot; Rbs is the delay time of the shuttle station; 〇 (11 is the downlink delay time; K+Rbs+1 corresponds to the global order of the earliest downlink operation ready time Index; K+Rbs+Ddl+1 corresponds to the earliest downlink operation ready time after this delay. Please refer to Fig. 20, which shows a partial flow chart of an exemplary algorithm according to an embodiment of the present invention. The step (b11) of the chain delay time includes, for example, the following steps. First, as step (blla), the frame length of each frame and the delay time of the downlink are calculated according to the values D, ϋ, Ngi, Ng2, and Ng3'. a maximum value. Then, as step (bllb), according to the global index of the u-th winding time slot and the delay time of the shuttle station, an earliest downlink operation ready time is calculated. Then, as in the step (bile), according to a global index The offset corrects this earliest downlink operation ready time. After that, as step (blld) 'root According to the maximum value of the downlink delay time, the length of the frame, and the earliest downlink operation ready time after the correction, the downlink delay time is calculated. For example, the step (blla)-(blld) can be as follows. Representation: 35 (16) 200945815

TW5395PA

DrCU+WNJ- (K+Rbs +1 + U+Ng2 +Ng3)mod^) + U+Ngl +Ng2 +Ng3) where 'K is the global index of the u-th winding time slot; Rbs is the pick-up Delay time; Ddl is the downlink delay time; D+U+Ngl+Ng2+Ng3 is the frame length of each frame; U+Ngl+Ng2+Ng3 is the maximum value of the downlink delay time; K+Rbs +1 is the global index of the earliest downlink operation ready time; U+Ng2+Ng3 is the global index offset; K+Rbs+1+U+Ng2+Ny is the corrected next key operation ready time Global index. 〇 Similar to the previous application global index offset (= Ν 0) to correct the earliest uplink operation ready time, where this global index offset (= U + Ng + Ng3) is applied to correct this earliest downlink operation The global index of the ready time (=K+Rbs+1) and the operation of the thief relative to the length of the frame, corresponding to the earliest downlink operation ready time to find a distance, to indicate the earliest downlink The distance between a time slot and the previous lower keyway before the operation ready time. 〇

In the other examples, the case where the parameter Na _ has the value i is taken as an example '^ and the parameter Να·μαρ may have other values. Please refer to FIG. 2: a schematic diagram of another frame according to this embodiment. Signal: FM ° downlink time slot, in which each α-μαρ downlink time slot includes a time slot with a configuration information of the reply resource configuration, and the parameter Να_μαρ is a natural number. Next, in the frame structure illustrated by the example, 舛瞀+ and weeks are not the same: the detailed operation of the chain delay time. The 局λαΓ参第22图' L shows a partial flow chart of the exemplary algorithm according to the present embodiment.篦22圄, the process steps of Figure 22 are different from the steps of 36 200945815 shown in Figure 18, which consists of step (bl3) before step (bll,) 'Redefined value D according to this parameter NA_MAP For 〇·, and redefine the value Ng2 to N'g2. Then, as step (ΜΓ), corresponding to the HARQ program, the corresponding lower chain delay time is calculated according to the values D, N, g2, U, Ngl, Ng3 and the delay time of the shuttle. The step of redefining the value D to D' according to the parameter Na-MAP and redefining Ng2 to N'g2 can be expressed by the following formula: D'=D-(D_l)modNA._ (17) © N'g^Ng^D -UmodNA^p (18) Then, as in step (bl4), the time slot offset is calculated based on this downlink delay time and this parameter NA_MAP. Then, as step (bl2'), the earliest returning time slot is determined based on the downlink delay time, the slot offset at this time, and the delay time of the shuttle. Referring to Figure 23, a partial flow chart of an exemplary algorithm in accordance with the present embodiment is shown. In Fig. 23, the detailed steps (bl2b') and (bl2c,) of step (bl2) are respectively similar to the steps (bl2b) and ❹ (bl2c) shown in Fig. 19; and the steps (bl2a·) and steps ( Bl2a) differs in the step (bl2a') by referring to the slot offset at this time to calculate the global index of the earliest downlink operation ready time. For example, the steps (12a,)-(12c,) can be expressed by the following formula: fK^maxlK + R^+l + w, K + Rbs+0^+1} (19) K for this u-th winding The global index of the time slot; 0, the delay time of the lower key 'Rbs is the delay time of the shuttle station; w is the global index of the slot offset 'K+Rbs+l+w corresponding to the earliest downlink operation ready time ; K+Rbs+D'dl+1 corresponds to the earliest downlink operation ready time after this delay. 37 200945815

The TW5395FA step (bl4) of calculating the slot offset at this time includes, for example, the following steps. When the downlink delay time is greater than 〇, the slot offset has a value of 0; when the downlink delay time is greater than 〇, the value of the slot offset is determined by the lower key delay time and the parameter NA-MAP. . The foregoing step of calculating the slot offset at this time can be expressed by the following formula: w = 0 if D'dl >0; w = (2 + D% ) 111 〇 muscle tear) if D, ^ 〇 (20) w Time slot offset; D'dl is the downlink delay time. Referring to Figure 24, there is shown a partial flow chart of an exemplary algorithm in accordance with the present embodiment. In Fig. 24, the detailed steps (blla)-(blld) in the step (Μ1) are respectively similar to the steps shown in the second drawing, and the difference is in the step (bUa, ) based on the values u, Ngi,

Ng3 and D, and N, g2, which are redefined by the parameter ΝΑ·ΜΑΡ, calculate the maximum value of the downlink delay time and the frame length of each frame; the step (bllc,) is based on the equal value U+N'gdNg3 The global index offset is used to correct the earliest downlink operation ready time calculated by the step (bllb'). For example, the aforementioned step (b 11 a')-(b 11 d') for calculating the delay time of the lower key can be expressed by the following formula: D'dl = [(U+Ngl+N'g2+Ng3)- (K+Rbs +l + U+N, g2+Ng3) mod(D, +U+Ngl +N'g2+Ng3) (21) where K is the global index of the u-th winding time slot; Rbs For this reason, the delay time of the shuttle station; D'dl is the delay time of the downlink; D'+U+Ngl+N, g2+Ng3 is the frame length of each frame; U+Ngl+N'g2+Ng3 for this The maximum value of the chain delay time; K+Rbs+1 is the global index of the earliest downlink operation ready time; 1;+>1'§2+1^3 is the global index offset; 38 200945815 Κ+ '+1 + U+N, g2+Ng3 is the global index of the earliest downlink operation ready time after correction. In an example, the exemplary algorithm of this embodiment is further used to calculate a parameter FK for indicating the ninth uplink time slot in the 1-1st frame and the earliest return chain time slot. One of the reply delay times. For example, the step of calculating this parameter FK is similar to the previous step of calculating the earliest return time of the down key, and can be expressed by the following formula: FK = max{Rbs + l + w, Rbs + D.dl + l} (22) ❹ w = 0 if D'dl >0; w = (2 + D'dl ) mod(NA.MAP) if D'dl < 0 D'di = [(U+Ngl+N'g2+Ng3) - (K+Rbs +l+U+N'g2+Ng3)modp+U+Ngl +^+3⁄4) D'=D-(Dl)modNA._ N'g2 = Ng2 + (D - UmodNA-MAp In an example, the exemplary algorithm of this embodiment is further used to calculate a parameter RTK for indicating one of the u-th winding time slot of the second frame and the earliest retransmission time slot. Return delay time. For example, the step of calculating this parameter RTK can be expressed by the following formula: RTfN + CD + WN, N + K-(gl^tNg2) (23) where N is calculated in the foregoing step (e) Set the number of these HARQ programs; K is the global index of the u-th uplink time slot; N indicates the number of these HARQ programs, in other words, the time slot below the u-th winding time slot to the corresponding The number of time slots above the slot when retransmitting the chain; D+Ngi+Ng2+Ng3 indicates the non-winding slot in each frame (including when the chain is down) Slot 39 2009s^ and intervening slots) N + K-

The number of pivots in the U-th winding is corresponding to the retransmission of the slot. In this way, according to the number of frames experienced between the non-winding time slot and the U-up chain corresponding to the U-up chain, the number of slots can be multiplied by the number of slots. When the retransmission is on the chain, the non-winding between the slots is not based on the number of slots between the slots in the slot from the u-up key to the corresponding retransmission, and the U-th winding slot The number of the oldest troughs to the corresponding retransmission chain is '<added to obtain the backhaul delay time between the slot of the uth uplink and the slot of this & However, it has been described above, although the present invention has been disclosed in the preferred embodiment as above, and is not limited to the present invention. It is within the spirit and scope of the present invention to be able to make various patents within the scope of the present invention: ~2 This: The scope of protection is subject to the attached application [Simple figure;]. ❹ The time of the round is traditionally used in the signal flow using the 1 HARQ program for transmission = the flow chart for the transmission using multiple HARQ programs for the test. Synchronous HARQ signal for TDD communication system towel 40 200945815 X TT ΓΛ. Figure 5 shows the signal flow chart of synchronous HARQ for multiple HARQ programs in TDD system. Figure 6A is a block diagram showing an example of a wireless communication system. Figure 6B is a block diagram showing an example of a base station structure. Figure 6C is a block diagram showing an example of a subscriber station structure. Figure 7 is a flow chart showing an example of using a TDD synchronization mechanism in a TDD frame structure in accordance with some embodiments of the present invention. FIG. 8 is a flow chart showing an example of using a TDD synchronization mechanism in a TDD frame structure in accordance with some embodiments of the present invention. FIG. 9 is a flow chart of a system according to some embodiments of the present invention. The system implements an exemplary algorithm for determining the number of HARQ programs to be set by a subscriber station. In a wireless communication system. Figure 10 is a flow chart of a system. The system implements an exemplary algorithm to determine a HARQ procedure in accordance with the HARQ return data transmitted by the chain time slot. Figure 11 is a block diagram of a wireless communication system in accordance with an embodiment of the present invention. Figure 12 is a flow chart of a system in accordance with some embodiments of the present invention. Figure 13 is a flow chart showing an exemplary algorithm in accordance with the present embodiment. Figure 14 is a partial flow diagram showing an exemplary algorithm in accordance with the present embodiment. Figure 15 is a partial flow diagram of an exemplary algorithm in accordance with the present embodiment. Figure 16 is a partial flow diagram showing an exemplary algorithm in accordance with the present embodiment. Figure 17 is a partial flow diagram showing an exemplary algorithm in accordance with the present embodiment. Figure 18 is a partial flow diagram showing an exemplary algorithm in accordance with the present embodiment. Figure 19 is a partial flow diagram showing an exemplary algorithm in accordance with the present embodiment. Figure 20 is a partial flow diagram of an exemplary algorithm in accordance with an embodiment of the present invention. FIG. 21 is a schematic diagram showing another frame according to the embodiment. Figure 22 is a partial flow diagram showing an exemplary algorithm in accordance with the present embodiment. Figure 23 is a partial flow diagram showing an exemplary algorithm in accordance with the present embodiment. Figure 24 is a partial flow diagram showing an exemplary algorithm in accordance with the present embodiment. [Main component symbol description] 100, 900: frame 102: transmission time interval 104: uplink subframe 106, 514: downlink subframe 108: downlink point 200945815 1 yn 110: uplink transmission 112: uplink point 114 : Downlink transmissions 206, 702, 702': HARQ receivers 202, 704, 704': HARQ transmitters 204, 212, 302, 306, 402, 404, 500, 502, 504, 518, 716, 718, 810, 814, 818, 822, 824, 826, 830, 902, 906: data packet Ο 204': retransmitted data packet 208 · ACK signal 210, 304, 400, 406: acknowledgment signal 408: delay 508, 510, 820 828, 904: Return (confirmation signal/denial signal) 506 Base station delay time cIbs 512 Downlink delay dDL2 516 Downlink delay dDL3 706 Time slot i!~i4, 708: Winding time slot 600: Wireless communication system 610: Core network 620, 620a, 620b: radio network controller 630, 630a~630e: base station 640, 640a~640f: subscriber station 631, 641: central processing unit 632, 641: random access memory 43 200945815 1 W3JWA * 633, 643: Read-only memory 634, 644: Memory 635, 645: Library 636, 646: input/output devices 637, 647: interface 638, 648: antenna 710: downlink time slot 711: frame 712: available time slot 714: HARQ program identification code 802 to 808: HARQ program 1002: Base station delay time dbs a: number of slots used for winding in the frame b: number of slots for the lower chain in the frame i: a certain time slot

Fi: the data packet transmitted in time slot i, which returns to the downlink time slot. The HARQ program that transmits the data packet in time slot i, the next one 〇 the transmission time slot of the data packet

Ni : number of slots in the time slot from time slot i to Ti-1 dss : user station processing delay time dBS : base station processing delay time 44

Claims (1)

200945815 1 w VII. Patent application scope: 1. A method is applied to a Time_Division Duplex (TDD) communication system for performing synchronous hybrid automatic repetition between a transfer station and a transfer station. Request (Hybrid Automatic Repeat Request, HARQ), the method includes: setting a plurality of harq programs at the transmitting station; transmitting, by the plurality of HARQ programs, a plurality of data packets to the receiving station, wherein the data packets do not include 11 11 (^ program identification information; receiving a plurality of HARQ return packets from the receiving station, to indicate whether the data packets are correctly received at the receiving station, wherein the plurality of return packets do not include HARQ The program identifies information, and wherein the plurality of HARQ return packets are received in a downlink time slot (d〇wnHnk si〇t); and the plurality of HARq return packets are mapped by the transmitting station to the plurality of HARQs The method of claim 1, wherein the transfer station is a subscriber station (SS), and the receiving The system is a base station (BS). The method of claim 1, wherein the plurality of HARQ return packets are combined in a single bit map. The method of claim 3, wherein the plurality of HARQ return packets in the bitmap are sequentially corresponding to the plurality of HARQ programs for transmitting the data related to the plurality of HARQ return packets. 5. The method of claim 2, wherein the plurality of HARQ return packets are combined in a one-dimensional image (bi_p) in the bit-chain time slot. The reception state & which is received in k and used to indicate the information of the slot Sk recognized in the uplink is determined by the following method: If k mod (a+b> = a+ 1, Bay J &amp ; {i ' where i is between k - dbs - a - 1 to k - all the time slots of dbS _1 or sk = {number is k-dbs - 1 chain time slot}, where k is the The downlink time slot, dbS is expressed as a base station delay time for the base station The data packet is processed, a is a number of slots for the up key in the frame, and b is a number of slots for the downlink in the frame. 6. The method of the item, wherein the plurality of HARQ return packets are combined in a bitmap, the bit map is received in the slot k of the downlink, and is used to indicate the slot time Sk of the winding The identified data packet is received in the receiving state of the transmitting station, and the uplink slot S is a number of slots for the uplink in a frame, a number of slots for the downlink in the frame, and It is determined by a relationship among the delay times of processing one of the data packets by the receiving station. 7. The method of claim 2, wherein the step of setting the plurality of HARQ programs further comprises determining a number n of the HARQ programs to be set, and determining according to the following manner: 200945815 1 yv jjyjrn To a} f Tt i \ V _a + b_ _a + b_ ) N = max{Nj, N( = Tt —i-bx 7; = max{ f+heart+1, Qiao+“+ (A - (F' +Heart-a) mod(a+△))+, and g = max{ (· + +1, ζ· + + (<a _ (/ + ) mod(a + 厶))+1}, where i Indicates an uplink time slot, Fi represents a return chain time slot, and is used for the data packet transmitted by slot i when it is uplinked. ❹ Ti represents a transmission time slot, and an additional data transmission is performed by the user. Transmitted by the station, and using the HARQ program which is the same as the HARQ program used to transmit the data packet in the winding time slot, Ni represents the number of slots in the winding time, and is located in the winding time slot i and immediately after Between the time slots of the slot Ti in the transmission, a is represented as a number of slots for the uplink in a frame, and b is a number of slots for the downlink in the frame, dss Indicates when a subscriber station is delayed For processing the HARQ return data at the subscriber station, and dbs indicating a base station delay time for processing the data packet at the base station. 8. The method of claim 1, wherein The step of setting the plurality of HARQ programs further includes determining the number n of the HARQ programs to be set, and determining the maximum value of one of the Nis for the slot i for an uplink, i is between i= l between the range of the number of time slots for the winding in the frame, where Nj represents the number of slots in the upper chain and is between the upper keys 47 200945815 I WDJV3KA: The time slot is between the previous-time slot, at this time - the front-line chain i, transmitted by the receiving station, and the same as the above-mentioned == transmission of the data packet - the program, where == the upper _ - the frame is used in the chain - the relationship is determined - and the number of time slots for the time slot of the frame is used by the slot 2 for the up button; ::chain: slot ^, the number of slots used to process the time at the receiving station, delay time of sending the station, used in the frame In the upper chain: - the relationship is determined: the number of slots in the chain is the delay time for the upper key, the number of frames for the message, and the time for the next button in the frame. The relationship between the number of slots (four) is determined by the relationship. 9' 专利 专利 _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ The slot, the second idle slot and the number 'and the slot, wherein U, D, ~, and Ng3 are the natural line online (4) (four) package operation method " To TtV^ circumference method according to item 9, wherein the setting is 48 200945815 X TV Λ & The steps of the plurality of HARQ programs further include: • causing one HARQ program of the HARQ programs to rotate a data packet in the u-th chain time slot of each of the frames. u is a natural number less than or equal to U, and the initial value of u is i; corresponding to the HARQ program in the HARQ program, one of the earliest retransmission time slots is calculated; according to the earliest retransmission time slot , the u-th winding time slot and the values U, D, Ngl, Ng2 and Ν§3 'calculate the u-th winding time slot and the earliest ❹ The number of slots in one of the slots when the chain is transmitted; increment u, and repeat the foregoing steps to obtain the number of slots in the 11-up winding; and calculate the HARQs to be set according to the number of slots in the u-winding The number of programs is N. 11. The method of claim 1, wherein the step of calculating the number n of the HARQs to be set comprises: setting the number N to be the largest of the number of slots on the U pen. ❹ 12. The method of claim 10, wherein the step of calculating the number of slots in the winding includes: a global index based on the u-th winding time slot (Global Index) and the earliest retransmission winding a time slot and a global index, calculating a total number of time slots between the earliest retransmission winding time slot and the uth uplink time slot, a frame index of the uth uplink time slot and The index of the frame of the earliest retransmission time slot; calculating the frame length of one of the frames and the number of non-winding slots according to the values D, U, Ngl, Ng2, and Ng3; and 49 200945815 1 WDJWA The number of the total time slots, the frame index of the u-th uplink time slot, the frame material of the earliest retransmission time slot, the signal of each of the frames, and the number of the non-winding time slots, The number of slots when winding. 13. The method of claim 10, wherein the step of retransmitting the uplink time slot at the earliest comprises: 对应 corresponding to the HARQ program in the HARQ programs, calculating one of the earliest returning downlink time slots; Corresponding to the HARQ program in the HARQ programs, calculating a corresponding one-chain delay time; and The earliest retransmission winding time slot is determined based on the earliest return chain time slot, the uplink delay time, and the transmission station delay time. The method of claim 13, wherein the step of determining the earliest retransmission time slot comprises: 计算 calculating an earliest based on the global index of the earliest returning downlink slot and the delay time of the transmitting station a global index of the chain operation ready time; Q calculating a global index of the earliest uplink operation ready time after a delay based on the global index of the earliest return downlink time slot, the transmission station delay time, and the uplink delay time; The earliest retransmission time slot is the time slot corresponding to the global index of the earliest uplink operation ready time and the maximum value of the global index of the earliest uplink operation ready time after the delay. 15. The method of claim 13, wherein the step of calculating the uplink delay time comprises: calculating a frame length of each of the frames according to the values D, U, Ngl, Ng2, and 八3' The maximum value of one of the uplink delay times; 50 200945815 calculates a global index of the earliest uplink operation ready time according to the global index of the earliest return downlink time slot and the delay time of the transmission station; and corrects according to a global index offset The global index of the earliest uplink operation ready time; and calculating the uplink delay time according to the maximum value of the uplink delay time, the frame length, and the corrected global index of the earliest uplink operation ready time. ???1 J π factory, 丨K々沄, wherein the step of calculating the earliest returning downlink time slot comprises: calculating a corresponding one downlink delay time corresponding to the HARQ program in the HARQ programs; The downlink delay time and the delay time of a shuttle station determine the early return slot time. In the method described in claim 16 of the patent application scope, the steps of returning the original slot at the earliest stage include: , ^ ❹ according to the global index of the u-th winding time slot and the calculation of the first one The global index of the chain operation ready time; late according to the global index of the U-winding time slot, == late: 'calculation, the earliest; chain operation; = the time slot corresponding to the largest value in the local index. The step of the downlink delay time as described in item 16 of the patent application scope includes: the method wherein the leaf calculation is 51 200945815 1 WDjWA calculates one of the frames according to the values D, U, Ngi, NgS a maximum value of the length and the downlink delay time; calculating an earliest downlink operation ready time according to the global index of the u-th winding time slot and the delay time of the shuttle station; correcting the earliest according to a global index offset The downlink operation ready time; and calculating the downlink delay time according to the maximum value of the downlink delay time, the frame length, and the corrected down-chain operation ready time. 19. The method of claim 13, wherein the step of determining the earliest returning to the downlink time slot comprises: redefining the value D to D according to a parameter NA-MAP, and redefining the value NgZ to N' G2' The parameter NA_MAP is used to define the d-winding time slots, and each of the Na-map downlink time slots has a downlink time slot with a reply resource configuration; corresponding to the HARQ program in the HARQ programs, Calculate the corresponding one-down delay time according to the values D', N'g2, U, Ngl, Ng2 and a delay time of the shuttle station; ^ Calculate the one-time slot offset C shift according to the downlink delay time and the parameter collision w); and according to the down key delay time, the time slot offset and the shuttle delay time, determine the earliest return chain time slot. 20. The method of claim 19, wherein the step of determining the earliest returning to the lower chain includes: a global index of the slot according to the u-th winding, the docking station extension and the time slot Offset, calculate the global order of the earliest downlink operation ready time. 200945815 1 vy index; according to the global index of the u-th winding time slot, the shuttle delay time, the time slot offset and the downlink delay Time, calculate a global index of the earliest downlink operation ready time after a delay; and set the global index of the earliest return downlink time slot to be the earliest downlink operation ready time and the earliest downlink operation ready time after the delay The maximum value in the corresponding time slot. 21. The method of claim 19, wherein the step of calculating the beta time slot offset comprises: when the downlink delay time is greater than 0, the time slot offset has a value of 0' when the next The chain delay time is greater than 0, and the value of the slot offset is determined by the downlink delay time and the parameter ΝΑ-ΜΑΡ. 22. The method of claim 19, wherein the step of calculating the downlink delay time comprises: calculating one of the frames according to the values D, U, Ngl, N'g2, and Ng3 a maximum value of the length and the delay time of the downlink; ® calculating an earliest downlink operation ready time according to the global index of the u-th winding time slot and the delay time of the shuttle station; correcting the signal according to a global index offset The earliest downlink operation ready time; and calculating the downlink delay time according to the maximum value of the downlink delay time, the frame length, and the corrected earliest downlink operation ready time. 23. The method of claim 19, wherein the step of redefining the value D to D according to the parameter NA_MAP and redefining Ng2 to N'g2 respectively comprises: 53 200945815 i * l) modA^_庸; And ~='2 + Φ - Umod is all over. 24. The method of claim 1, wherein the method further comprises: calculating a response delay time between the slot of the u-th winding and the slot of the earliest returning. 25. The method of claim 1, wherein the method further comprises: calculating a delay time between the slot of the u-th winding and the slot of the earliest retransmission. 26. A method for use in a Time-Division Duplex (TDD) communication system for performing a Hybrid Automatic Repeat Request between a transmitting station and a pick-up station (Hybrid Automatic Repeat Request) , HARQ), the method includes: receiving, at the receiving station, a plurality of data packets from the transmitting station' and from a plurality of HARQ programs, wherein the data packets do not include HARQ program identification information; The receiving station generates a plurality of HARQ return packets to indicate whether the data packets are correctly received at the receiving station, wherein the HARQ return packets do not include HARQ program identification information; and are transmitted by the receiving station at a predetermined time. The HARQ return packets are not transmitted HARQ program identification information. 27. The method of claim 26, wherein the transmitting station is a subscriber station (SS) and the receiving station is a base station (BS). 54. The method of claim 26, further comprising: mapping, by the receiving station, the HARQ return packets to a bitmap, and using a predetermined configuration (configUrati) 〇n), wherein the bit map does not contain HARQ program identification information, and wherein the step of transmitting the HARQ return packets includes transmitting the bit map to the transmitting station at the predetermined time. 29. The method of claim 28, wherein the HARQ return packets are received in a slot k of the chain, and the data identified by the slot sk is indicated to be packetized to the base station The receiving state, the heart is determined by the following way: If k mod 〇 + b) = a + 1, Bay J & - {i, where i is between k - dbs - a - 1 to k - dbs ~ ~ i All of the upper key slots}; s otherwise ❹ sk - {number is k-dbs-1 upper chain time slot}, where k is the lower chain time slot, and dbs is represented as a transfer station delay time for Processing the received data, 疋0 a is the number of time slots used for the uplink in the frame, and b is not a number of slots for the downlink in the frame. , US 2 2, please refer to the method described in item 27 of the patent scope, including by the base. The number of ηα set by the user station is determined according to the following method: One of the V orders Ν = maX{Ni, i = 1 to a}, 55 200945815 1 W^iVM^A _ZL a + ba + ba)m_+(9)+1}, and € _ 咖屯+ 4 + 丄'z + 4 + Ο - (/ + 〇mod(a + Z〇) +1}, where i represents an up key slot, Fi indicates that the back-slot time slot is used for the data packet transmitted by slot i when it is uplinked. It is not a transmission time slot. At this time, an additional data transmission is transmitted by the user σ, and the same is used. In the HARQ program for the data packet in the slot key, the number of slots in the slot is not displayed, and is in the slot i and the slot Tj immediately before the slot. Between one time slot, a is a number of slots for the uplink in a frame, b is not a number of slots for the downlink in the frame, and dss indicates a delay time of the subscriber station. For processing the HARQ return data at the subscriber station, and Λ dbs indicating a base station delay time for processing the data packet at the base station. The method of claim 26, wherein: the transmission operation slot between the transfer station and the transfer platform is defined as a plurality of frames, each of the frames including xj uplink time slots, d a downlink time slot, Ngl first-idle time slots, Ng2 second idle time slots, and Ng3 third idle time slots, wherein the HARQ program transmission corresponds to the The operation of the data packet 56 200945815 is in the slot of the winding, and the frame is more suitable for the HARQ receipt. Please execute the method in the lower chain slot. The steps of the plurality of HARQ programs include: 疋 令 该 该 该 该 该 该 该 H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H H 'Turn out a data packet, uA is less than or equal to the natural number of ϋ, the starting value of u is 1; Corresponding to the HARQ program in the HARQ program, one of the earliest retransmission time slots is calculated; according to the earliest retransmission time slot, the uth upper key time slot, and the values U, D, Ngl, Νρ And calculating a number of time slots between the slot in the u-th winding and the slot in the earliest retransmission; incrementing u' and repeating the foregoing steps to obtain the number of slots in the au pen; and according to the The number of slots in the U-pen up time slot is calculated by the number N of one of these HARq programs. 33. The method of claim 32, wherein the step of calculating the number n of the HARQs to be set comprises: setting the number N to be the largest of the number of slots in the U-pen. 34. The method of claim 32, wherein the step of calculating the number of slots in the winding includes: a global index based on the u-th winding time slot (Global Index) and the earliest retransmission chaining a global index of the slot and the total number of time slots between the earliest retransmission time slot and the U uplink time slot, a frame index of the uth upper key time slot, and the frame index The earliest retransmission of the chain time slot 57 200945815 frame index; according to the values D, U, Ngl, NgZ and Ng3 calculate the frame length of each of the frames and the number of non-winding slots; and according to the total time The number of slots, the frame index of the u-th uplink time slot, the frame index of the earliest retransmission time slot, the frame length of each of the frames, and the number of the non-winding slots, The number of chain slots. 35. The method of claim 32, wherein the step of calculating the earliest retransmission time slot comprises: corresponding to the HARQ program in the HARQ programs, calculating one of the earliest return chains of the response a time slot; corresponding to the HARQ program in the HARQ processes, calculating a corresponding one-chain delay time; and determining the earliest weight according to the earliest return downlink time slot, the uplink delay time, and a transmission station delay time Pass the key slot. 36. The method of claim 35, wherein the step of determining the earliest retransmission time slot comprises: calculating a global index based on the earliest return downlink time slot and the delay time of the transmission station The global index of the earliest uplink operation ready time; the global index of the earliest uplink operation ready time after a delay is calculated according to the global index of the earliest return downlink time slot, the transmission station delay time, and the uplink delay time; The earliest retransmission uplink time slot is a time slot corresponding to the global index of the earliest uplink operation ready time and the largest value in the global index of the earliest uplink operation ready time after the delay. 37. The method of claim 35, wherein the step of calculating the 58 200945815 * 1 yy on-chain delay time comprises: counting the nose according to the values D, U, Ngl, N, χ χ 丄 丄 g1 Wg2 and Nw The maximum length of each frame frame and the uplink delay time; according to the global index of the earliest return downlink time slot and the delay time of the transmission station, the global index of the earliest up key operation ready time is calculated. Correcting a global index of the earliest uplink operation ready time according to the global index offset and a global index according to the material large value of the ship arrival time, the pure length, and the corrected earliest winding operation ready time after the correction, Calculate the up key delay time. 38. The method of claim 35, wherein the step of calculating the earliest returning downlink time slot comprises: μ calculating a corresponding one of a downlink delay time corresponding to the HARQ program in the HARQ processes; The delay time of the downlink and the delay time of the shuttle station determine the earliest return to the lower time slot. 39. The method of claim 38, wherein the step of determining the earliest return time slot comprises: calculating the earliest time according to the global index of the u-th winding time slot and the delay time of the shuttle station a global index of the chain operation ready time; a global index based on the global index of the U-up time slot, the delay time of the shuttle station, and the delay time of the delay--the full index of the earliest downlink operation ready time after the delay, and setting The earliest returning chain time slot is a time slot corresponding to the maximum value in the index of the restaurant index of the earliest downlink operation ready time and the earliest downlink operation ready time after the delay. 40. The method of claim 38, wherein the step of downlink delay time comprises: ° calculating a frame length of each of the frames according to the values D, U, Ngl, %, and % a maximum value of the chain delay time; calculating an earliest downlink operation ready time according to the global index of the u-th winding time slot and the shuttle station delay; correcting the earliest downlink operation by the door data-global index offset When ready The first step of returning the downlink time slot includes: calculating the downlink delay time according to the maximum value of the downlink delay time, the pure length, and the earliest lower_wei__. 41. The method according to item 5% of the patent application, wherein the decision is based on the parameter ΝΑ·ΜΑΡ to re-define the value D to D, and to redefine the value Ng2 to be N'g2 'the parameter Namap is used to receive the d In the up key slot, there is a downlink time slot in each of the NA_MAP downlink time slots with a reply resource configuration; corresponding to the HARQ program in the HARQ programs, according to the values D, N g2, U, Ngl, Ng2 And a delay time of the shuttle station is calculated corresponding to one of the downlink delay time; according to the downlink delay time and the parameter I·, the one-time slot offset (w) is calculated; and according to the downlink delay time, the time slot offset And the delay time of the transfer desk, determine the earliest return time slot. 42. The method of claim 5, wherein the step of determining the 60 I 200945815 i vy earliest returning to the downlink time slot comprises: the global index of the ready time of the shuttle station delay according to the U-th winding time slot Between the global cable and the time (four) shift, the calculation - the earliest down key operation is based on the U-th up key, the global index between the slots, the time-frequency shift, the chain, the fa1 if I delay, the down-chain operation ready time Global index; and the earliest setting of the earliest return chain time slot after the delay of β舁 43. The method of claim 41, wherein the step offset is 〇, when the downlink delay time is greater than 〇, the time slot offset 〇, when the downlink delay time is greater than 0, the value of the time slot offset is determined by the key delay time and the parameter ΝΑ·ΜΑΡ. The method of claim 41, wherein the step of calculating the downlink delay time comprises: calculating each according to the values 〇', 1;, :^^1, >^2 and 1^3 One of the frame lengths of the frames and the maximum of the downlink delay time; calculating an earliest downlink operation ready time according to the global index of the u-th winding time slot and the delay time of the shuttle station; The global index offset corrects the earliest downlink operation ready time; and calculates the downlink delay time according to the maximum value of the downlink delay time, the frame length, and the corrected earliest downlink operation ready time. 61 200945815 1 w^yom λ 45. The method of claim 5, wherein the step of re-defining the value D to D according to the parameter NA_MAP, and redefining Ng2 to be N, g2 respectively comprises: £) '= £)-(/)-1)111〇£1%_ see; and + Φ -1) mod 〇46. The method of claim 26, which further includes: counting from the uth One of the delay time between the winding time slot and the slot when the earliest returning to the lower chain. ❹ 47. The method of claim 26, wherein the method further comprises: s calculating a backhaul delay time between the slot of the u-th key and the slot of the earliest retransmission. 48. A method, applied to the time division duplex (TimeDivisi〇n DUpleX, TDD) communication system, the system is set up between the transmission station and a shuttle station to set up a synchronous hybrid automatic repeat request (Hybrid Automatic Repeat Request, HARQ) program, the method includes: 决定 determining - returning time slot Fi 'where the return time slot is one time slot for the receiving station to provide - HARQ return data, and corresponding to the transmitting station on one The chain slot i is transmitted to a data packet of the receiving station by using a HARQ program; determining a transmission time slot Ti', wherein the transmission time slot is a HARQ program for the transmitting station to transmit the data packet in the time slot i, The transmission time slot of the next data packet; 决定 determines the number Ni of the slot in the winding, and is between the time slot i 62 200945815 Λ. »Τ /1 and immediately before the transmission time slot Tj Between the slots; and setting the number N of one of the HARQ programs to be one of the maximum values of Ni, i is between a and a, where a is a number of slots for the uplink in a frame. 49. The method of claim 48, wherein the transmitting station is a subscriber station (SS), and the receiving station is a base station (BS) 〇 50. The method of claim 49, wherein the returning slot Fj is used for the data packet transmitted by the slot i during the winding, and the system is determined according to the following manner: 巧=max{ 4 4 +1, / + "+ (α - (/· + 〇m〇(j(a + do))) + 〇, where dbs represents a base station delay time' for the base station to process the data packet, And b is a number of time slots for the downlink in the frame. The method of claim 50, wherein the transmission time slot Ti is determined according to the following manner: ^ = max{ β + <4 + Θ+( + (FfK* - a) mod(a+(9)+1}, where dss represents a subscriber station delay time') is used by the subscriber station to process the HARQ return data. The method of claim 51, wherein the number of the winding time slots is between the winding time slot i and the time slot before the transmission time slot Ti, and It is determined by the following methods: a + b 53. The method described in claim 48 of the patent application, including the decision of the receiving station by 63 200945815 - the use of the harq program to identify The plurality of HARQs are selected at the transfer station, and the transfer station generates the data #package corresponding to the information received by the slot parent. The HARQ program identification code is determined according to the following manner. : HARQ program identification code sjx-Ax, where •jy a represents a number of time slots for the uplink in a frame, and b represents a number of time slots for the downlink in the frame. a wireless communication station for wireless communication in a Time Divisi〇 Duplex (TDD) communication system, the wireless communication station comprising: at least one memory for storing data and instructions; and at least a processor configured to access the memory and configured to perform the following steps when executing the instruction: setting a plurality of HARQ programs; transmitting the plurality of data packets by using the plurality of HARQ programs, wherein the data packets are The HARQ program identification information is not included; and a plurality of HARQ return packets are received to indicate whether the data packets are correctly received, wherein the plurality of return packets do not include HARQ program identification information. And wherein the plurality of HARQ return packets are received in a downlink slot; and mapping the plurality of HARQ return packets to the plurality of HARQ programs. 55. The wireless communication station, wherein the plurality of HARQ return packets are combined in a one-bit bitmap 64 200945815 1 wjjyjr/v. 56. The wireless communication station of claim 55, wherein the plurality of HARQ return packets in the bit map are sequentially corresponding to the plurality of HARQ programs for transmitting related to the harq Return the data packets of the packet. 57. The wireless communication station of claim 54, wherein the wireless communication station is a subscriber station (ss), wherein the HARQ return packets are received in slot k when the key is down. And with © to indicate the reception status of the data packet identified by the slot time Sk, Sk is determined by the following method: If kmod(a+b) = a+l, !! Sk {i, where i is K— dbs— a—1 to k—all the time slots of dbs_ 1}; otherwise, Sk = · {number is k—dbs—1 chain time slot}, where k is the time slot of the chain, Dbs is expressed as a base station delay time for processing the data packet at a base station, a denotes a number of time slots for uplinking in a frame, and b denotes that the frame is used for downlink A number of slots at that time. 58. The wireless communication station according to claim 54, wherein the wireless communication station is a Subscriber Station (SS), and the action of setting the plurality of HARQ programs further comprises determining that the wireless communication program is to be set. The number of these HARQ programs is N and is determined according to the following way: N = max{Ni,i = 1 to a}, 65 200945815 / -T. — i — bx a + ba + b 忑—max{巧+ Exception +1, β + hair + (do - a) mod (j + △)) +1}, and i represents a winding time slot, Fi represents a returning chain time slot, used for - winding time slot Transmitting the data packet, Ti denotes a transmission time slot, at which time an additional data transmission is transmitted by the subscriber station, and the same HARQ procedure as used in the uplink time slot for transmitting the data packet is used. ❹ A indicates the number of slots in the upper chain, and is between the slot i and the slot immediately before the transmission, and a is not used in the frame for the winding. a number of time slots, and b is a number of slots for the downlink in the frame, dss means - user extension The late time is used to process the HARQ return data for the customer base, and the dbs table does not have a base station delay time data packet. 'Communication system for processing the 〇59.-Wireless communication station, Duplex, TDD) for one base station includes: For one-time duplex (Time-Division wireless communication, the wireless communication station at least one memory The body is used to store data and instructions; and to >, the processor, the settings are used to access the time to perform the following steps: Silk binding refers to π receiving a plurality of data blocks from a plurality of HARQ turns 66 200945815 X TT i packet, wherein the data packets do not include HARQ program identification information; generating a plurality of HARQ return packets to indicate whether the data packets are correctly received, wherein the HARQ return packets do not include a HARQ program Identifying the information; and transmitting the HARQ return packets at a predetermined time, and not transmitting the HARQ program identification information. 60. The wireless communication station of claim 59, wherein the at least one processor is further configured to set Mapping the HARQ responses to a bitmap, and using a predetermined configuration, wherein the bitmap is not included The HARQ program identification information is included, and wherein the HARQ return packets are included in the bit map to be transmitted. 61. The wireless communication station according to claim 59, wherein the wireless communication station is a base Base station (BS), and wherein the HARQ return packets are received in the slot k of the downlink, and are used to indicate that the data identified by the slot Sk in the uplink is encapsulated in the receiving state of the base station, Sk is determined by the following methods: If km〇d(a+b) = a+l, Bay 1J sk = {i ' where i is all between k-dbs-a-1 to k-dbs-1 Chain time slot}; otherwise sk = {number is k-dbs-1 upper chain time slot} 'where k is the lower key time slot, dbs is expressed as a base station delay time' to process the received data, 67 200945815 i WDJvom a denotes a number of time slots for the up key in a frame, and b denotes a number of time slots for the down key in the frame. 62. The wireless communication station, wherein the wireless communication station is a base station (BS), and The at least one processor is further configured to determine the number N of the HARQ programs set by a subscriber station (SS), and is determined according to the following manner: N = max{Ni, i = 1 to a } =T( ~i-bx _ZL a + ba + b [=max{ β + ( +1, Qiao + ( + (do - (F, + especially - α) πιοφ + (9) +1}, and β = max{ '·, · + +1, '· + + ( "一(,· + 4 ) m〇d(a + Z〇) +1}, where i denotes an up-chain time slot, Fi denotes a return-down chain time slot, which is used for slot-up when a winding is applied The data packet represents a transmission time slot, and an additional data transmission is transmitted by the wireless communication station, and the HARQ program is the same as that used in the uplink time slot to transmit the data packet. , Ni represents the number of slots in the winding, and is between the slot i and the slot immediately before the slot Ti, a is represented by a frame for winding a number of slots, b is a number of slots for the downlink in the frame, dss represents a subscriber station delay time for processing the HARQ return data for the subscriber station, and dbs indicates a base station delay Time, used to receive the data packet received by the wireless communication station at 68 200945815 _ 袅TV 1 l. 63. A transmission station 'applies to a time division duplex (Time-Division Duplex) In the communication system of TDD), the system has a receiving station, the transmitting station includes: at least one memory 'for storing data and instructions; and at least one processor' setting to access the memory, and when executing the instruction It is further configured to perform the following steps: determining a return time slot Fi, wherein the return time slot Fi is a slot for the receiving station to provide one of the HARQ return data, and corresponding to the transmitting station in a winding time slot i is transmitted to a data packet of the receiving station by using a Hybrid Automatic Repeat Request (HARQ) program; determining a transmission time slot Ti, wherein the transmission time slot Ti is the transmitting station at the time slot i The HARQ program for transmitting the data packet, the transmission time slot of the next data packet; and the number Ni of the slot when determining the winding, and the Φ slot i and the slot immediately before the transmission Between one time slot; and one of the HARQ programs, the number N is one of the maximum values of Ni, and the i is between b and 1 a, where a is a number of time slots for the up key in a frame. 64. If you apply for a special The transmitting station of claim 63, wherein the transmitting station is a subscriber station (SS), and wherein the returning downlink slot Fi is used for the data packet transmitted by the slot i , and is determined according to the following way: g = maxU + + L + + 0 — + ) mod(a + 6)) +1}, where 69 200945815 i WDJVDrA dbs represents a base station delay time for the reception The station processes the data packet, wherein the receiving station is a base station, and b represents a number of slots for the downlink in the frame. 65. The transfer station of claim 63, wherein the transfer station is a Subscriber Station (SS), and wherein the transfer time slot is determined according to the following manner: T^maxk+^+ lJ+^+p-CFVK^-emodp+^+l}, where Dss represents a subscriber station delay time for processing the HARQ return data for the subscriber station, and b represents a number of slots for the downlink for the downlink. 66. The transfer station of claim 65, wherein the number Ni of the winding time slots is between the winding time slot i and the time slot before the transmission time slot, and Determined by: Nt = Ti-i - bx _Ά_ a + ba + b 70