WO2021007796A1 - Signalisation intégrée d'accusés de réception harq - Google Patents

Signalisation intégrée d'accusés de réception harq Download PDF

Info

Publication number
WO2021007796A1
WO2021007796A1 PCT/CN2019/096282 CN2019096282W WO2021007796A1 WO 2021007796 A1 WO2021007796 A1 WO 2021007796A1 CN 2019096282 W CN2019096282 W CN 2019096282W WO 2021007796 A1 WO2021007796 A1 WO 2021007796A1
Authority
WO
WIPO (PCT)
Prior art keywords
bits
sequence
transmission block
transmission
determining
Prior art date
Application number
PCT/CN2019/096282
Other languages
English (en)
Inventor
Haiyou Guo
Original Assignee
Nokia Shanghai Bell Co., Ltd.
Nokia Solutions And Networks Oy
Nokia Technologies Oy
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nokia Shanghai Bell Co., Ltd., Nokia Solutions And Networks Oy, Nokia Technologies Oy filed Critical Nokia Shanghai Bell Co., Ltd.
Priority to CN201980098506.1A priority Critical patent/CN114175541A/zh
Priority to PCT/CN2019/096282 priority patent/WO2021007796A1/fr
Publication of WO2021007796A1 publication Critical patent/WO2021007796A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H04L1/1614—Details of the supervisory signal using bitmaps
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0072—Error control for data other than payload data, e.g. control data
    • H04L1/0073—Special arrangements for feedback channel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1822—Automatic repetition systems, e.g. Van Duuren systems involving configuration of automatic repeat request [ARQ] with parallel processes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/20—Arrangements for detecting or preventing errors in the information received using signal quality detector
    • H04L1/203—Details of error rate determination, e.g. BER, FER or WER

Definitions

  • Embodiments of the present disclosure generally relate to the field of telecommunication and in particular, to methods, devices, apparatuses and computer readable storage media for integrated signaling of Hybrid Automatic Repeat reQuest (HARQ) acknowledgements.
  • HARQ Hybrid Automatic Repeat reQuest
  • the signaling of HARQ acknowledgement is an indispensable component of retransmission protocol.
  • Most of wireless systems including 3GPP Long Term Evolution (LTE) and New Radio (NR) adopt HARQ with soft combining, relying on a combination of error-correcting coding and retransmission of erroneous data units.
  • the HARQ provides robustness against transmission errors and maintains multiple parallel stop-and-wait processes.
  • the receiving device Upon receipt of a transport block, the receiving device tries to decode the transport block and informs the transmitting device about the outcome of the decoding operation through a single acknowledgment bit indicating whether the decoding was successful or if a retransmission of the transport block is required.
  • MAC Media Access Control
  • NR a large transport block is segmented into multiple code blocks prior to coding.
  • each code block is configured with its own 24-bit CRC. Since each code block has its own CRC, errors can be detected on individual code blocks as well as on the overall transport block, a positive acknowledgment (ACK) in the case of a successful decoding and a negative acknowledgment (NACK) in the case of unsuccessful decoding.
  • ACK positive acknowledgment
  • NACK negative acknowledgment
  • a receiving device feeds back a single bit indicating positive or negative acknowledgement for each transport block, code block or group of code blocks, as part of control information. In case of an erroneously received data unit, a retransmission is requested from the corresponding transmitting device.
  • example embodiments of the present disclosure provide a solution for integrated signaling of HARQ acknowledgements.
  • a first device comprising at least one processor; and at least one memory including computer program codes; the at least one memory and the computer program codes are configured to, with the at least one processor, cause the first device to determine reception states of a plurality of transmission blocks received from at least one second device; generate a sequence of bits based on the reception states of the plurality of transmission blocks such that each of the plurality of transmission blocks corresponds to one or more bits in the sequence; and transmit the sequence of bits to the at least one second device as indication of the reception states.
  • a second device comprising at least one processor; and at least one memory including computer program codes; the at least one memory and the computer program codes are configured to, with the at least one processor, cause the second device to transmit a transmission block to a first device, the first device receiving a plurality of transmission blocks at least from the second device; receive at least one portion of a sequence of bits from the first device, each of the plurality of transmission blocks corresponding to one or more bits in the sequence; and determine a reception state of the transmission block based on the at least one portion of the sequence of bits.
  • a method comprises determining reception states of a plurality of transmission blocks received from at least one second device; generating a sequence of bits based on the reception states of the plurality of transmission blocks such that each of the plurality of transmission blocks corresponds to one or more bits in the sequence; and transmitting the sequence of bits to the at least one second device as indication of the reception states.
  • a method comprises transmitting a transmission block to a first device, the first device receiving a plurality of transmission blocks at least from the second device; receiving a sequence of bits from the first device, each of the plurality of transmission blocks corresponding to one or more bits in the sequence; and determining a reception state of the transmission block based on the sequence of bits.
  • an apparatus comprising means for determining reception states of a plurality of transmission blocks received from at least one second device; means for generating a sequence of bits based on the reception states of the plurality of transmission blocks such that each of the plurality of transmission blocks corresponds to one or more bits in the sequence; and means for transmitting the sequence of bits to the at least one second device as indication of the reception states.
  • an apparatus comprising means for transmitting a transmission block to a first device, the first device receiving a plurality of transmission blocks at least from the second device; means for receiving a sequence of bits from the first device, each of the plurality of transmission blocks corresponding to one or more bits in the sequence; and means for determining a reception state of the transmission block based on the sequence of bits.
  • a non-transitory computer readable medium comprising program instructions for causing an apparatus to perform at least the method according to the above third aspect.
  • a non-transitory computer readable medium comprising program instructions for causing an apparatus to perform at least the method according to the above fourth aspect.
  • Fig. 1 illustrates an example communication network in which embodiments of the present disclosure may be implemented
  • Fig. 2 illustrates a diagram illustrating separated signaling of HARQ acknowledgements
  • Fig. 3 illustrates a flowchart illustrating an example process for integrated signaling of HARQ acknowledgements according to some embodiments of the present disclosure
  • Fig. 4 illustrates a diagram illustrating integrated signaling of HARQ acknowledgements according to some embodiments of the present disclosure
  • Fig. 5 illustrates a diagram illustrating an example process of HARQ-related information according to some embodiments of the present disclosure
  • Figs. 6A, 6B and 6C illustrate an example of generating the sequence of bits according to some embodiments of the present disclosure
  • Fig. 7 illustrates a diagram illustrating transmission of the sequence of bits according to some embodiments of the present disclosure
  • Figs. 8A and 8B illustrate an example of querying the sequence of bits according to some embodiments of the present disclosure
  • Fig. 9 illustrates a graph showing performance of the proposed solution according to some embodiments of the present disclosure.
  • Fig. 10 illustrates a flowchart of a method according to some embodiments of the present disclosure
  • Fig. 11 illustrates a flowchart of a method according to some other embodiments of the present disclosure
  • Fig. 12 illustrates a simplified block diagram of an apparatus that is suitable for implementing embodiments of the present disclosure.
  • Fig. 13 illustrates a block diagram of an example computer readable medium in accordance with some embodiments of the present disclosure.
  • references in the present disclosure to “one embodiment, ” “an embodiment, ” “an example embodiment, ” and the like indicate that the embodiment described may include a particular feature, structure, or characteristic, but it is not necessary that every embodiment includes the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described.
  • first and second etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first element could be termed a second element, and similarly, a second element could be termed a first element, without departing from the scope of example embodiments.
  • the term “and/or” includes any and all combinations of one or more of the listed terms.
  • circuitry may refer to one or more or all of the following:
  • circuitry also covers an implementation of merely a hardware circuit or processor (or multiple processors) or portion of a hardware circuit or processor and its (or their) accompanying software and/or firmware.
  • circuitry also covers, for example and if applicable to the particular claim element, a baseband integrated circuit or processor integrated circuit for a mobile device or a similar integrated circuit in server, a cellular network device, or other computing or network device.
  • the term “communication network” refers to a network following any suitable communication standards, such as Long Term Evolution (LTE) , LTE-Advanced (LTE-A) , Wideband Code Division Multiple Access (WCDMA) , High-Speed Packet Access (HSPA) , Narrow Band Internet of Things (NB-IoT) and so on.
  • LTE Long Term Evolution
  • LTE-A LTE-Advanced
  • WCDMA Wideband Code Division Multiple Access
  • HSPA High-Speed Packet Access
  • NB-IoT Narrow Band Internet of Things
  • the communications between a terminal device and a network device in the communication network may be performed according to any suitable generation communication protocols, including, but not limited to, the first generation (1G) , the second generation (2G) , 2.5G, 2.75G, the third generation (3G) , the fourth generation (4G) , 4.5G, the future fifth generation (5G) communication protocols, and/or any other protocols either currently known or to be developed in the future.
  • suitable generation communication protocols including, but not limited to, the first generation (1G) , the second generation (2G) , 2.5G, 2.75G, the third generation (3G) , the fourth generation (4G) , 4.5G, the future fifth generation (5G) communication protocols, and/or any other protocols either currently known or to be developed in the future.
  • Embodiments of the present disclosure may be applied in various communication systems. Given the rapid development in communications, there will of course also be future type communication technologies and systems with which the present disclosure may be embodied. It should not be seen as limiting the scope of the present disclosure to only the a
  • the term “network device” refers to a node in a communication network via which a terminal device accesses the network and receives services therefrom.
  • the network device may refer to a base station (BS) or an access point (AP) , for example, a node B (NodeB or NB) , an evolved NodeB (eNodeB or eNB) , a NR NB (also referred to as a gNB) , a Remote Radio Unit (RRU) , a radio header (RH) , a remote radio head (RRH) , a relay, a low power node such as a femto, a pico, and so forth, depending on the applied terminology and technology.
  • BS base station
  • AP access point
  • NodeB or NB node B
  • eNodeB or eNB evolved NodeB
  • NR NB also referred to as a gNB
  • RRU Remote Radio Unit
  • RH radio header
  • terminal device refers to any end device that may be capable of wireless communication.
  • a terminal device may also be referred to as a communication device, user equipment (UE) , a Subscriber Station (SS) , a Portable Subscriber Station, a Mobile Station (MS) , or an Access Terminal (AT) .
  • UE user equipment
  • SS Subscriber Station
  • MS Mobile Station
  • AT Access Terminal
  • the terminal device may include, but not limited to, a mobile phone, a cellular phone, a smart phone, voice over IP (VoIP) phones, wireless local loop phones, a tablet, a wearable terminal device, a personal digital assistant (PDA) , portable computers, desktop computer, image capture terminal devices such as digital cameras, gaming terminal devices, music storage and playback appliances, vehicle-mounted wireless terminal devices, wireless endpoints, mobile stations, laptop-embedded equipment (LEE) , laptop-mounted equipment (LME) , USB dongles, smart devices, wireless customer-premises equipment (CPE) , an Internet of Things (loT) device, a watch or other wearable, a head-mounted display (HMD) , a vehicle, a drone, a medical device and applications (e.g., remote surgery) , an industrial device and applications (e.g., a robot and/or other wireless devices operating in an industrial and/or an automated processing chain contexts) , a consumer electronics device, a device operating on commercial and/
  • an asynchronous HARQ protocol is employed for both downlink and uplink.
  • the retransmissions are in principle scheduled similarly to the initial transmissions.
  • the use of an asynchronous uplink protocol instead of a synchronous one as in LTE, is necessary to support dynamic Time Division Duplex (TDD) where there is no fixed uplink/downlink allocation. It also offers better flexibility in terms of prioritization between data flows and devices, and is beneficial for extension to unlicensed spectrum operation.
  • TDD Time Division Duplex
  • the explicit HARQ process number is also required to signalize for indicating which process is being addressed.
  • NR supports up to 16 HARQ processes, coming at an additional cost of four bits to distinguish the HARQ processes.
  • One additional feature of the HARQ mechanism in NR compared to LTE is the possibility for retransmission of code block groups. This feature can be beneficial for a very large transport block or when a transport block is partially interfered by another preempting transmission.
  • a transport block is split into one or more code blocks with error-correcting coding applied to each of the code blocks of at most 8448 bits in order to keep the channel-coding complexity reasonable.
  • error-correcting coding applied to each of the code blocks of at most 8448 bits in order to keep the channel-coding complexity reasonable.
  • the receiving device feeds back ACK/NACK to the transmitting device.
  • the transmitting device must determine which HARQ process and which code block a returned acknowledgment is associated with. In case of a small number of code blocks to be indicated, this is can be directly solved by using the explicit HARQ process number and code block number, using the timing of the acknowledgment for association with a certain HARQ process, or using the position of the acknowledgment in the HARQ codebook in case of multiple acknowledgments transmitted at the same time.
  • NR permits one UE to maintain up to 16 HARQ processes per carrier, and each process usually handles hundreds of code blocks.
  • HARQ protocol does some trade-off between performance and signaling cost by configuring per-code-block group (CBG) retransmission.
  • CBG per-code-block group
  • the HARQ acknowledgement only indicates a code block group rather than an individual code block.
  • a whole CBG including the corrupted code blocks and the correct code blocks is needed to be retransmitted, resulting in the inevitable performance loss in bandwidth efficiency.
  • the HARQ mechanism in the MAC layer targets very fast retransmissions. If low latency is important, a large number of HARQ acknowledgments need to be fed back quickly after the end of the downlink slot and uplink slot, which challenges the control channel design. Either positive or negative acknowledgement must be sent for a transport block or code block, no matter what the decoding status is. Taking advantage of the strong forward error-correcting code employed, the probability of receiving an erroneous code block is very low, especially for Ultra Reliability Low Latency Communication (URLLC) .
  • the minimum reliability requirement of URLLC is 1-10 -5 success probability of transmitting a layer 2 protocol data unit of 32 bytes within 1 ms in channel quality of coverage edge. This means that a receiving device almost feeds back the message about positive acknowledgement, and few NACKs are conveyed.
  • the communication network 100 includes a network device 110 and terminal devices 120-1, 120-2 ...and 120-N (where N is an integer number) , which can be collectively referred to as “terminal devices” 120 or individually referred to as a “terminal device” 120.
  • the network 100 can provide one or more cells 102 to serve the terminal devices 120. It is to be understood that the number of network devices, terminal devices and/or cells is given for the purpose of illustration without suggesting any limitations to the present disclosure.
  • the communication network 100 may include any suitable number of network devices, terminal devices and/or cells adapted for implementing implementations of the present disclosure.
  • the network device 110 can communicate data and control information to the terminal device 120 and the terminal device 120 can also communication data and control information to the network device 110.
  • a link from the network device 110 to the terminal device 120 is referred to as a downlink (DL)
  • a link from the terminal device 120 to the network device 110 is referred to as an uplink (UL) .
  • the network device 110 is a transmitting (TX) device (or a transmitter) and the terminal device 120 is a receiving (RX) device (or a receiver) .
  • TX transmitting
  • RX receiving
  • the terminal device 120 is a TX device (or a transmitter) and the network device 110 is a RX device (or a receiver) .
  • Communications in the communication network 100 may be implemented according to any proper communication protocol (s) , comprising, but not limited to, cellular communication protocols of the first generation (1G) , the second generation (2G) , the third generation (3G) , the fourth generation (4G) and the fifth generation (5G) and on the like, wireless local network communication protocols such as Institute for Electrical and Electronics Engineers (IEEE) 802.11 and the like, and/or any other protocols currently known or to be developed in the future.
  • s cellular communication protocols of the first generation (1G) , the second generation (2G) , the third generation (3G) , the fourth generation (4G) and the fifth generation (5G) and on the like, wireless local network communication protocols such as Institute for Electrical and Electronics Engineers (IEEE) 802.11 and the like, and/or any other protocols currently known or to be developed in the future.
  • IEEE Institute for Electrical and Electronics Engineers
  • the communication may utilize any proper wireless communication technology, comprising but not limited to: Code Division Multiple Access (CDMA) , Frequency Division Multiple Access (FDMA) , Time Division Multiple Access (TDMA) , Frequency Division Duplex (FDD) , Time Division Duplex (TDD) , Multiple-Input Multiple-Output (MIMO) , Orthogonal Frequency Division Multiple (OFDM) , Discrete Fourier Transform spread OFDM (DFT-s-OFDM) and/or any other technologies currently known or to be developed in the future.
  • CDMA Code Division Multiple Access
  • FDMA Frequency Division Multiple Access
  • TDMA Time Division Multiple Access
  • FDD Frequency Division Duplex
  • TDD Time Division Duplex
  • MIMO Multiple-Input Multiple-Output
  • OFDM Orthogonal Frequency Division Multiple
  • DFT-s-OFDM Discrete Fourier Transform spread OFDM
  • a TX device may transmit a transport block including a plurality of code blocks or CBGs to a RX device.
  • the network device 110 may receive transport blocks from the terminal devices 120-1, 120-2, ..., 120-N.
  • the terminal device 120 e.g. the terminal device 120-1
  • the reception state of each code block and/or CBG may be determined by the RX device and an indication of the reception state may be transmitted to the TX device to indicate the TX device whether retransmit the corresponding code block and/or CBG.
  • a network device for example, a gNB 210, maintains a plurality of independent HARQ entities 230-1, 230-2, ..., 230-N, each for one of the UEs 220-1, 220-2, ..., 220-N.
  • a HARQ entity decodes the UL transport block (or the code block) and informs the corresponding UE of the outcome of the decoding operation, through separated DL control channels over the radio interface.
  • the HARQ acknowledgements for different UEs 220-1, 220-2, ..., 220-N are separately indicated and signalized from each other. Therefore, the signaling cost are scaled up with the number of UEs and the number of carrier components, as well as the total number of HARQ processes and code blocks.
  • the HARQ-related information is included in the user-specific uplink scheduling grant, separately dedicating to each of UEs 220-1, 220-2, ..., 220-N.
  • the scheduling assignment contains the necessary HARQ-related control signaling and transport-block-related information, including: HARQ process number (4 bit) , informing the device about the HARQ process to use for soft combining; the CBG transmission indicator (CBGTI, 0, 2, 4, 6, or 8 bit) , indicating the code block groups retransmitted (Only present in DCI format 1-1 and only if CBG retransmissions are configured. ) ; new-data indicator (1 bit) , indicating whether the grant relates to retransmission of a transport block or transmission of a new transport block.
  • the so-called CBGs are defined via the explicit indication. If per-CBG retransmission is configured, feedback is provided per CBG and only the erroneously received code block groups are retransmitted. This can consume less resource than retransmitting the whole transport block, thereby reaching a compromise between performance and cost.
  • the separated signaling method as shown in Fig. 2 has less flexibility.
  • the control-channel resource should be reserved for the mentioned HARQ-related and transport-block-related information, no matter what decoding status the code blocks have.
  • the least signaling overhead (in bit) required by the separated signaling amounts to the total number of UL code blocks from all the UEs 220-1, 220-2, ..., 220-N.
  • a sequence of bits is generated by the RX device to indicate the HARQ-related information about a plurality of code blocks or CBGs in a joint and implicit manner.
  • the RX device may transmit to one or more TX device the sequence of bits, from which the one or more TX device may determine the HARQ-related information about the code blocks or CBGs.
  • the sequence of bits may be broadcast over the radio interface. In this way, per-code-block retransmission or per CBG retransmission is achieved with smaller signaling overhead.
  • Fig. 3 illustrates a flowchart illustrating an example process 300 for integrated signaling of HARQ acknowledgements according to some embodiments of the present disclosure.
  • the process 300 will be described with reference to Fig. 1.
  • the process 300 may involve the network device 110 and one or more of the terminal devices 120 as illustrated in Fig. 1.
  • the terminal device 120 transmits 305 a transmission block to the network device 110.
  • the terminal device 120 may transmit during a HARQ process a transport block including a plurality of transmission blocks to the network device 110.
  • the term “transmission block” refers to a data unit of which the reception state can be determined by the RX device, for example based on CRC.
  • the transmission block may refer to a code block.
  • the transmission block may refer to a CBG. It is to be understood that the embodiments of the present disclosure may be applied to data units with other size or granularity as long as reception states of such data units can be determined individually.
  • the process 300 may involve more than one terminal devices, for example all or some of the terminal device 120-1, 120-2, ..., 120-N.
  • the network device 110 receives a plurality of transmission blocks at least from the terminal device 120.
  • the plurality of transmission blocks may be received from a single terminal device 120.
  • the plurality of transmission blocks may be received from a plurality of terminal devices, for example, all or some of the terminal device 120-1, 120-2...120-N.
  • the network device 110 determines 310 reception states of the plurality of transmission blocks received from at least one terminal device 120. For example, the network device 110 may detect whether there is an error in decoding each transmission block of a transport block. Then, the network device 110 generates 315 a sequence of bits based on the reception states of the plurality of transmission blocks such that each of the plurality of transmission blocks corresponds to one or more bits in the sequence. That is, the sequence of bits indicates the reception states of the plurality of transmission blocks in an integrated way.
  • Fig. 4 illustrates a diagram 400 illustrating integrated signaling of HARQ acknowledgements according to some embodiments of the present disclosure.
  • the network device 110 serves the terminal devices 120-1, 120-2, ..., 120-N with UL transmissions and maintains HARQ entities 430-1, 430-2, ..., 430-N, each handling the HARQ processes for the corresponding one of the terminal devices 120-1, 120-2, ..., 120-N.
  • the Bloom filter may be designed as a filter of NACK, which is configured to represent a set of NACK information from all or some of HARQ entities 430-1, 430-2, ..., 430-N.
  • the Bloom filter 450 may generate the sequence of bits, which indicates the composited information of NACKs corresponding to the plurality of transmission blocks, for example a plurality of code blocks.
  • only one Bloom filter 450 is maintained by the network device 110 for the plurality of terminal devices 120-1, 120-2, ..., 120-N to generate the sequence of bits.
  • the network device 110 may maintain a Bloom filter for each of the plurality of terminal devices 120-1, 120-2, ..., 120-N.
  • the sequence of bits may be generated for each of the terminal devices 120 and integrally indicate the reception states of a plurality of transmission blocks from the corresponding terminal device 120.
  • Fig. 5 illustrates a diagram 500 illustrating an example process of HARQ-related information according to some embodiments of the present disclosure.
  • the sequence 550 of bits generated by the network device 110 may have m bits. All of the m bits are initially assigned with a first value, for example, “0” .
  • an identification generator 510 may be used to map the transmission block 501.
  • the identification generator 510 may perform bijective mapping such that a transmission block associated with a HARQ process of a particular terminal device 120 can be indexed by a unique identification, e.g., a global ID number.
  • the identification generator 510 may generate an unique identification 520 of the transmission block 501 based on an identification of the terminal device 120 from which the transmission block 501 is received, an identification of a HARQ process during which the transmission block 501 is received, and an identification of the transmission block 501 used to distinguish the transmission block 501 from other transmission blocks of the terminal device 120.
  • the unique identification 520 of the transmission block 501 is generated based on a set of local identifications associated with the transmission block 501.
  • the identification generator 510 may generate an unique identification 520 of the transmission block 501 based on an identification of a HARQ process during which the transmission block 501 is received and an identification of the transmission block 501 used to distinguish the transmission block 501 from other transmission blocks of the terminal device 120.
  • the unique identification of the erroneous transmission block may be fed into the Bloom filter 450 of NACK.
  • the network device 110 and the terminal device 120 employ the same identification generator 510 or apply the same generating rule to generate the unique identification of the transmission block.
  • the identification generator 510 may be implemented in a variety of ways and the scope of the present disclosure is not limited in this regard.
  • positions of the one or more bits in the sequence 550 that correspond to the transmission block 501 may be determined by hashing the unique identification 520.
  • Each of the hash functions 530-1, 530-2, ..., 530-k maps a unique identification into the range of ⁇ 0, 1, 2, ..., m-1 ⁇ .
  • Each element of the range indicates a position in the sequence 550 of bits. It is to be understood that the hash functions should be known by both the network device 110 and all the terminal devices 120.
  • the computation of hash functions 530-1, 530-2, ..., 530-k may generate a set ⁇ f i (x)
  • i 1, 2, ..., k ⁇ indicating the k positions in the sequence 550.
  • the resulting sequence 550 may indicate all NACK information in an integrated fashion.
  • the network device 110 After generating the sequence of bits, for example after mapping all the transmission blocks with NACK, the network device 110 transmits 320 the resulting sequence of bits to the terminal device 120 as indication of the reception state of the plurality of transmission blocks.
  • the network device 110 may broadcast the sequence of bits over a DL control channel such that each of the terminal devices 120 in the serving cell 102 may receive at least one portion of the sequence of bits.
  • the sequence of bits may be transmitted over a dedicated DL control channel to the corresponding terminal device 120.
  • the terminal device 120 may determine 325 the reception state of the transmission block which has been transmitted previously. For example, the terminal device 120 may first use the identification generator 510 as described above to generate the unique identification (for example, represented as y) of a certain transmission block. Then, the hash functions ⁇ f i ( ⁇ )
  • the identification generator 510 as described above to generate the unique identification (for example, represented as y) of a certain transmission block. Then, the hash functions ⁇ f i ( ⁇ )
  • the terminal device 120 may determine that a failure in receiving the transmission block indexed by y occurs, otherwise the terminal device 120 may determine that the transmission block indexed by y is correctly received by the network device 110. If the terminal device 120 determines that the failure in receiving the transmission block indexed by y occurs, the terminal device 120 may retransmit this transmission block, for example in the next slot.
  • the terminal device 120 may determine a duration t since the transmission block is transmitted 305 and determine whether the duration exceeds a time threshold T max for an indication of the reception state. If the duration t is below the time threshold T max , the terminal device 120 may determine the reception state of the transmission block based on the received sequence of bits.
  • FIG. 3 An example of general process of integrated signaling of HARQ acknowledgements is described with reference to Fig. 3. Although the example process 300 is described with respect to UL transmission, the integrated signaling may also be applied to the DL transmission. In such cases, a sequence of bits which indicates the reception states of a plurality of DL transmission blocks may be generated by the terminal device 120 and transmitted to the network device 110.
  • the HARQ acknowledgments for a large number of transmission blocks can be fed back to the TX device in an integrated way and the signaling overhead can thus be reduced significantly. In this way, per-code-block or per CBG retransmission can be accomplished.
  • Figs. 6A, 6B, 6C, 7, 8A and 8B illustrate an example of generating the sequence of bits according to some embodiments of the present disclosure.
  • the sequence 650 consists of m bits, which are indexed by 0, 1, 2, ..., m-1, respectively. Each bit in the sequence 650 is initially assigned with a value of “0” by the network device 110.
  • the network device 110 may determine that a failure in receiving the code block 601 occurs and generate the unique identification ID 1 of the code block 601, for example as discussed above with reference to Fig. 5.
  • the hash functions 530-1, 530-2, ..., 530-k are then applied to the unique identification ID 1 .
  • the network device 110 may assign the value “1” to bits 2, 4, m-6.
  • the network device 110 may determine that a failure in receiving the code block 602 occurs and generate the unique identification ID 2 of the code block 602.
  • the hash functions 530-1, 530-2, ..., 530-k are then applied to the unique identification ID 2 .
  • the network device 110 may assign the value “1” to bits 0, 2, m-5. It is to be noted that in this example, the value of bit 2 is set to be “1” twice and only the first time is in effect.
  • the network device 110 may transmit the sequence 650 to the terminal devices 120.
  • Fig. 7, illustrates a diagram 700 illustrating transmission of the sequence of bits according to some embodiments of the present disclosure.
  • the network device 110 may broadcast the sequence 750 of bits over the DL broadcast control channel.
  • the DL broadcast control channel is configured at the end of each slot.
  • the dedicated resource 710 may be configured for the DL broadcast control channel to transmit the sequence 750 of bits.
  • each terminal device 120 may obtain the sequence 750 of bits by decoding the DL control channel and determine whether the code blocks having been transmitted is successfully received or not. Alternatively, each terminal device 120 may decode only a portion of the DL control channel which is allocated for a subset of bits in the sequence 750 corresponding to one or more code blocks transmitted by itself. In such a case, the terminal device 120 may first determine the subset of bits corresponding to the one or more code blocks and only decode the portion allocated for the subset of bits.
  • Figs. 8A and 8B illustrate an example of querying the sequence 750 of bits according to some embodiments of the present disclosure. It is to be understood that the sequence 750 as shown in Figs. 7, 8A and 8B is shadowed and has a different reference sign with the sequence 650 as shown in Figs. 6A, 6B and 6C. This take into account of potential errors in transmitting or receiving the sequence 650, which does not affect the principle of the present disclosure.
  • the terminal device 120 may generate the unique identification ID 1 of this code block 601, for example, by using the generator 510 as dicussed with reference to Fig. 5.
  • the hash functions 530-1, 530-2, ..., 530-k are then applied to the unique identification ID 1 .
  • the terminal device 120 checks the values of bits 2, 4, m-6. Since all of the bits 2, 4, m-6 have the value of “1” , the terminal device 120 may determine that a failure occurs in receiving the code block 601 by the network device 110 and retransmit the code block 601 to the network device 110.
  • the terminal device 120 may generate the unique identification ID 3 of this code block 803, for example, by using the generator 510.
  • the hash functions 530-1, 530-2, ..., 530-k are then applied to the unique identification ID 3 .
  • the terminal device 120 checks the values of bits 2, 3, 4. Since the value of bit 3 is “0” , the terminal device 120 may determine that the code block 803 is successfully received by the network device 110 and thus no retransmission is needed.
  • the network device 110 and the terminal devices 120 have the knowledge about the identification generator, the hash functions and the size of the sequence of bits, as well as the DL broadcast control channel.
  • the number of bits in the sequence and the number of hash functions for hashing the unique identification may be fixed. In some example embodiments, the number of bits in the sequence and the number of hash functions for hashing the unique identification may be dimensioned. Such example embodiments are now described in detail.
  • the probability of a false NACK for a correct transmission block (which is referred to as false NACK probability) , can be calculated in a straightforward fashion, given that the hash functions are random. It is assumed that the network device 110 receives total N transmission blocks from one or more terminal devices 120 within one slot, each of which suffers error independently with a probability P e . After the unique identifications of all M erroneous transmission blocks are hashed into the sequence of bits, the probability that a specific bit still has a value of “0” , denoted by P, can be calculated by
  • the false NACK probability can be approximately characterized by:
  • the upper bound of the false NACK probability can be minimized by choosing an appropriate number of hash functions for a given NP e /m. It can be readily shown that the minimum false NACK reaches to
  • the network device 110 may determine a failure rate P e of transmission blocks.
  • the failure rate P e may be predetermined for example at system design level.
  • the failure rate P e may be determined based on the reception states of transmission blocks which have been received by the network device 110.
  • the network device 110 may determine a tolerance of false rate for the indication of the reception states, for example, a tolerance ⁇ of the false NACK probability.
  • the tolerance ⁇ of false rate may be predetermined for example at system design level.
  • the network device 110 may then determine a length of the sequence of bits, based on the failure rate P e , the tolerance ⁇ of false rate and the number of the plurality of transmission blocks. For example, the length of the sequence of bits may be determined as where denotes the minimum integer more than x.
  • the network device 110 may further determine the number of hash functions for hashing the unique identification based on the tolerance of false rate. For example, the number of hash functions may be determined as where denotes the maximum integer less than x.
  • the network device 110 may further transmit the length of the sequence of bits and the number of hash functions to the terminal device 120.
  • the network device 110 may broadcast indications of the length of the sequence of bits and the number of hash functions such that all the terminal devices 120 in the serving cell 102 may have the knowledge about the length of the sequence of bits and the number of hash functions.
  • the proposed integrated signaling solution exhibits zero false ACK probability and negligible false NACK probability (10 -10 ⁇ 10 -15 ) with ultra-small signaling overhead.
  • the above analysis has shown that a signaling overhead of just bits is required to achieve a false probability less than ⁇ , for given total N transmission blocks with failure rate P e to be addressed by the HARQ process.
  • the amount of signaling overhead used for HARQ acknowledgements can be reduced by a factor of 1.44P e log 2 (1/ ⁇ ) .
  • Fig. 9 illustrates a graph 900 showing performance of the proposed solution according to some embodiments of the present disclosure.
  • the reduction factor varies with the failure rate P e and the tolerance ⁇ of false rate. It can be seen that the proposed solution can decrease the signaling overhead by 2 ⁇ 3 orders of magnitude at the false NACK probability of 10 -10 ⁇ 10 -15 . This means that the proposed solution is amenable to massive access with per-code block requesting HARQ.
  • Fig. 10 shows a flowchart of an example method 1000 according to some example embodiments of the present disclosure.
  • the method 1000 can be implemented at a device e.g. at the network device 110 as shown in Fig. 1.
  • the method 1000 will be described with reference to Fig. 1.
  • the network device 110 determine reception states of a plurality of transmission blocks received from at least one terminal device 120.
  • the network device 110 generates a sequence of bits based on the reception states of the plurality of transmission blocks such that each of the plurality of transmission blocks corresponds to one or more bits in the sequence.
  • the network device 110 transmits the sequence of bits to the at least one terminal device 120 as indication of the reception states.
  • generating the sequence of bits comprises: assigning a first value to bits in the sequence; and in response to a failure in receiving a first transmission block of the plurality of transmission blocks, assigning a second value to a first subset of bits in the sequence that are corresponding to the first transmission block, the second value being different from the first value.
  • the method 1000 further comprises: in response to a failure in receiving a second transmission block of the plurality of transmission blocks, assigning the second value to a second subset of bits in the sequence that are corresponding to the second transmission block, the second subset of bits being at least partially different from the first subset of bits.
  • assigning the second value to the first subset of bits that are corresponding to the first transmission block comprises: obtaining a unique identification of the first transmission block; and determining positions of the first subset of bits in the sequence by hashing the unique identification.
  • obtaining the unique identification of the first transmission block comprises determining the unique identification of the first transmission block based on at least one of: an identification of a terminal device 120 from which the first transmission block is received; an identification of a Hybrid Automatic Repeat reQuest process during which the first transmission block is received; and an identification of the first transmission block used to distinguish the first transmission block from other transmission blocks of the terminal device 120.
  • the method 1000 further comprises: determining a failure rate of transmission blocks which have been received by the network device 110; determining a tolerance of false rate for the indication of the reception states; determining a length of the sequence of bits, based on the failure rate, the tolerance of false rate and the number of the plurality of transmission blocks; and determining the number of hash functions for hashing the unique identification based on the tolerance of false rate.
  • the method 1000 further comprises: transmitting the length of the sequence of bits and the number of hash functions to the at least one terminal device 120.
  • the at least one terminal device 120 comprises a plurality of terminal devices.
  • Fig. 11 shows a flowchart of an example method 1100 according to some example embodiments of the present disclosure.
  • the method 1100 can be implemented at a device e.g. at the terminal device 120 as shown in Fig. 1.
  • the method 1100 will be described with reference to Fig. 1.
  • the terminal device 120 transmits a transmission block to a network device 110, the network device 110 receiving a plurality of transmission blocks at least from the terminal device 120.
  • the terminal device 120 receives at least one portion of a sequence of bits from the network device 110, each of the plurality of transmission blocks corresponding to one or more bits in the sequence.
  • the terminal device 120 determines a reception state of the transmission block based on the at least one portion of the sequence of bits.
  • determining the reception state of the transmission block comprises: determining a subset of bits in the at least one portion of the sequence that are corresponding to the transmission block; determining whether the subset of bits comprises a bit of a first value; and in response to absence of the bit of the first value, determining that a failure in receiving the transmission block by the network device 110 occurs.
  • the method 1100 further comprises: in response to a determination that the failure in receiving the transmission block by the network device 110 occurs, retransmitting the transmission block to the network device 110.
  • determining a subset of bits in the sequence that are corresponding to the transmission block comprises: obtaining a unique identification of the transmission block; and determining positions of the subset of bits in the sequence by hashing the unique identification.
  • obtaining the unique identification of the transmission block comprises determining the unique identification of the transmission block based on at least one of: an identification of the terminal device 120; an identification of a Hybrid Automatic Repeat reQuest process during which the transmission block is transmitted; and an identification of the transmission block used to distinguish the transmission block from other transmission blocks of the terminal device 120.
  • the method 1100 further comprises: receiving, from the network device 110, a length of the sequence of bits and the number of hash functions for hashing the unique identification.
  • the method 1100 further comprises: determining a duration since the transmission block is transmitted; determining whether the duration exceeds a time threshold for an indication of the reception state; and in response to a determination that the duration is below the time threshold, determining the reception state of the transmission block based on the sequence of bits.
  • an apparatus capable of performing the method 1000 may comprise means for performing the respective steps of the method 1000.
  • the means may be implemented in any suitable form.
  • the means may be implemented in a circuitry or software module.
  • the apparatus comprises: means for determining reception states of a plurality of transmission blocks received from at least one second device; means for generating a sequence of bits based on the reception states of the plurality of transmission blocks such that each of the plurality of transmission blocks corresponds to one or more bits in the sequence; and means for transmitting the sequence of bits to the at least one second device as indication of the reception states.
  • the means for generating the sequence of bits comprises: means for assigning a first value to bits in the sequence; and means for in response to a failure in receiving a first transmission block of the plurality of transmission blocks, assigning a second value to a first subset of bits in the sequence that are corresponding to the first transmission block, the second value being different from the first value.
  • the apparatus further comprises: means for in response to a failure in receiving a second transmission block of the plurality of transmission blocks, assigning the second value to a second subset of bits in the sequence that are corresponding to the second transmission block, the second subset of bits being at least partially different from the first subset of bits.
  • the means for assigning the second value to the first subset of bits that are corresponding to the first transmission block comprises: means for obtaining a unique identification of the first transmission block; and means for determining positions of the first subset of bits in the sequence by hashing the unique identification.
  • the means for obtaining the unique identification of the first transmission block comprises means for determining the unique identification of the first transmission block based on at least one of: an identification of a second device from which the first transmission block is received; an identification of a Hybrid Automatic Repeat reQuest process during which the first transmission block is received; and an identification of the first transmission block used to distinguish the first transmission block from other transmission blocks of the second device.
  • the apparatus further comprises: means for determining a failure rate of transmission blocks which have been received by the first device; means for determining a tolerance of false rate for the indication of the reception states; means for determining a length of the sequence of bits, based on the failure rate, the tolerance of false rate and the number of the plurality of transmission blocks; and means for determining the number of hash functions for hashing the unique identification based on the tolerance of false rate.
  • the apparatus further comprises: means for transmitting the length of the sequence of bits and the number of hash functions to the at least one second device.
  • an apparatus capable of performing the method 1100 may comprise means for performing the respective steps of the method 1100.
  • the means may be implemented in any suitable form.
  • the means may be implemented in a circuitry or software module.
  • the apparatus comprises: means for transmitting a transmission block to a first device, the first device receiving a plurality of transmission blocks at least from the second device; means for receiving at least one portion of a sequence of bits from the first device, each of the plurality of transmission blocks corresponding to one or more bits in the sequence; and means for determining a reception state of the transmission block based on the at least one portion of the sequence of bits.
  • the means for determining the reception state of the transmission block comprises: means for determining a subset of bits in the at least one portion of the sequence that are corresponding to the transmission block; means for determining whether the subset of bits comprises a bit of a first value; and means for in response to absence of the bit of the first value, determining that a failure in receiving the transmission block by the first device occurs.
  • the apparatus further comprises: means for in response to a determination that the failure in receiving the transmission block by the first device occurs, retransmitting the transmission block to the first device.
  • the means for determining a subset of bits in the sequence that are corresponding to the transmission block comprises: means for obtaining a unique identification of the transmission block; and means for determining positions of the subset of bits in the sequence by hashing the unique identification.
  • the means for obtaining the unique identification of the transmission block comprises means for determining the unique identification of the transmission block based on at least one of: an identification of the second device; an identification of a Hybrid Automatic Repeat reQuest process during which the transmission block is transmitted; and an identification of the transmission block used to distinguish the transmission block from other transmission blocks of the second device.
  • the apparatus further comprises: means for receiving, from the first device, a length of the sequence of bits and the number of hash functions for hashing the unique identification.
  • the apparatus further comprises: means for determining a duration since the transmission block is transmitted; means for determining whether the duration exceeds a time threshold for an indication of the reception state; and means for in response to a determination that the duration is below the time threshold, determining the reception state of the transmission block based on the sequence of bits.
  • Fig. 12 is a simplified block diagram of a device 1200 that is suitable for implementing embodiments of the present disclosure.
  • the device 1200 may be provided to implement the communication device, for example the terminal devices 120 or the network device 110 as shown in Fig. 1.
  • the device 1200 includes one or more processors 1210, one or more memories 1220 coupled to the processor 1210, and one or more communication modules 1240 coupled to the processor 1210.
  • the communication module 1240 is for bidirectional communications.
  • the communication module 1240 has at least one antenna to facilitate communication.
  • the communication interface may represent any interface that is necessary for communication with other network elements.
  • the processor 1210 may be of any type suitable to the local technical network and may include one or more of the following: general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and processors based on multicore processor architecture, as non-limiting examples.
  • the device 1200 may have multiple processors, such as an application specific integrated circuit chip that is slaved in time to a clock which synchronizes the main processor.
  • the memory 1220 may include one or more non-volatile memories and one or more volatile memories.
  • the non-volatile memories include, but are not limited to, a Read Only Memory (ROM) 1224, an electrically programmable read only memory (EPROM) , a flash memory, a hard disk, a compact disc (CD) , a digital video disk (DVD) , and other magnetic storage and/or optical storage.
  • the volatile memories include, but are not limited to, a random access memory (RAM) 1222 and other volatile memories that will not last in the power-down duration.
  • a computer program 1230 includes computer executable instructions that are executed by the associated processor 1210.
  • the program 1230 may be stored in the ROM 1220.
  • the processor 1210 may perform any suitable actions and processing by loading the program 1230 into the RAM 1220.
  • the embodiments of the present disclosure may be implemented by means of the program 1230 so that the device 1200 may perform any process of the disclosure as discussed with reference to Figs. 10 to 11.
  • the embodiments of the present disclosure may also be implemented by hardware or by a combination of software and hardware.
  • the program 1230 may be tangibly contained in a computer readable medium which may be included in the device 1200 (such as in the memory 1220) or other storage devices that are accessible by the device 1200.
  • the device 1200 may load the program 1230 from the computer readable medium to the RAM 1222 for execution.
  • the computer readable medium may include any types of tangible non-volatile storage, such as ROM, EPROM, a flash memory, a hard disk, CD, DVD, and the like.
  • Fig. 13 shows an example of the computer readable medium 1300 in form of CD or DVD.
  • the computer readable medium has the program 1230 stored thereon.
  • various embodiments of the present disclosure may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. Some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device. While various aspects of embodiments of the present disclosure are illustrated and described as block diagrams, flowcharts, or using some other pictorial representations, it is to be understood that the block, apparatus, system, technique or method described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.
  • the present disclosure also provides at least one computer program product tangibly stored on a non-transitory computer readable storage medium.
  • the computer program product includes computer-executable instructions, such as those included in program modules, being executed in a device on a target real or virtual processor, to carry out the method 1000 or 1100 as described above with reference to Figs. 10-11.
  • program modules include routines, programs, libraries, objects, classes, components, data structures, or the like that perform particular tasks or implement particular abstract data types.
  • the functionality of the program modules may be combined or split between program modules as desired in various embodiments.
  • Machine-executable instructions for program modules may be executed within a local or distributed device. In a distributed device, program modules may be located in both local and remote storage media.
  • Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program codes, when executed by the processor or controller, cause the functions/operations specified in the flowcharts and/or block diagrams to be implemented.
  • the program code may execute entirely on a machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
  • the computer program codes or related data may be carried by any suitable carrier to enable the device, apparatus or processor to perform various processes and operations as described above.
  • Examples of the carrier include a signal, computer readable medium, and the like.
  • the computer readable medium may be a computer readable signal medium or a computer readable storage medium.
  • a computer readable medium may include but not limited to an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of the computer readable storage medium would include an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM) , a read-only memory (ROM) , an erasable programmable read-only memory (EPROM or Flash memory) , an optical fiber, a portable compact disc read-only memory (CD-ROM) , an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

Abstract

Des modes de réalisation de la présente invention concernent une signalisation intégrée d'accusés de réception de demande de répétition automatique hybride (HARQ). Un premier dispositif détermine des états de réception d'une pluralité de blocs de transmission reçus en provenance d'au moins un second dispositif. Le premier dispositif génère une séquence de bits sur la base des états de réception de la pluralité de blocs de transmission de telle sorte que chacun de la pluralité de blocs de transmission correspond à un ou plusieurs bits dans la séquence. Le premier dispositif transmet la séquence de bits à l'au moins un second dispositif en tant qu'indication des états de réception.
PCT/CN2019/096282 2019-07-17 2019-07-17 Signalisation intégrée d'accusés de réception harq WO2021007796A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201980098506.1A CN114175541A (zh) 2019-07-17 2019-07-17 Harq确认的集成信令
PCT/CN2019/096282 WO2021007796A1 (fr) 2019-07-17 2019-07-17 Signalisation intégrée d'accusés de réception harq

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/096282 WO2021007796A1 (fr) 2019-07-17 2019-07-17 Signalisation intégrée d'accusés de réception harq

Publications (1)

Publication Number Publication Date
WO2021007796A1 true WO2021007796A1 (fr) 2021-01-21

Family

ID=74210101

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/096282 WO2021007796A1 (fr) 2019-07-17 2019-07-17 Signalisation intégrée d'accusés de réception harq

Country Status (2)

Country Link
CN (1) CN114175541A (fr)
WO (1) WO2021007796A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2224633A1 (fr) * 2009-02-27 2010-09-01 Research In Motion Limited Réorganisation de blocs de code avant le décodage de la correction d'erreurs en aval basé sur la fiabilité de blocs de codes prédite
US20130094437A1 (en) * 2011-10-18 2013-04-18 Collabera Solutions Private Limited Frame Acknowledgment In A Communication Network
US20150110029A1 (en) * 2012-04-24 2015-04-23 Lg Electronics Inc. Method and device for transmitting uplink control information
WO2015137854A1 (fr) * 2014-03-12 2015-09-17 Telefonaktiebolaget L M Ericsson (Publ) Procédé et dispositifs de retour d'information dans un système de communications
EP3327968A1 (fr) * 2015-07-31 2018-05-30 ZTE Corporation Procédé de transmission, procédé de réception et noeuds pour des informations harq

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8290428B2 (en) * 2006-12-06 2012-10-16 Qualcomm Incorporated Methods and apparatus for RLC re-transmission schemes
CN107104780B (zh) * 2009-10-01 2020-10-16 交互数字专利控股公司 上行链路控制数据传输
WO2011129582A2 (fr) * 2010-04-12 2011-10-20 Lg Electronics Inc. Procédé et appareil d'émission et de réception d'une demande de programmation utilisant un filtrage basé sur des ressources partagées dans un système de communications radio
US20130148563A1 (en) * 2011-12-10 2013-06-13 Qualcomm Incorporated Apparatus and methods for management, configuration and control signaling of network coded harq in mobile communication systems
CN102611538B (zh) * 2011-12-21 2014-10-08 华为技术有限公司 上行数据反馈方法及基站
CN104285401A (zh) * 2012-05-11 2015-01-14 瑞典爱立信有限公司 用于在无线通信系统中提供复合确认信息的方法、布置和节点
US9144066B2 (en) * 2012-12-28 2015-09-22 Sierra Wireless, Inc. Method and system for hybrid automatic repeat request combining on an lte downlink control channel
CN105765894B (zh) * 2013-11-28 2019-06-07 瑞典爱立信有限公司 用于混合自动重复请求传输的方法、装置和用户设备
US10652003B2 (en) * 2015-01-22 2020-05-12 Texas Instruments Incorporated HARQ design for high performance wireless backhaul
US9992004B2 (en) * 2015-02-03 2018-06-05 Qualcomm Incorporated Code block cluster level HARQ
CN106559187B (zh) * 2015-09-25 2021-11-05 北京三星通信技术研究有限公司 Harq-ack信息的反馈和接收方法及设备
MX2019001753A (es) * 2016-08-12 2019-06-17 Nokia Solutions & Networks Oy Realimentación de ack/nack de granularidad fina para sistema de comunicación 5g.
CN109152053B (zh) * 2017-06-16 2023-05-09 中国移动通信有限公司研究院 传输时序确定及指示方法、通信设备及存储介质
US10454620B2 (en) * 2017-06-16 2019-10-22 At&T Intellectual Property I, L.P. Facilitating notifications to indicate failed code block groups in 5G or other next generation networks
CN109586877B (zh) * 2017-09-29 2023-09-19 北京三星通信技术研究有限公司 上行传输方法和相应设备

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2224633A1 (fr) * 2009-02-27 2010-09-01 Research In Motion Limited Réorganisation de blocs de code avant le décodage de la correction d'erreurs en aval basé sur la fiabilité de blocs de codes prédite
US20130094437A1 (en) * 2011-10-18 2013-04-18 Collabera Solutions Private Limited Frame Acknowledgment In A Communication Network
US20150110029A1 (en) * 2012-04-24 2015-04-23 Lg Electronics Inc. Method and device for transmitting uplink control information
WO2015137854A1 (fr) * 2014-03-12 2015-09-17 Telefonaktiebolaget L M Ericsson (Publ) Procédé et dispositifs de retour d'information dans un système de communications
EP3327968A1 (fr) * 2015-07-31 2018-05-30 ZTE Corporation Procédé de transmission, procédé de réception et noeuds pour des informations harq

Also Published As

Publication number Publication date
CN114175541A (zh) 2022-03-11

Similar Documents

Publication Publication Date Title
US9888465B2 (en) Codeword determination for acknowledgement information
CN105743619B (zh) 混合自动重传请求(harq)传输的方法和设备
CN110582968B (zh) 用于时间间隔的一部分的指示
EP3664546A1 (fr) Procédé de communication et dispositif de communication
EP3455991B1 (fr) Configuration de transmissions en liaison descendante
US20180098345A1 (en) Dynamic codebook adaptation for enhanced carrier aggregation
US10972228B2 (en) Base station device, user equipment, wireless communication system, and communication method
CN110447283B (zh) 无线通信网络中的网络节点和方法
US11785606B2 (en) Communication apparatus and communication method
US9838161B2 (en) Bundling HARQ feedback in a time division duplexing communication system
US11431462B2 (en) Indication method, network device, and user equipment
US20220201697A1 (en) Terminal and communication method
CN110710147B (zh) 用于pucch格式适配的用户设备、基站及通信方法
US10749638B2 (en) Soft buffer handling with limited memory access bandwidth
CN115804228A (zh) 用于通信的方法、设备和计算机存储介质
CN115119530B (zh) 用于频率复用下行链路数据传输的半静态harq-ack码本构造
US20210329610A1 (en) Processing method and device
US20240023098A1 (en) Method, device and computer storage medium of communication
US20230216614A1 (en) Methods for communication, terminal device, and computer readable media
WO2021007796A1 (fr) Signalisation intégrée d'accusés de réception harq
CN109983818B (zh) 用于发送/接收调度命令的方法和设备
CN107113119A (zh) 混合自动重传应答消息的传输方法、用户设备和基站
WO2023019439A1 (fr) Procédés, dispositifs, et support lisible par ordinateur de communication
US20240048279A1 (en) Methods, devices, and computer readable medium for communication
CN113966001A (zh) 半持久调度数据传输触发的混合自动重复请求确认报告

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19937914

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19937914

Country of ref document: EP

Kind code of ref document: A1