WO2020088676A1 - Harq-ack码本确定方法及装置、终端、存储介质 - Google Patents

Harq-ack码本确定方法及装置、终端、存储介质 Download PDF

Info

Publication number
WO2020088676A1
WO2020088676A1 PCT/CN2019/115148 CN2019115148W WO2020088676A1 WO 2020088676 A1 WO2020088676 A1 WO 2020088676A1 CN 2019115148 W CN2019115148 W CN 2019115148W WO 2020088676 A1 WO2020088676 A1 WO 2020088676A1
Authority
WO
WIPO (PCT)
Prior art keywords
candidate
pdsch
candidate pdsch
harq
pdschs
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2019/115148
Other languages
English (en)
French (fr)
Inventor
苟伟
郝鹏
张晨晨
任敏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to EP24191127.0A priority Critical patent/EP4451601A3/en
Priority to DK19879691.4T priority patent/DK3876454T3/da
Priority to PL19879691.4T priority patent/PL3876454T3/pl
Priority to EP19879691.4A priority patent/EP3876454B1/en
Priority to US17/290,878 priority patent/US12028165B2/en
Priority to KR1020217016305A priority patent/KR102607908B1/ko
Publication of WO2020088676A1 publication Critical patent/WO2020088676A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
    • 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
    • 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/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/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • 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/1829—Arrangements specially adapted for the receiver end
    • H04L1/1854—Scheduling and prioritising arrangements
    • 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/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1896—ARQ related signaling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signalling, i.e. of overhead other than pilot signals
    • H04L5/0055—Physical resource allocation for ACK/NACK
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • 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/1628—List acknowledgements, i.e. the acknowledgement message consisting of a list of identifiers, e.g. of sequence numbers

Definitions

  • Embodiments of the present invention relate to, but are not limited to, the technical field of 5G communication, and specifically, to but not limited to a hybrid automatic repeat request-acknowledgement (Hybrid Automatic Repeat-request-Acknowledgement, HARQ-ACK) codebook determination method and device, and terminal , Computer-readable storage media.
  • Hybrid Automatic Repeat-request-Acknowledgement Hybrid Automatic Repeat-request-Acknowledgement, HARQ-ACK
  • HARQ-ACK Hybrid Automatic Repeat-request-Acknowledgement
  • the 5th Generation mobile communication system there is a limit to the size of the static codebook, that is, in a slot, the user equipment (User Equipment, UE) is
  • the UE When multiple candidate transmission PDSCH (Physical Downlink Shared Channel) locations are configured, the UE only determines one HARQ-ACK (Hybrid Automatic Repeat Repeat-Acknowledgement) for the position of the candidate transmission PDSCH that overlaps in the time domain.
  • the retransmission request-acknowledgement) information is in the semi-static HARQ-ACK codebook.
  • This limitation also means that for the candidate PDSCHs with overlapping time domains, the base station can only schedule one of the candidate PDSCHs for transmission.
  • the base station can only schedule one of the candidate PDSCHs for transmission.
  • FIGS. 1a and 1b for a UE, two candidate PDSCH transmission positions are configured in a slot, but there is time domain overlap between them (that is, overlap in the lateral direction in FIG. 1).
  • the base station schedules the PDSCH, only one of the candidate PDSCHs can be scheduled for transmission, and the UE only forms one HARQ-ACK information for one PDSCH in the semi-static codebook.
  • the priority of URLLC service is higher first, so PDSCH1 In the time domain position corresponding to PDSCH2, transmission is prohibited, and PDSCH2 is transmitted in a position where the time domain overlaps.
  • PDSCH1 can continue to be transmitted in a non-time domain overlapping position, so that PDSCH1 is punctured by PDSCH2. Part of the data of PDSCH1 is punctured, and there is data that has not been transmitted and received by the UE.
  • Fig. 2b it is similar, except that the candidate PDSCH1 and PDSCH2 not only overlap in the time domain, but also overlap in the frequency domain.
  • the time domain overlaps in fact, the overlapping orthogonal frequency division multiplexing (Orthogonal Frequency Division Multiplexing, OFDM) symbol
  • OFDM Orthogonal frequency division multiplexing
  • An embodiment of the present invention provides a HARQ-ACK codebook determination method and device, terminal, and storage medium, to solve the problem that in static codebook determination, for multiple PDSCH candidates configured in the same time slot, only one of them can be selected to form a codebook , Resulting in technical problems with data not being transmitted.
  • An embodiment of the present invention provides a HARQ-ACK codebook determination method.
  • the method includes:
  • the candidate PDSCH in at least one time slot according to the candidate physical downlink shared channel PDSCH type and the candidate PDSCH end time, and form a hybrid automatic repeat request-acknowledgement HARQ corresponding to the grouped candidate PDSCH -ACK information;
  • the HARQ-ACK information corresponding to the candidate PDSCH is concatenated to obtain a HARQ-ACK codebook.
  • An embodiment of the present invention also provides a HARQ-ACK codebook determination device, including:
  • a configuration module configured to group the candidate PDSCH in at least one time slot according to the candidate physical downlink shared channel PDSCH type and the candidate PDSCH end time, and form a hybrid automatic re-correspondence corresponding to the grouped candidate PDSCH Request-confirm HARQ-ACK information;
  • the conversion module is configured to concatenate the HARQ-ACK information corresponding to the candidate PDSCH to obtain the codebook.
  • An embodiment of the present invention also provides a terminal, including a processor, a memory, a communication unit, and a communication bus;
  • the communication bus is used to implement a communication connection between the processor, the communication unit, and the memory;
  • the processor is used to execute one or more programs stored in the memory to implement the HARQ-ACK codebook determination method as described above.
  • An embodiment of the present invention also provides a computer-readable storage medium, where the computer-readable storage medium stores one or more computer programs, and the one or more computer programs may be executed by one or more processors to Implement the HARQ-ACK codebook determination method as described above.
  • a HARQ-ACK codebook determination method and device, terminal, and computer-readable storage medium performs grouping processing on all candidate PDSCHs in a time slot according to candidate PDSCH types and candidate PDSCH end times According to the grouping situation, the corresponding HARQ-ACK information is formed for each group of PDSCH.
  • the formed HARQ-ACK information is concatenated according to the end time, so as to obtain the final codebook, and the HARQ-ACK obtained after concatenation
  • the ACK information is the determined complete codebook, so that when multiple candidate PDSCHs are configured in the same time slot and there is overlap in the time domain, it is possible to ensure that the use of some candidate PDSCHs will not be prohibited during punctured transmission, and
  • the codebook determined by this method has a moderate size, which can ensure the integrity of data transmission and improve the performance of the device.
  • FIG. 1a is a schematic diagram of overlapping time domains of multiple candidate PDSCHs configured in the same time slot in the related art
  • FIG. 1b is another schematic diagram of time domain overlapping of multiple candidate PDSCHs configured in the same time slot in the related art
  • 2a is a schematic diagram of multiplexing transmission with multiple candidate PDSCHs configured in the same time slot in the related art
  • FIG. 2b is another schematic diagram of multiplexing transmission configured with multiple candidate PDSCHs in the same time slot in the related art
  • FIG. 3 is a flowchart of a codebook determination method provided by an embodiment of the present invention.
  • FIG. 4 is a schematic structural diagram of a codebook determination apparatus according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a first grouping division of candidate PDSCH overlapping in the same time slot in an embodiment of the present invention
  • FIG. 6 is a schematic diagram of a second grouping of overlapping PDSCH time domains in the same time slot provided by an embodiment of the present invention.
  • FIG. 7 is a schematic diagram of a third grouping division of candidate PDSCH overlapping in the same time slot provided by an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of a fourth grouping division of candidate PDSCH overlapping in the same time slot provided by an embodiment of the present invention.
  • FIG. 9 is a schematic diagram of a fifth grouping division of candidate PDSCH overlapping in the same time slot in an embodiment of the present invention.
  • FIG. 10 is a schematic structural diagram of a communication device according to an embodiment of the present invention.
  • an embodiment of the present invention proposes a codebook determination method, which is based on the candidate PDSCH Type and configure the end time of the candidate PDSCH to group and concatenate HARQ-ACK information (concatenation refers to cascading HARQ-ACK information at the bit level, also known as multiplexing, that is, HARQ-ACK information is in the bit Multiplexed together as a HARQ-ACK codebook), so that in the same time slot, even overlapping candidate PDSCHs, as long as their service types are different, the HARQ-ACK codebook can be configured to achieve data transmission.
  • S301 Group the candidate PDSCHs in at least one time slot according to the candidate PDSCH type and the end time of the candidate PDSCH, and form HARQ-ACK information corresponding to the grouped candidate PDSCH.
  • the candidate PDSCH type also corresponds to the type of service
  • the candidate PDSCH type can distinguish the type corresponding to the candidate PDSCH in the time slot and the position in the time slot where it is located by the type of service it transmits, that is, it is served Service type, in the configuration of the candidate PDSCH of the time slot, different candidate PDSCHs are configured according to different service types, and at the same time, different services also have different numbers of continuous symbols occupied by the candidate PDSCH. Therefore, the service type and service type priority here correspond to the candidate PDSCH type. The service priority is high, and the corresponding candidate PDSCH type priority is high.
  • Method 1 First classify all candidate PDSCHs according to candidate PDSCH types to form different sets of candidate PDSCHs, and then form codebooks for the candidate PDSCHs in each set separately.
  • the codebooks here are semi-static HARQ-ACK codes. This (also referred to as a semi-static codebook, or codebook below), when forming a semi-static codebook, specifically, the candidate PDSCHs in each set are overlapped in the time domain, and the HARQ-ACK information is formed one by one according to the packet .
  • Method 2 All candidate PDSCHs are grouped according to the order of the end time, and then HARQ-ACK information is formed one by one according to the grouping, and grouping according to the end time should still consider dividing the candidate PDSCHs of the same service type into the same group In the end, HARQ-ACK information is formed by concatenating successively according to the end time of the grouped candidate PDSCH.
  • the concatenation when concatenating, you can arrange the concatenation in the following ways: First, sort the priority of the candidate PDSCH type corresponding to the candidate PDSCH, and according to the priority order, remove the HARQ-ACK information from the priority The order from high to low is serially connected to obtain a complete codebook, and the total length of the codebook is the total number of groups of HARQ-ACK information.
  • the codebook is determined by this method, which can be processed according to the actual number of time slots. If the at least one time slot is one, the according to the candidate PDSCH type and the end time of the candidate PDSCH Grouping the candidate PDSCHs in at least one time slot and forming the corresponding HARQ-ACK information includes: determining the priority of the service to be transmitted; dividing all the candidate PDSCHs into at least according to the candidate PDSCH type Two sets of candidate PDSCH combinations; from the candidate PDSCH combinations corresponding to the same candidate PDSCH type, the groups are divided according to the end time of each candidate PDSCH, and the corresponding HARQ- is formed for the candidate PDSH in the divided group ACK information.
  • the division of candidate PDSCHs of the same priority can be specifically implemented by: determining the first candidate PDSCH with the earliest end time from the candidate PDSCH combinations corresponding to the same candidate PDSCH; and determining the candidate PDSCH combination Among the remaining candidate PDSCHs, there is a second candidate PDSCH that overlaps with the first candidate PDSCH in time domain; the first candidate PDSCH and the second candidate PDSCH are divided into one group.
  • the specific implementation manner is the same as the grouping manner of the first candidate PDSCH and the second candidate PDSCH.
  • the grouping method is to first divide all the candidate PDSCHs in a slot into large categories according to the type of service, and then to divide the large candidate PDSCHs, and on the basis of the large category, it is based on each The division of the end time of the candidate PDSCH and the overlapping of the time domain.
  • the candidate PDSCH division for a time slot may also be implemented in the following manner, that is, the candidate PDSCH in at least one time slot is divided according to the candidate PDSCH type and the end time of the candidate PDSCH Grouping and forming HARQ-ACK information corresponding to the candidate PDSCH after grouping includes: determining an end time in all the candidate PDSCHs; selecting the end time from the candidate PDSCHs in at least one time slot The earliest third candidate PDSCH; determining the candidate PDSCH type of the third candidate PDSCH; determining a fourth candidate that overlaps with the third candidate PDSCH in time domain from other candidate PDSCHs corresponding to the candidate PDSCH type PDSCH; divide the third candidate PDSCH and the fourth candidate PDSCH into a small group.
  • the third candidate PDSCH and the fourth candidate PDSCH are divided, all the remaining candidate PDSCHs in the time slot except the third candidate PDSCH and the fourth candidate PDSCH need to be grouped again.
  • the grouping manner is the same as the third candidate PDSCH and the fourth candidate PDSCH.
  • the grouping method is to first determine a candidate PDSCH according to the end time of the candidate PDSCH, and then select the corresponding candidate PDSCH according to the service type corresponding to the determined candidate PDSCH to select the overlapping time domain, that is, to select the same service type
  • the candidate PDSCHs are divided into the same group.
  • the third candidate PDSCH with the earliest end time selected from all the candidate PDSCHs includes at least two
  • the The end time of the candidate PDSCH grouping all the candidate PDSCHs in the time slot and forming the corresponding HARQ-ACK information also includes: sorting the at least two third candidate PDSCHs according to the priority of the candidate PDSCH type, From the sorted at least two third candidate PDSCHs, one with a higher priority is selected as the actual third candidate PDSCH.
  • This step is specifically set after determining the candidate PDSCH type of the third candidate PDSCH, and determining that there is a time domain with the third candidate PDSCH from the other candidate PDSCHs corresponding to the candidate PDSCH type Before overlapping the fourth candidate PDSCH.
  • the concatenating the HARQ-ACK information corresponding to all the candidate PDSCHs to obtain the codebook includes: sorting the at least one time slot according to the priority of the candidate PDSCH types All of the candidate PDSCHs are serially connected in order from high priority to low priority to form a corresponding complete codebook.
  • the at least one time slot is more than two, all the candidate PDSCHs are grouped according to the candidate PDSCH type and the candidate PDSCH end time, and the corresponding HARQ-ACK information is formed including : Determine the priority of the candidate PDSCH in each time slot according to the service transmitted by the candidate PDSCH type; form the HARQ-ACK information for the candidate PDSCH in each priority in the following manner: from the same priority Select the candidate PDSCH with the earliest end time among the candidate PDSCHs as the fifth candidate PDSCH; determine the sixth candidate PDSCH among the remaining candidate PDSCHs among the candidate PDSCHs of the same priority that overlap with the fifth candidate PDSCH in time domain; The fifth candidate PDSCH and the sixth candidate PDSCH are divided into a small group and form corresponding HARQ-ACK information.
  • the step of concatenating the HARQ-ACK information corresponding to all the candidate PDSCHs to obtain the codebook should be implemented in the following manner:
  • all of the candidate PDSCHs in each time slot are serially connected in order of priority from high to low; according to the time of the at least two time slots
  • the concatenated HARQ-ACK of the PDSCH candidates forms a corresponding complete codebook.
  • the HARQ-ACK of all the candidate PDSCHs with high priority is sequentially concatenated before the HARQ-ACK of all the candidate PDSCHs with low priority to form the HARQ-ACK codebook.
  • first HARQ-ACK of all the candidate PDSCHs in each time slot are serially connected in order of priority from high to low; then the HARQ after the serial connection -ACK is concatenated together according to the time of each time slot to form the HARQ-ACK codebook.
  • HARQ-ACKs for the candidate PDSCHs of the same priority are serially connected together according to time. That is to say, when the candidate PDSCHs of the same priority are divided into groups according to the above two methods A and B, the HARQ-ACK of all candidate PDSCHs of the priority needs to be concatenated in sequence according to the end time of the candidate PDSCH .
  • a step of identifying the candidate PDSCH type in the time slot is also included.
  • the candidate PDSCH in the time slot can be distinguished by identifying the
  • the candidate PDSCH type is determined by means of configuration signaling of the candidate PDSCH; or the candidate PDSCH type is determined according to the number of continuous symbols occupied by each candidate PDSCH identified in the time slot.
  • the configuration signaling includes a radio resource control (Radio Resource Control, RRC) message, or parameter information in Downlink Control Information (DCI), or RNTI (Radio Radio Network Temporary) Identifier adopted by DCI , Temporary Identification of Cell Radio Network) type, or CRC (Cyclic Redundancy Code) type.
  • RRC Radio Resource Control
  • DCI Downlink Control Information
  • RNTI Radio Radio Network Temporary
  • CRC Cyclic Redundancy Code
  • the services corresponding to the candidate PDSCH in the time slot can generally be the following two, URLLC (Ultra Reliable Low Latency Communications, extremely reliable low-latency communication) services and EMBB (Enhance Mobile Broadband, enhanced mobile broadband) services Services, when these two services are specifically implemented in the above steps S301-S303, the specific process is as follows:
  • the number of symbols of URLLC PDSCH is generally relatively small, and the typical value is 1, 2 or 4 symbols.
  • M the number of symbols used by URLLC PDSCH
  • the distinguishing method specifically includes one of the following:
  • Explicit signaling Use dedicated signaling to configure the candidate PDSCH location for URLLC.
  • these locations can allow eMBB transmission when there is no URLLC service, but once URLLC is available, these resources are used first. Or it can be distinguished by the scheduled DCI type or some parameters in DCI. At this time, the UE can also learn which PDSCH locations transmit URLLC.
  • the method for configuring signaling includes one of the following methods: configuring a separate set of possible candidate PDSCH positions for the URLLC service through an RRC message; and using parameters to indicate the set of candidate PDSCH positions from the set of candidate PDSCH positions configured for the UE Among them are the candidate PDSCH locations that may transmit URLLC.
  • URLLC is not a candidate PDSCH set, it can also be used to transmit eMBB if URLLC is not transmitted.
  • the RLC message or DCI parameters indicate that the configured candidate PDSCH should prioritize the use of URLLC services. .
  • M can be divided into different values according to different subcarrier intervals. For example, when 15KHz subcarrier interval, M is 2, when 30KHz subcarrier interval, M is 4. When 60KHz subcarrier interval, M is 8. This is only a possible value, in fact, the value can be different from the one given here, but it needs to be a conventional value.
  • the candidate PDSCH locations that URLLC may use are distinguished. These locations are allowed to transmit eMBB when there is no URLLC service, and once URLLC is available, these resources are used preferentially.
  • the candidate PDSCH positions that URLLC may use are distinguished by the above methods 1) and 2), and are classified as one type; for the remaining candidate PDSCH positions, they can be classified as one type. It is used to transmit eMBB.
  • the eMBB service here is just an example, and it can also be other services different from URLLC.
  • the candidate PDSCH position (or set of positions) means that if the UE transmits PDSCH services in a slot (or subslot), it can only select one or more PDSCH positions from the candidate PDSCH positions for transmission.
  • the next step is to form HARQ-ACK information on the candidate PDSCH, and the formation of HARQ-ACK information specifically includes the following methods:
  • Method 1 First, all the candidate PDSCHs in a slot are divided into large categories according to the type of service, and then the large-class candidate PDSCHs are divided, and on the basis of the large category, each candidate PDSCH is based on The end time and the division of time domain overlap.
  • a semi-static codebook is formed for the remaining candidate PDSCH positions in the slot.
  • the sum of the semi-static codebooks formed by the positions of the two candidate PDSCHs serves as the size of the semi-static codebooks of the positions of all candidate PDSCHs in the slot. In this way, even if punctured transmission occurs in the slot, it can be ensured that the two PDSCHs in which the punctured transmission occurs in the slot have corresponding HARQ-ACK information.
  • the same mechanism can be used to form a semi-static codebook for candidate PDSCH positions that may transmit URLLC, and to form a semi-static codebook for the remaining candidate PDSCH positions.
  • a semi-static codebook for the candidate PDSCH positions that may transmit URLLC it may be: among these candidate PDSCH positions, find the candidate PDSCH with the earliest end time (if there are multiple candidate PDSCHs with the earliest end time, choose from any of them) A), the time-domain overlap with the earliest candidate PDSCH (including partial time-domain overlap), and the same type of candidate PDSCH as a group, the group can only form one HARQ-ACK information in the semi-static codebook .
  • For the remaining candidate PDSCHs continue to perform the above rules for grouping until the candidate PDSCHs are processed.
  • HARQ-ACK information of the candidate PDSCH of the same type is concatenated in the semi-static codebook according to the time of the position of the candidate PDSCH.
  • the formed two-part semi-static codebook it can also be processed in one of the following ways:
  • Method 1 Two semi-static codebooks are respectively carried on different PUCCH channels for transmission; optimally, the URLLC semi-static codebook contains only the semi-static codebook corresponding to the candidate PDSCH that may transmit URLLC (not Contains semi-static codebooks corresponding to candidate PDSCHs not used by URLLC), thereby reducing overhead. However, the non-URLLC semi-static codebook contains only the semi-static codebook corresponding to the candidate PDSCH that may transmit URLLC (this may also include the semi-static codebook corresponding to the candidate PDSCH that may transmit URLLC, to ensure that URLLC may transmit PDSCH Location is used to transmit non-URLLC services), reducing overhead.
  • Method 2 Two parts of semi-static codebooks are concatenated and carried on a PUCCH / PUSCH channel for transmission; where, when concatenated, URLLC's semi-static codebook is preferentially placed before the other part of the semi-static codebook.
  • the coding and decoding principles of polar codes can be used to improve the reliability of URLLC semi-static codebooks and quickly decode URLLC semi-static codebooks, thereby obtaining more data processing time.
  • URLLC may cause HARQ-ACK feedback delay.
  • FDD Frequency Division Duplexing
  • a PDLC of a URLLC is transmitted in the symbol in the top of the slot, then its HARQ-ACK feedback may occur in the symbol corresponding to the symbol in the bottom of the slot In this case, this situation will cause HARQ-ACK feedback delay.
  • TDD Time Division Duplexing
  • Method 2 First, a candidate PDSCH is first determined according to the end time of the candidate PDSCH, and then the corresponding candidate PDSCH is selected according to the service type corresponding to the determined candidate PDSCH for time domain overlap selection.
  • the position of the candidate PDSCH with the earliest end time is selected, and there is a time domain overlap with the earliest candidate PDSCH, and the same type of candidate PDSCH is regarded as a group, and the group forms a
  • the HARQ-ACK information is in the semi-static codebook.
  • the remaining candidate PDSCHs here, the remaining PDSCH candidates of all types
  • the HARQ-ACK information of all candidate PDSCHs in the slot is serially connected to the HARQ-ACK information in the semi-static codebook according to the time of the candidate PDSCH group (it does not distinguish between URLLC candidate PDSCH groups or other types of PDSCH candidate groups). in.
  • a candidate PDSCH with the earliest end time is selected, there are multiple candidate PDSCHs of the same type, and one of them is selected arbitrarily.
  • HARQ-ACK information formed by candidate PDSCHs that may transmit URLLC is placed before HARQ-ACK information formed by another type of candidate PDSCH.
  • the advantage of using the second method is that all the different types of candidate PDSCHs are grouped separately, and all the obtained groups are mixed together according to the time. Delay in ACK feedback.
  • a semi-static codebook is formed for candidate PDSCH positions that may transmit URLLC.
  • a semi-static codebook is formed for the remaining candidate PDSCH positions in the slot.
  • the sum of the semi-static codebooks formed by the positions of the two candidate PDSCHs serves as the size of the semi-static codebooks of the positions of all candidate PDSCHs in the slot. In this way, even if punctured transmission occurs in the slot, it can be ensured that the two PDSCHs in which the punctured transmission occurs in the slot have corresponding HARQ-ACK information.
  • the codebook determination method performs grouping processing on all candidate PDSCHs in a time slot according to candidate PDSCH types and candidate PDSCH end times, and forms corresponding HARQ-ACK information for each group of PDSCH according to the grouping situation Finally, the formed HARQ-ACK information is concatenated according to the end time in order to obtain the final codebook, and the HARQ-ACK information obtained after concatenation is the determined complete codebook, thus achieving the same time
  • the codebook determined by this method has a moderate size to ensure the integrity of data transmission Performance and improve the performance of the equipment.
  • the candidate PDSCHs are divided to form HARQ-ACK information, and a codebook of a corresponding size is obtained, which realizes the transmission of two different service types in the same time slot, and further solves the related technology. Regardless of any service type, as long as the domain overlaps, it will choose one of them to form HARQ-ACK information, and the rest will be prohibited from use, thereby ensuring the integrity of service transmission.
  • FIG. 5 there are 5 candidate PDSCHs in a slot at the same time to implement URLLC service and EMBB service transmission, and there is no time domain overlap between the candidate PDSCHs that implement URLLC service.
  • the candidate PDSCHs overlap with the candidate PDSCHs that implement EMBB services in the time domain, and the specific overlap is shown in FIG. 5.
  • the position of the candidate PDSCH in the slot is illustrated, where the slashed candidate PDSCH is a candidate PDSCH that may transmit URLLC as a type.
  • the remaining PDSCH as a type.
  • the candidate PDSCH positions are divided into groups, and the candidate PDSCHs in diagonal lines form a codebook, and the candidate PDSCHs in a dotted circle are a group. Since the candidate PDSCHs in FIG. 5 are not The fields overlap, so they each form a group to form a HARQ-ACK message in a semi-static codebook. Assume that each PDSCH forms 1 bit HARQ-ACK information, so there are 4 bits HARQ-ACK information.
  • HARQ-ACK For another type of PDSCH, it is also a separate group, forming 1 bit HARQ-ACK information, so that the total HARQ-ACK codebook size in this slot is 5 bits.
  • the concatenation of HARQ-ACK may be: PDSCHs within the same type are concatenated with HARQ-ACK information according to the order in which the virtual coils are generated. Then when HARQ-ACKs of different types of PDSCH are concatenated, HARLC-ACK of URLLC is placed in front. And the preferred concatenation order of HARQ-ACK information is the coding of the imaginary circle in the figure (the concatenation order is optional).
  • the position of the candidate PDSCH of the slot in the figure can also be divided by way 2 of the first embodiment above. If the HARQ-ACK generation of the candidate PDSCH in FIG. 5 is processed according to way 2, the final result is completely consistent with the way 1 of.
  • the processing procedure is to group the PDSCH candidates with the earliest end time first.
  • the end time of the candidate PDSCH that implements the URLLC service is the earliest, and the candidate PDSCH of the URLLC service does not have a mutual time domain.
  • the diagonal PDSCH candidates in FIG. 5 do not overlap in the time domain, so they form a group to form a HARQ-ACK information in the semi-static codebook, and then form a candidate PDSCH that implements EMBB services.
  • FIG. 6 there are 5 candidate PDSCHs in a slot at the same time to implement URLLC service and EMBB service transmission respectively, and there is time domain overlap between the candidate PDSCHs that implement URLLC service, specifically PDSCH1 and PDSCH2 overlap , PDSCH3 and PDSCH4 overlap, PDSCH5 is a separate PDSCH candidate for EMBB service, there is overlap in time domain, the specific overlap is shown in Figure 6.
  • the positions of the candidate PDSCHs in the slot are illustrated, where the slanted candidate PDSCH may transmit the URLLC candidate PDSCH as a type.
  • the remaining PDSCH as a type.
  • the candidate PDSCH positions are grouped.
  • the preferred PDSCH1 is the earliest end, and PDSCH2 overlaps with its time domain. Therefore, PDSCH1 and PDSCH2 are divided into one. Group, and the number is 1.
  • the remaining PDSCH3 and PDSCH4 among the slashed candidates are PDSCH3, which is the earliest end.
  • PDSCH4 overlaps with its time domain, so PDSCH3 and PDSCH4 are grouped together and numbered 2.
  • the candidate PDSCH5 used by non-URLLC it is a separate group, and there is no PDSCH overlapping with its time domain, and the number is 3.
  • the size of the semi-static codebook is 3 bits.
  • the preferred concatenation order of HARQ-ACK information is the coding of the imaginary circle in the figure (the concatenation order is optional).
  • the position of the candidate PDSCH of the slot in the figure can also be divided by way 2 of the first embodiment above. If the HARQ-ACK generation of the candidate PDSCH in FIG. 6 is processed according to way 2, the final result is completely consistent with the way 1 of.
  • FIG. 7 there are 10 candidate PDSCHs in a slot at the same time to implement URLLC service and EMBB service transmission respectively, where PDSCH1, PDSCH2, PDSCH3, PDSCH7, PDSCH8 and PDSCH10 are one type, PDSCH4, PDSCH5, PDSCH6 And PDSCH9 is another type, and there is time domain overlap between candidate PDSCHs that implement URLLC services. The specific overlap is shown in FIG. 7.
  • the positions of the candidate PDSCHs in the slot are illustrated, where the diagonal PDSCH candidates may transmit URLLC candidate PDSCH as a type.
  • the first PDSCH candidate grouping is divided according to the first embodiment of the first embodiment, and a codebook is formed for the diagonal PDSCH candidate.
  • the preferred PDSCH1 is the earliest end, and PDSCH2 overlaps with its time domain. Therefore, PDSCH1 and PDSCH2 are grouped together and numbered 1.
  • the remaining PDSCH3, PDSCH7, PDSCH8, and PDSCH10 among the candidate PDSCHs are at this time.
  • PDSCH3 is the earliest end. It does not overlap with the remaining PDSCH time domains. Therefore, PDSCH3 is a separate group and is numbered 2; Again, select the earliest end from the remaining PDSCH7, PDSCH8, and PDSCH10.
  • PDSCH7 is the earliest end, and overlaps with the PDSCH8 time domain. They are grouped together and numbered 3.
  • PDSCH10 does not overlap with other slash PDSCH time domains, it is a separate group, and the number is 4.
  • the earliest end is selected as PDSCH4, and overlaps with the PDSCH5, and PDSCH6 time domain, they are grouped together and numbered 5.
  • PDSCH9 is not in time domain with other PDSCHs. It is a separate group and is numbered 6. In this way, the size of the semi-static codebook is 6 bits.
  • the preferred concatenation order of HARQ-ACK information is the coding of the imaginary circle in the figure (the concatenation order is optional).
  • FIG. 7 there are 10 candidate PDSCHs in a slot at the same time to implement URLLC service and EMBB service transmission respectively, where PDSCH1, PDSCH2, PDSCH3, PDSCH7, PDSCH8 and PDSCH10 are one type, PDSCH4, PDSCH5, PDSCH6 And PDSCH9 is another type, and there is time domain overlap between candidate PDSCHs that implement URLLC services. The specific overlap is shown in FIG. 7.
  • the grouping of the candidate PDSCH positions can also be divided using the second method of the first embodiment, where the slashed candidate PDSCH may transmit the URLLC candidate PDSCH as a type .
  • the remaining PDSCH as a type.
  • the semi-static codebook is determined as follows:
  • All the candidate PDSCH positions in the slot are selected at the earliest end.
  • PDSCH1 is selected, which overlaps with PDSCH1 time domain, and the same type of candidate PDSCH is PDSCH2, so PDSCH1 and PDSCH2 are a group and numbered 1.
  • the earliest end is selected.
  • PDSCH3 is selected.
  • PDSCH3 in the same type does not overlap with PDSCH3 in time domain, so PDSCH3 is a group alone and numbered 2. Then select the earliest end from the remaining PDSCH. At this time, select PDSCH4.
  • PDSCH5 and PDSCH6 overlap with PDSCH4 time domain, so they are a group of 3 and the number is 3. Then select the earliest end from the remaining PDSCH. At this time, select PDSCH7.
  • PDSCH8 overlaps with PDSCH7 time domain, so they are a group of 2 and the number is 4. Then select the earliest end from the remaining PDSCH. At this time, select PDSCH9.
  • PDSCH does not overlap with PDSCH9 in time domain, so it is a separate group and the number is 5. Then select the earliest end from the remaining PDSCH. At this time, select PDSCH10.
  • PDSCH10 does not overlap with PDSCH10 in the time domain, so it is a separate group and the number is 6. In this way, the size of the semi-static codebook is 6 bits.
  • the concatenation order of HARQ-ACK information is the coding of the virtual circle in the figure, as shown in FIG. 8.
  • the method is to form HARQ-ACK information by priority packets with higher priority of service type, as shown in FIG. 9.
  • the method 2 of the first embodiment is selected for processing, focusing on showing that when selecting the earliest end candidate PDSCH position, if there are different types of candidate PDSCH positions with the same earliest end position,
  • the specific processing methods are as follows:
  • PDSCH1 and PDSCH4 are candidate PDSCH positions for different service types, and PDSCH1 has a higher priority, that is, PDSCH1 may be used to transmit URLLC, and PDSCH4 will not be used to transmit URLLC.
  • PDSCH1 and PDSCH4 have the same earliest end position.
  • the candidate PDSCH position ie PDSCH1 that may transmit URLLC is selected as the first HARQ-ACK information.
  • PDSCH1 and PDSCH2 are regarded as a group, and the number is 1, that is, when the candidate PDSCH with a higher priority is selected for priority processing, the time domain is selected for the selection
  • Overlapping PDSCHs must also be selected and grouped according to the type of PDSCH1.
  • PDSCHs of the same type as PDSCH4 and PDSCH1 cannot be divided into the same group.
  • PDSCH4 is selected to overlap with its time domain, and PDSCH5 and PDSCH6 are among the candidate PDSCHs of the same type as PDSCH4 and overlapping in time domain. At this time, three of them are regarded as a group, and the number is 2.
  • the earliest PDSCH is selected.
  • PDSCH3 is selected and does not overlap with other PDSCHs of the same type. Therefore, it is a single group and the number is 3. And so on.
  • the size of the semi-static codebook is 6 bits.
  • the order of concatenating HARQ-ACK information is the coding of the virtual circle in the figure.
  • the priority of the service type can be set according to the actual situation, that is, the priority of EMBB can also be set to be higher than the priority of UPLLC.
  • the processing method is to select PDSCH4 first for priority processing Too.
  • the HARQ-ACK codebook example corresponding to the position of the candidate PDSCH in a slot or subslot is shown. It is added here that in the second to fourth embodiments, the HARQ-ACK codebook formed by the non-URLLC candidate PDSCH positions can be separately formed into numbers, that is, the coding of the virtual circle of the non-URLLC candidate PDSCH positions also starts from 1. In this way, HARQ-ACK codebooks of non-URLLC candidate PDSCH positions are separately transmitted.
  • the HARQ-ACK codebook when it is possible to process candidate PDSCHs in multiple slots at the same time. If the positions of candidate PDSCHs in each slot are the same in multiple slots or subslots, when the HARQ-ACK codebook is formed: First, it can be processed in the manner of Embodiments 2 to 4, that is, the candidate PDSCH positions that may transmit URLLC in each slot can be formed into a HARQ-ACK codebook, and the candidate PDSCH positions that may be used for URLLC of the multiple slots , HARQ-ACK information bits are concatenated according to time. Similar processing is performed for candidate PDSCH positions that may not be used by URLLC. In this way, the HARQ-ACK codebook when transmitting PDSCH in multiple slots is formed. For both types of HARQ-ACK codebooks, they can be transmitted separately in their respective PUCCH.
  • the HARQ-ACK codebook corresponding to URLLC is concatenated before the other HARQ-ACK codebook.
  • the HARQ-ACK concatenation sequence of candidate PDSCH positions in one slot is exemplified.
  • the HARQ-ACK information of PDSCHs of multiple slots is fed back in one PUCCH / PUSCH, each slot
  • the HARQ-ACK information corresponding to the position of the candidate PDSCH in is concatenated according to the HARQ-ACK sequence of Embodiments 1 to 4.
  • the two methods in the above-mentioned embodiment form a semi-static codebook at the positions of all candidate PDSCHs for the positions of candidate PDSCHs that may transmit URLLC.
  • a semi-static codebook is formed for the remaining candidate PDSCH positions in the slot.
  • the sum of the semi-static codebooks formed by the positions of the two candidate PDSCHs serves as the size of the semi-static codebooks of the positions of all candidate PDSCHs.
  • the two parts of the HARQ-ACK codebook can be sent individually or in series.
  • the concatenation method is to concatenate the HARQ-ACK codebook corresponding to URLLC before another HARQ-ACK codebook.
  • the possible PDSCH positions used by URLLC find the URLLC with the earliest end position in the slot. ), And overlap with other URLLC PDSCHs in its time domain to form a HARQ-ACK message in the HARQ-ACK codebook. Then, for the remaining URLLC PDSCH, find the URLLC with the earliest end PDSCH, and other URLLC overlapping with the time domain PDSCH, forming a HARQ-ACK information in the HARQ-ACK codebook. And so on, until URLLC PDSCH is processed.
  • the candidate PDSCH position with the earliest end time (if there are multiple candidate PDSCH positions with the earliest end time, and belong to the same type, the previous paragraph is processed. If they belong to different types, URLLC PDSCH is processed first, and then other For the PDSCH, the HARQ-ACK information of the PDSCH processed first is placed before the HARQ-ACK information of the post-processed PDSCH), and the earliest candidate PDSCH overlaps in time domain and is the same type of candidate PDSCH as a group, This group forms a HARQ-ACK message in a semi-static codebook.
  • the remaining candidate PDSCHs (here, the remaining PDSCH candidates of all types), continue to perform the above rules for grouping until all candidate PDSCHs are processed. If all candidate PDSCH positions are in multiple slots, similar processing is performed in each slot, and then each slot is concatenated in time to form a semi-static codebook.
  • the embodiment of the present invention also introduces a parameter K to solve the problem of size limitation, and the specific implementation manner is as follows:
  • the parameter K is introduced, and the value of K describes the size of a semi-static codebook related to URLLC service that a UE feeds back in a PUCCH or PUSCH in a slot or sub-slot.
  • the slot or sub-slot supports HARQ-ACK feedback of PDSCHs with M / n URLLCs.
  • the semi-static codebook for URLLC in a slot or sub-slot is always K.
  • the semi-static codebook size in the slot or sub-slot needs to be determined, then the semi-static codebook size is determined according to the related technology, and then K is added to record the total semi-static codebook size.
  • Sub-slot means that the symbols in a slot are divided into multiple sub-slots, and each sub-slot contains the number of consecutive symbols.
  • the corresponding PDSCH positions that may transmit URLLC are divided into K groups in order according to the order.
  • the HARQ-ACK of PDSCH is bundled into n bits.
  • the K value can be configured through RRC messages, MAC CE signaling or physical layer signaling. It may also be a value set of K values configured in the RRC message, and then a value may be selected from the value set of the MAC or CE physical configuration.
  • the device includes: a configuration module 41, configured to determine the PDSCH type and the candidate PDSCH Group the candidate PDSCHs in at least one time slot at the end time and form a hybrid automatic repeat request-acknowledgement HARQ-ACK information corresponding to the grouped candidate PDSCHs; the conversion module 42 is used to convert the candidate PDSCHs Corresponding HARQ-ACK information is concatenated to obtain the codebook.
  • a configuration module 41 configured to determine the PDSCH type and the candidate PDSCH Group the candidate PDSCHs in at least one time slot at the end time and form a hybrid automatic repeat request-acknowledgement HARQ-ACK information corresponding to the grouped candidate PDSCHs
  • the conversion module 42 is used to convert the candidate PDSCHs
  • Corresponding HARQ-ACK information is concatenated to obtain the codebook.
  • the configuration module 41 before the configuration module 41 groups the candidate PSDCH, it also includes classifying the service type of the candidate PDSCH in the time slot. Specifically, when determining all candidate PDSCHs in at least one time slot, the following methods can be used: Come to realize:
  • the type of the candidate PDSCH is determined by identifying the configuration signaling of the candidate PDSCH in the time slot.
  • the configuration signaling includes parameter information in a radio resource control RRC message or downlink control information DCI.
  • the method for configuring signaling includes one of the following methods: configuring a separate set of possible candidate PDSCH positions for the URLLC service through an RRC message; and using parameters to indicate the set of candidate PDSCH positions from the set of candidate PDSCH positions configured for the UE Among them are the candidate PDSCH locations that may transmit URLLC.
  • URLLC is not a candidate PDSCH set, it can also be used to transmit eMBB if URLLC is not transmitted.
  • the RLC message or DCI parameters indicate that the configured candidate PDSCH should prioritize the use of URLLC services. .
  • the candidate PDSCH positions with the number of continuous symbols less than or equal to M are considered to be URLSCH PDSCH positions that should be considered when forming a semi-static codebook.
  • the value of M can be divided into different values according to different subcarrier intervals. For example, when 15KHz subcarrier interval, M is 2, when 30KHz subcarrier interval, M is 4. When 60KHz subcarrier interval, M is 8. This is only a possible value, in fact, the value can be different from the one given here, but it needs to be a conventional value.
  • the candidate PDSCH locations that URLLC may use are distinguished. These locations are allowed to transmit eMBB when there is no URLLC service, and once URLLC is available, these resources are used preferentially.
  • all candidate PDSCHs in the time slot are grouped according to the candidate PDSCH type and the candidate PDSCH end time, and the corresponding HARQ-ACK information is formed for each group of PDSCH according to the grouping situation.
  • the formed HARQ-ACK information is concatenated according to the end time in order to obtain the final codebook, and the HARQ-ACK information obtained after concatenation is the determined complete codebook, thereby achieving the same time slot
  • the terminal includes a processor 211, a memory 212, a communication unit 213, and a communication bus 214.
  • the communication bus 214 is used to implement a communication connection between the processor 2111, the communication unit 213, and the memory 212.
  • the processor 211 is used to execute one or more programs stored in the memory to implement the HARQ-ACK codebook determination method in each of the above embodiments, and the specific implementation process of each step refers to the above implementations The description of the examples will not be repeated here.
  • This embodiment also provides a computer-readable storage medium, which is implemented in any method or technology for storing information (such as computer-readable instructions, data structures, computer program modules, or other data) Volatile or non-volatile, removable or non-removable media.
  • Computer-readable storage media include but are not limited to RAM (Random Access Memory, random access memory), ROM (Read-Only Memory, read-only memory), EEPROM (Electrically Erasable Programmable read only memory, live erasable programmable read-only memory ), Flash memory or other memory technology, CD-ROM (Compact Disc Read-Only Memory, CD-ROM), digital versatile disk (DVD) or other optical disk storage, magnetic box, magnetic tape, magnetic disk storage or other magnetic storage devices, Or any other medium that can be used to store desired information and can be accessed by a computer.
  • RAM Random Access Memory
  • ROM Read-Only Memory
  • EEPROM Electrically Erasable Programmable read only memory
  • live erasable programmable read-only memory Flash
  • the computer-readable storage medium in this embodiment may be used to store one or more first computer programs, and the one or more first computer programs may be executed by one or more processors to implement the above The HARQ-ACK codebook determination method in each embodiment.
  • This embodiment also provides a computer program (or computer software), which can be distributed on a computer-readable medium and executed by a computable device to implement the HARQ-ACK codebook shown in the above embodiments Determine at least one step of the method; and in some cases, at least one step shown or described may be performed in an order different from that described in the above embodiment.
  • a computer program or computer software
  • This embodiment also provides a computer program product, which includes a computer-readable device, and the computer program as shown above is stored on the computer-readable device.
  • the computer-readable device may include the computer-readable storage medium shown above.
  • communication media generally contains computer readable instructions, data structures, computer program modules, or other data in a modulated data signal such as a carrier wave or other transmission mechanism, and may include any information delivery medium. Therefore, this application is not limited to any specific combination of hardware and software.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Communication Control (AREA)

Abstract

本发明实施例提供一种HARQ-ACK码本确定方法及装置、终端、存储介质，该方法包括：根据候选PDSCH类型和候选PDSCH的结束时间对至少一个时隙中的候选PDSCH进行分组，并形成与分组后的所述候选PDSCH对应的HARQ-ACK信息；将所述候选PDSCH对应的HARQ-ACK信息串接，，得到HARQ-ACK码本。

Description

HARQ-ACK码本确定方法及装置、终端、存储介质
本申请要求在2018年11月02日提交中国专利局、申请号为201811303662.0的中国专利申请的优先权，该申请的全部内容通过引用结合在本申请中。
技术领域
本发明实施例涉及但不限于5G通信技术领域，具体而言，涉及但不限于一种混合自动重传请求-确认(Hybrid Automatic Repeat request-Acknowledgement，HARQ-ACK)码本确定方法及装置、终端、计算机可读存储介质。
背景技术
在第五代移动通信系统(the 5th Generation mobile communication system，5G)的中，对于静态码本的大小确定有一条限制，即在一个时隙(slot)中，用户设备(User Equipment，UE)被配置了多个候选传输PDSCH(Physical Downlink Shared Channel，物理下行共享信道)的位置时，对于时域重叠的候选传输PDSCH的位置，UE只确定一个HARQ-ACK(Hybrid Automatic Repeat reQuest-Acknowledgement，混合自动重传请求-确认)信息在半静态HARQ-ACK码本中。
这种限制也意味着，对于上述时域重叠的候选PDSCH，基站只能调度其中一个候选PDSCH来传输。例如，在图1a和1b中，对于一个UE，一个slot中被配置了2个候选传输PDSCH的位置，但是它们之间存在时域重叠(即图1中的横向方向上的重叠)，此时基站调度PDSCH时，只能调度其中一个候选PDSCH来传输，UE也只针对一个PDSCH形成一个HARQ-ACK信息在半静态码本中。
但是，在考虑支持低时延高可靠的URLLC(Ultra-Reliable and Low Latency Communications，高可靠低时延通信)业务时，打孔传输作为一个候选方案被讨论，即下行UE内(intra UE)PDSCH复用传输，例如，在图2a和2b中示意了2个候选PDSCH位置在一个slot中，在图2a中，eMBB(Enhance Mobile Broadband，增强移动宽带)的业务使用候选PDSCH1位置先开始传输，正在传输，但是突然有一个URLLC的业务需要立即传输，基站就在PDSCH2的位置进行传输，此时，在PDSCH1和PDSCH2时域重叠的位置中，由于URLLC的业务的优先级先对较高，因此PDSCH1中在PDSCH2对应的时域位置上被禁止传输了，而PDSCH2被传输在时域重叠的位置中。PDSCH1能被继续传输在非时域重叠的位置，这样，PDSCH1就被PDSCH2打孔了。PDSCH1的部分数据被打孔了，存在数据未被传输，未被UE接收到。在图2b中，也是类似，只是候选PDSCH1 和PDSCH2不仅时域重叠，频域也发生了重叠。同样的，时域重叠的位置(实际就是重叠的正交频分复用技术(Orthogonal Frequency Division Multiplexing，OFDM)符号)中，PDSCH1被禁止传输了。
对于图2a和2b中的传输方式，相关技术中的半静态码本机制不合理，因为它仅仅反馈一个HARQ-ACK信息在slot中，实际上这里传输了2个PDSCH，但有一个PDSCH被打孔了，虽然在实际情况中有可能会存在被正确解码的可能性(编解码增益)，但毕竟这只是非常小的概率。
发明内容
本发明实施例提供的一种HARQ-ACK码本确定方法及装置、终端、存储介质，以解决在静态码本确定中，对于同一时隙中配置多个候选PDSCH只能选择其一形成码本，导致数据未被传输的技术问题。
本发明实施例提供了一种HARQ-ACK码本确定方法，所述方法包括：
根据候选物理下行共享信道PDSCH类型和所述候选PDSCH的结束时间对至少一个时隙中的所述候选PDSCH进行分组，并形成与分组后的所述候选PDSCH对应的混合自动重传请求-确认HARQ-ACK信息；
将所述候选PDSCH对应的HARQ-ACK信息串接，得到HARQ-ACK码本。
本发明实施例还提供了一种HARQ-ACK码本确定装置，包括：
配置模块，用于根据候选物理下行共享信道PDSCH类型和所述候选PDSCH的结束时间对至少一个时隙中的所述候选PDSCH进行分组，并形成与分组后的所述候选PDSCH对应的混合自动重传请求-确认HARQ-ACK信息；
转换模块，用于将所述候选PDSCH对应的HARQ-ACK信息串接，得到所述码本。
本发明实施例还提供了一种终端，包括处理器、存储器、通信单元和通信总线；
所述通信总线用于实现所述处理器、所述通信单元和所述存储器之间的通信连接；
所述处理器用于执行存储器中存储的一个或者多个程序，以实现如上所述的HARQ-ACK码本确定方法。
本发明实施例还提供了一种计算机可读存储介质，所述计算机可读存储介质存储有一个或者多个计算机程序，所述一个或者多个计算机程序可被一个或者多个处理器执行，以实现如上所述的HARQ-ACK码本确定方法。
根据本发明实施例提供的HARQ-ACK码本确定方法及装置、终端、计算机可读存储介质，该方法通过根据候选PDSCH类型和候选PDSCH的结束时间来对时隙中的所有候选PDSCH进行分组处理，根据分组的情况对每组的PDSCH形成对应的HARQ-ACK信息，最后将形成的HARQ-ACK信息按照结束时间的先后进行串接，从而得到最终的码本，而串接后得到的HARQ-ACK信息即是确定的完整的码本，从而实现了在同一时隙中同时配置多个候选PDSCH且存在时域重叠时也能保证打孔传输时不会出现部分候选PDSCH禁止使用的问题，并且通过该方法确定的码本其大小适中，可以保证数据传输的完整性，提高了设备的使用性能。
附图说明
图1a为相关技术中的一种同一时隙中配置多个候选PDSCH时域重叠示意图；
图1b为相关技术中的另一种同一时隙中配置多个候选PDSCH时域重叠示意图；
图2a为相关技术中的一种同一时隙中配置多个候选PDSCH的复用传输示意图；
图2b为相关技术中的另一种同一时隙中配置多个候选PDSCH的复用传输示意图；
图3为本发明实施例提供的码本确定方法的流程图；
图4为本发明实施例提供的码本确定装置的结构示意图；
图5为本发明实施例提供的同一时隙中候选PDSCH时域重叠的第一种分组划分示意图；
图6为本发明实施例提供的同一时隙中候选PDSCH时域重叠的第二种分组划分示意图；
图7为本发明实施例提供的同一时隙中候选PDSCH时域重叠的第三种分组划分示意图；
图8为本发明实施例提供的同一时隙中候选PDSCH时域重叠的第四种分组划分示意图；
图9为本发明实施例提供的同一时隙中候选PDSCH时域重叠的第五种分组划分示意图；
图10为本发明实施例的通信设备的结构示意图。
具体实施方式
为了使本发明的目的、技术方案及优点更加清楚明白，下面通过具体实施方式结合附图对本发明实施例作进一步详细说明。应当理解，此处所描述的具体实施例仅仅用以解释本申请，并不用于限定本申请。
实施例一：
相关技术中，在同一时隙中同时配置多个候选PDSCH时，由于会存在时域重叠而导致在实际使用候选PDSCH时，会从时域重叠的候选PDSCH中只选择一个来使用，而这样就会出现了候选PDSCH的部分被禁止的现象，而影响数据传输的完整性。而在实际应用中，由于配置的候选PDSCH中会存在用于实现不同的业务类型的传输的问题，针对于这个问题，本发明实施例提出了一种码本确定方法，该方法通过根据候选PDSCH类型和配置的候选PDSCH的结束时间来进行HARQ-ACK信息的分组和串接(串接是指将HARQ-ACK信息在比特级别级联起来，也称为复用，即将HARQ-ACK信息在比特级复用在一起，作为一个HARQ-ACK码本)，从而实现在同一时隙中，即使是重叠的候选PDSCH，只要其业务类型不同，也可以进行HARQ-ACK码本的配置，实现数据的传输。
请参见图3所示，该码本确定方法的实现步骤，具体如下：
S301，根据候选PDSCH类型和候选PDSCH的结束时间对至少一个时隙中的候选PDSCH进行分组，并形成与分组后的候选PDSCH对应的HARQ-ACK信息。
在实际应用中，所述候选PDSCH类型也是对应于业务的类型，候选PDSCH类型可以通过其传输的业务类型来区分时隙中的候选PDSCH对应的类型和所在时隙中的位置，即是服务的业务类型，在对时隙的候选PDSCH的配置中，会根据不同的业务类型配置不同的候选PDSCH，同时不同的业务对于候选PDSCH中所占用的持续符号数量也是存在不同的。所以，这里的业务类型、业务类型优先级，与候选PDSCH类型对应的。业务优先级高，对应的候选PDSCH类型优先级就高。
在该步骤中，在对所有的候选PDSCH进行分组时，具体可以通过以下两种方式来实现：
方式一，先对所有的候选PDSCH按照候选PDSCH类型进行归类，形成不同的候选PDSCH集合，然后再分别对每个集合中的候选PDSCH形成码本这里的码本具体是半静态HARQ-ACK码本(下面也称为半静态码本，或码本)，在形成半静态码本时，具体是先对每个集合中的候选PDSCH时域重叠分组，按照分组进行一一形成HARQ-ACK信息。
方式二，将所有的候选PDSCH按照结束时间的先后顺序进行分组，然后按照分组进行一一形成HARQ-ACK信息，而根据结束时间分组的同时还是要考虑将同一业务类型的候选PDSCH划分至同一组中，最后按照分组后的候选PDSCH的结束时间先后进行串接形成HARQ-ACK信息。
S302，将所有所述候选PDSCH对应的HARQ-ACK信息串接，得到码本。
在该步骤中，在串接时，具体可以通过以下方式进行排布串接：首先对候选PDSCH对应的候选PDSCH类型进行优先级的排序，根据优先级的排序，将HARQ-ACK信息从优先级高到低的顺序依次串接，从而得到完整的码本，而该码本的总长度即是HARQ-ACK信息的总组别数量长度。
在本实施例中，通过该方法实现码本的确定，可以根据时隙的实际数量进行处理，若所述至少一个时隙为一个时，所述根据候选PDSCH类型和所述候选PDSCH的结束时间对至少一个时隙中的所述候选PDSCH进行分组，并形成对应的HARQ-ACK信息包括：确定所述待传输业务的优先级；按照所述候选PDSCH类型将所有的所述候选PDSCH分为至少两组候选PDSCH组合；从同一候选PDSCH类型对应的候选PDSCH组合中按照每个所述候选PDSCH的结束时间的先后进行小组划分，并对划分后的小组中的所述候选PDSH形成对应的HARQ-ACK信息。
进一步的，在对同一优先级的候选PDSCH的划分，具体可以通过以下方式来实现：从同一候选PDSCH对应的候选PDSCH组合中确定所述结束时间最早的第一候选PDSCH；确定所述候选PDSCH组合中剩余的候选PDSCH中与所述第一候选PDSCH存在时域重叠的第二候选PDSCH；将所述第一候选PDSCH和所述第二候选PDSCH划分为一个小组。
而划分出第一候选PDSCH和所述第二候选PDSCH之后，还需要对同一候选PDSCH类型对应的候选PDSCH组合中除了第一候选PDSCH和所述第二候选PDSCH之外的剩余候选PDSCH再进行分组，具体实现方式与第一候选PDSCH和所述第二候选PDSCH的分组方式相同。
该分组方式即是先对一个时隙slot中的所有候选PDSCH先按照业务的类型进行大类别的划分，然后再对大类别候选PDSCH作进行的划分，而在大类别的基础上是根据每个候选PDSCH的结束时间以及时域的重叠情况的划分。
在本实施例中，对于一个时隙的候选PDSCH划分中还可以通过以下方式实现，即是：所述根据候选PDSCH类型和所述候选PDSCH的结束时间对至少一个时隙中的所述候选PDSCH进行分组，并形成与分组后的所述候选PDSCH对应的HARQ-ACK信息包括：确定所有的所述候选PDSCH中的结束时间；从至 少一个时隙中的所述候选PDSCH中选择所述结束时间最早的第三候选PDSCH；确定所述第三候选PDSCH的候选PDSCH类型；从与所述候选PDSCH类型对应的其他所述候选PDSCH中确定与所述第三候选PDSCH存在时域重叠的第四候选PDSCH；将所述第三候选PDSCH和所述第四候选PDSCH划分为一个小组。
而划分出第三候选PDSCH和所述第四候选PDSCH之后，还需要对时隙中的除了第三候选PDSCH和所述第四候选PDSCH之外的剩余的所有候选PDSCH再进行分组，具体实现方式与第三候选PDSCH和所述第四候选PDSCH的分组方式相同。
也即是的该分组方式首先是按照候选PDSCH的结束时间先确定一个候选PDSCH，然后根据该确定的候选PDSCH对应的业务类型选择对应的候选PDSCH进行时域重叠的选择，即是将同一业务类型的候选PDSCH划分为同一组。
进一步的，在先根据结束时间来分组的方式中，若所述从所有的所述候选PDSCH中选择所述结束时间最早的第三候选PDSCH包括至少两个时，所述根据候选PDSCH类型和所述候选PDSCH的结束时间对时隙内所有的所述候选PDSCH进行分组，并形成对应的HARQ-ACK信息还包括：对所述至少两个第三候选PDSCH按照候选PDSCH类型的优先级进行排序，从排序后的至少两个第三候选PDSCH中选择优先级较高的一个作为实际的第三候选PDSCH。该步骤具体是设置在所述确定所述第三候选PDSCH的候选PDSCH类型之后，在所述从与所述候选PDSCH类型对应的其他所述候选PDSCH中确定与所述第三候选PDSCH存在时域重叠的第四候选PDSCH之前。
在上述的划分基础上，所述将所有所述候选PDSCH对应的HARQ-ACK信息串接，得到所述码本包括：根据所述候选PDSCH类型的优先级排序，将所述至少一个时隙中的所有所述候选PDSCH按照从优先级高到低的方式依次串接，形成对应的完整码本。
在本实施例中，若所述至少一个时隙为两个以上时，根据候选PDSCH类型和所述候选PDSCH的结束时间对所有的所述候选PDSCH进行分组，并形成对应的HARQ-ACK信息包括：根据所述候选PDSCH类型所传输的业务确定每个时隙中的所述候选PDSCH的优先级；对各个优先级中的所述候选PDSCH按照以下方式形成HARQ-ACK信息：从同一优先级的候选PDSCH中选择结束时间最早的候选PDSCH作为第五候选PDSCH；确定所述同一优先级的候选PDSCH中剩余的候选PDSCH中与所述第五候选PDSCH存在时域重叠的第六候选PDSCH；将所述第五候选PDSCH和所述第六候选PDSCH划分为一个小组，并 形成对应的HARQ-ACK信息。
这时，所述将所有所述候选PDSCH对应的HARQ-ACK信息串接，得到所述码本的步骤，应该采用以下方式实现：
A、根据所述候选PDSCH类型的优先级排序，将每个时隙中的所有所述候选PDSCH按照优先级从高到低的方式依次串接；根据所述至少两个时隙的时间先后将串接后的所述候选PDSCH的HARQ-ACK串接形成对应的完整码本。
具体的，根据所述候选PDSCH类型的优先级排序，将优先级高的所有所述候选PDSCH的HARQ-ACK依次串接于优先级低的所有所述候选PDSCH的HARQ-ACK之前，形成所述HARQ-ACK码本。
B、根据所述候选PDSCH类型的优先级排序，先将每个时隙中的所有所述候选PDSCH的HARQ-ACK按照优先级从高到低的方式依次串接；然后将串接后的HARQ-ACK按照每个时隙的时间先后再串接在一起，形成所述HARQ-ACK码本。
其中，对于同一优先级的候选PDSCH的HARQ-ACK之间按照时间先后串接在一起。也即是说根据上述A、B两种方式对同一优先级的候选PDSCH进行分组划分时，也需要按照其候选PDSCH的结束时间先后进行串接而得到该优先级的所有候选PDSCH的HARQ-ACK。
在本实施例中，在步骤S301之前，还包括识别时隙中的候选PDSCH类型的步骤，具体可以通过以下方式来实现对时隙中的候选PDSCH进行区分：通过识别所述时隙中所述候选PDSCH的配置信令的方式来确定所述候选PDSCH类型；或者根据识别所述时隙中每个候选PDSCH所占有的持续符号数来确定所述候选PDSCH类型。
在本实施例中，所述配置信令包括无线资源控制(Radio Resource Control，RRC)消息，或下行控制信息(Downlink Control Information，DCI)中的参数信息，或DCI采用的RNTI(Radio Network Temporary Identifier，小区无线网络临时标识)类型，或CRC(Cyclic Redundancy Code，循环冗余码)类型。这里包括采用下面的方式：通过不同的RRC消息配置候选PDSCH集合，每个RRC消息配置的候选PDSCH集合分别单独进行HARQ-ACK码本的确定(也就是说，每个RRC消息配置的候选PDSCH集合为一种候选PDSCH的类型)；或者，RRC消息配置一个总的候选PDSCH集合，然后再利用RRC参数指示出，或约定总的候选PDSCH集合中的一部分候选PDSCH对应一种PDSCH类型，另一部分候选PDSCH对应另一种PDSCH类型。
在实际应用中，对于时隙中的候选PDSCH对应的业务一般可以是以下两种， URLLC(Ultra Reliable Low Latency Communications，极可靠低延迟通信)的业务和EMBB(Enhance Mobile Broadband，增强移动宽带)的业务，对于这两种业务具体采用上述步骤S301-S303的方式实现时，具体过程如下：
对于URLLC的业务，它有一些特点，例如，URLLC的PDSCH持续的符号数量一般比较少，典型值有1，2或4个符号。也就是说根据URLLC传输的具体特点，URLLC的PDSCH使用的符号数存在一个典型上限值，假设为M。为了合理的计入码本大小，不引入额外的开销，下面假设能够区分出URLLC可能的候选PDSCH位置。
而对于这两种业务，首先要对时隙中候选PDSCH进行区分，区分出哪些候选PDSCH是用于URLLC业务的传输，哪些是用于EMBB业务的传输，而该区分方法具体包括以下之一：
1)明确信令通知：使用专用信令为URLLC配置的候选PDSCH位置。当然，为了避免资源浪费，在没有URLLC业务时，这些位置可以允许传输eMBB，但是，一旦有URLLC时，就优先使用这些资源。或者通过调度的DCI类型或DCI中的部分参数来区分。此时UE也可以获知那些PDSCH位置传输URLLC。
对于配置信令的方式，具体包括下面的方式之一：通过RRC消息为URLLC业务配置单独的可能候选PDSCH位置集合；从为UE配置的候选PDSCH位置集合中，再使用参数指示出候选PDSCH位置集合中那些是可能传输URLLC的候选PDSCH位置。
但在实际应用中，URLLC可能的候选PDSCH集合中，如果不传输URLLC，则其也可以用于传输eMBB，总的来说，通过RRC消息或者DCI参数指示配置的候选PDSCH要优先URLLC业务的使用。
2)按照约定数量的持续符号数区分。也就是说，对于持续符号数小于或等于M的候选PDSCH位置，认为都是可能传输URLLC的PDSCH位置，在形成半静态码本时要进行考虑。对于M的取值，可以根据不同子载波间隔分为不同的取值，例如15KHz子载波间隔时，M为2，30KHz子载波间隔时，M为4。60KHz子载波间隔时，M为8。这里只是给出可能的取值，实际上取值可以不同于此处给出的，但需要是一个约定值。同样的，为了避免资源浪费，区分出URLLC可能使用的候选PDSCH位置，这些位置是允许传输eMBB在没有URLLC业务时，一旦有URLLC时，就优先使用这些资源。
通过上述的方式1)和2)区别出来URLLC可能使用的候选PDSCH位置，归为一个类型；对于剩余的候选PDSCH位置，则可以归为一个类型。用于传输eMBB，这里eMBB业务只是一个例子，也可以是其他不同于URLLC的业务。 候选PDSCH位置(或位置集合)的意思是如果UE在一个slot(或子时隙(subslot))中传输PDSCH业务，只能从候选PDSCH位置中选择一个或多个PDSCH位置来传输。
进一步的，在区分出候选PDSCH所优先使用的业务后，接下来就是需要对候选PDSCH进行形成HARQ-ACK信息，而形成HARQ-ACK信息具体包括以下方式：
方式一，先对一个时隙slot中的所有候选PDSCH先按照业务的类型进行大类别的划分，然后再对大类别候选PDSCH作进行的划分，而在大类别的基础上是根据每个候选PDSCH的结束时间以及时域的重叠情况的划分。
即是，对于所有候选PDSCH的位置在一个slot中，对于可能传输URLLC的候选PDSCH位置，形成半静态码本。对slot中剩余的候选PDSCH位置形成半静态码本。两部分候选PDSCH位置形成的半静态码本之和作为该slot中所有候选PDSCH的位置的半静态码本大小。这样，即使slot中出现了打孔传输，也可以保证使得slot中发生打孔传输的两个PDSCH均有对应的HARQ-ACK信息。
对于可能传输URLLC的候选PDSCH位置形成半静态码本，以及对于剩余的候选PDSCH位置形成半静态码本可以使用相同的机制。例如，对于可能传输URLLC的候选PDSCH位置形成半静态码本，可以是：在这些候选PDSCH位置中，找出结束时间最早的候选PDSCH(如果结束时间最早的候选PDSCH有多个，从其中任意选一个)，将与该最早的候选PDSCH存在时域重叠(包括部分时域重叠)的，且是同一类型的候选PDSCH作为一个组，该组只能形成一个HARQ-ACK信息在半静态码本中。对于剩余的候选PDSCH，继续执行上述规则进行分组，直到候选PDSCH都被处理。
在传输PDSCH的slot或subslot中，如果这些PDSCH的HARQ-ACK码本被指示要在一个slot或subslot中的一个PUCCH(Physical Uplink Control CHannel，物理上行链路控制信道)/PUSCH(Physical Uplink Shared Channel，物理上行共享信道)传输，则同一类型的候选PDSCH的HARQ-ACK信息按照候选PDSCH位置的时间先后串接HARQ-ACK信息在半静态码本中。
对于形成的两部分半静态码本，也可以采用下面的方式之一进行处理：
方式一：将两部分半静态码本分别承载在不同的PUCCH信道中进行传输；最佳的，在URLLC的半静态码本，中只包含可能传输URLLC的候选PDSCH对应的半静态码本(不包含非URLLC使用的候选PDSCH对应的半静态码本)，从而减少开销。但是在非URLLC的半静态码本，中只包含除了可能传输URLLC的候选PDSCH对应的半静态码本(这里也可以包含可能传输URLLC的候选 PDSCH对应的半静态码本，以确保URLLC可能传输PDSCH位置被使用传输了非URLLC业务)，减少开销。
方式二：将两部分半静态码本串接，承载在一个PUCCH/PUSCH信道中进行传输；其中，串接时，优先将URLLC的半静态码本放置在另一个部分半静态码本之前，这样可以利用极化(polar)码的编解码原理，提升URLLC半静态码本的可靠性以及快速的解码URLLC的半静态码本，从而获得更多的数据处理时间。
对于方式一，它会要求slot中的所有候选PDSCH形成一个半静态码本之后再反馈，对于URLLC在一些情况会产生HARQ-ACK反馈的延迟。例如，频分双工(Frequency Division Duplexing，FDD)时，一个URLLC的PDSCH被传输在slot的中靠前的符号中，那么它的HARQ-ACK反馈可能发生在对应于该slot中靠后的符号中，这种情况会导致HARQ-ACK反馈延迟。这种情况也不是经常发生的，且在时分双工(Time Division Duplexing，TDD)时，没有任何问题。
方式二，首先是按照候选PDSCH的结束时间先确定一个候选PDSCH，然后根据该确定的候选PDSCH对应的业务类型选择对应的候选PDSCH进行时域重叠的选择。
即是，对于所有候选PDSCH的位置在一个slot中，选择结束时间最早的候选PDSCH位置，与该最早的候选PDSCH存在时域重叠的，且是同一类型的候选PDSCH作为一个组，该组形成一个HARQ-ACK信息在半静态码本中。对于剩余的候选PDSCH(这里是所有类型的候选PDSCH中剩余的)，继续执行上述规则进行分组，直到所有候选PDSCH都被处理。
slot中所有候选PDSCH的HARQ-ACK信息按照候选PDSCH组(这里不区分是URLLC的候选PDSCH构成的组还是其他类型的候选PDSCH构成的组)的时间先后串接HARQ-ACK信息在半静态码本中。
如果选择结束时间最早的候选PDSCH时，存在多个同一类型的候选PDSCH，则从其中任意选一个。
如果选择结束时间最早的候选PDSCH时，存在多个不同类型的候选PDSCH，则对于不同类型的候选PDSCH分别执行：与该最早候选PDSCH存在时域重叠的，且是同一类型的候选PDSCH作为一个组，该组形成一个HARQ-ACK信息在半静态码本中。优选的，将可能传输URLLC的候选PDSCH形成的HARQ-ACK信息放置在另一个类型的候选PDSCH形成的HARQ-ACK信息之前。
采用方式二的优点是将所有不同类型的候选PDSCH各自分组，且将得到的所有组混合在一起按照时间先后串接每组的HARQ-ACK信息在半静态码本中， 这样不会导致HARQ-ACK反馈的延迟。
对于方式一和二，对于可能传输URLLC的候选PDSCH位置，形成半静态码本。对slot中剩余的候选PDSCH位置形成半静态码本。两部分候选PDSCH位置形成的半静态码本之和作为该slot中所有候选PDSCH的位置的半静态码本大小。这样，即使slot中出现了打孔传输，也可以保证使得slot中发生打孔传输的两个PDSCH均有对应的HARQ-ACK信息。
本实施例提供的码本确定方法，通过根据候选PDSCH类型和候选PDSCH的结束时间来对时隙中的所有候选PDSCH进行分组处理，根据分组的情况对每组的PDSCH形成对应的HARQ-ACK信息，最后将形成的HARQ-ACK信息按照结束时间的先后进行串接，从而得到最终的码本，而串接后得到的HARQ-ACK信息即是确定的完整的码本，从而实现了在同一时隙中同时配置多个候选PDSCH且存在时域重叠时也能保证打孔传输时不会出现部分候选PDSCH禁止使用的问题，并且通过该方法确定的码本其大小适中，可以保证数据传输的完整性，提高了设备的使用性能。
进一步的，根据候选PDSCH类型的优先级来划分候选PDSCH形成HARQ-ACK信息，得到对应大小的码本，实现了在同一时隙上可以实现两种不同业务类型的传输，进一步解决了相关技术中不管任何业务类型，只要有时域重叠其就会选择其中之一来形成HARQ-ACK信息，剩余的则会被禁止使用的问题，从而保证业务传输的完整性。
实施例二：
下面结合具体的应用场景来对本发明实施例提供的码本确定方法进行详细说明，具体以一个时隙中同时存在URLLC的业务和EMBB的业务传输的多个候选PDSCH为例进行说明。
如图5所示，在一个时隙slot中同时存在5个候选PDSCH分别实现URLLC的业务和EMBB的业务传输，而实现URLLC的业务的候选PDSCH之间不存在时域重叠，实现URLLC的业务的候选PDSCH分别与实现EMBB的业务的候选PDSCH存在时域重叠，具体重叠情况如图5所示。
在图中，示意了slot中候选的PDSCH位置，其中斜线的候选PDSCH为可能传输URLLC的候选PDSCH，作为一个类型。剩余的PDSCH作为一个类型。按照上述实施例一的方式一进行候选PDSCH位置的分组划分，对于斜线的候选PDSCH形成码本，其中一个虚线圈内的候选PDSCH为一个组，由于图5中斜线的候选PDSCH并没有时域重叠，所以各自组成一个组，形成一个HARQ-ACK 信息在半静态码本中。假设每个PDSCH形成1bit HARQ-ACK信息，这样就有4bits HARQ-ACK信息。对于另一个类型的PDSCH，也是单独一个组，形成1bit HARQ-ACK信息，这样，该slot中总的HARQ-ACK码本大小为5bits。HARQ-ACK的串接可以是：同一类型内的PDSCH按照虚线圈的产生顺序串接HARQ-ACK信息。然后不同类型的PDSCH的HARQ-ACK串接时，URLLC的HARQ-ACK放置在前面。且优选的HARQ-ACK信息的串接顺序为图中虚圈的编码(串接的顺序为可选的)。
进一步的，图中slot的候选PDSCH位置，还可以通过上述实施例一的方式二进行划分，如果按照方式二来处理图5中的候选PDSCH的HARQ-ACK产生，最终结果与方式一是完全一致的。
但是其处理过程变成了先以候选PDSCH位置的结束时间最早来分组，在图中可知，实现URLLC的业务的候选PDSCH的结束时间是最早的，并且URLLC的业务的候选PDSCH并没有相互时域重叠，因此，图5中斜线的候选PDSCH并没有时域重叠，所以各自组成一个组，形成一个HARQ-ACK信息在半静态码本中，然后再将实现EMBB的业务的候选PDSCH的组成一个组，最后不同类型的PDSCH的HARQ-ACK串接时，URLLC的HARQ-ACK放置在前面。且优选的HARQ-ACK信息的串接顺序为图中虚圈的编码。
实施例三：
如图6所示，在一个时隙slot中同时存在5个候选PDSCH分别实现URLLC的业务和EMBB的业务传输，而实现URLLC的业务的候选PDSCH之间存在时域重叠，具体是PDSCH1和PDSCH2重叠，PDSCH3和PDSCH4重叠，PDSCH5是单独的实现EMBB的业务的候选PDSCH存在时域重叠，具体重叠情况如图6所示。
在图6中，示意了slot中候选的PDSCH位置，其中斜线的候选PDSCH可能传输URLLC的候选PDSCH，作为一个类型。剩余的PDSCH作为一个类型。按照上述实施例一的方式一进行候选PDSCH位置的分组划分，对于斜线的候选PDSCH形成码本，首选PDSCH1是最早结束的，与它时域重叠的有PDSCH2，所以，PDSCH1和PDSCH2分为一组，且编号为1。斜线的候选PDSCH中剩余的为PDSCH3和PDSCH4，此时PDSCH3是最早结束的，与它时域重叠的有PDSCH4，所以PDSCH3和PDSCH4分为一组，且编号为2。对于非URLLC使用的候选PDSCH5，它单独一组，且没有与它时域重叠的PDSCH，且编号为3。这样半静态码本大小为3bits。且优选的HARQ-ACK信息的串接顺序为图中虚圈的编码(串接的顺序为可选的)。
进一步的，图中slot的候选PDSCH位置，还可以通过上述实施例一的方式二进行划分，如果按照方式二来处理图6中的候选PDSCH的HARQ-ACK产生，最终结果与方式一是完全一致的。
实施例四：
如图7所示，在一个时隙slot中同时存在10个候选PDSCH分别实现URLLC的业务和EMBB的业务传输，其中PDSCH1、PDSCH2、PDSCH3、PDSCH7、PDSCH8和PDSCH10为一个类型，PDSCH4、PDSCH5、PDSCH6和PDSCH9为另一个类型，而实现URLLC的业务的候选PDSCH之间存在时域重叠，具体重叠情况如图7所示。
在图7中，示意了slot中候选的PDSCH位置，其中斜线的候选PDSCH可能传输URLLC的候选PDSCH作为一个类型。剩余的PDSCH作为一个类型。按照上述实施例一的方式一进行候选PDSCH位置的分组划分，对于斜线的候选PDSCH形成码本。
首选PDSCH1是最早结束的，与它时域重叠的有PDSCH2，所以，PDSCH1和PDSCH2分为一组，且编号为1。斜线的候选PDSCH中剩余的为PDSCH3，PDSCH7，PDSCH8和PDSCH10，此时PDSCH3是最早结束的，它未与剩余的其他斜线PDSCH时域重叠，所以，PDSCH3单独一组，且编号为2；再次从剩余的PDSCH7，PDSCH8和PDSCH10中选择最早结束的，PDSCH7为最早结束的，且与PDSCH8时域重叠，它们作为一组，且编号为3。PDSCH10未与其他斜线PDSCH时域重叠，单独一组，且编号为4。对于非URLLC使用的候选PDSCH5，PDSCH5，PDSCH6和PDSCH9，选择最早结束的为PDSCH4，且与PDSCH5，和PDSCH6时域重叠，它们分为一组，且编号为5。剩余的非URLLC使用的PDSCH中，PDSCH9未与其他PDSCH时域冲的，它单独一组，且编号为6。这样半静态码本大小为6bits。且优选的HARQ-ACK信息的串接顺序为图中虚圈的编码(串接的顺序为可选的)。
实施例五：
如图7所示，在一个时隙slot中同时存在10个候选PDSCH分别实现URLLC的业务和EMBB的业务传输，其中PDSCH1、PDSCH2、PDSCH3、PDSCH7、PDSCH8和PDSCH10为一个类型，PDSCH4、PDSCH5、PDSCH6和PDSCH9为另一个类型，而实现URLLC的业务的候选PDSCH之间存在时域重叠，具体重叠情况如图7所示。
在本实施例中，对于图7中的候选PDSCH重叠情况，还可以采用上述实施例一的方式二进行候选PDSCH位置的分组划分，其中斜线候选PDSCH的可能传输URLLC的候选PDSCH，作为一个类型。剩余的PDSCH作为一个类型。按照方式二，确定半静态码本具体为：
slot中所有候选PDSCH位置，选择最早结束的，此时选择为PDSCH1，与PDSCH1时域重叠，且是同一类型的候选PDSCH为PDSCH2，所以PDSCH1和PDSCH2为一组，且编号为1。剩余的所有候选PDSCH位置中，再选择最早结束的，此时选择为PDSCH3，同一类型中与PDSCH3没有时域重叠的PDSCH，所以PDSCH3单独为一组，且编号为2。再从剩余的PDSCH中选择最早结束的，此时选择为PDSCH4，同一类型中与PDSCH4时域重叠有PDSCH5和PDSCH6，所以它们3个一组，且编号为3。再从剩余的PDSCH中选择最早结束的，此时选择为PDSCH7，同一类型中与PDSCH7时域重叠有PDSCH8，所以它们2个一组，且编号为4。再从剩余的PDSCH中选择最早结束的，此时选择为PDSCH9，同一类型中与PDSCH9没有时域重叠的PDSCH，所以它单独一组，且编号为5。再从剩余的PDSCH中选择最早结束的，此时选择为PDSCH10，同一类型中与PDSCH10没有时域重叠的PDSCH，所以它单独一组，且编号为6。这样半静态码本大小为6bits。且HARQ-ACK信息的串接顺序为图中虚圈的编码，具体如图8所示。
实施例六：
本实施例中，对于同一个时隙中的候选PDSCH的时域重叠还存在另一种情况，就是通过存在两个实现不同业务类型的候选PDSCH的结束时间相同，而对于这种情况一般采用的方式是以业务类型的优先级较高的优先分组形成HARQ-ACK信息，具体如图9所示。
在本实施例中，对图9的情况，选择采用实施例一的方式二进行处理，重点展示在选择最早结束的候选PDSCH位置时，如果存在不同类型的候选PDSCH位置的最早结束位置相同时，具体的处理方法如下：
图9中，PDSCH1和PDSCH4是不同业务类型的候选PDSCH位置，而PDSCH1的优先级较高，即PDSCH1可能用于传输URLLC，PDSCH4不会被用于传输URLLC。这样，选择最早结束的候选PDSCH时，PDSCH1和PDSCH4具有相同的最早结束位置，此时，先选择可能传输URLLC的候选PDSCH位置(即PDSCH1)作为第一个HARQ-ACK信息。此时与PDSCH1时域重叠的，且是同一类型有PDSCH2，所以PDSCH1和PDSCH2作为一组，且编号为1，也即是在选择优先级较高的候选PDSCH优先处理的同时，对于选择时域重叠的 PDSCH也要按照PDSCH1的类型来选择进行分组，不能将与PDSCH4类型相同的PDSCH与PDSCH1的划分到同一组。在完成PDSCH1的分组后，再对PDSCH4选择与其时域重叠的，而与PDSCH4同一类型且时域重叠的候选PDSCH中有PDSCH5和PDSCH6，此时它们3个作为一组，且编号为2。
然后，再从剩余的所有候选PDSCH中，选择最早结束的PDSCH，此时PDSCH3被选择，且未与其他同一类型的PDSCH有时域重叠，所以单独为一组，编号为3。后面的依次类推。这样半静态码本大小为6bits。且HARQ-ACK信息的串接顺序为图中虚圈的编码。
在本实施例中，对于业务类型的优先级可以根据实际情况来设置，即还可以将EMBB的优先级设置为高于UPLLC的优先级，这时，其处理方式就先优先选择PDSCH4来优先处理了。
实施例七：
在上述实施例二至六中，都是示意一个slot或subslot中，候选PDSCH位置对应的HARQ-ACK码本示例。这里补充一下，实施例中二至四中，可以将非URLLC的候选PDSCH位置形成的HARQ-ACK码本单独形成编号，即非URLLC的候选PDSCH位置的虚圈的编码也是从1开始的。这样非URLLC的候选PDSCH位置的HARQ-ACK码本单独传输。
而在实际应用中，有可能会同时处理多个时隙slot中的候选PDSCH，如果在多个slot或subslot中，每个slot中候选PDSCH位置都是相同，则形成HARQ-ACK码本时：首先可以采用于实施例二至四的方式处理，即是可以将每个slot中可能传输URLLC的候选PDSCH位置形成HARQ-ACK码本，且对于所述多个slot的URLLC可能使用的候选PDSCH位置，按照时间先后进行HARQ-ACK信息比特进行串接。对于非URLLC可能使用的候选PDSCH位置，也做类似处理。这样就形成了多个slot中传输PDSCH时的HARQ-ACK码本了。对于两种类型的HARQ-ACK码本可以单独在各自PUCCH中传输。
而如果两种类型的HARQ-ACK码本被指示在一个PUCCH或PUSCH中传输，则将URLLC对应的HARQ-ACK码本串接在另一个HARQ-ACK码本之前。对于实施例五至六中，示例了一个slot中的候选PDSCH位置的HARQ-ACK串接顺序，对于多个slot的PDSCH的HARQ-ACK信息在一个PUCCH/PUSCH中反馈的情况，将每个slot中候选PDSCH位置对应的HARQ-ACK信息按照实施例一至四的HARQ-ACK顺序进行串接。
在上述实施例中的两种方式总的来说，在所有候选PDSCH的位置，对于可 能传输URLLC的候选PDSCH位置，形成半静态码本。对slot中剩余的候选PDSCH位置形成半静态码本。两部分候选PDSCH位置形成的半静态码本之和作为所有候选PDSCH的位置的半静态码本大小。
两部分HARQ-ACK码本可以单独发送，或串接发送。串接方法为，将URLLC对应的HARQ-ACK码本串接在另一个HARQ-ACK码本之前。
对于所有候选PDSCH位置中URLLC可能使用的候选PDSCH位置，在对URLLC可能使用的候选PDSCH位置，在slot中找出结束位置最早的URLLC PDSCH(如果结束位置最早的PDSCH有多个，则任意选择一个)，以及与其时域重叠其他URLLC PDSCH，形成一个HARQ-ACK信息在HARQ-ACK码本中。然后再对于剩余的URLLC PDSCH找出结束位置最早的URLLC PDSCH，以及与其时域重叠的其他URLLC PDSCH，形成一个HARQ-ACK信息在HARQ-ACK码本中。以此类推，直到URLLC PDSCH被处理完。
对于所有候选PDSCH的位置，选择结束时间最早的候选PDSCH位置(如果结束时间最早的候选PDSCH位置有多个，且属于同一类型按照上一段处理，如果属于不同类型，先处理URLLC PDSCH，再处理其他的PDSCH，先被处理的PDSCH的HARQ-ACK信息放置在后处理的PDSCH的HARQ-ACK信息之前)，与该最早的候选PDSCH存在时域重叠的，且是同一类型的候选PDSCH作为一个组，该组形成一个HARQ-ACK信息在半静态码本中。对于剩余的候选PDSCH(这里是所有类型的候选PDSCH中剩余的)，继续执行上述规则进行分组，直到所有候选PDSCH都被处理。如果所有候选PDSCH位置在多个slot中时，每个slot中做类似处理，然后每个slot按照时间先后串接形成半静态码本。
在发明实施例提供的码本确定方法中，在组成码本的比特数中并没有做大小的限制，但是在实际应用中，每个时隙传输的码本大小有可能会存在大小的限制，对于这种情况，本发明实施例中还通过引入一个参数K来解决大小限制的问题，具体实现方式如下：
引入参数K，该K值描述一个UE在一个slot或sub-slot中的一个PUCCH或PUSCH中反馈与URLLC业务相关的半静态码本的大小。例如，假设每个PDSCH反馈的HARQ-ACK信息为n bit，那么该slot或sub-slot中支持M/n个URLLC的PDSCH的HARQ-ACK反馈。也就是说在slot或sub-slot中对于URLLC的半静态码本总是K。
这样，如果需要确定slot或sub-slot中的总的半静态码本大小，那么按照相关技术确定半静态码本大小，然后再加上K，记为总的半静态码本大小。
sub-slot是指，一个slot中的符号被分为多个sub-slot，每个sub-slot包含连 续的符号数。
当一个UE需要在一个slot或sub-slot中反馈与URLLC业务相关的半静态码本大小超过K时，则将对应的可能传输URLLC的候选PDSCH位置按照前后顺序依次分为K组，每组内的PDSCH的HARQ-ACK进行捆绑为n bit。
K值能通过RRC消息，MAC CE信令或物理层信令被配置。也可以是RRC消息配置K值的取值集合，再由MAC CE或物理层信令总配置的取值集合中选择一个值。
实施例八：
本实施例提供了一种HARQ-ACK码本确定装置，其可应用于各种基站或者终端，参见图4所示，该装置包括：配置模块41，用于根据候选PDSCH类型和所述候选PDSCH的结束时间对至少一个时隙中的所述候选PDSCH进行分组，并形成与分组后的候选PDSCH对应的混合自动重传请求-确认HARQ-ACK信息；转换模块42，用于将所述候选PDSCH对应的HARQ-ACK信息串接，得到所述码本。
在本实施例中，在配置模块41对候选PSDCH分组之前还包括对时隙中的候选PDSCH进行业务类型的分类，具体是确定至少一个时隙中所有的候选PDSCH时，具体可以通过以下方式之一来实现：
一、通过识别所述时隙中所述候选PDSCH的配置信令的方式来确定所述候选PDSCH的类型，所述配置信令包括无线资源控制RRC消息或下行控制信息DCI中的参数信息。
对于配置信令的方式，具体包括下面的方式之一：通过RRC消息为URLLC业务配置单独的可能候选PDSCH位置集合；从为UE配置的候选PDSCH位置集合中，再使用参数指示出候选PDSCH位置集合中那些是可能传输URLLC的候选PDSCH位置。
但在实际应用中，URLLC可能的候选PDSCH集合中，如果不传输URLLC，则其也可以用于传输eMBB，总的来说，通过RRC消息或者DCI参数指示配置的候选PDSCH要优先URLLC业务的使用。
二、根据识别所述时隙中每个候选PDSCH所占有的持续分好数来确定所述候选PDSCH的类型。
按照约定数量的持续符号数区分。也就是说，对于持续符号数小于等于M的候选PDSCH位置，认为都是可能传输URLLC的PDSCH位置，在形成半静 态码本时要进行考虑。对于M的取值，可以根据不同子载波间隔分为不同的取值，例如15KHz子载波间隔时，M为2，30KHz子载波间隔时，M为4。60KHz子载波间隔时，M为8。这里只是给出可能的取值，实际上取值可以不同于此处给出的，但需要是一个约定值。同样的，为了避免资源浪费，区分出URLLC可能使用的候选PDSCH位置，这些位置是允许传输eMBB在没有URLLC业务时，一旦有URLLC时，就优先使用这些资源。
在本实施例中，对于该装置中的各个模块所实现的步骤和具体过程，可参照上述各实施例所示的码本确定过程，在此不再赘述。
本实施例提供的装置中，通过根据候选PDSCH类型和候选PDSCH的结束时间来对时隙中的所有候选PDSCH进行分组处理，根据分组的情况对每组的PDSCH形成对应的HARQ-ACK信息，最后将形成的HARQ-ACK信息按照结束时间的先后进行串接，从而得到最终的码本，而串接后得到的HARQ-ACK信息即是确定的完整的码本，从而实现了在同一时隙中同时配置多个候选PDSCH且存在时域重叠时也能保证打孔传输时不会出现部分候选PDSCH禁止使用的问题，并且通过该方法确定的码本其大小适中，可以保证数据传输的完整性，提高了设备的使用性能。
实施例九：
本实施例提供了一种终端，参见图10所示，该终端包括处理器211、存储器212、通信单元213和通信总线214。
通信总线214用于实现处理器2111、通信单元213和存储器212之间的通信连接。
一种实例中，所述处理器211用于执行存储器中存储的一个或者多个程序，以实现如上各个实施例中的HARQ-ACK码本确定方法，其各个步骤的具体实现过程参照上述各实施例的说明，这里不再重复赘述。
本实施例还提供了一种计算机可读存储介质，该计算机可读存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、计算机程序模块或其他数据)的任何方法或技术中实施的易失性或非易失性、可移除或不可移除的介质。计算机可读存储介质包括但不限于RAM(Random Access Memory，随机存取存储器)，ROM(Read-Only Memory，只读存储器)，EEPROM(Electrically Erasable Programmable read only memory，带电可擦可编程只读存储器)、闪存或其他存储器技术、CD-ROM(Compact Disc Read-Only Memory，光盘只读存储器)，数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储 装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。
在一种示例中，本实施例中的计算机可读存储介质可用于存储一个或者多个第一计算机程序，该一个或者多个第一计算机程序可被一个或者多个处理器执行，以实现如上各实施例中的HARQ-ACK码本确定方法。
本实施例还提供了一种计算机程序(或称计算机软件)，该计算机程序可以分布在计算机可读介质上，由可计算装置来执行，以实现如上各实施例所示的HARQ-ACK码本确定方法的至少一个步骤；并且在某些情况下，可以采用不同于上述实施例所描述的顺序执行所示出或描述的至少一个步骤。
本实施例还提供了一种计算机程序产品，包括计算机可读装置，该计算机可读装置上存储有如上所示的计算机程序。本实施例中该计算机可读装置可包括如上所示的计算机可读存储介质。
可见，本领域的技术人员应该明白，上文中所公开方法中的全部或某些步骤、系统、装置中的功能模块/单元可以被实施为软件(可以用计算装置可执行的计算机程序代码来实现)、固件、硬件及其适当的组合。在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。
此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、计算机程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。所以，本申请不限制于任何特定的硬件和软件结合。
以上内容是结合具体的实施方式对本发明实施例所作的进一步详细说明，不能认定本申请的具体实施只局限于这些说明。对于本申请所属技术领域的普通技术人员来说，在不脱离本申请构思的前提下，还可以做出若干简单推演或替换，都应当视为属于本申请的保护范围。

Claims (12)

  1. 一种混合自动重传请求-确认HARQ-ACK码本确定方法，包括：
    根据候选物理下行共享信道PDSCH类型和候选PDSCH的结束时间对至少一个时隙中的候选PDSCH进行分组，并形成与分组后的所述候选PDSCH对应的HARQ-ACK信息；
    将所述候选PDSCH对应的HARQ-ACK信息串接，得到HARQ-ACK码本。
  2. 根据权利要求1所述的方法，其中，在所述至少一个时隙为一个时隙的情况下，所述根据候选PDSCH类型和候选PDSCH的结束时间对至少一个时隙中的候选PDSCH进行分组，并形成与分组后的所述候选PDSCH对应的HARQ-ACK信息包括：
    按照候选PDSCH类型将所有的所述候选PDSCH分为至少两组候选PDSCH组合；
    从同一候选PDSCH类型对应的候选PDSCH组合中按照每个候选PDSCH的结束时间的先后进行小组划分，并对划分后的小组中的所述候选PDCSH形成对应的HARQ-ACK信息。
  3. 根据权利要求2所述的方法，其中，所述从同一候选PDSCH类型对应的候选PDSCH组合中按照每个候选PDSCH的结束时间的先后进行小组划分包括：
    从同一候选PDSCH类型对应的候选PDSCH组合确定结束时间最早的第一候选PDSCH；
    确定所述候选PDSCH组合中剩余的候选PDSCH中与所述第一候选PDSCH存在时域重叠的第二候选PDSCH；
    将所述第一候选PDSCH和所述第二候选PDSCH划分为一个小组。
  4. 根据权利要求1所述的方法，其中，所述根据候选PDSCH类型和候选PDSCH的结束时间对至少一个时隙中的候选PDSCH进行分组包括：
    从至少一个时隙中的候选PDSCH中确定出结束时间最早的第三候选PDSCH；
    确定所述第三候选PDSCH的候选PDSCH类型；
    从与所述候选PDSCH类型对应的其他候选PDSCH中确定与所述第三候选PDSCH存在时域重叠的第四候选PDSCH；
    将所述第三候选PDSCH和所述第四候选PDSCH划分为一个小组。
  5. 根据权利要求4所述的方法，其中，在所述从至少一个时隙中的候选PDSCH中确定出结束时间最早的第三候选PDSCH包括至少两个第三候选 PDSCH的情况下，所述根据候选PDSCH类型和候选PDSCH的结束时间对至少一个时隙中的候选PDSCH进行分组还包括：
    对所述至少两个第三候选PDSCH按照候选PDSCH类型的优先级进行排序，从排序后的至少两个第三候选PDSCH中选择优先级较高的一个作为实际的第三候选PDSCH。
  6. 根据权利要求1所述的方法，其中，在所述至少一个时隙为两个以上时隙的情况下，所述根据候选PDSCH类型和候选PDSCH的结束时间对至少一个时隙中的候选PDSCH进行分组，并形成对应的HARQ-ACK信息包括：
    根据候选PDSCH类型所传输的业务确定每个时隙中的候选PDSCH的优先级；
    对每个优先级中的候选PDSCH按照以下方式形成HARQ-ACK信息：
    从同一优先级的候选PDSCH中选择结束时间最早的候选PDSCH作为第五候选PDSCH；
    确定所述同一优先级的候选PDSCH中剩余的候选PDSCH中与所述第五候选PDSCH存在时域重叠的第六候选PDSCH；
    将所述第五候选PDSCH和所述第六候选PDSCH划分为一个小组，并形成对应的HARQ-ACK信息。
  7. 根据权利要求1-6任一项所述的方法，其中，所述将所述候选PDSCH对应的HARQ-ACK信息串接，得到HARQ-ACK码本包括：
    根据候选PDSCH类型的优先级排序，将优先级高的所有候选PDSCH的HARQ-ACK依次串接于优先级低的所有候选PDSCH的HARQ-ACK之前，形成HARQ-ACK码本；
    或者，
    根据候选PDSCH类型的优先级排序，先将每个时隙中的所有候选PDSCH的HARQ-ACK按照优先级从高到低的方式依次串接；将串接后的HARQ-ACK按照每个时隙的时间先后再串接在一起，形成HARQ-ACK码本；
    其中，对于同一优先级的候选PDSCH的HARQ-ACK之间按照时间先后串接在一起。
  8. 根据权利要求7所述的方法，还包括：
    通过识别所述时隙中候选PDSCH的配置信令的方式来确定所述候选PDSCH的类型；
    或者，
    根据识别所述时隙中每个候选PDSCH所占有的持续符号数量来确定所述候选PDSCH的类型。
  9. 根据权利要求8所述的方法，其中，所述配置信令包括无线资源控制RRC消息或下行控制信息DCI中的参数信息。
  10. 一种混合自动重传请求-确认HARQ-ACK码本确定装置，包括：
    配置模块，设置为根据候选物理下行共享信道PDSCH类型和候选PDSCH的结束时间对至少一个时隙中的候选PDSCH进行分组，并形成与分组后的所述候选PDSCH对应的HARQ-ACK信息；
    转换模块，设置为将所述候选PDSCH对应的HARQ-ACK信息串接，得到HARQ-ACK码本。
  11. 一种终端，包括处理器、存储器、通信单元和通信总线；
    所述通信总线设置为实现所述处理器、所述通信单元和所述存储器之间的无线通信连接；
    所述处理器设置为执行所述存储器中存储的至少一个程序，以实现如权利要求1至9任一项所述的混合自动重传请求-确认HARQ-ACK码本确定方法。
  12. 一种计算机可读存储介质，存储有至少一个计算机程序，所述至少一个计算机程序可被至少一个处理器执行，以实现如权利要求1至9任一项所述的混合自动重传请求-确认HARQ-ACK码本确定。
PCT/CN2019/115148 2018-11-02 2019-11-01 Harq-ack码本确定方法及装置、终端、存储介质 Ceased WO2020088676A1 (zh)

Priority Applications (6)

Application Number Priority Date Filing Date Title
EP24191127.0A EP4451601A3 (en) 2018-11-02 2019-11-01 Harq-ack codebook determination method, terminal, and storage medium
DK19879691.4T DK3876454T3 (da) 2018-11-02 2019-11-01 Fremgangsmåde til bestemmelse af harq-ack kodebog og apparat, terminal og computerlæsbart lagringsmedium
PL19879691.4T PL3876454T3 (pl) 2018-11-02 2019-11-01 Sposób oraz urządzenie do określania książki kodowej potwierdzeń protokołu hybrydowego automatycznego żądania powtórzenia (HARQ-ACK), terminal, oraz nośnik pamięci nadający się do odczytu komputerowego
EP19879691.4A EP3876454B1 (en) 2018-11-02 2019-11-01 Harq-ack codebook determination method and apparatus, terminal, and computer-readable storage medium
US17/290,878 US12028165B2 (en) 2018-11-02 2019-11-01 HARQ-ACK codebook determination method and apparatus, terminal, and storage medium
KR1020217016305A KR102607908B1 (ko) 2018-11-02 2019-11-01 Harq-ack 코드북 결정 방법 및 장치, 단말, 저장매체

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811303662.0 2018-11-02
CN201811303662.0A CN110535569B (zh) 2018-11-02 2018-11-02 Harq-ack码本确定方法及装置、终端、存储介质

Publications (1)

Publication Number Publication Date
WO2020088676A1 true WO2020088676A1 (zh) 2020-05-07

Family

ID=68659131

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/115148 Ceased WO2020088676A1 (zh) 2018-11-02 2019-11-01 Harq-ack码本确定方法及装置、终端、存储介质

Country Status (7)

Country Link
US (1) US12028165B2 (zh)
EP (2) EP3876454B1 (zh)
KR (1) KR102607908B1 (zh)
CN (2) CN115842607B (zh)
DK (1) DK3876454T3 (zh)
PL (1) PL3876454T3 (zh)
WO (1) WO2020088676A1 (zh)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022205272A1 (en) * 2021-04-01 2022-10-06 Zte Corporation Sub-slot based codebook construction techniques
WO2022236534A1 (en) * 2021-05-10 2022-11-17 Zte Corporation Hybrid automatic repeat request acknowledgement codebook generation techniques
JP2023540718A (ja) * 2020-10-15 2023-09-26 日本電気株式会社 通信システム
EP4224767A4 (en) * 2020-09-30 2024-03-13 Vivo Mobile Communication Co., Ltd. HARQ-ACK FEEDBACK METHOD, TERMINAL AND NETWORK-SIDE DEVICE

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115842607B (zh) * 2018-11-02 2024-06-11 中兴通讯股份有限公司 Harq-ack码本确定方法及装置、终端、存储介质
CN111435893B (zh) * 2019-01-11 2023-05-19 中兴通讯股份有限公司 Harq-ack码本和harq-ack信息的确定方法及装置
BR112021015959A2 (pt) * 2019-02-13 2021-10-05 Idac Holdings, Inc. Dispositivo, e, método
WO2021111424A1 (en) * 2019-12-05 2021-06-10 Telefonaktiebolaget Lm Ericsson (Publ) Resolving collision of semi-persistent scheduling data
WO2021152804A1 (ja) * 2020-01-30 2021-08-05 株式会社Ｎｔｔドコモ 端末、無線通信方法及び基地局
US12413347B2 (en) * 2020-02-11 2025-09-09 Beijing Xiaomi Mobile Software Co., Ltd. Communication method for determining priority of HARQ-ACK information, and device
BR112022016004A2 (pt) 2020-02-12 2022-10-11 Huawei Tech Co Ltd Método e aparelho de comunicação
EP4109986B1 (en) * 2020-02-20 2024-11-06 Beijing Xiaomi Mobile Software Co., Ltd. Data transmission method and apparatus, and communication device
CN113498179B (zh) * 2020-04-02 2022-10-18 上海朗帛通信技术有限公司 一种被用于无线通信的节点中的方法和装置
US12438643B2 (en) 2020-04-07 2025-10-07 Beijing Xiaomi Mobile Software Co., Ltd. Unlicensed frequency band feedback method, unlicensed frequency band feedback apparatus, and storage medium
EP4554137A1 (en) 2020-05-15 2025-05-14 Apple Inc. Handling physical downlink shared channel multi-trp transmissions
EP4133843A4 (en) * 2020-05-15 2024-01-10 Apple Inc. MANAGEMENT OF MULTI-TRP TRANSMISSIONS
EP4152667A4 (en) * 2020-07-31 2023-06-28 Guangdong Oppo Mobile Telecommunications Corp., Ltd. Feedback codebook determining method, device, equipment, and storage medium
US12155485B2 (en) * 2020-09-30 2024-11-26 Qualcomm Incorporated Transmission of different numbers of HARQ-ACK/NACK packets for different semi-persistent scheduling configuration priorities
CN114731506B (zh) * 2022-02-25 2024-07-09 北京小米移动软件有限公司 码本传输、接收确定方法和装置、通信装置和存储介质

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106549734A (zh) * 2015-09-18 2017-03-29 中兴通讯股份有限公司 一种信息的传输方法、终端和基站
US20180279266A1 (en) * 2015-09-25 2018-09-27 Telefonaktiebolaget Lm Ericsson (Publ) Information bits packaging

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10506610B2 (en) * 2015-02-08 2019-12-10 Lg Electronics Inc. Method for allocating resource by considering inter-device interference in full-duplex wireless communication system and apparatus therefor
CN109891802B (zh) * 2016-10-25 2021-09-24 Lg 电子株式会社 无线通信系统中执行用于v2x通信的harq的方法及其装置
CN108270514A (zh) * 2017-01-03 2018-07-10 中兴通讯股份有限公司 Pdsch资源的确定方法及装置、终端、基站
CN108282879B (zh) * 2017-01-06 2022-11-18 中兴通讯股份有限公司 数据传输方法及装置
US10958384B2 (en) * 2017-01-15 2021-03-23 Lg Electronics Inc. Method for transmitting HARQ-ACK signal in wireless communication system, and apparatus therefor
ES3018785T3 (en) * 2017-11-16 2025-05-19 Lenovo Beijing Ltd Method and apparatus for harq-ack codebook determination
US11444727B2 (en) * 2018-05-18 2022-09-13 Lenovo (Beijing) Limited Method and apparatus for HARQ-ACK payload reduction for semi-static HARQ-ACK codebook determination
EP3827539B1 (en) * 2018-07-23 2025-01-15 Lenovo (Beijing) Limited Cbg-based retransmission
EP3832929A4 (en) * 2018-07-30 2022-03-23 NTT DoCoMo, Inc. USER TERMINAL AND WIRELESS COMMUNICATION METHOD
CN115842607B (zh) * 2018-11-02 2024-06-11 中兴通讯股份有限公司 Harq-ack码本确定方法及装置、终端、存储介质

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106549734A (zh) * 2015-09-18 2017-03-29 中兴通讯股份有限公司 一种信息的传输方法、终端和基站
US20180279266A1 (en) * 2015-09-25 2018-09-27 Telefonaktiebolaget Lm Ericsson (Publ) Information bits packaging

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
NOKIA ET AL: "Remaining aspects of NR CA", 3GPP DRAFT; R1-1806144, 25 May 2018 (2018-05-25), Busan, South Korea, pages 1 - 3, XP051461724 *
SAMSUNG: "Corrections on CA operation, R1-1801989", 3GPP DRAFT; R1-1801989, 2 March 2018 (2018-03-02), Athens, Greece, pages 1 - 9, XP051397785 *
See also references of EP3876454A4
ZTE: "URLLC PHY enhancements", 3GPP DRAFT; R1-1810348, 12 October 2018 (2018-10-12), Chengdu, China, pages 1 - 2, XP051517758 *
ZTE: "URLLC/eMBB differentiation and enhancement to semi-static ACK/NACK codebook, R1-1812391", 3GPP DRAFT; R1-1812391, 16 November 2018 (2018-11-16), Spokane, USA, pages 1 - 4, XP051478593 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4224767A4 (en) * 2020-09-30 2024-03-13 Vivo Mobile Communication Co., Ltd. HARQ-ACK FEEDBACK METHOD, TERMINAL AND NETWORK-SIDE DEVICE
JP2023540718A (ja) * 2020-10-15 2023-09-26 日本電気株式会社 通信システム
JP7537606B2 (ja) 2020-10-15 2024-08-21 日本電気株式会社 通信システム
JP2024150705A (ja) * 2020-10-15 2024-10-23 日本電気株式会社 通信システム
US12316459B2 (en) 2020-10-15 2025-05-27 Nec Corporation Communication system
JP7750346B2 (ja) 2020-10-15 2025-10-07 日本電気株式会社 通信システム
WO2022205272A1 (en) * 2021-04-01 2022-10-06 Zte Corporation Sub-slot based codebook construction techniques
EP4298841A4 (en) * 2021-04-01 2025-01-01 ZTE Corporation Sub-slot based codebook construction techniques
WO2022236534A1 (en) * 2021-05-10 2022-11-17 Zte Corporation Hybrid automatic repeat request acknowledgement codebook generation techniques

Also Published As

Publication number Publication date
KR102607908B1 (ko) 2023-11-29
EP4451601A3 (en) 2025-01-15
CN110535569A (zh) 2019-12-03
EP3876454B1 (en) 2024-10-09
KR20210082240A (ko) 2021-07-02
US12028165B2 (en) 2024-07-02
CN110535569B (zh) 2022-12-06
US20210391956A1 (en) 2021-12-16
CN115842607A (zh) 2023-03-24
EP3876454A4 (en) 2022-07-13
PL3876454T3 (pl) 2025-03-03
DK3876454T3 (da) 2024-11-18
EP4451601A2 (en) 2024-10-23
EP3876454A1 (en) 2021-09-08
CN115842607B (zh) 2024-06-11

Similar Documents

Publication Publication Date Title
WO2020088676A1 (zh) Harq-ack码本确定方法及装置、终端、存储介质
US20250344208A1 (en) Transmission method, reception method, communication node and storage medium
US12089079B2 (en) User equipment and base stations that achieve uplink multiplexing
AU2019351481B2 (en) User equipment and base stations that achieve ultra reliable and low latency communications
US11212036B2 (en) Data communication method, device, and system
CN105743619B (zh) 混合自动重传请求(harq)传输的方法和设备
US12256393B2 (en) Multiplexing HARQ-ACK of different service types on a single PUSCH
CN107294897B9 (zh) 下行信息发送、接收方法及装置
US11202305B2 (en) Method and apparatus for transmission and reception of data channel in wireless communication system
WO2020143428A1 (zh) 传输上行信息的方法和通信装置
CN109756979B (zh) 传输信息的方法和通信设备
CN110169000A (zh) 用于上行链路超高可靠低延迟通信的信令、过程、用户设备和基站
EP3639590B1 (en) Base station, user equipment and corresponding methods for uplink transmission without grant
US12418911B2 (en) Transmission method, communication node and medium
CN110798291A (zh) 一种信息传输的方法、装置、设备和计算机可读存储介质
US12375209B2 (en) Method and apparatus for uplink transmission on configured grant resources
US12317272B2 (en) Method and apparatus for decoding downlink control signal in wireless cellular communication system
CN114424491A (zh) 用于上行链路传输优先级的用户装备、基站和方法
CN110365456A (zh) 物理上行信道的时隙确定方法及装置
CN115552858A (zh) 用于信道状态信息报告的优先级规则的用户装备、基站和方法
CN104471998B (zh) 用于分配上行链路子帧的资源的方法和网络节点
CN109309958B (zh) 一种信息传输方法、装置、基站及存储介质
CN108111262A (zh) 混合自动重传请求反馈和重传的方法及接收机、发射机
CN116783961A (zh) 混合自动重传请求harq反馈码本生成方法、通信设备及可读存储介质
CN114337954B (zh) Harq-ack反馈方法、终端及网络侧设备

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: 19879691

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 20217016305

Country of ref document: KR

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 2019879691

Country of ref document: EP

Effective date: 20210602