WO2020223979A1 - 一种确定冗余版本的方法、终端设备及网络设备 - Google Patents

一种确定冗余版本的方法、终端设备及网络设备 Download PDF

Info

Publication number
WO2020223979A1
WO2020223979A1 PCT/CN2019/086291 CN2019086291W WO2020223979A1 WO 2020223979 A1 WO2020223979 A1 WO 2020223979A1 CN 2019086291 W CN2019086291 W CN 2019086291W WO 2020223979 A1 WO2020223979 A1 WO 2020223979A1
Authority
WO
WIPO (PCT)
Prior art keywords
pusch
repetition
repetitions
preset threshold
transmission
Prior art date
Application number
PCT/CN2019/086291
Other languages
English (en)
French (fr)
Inventor
徐婧
林亚男
Original Assignee
Oppo广东移动通信有限公司
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 Oppo广东移动通信有限公司 filed Critical Oppo广东移动通信有限公司
Priority to CN201980025065.2A priority Critical patent/CN112219435B/zh
Priority to PCT/CN2019/086291 priority patent/WO2020223979A1/zh
Publication of WO2020223979A1 publication Critical patent/WO2020223979A1/zh

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation

Definitions

  • the present invention relates to the field of information processing technology, and in particular to a method for determining redundancy version (RV, Redundancy Version), terminal equipment, network equipment, chips, computer-readable storage media, computer program products, and computer programs.
  • RV redundancy version
  • NR Rel16 repeatedly enhances the physical uplink shared channel (PUSCH, Physical Uplink Shared Channel), relaxing some restrictions, that is, there can be one or more PUSCHs in each time slot, and the time domain resources where PUSCHs are located can be different, such as Shown in Figure 1a and Figure 1b.
  • Figure 1a contains the case where the PUSCH spans time slots
  • Figure 1b contains the case where one time slot contains more than one PUSCH.
  • embodiments of the present invention provide a method for determining a redundancy version (RV, Redundancy Version), terminal equipment, network equipment, chips, computer-readable storage media, computer program products, and computer programs.
  • RV Redundancy Version
  • a method for determining a redundancy version RV is provided, which is applied to a terminal device, and the method includes:
  • the PUSCH repeat is a split PUSCH or an unsplit PUSCH; at least one unsplit PUSCH repeat in the at least one PUSCH repeat RV Use RV0;
  • the at least one PUSCH is transmitted repeatedly.
  • a terminal device including:
  • the first processing unit determines at least one PUSCH repeated time domain resource and determines the at least one PUSCH repeated RV; wherein the PUSCH repeated is a split PUSCH or an unsplit PUSCH; at least one of the at least one PUSCH repeated RV The unsplit PUSCH repeatedly uses RV0;
  • the first communication unit transmits the at least one PUSCH repetition.
  • a method for determining a redundancy version RV is provided, which is applied to a network device, and the method includes:
  • At least one PUSCH repetition sent by the terminal device is received; wherein the PUSCH repetition is a split PUSCH or an unsplit PUSCH; at least one unsplit PUSCH among the at least one PUSCH repetitive RV uses RV0 repeatedly.
  • a network device including:
  • the second communication unit receives at least one PUSCH repetition sent by the terminal device; wherein the PUSCH repetition is a split PUSCH or an unsplit PUSCH; at least one unsplit PUSCH among the at least one PUSCH repetitive RV uses RV. .
  • a terminal device including: a processor and a memory for storing a computer program that can run on the processor,
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program stored in the memory to execute the method in the foregoing first aspect or other implementation manners.
  • a network device including: a processor and a memory for storing computer programs that can run on the processor,
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program stored in the memory to execute the methods in the foregoing third aspect or other implementation manners.
  • a chip including: a processor, configured to call and run a computer program from a memory, so that a device installed with the chip executes the methods in the first aspect, the third aspect, or other implementation manners .
  • a computer-readable storage medium is provided, the computer-readable storage medium is used to store a computer program, and the computer program enables a computer to execute the method in the first aspect, the third aspect, or other implementation manners .
  • a computer program product which includes computer program instructions that cause a computer to execute the methods in the first aspect, the third aspect, or other implementation manners.
  • a computer program is provided, and the computer program enables a computer to execute the method in the first aspect, the third aspect, or other implementation manners.
  • the time-domain resources of the PUSCH repetition and the RV of the PUSCH repetition are determined, and in the multiple PUSCH repetitions, at least one unsplit PUSCH repeats using RV0; in this way, RV0 can be mapped to at least one unsplit PUSCH PUSCH repeats, thereby avoiding the problem of incomplete transmission of the original bits.
  • Figures 1a and 1b are several schematic diagrams of PUSCH repetition
  • FIG. 1c is a schematic diagram 1 of a communication system architecture provided by an embodiment of the present invention.
  • FIG. 2 is a schematic flowchart 1 of a method for determining a redundancy version RV according to an embodiment of the present invention
  • 3-7 are schematic diagrams of several scenarios for determining the RV corresponding to PUSCH repetition according to embodiments of the present invention.
  • FIG. 8 is a schematic diagram of the structure of a terminal device according to an embodiment of the present invention.
  • FIG. 9 is a schematic diagram of the second flow of a method for determining a redundancy version RV provided by an embodiment of the present invention.
  • FIG. 10 is a schematic diagram of the composition structure of a network device according to an embodiment of the present invention.
  • FIG. 11 is a schematic diagram of the structure of a communication device provided by an embodiment of the present invention.
  • FIG. 12 is a schematic block diagram of a chip provided by an embodiment of the present invention.
  • FIG. 13 is a schematic diagram 2 of a communication system architecture provided by an embodiment of the present invention.
  • GSM Global System of Mobile Communication
  • CDMA Code Division Multiple Access
  • WCDMA Wideband Code Division Multiple Access
  • GSM Global System of Mobile Communication
  • GPRS General Packet Radio Service
  • LTE Long Term Evolution
  • FDD Frequency Division Duplex
  • TDD Time Division Duplex
  • UMTS Universal Mobile Telecommunication System
  • WiMAX Worldwide Interoperability for Microwave Access
  • the communication system 100 to which the embodiment of the present invention is applied may be as shown in FIG. 1c.
  • the communication system 100 may include a network device 110, and the network device 110 may be a device that communicates with a UE 120 (or called a communication terminal or a terminal).
  • the network device 110 may provide communication coverage for a specific geographic area, and may communicate with UEs located in the coverage area.
  • the network equipment 110 may be a network equipment (Base Transceiver Station, BTS) in a GSM system or a CDMA system, a network equipment (NodeB, NB) in a WCDMA system, or an evolution in an LTE system Type network equipment (Evolutional Node B, eNB or eNodeB), or a wireless controller in the Cloud Radio Access Network (CRAN), or the network equipment may be a mobile switching center, a relay station, an access point, In-vehicle devices, wearable devices, hubs, switches, bridges, routers, network side devices in 5G networks, or network devices in the future evolution of the Public Land Mobile Network (PLMN), etc.
  • BTS Base Transceiver Station
  • NodeB, NB network equipment
  • LTE system Type network equipment Evolutional Node B, eNB or eNodeB
  • CRAN Cloud Radio Access Network
  • the network equipment may be a mobile switching center, a relay station, an access point, In-vehicle devices, wearable
  • the communication system 100 also includes at least one UE 120 located within the coverage area of the network device 110.
  • UE as used herein includes but is not limited to connection via wired lines, such as via public switched telephone networks (PSTN), digital subscriber lines (Digital Subscriber Line, DSL), digital cables, and direct cable connections; And/or another data connection/network; and/or via a wireless interface, such as for cellular networks, wireless local area networks (WLAN), digital TV networks such as DVB-H networks, satellite networks, AM-FM Broadcast transmitter; and/or another UE's device configured to receive/send communication signals; and/or Internet of Things (IoT) equipment.
  • a UE set to communicate through a wireless interface may be referred to as a "wireless communication terminal", a “wireless terminal” or a "mobile terminal”.
  • direct terminal connection (Device to Device, D2D) communication may be performed between UEs 120.
  • the embodiment of the present invention provides a method for determining a redundancy version RV, which is applied to a terminal device, as shown in FIG. 2, including:
  • Step 21 Determine the time domain resource of at least one PUSCH repeat and determine the RV of the at least one PUSCH repeat; wherein the PUSCH repeat is a split PUSCH or an unsplit PUSCH; at least one of the RVs of the at least one PUSCH repeat is not split
  • the PUSCH repeatedly uses RV0;
  • Step 22 Send the at least one PUSCH repetition.
  • the terminal device may also determine the RV sequence and the time domain resources for PUSCH repetition.
  • the RV sequence is configured by the network or agreed upon by a protocol.
  • the RV sequence includes at least one RV; for example, the network device configures the RV sequence as ⁇ 0, 2, 3, 1 ⁇ through RRC signaling; for another example, the RV sequence may also include: ⁇ 0000 ⁇ ⁇ 0303 ⁇ .
  • the RV sequence is configured on the network side.
  • DCI Downlink Control Information
  • the RV sequence is configured on the network side.
  • DCI Downlink Control Information
  • Table 1 The corresponding relationship between the value of the relevant field in the DCI and the RV order is shown in Table 1.
  • the RV sequence is semi-statically configured through RRC signaling.
  • the RV sequence includes three types: ⁇ 0000 ⁇ 0303 ⁇ and ⁇ 0231 ⁇ .
  • the PUSCH repeated time domain resources may be configured by the network device through an uplink (UL) grant (grant).
  • UL uplink
  • the network device may also configure the repetition period for the terminal device, for example, configure the Configured grant period through RRC signaling.
  • the repetition period for the terminal device for example, configure the Configured grant period through RRC signaling.
  • a 7-symbol is used as an example for description.
  • PUSCH repeats are split PUSCH or unsplit PUSCH.
  • the split PUSCH means that if there is a PUSCH that repeatedly crosses the slot boundary, the PUSCH will be split; the unsplit PUSCH can be understood as a PUSCH that does not cross a slot or is within a slot.
  • the previous two transmissions are taken as an example.
  • the network device configures the PUSCH repetition times for user 1 to 2, and the time domain position of the first PUSCH repetition in the first transmission is the nth time slot.
  • the PUSCH repetition is immediately following the previous PUSCH repetition resource in the time domain.
  • the first PUSCH of the second transmission repeatedly crosses the boundary and is split into two PUSCHs.
  • At least one PUSCH can be repeatedly divided, and the PUSCH can be repeatedly grouped, that is, multiple PUSCHs in each transmission are repeatedly grouped to obtain multiple sets, and then each The set determines the RV of the PUSCH repeat.
  • At least one PUSCH transmitted at one time is repeatedly divided into a first set and/or a second set.
  • the first set and/or the second set in this embodiment it actually only represents the repeated classification of at least one PUSCH.
  • Two categories can be divided, and when the different categories are divided, the The reference parameters or features are different, the following is a detailed description in combination with multiple scenarios:
  • the reference for dividing the PUSCH repetition may be whether the PUSCH is a split PUSCH repetition, that is, the PUSCH repetitions included in the first set are all unsplit PUSCH repetitions; the PUSCH repetitions included in the second set are The split PUSCH is repeated.
  • the configured RV sequence is repeatedly used for the PUSCH in the first set to determine the RV corresponding to the PUSCH repetition; and RV0 is repeatedly used for the PUSCH in the second set.
  • RV0 can be mapped at least in a complete PUSCH repetition, avoiding the problem of incomplete transmission of the original bits.
  • Condition-based RV selection enables the unsplit situation to obtain the combined gain of RV changes.
  • the unsplit PUSCH repetitions included in the first set are mapped according to the RV order configured by the network.
  • RV0 is repeatedly used for the split PUSCH included in the second set. For each PUSCH repetition in the second set, it can be directly determined to adopt RV0; or, according to the preset default RV sequence ⁇ 0000 ⁇ , the PUSCH in the second set can be re-mapped to determine that each PUSCH repetition is equal Use RV0.
  • the RV order RV ⁇ 0,2 ⁇ is repeated for the two complete PUSCHs of the first transmission; the RV order RV ⁇ 0 ⁇ is repeated for the third complete PUSCH of the second transmission.
  • the RV sequence is ⁇ 0303 ⁇ , then the two complete PUSCH repetitions of the first transmission use RV0 and 3 respectively; the second transmission of the first and second split PUSCH repetitions use RV0 ,
  • the third PUSHC uses RV0 in the RV sequence.
  • Another implementation manner includes at least one of the following:
  • the configured RV sequence is repeatedly used to determine the RV corresponding to the PUSCH repetition;
  • the configured RV sequence is repeatedly used for the PUSCH in the second set to determine the RV corresponding to the PUSCH repetition.
  • the configured RV sequence is used to determine the RV corresponding to the PUSCH repetition in each set.
  • the two sets can use the same RV sequence, they respectively correspond to the RV sequence.
  • the PUSCH in the first transmission is not split and therefore corresponds to the RV sequence. Then there is only the first set.
  • the RV sequence determines the RV of each PUSCH repetition as RV0 and RV2; in the second transmission, the split PUSCH is the first and second PUSCH repetitions, and in the second set, the remaining third PUSCH repetition is in the first set
  • the RV sequence is determined to be RV0 and 2, respectively; the third PUSCH repetition is determined to be RV0 after corresponding to the RV sequence.
  • This scenario adopts different ways of dividing sets, which are divided by bit rate, specifically:
  • PUSCH repetitions included in the first set are PUSCH repetitions with a code rate less than or equal to the second preset threshold;
  • PUSCH repetitions included in the second set are PUSCH repetitions with a code rate greater than the second preset threshold;
  • the PUSCH repetitions included in the first set are PUSCH repetitions with a code rate less than the second preset threshold; the PUSCH repetitions included in the second set are PUSCH repetitions with a code rate greater than or equal to the second preset threshold.
  • the second preset threshold is configured by the network device or preset by the terminal device itself.
  • the second preset threshold value may be 0.93 or 1.
  • RV0 is repeatedly used.
  • this scenario can also use RV sequences for the first set and the second set to determine the RV corresponding to each PUSCH repeat.
  • the corresponding method is the same as scenario 1, so I won't repeat it here.
  • the first set includes the first unsplit PUSCH repetition and subsequent PUSCH repetitions in one transmission
  • the second set includes the PUSCH repetition before the first unsplit PUSCH repetition in one transmission.
  • the first two are split PUSCH repetitions, then the third PUSCH repetition and the first two PUSCH repetitions use RV0;
  • the first unsplit PUSCH and subsequent PUSCHs For at least one PUSCH repetition transmitted at a time, determine the first unsplit PUSCH and subsequent PUSCHs to use the RV sequence to determine the RV corresponding to the PUSCH repetition; for example, there are currently 2 PUSCH repetitions, and the first PUSCH repetition is unsplit PUSCH, then the first and second PUSCHs correspond to the first and second RVs in the RV sequence respectively.
  • the first one containing the complete PUSCH repetition and the previous PUSCH repetition both use RV0, and starting from the first one containing the complete PUSCH, map according to the RV order of the network configuration.
  • the first/second/third PUSCH of the second transmission shown in FIG. 4 uses RV0 repeatedly, so that RV0 can be mapped in at least one complete PUSCH repetition, avoiding the problem of incomplete transmission of original bits.
  • this scenario can also use RV sequences for the first set and the second set to determine the RV corresponding to each PUSCH repeat.
  • the corresponding method is the same as scenario 1, so I won't repeat it here.
  • the time domain length of the PUSCH repetitions included in the first set is greater than or equal to the third preset threshold; the time domain length of the PUSCH repetitions included in the second set is a bit rate less than the third preset PUSCH repetition of the threshold;
  • PUSCH repetitions whose time-domain lengths included in the first set are greater than a third preset threshold; and the time-domain lengths of PUSCH repetitions contained in the second set are less than or equal to the third preset threshold
  • the PUSCH is repeated.
  • the third preset threshold can be understood as configured by the network device or preset.
  • One way to determine the third preset threshold value may be: the initial time domain length of the PUSCH.
  • the initial time domain length of the PUSCH may be a parameter configured by the network device for the terminal device.
  • the configured RV sequence is repeatedly used for the PUSCH in the first set to determine the RV corresponding to the PUSCH repetition; and the RV0 is repeatedly used for the PUSCH in the second set.
  • RV0 can be mapped at least in a complete PUSCH repetition, avoiding the problem of incomplete transmission of the original bits.
  • Condition-based RV selection enables the unsplit situation to obtain the combined gain of RV changes.
  • the PUSCH repetitions of this transmission are all divided into the first set, and then the PUSCHs in the first set are repeatedly timed
  • the domain sequence is mapped with the RV in the RV sequence to determine the RV of each PUSCH repetition; or, there are 3 PUSCH repetitions in one transmission, and the time domain length of the 1, 2 PUSCH repetitions is less than the third preset threshold ,
  • the third time is greater than the third preset threshold, then the first and second PUSCHs are repeatedly divided into the second set, and the third PUSCH is divided into the first set; then the mapping is performed according to the two sets respectively.
  • Another implementation manner includes at least one of the following:
  • the configured RV sequence is repeatedly used to determine the RV corresponding to the PUSCH repetition;
  • the configured RV sequence is repeatedly used for the PUSCH in the second set to determine the RV corresponding to the PUSCH repetition.
  • the configured RV sequence is used to determine the RV corresponding to the PUSCH repetition in each set.
  • the two sets can use the same RV sequence, they respectively correspond to the RV sequence.
  • the transmission described in this embodiment may be dynamic transmission or semi-static transmission.
  • this embodiment may also provide the following processing:
  • all PUSCH repetitions use RV0. That is to say, for a configuration with a semi-static transmission period less than one time slot length, all PUSCHs use RV0; in addition, it can also be understood that for a configuration with a semi-static transmission and a period greater than or equal to 1 time slot length, you can The PUSCH repeated RV is determined according to the RV sequence configured by the network device. In order to avoid invalid transmission.
  • RV can be indicated reasonably so that at least one complete PUSCH repetition can use RV0.
  • RV is semi-statically indicated, and PUSCH repeated splitting is changing.
  • the first PUSCH transmitted for the first time is repeated twice in the sixth symbol of time slot n-the eighth symbol of time slot n.
  • the first PUSCH of the second transmission repeatedly crosses the boundary and is therefore split.
  • the equivalent code rate is greater than 1, so the original bits cannot be completely transmitted.
  • RV0 can be mapped in at least one PUSCH repetition that is not split, thereby avoiding the problem of incomplete transmission of the original bits.
  • the RV is repeatedly selected for the PUSCH based on certain conditions provided in this embodiment, so that the combined gain of the RV change can be obtained without splitting.
  • the embodiment of the present invention provides a terminal device, as shown in FIG. 8, including:
  • the first processing unit 41 determines the time-domain resource of at least one PUSCH repetition and determines the RV of the at least one PUSCH repetition; wherein the PUSCH repetition is a split PUSCH or an unsplit PUSCH; at least one of the RVs of the at least one PUSCH repeat An unsplit PUSCH repeatedly uses RV0;
  • the first communication unit 42 transmits the at least one PUSCH repetition.
  • the first processing unit 41 may also determine the RV sequence and the time domain resources for PUSCH repetition.
  • the RV sequence is configured by the network or agreed upon by a protocol.
  • the PUSCH repeated time domain resources may be configured by the network device through an uplink (UL) grant (grant).
  • UL uplink
  • the network device may also configure the repetition period for the terminal device, for example, configure the Configured grant period through RRC signaling.
  • the repetition period for the terminal device for example, configure the Configured grant period through RRC signaling.
  • a 7-symbol is used as an example for description.
  • PUSCH repeats are split PUSCH or unsplit PUSCH.
  • the split PUSCH means that if there is a PUSCH that repeatedly crosses the slot boundary, the PUSCH will be split; the unsplit PUSCH can be understood as a PUSCH that does not cross a slot or is within a slot.
  • At least one PUSCH can be repeatedly divided, and the PUSCH can be repeatedly grouped, that is, multiple PUSCHs in each transmission are repeatedly grouped to obtain multiple sets, and then each The set determines the RV of the PUSCH repeat.
  • At least one PUSCH transmitted at one time is repeatedly divided into a first set and/or a second set.
  • the first set and/or the second set in this embodiment it actually only represents the repeated classification of at least one PUSCH.
  • Two categories can be divided, and when the different categories are divided, the The reference parameters or features are different, the following is a detailed description in combination with multiple scenarios:
  • the reference for dividing the PUSCH repetition may be whether the PUSCH is a split PUSCH repetition, that is, the PUSCH repetitions included in the first set are all unsplit PUSCH repetitions; the PUSCH repetitions included in the second set are The split PUSCH is repeated.
  • the first processing unit 41 repeatedly uses the configured RV sequence for the PUSCH in the first set to determine the RV corresponding to the PUSCH repetition; and repeatedly uses RV0 for the PUSCH in the second set.
  • RV0 can be mapped at least in a complete PUSCH repetition, avoiding the problem of incomplete transmission of the original bits.
  • Condition-based RV selection enables the unsplit situation to obtain the combined gain of RV changes.
  • the unsplit PUSCH repetitions included in the first set are mapped according to the RV order configured by the network.
  • RV0 is repeatedly used for the split PUSCH included in the second set.
  • the RV order RV ⁇ 0,2 ⁇ is repeated for the two complete PUSCHs of the first transmission; the RV order RV ⁇ 0 ⁇ is repeated for the third complete PUSCH of the second transmission.
  • the first processing unit 41 executes at least one of the following:
  • the configured RV sequence is repeatedly used to determine the RV corresponding to the PUSCH repetition;
  • the configured RV sequence is repeatedly used for the PUSCH in the second set to determine the RV corresponding to the PUSCH repetition.
  • the configured RV sequence is used to determine the RV corresponding to the PUSCH repetition in each set.
  • the two sets can use the same RV sequence, they respectively correspond to the RV sequence.
  • the PUSCH in the first transmission is unsplit and therefore corresponds to the RV sequence. Then there is only the first set.
  • the RV sequence determines the RV of each PUSCH repetition as RV0 and RV2; in the second transmission, the split PUSCH is the first and second PUSCH repetitions, and in the second set, the remaining third PUSCH repetition is in the first set
  • the RV sequence is determined to be RV0 and 2, respectively; the third PUSCH repetition is determined to be RV0 after corresponding to the RV sequence.
  • This scenario adopts different ways of dividing sets, which are divided by bit rate, specifically:
  • PUSCH repetitions included in the first set are PUSCH repetitions with a code rate less than or equal to the second preset threshold;
  • PUSCH repetitions included in the second set are PUSCH repetitions with a code rate greater than the second preset threshold;
  • the PUSCH repetitions included in the first set are PUSCH repetitions with a code rate less than the second preset threshold; the PUSCH repetitions included in the second set are PUSCH repetitions with a code rate greater than or equal to the second preset threshold.
  • the second preset threshold is configured by the network device or preset by the terminal device itself.
  • the second preset threshold value may be 0.93 or 1.
  • RV0 is repeatedly used.
  • this scenario can also use RV sequences for the first set and the second set to determine the RV corresponding to each PUSCH repeat.
  • the corresponding method is the same as scenario 1, so I won't repeat it here.
  • the first set includes the first unsplit PUSCH repetition and subsequent PUSCH repetitions in one transmission
  • the second set includes the PUSCH repetition before the first unsplit PUSCH repetition in one transmission.
  • the first two are split PUSCH repetitions, then the third PUSCH repetition and the first two PUSCH repetitions use RV0;
  • the first unsplit PUSCH and subsequent PUSCHs For at least one PUSCH repetition transmitted at a time, determine the first unsplit PUSCH and subsequent PUSCHs to use the RV sequence to determine the RV corresponding to the PUSCH repetition; for example, there are currently 2 PUSCH repetitions, and the first PUSCH repetition is unsplit PUSCH, then the first and second PUSCHs correspond to the first and second RVs in the RV sequence respectively.
  • this scenario can also use RV sequences for the first set and the second set to determine the RV corresponding to each PUSCH repeat.
  • the corresponding method is the same as scenario 1, so I won't repeat it here.
  • the time domain length of the PUSCH repetitions included in the first set is greater than or equal to the third preset threshold; the time domain length of the PUSCH repetitions included in the second set is a bit rate less than the third preset PUSCH repetition of the threshold;
  • PUSCH repetitions whose time-domain lengths included in the first set are greater than a third preset threshold; and the time-domain lengths of PUSCH repetitions contained in the second set are less than or equal to the third preset threshold
  • the PUSCH is repeated.
  • the third preset threshold can be understood as configured by the network device or preset.
  • One way to determine the third preset threshold value may be: the initial time domain length of the PUSCH.
  • the initial time domain length of the PUSCH may be a parameter configured by the network device for the terminal device.
  • the configured RV sequence is repeatedly used for the PUSCH in the first set to determine the RV corresponding to the PUSCH repetition; and the RV0 is repeatedly used for the PUSCH in the second set.
  • RV0 can be mapped at least in a complete PUSCH repetition, avoiding the problem of incomplete transmission of the original bits.
  • Condition-based RV selection enables the unsplit situation to obtain the combined gain of RV changes.
  • Another implementation manner includes at least one of the following:
  • the configured RV sequence is repeatedly used to determine the RV corresponding to the PUSCH repetition;
  • the configured RV sequence is repeatedly used for the PUSCH in the second set to determine the RV corresponding to the PUSCH repetition.
  • the configured RV sequence is used to determine the RV corresponding to the PUSCH repetition in each set.
  • the two sets can use the same RV sequence, they respectively correspond to the RV sequence.
  • the transmission described in this embodiment may be dynamic transmission or semi-static transmission.
  • this embodiment may also provide the following processing:
  • all PUSCH repetitions use RV0. That is to say, for a configuration with a semi-static transmission period less than one time slot length, all PUSCHs use RV0; in addition, it can also be understood that for a configuration with a semi-static transmission and a period greater than or equal to 1 time slot length, you can The PUSCH repeated RV is determined according to the RV sequence configured by the network device. In order to avoid invalid transmission.
  • RV0 can be mapped in at least one PUSCH repetition that is not split, thereby avoiding the problem of incomplete transmission of the original bits.
  • the RV is repeatedly selected for the PUSCH based on certain conditions provided in this embodiment, so that the combined gain of the RV change can be obtained without splitting.
  • the embodiment of the present invention provides a method for determining a redundancy version RV, which is applied to a network device, as shown in FIG. 9, includes:
  • Step 41 Receive at least one PUSCH repetition sent by the terminal device; wherein the PUSCH repetition is a split PUSCH or an unsplit PUSCH; at least one unsplit PUSCH among the at least one PUSCH repetitive RV uses RV0 repeatedly.
  • the network device will also configure the RV sequence for the terminal device.
  • the network device configures the PUSCH repeated resources for the terminal device through an uplink (UL) grant (grant).
  • UL uplink
  • the network device may also configure the repetition period for the terminal device, for example, configure the Configured grant period through RRC signaling.
  • the repetition period for the terminal device for example, configure the Configured grant period through RRC signaling.
  • a 7-symbol is used as an example for description.
  • PUSCH repeats are split PUSCH or unsplit PUSCH.
  • the split PUSCH means that if there is a PUSCH that repeatedly crosses the slot boundary, the PUSCH will be split; the unsplit PUSCH can be understood as a PUSCH that does not cross a slot or is within a slot.
  • the received at least one PUSCH may be repeatedly divided, the PUSCH repetitions may be grouped, and the RV used for the PUSCH repetition may be determined for each set. specific:
  • At least one PUSCH received for one transmission is repeated into a first set and/or a second set.
  • the first set and/or the second set in this embodiment it actually only represents the repeated classification of at least one PUSCH.
  • Two categories can be divided, and when the different categories are divided, the The reference parameters or features are different, the following is a detailed description in combination with multiple scenarios:
  • the reference for dividing the PUSCH repetition may be whether the PUSCH is a split PUSCH repetition, that is, the PUSCH repetitions included in the first set are all unsplit PUSCH repetitions; the PUSCH repetitions included in the second set are The split PUSCH is repeated.
  • the RV corresponding to the received PUSCH repetition in the first set is determined based on the RV sequence, and the data in the PUSCH repetition is analyzed;
  • RV0 is mapped in at least one complete PUSCH repetition, avoiding the problem of incomplete transmission of the original bit.
  • Condition-based RV selection enables the unsplit situation to obtain the combined gain of RV changes.
  • the unsplit PUSCH repetitions included in the first set are mapped according to the RV order configured by the network.
  • RV0 is repeatedly used for the split PUSCH included in the second set.
  • the RV order RV ⁇ 0,2 ⁇ is repeated for the two complete PUSCHs of the first transmission; the RV order RV ⁇ 0 ⁇ is repeated for the third complete PUSCH of the second transmission.
  • Another implementation manner includes at least one of the following:
  • the configured RV sequence is used to determine the RV corresponding to the PUSCH repetition in each set.
  • the two sets can use the same RV sequence, they respectively correspond to the RV sequence.
  • the PUSCH in the first transmission is unsplit and therefore corresponds to the RV sequence. Then there is only the first set.
  • the RV sequence determines the RV of each PUSCH repetition as RV0 and RV2; in the second transmission, the split PUSCH is the first and second PUSCH repetitions, and in the second set, the remaining third PUSCH repetition is in the first set
  • the RV sequence is determined to be RV0 and 2, respectively; the third PUSCH repetition is determined to be RV0 after corresponding to the RV sequence.
  • This scenario adopts different ways of dividing sets, which are divided by bit rate, specifically:
  • PUSCH repetitions included in the first set are PUSCH repetitions with a code rate less than or equal to the second preset threshold;
  • PUSCH repetitions included in the second set are PUSCH repetitions with a code rate greater than the second preset threshold;
  • the PUSCH repetitions included in the first set are PUSCH repetitions with a code rate less than the second preset threshold; the PUSCH repetitions included in the second set are PUSCH repetitions with a code rate greater than or equal to the second preset threshold.
  • the second preset threshold is configured by the network device or preset by the terminal device itself.
  • the second preset threshold value may be 0.93 or 1.
  • RV0 is repeatedly used.
  • this scenario can also determine the RV corresponding to the PUSCH repetition in the first set and the second set.
  • the method is the same as in scenario 1, and will not be repeated here.
  • the first set includes the first unsplit PUSCH repetition and subsequent PUSCH repetitions in one transmission
  • the second set includes the PUSCH repetition before the first unsplit PUSCH repetition in one transmission.
  • the first two are split PUSCH repetitions, then the third PUSCH repetition and the first two PUSCH repetitions use RV0;
  • the first unsplit PUSCH and subsequent PUSCHs For at least one PUSCH repetition transmitted at a time, determine the first unsplit PUSCH and subsequent PUSCHs to use the RV sequence to determine the RV corresponding to the PUSCH repetition; for example, there are currently 2 PUSCH repetitions, and the first PUSCH repetition is unsplit PUSCH, then the first and second PUSCHs correspond to the first and second RVs in the RV sequence respectively.
  • this scenario can also determine the RV corresponding to the PUSCH repetition in the first set and the second set.
  • the method is the same as in scenario 1, and will not be repeated here.
  • the time domain length of the PUSCH repetitions included in the first set is greater than or equal to the third preset threshold; the time domain length of the PUSCH repetitions included in the second set is a bit rate less than the third preset PUSCH repetition of the threshold;
  • PUSCH repetitions whose time-domain lengths included in the first set are greater than a third preset threshold; and the time-domain lengths of PUSCH repetitions contained in the second set are less than or equal to the third preset threshold
  • the PUSCH is repeated.
  • the third preset threshold can be understood as configured by the network device or preset.
  • One way to determine the third preset threshold value may be: the initial time domain length of the PUSCH.
  • the initial time domain length of the PUSCH may be a parameter configured by the network device for the terminal device.
  • the configured RV sequence is repeatedly used for the PUSCH in the first set to determine the RV corresponding to the PUSCH repetition; and the RV0 is repeatedly used for the PUSCH in the second set.
  • RV0 can be mapped at least in a complete PUSCH repetition, avoiding the problem of incomplete transmission of the original bits.
  • Condition-based RV selection enables the unsplit situation to obtain the combined gain of RV changes.
  • this scenario can also determine the RV corresponding to the PUSCH repetition in the first set and the second set.
  • the method is the same as in scenario 1, and will not be repeated here.
  • the transmission described in this embodiment may be dynamic transmission or semi-static transmission.
  • this embodiment may also provide the following processing:
  • RV0 can be mapped in at least one PUSCH repetition that is not split, thereby avoiding the problem of incomplete transmission of the original bits.
  • the RV is repeatedly selected for the PUSCH based on certain conditions provided in this embodiment, so that the combined gain of the RV change can be obtained without splitting.
  • the embodiment of the present invention provides a network device, as shown in FIG. 10, including:
  • the second communication unit 51 receives at least one PUSCH repetition sent by a terminal device; wherein the PUSCH repetition is a split PUSCH or an unsplit PUSCH; at least one unsplit PUSCH in the at least one PUSCH repeated RV is repeatedly used RV0.
  • the network device will also configure the RV sequence for the terminal device.
  • the network device configures the PUSCH repeated resources for the terminal device through an uplink (UL) grant (grant).
  • UL uplink
  • the network device may also configure the repetition period for the terminal device, for example, configure the Configured grant period through RRC signaling.
  • the repetition period for the terminal device for example, configure the Configured grant period through RRC signaling.
  • a 7-symbol is used as an example for description.
  • PUSCH repeats are split PUSCH or unsplit PUSCH.
  • the split PUSCH means that if there is a PUSCH that repeatedly crosses the slot boundary, the PUSCH will be split; the unsplit PUSCH can be understood as a PUSCH that does not cross a slot or is within a slot.
  • the received at least one PUSCH may be repeatedly divided, the PUSCH repetitions may be grouped, and the RV used for the PUSCH repetition may be determined for each set. specific:
  • the network equipment also includes:
  • the second processing unit 52 divides the received at least one PUSCH of one transmission into a first set and/or a second set.
  • the first set and/or the second set in this embodiment it actually only represents the repeated classification of at least one PUSCH.
  • Two categories can be divided, and when the different categories are divided, the The reference parameters or features are different, the following is a detailed description in combination with multiple scenarios:
  • the reference for dividing the PUSCH repetition may be whether the PUSCH is a split PUSCH repetition, that is, the PUSCH repetitions included in the first set are all unsplit PUSCH repetitions; the PUSCH repetitions included in the second set are The split PUSCH is repeated.
  • the second processing unit 52 determines the RV corresponding to the received PUSCH repetition in the first set based on the RV sequence, and analyzes the data in the PUSCH repetition;
  • RV0 is mapped in at least one complete PUSCH repetition, avoiding the problem of incomplete transmission of the original bit.
  • Condition-based RV selection enables the unsplit situation to obtain the combined gain of RV changes.
  • the second processing unit 52 includes at least one of the following:
  • This scenario adopts different ways of dividing sets, which are divided by bit rate, specifically:
  • PUSCH repetitions included in the first set are PUSCH repetitions with a code rate less than or equal to the second preset threshold;
  • PUSCH repetitions included in the second set are PUSCH repetitions with a code rate greater than the second preset threshold;
  • the PUSCH repetitions included in the first set are PUSCH repetitions with a code rate less than the second preset threshold; the PUSCH repetitions included in the second set are PUSCH repetitions with a code rate greater than or equal to the second preset threshold.
  • the second preset threshold is configured by the network device or preset by the terminal device itself.
  • the second preset threshold value may be 0.93 or 1.
  • RV0 is repeatedly used.
  • this scenario can also determine the RV corresponding to the PUSCH repetition in the first set and the second set.
  • the method is the same as in scenario 1, and will not be repeated here.
  • the first set includes the first unsplit PUSCH repetition and subsequent PUSCH repetitions in one transmission
  • the second set includes the PUSCH repetition before the first unsplit PUSCH repetition in one transmission.
  • the first two are split PUSCH repetitions, then the third PUSCH repetition and the first two PUSCH repetitions use RV0;
  • the first unsplit PUSCH and subsequent PUSCHs For at least one PUSCH repetition transmitted at a time, determine the first unsplit PUSCH and subsequent PUSCHs to use the RV sequence to determine the RV corresponding to the PUSCH repetition; for example, there are currently 2 PUSCH repetitions, and the first PUSCH repetition is unsplit PUSCH, then the first and second PUSCHs correspond to the first and second RVs in the RV sequence respectively.
  • this scenario can also determine the RV corresponding to the PUSCH repetition in the first set and the second set.
  • the method is the same as in scenario 1, and will not be repeated here.
  • the time domain length of the PUSCH repetitions included in the first set is greater than or equal to the third preset threshold; the time domain length of the PUSCH repetitions included in the second set is a bit rate less than the third preset PUSCH repetition of the threshold;
  • PUSCH repetitions whose time-domain lengths included in the first set are greater than a third preset threshold; and the time-domain lengths of PUSCH repetitions contained in the second set are less than or equal to the third preset threshold
  • the PUSCH is repeated.
  • the third preset threshold can be understood as configured by the network device or preset.
  • One way to determine the third preset threshold value may be: the initial time domain length of the PUSCH.
  • the initial time domain length of the PUSCH may be a parameter configured by the network device for the terminal device.
  • the configured RV sequence is repeatedly used for the PUSCH in the first set to determine the RV corresponding to the PUSCH repetition; and the RV0 is repeatedly used for the PUSCH in the second set.
  • RV0 can be mapped at least in a complete PUSCH repetition, avoiding the problem of incomplete transmission of the original bits.
  • Condition-based RV selection enables the unsplit situation to obtain the combined gain of RV changes.
  • this scenario can also determine the RV corresponding to the PUSCH repetition in the first set and the second set.
  • the method is the same as in scenario 1, and will not be repeated here.
  • the transmission described in this embodiment may be dynamic transmission or semi-static transmission.
  • this embodiment may also provide the following processing:
  • RV0 can be mapped in at least one PUSCH repetition that is not split, thereby avoiding the problem of incomplete transmission of the original bits.
  • the RV is repeatedly selected for the PUSCH based on certain conditions provided in this embodiment, so that the combined gain of the RV change can be obtained without splitting.
  • FIG. 11 is a schematic structural diagram of a communication device 700 provided by an embodiment of the present invention.
  • the communication device in this embodiment may be specifically a terminal device or a network device in the foregoing embodiment.
  • the communication device 700 shown in FIG. 11 includes a processor 710, and the processor 710 can call and run a computer program from a memory to implement the method in the embodiment of the present invention.
  • the communication device 700 may further include a memory 720.
  • the processor 710 may call and run a computer program from the memory 720 to implement the method in the embodiment of the present invention.
  • the memory 720 may be a separate device independent of the processor 710, or may be integrated in the processor 710.
  • the communication device 700 may further include a transceiver 730, and the processor 710 may control the transceiver 730 to communicate with other devices. Specifically, it may send information or data to other devices, or receive other devices. Information or data sent by the device.
  • the transceiver 730 may include a transmitter and a receiver.
  • the transceiver 730 may further include an antenna, and the number of antennas may be one or more.
  • the communication device 700 may specifically be a network device according to an embodiment of the present invention, and the communication device 700 may implement the corresponding process implemented by the network device in each method of the embodiment of the present invention. For brevity, details are not repeated here. .
  • the communication device 700 may specifically be a terminal device or a network device according to an embodiment of the present invention, and the communication device 700 may implement the corresponding process implemented by the mobile terminal/terminal device in each method of the embodiment of the present invention. It’s concise and will not be repeated here.
  • Fig. 12 is a schematic structural diagram of a chip according to an embodiment of the present invention.
  • the chip 800 shown in FIG. 12 includes a processor 810, and the processor 810 can call and run a computer program from the memory to implement the method in the embodiment of the present invention.
  • the chip 800 may further include a memory 820.
  • the processor 810 can call and run a computer program from the memory 820 to implement the method in the embodiment of the present invention.
  • the memory 820 may be a separate device independent of the processor 810, or may be integrated in the processor 810.
  • the chip 800 may further include an input interface 830.
  • the processor 810 can control the input interface 830 to communicate with other devices or chips, and specifically, can obtain information or data sent by other devices or chips.
  • the chip 800 may further include an output interface 840.
  • the processor 810 can control the output interface 840 to communicate with other devices or chips, and specifically, can output information or data to other devices or chips.
  • the chip can be applied to the terminal device or network device in the embodiment of the present invention, and the chip can implement the corresponding process implemented by the terminal device in each method of the embodiment of the present invention. For the sake of brevity, it will not be repeated here. .
  • the chip mentioned in the embodiment of the present invention may also be called a system-level chip, a system-on-chip, a system-on-chip, or a system-on-chip, etc.
  • the processor in the embodiment of the present invention may be an integrated circuit chip with signal processing capability.
  • the steps of the foregoing method embodiments can be completed by hardware integrated logic circuits in the processor or instructions in the form of software.
  • the aforementioned processor may be a general-purpose processor, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (ASIC), a ready-made programmable gate array (Field Programmable Gate Array, FPGA) or other Programming logic devices, discrete gates or transistor logic devices, discrete hardware components.
  • DSP Digital Signal Processor
  • ASIC application specific integrated circuit
  • FPGA ready-made programmable gate array
  • the methods, steps, and logical block diagrams disclosed in the embodiments of the present invention can be implemented or executed.
  • the general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.
  • the steps of the method disclosed in the embodiments of the present invention may be directly embodied as being executed and completed by a hardware decoding processor, or executed and completed by a combination of hardware and software modules in the decoding processor.
  • the software module can be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, registers.
  • the storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.
  • the memory in the embodiment of the present invention may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory can be read-only memory (Read-Only Memory, ROM), programmable read-only memory (Programmable ROM, PROM), erasable programmable read-only memory (Erasable PROM, EPROM), and electrically available Erase programmable read-only memory (Electrically EPROM, EEPROM) or flash memory.
  • the volatile memory may be a random access memory (Random Access Memory, RAM), which is used as an external cache.
  • RAM random access memory
  • SRAM static random access memory
  • DRAM dynamic random access memory
  • DRAM synchronous dynamic random access memory
  • DDR SDRAM Double Data Rate Synchronous Dynamic Random Access Memory
  • Enhanced SDRAM, ESDRAM Enhanced Synchronous Dynamic Random Access Memory
  • Synchronous Link Dynamic Random Access Memory Synchronous Link Dynamic Random Access Memory
  • DR RAM Direct Rambus RAM
  • the memory in the embodiment of the present invention may also be static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), Synchronous dynamic random access memory (synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous connection Dynamic random access memory (synch link DRAM, SLDRAM) and direct memory bus random access memory (Direct Rambus RAM, DR RAM), etc.
  • static random access memory static random access memory
  • SRAM static random access memory
  • dynamic RAM dynamic random access memory
  • Synchronous dynamic random access memory synchronous DRAM, SDRAM
  • double data rate SDRAM double data rate SDRAM, DDR SDRAM
  • enhanced synchronous dynamic random access memory enhanced synchronous dynamic random access memory
  • ESDRAM enhanced synchronous dynamic random access memory
  • synchronous connection Dynamic random access memory strip link DRAM, SLDRAM
  • Direct Rambus RAM Direct Rambus RAM
  • FIG. 13 is a schematic block diagram of a communication system 1400 according to an embodiment of the present application. As shown in FIG. 13, the communication system 1400 includes a terminal device 1410 and a network device 1420.
  • the terminal device 1410 can be used to implement the corresponding function implemented by the terminal device in the above method
  • the network device 1420 can be used to implement the corresponding function implemented by the network device in the above method. For brevity, it will not be repeated here. .
  • the embodiment of the present invention also provides a computer-readable storage medium for storing computer programs.
  • the computer-readable storage medium may be applied to the network device in the embodiment of the present invention, and the computer program causes the computer to execute the corresponding process implemented by the network device in each method of the embodiment of the present invention.
  • the computer program causes the computer to execute the corresponding process implemented by the network device in each method of the embodiment of the present invention.
  • the computer program causes the computer to execute the corresponding process implemented by the network device in each method of the embodiment of the present invention.
  • the computer-readable storage medium can be applied to the terminal device in the embodiment of the present invention, and the computer program causes the computer to execute the corresponding process implemented by the mobile terminal/terminal device in each method of the embodiment of the present invention.
  • I won’t repeat it here.
  • the embodiment of the present invention also provides a computer program product, including computer program instructions.
  • the computer program product can be applied to the network device in the embodiment of the present invention, and the computer program instructions cause the computer to execute the corresponding process implemented by the network device in each method of the embodiment of the present invention.
  • the computer program instructions cause the computer to execute the corresponding process implemented by the network device in each method of the embodiment of the present invention.
  • the computer program instructions cause the computer to execute the corresponding process implemented by the network device in each method of the embodiment of the present invention.
  • the computer program product can be applied to the network device in the embodiment of the present invention, and the computer program instructions cause the computer to execute the corresponding process implemented by the network device in each method of the embodiment of the present invention.
  • the computer program product can be applied to the mobile terminal/terminal device in the embodiment of the present invention, and the computer program instructions cause the computer to execute the corresponding process implemented by the mobile terminal/terminal device in each method of the embodiment of the present invention, For brevity, I won't repeat them here.
  • the embodiment of the present invention also provides a computer program.
  • the computer program may be applied to the network device in the embodiment of the present invention.
  • the computer program When the computer program is run on the computer, the computer is caused to execute the corresponding process implemented by the network device in each method of the embodiment of the present invention. For the sake of brevity , I won’t repeat it here.
  • the computer program can be applied to the mobile terminal/terminal device in the embodiment of the present invention.
  • the computer program runs on the computer, the computer executes each method in the embodiment of the present invention. For the sake of brevity, the corresponding process will not be repeated here.
  • the disclosed system, device, and method may be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components can be combined or It can be integrated into another system, or some features can be ignored or not implemented.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments.
  • the functional units in the various embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
  • the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium.
  • the technical solution of the present invention essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in each embodiment of the present invention.
  • the aforementioned storage media include: 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 code .

Landscapes

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

Abstract

本发明公开了一种确定冗余版本(RV,Redundancy Version)的方法、终端设备、网络设备、芯片、计算机可读存储介质、计算机程序产品以及计算机程序,所述方法包括:确定至少一个PUSCH重复的时域资源以及确定所述至少一个PUSCH重复的RV;其中,PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0;发送所述至少一个PUSCH重复。

Description

一种确定冗余版本的方法、终端设备及网络设备 技术领域
本发明涉及信息处理技术领域,尤其涉及一种确定冗余版本(RV,Redundancy Version)的方法、终端设备、网络设备、芯片、计算机可读存储介质、计算机程序产品以及计算机程序。
背景技术
NR Rel16对物理上行共享信道(PUSCH,Physical Uplink Shared Channel)重复做增强,放松了一些限制条件,即每个时隙内可以有一个或多个PUSCH,且PUSCH所在的时域资源可以不同,如图1a和图1b所示。图1a包含了PUSCH跨时隙的情况,图1b包含了一个时隙中包含大于1个PUSCH的情况。
但是当限制被放松后,会出现一个PUSCH分裂成2个或多个PUSCH重复的情况。如图1a所示,当一个PUSCH跨时隙会分裂为两个独立的PUSCH重复,如图1b所示,当一个PUSCH遇到下行和灵活资源,会自动拆分,拆分后的2个PUSCH传输独立的TB。PUSCH重复被拆分后可能形成持续时间较短的PUSCH重复,如此,可能会出现原比特信息不完整传输的问题。
发明内容
为解决上述技术问题,本发明实施例提供了一种确定冗余版本(RV,Redundancy Version)的方法、终端设备、网络设备、芯片、计算机可读存储介质、计算机程序产品以及计算机程序。
第一方面,提供了一种确定冗余版本RV的方法,应用于终端设备,所述方法包括:
确定至少一个PUSCH重复的时域资源以及确定所述至少一个PUSCH重复的RV;其中,PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0;
发送所述至少一个PUSCH重复。
第二方面,提供了一种终端设备,包括:
第一处理单元,确定至少一个PUSCH重复的时域资源以及确定所述至少一个PUSCH重复的RV;其中,PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0;
第一通信单元,发送所述至少一个PUSCH重复。
第三方面,提供了一种确定冗余版本RV的方法,应用于网络设备,所述方法包括:
接收终端设备发来的至少一个PUSCH重复;其中,所述PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0。
第四方面,提供了一种网络设备,包括:
第二通信单元,接收终端设备发来的至少一个PUSCH重复;其中,所述PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0。
第五方面,提供了一种终端设备,包括:处理器和用于存储能够在处理器上运行的计算机程序的存储器,
其中,该存储器用于存储计算机程序,所述处理器用于调用并运行所述存储器中存储的计算机程序,执行前述第一方面或其他各实现方式中的方法。
第六方面,提供了一种网络设备,包括:处理器和用于存储能够在处理器上运行的计算机程序的存储器,
其中,该存储器用于存储计算机程序,所述处理器用于调用并运行所述存储器中存储的计算机程序,执行前述第三方面或其他各实现方式中的方法。
第七方面,提供了一种芯片,包括:处理器,用于从存储器中调用并运行计算机程序,使得安装有所述芯片的设备执行第一方面、第三方面或其他各实现方式中的方法。
第八方面,提供了一种计算机可读存储介质,所述计算机可读存储介质用于存储计算机程序,所述计算机程序使得计算机执行如第一方面、第三方面或其他各实现方式中的方法。
第九方面,提供了一种计算机程序产品,包括计算机程序指令,该计算机程序指令使得计算机执行如第一方面、第三方面或其他各实现方式中的方法。
第十方面,提供了一种计算机程序,所述计算机程序使得计算机执行如第一方面、第三方面或其他各实现方式中的方法。
通过采用上述方案,确定PUSCH重复的时域资源以及确定PUSCH重复的RV,并且在多个PUSCH重复中存在至少一个未分裂的PUSCH重复采用RV0;如此,能够使得RV0至少可以映射在一个未分裂的PUSCH重复中,从而避免了原比特不完整传输的问题。
附图说明
图1a、1b为PUSCH重复的几种示意图;
图1c为是本发明实施例提供的通信系统架构的示意性图一;
图2是本发明实施例提供的一种确定冗余版本RV的方法流程示意图一;
图3-7为本发明实施例提供的几种确定PUSCH重复所对应的RV的场景示意图;
图8为本发明实施例一种终端设备组成结构示意图;
图9是本发明实施例提供的一种确定冗余版本RV的方法流程示意图二;
图10为本发明实施例一种网络设备组成结构示意图;
图11为本发明实施例提供的一种通信设备组成结构示意图;
图12是本发明实施例提供的一种芯片的示意性框图;
图13为是本发明实施例提供的通信系统架构的示意性图二。
具体实施方式
为了能够更加详尽地了解本发明实施例的特点与技术内容,下面结合附图对本发明实施例的实现进行详细阐述,所附附图仅供参考说明之用,并非用来限定本发明实施例。
下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行描述,显然,所描述的实施例是本发明一部分实施例,而不是全部的实施例。基于本发明中的实施例,本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。
本发明实施例的技术方案可以应用于各种通信系统,例如:全球移动通讯(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)系统、LTE频分双工(Frequency Division Duplex,FDD)系统、LTE时分双工(Time Division Duplex,TDD)、通用移动通信系统(Universal Mobile Telecommunication System,UMTS)、全球互联微波接入(Worldwide Interoperability for Microwave Access,WiMAX)通信系统或5G系统等。
示例性的,本发明实施例应用的通信系统100可以如图1c所示。该通信系统100可以包括网络设备110,网络设备110可以是与UE120(或称为通信终端、终端)通信的设备。网络设备110可以为特定的地理区域提供通信覆盖,并且可以与位于该覆盖区域内的UE进行通信。可选地,该网络设备110可以是GSM系统或CDMA系统中的网络设备(Base Transceiver Station,BTS),也可以是WCDMA系统中的网络设备(NodeB,NB),还可以是LTE系统中的演进型网络设备(Evolutional Node B,eNB或eNodeB), 或者是云无线接入网络(Cloud Radio Access Network,CRAN)中的无线控制器,或者该网络设备可以为移动交换中心、中继站、接入点、车载设备、可穿戴设备、集线器、交换机、网桥、路由器、5G网络中的网络侧设备或者未来演进的公共陆地移动网络(Public Land Mobile Network,PLMN)中的网络设备等。
该通信系统100还包括位于网络设备110覆盖范围内的至少一个UE120。作为在此使用的“UE”包括但不限于经由有线线路连接,如经由公共交换电话网络(Public Switched Telephone Networks,PSTN)、数字用户线路(Digital Subscriber Line,DSL)、数字电缆、直接电缆连接;和/或另一数据连接/网络;和/或经由无线接口,如,针对蜂窝网络、无线局域网(Wireless Local Area Network,WLAN)、诸如DVB-H网络的数字电视网络、卫星网络、AM-FM广播发送器;和/或另一UE的被设置成接收/发送通信信号的装置;和/或物联网(Internet of Things,IoT)设备。被设置成通过无线接口通信的UE可以被称为“无线通信终端”、“无线终端”或“移动终端”。
可选地,UE120之间可以进行终端直连(Device to Device,D2D)通信。
应理解,本文中术语“系统”和“网络”在本文中常被可互换使用。本文中术语“和/或”,仅仅是一种描述关联对象的关联关系,表示可以存在三种关系,例如,A和/或B,可以表示:单独存在A,同时存在A和B,单独存在B这三种情况。另外,本文中字符“/”,一般表示前后关联对象是一种“或”的关系。
为了能够更加详尽地了解本发明实施例的特点与技术内容,下面结合附图对本发明实施例的实现进行详细阐述,所附附图仅供参考说明之用,并非用来限定本发明实施例。
本发明实施例提供了一种确定冗余版本RV的方法,应用于终端设备,如图2所示,包括:
步骤21:确定至少一个PUSCH重复的时域资源以及确定所述至少一个PUSCH重复的RV;其中,PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0;
步骤22:发送所述至少一个PUSCH重复。
执行步骤21之前,终端设备还可以确定RV序列,以及PUSCH重复的时域资源。所述RV序列,由网络配置,或协议约定。
具体的,所述RV序列中包含有至少一个RV;比如,网络设备通过RRC信令配置RV序列为{0,2,3,1};又比如,RV顺序还可以包括:{0000}{0303}。
比如,在NR Rel15中,对于PUSCH重复的情况,RV序列为网络侧配 置。对于动态传输,通过下行控制信息(DCI,Downlink Control Information)指示每个PUSCH重复对应的RV。其中DCI中相关域的取值和RV顺序的对应关系见表1。
表1
Figure PCTCN2019086291-appb-000001
对于半静态传输(Type 1 Configured grant和Type 2 Configured grant),RV顺序通过RRC信令半静态配置,其中RV顺序包括三种:{0000}{0303}和{0231}。
所述PUSCH重复的时域资源,可以为网络设备通过上行(UL)授权(grant)来配置PUSCH重复的资源。
进一步的,网络设备还可以为终端设备配置重复周期,比如,通过RRC信令配置Configured grant周期,本实施例以配置为7符号symbol为例进行说明。
PUSCH重复为分裂的PUSCH或未分裂的PUSCH。其中,分裂的PUSCH指的若存在一个PUSCH重复跨时隙边界,那么该PUSCH就会被分裂;未分裂的PUSCH可以理解为不跨时隙,或者在一个时隙内的PUSCH。
例如,图3所示,以前两次传输为例进行说明,网络设备为用户1配置PUSCH的重复次数为2次,第一次传输中第一个PUSCH重复的时域位置为第n个时隙的第5-第12个符号,其中,PUSCH重复在时域上紧接着前一个PUSCH重复资源。根据周期为7symbols,第二次传输的第一个PUSCH重复跨边界,被分裂成两个PUSCH。
针对具体如何确定至少一个PUSCH重复的RV进行说明,首先可以对至少一个PUSCH重复进行划分,对PUSCH重复进行分组,即对每一次传输中的多个PUSCH重复进行分组得到多个集合,进而针对各个集合确定PUSCH重复的RV。具体的:
将一次传输的至少一个PUSCH重复分为第一集合和/或第二集合。
需要理解的是,本实施例中虽然称为第一集合和/或第二集合,实际上仅表征对至少一个PUSCH重复进行分类,可以划分出来两种类别,并且划分不同类别的时候,采用的参考参数或特征是不同的,下面结合多个场景进行详细说明:
场景1、
本场景中,划分PUSCH重复的参考可以为PUSCH是否为分裂的PUSCH重复,也就是说,第一集合中包含的PUSCH重复均为未分裂的 PUSCH重复;所述第二集合中包含的PUSCH重复为分裂的PUSCH重复。
一种实现方式中,对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;对于第二集合中的PUSCH重复采用RV0。
这样使得RV0至少可以映射在一个完整的PUSCH重复中,避免了原比特不完整传输的问题。基于条件的RV选择,使得未分裂的情况能够获得RV变化的合并增益。
也就是说,这种实现方式中,对于第一集合中包含的未分裂的PUSCH重复,按照网络配置的RV顺序映射。对于第二集合中包含的分裂的PUSCH重复采用RV0。对于第二集合中对每一个PUSCH重复可以直接确定均采用RV0;或者,还可以根据预设的默认RV序列{0000},对第二集合中的PUSCH重复进行映射,以确定每一个PUSCH重复均采用RV0。
根据该方法,对于图3的情况,对于第一次传输的两次完整PUSCH重复采用RV排序RV{0,2};对于第二次传输的第三次完整PUSCH重复采用RV排序RV{0},第一、二次分裂的PUSCH重复采用RV=0,如图4所示。又或者,可以参见图5,以RV序列为{0303},那么,第一次传输的两次完整PUSCH重复分别采用RV0、3;第二次传输的第1、2次分裂的PUSCH重复采用RV0,第3个PUSHC采用RV序列中的RV0。
另一种实现方式中,包括以下至少之一:
对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;
对于第二集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV。
换句话说,对于第一集合以及第二集合中的PUSCH重复,分别采用配置的RV序列确定每一个集合中PUSCH重复所对应的RV。虽然两个集合可以使用相同的RV序列,但是分别与RV序列进行对应,比如,图6所示,第一次传输中均为未分裂的PUSCH因此对应RV序列,那么仅存在第一集合,采用RV序列确定每一个PUSCH重复的RV为RV0、RV2;第二次传输中,分裂的PUSCH为第1、2次PUSCH重复,在第二集合中,剩余的第三次PUSCH重复在第一集合中,对第1、2次PUSCH重复采用RV序列确定分别为RV0、2;第三次PUSCH重复与RV序列进行对应后确定为RV0。
场景2、
本场景采用不同的划分集合的方式,为采用码率进行划分,具体的:
第一集合中包含的PUSCH重复为码率小于或等于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于第二预设门限值的PUSCH重复;
或者,
第一集合中包含的PUSCH重复为码率小于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于或等于第二预设门限 值的PUSCH重复。
本场景中,第二预设门限值为网络设备配置或者终端设备自身预设的。比如,第二预设门限值可以为0.93或者1。
比如,对于等效码率小于等于第二预设门限(例如0.93或1)的PUSCH重复,按照网络配置的RV顺序映射。对于等效码率大于第二预设门限的PUSCH重复采用RV0。
根据该方法,对于图3的情况,对于第一次传输的两次完整PUSCH重复,等效码率小于第一门限值,采用RV排序RV{0,2};对于第二次传输的第三次PUSCH重复,等效码率小于第一门限,采用RV排序RV{0},第一、二次分裂的PUSCH重复,等效码率大于第一门限,采用RV=0,得到的结果如图4所示。
同样的,本场景也能够对第一集合以及第二集合分别采用RV序列确定每一个PUSCH重复对应的RV。其对应方法与场景1相同,这里不再赘述。
场景3、
本场景中,所述第一集合中包含的为一次传输中第一个未分裂的PUSCH重复及其之后的PUSCH重复;
所述第二集合中包含的为一次传输中第一个未分裂的PUSCH重复之前的PUSCH重复。
比如,在一次传输中存在3个PUSCH重复,其中前两个为分裂的PUSCH重复,那么第3个PUSCH重复前两个PUSCH重复均采用RV0;
对于一次传输的至少一个PUSCH重复,确定第一个未分裂的PUSCH及其之后的PUSCH采用RV序列确定PUSCH重复对应的RV;比如,当前存在2个PUSCH重复,第1个PUSCH重复为未分裂的PUSCH,那么第1、2个PUSCH分别对应按照RV序列中的第1、2个RV。
以图4为例进行说明,第一个包含完整PUSCH重复以及之前的PUSCH重复均采用RV0,从第一个包含完整PUSCH的开始,按照网络配置的RV顺序映射。根据这个规则,图4所示的第二次传输的第一/二/三PUSCH重复采用RV0,从而使得RV0至少可以映射在一个完整的PUSCH重复中,避免了原比特不完整传输的问题。
同样的,本场景也能够对第一集合以及第二集合分别采用RV序列确定每一个PUSCH重复对应的RV。其对应方法与场景1相同,这里不再赘述。
场景4、
所述第一集合中包含的PUSCH重复的时域长度大于或等于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度为码率小于第三预设门限值的PUSCH重复;
或者,
所述第一集合中包含的PUSCH重复的时域长度大于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度小于或等 于第三预设门限值的PUSCH重复。
本场景中,第三预设门限值可以理解为网络设备配置的、或者是预设的。确定第三预设门限值的一种方式可以为:PUSCH的初始的时域长度。该PUSCH的初始时域长度可以为网络设备为终端设备配置的参数。
比如,一种实现方式中,对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;对于第二集合中的PUSCH重复采用RV0。
这样使得RV0至少可以映射在一个完整的PUSCH重复中,避免了原比特不完整传输的问题。基于条件的RV选择,使得未分裂的情况能够获得RV变化的合并增益。
也就是说,当前一次传输中包含有两个PUSCH,长度均大于第三预设门限值,那么本次传输的PUSCH重复均划分至第一集合,然后对第一集合中的PUSCH重复按照时域顺序与RV序列中的RV进行映射,确定每一个PUSCH重复的RV;或者,一次传输中包含有3个PUSCH重复,其中1、2次PUSCH重复的时域长度小于第三预设门限值,第3次大于第三预设门限值,那么第1、2PUSCH重复划分至第二集合,第3PUSCH划分至第一集合;然后分别按照两个集合的规定进行映射。
另一种实现方式中,包括以下至少之一:
对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;
对于第二集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV。
换句话说,对于第一集合以及第二集合中的PUSCH重复,分别采用配置的RV序列确定每一个集合中PUSCH重复所对应的RV。虽然两个集合可以使用相同的RV序列,但是分别与RV序列进行对应。
还需要指出的是,本实施例中所述的传输可以为动态传输,也可以为半静态传输。
在前述场景基础上,本实施例还可以提供以下处理:
对于半静态传输且周期小于时隙长度的配置,所有PUSCH重复都采用RV0。也就是说,对于半静态传输周期小于一个时隙长度的配置中,全部PUSCH均采用RV0;另外,还可以理解的是,对于半静态传输且周期大于或等于1个时隙长度的配置,可以根据网络设备配置的RV序列确定PUSCH重复的RV。从而避免无效传输。
在现有技术中,对于动态传输,可以通过合理指示RV,使得至少一个完整PUSCH重复能够采用RV0,例如,当第一个PUSCH重复会被分裂,且分裂后的第一PUSCH重复的等效码率大于1,则网络侧指示终端RV index=2或3或1,使得RV0用在第一PUSCH重复以外的PUSCH重复中。
对于Configured grant,RV是半静态指示的,且PUSCH重复分裂情况 是变化的。如图7所示,对于一个周期为7symbols,第一次传输的第一个PUSCH重复在时隙n的第6个符号-时隙n的第8个符号,重复两次。根据周期为7symbols,第二次传输的第一个PUSCH重复跨边界,因此被分裂。对于第二次传输的第一个PUSCH重复由于分裂,其等效码率大于1,因此无法把原比特完全发送出去。
通过采用本实施例提供的方案,使得RV0至少可以映射在一个未分裂的PUSCH重复中,从而避免了原比特不完整传输的问题。
另外,本实施例所提供的基于一定的条件对PUSCH重复选取RV,使得未分裂的情况能够获得RV变化的合并增益。
本发明实施例提供了一种终端设备,如图8所示,包括:
第一处理单元41,确定至少一个PUSCH重复的时域资源以及确定所述至少一个PUSCH重复的RV;其中,PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0;
第一通信单元42,发送所述至少一个PUSCH重复。
第一处理单元41,还可以确定RV序列,以及PUSCH重复的时域资源。所述RV序列,由网络配置,或协议约定。
所述PUSCH重复的时域资源,可以为网络设备通过上行(UL)授权(grant)来配置PUSCH重复的资源。
进一步的,网络设备还可以为终端设备配置重复周期,比如,通过RRC信令配置Configured grant周期,本实施例以配置为7符号symbol为例进行说明。
PUSCH重复为分裂的PUSCH或未分裂的PUSCH。其中,分裂的PUSCH指的若存在一个PUSCH重复跨时隙边界,那么该PUSCH就会被分裂;未分裂的PUSCH可以理解为不跨时隙,或者在一个时隙内的PUSCH。
针对具体如何确定至少一个PUSCH重复的RV进行说明,首先可以对至少一个PUSCH重复进行划分,对PUSCH重复进行分组,即对每一次传输中的多个PUSCH重复进行分组得到多个集合,进而针对各个集合确定PUSCH重复的RV。具体的:
将一次传输的至少一个PUSCH重复分为第一集合和/或第二集合。
需要理解的是,本实施例中虽然称为第一集合和/或第二集合,实际上仅表征对至少一个PUSCH重复进行分类,可以划分出来两种类别,并且划分不同类别的时候,采用的参考参数或特征是不同的,下面结合多个场景进行详细说明:
场景1、
本场景中,划分PUSCH重复的参考可以为PUSCH是否为分裂的PUSCH重复,也就是说,第一集合中包含的PUSCH重复均为未分裂的 PUSCH重复;所述第二集合中包含的PUSCH重复为分裂的PUSCH重复。
一种实现方式中,第一处理单元41,对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;对于第二集合中的PUSCH重复采用RV0。
这样使得RV0至少可以映射在一个完整的PUSCH重复中,避免了原比特不完整传输的问题。基于条件的RV选择,使得未分裂的情况能够获得RV变化的合并增益。
也就是说,这种实现方式中,对于第一集合中包含的未分裂的PUSCH重复,按照网络配置的RV顺序映射。对于第二集合中包含的分裂的PUSCH重复采用RV0。根据该方法,对于图3的情况,对于第一次传输的两次完整PUSCH重复采用RV排序RV{0,2};对于第二次传输的第三次完整PUSCH重复采用RV排序RV{0},第一、二次分裂的PUSCH重复采用RV=0,如图4所示。
另一种实现方式中,第一处理单元41,执行以下至少之一:
对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;
对于第二集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV。
换句话说,对于第一集合以及第二集合中的PUSCH重复,分别采用配置的RV序列确定每一个集合中PUSCH重复所对应的RV。虽然两个集合可以使用相同的RV序列,但是分别与RV序列进行对应,比如,图6所示,第一次传输中均为未分裂的PUSCH因此对应RV序列,那么仅存在第一集合,采用RV序列确定每一个PUSCH重复的RV为RV0、RV2;第二次传输中,分裂的PUSCH为第1、2次PUSCH重复,在第二集合中,剩余的第三次PUSCH重复在第一集合中,对第1、2次PUSCH重复采用RV序列确定分别为RV0、2;第三次PUSCH重复与RV序列进行对应后确定为RV0。
场景2、
本场景采用不同的划分集合的方式,为采用码率进行划分,具体的:
第一集合中包含的PUSCH重复为码率小于或等于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于第二预设门限值的PUSCH重复;
或者,
第一集合中包含的PUSCH重复为码率小于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于或等于第二预设门限值的PUSCH重复。
本场景中,第二预设门限值为网络设备配置或者终端设备自身预设的。比如,第二预设门限值可以为0.93或者1。
比如,对于等效码率小于等于第二预设门限(例如0.93或1)的PUSCH 重复,按照网络配置的RV顺序映射。对于等效码率大于第二预设门限的PUSCH重复采用RV0。
同样的,本场景也能够对第一集合以及第二集合分别采用RV序列确定每一个PUSCH重复对应的RV。其对应方法与场景1相同,这里不再赘述。
场景3、
本场景中,所述第一集合中包含的为一次传输中第一个未分裂的PUSCH重复及其之后的PUSCH重复;
所述第二集合中包含的为一次传输中第一个未分裂的PUSCH重复之前的PUSCH重复。
比如,在一次传输中存在3个PUSCH重复,其中前两个为分裂的PUSCH重复,那么第3个PUSCH重复前两个PUSCH重复均采用RV0;
对于一次传输的至少一个PUSCH重复,确定第一个未分裂的PUSCH及其之后的PUSCH采用RV序列确定PUSCH重复对应的RV;比如,当前存在2个PUSCH重复,第1个PUSCH重复为未分裂的PUSCH,那么第1、2个PUSCH分别对应按照RV序列中的第1、2个RV。
同样的,本场景也能够对第一集合以及第二集合分别采用RV序列确定每一个PUSCH重复对应的RV。其对应方法与场景1相同,这里不再赘述。
场景4、
所述第一集合中包含的PUSCH重复的时域长度大于或等于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度为码率小于第三预设门限值的PUSCH重复;
或者,
所述第一集合中包含的PUSCH重复的时域长度大于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度小于或等于第三预设门限值的PUSCH重复。
本场景中,第三预设门限值可以理解为网络设备配置的、或者是预设的。确定第三预设门限值的一种方式可以为:PUSCH的初始的时域长度。该PUSCH的初始时域长度可以为网络设备为终端设备配置的参数。
比如,一种实现方式中,对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;对于第二集合中的PUSCH重复采用RV0。
这样使得RV0至少可以映射在一个完整的PUSCH重复中,避免了原比特不完整传输的问题。基于条件的RV选择,使得未分裂的情况能够获得RV变化的合并增益。
另一种实现方式中,包括以下至少之一:
对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;
对于第二集合中的PUSCH重复采用配置的RV序列,确定PUSCH重 复所对应的RV。
换句话说,对于第一集合以及第二集合中的PUSCH重复,分别采用配置的RV序列确定每一个集合中PUSCH重复所对应的RV。虽然两个集合可以使用相同的RV序列,但是分别与RV序列进行对应。
还需要指出的是,本实施例中所述的传输可以为动态传输,也可以为半静态传输。
在前述场景基础上,本实施例还可以提供以下处理:
对于半静态传输且周期小于时隙长度的配置,所有PUSCH重复都采用RV0。也就是说,对于半静态传输周期小于一个时隙长度的配置中,全部PUSCH均采用RV0;另外,还可以理解的是,对于半静态传输且周期大于或等于1个时隙长度的配置,可以根据网络设备配置的RV序列确定PUSCH重复的RV。从而避免无效传输。
通过采用本实施例提供的方案,使得RV0至少可以映射在一个未分裂的PUSCH重复中,从而避免了原比特不完整传输的问题。
另外,本实施例所提供的基于一定的条件对PUSCH重复选取RV,使得未分裂的情况能够获得RV变化的合并增益。
本发明实施例提供了一种确定冗余版本RV的方法,应用于网络设备,如图9所示,包括:
步骤41:接收终端设备发来的至少一个PUSCH重复;其中,所述PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0。
另外,网络设备还会为终端设备配置所述RV序列。
网络设备通过上行(UL)授权(grant)来为终端设备配置PUSCH重复的资源。
进一步的,网络设备还可以为终端设备配置重复周期,比如,通过RRC信令配置Configured grant周期,本实施例以配置为7符号symbol为例进行说明。
PUSCH重复为分裂的PUSCH或未分裂的PUSCH。其中,分裂的PUSCH指的若存在一个PUSCH重复跨时隙边界,那么该PUSCH就会被分裂;未分裂的PUSCH可以理解为不跨时隙,或者在一个时隙内的PUSCH。
针对具体如何确定至少一个PUSCH重复的RV进行说明,首先可以对接收到的至少一个PUSCH重复进行划分,对PUSCH重复进行分组,针对各个集合确定PUSCH重复所采用的RV。具体的:
将接收到的一次传输的至少一个PUSCH重复,分为第一集合和/或第二集合。
需要理解的是,本实施例中虽然称为第一集合和/或第二集合,实际上仅表征对至少一个PUSCH重复进行分类,可以划分出来两种类别,并且划 分不同类别的时候,采用的参考参数或特征是不同的,下面结合多个场景进行详细说明:
场景1、
本场景中,划分PUSCH重复的参考可以为PUSCH是否为分裂的PUSCH重复,也就是说,第一集合中包含的PUSCH重复均为未分裂的PUSCH重复;所述第二集合中包含的PUSCH重复为分裂的PUSCH重复。
一种实现方式中,基于RV序列确定接收到的第一集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据;
确定第二集合中的PUSCH重复采用RV0,解析PUSCH重复中的数据。
这样使得RV0至少映射在一个完整的PUSCH重复中,避免了原比特不完整传输的问题。基于条件的RV选择,使得未分裂的情况能够获得RV变化的合并增益。
也就是说,这种实现方式中,对于第一集合中包含的未分裂的PUSCH重复,按照网络配置的RV顺序映射。对于第二集合中包含的分裂的PUSCH重复采用RV0。根据该方法,对于图3的情况,对于第一次传输的两次完整PUSCH重复采用RV排序RV{0,2};对于第二次传输的第三次完整PUSCH重复采用RV排序RV{0},第一、二次分裂的PUSCH重复采用RV=0,如图4所示。
另一种实现方式中,包括以下至少之一:
基于RV序列确定接收到的第一集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据;
基于RV序列确定接收到的第二集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据。
换句话说,对于第一集合以及第二集合中的PUSCH重复,分别采用配置的RV序列确定每一个集合中PUSCH重复所对应的RV。虽然两个集合可以使用相同的RV序列,但是分别与RV序列进行对应,比如,图6所示,第一次传输中均为未分裂的PUSCH因此对应RV序列,那么仅存在第一集合,采用RV序列确定每一个PUSCH重复的RV为RV0、RV2;第二次传输中,分裂的PUSCH为第1、2次PUSCH重复,在第二集合中,剩余的第三次PUSCH重复在第一集合中,对第1、2次PUSCH重复采用RV序列确定分别为RV0、2;第三次PUSCH重复与RV序列进行对应后确定为RV0。
场景2、
本场景采用不同的划分集合的方式,为采用码率进行划分,具体的:
第一集合中包含的PUSCH重复为码率小于或等于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于第二预设门限值的PUSCH重复;
或者,
第一集合中包含的PUSCH重复为码率小于第二预设门限值的PUSCH 重复;所述第二集合中包含的PUSCH重复为码率大于或等于第二预设门限值的PUSCH重复。
本场景中,第二预设门限值为网络设备配置或者终端设备自身预设的。比如,第二预设门限值可以为0.93或者1。
比如,对于等效码率小于等于第二预设门限(例如0.93或1)的PUSCH重复,按照网络配置的RV顺序映射。对于等效码率大于第二预设门限的PUSCH重复采用RV0。
同样的,本场景也能够对第一集合以及第二集合中的PUSCH重复所对应的RV进行确定。其方法与场景1相同,这里不再赘述。
场景3、
本场景中,所述第一集合中包含的为一次传输中第一个未分裂的PUSCH重复及其之后的PUSCH重复;
所述第二集合中包含的为一次传输中第一个未分裂的PUSCH重复之前的PUSCH重复。
比如,在一次传输中存在3个PUSCH重复,其中前两个为分裂的PUSCH重复,那么第3个PUSCH重复前两个PUSCH重复均采用RV0;
对于一次传输的至少一个PUSCH重复,确定第一个未分裂的PUSCH及其之后的PUSCH采用RV序列确定PUSCH重复对应的RV;比如,当前存在2个PUSCH重复,第1个PUSCH重复为未分裂的PUSCH,那么第1、2个PUSCH分别对应按照RV序列中的第1、2个RV。
同样的,本场景也能够对第一集合以及第二集合中的PUSCH重复所对应的RV进行确定。其方法与场景1相同,这里不再赘述。
场景4、
所述第一集合中包含的PUSCH重复的时域长度大于或等于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度为码率小于第三预设门限值的PUSCH重复;
或者,
所述第一集合中包含的PUSCH重复的时域长度大于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度小于或等于第三预设门限值的PUSCH重复。
本场景中,第三预设门限值可以理解为网络设备配置的、或者是预设的。确定第三预设门限值的一种方式可以为:PUSCH的初始的时域长度。该PUSCH的初始时域长度可以为网络设备为终端设备配置的参数。
比如,一种实现方式中,对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;对于第二集合中的PUSCH重复采用RV0。
这样使得RV0至少可以映射在一个完整的PUSCH重复中,避免了原比特不完整传输的问题。基于条件的RV选择,使得未分裂的情况能够获得 RV变化的合并增益。
同样的,本场景也能够对第一集合以及第二集合中的PUSCH重复所对应的RV进行确定。其方法与场景1相同,这里不再赘述。
还需要指出的是,本实施例中所述的传输可以为动态传输,也可以为半静态传输。
在前述场景基础上,本实施例还可以提供以下处理:
对于半静态传输且周期小于时隙长度的配置,确定接收到的所有PUSCH重复都采用RV0。也就是说,对于半静态传输周期小于一个时隙长度的配置中,全部PUSCH均采用RV0;另外,还可以理解的是,对于半静态传输且周期大于或等于1个时隙长度的配置,可以根据RV序列确定PUSCH重复的RV。从而避免无效传输。
通过采用本实施例提供的方案,使得RV0至少可以映射在一个未分裂的PUSCH重复中,从而避免了原比特不完整传输的问题。
另外,本实施例所提供的基于一定的条件对PUSCH重复选取RV,使得未分裂的情况能够获得RV变化的合并增益。
本发明实施例提供了一种网络设备,如图10所示,包括:
第二通信单元51,接收终端设备发来的至少一个PUSCH重复;其中,所述PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0。
另外,网络设备还会为终端设备配置所述RV序列。
网络设备通过上行(UL)授权(grant)来为终端设备配置PUSCH重复的资源。
进一步的,网络设备还可以为终端设备配置重复周期,比如,通过RRC信令配置Configured grant周期,本实施例以配置为7符号symbol为例进行说明。
PUSCH重复为分裂的PUSCH或未分裂的PUSCH。其中,分裂的PUSCH指的若存在一个PUSCH重复跨时隙边界,那么该PUSCH就会被分裂;未分裂的PUSCH可以理解为不跨时隙,或者在一个时隙内的PUSCH。
针对具体如何确定至少一个PUSCH重复的RV进行说明,首先可以对接收到的至少一个PUSCH重复进行划分,对PUSCH重复进行分组,针对各个集合确定PUSCH重复所采用的RV。具体的:
所述网络设备还包括:
第二处理单元52,将接收到的一次传输的至少一个PUSCH重复,分为第一集合和/或第二集合。
需要理解的是,本实施例中虽然称为第一集合和/或第二集合,实际上仅表征对至少一个PUSCH重复进行分类,可以划分出来两种类别,并且划分不同类别的时候,采用的参考参数或特征是不同的,下面结合多个场景 进行详细说明:
场景1、
本场景中,划分PUSCH重复的参考可以为PUSCH是否为分裂的PUSCH重复,也就是说,第一集合中包含的PUSCH重复均为未分裂的PUSCH重复;所述第二集合中包含的PUSCH重复为分裂的PUSCH重复。
一种实现方式中,第二处理单元52,基于RV序列确定接收到的第一集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据;
确定第二集合中的PUSCH重复采用RV0,解析PUSCH重复中的数据。
这样使得RV0至少映射在一个完整的PUSCH重复中,避免了原比特不完整传输的问题。基于条件的RV选择,使得未分裂的情况能够获得RV变化的合并增益。
另一种实现方式中,第二处理单元52,包括以下至少之一:
基于RV序列确定接收到的第一集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据;
基于RV序列确定接收到的第二集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据。
场景2、
本场景采用不同的划分集合的方式,为采用码率进行划分,具体的:
第一集合中包含的PUSCH重复为码率小于或等于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于第二预设门限值的PUSCH重复;
或者,
第一集合中包含的PUSCH重复为码率小于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于或等于第二预设门限值的PUSCH重复。
本场景中,第二预设门限值为网络设备配置或者终端设备自身预设的。比如,第二预设门限值可以为0.93或者1。
比如,对于等效码率小于等于第二预设门限(例如0.93或1)的PUSCH重复,按照网络配置的RV顺序映射。对于等效码率大于第二预设门限的PUSCH重复采用RV0。
同样的,本场景也能够对第一集合以及第二集合中的PUSCH重复所对应的RV进行确定。其方法与场景1相同,这里不再赘述。
场景3、
本场景中,所述第一集合中包含的为一次传输中第一个未分裂的PUSCH重复及其之后的PUSCH重复;
所述第二集合中包含的为一次传输中第一个未分裂的PUSCH重复之前的PUSCH重复。
比如,在一次传输中存在3个PUSCH重复,其中前两个为分裂的 PUSCH重复,那么第3个PUSCH重复前两个PUSCH重复均采用RV0;
对于一次传输的至少一个PUSCH重复,确定第一个未分裂的PUSCH及其之后的PUSCH采用RV序列确定PUSCH重复对应的RV;比如,当前存在2个PUSCH重复,第1个PUSCH重复为未分裂的PUSCH,那么第1、2个PUSCH分别对应按照RV序列中的第1、2个RV。
同样的,本场景也能够对第一集合以及第二集合中的PUSCH重复所对应的RV进行确定。其方法与场景1相同,这里不再赘述。
场景4、
所述第一集合中包含的PUSCH重复的时域长度大于或等于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度为码率小于第三预设门限值的PUSCH重复;
或者,
所述第一集合中包含的PUSCH重复的时域长度大于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度小于或等于第三预设门限值的PUSCH重复。
本场景中,第三预设门限值可以理解为网络设备配置的、或者是预设的。确定第三预设门限值的一种方式可以为:PUSCH的初始的时域长度。该PUSCH的初始时域长度可以为网络设备为终端设备配置的参数。
比如,一种实现方式中,对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;对于第二集合中的PUSCH重复采用RV0。
这样使得RV0至少可以映射在一个完整的PUSCH重复中,避免了原比特不完整传输的问题。基于条件的RV选择,使得未分裂的情况能够获得RV变化的合并增益。
同样的,本场景也能够对第一集合以及第二集合中的PUSCH重复所对应的RV进行确定。其方法与场景1相同,这里不再赘述。
还需要指出的是,本实施例中所述的传输可以为动态传输,也可以为半静态传输。
在前述场景基础上,本实施例还可以提供以下处理:
对于半静态传输且周期小于时隙长度的配置,确定接收到的所有PUSCH重复都采用RV0。也就是说,对于半静态传输周期小于一个时隙长度的配置中,全部PUSCH均采用RV0;另外,还可以理解的是,对于半静态传输且周期大于或等于1个时隙长度的配置,可以根据RV序列确定PUSCH重复的RV。从而避免无效传输。
通过采用本实施例提供的方案,使得RV0至少可以映射在一个未分裂的PUSCH重复中,从而避免了原比特不完整传输的问题。
另外,本实施例所提供的基于一定的条件对PUSCH重复选取RV,使得未分裂的情况能够获得RV变化的合并增益。
图11是本发明实施例提供的一种通信设备700示意性结构图,本实施例中的通信设备可以具体为前述实施例中的终端设备或网络设备。图11所示的通信设备700包括处理器710,处理器710可以从存储器中调用并运行计算机程序,以实现本发明实施例中的方法。
可选地,如图11所示,通信设备700还可以包括存储器720。其中,处理器710可以从存储器720中调用并运行计算机程序,以实现本发明实施例中的方法。
其中,存储器720可以是独立于处理器710的一个单独的器件,也可以集成在处理器710中。
可选地,如图11所示,通信设备700还可以包括收发器730,处理器710可以控制该收发器730与其他设备进行通信,具体地,可以向其他设备发送信息或数据,或接收其他设备发送的信息或数据。
其中,收发器730可以包括发射机和接收机。收发器730还可以进一步包括天线,天线的数量可以为一个或多个。
可选地,该通信设备700具体可为本发明实施例的网络设备,并且该通信设备700可以实现本发明实施例的各个方法中由网络设备实现的相应流程,为了简洁,在此不再赘述。
可选地,该通信设备700具体可为本发明实施例的终端设备、或者网络设备,并且该通信设备700可以实现本发明实施例的各个方法中由移动终端/终端设备实现的相应流程,为了简洁,在此不再赘述。
图12是本发明实施例的芯片的示意性结构图。图12所示的芯片800包括处理器810,处理器810可以从存储器中调用并运行计算机程序,以实现本发明实施例中的方法。
可选地,如图12所示,芯片800还可以包括存储器820。其中,处理器810可以从存储器820中调用并运行计算机程序,以实现本发明实施例中的方法。
其中,存储器820可以是独立于处理器810的一个单独的器件,也可以集成在处理器810中。
可选地,该芯片800还可以包括输入接口830。其中,处理器810可以控制该输入接口830与其他设备或芯片进行通信,具体地,可以获取其他设备或芯片发送的信息或数据。
可选地,该芯片800还可以包括输出接口840。其中,处理器810可以控制该输出接口840与其他设备或芯片进行通信,具体地,可以向其他设备或芯片输出信息或数据。
可选地,该芯片可应用于本发明实施例中的终端设备或网络设备,并且该芯片可以实现本发明实施例的各个方法中由终端设备实现的相应流程,为了简洁,在此不再赘述。
应理解,本发明实施例提到的芯片还可以称为系统级芯片,系统芯片,芯片系统或片上系统芯片等。
应理解,本发明实施例的处理器可能是一种集成电路芯片,具有信号的处理能力。在实现过程中,上述方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器可以是通用处理器、数字信号处理器(Digital Signal Processor,DSP)、专用集成电路(Application Specific Integrated Circuit,ASIC)、现成可编程门阵列(Field Programmable Gate Array,FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。可以实现或者执行本发明实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。结合本发明实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成,或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器,闪存、只读存储器,可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器,处理器读取存储器中的信息,结合其硬件完成上述方法的步骤。
可以理解,本发明实施例中的存储器可以是易失性存储器或非易失性存储器,或可包括易失性和非易失性存储器两者。其中,非易失性存储器可以是只读存储器(Read-Only Memory,ROM)、可编程只读存储器(Programmable ROM,PROM)、可擦除可编程只读存储器(Erasable PROM,EPROM)、电可擦除可编程只读存储器(Electrically EPROM,EEPROM)或闪存。易失性存储器可以是随机存取存储器(Random Access Memory,RAM),其用作外部高速缓存。通过示例性但不是限制性说明,许多形式的RAM可用,例如静态随机存取存储器(Static RAM,SRAM)、动态随机存取存储器(Dynamic RAM,DRAM)、同步动态随机存取存储器(Synchronous DRAM,SDRAM)、双倍数据速率同步动态随机存取存储器(Double Data Rate SDRAM,DDR SDRAM)、增强型同步动态随机存取存储器(Enhanced SDRAM,ESDRAM)、同步连接动态随机存取存储器(Synchlink DRAM,SLDRAM)和直接内存总线随机存取存储器(Direct Rambus RAM,DR RAM)。应注意,本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
应理解,上述存储器为示例性但不是限制性说明,例如,本发明实施例中的存储器还可以是静态随机存取存储器(static RAM,SRAM)、动态随机存取存储器(dynamic RAM,DRAM)、同步动态随机存取存储器(synchronous DRAM,SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM,DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM,ESDRAM)、同步连接动态随机存取存储器(synch link DRAM,SLDRAM)以及直接内存总线随机存取存储器(Direct Rambus  RAM,DR RAM)等等。也就是说,本发明实施例中的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
图13是本申请实施例提供的一种通信系统1400的示意性框图。如图13所示,该通信系统1400包括终端设备1410和网络设备1420。
其中,该终端设备1410可以用于实现上述方法中由终端设备实现的相应的功能,以及该网络设备1420可以用于实现上述方法中由网络设备实现的相应的功能为了简洁,在此不再赘述。
本发明实施例还提供了一种计算机可读存储介质,用于存储计算机程序。
可选的,该计算机可读存储介质可应用于本发明实施例中的网络设备,并且该计算机程序使得计算机执行本发明实施例的各个方法中由网络设备实现的相应流程,为了简洁,在此不再赘述。
可选地,该计算机可读存储介质可应用于本发明实施例中的终端设备,并且该计算机程序使得计算机执行本发明实施例的各个方法中由移动终端/终端设备实现的相应流程,为了简洁,在此不再赘述。
本发明实施例还提供了一种计算机程序产品,包括计算机程序指令。
可选的,该计算机程序产品可应用于本发明实施例中的网络设备,并且该计算机程序指令使得计算机执行本发明实施例的各个方法中由网络设备实现的相应流程,为了简洁,在此不再赘述。
可选地,该计算机程序产品可应用于本发明实施例中的移动终端/终端设备,并且该计算机程序指令使得计算机执行本发明实施例的各个方法中由移动终端/终端设备实现的相应流程,为了简洁,在此不再赘述。
本发明实施例还提供了一种计算机程序。
可选的,该计算机程序可应用于本发明实施例中的网络设备,当该计算机程序在计算机上运行时,使得计算机执行本发明实施例的各个方法中由网络设备实现的相应流程,为了简洁,在此不再赘述。
可选地,该计算机程序可应用于本发明实施例中的移动终端/终端设备,当该计算机程序在计算机上运行时,使得计算机执行本发明实施例的各个方法中由移动终端/终端设备实现的相应流程,为了简洁,在此不再赘述。
本领域普通技术人员可以意识到,结合本文中所公开的实施例描述的各示例的单元及算法步骤,能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行,取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能,但是这种实现不应认为超出本发明的范围。
所属领域的技术人员可以清楚地了解到,为描述的方便和简洁,上述描述的系统、装置和单元的具体工作过程,可以参考前述方法实施例中的对应过程,在此不再赘述。
在本发明所提供的几个实施例中,应该理解到,所揭露的系统、装置和方法,可以通过其它的方式实现。例如,以上所描述的装置实施例仅仅是示意性的,例如,所述单元的划分,仅仅为一种逻辑功能划分,实际实现时可以有另外的划分方式,例如多个单元或组件可以结合或者可以集成到另一个系统,或一些特征可以忽略,或不执行。另一点,所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口,装置或单元的间接耦合或通信连接,可以是电性,机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的,作为单元显示的部件可以是或者也可以不是物理单元,即可以位于一个地方,或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外,在本发明各个实施例中的各功能单元可以集成在一个处理单元中,也可以是各个单元单独物理存在,也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时,可以存储在一个计算机可读取存储介质中。基于这样的理解,本发明的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来,该计算机软件产品存储在一个存储介质中,包括若干指令用以使得一台计算机设备(可以是个人计算机,服务器,或者网络设备等)执行本发明各个实施例所述方法的全部或部分步骤。而前述的存储介质包括:U盘、移动硬盘、只读存储器(Read-Only Memory,)ROM、随机存取存储器(Random Access Memory,RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述,仅为本发明的具体实施方式,但本发明的保护范围并不局限于此,任何熟悉本技术领域的技术人员在本发明揭露的技术范围内,可轻易想到变化或替换,都应涵盖在本发明的保护范围之内。因此,本发明的保护范围应所述以权利要求的保护范围为准。

Claims (51)

  1. 一种确定冗余版本RV的方法,应用于终端设备,所述方法包括:
    确定至少一个PUSCH重复的时域资源以及确定所述至少一个PUSCH重复的RV;其中,PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0;
    发送所述至少一个PUSCH重复。
  2. 根据权利要求1所述的方法,其中,所述方法还包括:
    将一次传输的至少一个PUSCH重复分为第一集合和/或第二集合。
  3. 根据权利要求2所述的方法,其中,所述确定所述至少一个PUSCH重复的RV,包括以下至少之一:
    对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;
    对于第二集合中的PUSCH重复采用RV0。
  4. 根据权利要求2所述的方法,其中,所述确定所述至少一个PUSCH重复的RV,包括以下至少之一:
    对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;
    对于第二集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV。
  5. 根据权利要求2-4任一项所述的方法,其中,
    所述第一集合中包含的PUSCH重复均为未分裂的PUSCH重复;
    所述第二集合中包含的PUSCH重复为分裂的PUSCH重复。
  6. 根据权利要求2-4任一项所述的方法,其中,
    所述第一集合中包含的PUSCH重复为码率小于或等于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于第二预设门限值的PUSCH重复;
    或者,
    所述第一集合中包含的PUSCH重复为码率小于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于或等于第二预设门限值的PUSCH重复。
  7. 根据权利要求2-4任一项所述的方法,其中,
    所述第一集合中包含的PUSCH重复的时域长度大于或等于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度为码率小于第三预设门限值的PUSCH重复;
    或者,
    所述第一集合中包含的PUSCH重复的时域长度大于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度小于或等 于第三预设门限值的PUSCH重复。
  8. 根据权利要求2-4任一项所述的方法,其中,
    所述第一集合中包含的为一次传输中第一个未分裂的PUSCH重复及其之后的PUSCH重复;
    所述第二集合中包含的为一次传输中第一个未分裂的PUSCH重复之前的PUSCH重复。
  9. 根据权利要求3-8任一项所述的方法,其中,所述RV序列,由网络配置,或协议约定。
  10. 根据权利要求1-9任一项所述的方法,其中,所述方法还包括:
    对于半静态传输且周期小于时隙长度的配置,所有PUSCH重复都采用RV0。
  11. 根据权利要求3-5任一项所述的方法,其中,所述传输为动态传输、或半静态传输。
  12. 一种终端设备,包括:
    第一处理单元,确定至少一个PUSCH重复的时域资源以及确定所述至少一个PUSCH重复的RV;其中,PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0;
    第一通信单元,发送所述至少一个PUSCH重复。
  13. 根据权利要求12所述的终端设备,其中,所述第一处理单元,将一次传输的至少一个PUSCH重复分为第一集合和/或第二集合。
  14. 根据权利要求13所述的终端设备,其中,所述第一处理单元,执行以下至少之一:
    对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;
    对于第二集合中的PUSCH重复采用RV0。
  15. 根据权利要求13所述的终端设备,其中,所述第一处理单元,执行以下至少之一:
    对于第一集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV;
    对于第二集合中的PUSCH重复采用配置的RV序列,确定PUSCH重复所对应的RV。
  16. 根据权利要求13-15任一项所述的终端设备,其中,
    所述第一集合中包含的PUSCH重复均为未分裂的PUSCH重复;
    所述第二集合中包含的PUSCH重复为分裂的PUSCH重复。
  17. 根据权利要求13-15任一项所述的终端设备,其中,
    所述第一集合中包含的PUSCH重复为码率小于或等于第二预设门限 值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于第二预设门限值的PUSCH重复;
    或者,
    所述第一集合中包含的PUSCH重复为码率小于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于或等于第二预设门限值的PUSCH重复。
  18. 根据权利要求13-15任一项所述的终端设备,其中,
    所述第一集合中包含的PUSCH重复的时域长度大于或等于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度为码率小于第三预设门限值的PUSCH重复;
    或者,
    所述第一集合中包含的PUSCH重复的时域长度大于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度小于或等于第三预设门限值的PUSCH重复。
  19. 根据权利要求13-15任一项所述的终端设备,其中,
    所述第一集合中包含的为一次传输中第一个未分裂的PUSCH重复及其之后的PUSCH重复;
    所述第二集合中包含的为一次传输中第一个未分裂的PUSCH重复之前的PUSCH重复。
  20. 根据权利要求13-19任一项所述的终端设备,
    所述RV序列,由网络配置,或协议约定。
  21. 根据权利要求12-20任一项所述的终端设备,其中,所述第一处理单元,对于半静态传输且周期小于时隙长度的配置,所有PUSCH重复都采用RV0。
  22. 根据权利要求14-17任一项所述的终端设备,其中,所述传输为动态传输、或半静态传输。
  23. 一种确定冗余版本RV的方法,应用于网络设备,所述方法包括:
    接收终端设备发来的至少一个PUSCH重复;其中,所述PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0。
  24. 根据权利要求23所述的方法,其中,所述方法还包括:
    将接收到的一次传输的至少一个PUSCH重复,分为第一集合和/或第二集合。
  25. 根据权利要求24所述的方法,其中,所述方法还包括以下至少之一:
    基于RV序列确定接收到的第一集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据;
    确定第二集合中的PUSCH重复采用RV0,解析PUSCH重复中的数据。
  26. 根据权利要求24所述的方法,其中,所述方法还包括以下至少之一:
    基于RV序列确定接收到的第一集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据;
    基于RV序列确定接收到的第二集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据。
  27. 根据权利要求24-26任一项所述的方法,其中,
    所述第一集合中包含的PUSCH重复均为未分裂的PUSCH重复;
    所述第二集合中包含的PUSCH重复为分裂的PUSCH重复。
  28. 根据权利要求24-26任一项所述的方法,其中,
    所述第一集合中包含的PUSCH重复为码率小于或等于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于第二预设门限值的PUSCH重复;
    或者,
    所述第一集合中包含的PUSCH重复为码率小于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于或等于第二预设门限值的PUSCH重复。
  29. 根据权利要求24-26任一项所述的方法,其中,
    所述第一集合中包含的PUSCH重复的时域长度大于或等于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度为码率小于第三预设门限值的PUSCH重复;
    或者,
    所述第一集合中包含的PUSCH重复的时域长度大于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度小于或等于第三预设门限值的PUSCH重复。
  30. 根据权利要求24-26任一项所述的方法,其中,
    所述第一集合中包含的为一次传输中第一个未分裂的PUSCH重复及其之后的PUSCH重复;
    所述第二集合中包含的为一次传输中第一个未分裂的PUSCH重复之前的PUSCH重复。
  31. 根据权利要求25-30任一项所述的方法,其中,所述方法还包括:
    为终端设备配置所述RV序列。
  32. 根据权利要求23-31任一项所述的方法,其中,所述方法还包括:
    对于半静态传输且周期小于时隙长度的配置,确定接收到的所有PUSCH重复都采用RV0。
  33. 根据权利要求24-26任一项所述的方法,其中,所述传输为动态传输、或半静态传输。
  34. 一种网络设备,包括:
    第二通信单元,接收终端设备发来的至少一个PUSCH重复;其中,所述PUSCH重复为分裂的PUSCH或未分裂的PUSCH;所述至少一个PUSCH重复的RV中至少一个未分裂的PUSCH重复采用RV0。
  35. 根据权利要求34所述的网络设备,其中,所述网络设备还包括:
    第二处理单元,将接收到的一次传输的至少一个PUSCH重复,分为第一集合和/或第二集合。
  36. 根据权利要求35所述的网络设备,其中,所述第二处理单元,执行以下至少之一:
    基于RV序列确定接收到的第一集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据;
    确定第二集合中的PUSCH重复采用RV0,解析PUSCH重复中的数据。
  37. 根据权利要求35所述的网络设备,其中,所述第二处理单元,执行以下至少之一:
    基于RV序列确定接收到的第一集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据;
    基于RV序列确定接收到的第二集合中的PUSCH重复所对应的RV,解析PUSCH重复中的数据。
  38. 根据权利要求35-37任一项所述的网络设备,其中,
    所述第一集合中包含的PUSCH重复均为未分裂的PUSCH重复;
    所述第二集合中包含的PUSCH重复为分裂的PUSCH重复。
  39. 根据权利要求35-37任一项所述的网络设备,其中,
    所述第一集合中包含的PUSCH重复为码率小于或等于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于第二预设门限值的PUSCH重复;
    或者,
    所述第一集合中包含的PUSCH重复为码率小于第二预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复为码率大于或等于第二预设门限值的PUSCH重复。
  40. 根据权利要求35-37任一项所述的网络设备,其中,
    所述第一集合中包含的PUSCH重复的时域长度大于或等于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度为码率小于第三预设门限值的PUSCH重复;
    或者,
    所述第一集合中包含的PUSCH重复的时域长度大于第三预设门限值的PUSCH重复;所述第二集合中包含的PUSCH重复的时域长度小于或等于第三预设门限值的PUSCH重复。
  41. 根据权利要求35-37任一项所述的网络设备,其中,
    所述第一集合中包含的为一次传输中第一个未分裂的PUSCH重复及 其之后的PUSCH重复;
    所述第二集合中包含的为一次传输中第一个未分裂的PUSCH重复之前的PUSCH重复。
  42. 根据权利要求35-41任一项所述的网络设备,其中,所述第二通信单元,为终端设备配置所述RV序列。
  43. 根据权利要求34-42任一项所述的网络设备,其中,所述第二通信单元,对于半静态传输且周期小于时隙长度的配置,确定接收到的所有PUSCH重复都采用RV0。
  44. 根据权利要求35-37任一项所述的网络设备,其中,所述传输为动态传输、或半静态传输。
  45. 一种终端设备,包括:处理器和用于存储能够在处理器上运行的计算机程序的存储器,
    其中,该存储器用于存储计算机程序,所述处理器用于调用并运行所述存储器中存储的计算机程序,执行如权利要求1-11任一项所述方法。
  46. 一种网络设备,包括:处理器和用于存储能够在处理器上运行的计算机程序的存储器,
    其中,该存储器用于存储计算机程序,所述处理器用于调用并运行所述存储器中存储的计算机程序,执行如权利要求23-33任一项所述方法。
  47. 一种芯片,包括:处理器,用于从存储器中调用并运行计算机程序,使得安装有所述芯片的设备执行如权利要求1-11中任一项所述的方法。
  48. 一种芯片,包括:处理器,用于从存储器中调用并运行计算机程序,使得安装有所述芯片的设备执行如权利要求23-33中任一项所述的方法。
  49. 一种计算机可读存储介质,所述计算机可读存储介质用于存储计算机程序,所述计算机程序使得计算机执行如权利要求1-11、23-33任一项所述方法的步骤。
  50. 一种计算机程序产品,包括计算机程序指令,该计算机程序指令使得计算机执行如权利要求1-11、23-33中任一项所述的方法。
  51. 一种计算机程序,所述计算机程序使得计算机执行如权利要求1-11、23-33中任一项所述的方法。
PCT/CN2019/086291 2019-05-09 2019-05-09 一种确定冗余版本的方法、终端设备及网络设备 WO2020223979A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201980025065.2A CN112219435B (zh) 2019-05-09 2019-05-09 一种确定冗余版本的方法、终端设备及网络设备
PCT/CN2019/086291 WO2020223979A1 (zh) 2019-05-09 2019-05-09 一种确定冗余版本的方法、终端设备及网络设备

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/086291 WO2020223979A1 (zh) 2019-05-09 2019-05-09 一种确定冗余版本的方法、终端设备及网络设备

Publications (1)

Publication Number Publication Date
WO2020223979A1 true WO2020223979A1 (zh) 2020-11-12

Family

ID=73050736

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/086291 WO2020223979A1 (zh) 2019-05-09 2019-05-09 一种确定冗余版本的方法、终端设备及网络设备

Country Status (2)

Country Link
CN (1) CN112219435B (zh)
WO (1) WO2020223979A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022117058A1 (zh) * 2020-12-03 2022-06-09 华为技术有限公司 数据传输方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108092757A (zh) * 2015-03-11 2018-05-29 三星电子株式会社 用于通信系统中的重复传输的资源分配
CN108418659A (zh) * 2017-02-10 2018-08-17 中兴通讯股份有限公司 一种数据传输方法、装置及相关设备
CN108633024A (zh) * 2017-03-23 2018-10-09 夏普株式会社 用户设备、基站和相关方法
WO2019032748A1 (en) * 2017-08-10 2019-02-14 Sharp Laboratories Of America, Inc. PROCEDURES, BASE STATION AND USER EQUIPMENT FOR UPLINK TRANSMISSION WITHOUT AUTHORIZATION
CN109587797A (zh) * 2017-09-29 2019-04-05 夏普株式会社 无线通信方法和设备

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108092757A (zh) * 2015-03-11 2018-05-29 三星电子株式会社 用于通信系统中的重复传输的资源分配
CN108418659A (zh) * 2017-02-10 2018-08-17 中兴通讯股份有限公司 一种数据传输方法、装置及相关设备
CN108633024A (zh) * 2017-03-23 2018-10-09 夏普株式会社 用户设备、基站和相关方法
WO2019032748A1 (en) * 2017-08-10 2019-02-14 Sharp Laboratories Of America, Inc. PROCEDURES, BASE STATION AND USER EQUIPMENT FOR UPLINK TRANSMISSION WITHOUT AUTHORIZATION
CN109587797A (zh) * 2017-09-29 2019-04-05 夏普株式会社 无线通信方法和设备

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
CAICT: "PUSCH Enhancements for URLLC (R1-1907204)", 3GPP DRAFT; R1-1907204, vol. RAN WG1, 17 May 2019 (2019-05-17), Reno, USA, pages 1 - 7, XP051709230 *
CATT: "PUSCH Enhancements for URLLC", 3GPP DRAFT; R1-1906329, vol. RAN WG1, 17 May 2019 (2019-05-17), Reno, USA, pages 1 - 9, XP051708364 *
WILUS INC: "On PUSCH Enhancement for NR URLLC (R1-1907386)", 3GPP DRAFT; R1-1907386, vol. RAN WG1, 17 May 2019 (2019-05-17), Reno, USA, pages 1 - 6, XP051709407 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022117058A1 (zh) * 2020-12-03 2022-06-09 华为技术有限公司 数据传输方法及装置

Also Published As

Publication number Publication date
CN112219435A (zh) 2021-01-12
CN112219435B (zh) 2023-08-25

Similar Documents

Publication Publication Date Title
US11570810B2 (en) Method and device for scheduling uplink data based on carrier sensing of at least one beam
US11963173B2 (en) Data transmission method and terminal device
JP2020523893A (ja) 通信方法、端末デバイス、及びネットワークデバイス
WO2019237241A1 (zh) 一种下行信号的传输方法及终端设备
WO2020118574A1 (zh) 一种上行传输的功率控制方法及终端设备
WO2020051774A1 (zh) 通信方法、终端设备和网络设备
US20220046632A1 (en) Communication method in d2d system, terminal device, and network device
US11382079B2 (en) Method for determining uplink control information and communications device
WO2019033396A1 (zh) 无线通信方法和设备
WO2021013088A1 (zh) 传输方式确定、信息配置方法和设备
TW202041072A (zh) 通訊方法和終端設備
WO2020073623A1 (zh) 一种资源配置方法及装置、通信设备
US11576162B2 (en) Method and device for radio communication
WO2020061776A9 (zh) 一种反馈资源的复用方法、终端设备及网络设备
WO2020073336A1 (zh) 一种重复传输信息的方法、终端设备及网络设备
WO2019127462A1 (zh) 无线通信方法、终端设备和网络设备
AU2018442267A1 (en) Method for feeding back and receiving information, and device
WO2020223979A1 (zh) 一种确定冗余版本的方法、终端设备及网络设备
WO2019080111A1 (zh) 无线通信方法和设备
WO2020024250A1 (zh) 无线通信的方法、终端设备和网络设备
WO2018227500A1 (zh) 确定随机接入前导传输次数的方法、网络设备和终端设备
WO2021159517A1 (zh) 传输参数确定方法、终端设备及网络设备
WO2019019057A1 (zh) 无线通信方法、终端设备和网络设备
WO2021013035A1 (zh) Pucch发送、信息配置方法和设备
WO2021155544A1 (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: 19927913

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19927913

Country of ref document: EP

Kind code of ref document: A1