WO2022148184A1 - 接收pdsch的方法、装置及处理器可读存储介质 - Google Patents

接收pdsch的方法、装置及处理器可读存储介质 Download PDF

Info

Publication number
WO2022148184A1
WO2022148184A1 PCT/CN2021/134369 CN2021134369W WO2022148184A1 WO 2022148184 A1 WO2022148184 A1 WO 2022148184A1 CN 2021134369 W CN2021134369 W CN 2021134369W WO 2022148184 A1 WO2022148184 A1 WO 2022148184A1
Authority
WO
WIPO (PCT)
Prior art keywords
pdsch
received
candidate
pdschs
terminal
Prior art date
Application number
PCT/CN2021/134369
Other languages
English (en)
French (fr)
Inventor
刘苗苗
王俊伟
马腾
Original Assignee
大唐移动通信设备有限公司
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 大唐移动通信设备有限公司 filed Critical 大唐移动通信设备有限公司
Priority to EP21917225.1A priority Critical patent/EP4277405A4/en
Priority to US18/260,577 priority patent/US20240306184A1/en
Publication of WO2022148184A1 publication Critical patent/WO2022148184A1/zh

Links

Images

Classifications

    • 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
    • H04W72/563—Allocation or scheduling criteria for wireless resources based on priority criteria of the wireless resources
    • 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
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • 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/51—Allocation or scheduling criteria for wireless resources based on terminal or device properties
    • 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/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies

Definitions

  • the present disclosure relates to the field of communication technologies, and in particular, to a method, an apparatus, and a processor-readable storage medium for receiving a PDSCH.
  • the 5th Generation Mobile Communication Technology (5G) network needs to have the ability to flexibly and dynamically allocate wireless spectrum and network resources between unicast services and multicast services, and needs to support independent deployment of broadcast/multicast networks.
  • 5G 5th Generation Mobile Communication Technology
  • the maximum number of physical downlink shared channels (Physical downlink shared channels, PDSCH) that the terminal can receive is determined.
  • the terminal User Equipment, UE
  • the terminal may need to receive the PDSCH of broadcast, multicast and unicast services at the same time, including both dynamically scheduled PDSCH also includes Semi-Persistent Scheduling (SPS) PDSCH. Therefore, the base station may schedule PDSCH in one slot (slot) beyond the capability of the UE, and how the terminal selects the PDSCH from multiple PDSCHs to receive the PDSCH that meets the capability requirements of the UE has become an urgent problem to be solved.
  • SPS Semi-Persistent Scheduling
  • the present disclosure provides a method, an apparatus, and a processor-readable storage medium for receiving a PDSCH, so as to solve the problem that the terminal cannot determine the received PDSCH when the scheduling of the PDSCH by the base station exceeds the receiving capability of the terminal.
  • Embodiments of the present disclosure provide a method for receiving PDSCH, including:
  • the terminal determines the received PDSCH set according to the priority of the candidate physical downlink shared channel PDSCH scheduled by the base station, and the number of PDSCHs to be received in the received PDSCH set meets the receiving capability of the terminal;
  • the terminal receives data on the PDSCH to be received in the received PDSCH set.
  • the terminal determines to receive a PDSCH set according to priorities of candidate PDSCHs scheduled by the base station, including one of the following:
  • the PDSCH with the lowest priority in the candidate PDSCH set is excluded, and the candidate PDSCH set after the exclusion process is determined as the received PDSCH set, and the number of PDSCHs to be received in the received PDSCH set satisfies the terminal's receiving capability.
  • determine the received PDSCH set including:
  • Step 1 Determine the first PDSCH with the highest priority in the candidate PDSCH set as the PDSCH to be received in the received PDSCH set; the situation where the total number of PDSCHs to be received in the received PDSCH set reaches the maximum receiving capability of the terminal
  • the received PDSCH set including the first PDSCH is determined as the received PDSCH set; in the case that the total number of PDSCHs to be received in the received PDSCH set does not reach the maximum receiving capability of the terminal, step 2 is performed;
  • Step 2 Delete the first PDSCH from the candidate PDSCH set, delete the second PDSCH in the candidate PDSCH set, and use the candidate PDSCH set after deleting the first PDSCH and the second PDSCH as the first PDSCH.
  • a candidate set, the second PDSCH is a PDSCH that overlaps with all PDSCHs in the received PDSCH set; if the first candidate set is not an empty set, the first candidate set is used as the candidate PDSCH set Step 1 is repeated, and if the first candidate set is an empty set, the received PDSCH set including the first PDSCH is determined as the received PDSCH set.
  • Step 1 Delete the second PDSCH with the lowest priority in the candidate PDSCH set to obtain a second candidate set; the number of PDSCHs in the second candidate set satisfies the terminal receiving capability, and the second candidate set does not
  • the second candidate set is determined as the received PDSCH set; the number of PDSCHs in the second candidate set does not meet the terminal's receiving capability, or the second candidate set exists
  • step 2 performs step 2;
  • Step 2 Use the second candidate set as the candidate PDSCH set, and repeat Step 1.
  • the method further includes:
  • the two PDSCHs satisfy the first condition, it is determined that the two PDSCHs do not overlap in the time domain;
  • the first condition is: the start time of one PDSCH in the two PDSCHs is later than the end time of the other PDSCH.
  • the method further includes:
  • the second condition is: the number of starting resource block (Resource Block, RB) indexes of one PDSCH in the two PDSCHs is greater than the number of ending RB indexes of the other PDSCH.
  • Resource Block Resource Block
  • the candidate PDSCH is a PDSCH scheduled by the base station before the target time threshold of the receiving slot.
  • the method further includes:
  • Embodiments of the present disclosure provide an apparatus for receiving PDSCH, including: a transceiver, a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the following when executing the computer program step:
  • the terminal determines to receive a PDSCH set according to the priority of the candidate PDSCH scheduled by the base station, which specifically includes one of the following:
  • the PDSCH with the lowest priority in the candidate PDSCH set is excluded, and the candidate PDSCH set after the exclusion process is determined as the received PDSCH set, and the number of PDSCHs to be received in the received PDSCH set satisfies the terminal's receiving capability.
  • the received PDSCH set which specifically includes:
  • Step 1 Determine the first PDSCH with the highest priority in the candidate PDSCH set as the PDSCH to be received in the received PDSCH set; the situation where the total number of PDSCHs to be received in the received PDSCH set reaches the maximum receiving capability of the terminal
  • the received PDSCH set including the first PDSCH is determined as the received PDSCH set; in the case that the total number of PDSCHs to be received in the received PDSCH set does not reach the maximum receiving capability of the terminal, step 2 is performed;
  • Step 2 Delete the first PDSCH from the candidate PDSCH set, delete the second PDSCH in the candidate PDSCH set, and use the candidate PDSCH set after deleting the first PDSCH and the second PDSCH as the first PDSCH.
  • a candidate set, the second PDSCH is a PDSCH that overlaps with all PDSCHs in the received PDSCH set; if the first candidate set is not an empty set, the first candidate set is used as the candidate PDSCH set Step 1 is repeated, and if the first candidate set is an empty set, the received PDSCH set including the first PDSCH is determined as the received PDSCH set.
  • the PDSCH with the lowest priority in the candidate PDSCH set is excluded, and the candidate PDSCH set after the exclusion processing is determined as the received PDSCH set, which specifically includes:
  • Step 1 Delete the second PDSCH with the lowest priority in the candidate PDSCH set to obtain a second candidate set; the number of PDSCHs in the second candidate set satisfies the terminal receiving capability, and the second candidate set does not
  • the second candidate set is determined as the received PDSCH set; the number of PDSCHs in the second candidate set does not meet the terminal's receiving capability, or the second candidate set exists
  • step 2 performs step 2;
  • Step 2 Use the second candidate set as the candidate PDSCH set, and repeat Step 1.
  • processor when the processor executes the computer program, it is further configured to implement the following steps:
  • the two PDSCHs satisfy the first condition, it is determined that the two PDSCHs do not overlap in the time domain;
  • the first condition is: the start time of one PDSCH in the two PDSCHs is later than the end time of the other PDSCH.
  • processor when the processor executes the computer program, it is further configured to implement the following steps:
  • the second condition is: the starting resource block RB index number of one PDSCH in the two PDSCHs is greater than the ending RB index number of the other PDSCH.
  • the candidate PDSCH is a PDSCH scheduled by the base station before the target time threshold of the receiving slot.
  • processor when the processor executes the computer program, it is further configured to implement the following steps:
  • Embodiments of the present disclosure provide an apparatus for receiving PDSCH, including:
  • a first determining unit configured to determine a received PDSCH set according to the priority of the candidate physical downlink shared channel PDSCH scheduled by the base station, where the number of PDSCHs to be received in the received PDSCH set satisfies the terminal's receiving capability
  • the first receiving unit is configured to receive data on the PDSCH to be received in the received PDSCH set.
  • the first determining unit specifically includes one of the following:
  • a first determination subunit configured to determine a received PDSCH set according to the PDSCH with the highest priority in the candidate PDSCH set, where the number of PDSCHs to be received in the received PDSCH set satisfies the terminal's receiving capability
  • the second determination subunit is used to exclude the PDSCH with the lowest priority in the candidate PDSCH set, and determine the candidate PDSCH set after the exclusion processing as the received PDSCH set, and the number of PDSCHs to be received in the received PDSCH set Satisfy the terminal receiving capability.
  • the first determination subunit is specifically used to implement:
  • Step 1 Determine the first PDSCH with the highest priority in the candidate PDSCH set as the PDSCH to be received in the received PDSCH set; the situation where the total number of PDSCHs to be received in the received PDSCH set reaches the maximum receiving capability of the terminal
  • the received PDSCH set including the first PDSCH is determined as the received PDSCH set; in the case that the total number of PDSCHs to be received in the received PDSCH set does not reach the maximum receiving capability of the terminal, step 2 is performed;
  • Step 2 Delete the first PDSCH from the candidate PDSCH set, delete the second PDSCH in the candidate PDSCH set, and use the candidate PDSCH set after deleting the first PDSCH and the second PDSCH as the first PDSCH.
  • a candidate set, the second PDSCH is a PDSCH that overlaps with all PDSCHs in the received PDSCH set; if the first candidate set is not an empty set, the first candidate set is used as the candidate PDSCH set Step 1 is repeated, and if the first candidate set is an empty set, the received PDSCH set including the first PDSCH is determined as the received PDSCH set.
  • the second determination subunit is specifically used to implement:
  • Step 1 Delete the second PDSCH with the lowest priority in the candidate PDSCH set to obtain a second candidate set; the number of PDSCHs in the second candidate set satisfies the terminal receiving capability, and the second candidate set does not In the case of overlapping PDSCHs in the time domain or frequency domain, the second candidate set is determined as the received PDSCH set; the number of PDSCHs in the second candidate set does not meet the terminal receiving capability, or the In the case of overlapping PDSCHs in the second candidate set, perform step 2;
  • Step 2 Use the second candidate set as the candidate PDSCH set, and repeat Step 1.
  • the device further includes:
  • a second determining unit configured to determine that the two PDSCHs do not overlap in the time domain when the two PDSCHs satisfy the first condition
  • the first condition is: the start time of one PDSCH in the two PDSCHs is later than the end time of the other PDSCH.
  • the device further includes:
  • a third determining unit configured to determine that the two PDSCHs do not overlap in the frequency domain when the two PDSCHs satisfy the second condition
  • the second condition is: the starting resource block RB index number of one PDSCH in the two PDSCHs is greater than the ending RB index number of the other PDSCH.
  • the candidate PDSCH is a PDSCH scheduled by the base station before the target time threshold of the receiving slot.
  • the device further includes:
  • the second receiving unit is configured to receive, according to the time sequence of PDSCHs scheduled by the base station after the target time threshold, when the number of PDSCHs to be received does not meet the maximum receiving capability of the terminal, receive data that are not in the time domain or the frequency domain. Data on overlapping PDSCHs.
  • Embodiments of the present disclosure provide a processor-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, implements the steps of the above method for receiving a PDSCH.
  • the terminal determines the received PDSCH set according to the priority of the candidate PDSCH scheduled by the base station, and the number of PDSCH included in the received PDSCH set satisfies the terminal's receiving capability, so that the terminal can receive multiple data services at the same time, and can The type and quantity of PDSCH finally received are selected according to the service priority to meet user requirements.
  • FIG. 1 shows one of the schematic flowcharts of a method for receiving a PDSCH according to an embodiment of the present disclosure
  • FIG. 2 shows the second schematic flowchart of a method for receiving a PDSCH according to an embodiment of the present disclosure
  • FIG. 3 shows a third schematic flowchart of a method for receiving a PDSCH according to an embodiment of the present disclosure
  • FIG. 4 shows a schematic diagram of a positional relationship between multiple PDSCHs according to an embodiment of the present disclosure
  • FIG. 5 is a schematic diagram showing a setting position of a target time threshold according to an embodiment of the present disclosure
  • FIG. 6 shows one of the schematic structural diagrams of an apparatus for receiving PDSCH according to an embodiment of the present disclosure
  • FIG. 7 shows the second schematic structural diagram of an apparatus for receiving PDSCH according to an embodiment of the present disclosure.
  • system and “network” are often used interchangeably herein.
  • the term "and/or" describes the association relationship of associated objects, and indicates that there can be three kinds of relationships. For example, A and/or B can indicate that A exists alone, A and B exist at the same time, and B exists alone these three situations.
  • the character “/” generally indicates that the associated objects are an "or" relationship.
  • the term “plurality” refers to two or more than two, and other quantifiers are similar.
  • the UE In a time slot, when multiple PDSCHs are sent, the UE needs to select and exclude PDSCHs according to the UE capability and service priority, so as to determine the final PDSCH type and quantity received by the UE.
  • Different business data has different business priorities, such as: Ultra-Reliable and Low Latency Communications (URLLC), Multicast Control Channel (MCCH) PDSCH (MCCH-PDSCH), In MBS and Enhanced Mobile Broadband (Enhanced Mobile Broadband, eMBB), URLLC>MCCH-PDSCH>MBS>eMBB service.
  • URLLC Ultra-Reliable and Low Latency Communications
  • MCCH-PDSCH Multicast Control Channel
  • eMBB Enhanced Mobile Broadband
  • URLLC>MCCH-PDSCH>MBS>eMBB service URLLC>MCCH-PDSCH>MBS>eMBB service.
  • the definition of UE receiving capability is that within a time slot, the UE receives PDSCH simultaneously by means of Frequency-division multiplexing (FDM) or/and Time-division multiplexing (TDM). quantity.
  • FDM Frequency-division multiplexing
  • TDM Time-division multiplexing
  • the number of PDSCHs received in an FDM+TDM manner is the number of PDSCHs received in an FDM+TDM manner.
  • FDM means that within the same frequency bandwidth, multiple data services can be transmitted simultaneously on different frequencies.
  • TDM means that in a time slot, multiple data services can be allowed to transmit simultaneously at different times.
  • FDM+TDM means that in one time slot, multiple data services can be transmitted in the form of FDM and TDM.
  • Capability A In TDM mode, at most N PDSCHs can be received.
  • Capability B In the way of FDM, at most N PDSCHs can be received.
  • the embodiments of the present disclosure provide a method for receiving PDSCH, so as to solve the problem that the terminal cannot determine the received PDSCH when the scheduling of the PDSCH by the base station exceeds the receiving capability of the terminal.
  • an embodiment of the present disclosure provides a method for receiving PDSCH, which specifically includes the following steps:
  • Step 101 The terminal determines a set of received PDSCHs according to the priority of the candidate physical downlink shared channel PDSCH scheduled by the base station, and the number of PDSCHs to be received in the set of received PDSCHs satisfies the terminal's receiving capability.
  • the base station may schedule PDSCHs in one time slot exceeding the receiving capability of the terminal.
  • the maximum receiving capability of the terminal is N PDSCHs, and the number of PDSCHs scheduled by the base station is greater than N.
  • the candidate PDSCH is the PDSCH scheduled by the base station in one time slot, and there may be multiple PDSCHs.
  • the terminal determines the PDSCH to be received from the candidate PDSCHs, that is, determines the PDSCH to be received.
  • the terminal may determine the PDSCH to be received according to the priority of each candidate PDSCH. Wherein, the priority of the candidate PDSCH may be pre-configured by the protocol.
  • the received PDSCH set determined by the terminal may include multiple PDSCHs, and the number of PDSCHs satisfies the receiving capability of the terminal. Satisfying the terminal receiving capability means that the number of PDSCHs in the received PDSCH set is less than or equal to the maximum receiving capability of the terminal.
  • Step 102 The terminal receives data on the PDSCH to be received in the received PDSCH set. After the terminal determines the received PDSCH set, the terminal receives data on the PDSCH included in the received PDSCH set.
  • the terminal determines the received PDSCH set according to the priority of the candidate PDSCH scheduled by the base station, and the number of PDSCH included in the received PDSCH set satisfies the terminal's receiving capability, so that the terminal can receive multiple data services at the same time, and can The type and quantity of PDSCH finally received are selected according to the service priority to meet user requirements.
  • the terminal determines to receive the PDSCH set according to the priority of the candidate PDSCH scheduled by the base station, which may include one of the following:
  • the method of determining the received PDSCH set is applicable to Capability A and Capability B, that is, when the terminal's receiving capability is: in TDM mode, when receiving data of N PDSCHs at most, it can start from the PDSCH with the highest priority Select until the number of selected PDSCHs satisfies the terminal's receiving capability; when the terminal receives: in the FDM manner, when receiving data of at most N PDSCHs, the selection can start from the PDSCH with the highest priority until the number of selected PDSCHs satisfies the terminal Receiving ability.
  • the terminal when determining to receive a PDSCH to be received in the PDSCH set, the terminal selects the PDSCH with the highest priority in the current candidate PDSCH set each time.
  • the candidate PDSCH set includes 6 PDSCHs, and the terminal selects the PDSCH with the highest priority among the 6 PDSCHs for the first time as the PDSCH to be received, then the candidate PDSCH set at this time also includes 5 PDSCHs.
  • the terminal selects a PDSCH with the highest priority among the five PDSCHs as the PDSCH to be received, and selects it cyclically until the number of PDSCHs to be received meets the receiving capability of the terminal.
  • This method of determining the received PDSCH set is applicable to Capability A and Capability B, that is, when the terminal's receiving capability is: in the TDM manner, when receiving data of at most N PDSCHs, it can start from the PDSCH with the lowest priority Exclude until the number of PDSCHs in the candidate PDSCH set after excluding the PDSCH meets the terminal's receiving capability; when the terminal receives: in the FDM manner, when receiving data of at most N PDSCHs, it can be excluded from the PDSCH with the lowest priority until The number of PDSCHs in the excluded candidate PDSCH set satisfies the terminal's receiving capability.
  • the terminal when the terminal determines to receive PDSCHs in the PDSCH set to be received, the terminal selects the PDSCH with the lowest priority in the current candidate PDSCH set for exclusion each time.
  • the candidate PDSCH set includes 6 PDSCHs, and the terminal selects the PDSCH with the lowest priority among the 6 PDSCHs for the first time for exclusion, then the candidate PDSCH set also includes 5 PDSCHs at this time.
  • the terminal selects one PDSCH with the lowest priority among the five PDSCHs for exclusion, and selects it cyclically until the number of PDSCHs to be received satisfies the terminal's receiving capability.
  • the terminal receives data on the PDSCH in a TDM manner, or receives data on the PDSCH in an FDM manner, and can select from the PDSCH with the highest priority in the candidate PDSCH set until the number of selected PDSCHs satisfies the terminal.
  • the receiving capability can also be excluded from the PDSCH with the lowest priority in the candidate PDSCH set until the number of PDSCHs in the candidate PDSCH set after excluding the PDSCH meets the terminal's receiving capability.
  • the following describes the specific method of determining the PDSCH set according to the highest priority PDSCH in the candidate PDSCH set, and the specific method of determining the receiving PDSCH set according to the PDSCH with the highest and lower priority in the candidate PDSCH set.
  • determining the received PDSCH set may include:
  • Step 1 Determine the first PDSCH with the highest priority in the candidate PDSCH set as the PDSCH to be received in the received PDSCH set; the situation where the total number of PDSCHs to be received in the received PDSCH set reaches the maximum receiving capability of the terminal
  • the received PDSCH set including the first PDSCH is determined as the received PDSCH set; in the case that the total number of PDSCHs to be received in the received PDSCH set does not reach the maximum receiving capability of the terminal, step 2 is performed;
  • Step 2 Delete the first PDSCH from the candidate PDSCH set, delete the second PDSCH in the candidate PDSCH set, and use the candidate PDSCH set after deleting the first PDSCH and the second PDSCH as the first PDSCH.
  • a candidate set, the second PDSCH is a PDSCH that overlaps with all PDSCHs in the received PDSCH set; if the first candidate set is not an empty set, the first candidate set is used as the candidate PDSCH set Step 1 is repeated, and if the first candidate set is an empty set, the received PDSCH set including the first PDSCH is determined as the received PDSCH set.
  • the UE selects a PDSCH with a higher priority from the candidate PDSCH set and puts it into the received PDSCH set. If the total number of PDSCHs to be received in the received PDSCH set reaches the maximum receiving capability of the terminal, it stops selecting the PDSCH to be received In the operation of receiving the PDSCH, the PDSCH to be received in the received PDSCH set obtained at this time is the PDSCH to be received by the terminal.
  • the PDSCH to be received in the received PDSCH set does not reach the maximum receiving capability of the terminal. If the total number of PDSCHs to be received in the received PDSCH set does not reach the maximum receiving capability of the terminal, all PDSCHs in the candidate PDSCH set that overlap with the PDSCHs in the received PDSCH set in the time domain or frequency domain are excluded.
  • a first candidate set is obtained after deleting all PDSCHs in the candidate PDSCH set that overlap with all PDSCHs in the received PDSCH set in the time domain or frequency domain, and if the first candidate set is an empty set, stop selecting the waiting set.
  • the PDSCH to be received in the received PDSCH set obtained at this time is the PDSCH to be received by the terminal.
  • the first candidate set is not an empty set
  • use the first candidate set as the candidate PDSCH set repeat step 1, and select the PDSCH with the highest priority from the first candidate set
  • the above operations are performed cyclically until the number of PDSCHs in the received PDSCH set satisfies the UE capability or the candidate PDSCH set is empty.
  • the UE selects data on the PDSCH in the received PDSCH set to receive.
  • the second PDSCH in the step 2 when the terminal receives data in a TDM manner, the second PDSCH in the step 2 is the PDSCH overlapping in the time domain with all PDSCHs in the received PDSCH set;
  • the second PDSCH in the second step is a PDSCH overlapping in the frequency domain with all PDSCHs in the received PDSCH set.
  • the specific implementation process of this embodiment is described by taking a mode in which the terminal receiving capability is TDM or FDM, and the terminal simultaneously receives at most N PDSCHs as an example.
  • the terminal selects a PDSCH with a higher priority from the candidate PDSCH set for reception until the UE's receiving capability is reached.
  • the type of PDSCH may not be distinguished, for example, whether the PDSCH is a unicast PDSCH or an MBS PDSCH is not distinguished.
  • the priorities of different PDSCHs have been known. The specific steps are shown in Figure 2:
  • the received PDSCH set is S_1
  • the candidate PDSCH set is S_2
  • the maximum number of PDSCHs received by the UE is N.
  • C() represents the size of the set, that is, how many elements are contained in the set.
  • An empty collection has a size of 0.
  • the UE selects to receive the PDSCH in the S_1 set.
  • the PDSCH set with the highest priority in the candidate PDSCH set is determined to receive the PDSCH set.
  • the number of PDSCHs to be received in the received PDSCH set satisfies the terminal's receiving capability. Selecting the number and type of PDSCH finally received can meet the needs of users in the 5G network.
  • the above is the specific implementation process of determining the received PDSCH set according to the PDSCH with the highest priority in the candidate PDSCH set.
  • the following describes the implementation process of determining the received PDSCH set according to the PDSCH with the lowest priority in the candidate PDSCH set.
  • performing exclusion processing on the PDSCH with the lowest priority in the candidate PDSCH set, and determining the candidate PDSCH set after the exclusion processing as the receiving PDSCH set which may include:
  • Step 1 Delete the second PDSCH with the lowest priority in the candidate PDSCH set to obtain a second candidate set; the number of PDSCHs in the second candidate set satisfies the terminal receiving capability, and the second candidate set does not In the case of overlapping PDSCHs in the time domain or frequency domain, the second candidate set is determined as the received PDSCH set; the number of PDSCHs in the second candidate set does not meet the terminal receiving capability, or the In the case of overlapping PDSCHs in the second candidate set, perform step 2;
  • Step 2 Use the second candidate set as the candidate PDSCH set, and repeat Step 1.
  • the UE excludes PDSCHs with low priority in the candidate PDSCH set, and then judges whether there is overlap between PDSCHs in the second candidate set obtained after the update, if the PDSCHs in the second candidate set In the case that the number of s satisfies the receiving capability of the terminal, and there is no PDSCH overlapping in the time domain or frequency domain in the second candidate set, the second candidate set is determined as the received PDSCH set.
  • the UE continues to exclude PDSCHs with low priority in the second candidate set, and performs the above operations cyclically until the remaining PDSCHs in the candidate PDSCH set do not overlap each other.
  • the UE selects data on the PDSCH in the candidate PDSCH set for reception.
  • the "overlapping PDSCH” in step 1 refers to: the PDSCH overlapping in the time domain;
  • the "overlapping PDSCH” in the first step refers to: the PDSCH overlapping in the frequency domain.
  • the specific implementation process of this embodiment is described by taking the UE receiving capability as TDM or FDM, and the UE simultaneously receives at most N PDSCHs as an example.
  • the UE sequentially excludes PDSCHs with low priority from the candidate PDSCH set until the UE's receiving capability is reached; and then judges whether there is overlap in the candidate PDSCH set after excluding PDSCH, and if there is overlap, continue to exclude PDSCH with low priority until there is no overlap in the remaining candidate PDSCH set.
  • the service types of PDSCH are not distinguished, and the priority of PDSCH has been known.
  • the specific steps are shown in Figure 3:
  • H_1 includes all PDSCHs, and the maximum number of PDSCHs received by the UE is N.
  • Step d) is performed until there is no overlapping phenomenon or the UE receiving capability is satisfied.
  • the UE selects to receive the PDSCH in the H_1 set.
  • the PDSCH with the lowest priority in the candidate PDSCH set is excluded, and the received PDSCH set is determined.
  • the number of PDSCHs to be received in the received PDSCH set satisfies the terminal's receiving capability, and the terminal can receive multiple data services at the same time.
  • the priority is to select the number and type of PDSCH finally received, which can meet the needs of users under the 5G network.
  • the terminal may choose to receive PDSCH in one of the following schemes:
  • Scheme 1 receive set S_1;
  • Scheme 2 receive set H_1;
  • Option 3 Select to receive S_1 or H_1 according to the judgment criteria.
  • Criterion 1 Select a scheme with a large set of received PDSCHs.
  • the size of the received PDSCH set in scheme 1 is 3, and the size of the received PDSCH set in scheme 2 is 2, then the UE selects to receive S_1.
  • Criterion 2 Choose a scheme with a large sum of priority weights. Assuming that the set is ⁇ PDSCHx, PDSCHy, PDSCHz ⁇ , the corresponding priority weights are ⁇ 6, 3, 1 ⁇ , and the weight sum is 10; the corresponding priority weights of ⁇ PDSCHa, PDSCHb ⁇ are ⁇ 6, 5 ⁇ , and the weight sum is 11, then The UE chooses to receive H_1.
  • the method further includes: when the two PDSCHs satisfy a first condition, determining that the two PDSCHs do not overlap in the time domain; wherein the first condition is: one of the two PDSCHs The start time of a PDSCH is later than the end time of another PDSCH.
  • This embodiment is a method for judging that two PDSCHs do not overlap in the time domain.
  • the start time of any PDSCH is later than the end time of the other PDSCH, and the two PDSCHs do not overlap in the time domain.
  • the relevant information of the Time Domain Resource Assignment table may be used to determine whether there is overlap in one time slot between the two PDSCHs.
  • the TDRA field in the downlink control information Downlink Control Information, DCI
  • DCI Downlink Control Information
  • the time domain does not overlap if the number of start symbol indices of any PDSCH is greater than the number of end symbol indices of another PDSCH, the time domain does not overlap.
  • Table 4 The TDRA table corresponding to each PDSCH in FIG. 4 is shown in Table 1.
  • S indicates the index number of the PDSCH start symbol slot position
  • L indicates the length of the PDSCH allocation consecutive symbols
  • m indicates the end symbol of the PDSCH calculated according to "S" and "L" Slot position index number.
  • the number of start symbol indices of P1-PDSCH is 6, and the number of end symbol indices thereof is 7.
  • the number of start symbol indices of P2-PDSCH is 9, and the number of end symbol indices thereof is 13. Then the number of start symbol indices of the P2-PDSCH is greater than the end symbols of the P1-PDSCH (9>7), and the non-overlapping condition is satisfied, then the P1-PDSCH and the P2-PDSCH do not overlap in the time domain.
  • the number of start symbol indices of P1-PDSCH is 6, and the number of end symbol indices thereof is 7.
  • the method further includes: when the two PDSCHs satisfy a second condition, determining that the two PDSCHs do not overlap in the frequency domain; wherein the second condition is: one of the two PDSCHs The starting resource block RB index number of a PDSCH is greater than the ending RB index number of another PDSCH.
  • This embodiment is a method for judging that two PDSCHs do not overlap in the frequency domain.
  • the starting RB index number of any one PDSCH is greater than the ending RB index number of another PDSCH, so the two PDSCHs do not overlap in the frequency domain.
  • parameters in the frequency domain resource assignment field (Frequency domain resource assignment field) in the DCI need to be used: the number of initial RB indices (RB start ) and the number of configured consecutive RBs (L RBs ).
  • the number of start symbol indices of any PDSCH is greater than the number of end symbol indices of another PDSCH and the two PDSCHs do not overlap in the frequency domain.
  • the specific method is similar to the method for judging that the two PDSCHs do not overlap in the time domain, and will not be repeated here.
  • the candidate PDSCH may be the PDSCH scheduled by the base station before the target time threshold of the receiving time slot.
  • the method further includes: in the case that the number of PDSCHs to be received does not meet the maximum receiving capability of the terminal, according to the time sequence of PDSCHs scheduled by the base station after the target time threshold, receive the PDSCHs in the time domain or frequency domain. Data on PDSCH that do not overlap on domains.
  • a target time threshold can be set before receiving the time slot, and the PDSCH scheduled before the target time threshold can be preferentially processed.
  • the target time threshold may be set at the first X symbols (symbols) of this time slot (n), as shown in FIG. 5 .
  • the PDSCH scheduled before the target time threshold can be selected using the solutions proposed in the embodiments of the present disclosure. That is, the PDSCH scheduled after the target time threshold has a lower priority and does not participate in the first selection of PDSCH.
  • the PDSCH scheduled after the target time threshold arrives will be selected and received without overlap in the order of arrival time. If the UE's receiving capability is satisfied, it will no longer receive the PDSCH scheduled after the target time threshold is reached.
  • a target time threshold is set before the receiving time slot, and the PDSCH scheduled before the target time threshold is used as the candidate PDSCH, and the terminal determines the received PDSCH set according to the priority of the candidate PDSCH;
  • the scheduled PDSCH, the terminal selects and receives according to the time sequence of the PDSCH.
  • the UE can receive multiple data services at the same time, and can select the number and type of PDSCH finally received according to the service priority. It can meet the needs of users under the 5G network.
  • Example 1 The terminal receives up to 3 PDSCHs simultaneously in TDM mode, and the terminal determines to receive the PDSCH set according to the PDSCH with the highest priority in the candidate PDSCH set, which specifically includes the following steps:
  • Step 1 Determine the parameter set and the UE receiving capability.
  • the UE receives up to 3 PDSCHs in TDM.
  • Step 2 Select the highest priority PDSCH.
  • Step 3 determine whether the UE reception capability is satisfied.
  • step 4 is executed.
  • Step 4 The UE selects to receive the PDSCH in the S_1 set.
  • Example 2 The terminal receives up to 3 PDSCHs at the same time in the FDM mode, and the terminal determines to receive the PDSCH set according to the PDSCH with the highest priority in the candidate PDSCH set, which specifically includes the following steps:
  • Step1 Determine the parameter set and UE receiving capability.
  • the UE receives up to 3 PDSCHs in FDM.
  • Step2 Select the highest priority PDSCH.
  • Step 3 Determine whether the UE receiving capability is satisfied.
  • S_2' ⁇ P4-PDSCH ⁇
  • S_1 ⁇ P1-PDSCH, P2-PDSCH, P4-PDSCH ⁇
  • Step 4 The UE selects to receive the PDSCH in the S_1 set.
  • Example 3 The terminal receives up to 3 PDSCHs simultaneously in TDM mode, and the terminal performs exclusion processing on the PDSCH with the lowest priority in the candidate PDSCH set, and determines the candidate PDSCH set after the exclusion processing as the received PDSCH set, which specifically includes the following steps :
  • Step 1 Determine the parameter set and UE receiving capability.
  • H_1 ⁇ P1-PDSCH, P2-PDSCH, P3-PDSCH, P4-PDSCH, P5-PDSCH, P6-PDSCH ⁇ ;
  • the UE receives up to 3 PDSCHs in TDM.
  • Step2 Select the lowest priority PDSCH.
  • H_1' ⁇ P6-PDSCH ⁇
  • Step3 Determine whether H_1 has overlap and whether the UE's receiving capability is satisfied.
  • Example 4 The terminal receives up to 3 PDSCHs at the same time in the FDM mode, and the terminal excludes the PDSCH with the lowest priority in the candidate PDSCH set, and determines the candidate PDSCH set after the exclusion processing as the received PDSCH set, which specifically includes the following steps :
  • Step 1 Determine the parameter set and UE receiving capability.
  • H_1 ⁇ P1-PDSCH, P2-PDSCH, P3-PDSCH, P4-PDSCH, P5-PDSCH, P6-PDSCH ⁇ ;
  • the UE receives up to 3 PDSCHs in FDM.
  • Step2 Select the lowest priority PDSCH.
  • H_1' P6-PDSCH
  • Step3 Determine whether H_1 has overlap and whether the UE's receiving capability is satisfied.
  • H_1' ⁇ P5-PDSCH ⁇
  • H_1' P4-PDSCH
  • Example 1 refers to: determining the PDSCH set to receive according to the PDSCH with the highest priority in the candidate PDSCH set;
  • scheme 2 refers to: excluding the PDSCH with the lowest priority in the candidate PDSCH set, the processed candidate PDSCH will be excluded.
  • the PDSCH set is determined as the received PDSCH set.
  • the terminal determines the received PDSCH set according to the priority of the candidate PDSCH scheduled by the base station, and the number of PDSCH included in the received PDSCH set satisfies the terminal's receiving capability, so that the terminal can receive multiple data services at the same time, and can The type and quantity of PDSCH finally received are selected according to the service priority to meet user requirements.
  • the applicable system may be a global system of mobile communication (GSM) system, a code division multiple access (CDMA) system, a wideband code division multiple access (Wideband Code Division Multiple Access, WCDMA) general packet Wireless service (general packet radio service, GPRS) system, long term evolution (long term evolution, LTE) system, long term evolution (Long Term Evolution, LTE) frequency division duplex (frequency division duplex, FDD) system, LTE time division duplex ( time division duplex (TDD) system, long term evolution advanced (LTE-A) system, universal mobile telecommunication system (UMTS), worldwide interoperability for microwave access (WiMAX) system , 5G New Radio (NR) system, etc.
  • GSM global system of mobile communication
  • CDMA code division multiple access
  • WCDMA Wideband Code Division Multiple Access
  • general packet Wireless service general packet Radio service
  • GPRS general packet Wireless service
  • LTE long term evolution
  • LTE long term evolution
  • LTE long term evolution
  • LTE long term evolution
  • LTE
  • an apparatus 600 for receiving PDSCH including:
  • a first determining unit 610 configured to determine a received PDSCH set according to the priority of the candidate physical downlink shared channel PDSCH scheduled by the base station, where the number of PDSCHs to be received in the received PDSCH set satisfies the terminal's receiving capability;
  • the first receiving unit 620 is configured to receive data on the PDSCH to be received in the received PDSCH set.
  • the first determining unit 610 specifically includes one of the following:
  • a first determination subunit configured to determine a received PDSCH set according to the PDSCH with the highest priority in the candidate PDSCH set, where the number of PDSCHs to be received in the received PDSCH set satisfies the terminal receiving capability
  • the second determination subunit is configured to perform exclusion processing on the PDSCH with the lowest priority in the candidate PDSCH set, and determine the candidate PDSCH set after the exclusion processing as the received PDSCH set, and the number of PDSCHs to be received in the received PDSCH set Satisfy the terminal receiving capability.
  • the first determination subunit is specifically used to implement:
  • Step 1 Determine the first PDSCH with the highest priority in the candidate PDSCH set as the PDSCH to be received in the received PDSCH set; the situation where the total number of PDSCHs to be received in the received PDSCH set reaches the maximum receiving capability of the terminal
  • the received PDSCH set including the first PDSCH is determined as the received PDSCH set; in the case that the total number of PDSCHs to be received in the received PDSCH set does not reach the maximum receiving capability of the terminal, step 2 is performed;
  • Step 2 Delete the first PDSCH from the candidate PDSCH set, delete the second PDSCH in the candidate PDSCH set, and use the candidate PDSCH set after deleting the first PDSCH and the second PDSCH as the first PDSCH.
  • a candidate set, the second PDSCH is a PDSCH that overlaps with all PDSCHs in the received PDSCH set; if the first candidate set is not an empty set, the first candidate set is used as the candidate PDSCH set Step 1 is repeated, and if the first candidate set is an empty set, the received PDSCH set including the first PDSCH is determined as the received PDSCH set.
  • the second determination subunit is specifically used to implement:
  • Step 1 Delete the second PDSCH with the lowest priority in the candidate PDSCH set to obtain a second candidate set; the number of PDSCHs in the second candidate set satisfies the terminal receiving capability, and the second candidate set does not In the case of overlapping PDSCHs in the time domain or frequency domain, the second candidate set is determined as the received PDSCH set; the number of PDSCHs in the second candidate set does not meet the terminal receiving capability, or the In the case of overlapping PDSCHs in the second candidate set, perform step 2;
  • Step 2 Use the second candidate set as the candidate PDSCH set, and repeat Step 1.
  • the device further includes:
  • a second determining unit configured to determine that the two PDSCHs do not overlap in the time domain when the two PDSCHs satisfy the first condition
  • the first condition is: the start time of one PDSCH in the two PDSCHs is later than the end time of the other PDSCH.
  • the device further includes:
  • a third determining unit configured to determine that the two PDSCHs do not overlap in the frequency domain when the two PDSCHs satisfy the second condition
  • the second condition is: the starting resource block RB index number of one PDSCH in the two PDSCHs is greater than the ending RB index number of the other PDSCH.
  • the candidate PDSCH is a PDSCH scheduled by the base station before the target time threshold of the receiving slot.
  • the device further includes:
  • the second receiving unit is configured to receive, according to the time sequence of PDSCHs scheduled by the base station after the target time threshold, when the number of PDSCHs to be received does not meet the maximum receiving capability of the terminal, receive data that are not in the time domain or the frequency domain. Data on overlapping PDSCHs.
  • the embodiments of the apparatus correspond to the above-mentioned embodiments of the method for receiving PDSCH, and all the implementation manners in the above-mentioned method embodiments are applicable to the embodiments of the apparatus, and the same technical effects can also be achieved. Since the method embodiment and the device embodiment are based on the same concept, and the principles for solving the problem are similar, reference can be made to each other, and repeated descriptions will not be repeated.
  • each functional unit in each embodiment of the present disclosure may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the above-mentioned integrated units may be implemented in the form of hardware, or may be implemented in the form of software functional units.
  • the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a processor-readable storage medium.
  • the technical solutions of the present disclosure are essentially or contribute to related technologies, or all or part of the technical solutions can be embodied in the form of software products, and the computer software products are stored in a storage medium. , including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the methods described in the various embodiments of the present disclosure.
  • the aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk and other media that can store program codes .
  • an embodiment of the present disclosure further provides an apparatus for receiving PDSCH, including: a memory 720, a transceiver 700, and a processor 710; wherein, the memory 720 is used to store computer programs; the transceiver 700 is used for to send and receive data under the control of the processor 710;
  • the processor 710 is configured to read the computer program in the memory 720 and perform the following operations:
  • the terminal determines to receive a PDSCH set according to the priority of the candidate PDSCH scheduled by the base station, which specifically includes one of the following:
  • the PDSCH with the lowest priority in the candidate PDSCH set is excluded, and the candidate PDSCH set after the exclusion process is determined as the received PDSCH set, and the number of PDSCHs to be received in the received PDSCH set satisfies the terminal's receiving capability.
  • the received PDSCH set which specifically includes:
  • Step 1 Determine the first PDSCH with the highest priority in the candidate PDSCH set as the PDSCH to be received in the received PDSCH set; the situation where the total number of PDSCHs to be received in the received PDSCH set reaches the maximum receiving capability of the terminal
  • the received PDSCH set including the first PDSCH is determined as the received PDSCH set; in the case that the total number of PDSCHs to be received in the received PDSCH set does not reach the maximum receiving capability of the terminal, step 2 is performed;
  • Step 2 Delete the first PDSCH from the candidate PDSCH set, delete the second PDSCH in the candidate PDSCH set, and use the candidate PDSCH set after deleting the first PDSCH and the second PDSCH as the first PDSCH.
  • a candidate set, the second PDSCH is a PDSCH that overlaps with all PDSCHs in the received PDSCH set; if the first candidate set is not an empty set, the first candidate set is used as the candidate PDSCH set Step 1 is repeated, and if the first candidate set is an empty set, the received PDSCH set including the first PDSCH is determined as the received PDSCH set.
  • the PDSCH with the lowest priority in the candidate PDSCH set is excluded, and the candidate PDSCH set after the exclusion processing is determined as the received PDSCH set, which specifically includes:
  • Step 1 Delete the second PDSCH with the lowest priority in the candidate PDSCH set to obtain a second candidate set; the number of PDSCHs in the second candidate set satisfies the terminal receiving capability, and the second candidate set does not
  • the second candidate set is determined as the received PDSCH set; the number of PDSCHs in the second candidate set does not meet the terminal's receiving capability, or the second candidate set exists
  • step 2 performs step 2;
  • Step 2 Use the second candidate set as the candidate PDSCH set, and repeat Step 1.
  • processor when the processor executes the computer program, it is further configured to implement the following steps:
  • the two PDSCHs satisfy the first condition, it is determined that the two PDSCHs do not overlap in the time domain;
  • the first condition is: the start time of one PDSCH in the two PDSCHs is later than the end time of the other PDSCH.
  • processor when the processor executes the computer program, it is further configured to implement the following steps:
  • the second condition is: the starting resource block RB index number of one PDSCH in the two PDSCHs is greater than the ending RB index number of the other PDSCH.
  • the candidate PDSCH is a PDSCH scheduled by the base station before the target time threshold of the receiving slot.
  • processor when the processor executes the computer program, it is further configured to implement the following steps:
  • the bus architecture may include any number of interconnected buses and bridges, specifically one or more processors represented by processor 710 and various circuits of memory represented by memory 720 linked together.
  • the bus architecture may also link together various other circuits, such as peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be described further herein.
  • the bus interface provides the interface.
  • Transceiver 700 may be a number of elements, including a transmitter and a receiver, providing means for communicating with various other devices over transmission media including wireless channels, wired channels, fiber optic cables, and the like Transmission medium.
  • the user interface 730 may also be an interface capable of externally connecting a required device, and the connected devices include but are not limited to a keypad, a display, a speaker, a microphone, a joystick, and the like.
  • the processor 710 is responsible for managing the bus architecture and general processing, and the memory 720 may store data used by the processor 710 in performing operations.
  • the processor 710 may be a central processing unit (Central Processing Unit, CPU), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a field programmable gate array (Field-Programmable Gate Array, FPGA) or a complex programmable Logic device (Complex Programmable Logic Device, CPLD), the processor can also use a multi-core architecture.
  • CPU Central Processing Unit
  • ASIC Application Specific Integrated Circuit
  • FPGA Field-Programmable Gate Array
  • CPLD Complex Programmable Logic Device
  • the processor is configured to execute any one of the methods provided by the embodiments of the present disclosure according to the obtained executable instructions by invoking the computer program stored in the memory.
  • the processor and memory may also be physically separated.
  • a specific embodiment of the present disclosure also provides a processor-readable storage medium on which a computer program is stored, wherein when the program is executed by a processor, the steps of the above method for receiving a PDSCH are implemented. And can achieve the same technical effect, in order to avoid repetition, it is not repeated here.
  • the readable storage medium may be any available medium or data storage device that can be accessed by the processor, including but not limited to magnetic storage (eg floppy disk, hard disk, magnetic tape, magneto-optical disk (MO), etc.), optical storage (eg CD, DVD, BD, HVD, etc.), and semiconductor memory (eg, ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state disk (SSD)), etc.
  • magnetic storage eg floppy disk, hard disk, magnetic tape, magneto-optical disk (MO), etc.
  • optical storage eg CD, DVD, BD, HVD, etc.
  • semiconductor memory eg, ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state disk (SSD)
  • embodiments of the present disclosure may be provided as a method, system, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable storage media having computer-usable program code embodied therein, including but not limited to disk storage, optical storage, and the like.
  • processor-executable instructions may also be stored in a processor-readable memory capable of directing a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the processor-readable memory result in the manufacture of means including the instructions product, the instruction means implement the functions specified in the flow or flows of the flowchart and/or the block or blocks of the block diagram.
  • processor-executable instructions can also be loaded onto a computer or other programmable data processing device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process that
  • the instructions that execute provide steps for implementing the functions specified in the flow or flows of the flowchart and/or the block or blocks of the block diagrams.
  • modules can all be implemented in the form of software calling through processing elements; they can also all be implemented in hardware; some modules can also be implemented in the form of calling software through processing elements, and some modules can be implemented in hardware.
  • the determination module may be a separately established processing element, or may be integrated into a certain chip of the above-mentioned device to be implemented, in addition, it may also be stored in the memory of the above-mentioned device in the form of program code, and a certain processing element of the above-mentioned device may Call and execute the function of the above determined module.
  • the implementation of other modules is similar. In addition, all or part of these modules can be integrated together, and can also be implemented independently.
  • the processing element described here may be an integrated circuit with signal processing capability. In the implementation process, each step of the above-mentioned method or each of the above-mentioned modules can be completed by an integrated logic circuit of hardware in the processor element or an instruction in the form of software.
  • each module, unit, sub-unit or sub-module may be one or more integrated circuits configured to implement the above methods, such as: one or more Application Specific Integrated Circuit (ASIC), or, one or Multiple microprocessors (digital signal processors, DSP), or, one or more field programmable gate arrays (Field Programmable Gate Array, FPGA), etc.
  • ASIC Application Specific Integrated Circuit
  • DSP digital signal processors
  • FPGA Field Programmable Gate Array
  • the processing element may be a general-purpose processor, such as a central processing unit (Central Processing Unit, CPU) or other processors that can call program codes.
  • CPU central processing unit
  • these modules can be integrated together and implemented in the form of a system-on-a-chip (SOC).
  • SOC system-on-a-chip

Landscapes

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

Abstract

本公开提供了一种接收PDSCH的方法、装置及处理器可读存储介质。所述方法包括：终端根据基站调度的候选物理下行共享信道PDSCH的优先级，确定接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力；终端接收所述接收PDSCH集合中的待接收PDSCH上的数据。

Description

接收PDSCH的方法、装置及处理器可读存储介质
相关申请的交叉引用
本公开主张在2021年01月08日在中国提交的中国专利申请号No.202110023269.1的优先权，其全部内容通过引用包含于此。
技术领域
本公开涉及通信技术领域，尤其涉及一种接收PDSCH的方法、装置及处理器可读存储介质。
背景技术
随着移动视频业务、对等组播/广播流、通过移动网络的软件升级、群组通信以及广播/组播物联网应用的日益普及，全球移动通信业界达成共识，第五代移动通信技术(5th Generation Mobile Communication Technology，5G)网络需要具备在单播型业务及组播型业务间灵活、动态地进行无线频谱及网络资源分配的能力，并需要支持对于广播/组播网络的独立部署。
在一个接收时间单元中，终端能够接收的最大业务数据物理下行共享信道(Physical downlink shared channel，PDSCH)的个数是确定的。在新空口多播和广播服务(New Radio Multicast and Broadcast Services，NR MBS)系统中，终端(User Equipment，UE)可能需要同时接收广播、组播和单播业务的PDSCH，其中既包括动态调度的PDSCH也包括半持续调度(Semi-Persistent Scheduling，SPS)PDSCH。所以基站有可能在一个时隙(slot)内对PDSCH的调度超过UE能力，终端如何从多个PDSCH中选出满足UE能力需求的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集合中优先级最高的第一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集合确定为接收PDSCH集合，包括：
步骤一：删除所述候选PDSCH集合中最低优先级的第二PDSCH，获得第二候选集合；在所述第二候选集合中的PDSCH的数量满足终端接收能力，且所述第二候选集合中不存在重叠的PDSCH的情况下，将所述第二候选集合确定为所述接收PDSCH集合；在所述第二候选集合中的PDSCH的数量不满足终端接收能力，或者所述第二候选集合中存在重叠的PDSCH的情况下，执行步骤二；
步骤二：将所述第二候选集合作为所述候选PDSCH集合，重复所述步骤一。
可选地，所述方法还包括：
在两个PDSCH满足第一条件的情况下，确定所述两个PDSCH在时域上不重叠；
其中，所述第一条件为：两个PDSCH中的一个PDSCH的起始时间晚于另一个PDSCH的结束时间。
可选地，所述方法还包括：
在两个PDSCH满足第二条件的情况下，确定所述两个PDSCH在频域上不重叠；
其中，所述第二条件为：两个PDSCH中的一个PDSCH的起始资源块(Resource Block，RB)索引数大于另一个PDSCH的结束RB索引数。
可选地，候选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集合，具体包括：
步骤一：将所述候选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进行排除处理，将排除处理后的所述候选PDSCH集合确定为接收PDSCH集合，具体包括：
步骤一：删除所述候选PDSCH集合中最低优先级的第二PDSCH，获得第二候选集合；在所述第二候选集合中的PDSCH的数量满足终端接收能力，且所述第二候选集合中不存在重叠的PDSCH的情况下，将所述第二候选集 合确定为所述接收PDSCH集合；在所述第二候选集合中的PDSCH的数量不满足终端接收能力，或者所述第二候选集合中存在重叠的PDSCH的情况下，执行步骤二；
步骤二：将所述第二候选集合作为所述候选PDSCH集合，重复所述步骤一。
可选地，所述处理器执行所述计算机程序时还用于实现以下步骤：
在两个PDSCH满足第一条件的情况下，确定所述两个PDSCH在时域上不重叠；
其中，所述第一条件为：两个PDSCH中的一个PDSCH的起始时间晚于另一个PDSCH的结束时间。
可选地，所述处理器执行所述计算机程序时还用于实现以下步骤：
在两个PDSCH满足第二条件的情况下，确定所述两个PDSCH在频域上不重叠；
其中，所述第二条件为：两个PDSCH中的一个PDSCH的起始资源块RB索引数大于另一个PDSCH的结束RB索引数。
可选地，所述候选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集合中的待接收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的情况下，执行步骤二；
步骤二：将所述第二候选集合作为所述候选PDSCH集合，重复所述步骤一。
可选地，所述装置还包括：
第二确定单元，用于在两个PDSCH满足第一条件的情况下，确定所述两个PDSCH在时域上不重叠；
其中，所述第一条件为：两个PDSCH中的一个PDSCH的起始时间晚于另一个PDSCH的结束时间。
可选地，所述装置还包括：
第三确定单元，用于在两个PDSCH满足第二条件的情况下，确定所述两个PDSCH在频域上不重叠；
其中，所述第二条件为：两个PDSCH中的一个PDSCH的起始资源块RB索引数大于另一个PDSCH的结束RB索引数。
可选地，所述候选PDSCH为基站在接收时隙的目标时间门限之前调度的PDSCH。
可选地，所述装置还包括：
第二接收单元，用于在所述待接收PDSCH的数量未满足终端最大接收能力的情况下，根据基站在所述目标时间门限之后调度的PDSCH的时间顺序，接收在时域或者频域上不重叠的PDSCH上的数据。
本公开的实施例提供一种处理器可读存储介质，其上存储有计算机程序，该计算机程序被处理器执行时实现上述接收PDSCH的方法的步骤。
本公开的上述技术方案的有益效果是：
本公开的实施例，终端根据基站调度的候选PDSCH的优先级，确定接收PDSCH集合，所述接收PDSCH集合中包含的PDSCH的数量满足终端接收能力，使终端能够同时接收多个数据业务，并可以根据业务优先级选择最终接收的PDSCH的类型和数量，满足用户需求。
附图说明
图1表示本公开实施例的接收PDSCH的方法的流程示意图之一；
图2表示本公开实施例的接收PDSCH的方法的流程示意图之二；
图3表示本公开实施例的接收PDSCH的方法的流程示意图之三；
图4表示本公开实施例的多个PDSCH之间的位置关系示意图；
图5表示本公开实施例的目标时间门限的设置位置示意图；
图6表示本公开实施例的接收PDSCH的装置的结构示意图之一；
图7表示本公开实施例的接收PDSCH的装置的结构示意图之二。
具体实施方式
为使本公开要解决的技术问题、技术方案和优点更加清楚，下面将结合附图及具体实施例进行详细描述。在下面的描述中，提供诸如具体的配置和组件的特定细节仅仅是为了帮助全面理解本公开的实施例。因此，本领域技术人员应该清楚，可以对这里描述的实施例进行各种改变和修改而不脱离本公开的范围和精神。另外，为了清楚和简洁，省略了对已知功能和构造的描述。
应理解，说明书通篇中提到的“一个实施例”或“一实施例”意味着与实施例有关的特定特征、结构或特性包括在本公开的至少一个实施例中。因此，在整个说明书各处出现的“在一个实施例中”或“在一实施例中”未必一定指相同的实施例。此外，这些特定的特征、结构或特性可以任意适合的方式结合在一个或多个实施例中。
在本公开的各种实施例中，应理解，下述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本公开实施例的实施过程构成任何限定。
另外，本文中术语“系统”和“网络”在本文中常可互换使用。
本公开实施例中术语“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。字符“/”一般表示前后关联对象是一种“或”的关系。
本公开实施例中术语“多个”是指两个或两个以上，其它量词与之类似。
在进行本公开实施例的说明时，首先对下面描述中所用到的一些概念进行解释说明。
(1)业务数据的接收：
在一个时隙中，当有多个PDSCH下发时，UE需要根据UE能力及业务优先级对PDSCH进行选择和排除，以判断出最终UE接收的PDSCH类型和 数量。
(2)业务数据优先级：
不同业务数据，有不同的业务优先级，比如：在超可靠低时延通信(Ultra-Reliable and Low Latency Communications，URLLC)、多播控制信道(Multicast Control Channel，MCCH)PDSCH(MCCH-PDSCH)、MBS、增强移动宽带(Enhanced Mobile Broadband，eMBB)中，URLLC＞MCCH-PDSCH＞MBS＞eMBB业务。在进行PDSCH判断接收时，业务优先级是必须要考虑的因素。一般情况下，UE会选择接收优先级较高的业务数据。在本公开中，假设业务优先级已经被配置，即每个被调度的数据业务PDSCH都有一个对应的优先级等级，且优先级数值不同。
(3)UE能力分类：
UE接收能力的定义是在一个时隙内，UE以频分多路复用(Frequency-division multiplexing，FDM)或/和时分多路复用(Time-division multiplexing，TDM)的方式同时接收PDSCH的数量。具体UE接收能力确定参数可以包括如下：
以FDM的方式接收PDSCH的数目；
以TDM的方式接收PDSCH的数目；
以FDM+TDM的方式接收PDSCH的数目。
其中，FDM是指在同一个频率带宽内，可以允许多个数据业务在不同频率上同时传输。TDM是指在一个时隙内，可以允许多个数据业务在不同时间上同时传输。FDM+TDM是指在一个时隙内，多个数据业务可以以FDM和TDM的方式传输。在本公开的实施例中，对UE以FDM或者TDM的方式接收N个PDSCH进行讨论，则在一个载波上，UE接收能力可以分为能力A(Capability A)和能力B(Capability B)：
Capability A:以TDM的方式，最多接收N个PDSCH。
Capability B:以FDM的方式，最多接收N个PDSCH。
具体地，本公开的实施例提供了一种接收PDSCH的方法，用以解决基站对PDSCH的调度超出终端接收能力时，终端无法确定接收的PDSCH的问题。
如图1所示，本公开的实施例提供了一种接收PDSCH的方法，具体包括以下步骤：
步骤101、终端根据基站调度的候选物理下行共享信道PDSCH的优先级，确定接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力。
该实施例中，基站有可能在一个时隙内对PDSCH的调度超过终端的接收能力，例如：终端的最大接收能力为N个PDSCH，基站调度的PDSCH数量大于N个。所述候选PDSCH即为基站在一个时隙内调度的PDSCH，可以为多个。终端由所述候选PDSCH中确定将要接收的PDSCH，即确定待接收PDSCH，具体地，终端可以根据各个候选PDSCH的优先级确定待接收PDSCH。其中，所述候选PDSCH的优先级可以为协议预配置。
终端确定的所述接收PDSCH集合中可以包括多个PDSCH，PDSCH的数量满足终端接收能力。所述满足终端接收能力是指：所述接收PDSCH集合中的PDSCH的数量小于或者等于终端最大接收能力。
步骤102、终端接收所述接收PDSCH集合中的待接收PDSCH上的数据。在终端确定所述接收PDSCH集合后，接收所述接收PDSCH集合中包括的PDSCH上的数据。
本公开的实施例，终端根据基站调度的候选PDSCH的优先级，确定接收PDSCH集合，所述接收PDSCH集合中包含的PDSCH的数量满足终端接收能力，使终端能够同时接收多个数据业务，并可以根据业务优先级选择最终接收的PDSCH的类型和数量，满足用户需求。
进一步地，所述终端根据基站调度的候选PDSCH的优先级，确定接收PDSCH集合，可以包括以下一项：
(1)：根据候选PDSCH集合中最高优先级的PDSCH，确定接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力。
该确定接收PDSCH集合的方式适用于所述Capability A，也适用于Capability B，即：在终端接收能力为：以TDM的方式，最多接收N个PDSCH的数据时，可以从最高优先级的PDSCH开始选择，直到选择的PDSCH的数量满足终端接收能力；在终端接收为：以FDM的方式，最多接收N个PDSCH 的数据时，可以从最高优先级的PDSCH开始选择，直到选择的PDSCH的数量满足终端接收能力。
需要说明的是，该实施例中终端在确定接收PDSCH集合中的待接收PDSCH时，每一次均选择当前的候选PDSCH集合中的最高优先级的PDSCH。例如：候选PDSCH集合中包括6个PDSCH，终端第一次选择6个PDSCH中优先级最高的一个PDSCH作为待接收PDSCH，则此时的所述候选PDSCH集合中还包括5个PDSCH，在第二次选择时，终端选择5个PDSCH中优先级最高的一个PDSCH作为待接收PDSCH，依此循环选择，直到待接收PDSCH的数量满足终端接收能力。
(2)：对候选PDSCH集合中最低优先级的PDSCH进行排除处理，将排除处理后的所述候选PDSCH集合确定为接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力。
该确定接收PDSCH集合的方式适用于所述Capability A，也适用于Capability B，即：在终端接收能力为：以TDM的方式，最多接收N个PDSCH的数据时，可以从最低优先级的PDSCH开始排除，直到排除PDSCH后的候选PDSCH集合中的PDSCH的数量满足终端接收能力；在终端接收为：以FDM的方式，最多接收N个PDSCH的数据时，可以从最低优先级的PDSCH开始排除，直到排除后的候选PDSCH集合中的PDSCH的数量满足终端接收能力。
需要说明的是，该实施例中终端在确定接收PDSCH集合中的待接收PDSCH时，每一次均选择当前的候选PDSCH集合中的最低优先级的PDSCH进行排除。例如：候选PDSCH集合中包括6个PDSCH，终端第一次选择6个PDSCH中优先级最低的一个PDSCH进行排除，则此时所述候选PDSCH集合中还包括5个PDSCH，在第二次选择时，终端选择5个PDSCH中优先级最低的一个PDSCH进行排除，依此循环选择，直到待接收PDSCH的数量满足终端接收能力。
该实施例中，终端以TDM的方式接收PDSCH上的数据，或者以FDM的方式接收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集合中的待接收PDSCH的总数量未达到终端最大接收能力的情况下，执行步骤二；
步骤二：由所述候选PDSCH集合中删除所述第一PDSCH，并删除所述候选PDSCH集合中的第二PDSCH，将删除所述第一PDSCH和所述第二PDSCH后的候选PDSCH集合作为第一候选集合，所述第二PDSCH为与所述接收PDSCH集合中所有PDSCH存在重叠的PDSCH；若所述第一候选集合不为空集，则将所述第一候选集合作为所述候选PDSCH集合，重复所述步骤一，若所述第一候选集合为空集，则将包括所述第一PDSCH的接收PDSCH集合确定为所述接收PDSCH集合。
该实施例中，UE从候选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的数量满足UE能力或者候选PDSCH集合空为止。UE选择所述接收PDSCH集合中的PDSCH上的数据进行接收。
需要说明的是，在该实施例中，在所述终端以TDM的方式接收数据时，所述步骤二中的第二PDSCH为与所述接收PDSCH集合中所有PDSCH在时域上重叠的PDSCH；在所述终端以FDM的方式接收数据时，所述步骤二中的第二PDSCH为与所述接收PDSCH集合中所有PDSCH在频域上重叠的PDSCH。
作为一个可选实施例，以终端接收能力为TDM或者FDM的方式，终端同时接收最多N个PDSCH为例说明该实施例的具体实现过程。该实施例中，终端从候选PDSCH集合中选择优先级较高的PDSCH进行接收，直到达到UE接收能力为止。该实施例中，PDSCH的类型可以不做区分，例如不区分PDSCH是单播PDSCH还是MBS PDSCH。且不同PDSCH的优先级已经得知，具体步骤如图2所示：
1)：确定参数集合及UE接收能力。
假设接收PDSCH集合为S_1,候选PDSCH集合为S_2，UE最大接收PDSCH个数为N。
2)：选出最高优先级PDSCH。
从S_2中选出优先级最高的PDSCH，记为S_2’，该PDSCH与S_1中已有的PDSCH在时域或者频域上不重叠；
将S_2’放入S_1中，则S_1＝S_1U S_2’；“U”表示S_1和S_2’的并集。
3)：判断是否满足UE最大接收能力。
If C(S_1)<N，从S_2中删除S_2’，S_2＝S_2\S_2’，“\”表示删除；并从S_2中删除与S_1中所有PDSCH时域或者频域上重叠的PDSCH，更新S_2；
If C(S_2)≠0，返回步骤2)；否则，执行步骤4)。
If C(S_1)＝N，执行步骤4)。
其中，C()表示集合的大小，即集合中包含多少个元素。空集合的大小为0。
4)：UE选择接收S_1集合中的PDSCH。
该实施例根据候选PDSCH集合中最高优先级的PDSCH，确定接收PDSCH集合，接收PDSCH集合中的待接收的PDSCH的数量满足终端接收能力，终端可以同时接收多个数据业务，并且可以根据业务优先级选择最终接收的PDSCH的个数及类型，能够满足5G网络下的用户需求。
以上为根据候选PDSCH集合中最高优先级的PDSCH，确定接收PDSCH集合的具体实现过程，下面说明根据候选PDSCH集合中最低优先级的PDSCH，确定接收PDSCH集合的实现过程。
具体地，对候选PDSCH集合中最低优先级的PDSCH进行排除处理，将排除处理后的所述候选PDSCH集合确定为接收PDSCH集合，可以包括：
步骤一：删除所述候选PDSCH集合中最低优先级的第二PDSCH，获得第二候选集合；在所述第二候选集合中的PDSCH的数量满足终端接收能力，且所述第二候选集合中不存在时域或者频域上重叠的PDSCH的情况下，将所述第二候选集合确定为所述接收PDSCH集合；在所述第二候选集合中的PDSCH的数量不满足终端接收能力，或者所述第二候选集合中存在重叠的PDSCH的情况下，执行步骤二；
步骤二：将所述第二候选集合作为所述候选PDSCH集合，重复所述步骤一。
该实施例中，UE排除所述候选PDSCH集合中的低优先级的PDSCH，然后判断更新后得到的第二候选集合中的PDSCH之间是否存在重叠现象，若所述第二候选集合中的PDSCH的数量满足终端接收能力，且所述第二候选集合中不存在时域或者频域上重叠的PDSCH的情况下，将所述第二候选集合确定为所述接收PDSCH集合。
若有任意两个PDSCH之间存在重叠，UE继续排除掉第二候选集合中的低优先级的PDSCH，循环执行上述操作，直到候选PDSCH集合剩余的PDSCH不存在相互重叠现象。UE选择候选PDSCH集合中的PDSCH上的数据进行 接收。
需要说明的是，在该实施例中，在所述终端以TDM的方式接收数据时，所述步骤一中的“重叠的PDSCH”是指：在时域上重叠的PDSCH；在所述终端以FDM的方式接收数据时，所述步骤一中的“重叠的PDSCH”是指：在频域上重叠的PDSCH。
作为一个可选实施例，以UE接收能力为TDM或者FDM的方式，UE同时最多接收N个PDSCH为例说明该实施例的具体实现过程。该实施例中，UE从候选PDSCH集合中依次对优先级低的PDSCH进行排除，直到达到UE接收能力；然后再判断排除PDSCH后的候选PDSCH集合中是否有重叠现象，如果有重叠现象，继续排除优先级低的PDSCH，直到剩余的候选PDSCH集合中无重叠现象。在此方案中，PDSCH的业务类型不做区分，且PDSCH的优先级已经得知，具体步骤如图3所示：
a)：确定参数集合及UE接收能力。
假设接收PDSCH集合为H_1，H_1包含所有PDSCH，UE最大接收PDSCH个数为N。
b)：选出最低优先级PDSCH。
从H_1中选出优先级最低的PDSCH记为H_1’；从H_1中删除H_1’，H_1＝H_1\H_1’，“\”表示删除；
c)：判断接收PDSCH集合是否有重叠现象及UE接收能力是否满足。
如果H_1中有重叠现象或者UE接收能力未满足(即H_1中PDSCH的个数大于N)，则返回执行步骤b)，继续去掉H_1中最低优先级的PDSCH。直到无重叠现象或者满足UE接收能力，执行步骤d)。
d)：UE选择接收H_1集合中的PDSCH。
该实施例对候选PDSCH集合中最低优先级的PDSCH进行排除，确定接收PDSCH集合，接收PDSCH集合中的待接收的PDSCH的数量满足终端接收能力，终端可以同时接收多个数据业务，并且可以根据业务优先级选择最终接收的PDSCH的个数及类型，能够满足5G网络下的用户需求。
需要说明的是，根据上述步骤1)～4)，以及步骤a)～d)，在终端接收能力确定后，终端可以选择以下述方案中的一种接收PDSCH：
方案1：接收集合S_1；
方案2：接收集合H_1；
方案3：根据判断标准选择接收S_1或H_1。
假设方案1得出的接收PDSCH集合S_1＝{PDSCHx，PDSCHy，PDSCHz}，方案2得出的接收集合H_1＝{PDSCHa，PDSCHb}。
判断标准可以如下：
标准1：选择接收PDSCH集合大的方案。方案1的接收PDSCH集合大小为3，方案2的接收PDSCH集合大小为2，则UE选择接收S_1。
标准2：选择优先级权重总和大的方案。假设集合为{PDSCHx，PDSCHy，PDSCHz}对应优先级权重为{6，3，1},权重和为10；{PDSCHa，PDSCHb}对应优先级权重为{6，5}，权重和为11，则UE选择接收H_1。
可选地，所述方法还包括：在两个PDSCH满足第一条件的情况下，确定所述两个PDSCH在时域上不重叠；其中，所述第一条件为：两个PDSCH中的一个PDSCH的起始时间晚于另一个PDSCH的结束时间。
该实施例为判断两个PDSCH在时域上不重叠的方法，任意一个PDSCH的起始时间晚于另外一个PDSCH的结束时间，则这两个PDSCH在时域上不重叠。
作为一个可选实施例，可以利用时域资源分配域(Time Domain Resource Assignment table，TDRA table)的相关信息去判断两个PDSCH之间在一个时隙中是否有重叠现象。根据下行控制信息(Downlink Control Information，DCI)中TDRA域可知，PDSCH的起始符号时隙位置索引数S，PDSCH分配连续符号的长度L。根据这两个参数可以计算出PDSCH的结束符号时隙位置索引数m(m＝S+L-1)。
其中，任意一个PDSCH的起始符号索引数大于另外一个PDSCH的结束符号索引数则为时域不重叠。
以PDSCH为6个为例，6个PDSCH之间的关系如图4所示，其中假设优先级从大到小为：P1-PDSCH>P2-PDSCH>P3-PDSCH>P4-PDSCH>P5-PDSCH>P6-PDSCH。则图4中各个PDSCH对应的TDRA table如表1所示。表1中，“S”表示PDSCH的起始符号时隙位置索引数，“L”表示PDSCH 分配连续符号的长度，“m”表示根据“S”和“L”计算出的PDSCH的结束符号时隙位置索引数。
表1：
S L m  
1 3 3 P6-PDSCH
2 8 9 P4-PDSCH
3 4 6 P3-PDSCH
6 2 7 P1-PDSCH
9 5 13 P2-PDSCH
10 3 12 P5-PDSCH
例如：判断P1-PDSCH与P2-PDSCH在时域上是否重叠：
P1-PDSCH的起始符号索引数为6，其结束符号索引数为7。P2-PDSCH的起始符号索引数为9，其结束符号索引数为13。则P2-PDSCH的起始符号索引数大于P1-PDSCH的结束符号(9>7)，满足不重叠条件，则P1-PDSCH与P2-PDSCH在时域上不重叠。
判断P1-PDSCH与P3-PDSCH在时域上是否重叠：
P1-PDSCH的起始符号索引数为6，其结束符号索引数为7。P3-PDSCH的起始符号索引数为3，其结束符号索引数为6。则P1-PDSCH的起始符号数小于P3-PDSCH的结束符号(6＝6)，P3-PDSCH的起始符号索引数小于P1-PDSCH的结束符号(3<7)，不满足条件，则P1-PDSCH与P3-PDSCH在时域上重叠。同理可以判断其他任意两个PDSCH在时域上是否重叠，在此不再赘述。
可选地，所述方法还包括：在两个PDSCH满足第二条件的情况下，确定所述两个PDSCH在频域上不重叠；其中，所述第二条件为：两个PDSCH中的一个PDSCH的起始资源块RB索引数大于另一个PDSCH的结束RB索引数。
该实施例为判断两个PDSCH在频域上不重叠的方法，任意一个PDSCH的起始RB索引数大于另外一个PDSCH的结束RB索引数，则这两个PDSCH在频域上不重叠。
在判断频域不重叠时，需要用DCI中频域资源分配域(Frequency domain resource assignment field)中的参数：起始RB索引数(RB start)和配置的连续RB个数(L RBs)。任意一个PDSCH的起始符号索引数大于另外一个PDSCH的结束符号索引数及为两个PDSCH在频域上不重叠。具体方法与判断两个PDSCH时域上不重叠的方法类似，此处不做赘述。
需要说明的是，所述候选PDSCH可以为基站在接收时隙的目标时间门限之前调度的PDSCH。可选地，所述方法还包括：在所述待接收PDSCH的数量未满足终端最大接收能力的情况下，根据基站在所述目标时间门限之后调度的PDSCH的时间顺序，接收在时域或者频域上不重叠的PDSCH上的数据。
该实施例中，由于存在动态PDSCH的调度，导致部分PDSCH调度的时间较晚，UE在处理起始位置到达较早的PDSCH时，无法确定后续是否还有其它调度的PDSCH需要一起处理。所以可以在接收时隙前设置目标时间门限，优先处理所述目标时间门限之前调度的PDSCH。所述目标时间门限可以设置为本时隙(n)的前X个符号(symbol)处，如图5所示。
具体步骤可以如下：
一：对于目标时间门限之前调度的PDSCH：
在目标时间门限前调度的PDSCH可以用本公开实施例中提出的方案进行选择。即目标时间门限后调度的PDSCH具有较低的优先级，不参与PDSCH的首次选择。
二：对于目标时间门限之后调度的PDSCH：
如果在运行完步骤一中对于目标时间门限之前调度的PDSCH的选择之后，UE接收能力没有满足，则在目标时间门限到达之后调度的PDSCH，按照到达时间先后顺序进行无重叠选择接收。如果UE接收能力满足，则不再接收目标时间门限达到之后调度的PDSCH。
该实施例中，在接收时隙前设置目标时间门限，对于目标时间门限之前调度的PDSCH作为所述候选PDSCH，终端根据所述候选PDSCH的优先级，确定接收PDSCH集合；对于在目标时间门限之后调度的PDSCH，终端根据PDSCH的时间顺序进行选择接收。UE可以同时接收多个数据业务，并且可 以根据业务优先级选择最终接收的PDSCH个数及类型。能够满足5G网络下用户需求。
下面通过具体示例分别说明终端以TDM的方式接收PDSCH时的实现过程，以及以FDM的方式接收PDSCH时的实现过程。以PDSCH为6个为例，6个PDSCH之间的关系如图4所示，其中假设优先级从大到小为：P1-PDSCH>P2-PDSCH>P3-PDSCH>P4-PDSCH>P5-PDSCH>P6-PDSCH。
示例一：终端以TDM方式同时接收最多3个PDSCH，且终端根据候选PDSCH集合中最高优先级的PDSCH，确定接收PDSCH集合，具体包括以下步骤：
步骤1(Step1)：确定参数集合及UE接收能力。
设S_1为空；
设S_2＝{P1-PDSCH，P2-PDSCH，P3-PDSCH，P4-PDSCH，P5-PDSCH，P6-PDSCH}；
UE以TDM方式接收最多3个PDSCH。
步骤2(Step2)：选出最高优先级PDSCH。
S_2’＝{P1-PDSCH}；
将P1-PDSCH放入S_1中，S_1＝S_1U S_2’＝{P1-PDSCH}；将P1-PDSCH从S_2中排除，S_2＝S_2\S_2’＝{P2-PDSCH，P3-PDSCH，P4-PDSCH，P5-PDSCH，P6-PDSCH}。
步骤3(Step3)：判断是否满足UE接收能力。
C(S_1)＝1<3，且C(S_2)＝5，从S_2中删除与S_1中所有PDSCH在时域上重叠的PDSCH，更新S_2，S_2＝{P2-PDSCH,P5-PDSCH,P6-PDSCH}；返回Step2：S_2’＝{P2-PDSCH}；
S_1＝{P1-PDSCH,P2-PDSCH},S_2＝{P5-PDSCH,P6-PDSCH}。
C(S_1)＝2<3，且C(S_2)＝2，从S_2中删除与S_1中所有PDSCH在时域上重叠的PDSCH，更新S_2,S_2＝{P6-PDSCH}；返回Step2:S_2’＝{P6-PDSCH}；
S_1＝{P1-PDSCH，P2-PDSCH，P6-PDSCH}，
Figure PCTCN2021134369-appb-000001
C(S_1)＝3＝3，执行步骤4(Step4)。
Step4：UE选择接收S_1集合中的PDSCH。
UE接收S_1＝{P1-PDSCH，P2-PDSCH，P6-PDSCH}。
示例二：终端以FDM方式同时接收最多3个PDSCH，且终端根据候选PDSCH集合中最高优先级的PDSCH，确定接收PDSCH集合，具体包括以下步骤：
Step1:确定参数集合及UE接收能力。
设S_1为空；
设S_2＝{P1-PDSCH，P2-PDSCH，P3-PDSCH,P4-PDSCH，P5-PDSCH，P6-PDSCH}；
UE以FDM方式接收最多3个PDSCH。
Step2：选出最高优先级PDSCH。
S_2’＝{P1-PDSCH}；
将P1-PDSCH放入S_1中，S_1＝S_1U S_2’＝{P1-PDSCH}；将P1-PDSCH从S_2中删除，S_2＝S_2\S_2’＝{P2-PDSCH，P3-PDSCH，P4-PDSCH，P5-PDSCH，P6-PDSCH}。
Step3：判断是否满足UE接收能力。
C(S_1)＝1<3，且C(S_2)＝5，从S_2中删除与S_1中所有PDSCH(即P1-PDSCH)在频域上重叠的PDSCH，更新S_2，S_2＝{P2-PDSCH，P3-PDSCH，P4-PDSCH}；返回Step2:S_2’＝{P2-PDSCH}，S_1＝{P1-PDSCH,P2-PDSCH}，S_2＝{P3-PDSCH,P4-PDSCH}。
C(S_1)＝2<3，且C(S_2)＝2，从S_2中删除与S_1中所有PDSCH(即P1-PDSCH和P2-PDSCH)在频域上重叠的PDSCH，更新S_2，S_2＝{P4-PDSCH}。
返回Step2：S_2’＝{P4-PDSCH}，S_1＝{P1-PDSCH，P2-PDSCH，P4-PDSCH}，
Figure PCTCN2021134369-appb-000002
C(S_1)＝3＝3，执行Step4。
Step4：UE选择接收S_1集合中的PDSCH。
UE接收S_1＝{P1-PDSCH，P2-PDSCH，P4-PDSCH}。
示例三：终端以TDM方式同时接收最多3个PDSCH，且终端对候选PDSCH集合中最低优先级的PDSCH进行排除处理，将排除处理后的所述候 选PDSCH集合确定为接收PDSCH集合，具体包括以下步骤：
Step1：确定参数集合及UE接收能力。
H_1＝{P1-PDSCH，P2-PDSCH，P3-PDSCH，P4-PDSCH，P5-PDSCH，P6-PDSCH}；
UE以TDM方式接收最多3个PDSCH。
Step2：选出最低优先级PDSCH。
H_1’＝{P6-PDSCH}；
将P6-PDSCH从H_1中删除，H_1＝H_1\H_1’＝{P1-PDSCH，P2-PDSCH，P3-PDSCH，P4-PDSCH，P5-PDSCH}；
Step3：判断H_1是否有重叠现象及UE接收能力是否满足。
P2-PDSCH与P5-PDSCH在时域上重叠，则执行Step2：H_1’＝{P5-PDSCH}，将P5-PDSCH从H_1中删除；
H_1＝H_1\H_1’＝{P1-PDSCH，P2-PDSC，P3-PDSCH，P4-PDSCH}；
继续判断H_1是否有重叠现象，若存在重叠现象，继续排除低优先级PDSCH：H_1’＝P4-PDSCH，将P4-PDSCH从H_1中删除，H_1＝H_1\H_1’＝{P1-PDSCH，P2-PDSH，P3-PDSCH}。
P2-PDSCH和P3-PDSCH依然有重叠现象，继续排除H_1’＝P3-PDSCH，H_1＝H_1\H_1’＝{P1-PDSCH,P2-PDSCH}，直到无重叠现象,且此时C(H 1)＝2<3，执行Step4。
Step4：UE选择接收H_1集合中的PDSCH，H_1＝{P1-PDSCH，P2-PDSCH}。
示例四：终端以FDM方式同时接收最多3个PDSCH，且终端对候选PDSCH集合中最低优先级的PDSCH进行排除处理，将排除处理后的所述候选PDSCH集合确定为接收PDSCH集合，具体包括以下步骤：
Step1：确定参数集合及UE接收能力。
H_1＝{P1-PDSCH,P2-PDSCH，P3-PDSCH，P4-PDSCH，P5-PDSCH，P6-PDSCH}；
UE以FDM方式接收最多3个PDSCH。
Step2：选出最低优先级PDSCH。
H_1’＝P6-PDSCH；
将P6-PDSCH从H_1中删除H_1＝H_1\H_1’＝{P1-PDSCH，P2-PDSCH，P3-PDSCH，P4-PDSCH，P5-PDSCH}。
Step3：判断H_1是否有重叠现象及UE接收能力是否满足。
P2-PDSCH与P3-PDSCH在时域上重叠。则H_1’＝{P5-PDSCH}，H_1＝H_1\H_1’＝{P1-PDSCH，P2-PDSCH，P3-PDSCH，P4-PDSCH}；继续判断H_1是否有重叠现象，若是，继续排除低优先级的PDSCH：H_1’＝P4-PDSCH，H_1＝H_1\H_1’＝{P1-PDSCH，P2-PDSH，P3-PDSCH}。
P2-PDSCH和P3-PDSCH依然有重叠现象，继续排除H_1’＝P3-PDSCH，H_1＝H_1\H_1’＝{P1-PDSCH，P2-PDSCH}，此时无重叠现象且此时C(H 1)＝2<3，执行Step4。
Step4：UE选择接收H_1集合中的PDSCH，H_1＝{P1-PDSCH，P2-PDSCH}。
根据上述示例一、示例二、示例三、示例四，得出的接收PDSCH集合如表2所示。其中，方案1是指：根据候选PDSCH集合中最高优先级的PDSCH，确定接收PDSCH集合；方案2是指：对候选PDSCH集合中最低优先级的PDSCH进行排除处理，将排除处理后的所述候选PDSCH集合确定为接收PDSCH集合。
表2：
Figure PCTCN2021134369-appb-000003
根据表2中的方案1和方案2的结果，当UE以TDM或者FDM方式接收多个PDSCH时，若终端根据标准1，选择接收PDSCH集合大的方案，则UE选择接收S_1；若终端根据标准2，选择优先级权重总和大的方案，则UE选择接收S_1。
本公开的实施例，终端根据基站调度的候选PDSCH的优先级，确定接收PDSCH集合，所述接收PDSCH集合中包含的PDSCH的数量满足终端接收能力，使终端能够同时接收多个数据业务，并可以根据业务优先级选择最 终接收的PDSCH的类型和数量，满足用户需求。
本公开实施例提供的技术方案可以适用于多种系统，尤其是5G系统。例如适用的系统可以是全球移动通讯(global system of mobile communication，GSM)系统、码分多址(code division multiple access，CDMA)系统、宽带码分多址(Wideband Code Division Multiple Access，WCDMA)通用分组无线业务(general packet radio service，GPRS)系统、长期演进(long term evolution，LTE)系统、长期演进(Long Term Evolution，LTE)频分双工(frequency division duplex，FDD)系统、LTE时分双工(time division duplex，TDD)系统、高级长期演进(long term evolution advanced，LTE-A)系统、通用移动系统(universal mobile telecommunication system，UMTS)、全球互联微波接入(worldwide interoperability for microwave access，WiMAX)系统、5G新空口(New Radio,NR)系统等。这多种系统中均包括终端设备和网络设备。系统中还可以包括核心网部分，例如演进的分组系统(Evloved Packet System,EPS)、5G系统(5GS)等。
以上实施例就本公开的接收PDSCH的方法做出介绍，下面本实施例将结合附图对其对应的装置做进一步说明。
具体地，如图6所示，本公开的实施例的提供了一种接收PDSCH的装置600，包括：
第一确定单元610，用于根据基站调度的候选物理下行共享信道PDSCH的优先级，确定接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力；
第一接收单元620，用于接收所述接收PDSCH集合中的待接收PDSCH上的数据。
可选地，所述第一确定单元610具体包括以下一项：
第一确定子单元，用于根据候选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后的候选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的起始资源块RB索引数大于另一个PDSCH的结束RB索引数。
可选地，所述候选PDSCH为基站在接收时隙的目标时间门限之前调度的PDSCH。
可选地，所述装置还包括：
第二接收单元，用于在所述待接收PDSCH的数量未满足终端最大接收能力的情况下，根据基站在所述目标时间门限之后调度的PDSCH的时间顺序，接收在时域或者频域上不重叠的PDSCH上的数据。
需要说明的是，该装置的实施例是与上述接收PDSCH的方法的实施例对应，上述方法实施例中所有实现方式均适用于该装置的实施例中，也能达到相同的技术效果。由于方法实施例和该装置的实施例是基于同一构思的，解决问题的原理相似，因此可以相互参见，重复之处不再赘述。
需要说明的是，本公开实施例中对单元的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。另外，在本公开各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个处理器可读取存储介质中。基于这样的理解，本公开的技术方案本质上或者说对相关技术中的做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)或处理器(processor)执行本公开各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
如图7所示，本公开的实施例还提供了一种接收PDSCH的装置，包括：存储器720、收发机700、处理器710；其中，存储器720，用于存储计算机程序；收发机700，用于在所述处理器710的控制下收发数据；
所述处理器710用于读取所述存储器720中的计算机程序并执行以下操作：
根据基站调度的候选物理下行共享信道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的总数量达到终端最大接收能力的情况下，将包括所述第一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的情况下，将所述第二候选集合确定为所述接收PDSCH集合；在所述第二候选集合中的PDSCH的数量不满足终端接收能力，或者所述第二候选集合中存在重叠的PDSCH的情况下，执行步骤二；
步骤二：将所述第二候选集合作为所述候选PDSCH集合，重复所述步骤一。
可选地，所述处理器执行所述计算机程序时还用于实现以下步骤：
在两个PDSCH满足第一条件的情况下，确定所述两个PDSCH在时域上不重叠；
其中，所述第一条件为：两个PDSCH中的一个PDSCH的起始时间晚于另一个PDSCH的结束时间。
可选地，所述处理器执行所述计算机程序时还用于实现以下步骤：
在两个PDSCH满足第二条件的情况下，确定所述两个PDSCH在频域上不重叠；
其中，所述第二条件为：两个PDSCH中的一个PDSCH的起始资源块RB索引数大于另一个PDSCH的结束RB索引数。
可选地，所述候选PDSCH为基站在接收时隙的目标时间门限之前调度的PDSCH。
可选地，所述处理器执行所述计算机程序时还用于实现以下步骤：
在所述待接收PDSCH的数量未满足终端最大接收能力的情况下，根据基站在所述目标时间门限之后调度的PDSCH的时间顺序，接收在时域或者频域上不重叠的PDSCH上的数据。
其中，在图7中，总线架构可以包括任意数量的互联的总线和桥，具体 由处理器710代表的一个或多个处理器和存储器720代表的存储器的各种电路链接在一起。总线架构还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起，这些都是本领域所公知的，因此，本文不再对其进行进一步描述。总线接口提供接口。收发机700可以是多个元件，即包括发送机和接收机，提供用于在传输介质上与各种其他装置通信的单元，这些传输介质包括，这些传输介质包括无线信道、有线信道、光缆等传输介质。针对不同的用户设备，用户接口730还可以是能够外接内接需要设备的接口，连接的设备包括但不限于小键盘、显示器、扬声器、麦克风、操纵杆等。
处理器710负责管理总线架构和通常的处理，存储器720可以存储处理器710在执行操作时所使用的数据。
可选的，处理器710可以是中央处理器(Central Processing Unit，CPU)、专用集成电路(Application Specific Integrated Circuit，ASIC)、现场可编程门阵列(Field－Programmable Gate Array，FPGA)或复杂可编程逻辑器件(Complex Programmable Logic Device，CPLD)，处理器也可以采用多核架构。
处理器通过调用存储器存储的计算机程序，用于按照获得的可执行指令执行本公开实施例提供的任一所述方法。处理器与存储器也可以物理上分开布置。
在此需要说明的是，本公开实施例提供的上述装置，能够实现上述接收PDSCH的方法实施例所实现的所有方法步骤，且能够达到相同的技术效果，在此不再对本实施例中与方法实施例相同的部分及有益效果进行具体赘述。
另外，本公开具体实施例还提供一种处理器可读存储介质，其上存储有计算机程序，其中，该程序被处理器执行时实现如上述接收PDSCH的方法的步骤。且能达到相同的技术效果，为避免重复，这里不再赘述。其中，所述可读存储介质可以是处理器能够存取的任何可用介质或数据存储设备，包括但不限于磁性存储器(例如软盘、硬盘、磁带、磁光盘(MO)等)、光学存储器(例如CD、DVD、BD、HVD等)、以及半导体存储器(例如ROM、EPROM、EEPROM、非易失性存储器(NAND FLASH)、固态硬盘(SSD))等。
本领域内的技术人员应明白，本公开的实施例可提供为方法、系统、或计算机程序产品。因此，本公开可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本公开可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器和光学存储器等)上实施的计算机程序产品的形式。
本公开是参照根据本公开实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机可执行指令实现流程图和/或方框图中的每一个流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机可执行指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图中的一个流程或多个流程和/或方框图中的一个方框或多个方框中指定的功能的装置。
这些处理器可执行指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的处理器可读存储器中，使得存储在该处理器可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图的一个流程或多个流程和/或方框图的一个方框或多个方框中指定的功能。
这些处理器可执行指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图的一个流程或多个流程和/或方框图的一个方框或多个方框中指定的功能的步骤。
需要说明的是，应理解以上各个模块的划分仅仅是一种逻辑功能的划分，实际实现时可以全部或部分集成到一个物理实体上，也可以物理上分开。且这些模块可以全部以软件通过处理元件调用的形式实现；也可以全部以硬件的形式实现；还可以部分模块通过处理元件调用软件的形式实现，部分模块通过硬件的形式实现。例如，确定模块可以为单独设立的处理元件，也可以集成在上述装置的某一个芯片中实现，此外，也可以以程序代码的形式存储于上述装置的存储器中，由上述装置的某一个处理元件调用并执行以上确定 模块的功能。其它模块的实现与之类似。此外这些模块全部或部分可以集成在一起，也可以独立实现。这里所述的处理元件可以是一种集成电路，具有信号的处理能力。在实现过程中，上述方法的各步骤或以上各个模块可以通过处理器元件中的硬件的集成逻辑电路或者软件形式的指令完成。
例如，各个模块、单元、子单元或子模块可以是被配置成实施以上方法的一个或多个集成电路，例如：一个或多个特定集成电路(Application Specific Integrated Circuit，ASIC)，或，一个或多个微处理器(digital signal processor，DSP)，或，一个或者多个现场可编程门阵列(Field Programmable Gate Array，FPGA)等。再如，当以上某个模块通过处理元件调度程序代码的形式实现时，该处理元件可以是通用处理器，例如中央处理器(Central Processing Unit，CPU)或其它可以调用程序代码的处理器。再如，这些模块可以集成在一起，以片上系统(system-on-a-chip，SOC)的形式实现。
本公开的说明书和权利要求书中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。应该理解这样使用的数据在适当情况下可以互换，以便这里描述的本公开的实施例，例如除了在这里图示或描述的那些以外的顺序实施。此外，术语“包括”和“具有”以及他们的任何变形，意图在于覆盖不排他的包含，例如，包含了一系列步骤或单元的过程、方法、系统、产品或设备不必限于清楚地列出的那些步骤或单元，而是可包括没有清楚地列出的或对于这些过程、方法、产品或设备固有的其它步骤或单元。此外，说明书以及权利要求中使用“和/或”表示所连接对象的至少其中之一，例如A和/或B和/或C，表示包含单独A，单独B，单独C，以及A和B都存在，B和C都存在，A和C都存在，以及A、B和C都存在的7种情况。类似地，本说明书以及权利要求中使用“A和B中的至少一个”应理解为“单独A，单独B，或A和B都存在”。上面结合附图对本公开的实施例进行了描述，但是本公开并不局限于上述的具体实施方式，上述的具体实施方式仅仅是示意性的，而不是限制性的，本领域的普通技术人员在本公开的启示下，在不脱离本公开宗旨和权利要求所保护的范围情况下，还可做出很多形式，均属于本公开的保护之内。

Claims (25)

  1. 一种接收PDSCH的方法，包括：
    终端根据基站调度的候选物理下行共享信道PDSCH的优先级，确定接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力；
    终端接收所述接收PDSCH集合中的待接收PDSCH上的数据。
  2. 根据权利要求1所述的方法，其中，所述终端根据基站调度的候选PDSCH的优先级，确定接收PDSCH集合，包括以下一项：
    根据候选PDSCH集合中最高优先级的PDSCH，确定接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力；
    对候选PDSCH集合中最低优先级的PDSCH进行排除处理，将排除处理后的所述候选PDSCH集合确定为接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力。
  3. 根据权利要求2所述的方法，其中，根据候选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集合确定为所述接收PDSCH集合。
  4. 根据权利要求2所述的方法，其中，对候选PDSCH集合中最低优先级的PDSCH进行排除处理，将排除处理后的所述候选PDSCH集合确定为接收PDSCH集合，包括：
    步骤一：删除所述候选PDSCH集合中最低优先级的第二PDSCH，获得第二候选集合；在所述第二候选集合中的PDSCH的数量满足终端接收能力，且所述第二候选集合中不存在重叠的PDSCH的情况下，将所述第二候选集合确定为所述接收PDSCH集合；在所述第二候选集合中的PDSCH的数量不满足终端接收能力，或者所述第二候选集合中存在重叠的PDSCH的情况下，执行步骤二；
    步骤二：将所述第二候选集合作为所述候选PDSCH集合，重复所述步骤一。
  5. 根据权利要求3或4所述的方法，所述方法还包括：
    在两个PDSCH满足第一条件的情况下，确定所述两个PDSCH在时域上不重叠；
    其中，所述第一条件为：两个PDSCH中的一个PDSCH的起始时间晚于另一个PDSCH的结束时间。
  6. 根据权利要求3或4所述的方法，所述方法还包括：
    在两个PDSCH满足第二条件的情况下，确定所述两个PDSCH在频域上不重叠；
    其中，所述第二条件为：两个PDSCH中的一个PDSCH的起始资源块RB索引数大于另一个PDSCH的结束RB索引数。
  7. 根据权利要求1所述的方法，其中，候选PDSCH为基站在接收时隙的目标时间门限之前调度的PDSCH。
  8. 根据权利要求7所述的方法，所述方法还包括：
    在所述待接收PDSCH的数量未满足终端最大接收能力的情况下，根据基站在所述目标时间门限之后调度的PDSCH的时间顺序，接收在时域或者频域上不重叠的PDSCH上的数据。
  9. 一种接收PDSCH的装置，包括：收发机、存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述计 算机程序时实现以下步骤：
    根据基站调度的候选物理下行共享信道PDSCH的优先级，确定接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力；
    接收所述接收PDSCH集合中的待接收PDSCH上的数据。
  10. 根据权利要求9所述的装置，其中，所述终端根据基站调度的候选PDSCH的优先级，确定接收PDSCH集合，具体包括以下一项：
    根据候选PDSCH集合中最高优先级的PDSCH，确定接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力；
    对候选PDSCH集合中最低优先级的PDSCH进行排除处理，将排除处理后的所述候选PDSCH集合确定为接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力。
  11. 根据权利要求10所述的装置，其中，根据候选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集合确定为所述接收PDSCH集合。
  12. 根据权利要求10所述的装置，其中，对候选PDSCH集合中最低优先级的PDSCH进行排除处理，将排除处理后的所述候选PDSCH集合确定为 接收PDSCH集合，具体包括：
    步骤一：删除所述候选PDSCH集合中最低优先级的第二PDSCH，获得第二候选集合；在所述第二候选集合中的PDSCH的数量满足终端接收能力，且所述第二候选集合中不存在重叠的PDSCH的情况下，将所述第二候选集合确定为所述接收PDSCH集合；在所述第二候选集合中的PDSCH的数量不满足终端接收能力，或者所述第二候选集合中存在重叠的PDSCH的情况下，执行步骤二；
    步骤二：将所述第二候选集合作为所述候选PDSCH集合，重复所述步骤一。
  13. 根据权利要求11或12所述的装置，其中，所述处理器执行所述计算机程序时还用于实现以下步骤：
    在两个PDSCH满足第一条件的情况下，确定所述两个PDSCH在时域上不重叠；
    其中，所述第一条件为：两个PDSCH中的一个PDSCH的起始时间晚于另一个PDSCH的结束时间。
  14. 根据权利要求11或12所述的装置，其中，所述处理器执行所述计算机程序时还用于实现以下步骤：
    在两个PDSCH满足第二条件的情况下，确定所述两个PDSCH在频域上不重叠；
    其中，所述第二条件为：两个PDSCH中的一个PDSCH的起始资源块RB索引数大于另一个PDSCH的结束RB索引数。
  15. 根据权利要求9所述的装置，其中，候选PDSCH为基站在接收时隙的目标时间门限之前调度的PDSCH。
  16. 根据权利要求15所述的装置，其中，所述处理器执行所述计算机程序时还用于实现以下步骤：
    在所述待接收PDSCH的数量未满足终端最大接收能力的情况下，根据基站在所述目标时间门限之后调度的PDSCH的时间顺序，接收在时域或者频域上不重叠的PDSCH上的数据。
  17. 一种接收PDSCH的装置，包括：
    第一确定单元，用于根据基站调度的候选物理下行共享信道PDSCH的优先级，确定接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力；
    第一接收单元，用于接收所述接收PDSCH集合中的待接收PDSCH上的数据。
  18. 根据权利要求17所述的装置，其中，所述第一确定单元具体包括以下一项：
    第一确定子单元，用于根据候选PDSCH集合中最高优先级的PDSCH，确定接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力；
    第二确定子单元，用于对候选PDSCH集合中最低优先级的PDSCH进行排除处理，将排除处理后的所述候选PDSCH集合确定为接收PDSCH集合，所述接收PDSCH集合中的待接收PDSCH的数量满足终端接收能力。
  19. 根据权利要求18所述的装置，其中，所述第一确定子单元具体用于实现：
    步骤一：将所述候选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集合。
  20. 根据权利要求18所述的装置，其中，所述第二确定子单元具体用于 实现：
    步骤一：删除所述候选PDSCH集合中最低优先级的第二PDSCH，获得第二候选集合；在所述第二候选集合中的PDSCH的数量满足终端接收能力，且所述第二候选集合中不存在时域或者频域上重叠的PDSCH的情况下，将所述第二候选集合确定为所述接收PDSCH集合；在所述第二候选集合中的PDSCH的数量不满足终端接收能力，或者所述第二候选集合中存在重叠的PDSCH的情况下，执行步骤二；
    步骤二：将所述第二候选集合作为所述候选PDSCH集合，重复所述步骤一。
  21. 根据权利要求19或20所述的装置，还包括：
    第二确定单元，用于在两个PDSCH满足第一条件的情况下，确定所述两个PDSCH在时域上不重叠；
    其中，所述第一条件为：两个PDSCH中的一个PDSCH的起始时间晚于另一个PDSCH的结束时间。
  22. 根据权利要求19或20所述的装置，还包括：
    第三确定单元，用于在两个PDSCH满足第二条件的情况下，确定所述两个PDSCH在频域上不重叠；
    其中，所述第二条件为：两个PDSCH中的一个PDSCH的起始资源块RB索引数大于另一个PDSCH的结束RB索引数。
  23. 根据权利要求17所述的装置，其中，所述候选PDSCH为基站在接收时隙的目标时间门限之前调度的PDSCH。
  24. 根据权利要求23所述的装置，还包括：
    第二接收单元，用于在所述待接收PDSCH的数量未满足终端最大接收能力的情况下，根据基站在所述目标时间门限之后调度的PDSCH的时间顺序，接收在时域或者频域上不重叠的PDSCH上的数据。
  25. 一种处理器可读存储介质，其上存储有计算机程序，其中，该计算机程序被处理器执行时实现如权利要求1至8中任一项所述接收PDSCH的方法的步骤。
PCT/CN2021/134369 2021-01-08 2021-11-30 接收pdsch的方法、装置及处理器可读存储介质 WO2022148184A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP21917225.1A EP4277405A4 (en) 2021-01-08 2021-11-30 METHOD AND APPARATUS FOR RECEIVING PDSCH AND PROCESSOR-READABLE STORAGE MEDIUM
US18/260,577 US20240306184A1 (en) 2021-01-08 2021-11-30 Method for receiving pdsch, apparatus for receiving pdsch and processor-readable storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110023269.1A CN114760705A (zh) 2021-01-08 2021-01-08 接收pdsch的方法、装置及处理器可读存储介质
CN202110023269.1 2021-01-08

Publications (1)

Publication Number Publication Date
WO2022148184A1 true WO2022148184A1 (zh) 2022-07-14

Family

ID=82324537

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/134369 WO2022148184A1 (zh) 2021-01-08 2021-11-30 接收pdsch的方法、装置及处理器可读存储介质

Country Status (4)

Country Link
US (1) US20240306184A1 (zh)
EP (1) EP4277405A4 (zh)
CN (1) CN114760705A (zh)
WO (1) WO2022148184A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115915428A (zh) * 2021-09-30 2023-04-04 大唐移动通信设备有限公司 Sps pdsch的确定方法、终端、电子设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101350940A (zh) * 2007-07-17 2009-01-21 大唐移动通信设备有限公司 高速下行共享信道的共享控制信道资源分配方法及设备
US20170019913A1 (en) * 2014-03-18 2017-01-19 Lg Electronics Inc. Method for receiving data and apparatus using same
CN110324127A (zh) * 2018-03-30 2019-10-11 维沃移动通信有限公司 Pdcch监听候选的分配方法和网络侧设备
WO2020069165A1 (en) * 2018-09-26 2020-04-02 Idac Holdings, Inc. Downlink data reception with rrc configured scheduling and pdsch blind decoding
CN111867015A (zh) * 2019-04-30 2020-10-30 华为技术有限公司 检测或发送下行控制信道的方法和装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20200083217A (ko) * 2018-12-28 2020-07-08 삼성전자주식회사 무선 통신 시스템에서 비승인 데이터 전송 방법 및 장치
WO2020255415A1 (ja) * 2019-06-21 2020-12-24 株式会社Ｎｔｔドコモ 端末及び無線通信方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101350940A (zh) * 2007-07-17 2009-01-21 大唐移动通信设备有限公司 高速下行共享信道的共享控制信道资源分配方法及设备
US20170019913A1 (en) * 2014-03-18 2017-01-19 Lg Electronics Inc. Method for receiving data and apparatus using same
CN110324127A (zh) * 2018-03-30 2019-10-11 维沃移动通信有限公司 Pdcch监听候选的分配方法和网络侧设备
WO2020069165A1 (en) * 2018-09-26 2020-04-02 Idac Holdings, Inc. Downlink data reception with rrc configured scheduling and pdsch blind decoding
CN111867015A (zh) * 2019-04-30 2020-10-30 华为技术有限公司 检测或发送下行控制信道的方法和装置

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
See also references of EP4277405A4 *
VIVO: "Other issues for URLLC", 3GPP DRAFT; R1-1910227 - OTHER ISSUES FOR URLLC, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Chongqing, China; 20191014 - 20191020, 4 October 2019 (2019-10-04), Mobile Competence Centre ; 650, route des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France , XP051789032 *

Also Published As

Publication number Publication date
CN114760705A (zh) 2022-07-15
US20240306184A1 (en) 2024-09-12
EP4277405A1 (en) 2023-11-15
EP4277405A4 (en) 2024-05-22

Similar Documents

Publication Publication Date Title
JP6928109B2 (ja) フレキシブルスロットフォーマットインジケータを利用するための装置、システム、及び方法
WO2021223703A1 (zh) 频域资源分配方法及设备
WO2018171651A1 (zh) 资源调度的方法和装置
JP6980170B2 (ja) ダウンリンクリソースの集合を決定するための方法とデバイス、およびリソース位置情報を送信するための方法とデバイス
WO2018027918A1 (zh) 上行信道发送方法和装置
WO2021155790A1 (zh) 搜索空间的监听方法和设备
AU2015409983A1 (en) Data transmission method and apparatus
CN112242884A (zh) 信息传输方法及装置
WO2022068683A1 (zh) Bwp的配置方法、装置、网络侧设备及终端
WO2021016968A1 (zh) 上行信道传输方式的确定方法、装置、设备及介质
CN113286372A (zh) 一种传输下行控制信息的方法和通信设备
WO2022148184A1 (zh) 接收pdsch的方法、装置及处理器可读存储介质
WO2017070948A1 (zh) 一种载波聚合方法及装置
WO2021026701A1 (zh) 一种数据传输方法、网络设备、用户设备
WO2022218157A1 (zh) 信道处理方法、装置及存储介质
WO2022206356A1 (zh) 复用传输方法、装置及存储介质
TW201632013A (zh) 方法、裝置及系統
WO2022156567A1 (zh) 信息传输方法、装置、终端设备、网络设备及存储介质
US20240073875A1 (en) Terminal device and method therein for resource reservation
CN112996114B (zh) 资源调度方法、装置、设备及存储介质
WO2018148947A1 (zh) 一种资源分配方法、装置
WO2021023294A1 (zh) 信息传输方法及电子设备
JP6475026B2 (ja) 基地局、無線通信システム、および通信制御方法
WO2016176843A1 (zh) 数据发送、接收方法、基站和用户设备
WO2024032179A1 (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: 21917225

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 18260577

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2021917225

Country of ref document: EP

Effective date: 20230808