[go: up one dir, main page]

WO2020200163A1 - 信息传输方法及终端 - Google Patents

信息传输方法及终端 Download PDF

Info

Publication number
WO2020200163A1
WO2020200163A1 PCT/CN2020/082050 CN2020082050W WO2020200163A1 WO 2020200163 A1 WO2020200163 A1 WO 2020200163A1 CN 2020082050 W CN2020082050 W CN 2020082050W WO 2020200163 A1 WO2020200163 A1 WO 2020200163A1
Authority
WO
WIPO (PCT)
Prior art keywords
pusch
sequence
segment
repeated
segments
Prior art date
Application number
PCT/CN2020/082050
Other languages
English (en)
French (fr)
Inventor
白伟
高雪娟
邢艳萍
Original Assignee
电信科学技术研究院有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from CN201911083619.2A external-priority patent/CN111800870B/zh
Application filed by 电信科学技术研究院有限公司 filed Critical 电信科学技术研究院有限公司
Priority to EP20783667.7A priority Critical patent/EP3952530B1/en
Priority to US17/600,504 priority patent/US12095562B2/en
Publication of WO2020200163A1 publication Critical patent/WO2020200163A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H04L1/1642—Formats specially adapted for sequence numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829—Arrangements specially adapted for the receiver end
    • H04L1/1864—ARQ related signaling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1893—Physical mapping arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/563—Allocation or scheduling criteria for wireless resources based on priority criteria of the wireless resources

Definitions

  • the present disclosure relates to the field of communication technology, and in particular to an information transmission method and terminal.
  • 5G NR 5 Generation New RAT
  • URLLC Ultra Reliable Low Latency Communications, ultra-reliable and low-latency communications
  • the scheduling-free scheme is adopted. In order to increase the reliability, sufficient resources need to be guaranteed.
  • FDD Frequency Division Duplex
  • PUSCH Physical Uplink Shared Channel
  • OFDM Orthogonal Frequency Division Multiplexing, Orthogonal Frequency Division Multiplexing
  • the time slot boundary is processed, as well as the uplink and downlink conversion interval.
  • a PUSCH transmission occupying L symbols needs to cross the time slot boundary or the uplink and downlink conversion interval, it needs to be divided into
  • RV redundancy version
  • the selection of RV needs to consider decoding performance and self-decodability.
  • the system bits in the encoding have a greater impact on the decoding performance and self-decoding performance.
  • the check bits in the encoding have less impact on the decoding performance and self-decoding performance.
  • the ratio of the number of system bits and the number of check bits will match well. Have better decoding performance.
  • the time domain resource location is ⁇ starting OFDM symbol, number of OFDM symbols ⁇ .
  • This time domain resource location is defined as a transmission opportunity TO, that is, the resource location to complete one repetitive transmission.
  • the embodiments of the present disclosure provide an information transmission method and terminal.
  • the RV corresponding to each repetition/segment can be determined according to the length of each repetition/segment (how many symbols are occupied), which can improve the reliability of data transmission Sex.
  • the embodiments of the present disclosure provide the following technical solutions:
  • An information transmission method including:
  • the PUSCH is transmitted.
  • N is an integer greater than or equal to 2;
  • At least two redundant versions RV corresponding to repeated/segmented transmission of the PUSCH are obtained.
  • obtaining at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH includes:
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • the RV corresponding to the i-th repeat/segment is 0, and the i+1-th repeat/segment to the N-th repeat/segment correspond to the RV in the RV sequence according to the order of the RV in the RV sequence.
  • i 2,3,...,N.
  • obtaining at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH includes:
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • obtaining at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH includes:
  • the N repetitions/segments of the PUSCH are arranged in order from longest to shortest, and each corresponds to one according to the order of the RVs in the RV sequence RV.
  • obtaining at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH including:
  • the RV sequence in the RV configuration information includes M RVs
  • the first target RV sequence includes L*M RVs
  • the L RV sequence sequence Arrangement the N repetitions/segments of the PUSCH are arranged in the order from longest to shortest, and each corresponds to one RV according to the order of the RVs in the first target RV sequence; L is greater than or equal to 1. The integer.
  • obtaining at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH includes:
  • the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and the first M repetitions/segments in the N repeats/segments of the PUSCH, after sorting according to the length, according to the RV sequence
  • the order of the RVs corresponds to one RV respectively
  • the M+1 to Nth repetitions/segments of the PUSCH respectively correspond to one RV according to the order of the RVs corresponding to the first M repetitions/segments.
  • the arrangement order of the two repetitions/segments of the PUSCH is sorted according to the time sequence.
  • the RV value of the repetition/segment after the time slot boundary or the uplink/downlink conversion time is determined according to the RV value of the repetition/segment before the time slot boundary or the uplink/downlink conversion time.
  • the two repetitions/segments before and after the time slot boundary or the uplink-downlink transition time are selected according to their corresponding RVs.
  • the coded bits corresponding to the RV are output, or the coded bits corresponding to the RV are sequentially selected for output according to the time slot boundary or the length of two repetitions/segments before and after the uplink-downlink transition time.
  • An embodiment of the present disclosure further provides a terminal, including: a processor, a memory, the memory stores a program executable by the processor, and the transceiver obtains configuration information for transmitting the physical uplink shared channel PUSCH;
  • the processor executes the program, it realizes that: when the PUSCH performs repeated/segmented transmission, obtain at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the configuration information.
  • the redundancy version RV corresponding to the segmented transmission respectively; the transceiver transmits the PUSCH according to the RV.
  • the processor is specifically configured to: obtain the length of each repeated/segment transmission of the PUSCH according to the time domain resource information of the PUSCH, and the time slot boundary or the uplink-downlink conversion time;
  • N is an integer greater than or equal to 2;
  • At least two redundant versions RVs respectively corresponding to the repeated/segmented transmission of the PUSCH are obtained.
  • the processor when the processor obtains at least two redundant versions RV corresponding to the repeated/segmented transmission of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, it specifically uses in:
  • the RV sequence in the RV configuration information includes M RVs
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • the N repetitions/segments of the PUSCH are arranged in order from longest to shortest, and each corresponds to one according to the order of the RVs in the RV sequence RV; or,
  • the RV sequence in the RV configuration information includes M RVs
  • the first target RV sequence when N is greater than M, the first target RV sequence is determined, the first target RV sequence includes L*M RVs, and the L RV sequence sequence Arrangement, the N repetitions/segments of the PUSCH are arranged in the order from longest to shortest, and each corresponds to one RV according to the order of the RVs in the first target RV sequence; L is greater than or equal to 1. An integer; or,
  • the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and the first M repetitions/segments in the N repeats/segments of the PUSCH, after sorting according to the length, according to the RV sequence
  • the order of the RVs corresponds to one RV respectively
  • the M+1 to Nth repetitions/segments of the PUSCH respectively correspond to one RV according to the order of the RVs corresponding to the first M repetitions/segments.
  • the arrangement order of the two repetitions/segments of the PUSCH is sorted according to the time sequence.
  • the RV value of the repetition/segment after the time slot boundary or the uplink/downlink conversion time is determined according to the RV value of the repetition/segment before the time slot boundary or the uplink/downlink conversion time.
  • the two repetitions/segments before and after the time slot boundary or the uplink-downlink transition time are selected according to their corresponding RVs.
  • the coded bits corresponding to the RV are output, or the coded bits corresponding to the RV are sequentially selected for output according to the time slot boundary or the length of two repetitions/segments before and after the uplink-downlink transition time.
  • the embodiment of the present disclosure also provides a terminal, including:
  • the transceiver module is used to obtain the configuration information for transmitting the physical uplink shared channel PUSCH;
  • the processing module is configured to obtain the difference of at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the configuration information when the PUSCH is performing repeated/segmented transmission Corresponding redundancy version RV; the transceiver module is also used to transmit the PUSCH according to the RV.
  • the embodiment of the present disclosure also provides an information transmission method, including:
  • the PUSCH is received.
  • obtaining at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH according to the configuration information includes:
  • N is an integer greater than or equal to 2;
  • At least two redundant versions RV corresponding to the repeated/segmented transmission of the PUSCH are obtained.
  • obtaining at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH includes:
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • the RV corresponding to the i-th repeat/segment is 0, and the i+1-th repeat/segment to the N-th repeat/segment correspond to the RV in the RV sequence according to the order of the RV in the RV sequence.
  • i 2,3,...,N.
  • obtaining at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH includes:
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • obtaining at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH includes:
  • the N repetitions/segments of the PUSCH are arranged in order from longest to shortest, and each corresponds to one according to the order of the RVs in the RV sequence RV.
  • obtaining at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH includes:
  • the RV sequence in the RV configuration information includes M RVs
  • the first target RV sequence includes L*M RVs
  • the L RV sequence sequence Arrangement the N repetitions/segments of the PUSCH are arranged in the order from longest to shortest, and each corresponds to one RV according to the order of the RVs in the first target RV sequence; L is greater than or equal to 1. The integer.
  • obtaining at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH includes:
  • the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and the first M repetitions/segments in the N repeats/segments of the PUSCH, after sorting according to the length, according to the RV sequence
  • the order of the RVs corresponds to one RV respectively
  • the M+1 to Nth repetitions/segments of the PUSCH respectively correspond to one RV according to the order of the RVs corresponding to the first M repetitions/segments.
  • the arrangement order of the two repetitions/segments of the PUSCH is sorted according to the time sequence.
  • the RV value of the repetition/segment after the time slot boundary or the uplink/downlink conversion time is determined according to the RV value of the repetition/segment before the time slot boundary or the uplink/downlink conversion time.
  • the two repetitions/segments are respectively input to the decoder according to the RV, or the time slot boundary or The two repetitions/segments before and after the uplink and downlink conversion time are cascaded and input to the decoder.
  • the embodiment of the present disclosure also provides a network device, including: a processor, a memory, and a program executable by the processor is stored in the memory, and the transceiver sends configuration information for transmitting the physical uplink shared channel PUSCH;
  • a network device including: a processor, a memory, and a program executable by the processor is stored in the memory, and the transceiver sends configuration information for transmitting the physical uplink shared channel PUSCH;
  • the transceiver receives the PUSCH according to the RV.
  • the processor is specifically configured to: obtain the length of each repeated/segment transmission of the PUSCH according to the time domain resource information of the PUSCH, and the time slot boundary or the uplink-downlink conversion time; The length of repeated/segmented transmission, the PUSCH is divided into N repetitions/segments, where N is an integer greater than or equal to 2; according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, at least two The redundancy version RV respectively corresponding to the repeated/segmented transmission of the PUSCH.
  • the processor when the processor obtains at least two redundant versions RV corresponding to the repeated/segmented transmission of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, it specifically uses in:
  • the RV sequence in the RV configuration information includes M RVs
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • the N repetitions/segments of the PUSCH are arranged in order from longest to shortest, and each corresponds to one according to the order of the RVs in the RV sequence RV; or,
  • the RV sequence in the RV configuration information includes M RVs
  • the first target RV sequence when N is greater than M, the first target RV sequence is determined, the first target RV sequence includes L*M RVs, and the L RV sequence sequence Arrangement, the N repetitions/segments of the PUSCH are arranged in the order from longest to shortest, and each corresponds to one RV according to the order of the RVs in the first target RV sequence; L is greater than or equal to 1. An integer; or,
  • the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and the first M repetitions/segments in the N repeats/segments of the PUSCH, after sorting according to the length, according to the RV sequence
  • the order of the RVs corresponds to one RV respectively
  • the M+1 to Nth repetitions/segments of the PUSCH respectively correspond to one RV according to the order of the RVs corresponding to the first M repetitions/segments.
  • the arrangement order of the two repetitions/segments of the PUSCH is sorted according to the time sequence.
  • the RV value of the repetition/segment after the time slot boundary or the uplink/downlink conversion time is determined according to the RV value of the repetition/segment before the time slot boundary or the uplink/downlink conversion time.
  • the two repetitions/segments are respectively input to the decoder according to the RV, or the time slot boundary or The two repetitions/segments before and after the uplink and downlink conversion time are cascaded and input to the decoder.
  • the embodiment of the present disclosure also provides a network device, including:
  • the transceiver module is used to transmit the configuration information of the physical uplink shared channel PUSCH;
  • the processing module is configured to obtain the difference of at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the configuration information when the PUSCH is performing repeated/segmented transmission The corresponding redundant version RV;
  • the transceiver module is configured to receive the PUSCH according to the RV.
  • Embodiments of the present disclosure also provide a computer storage medium, including instructions, which when run on a computer, cause the computer to execute the method described above.
  • the configuration information for transmitting the physical uplink shared channel PUSCH is obtained; when the PUSCH is repeatedly/segmented transmission, according to the length of the repeated/segmented transmission of the PUSCH and the configuration information, Obtain at least two redundant versions RV corresponding to repeated/segmented transmission of the PUSCH; and transmit the PUSCH according to the RV. Therefore, when the number of symbols occupied by each repetition/segment of PUSCH is different, the length of each repetition/segment (the number of symbols occupied, specifically OFDM symbols) can be used to determine the corresponding RV can improve the reliability of data transmission.
  • Figure 1 is a schematic diagram of PUSCH segments
  • Figure 2 is a schematic flow chart of the information transmission method of the present disclosure
  • FIG. 3 is a schematic diagram of PUSCH segmentation in an embodiment of the disclosure.
  • Figure 4 is a schematic diagram of the terminal architecture of the present disclosure.
  • an embodiment of the present disclosure provides an information transmission method, which is applied to a terminal, and the method includes:
  • Step 21 Obtain configuration information for transmitting the physical uplink shared channel (PUSCH); the configuration information includes at least: time domain resource information and RV configuration information for transmitting the PUSCH. Of course, other information may also be included, such as DMRS (Demodulation Reference Sgnal, demodulation reference signal) configuration information.
  • DCI downlink control information
  • RRC radio resource control
  • PDCCH physical downlink control channel
  • Step 22 When the PUSCH performs repeated/segmented transmission, according to the length of the repeated/segmented transmission of the PUSCH and the configuration information, obtain at least two of the repeated/segmented transmissions of the PUSCH respectively corresponding Redundant version RV;
  • Step 23 Transmit the PUSCH according to the RV.
  • the embodiment of the present disclosure obtains at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH according to the acquired configuration information when the PUSCH is performing repeated/segmented transmission.
  • RV which transmits the PUSCH, improves the reliability of data transmission.
  • step 22 may specifically include:
  • Step 221 Obtain the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH, and the time slot boundary or the uplink-downlink conversion time.
  • the terminal determines the time slot boundary or the position of TDD uplink/downlink (UL/DL) conversion.
  • the terminal determines whether it is one time or multiple times according to the time domain resources and time slot boundaries that PUSCH needs to occupy or the position of TDD uplink and downlink conversion.
  • Transmission, and the length of each repeated/segmented transmission is determined by the number of symbols occupied by each repeated/segmented transmission.
  • the symbols here are for example OFDM (Orthogonal Frequency Division Multiplexing, positive Cross-frequency division multiplexing) symbol.
  • Step 222 Divide the PUSCH into N repetitions/segments according to the length of each repeated/segment transmission of the PUSCH, where N is an integer greater than or equal to 2.
  • Step 223 According to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, obtain at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH.
  • an implementation manner of step 223 may include:
  • Step 2231 If the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the first repeat/segment of the PUSCH is 0, and the length of the i-th repeat/segment is greater than the previous RV.
  • all repetitions/segments of the PUSCH are separately judged, and each repetition/segment is RV correspondence respectively.
  • a gNB network equipment, such as a base station
  • the RV sequence in the RV configuration information ⁇ 0 2 3 1 ⁇ .
  • one PUSCH transmission needs to be divided into four (or multiple) PUSCH transmissions or four PUSCH segments, and the four repeated transmissions or four PUSCH segments are respectively seg1, seg2, seg3, seg4.
  • N and M are equal.
  • the method is also applicable;
  • the PUSCH transmission or PUSCH segmentation before the time slot boundary or TDD uplink/downlink conversion time is seg1
  • the PUSCH transmission or PUSCH segmentation after the time slot boundary or TDD uplink/downlink conversion time is seg2, seg3, and seg4;
  • the RV corresponding to seg1 is 0, if the length of seg2 is greater than seg1, the RV corresponding to seg2 is 0, and the RVs corresponding to seg3 and seg4 are 2 and 3 respectively, that is, seg2 is larger than the previous PUSCH with RV of 0
  • the RV corresponding to seg2 is 0, that is, the first RV in the RV sequence.
  • seg3 and seg4 reset their corresponding RVs in turn, that is, RVs corresponding to seg3 and seg4 respectively Are 2 and 3;
  • the lengths of seg3 and seg2 are compared in turn. If it is greater, the RV corresponding to seg3 is set to 0 and the RV corresponding to seg4 is set to 2. If seg3 is less than seg2, the RV corresponding to seg3 is 2 and remains unchanged.
  • step 223 may include:
  • Step 2232 If the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the first repeat/segment of the PUSCH is 0, and the length of the i-th repeat/segment is greater than the previous RV.
  • the gNB informs the UE of resource configuration, DMRS configuration, RV configuration, etc. through RRC signaling and/or activation of PDCCH, so that the UE starts PUSCH uplink transmission.
  • the RV sequence in the RV configuration information ⁇ 0 2 3 1 ⁇ .
  • one PUSCH transmission needs to be divided into four (or multiple) PUSCH transmissions or four PUSCH segments, and the four repeated transmissions or four PUSCH segments are respectively seg1, seg2, seg3, seg4.
  • N and M are equal.
  • the method is also applicable;
  • the PUSCH transmission or PUSCH segmentation before the time slot boundary or TDD uplink/downlink conversion time is seg1
  • the PUSCH transmission or PUSCH segmentation after the time slot boundary or TDD uplink/downlink conversion time is seg2, seg3, and seg4;
  • the RV corresponding to seg1 is 0, if the length of seg2 is greater than seg1, the RV corresponding to seg2 is 0, and seg3 and seg4 keep their original corresponding RV unchanged, that is, the RV corresponding to seg3 is 3, seg4 The corresponding RV is 1;
  • step 223 may include:
  • Step 2233 If the RV sequence in the RV configuration information includes M RVs, the N repetitions/segments of the PUSCH are arranged in order from longest to shortest, according to the order of RVs in the RV sequence Each corresponds to a RV.
  • the gNB informs the UE of resource configuration, DMRS configuration, RV configuration, etc. through RRC signaling and/or activation of PDCCH (Physical Downlink Control Channel), so that the UE starts PUSCH uplink transmission.
  • PDCCH Physical Downlink Control Channel
  • one PUSCH transmission needs to be divided into four (or multiple) PUSCH transmissions or four PUSCH segments, and the four repeated transmissions or four PUSCH segments are respectively seg1, seg2, seg3, seg4.
  • N and M are equal.
  • the method is also applicable;
  • the PUSCH transmission or PUSCH segmentation before the time slot boundary or TDD uplink/downlink conversion time is seg1
  • the PUSCH transmission or PUSCH segmentation after the time slot boundary or TDD uplink/downlink conversion time is seg2, seg3, and seg4;
  • all segs are sorted from longest to shortest, and the obtained sequence is seg2>seg1>seg4>seg3. Then when the RV is determined for the sorted repetitions/segments, the RVs of seg1, seg2, seg3, and seg4 are 2, 0, 1, 3 in order.
  • step 223 may include:
  • Step 2234 If the RV sequence in the RV configuration information includes M RVs, when N is greater than M, determine a first target RV sequence, the first target RV sequence includes L*M RVs, and L
  • the RV sequences are arranged in sequence, and the N repeats/segments of the PUSCH are arranged in the order from longest to short, and each corresponds to one RV according to the order of the RVs in the first target RV sequence; L is greater than Or an integer equal to 1.
  • the gNB informs the UE of resource configuration, DMRS configuration, RV configuration, etc. through RRC signaling and/or activation of PDCCH, so that the UE starts PUSCH uplink transmission.
  • the RV sequence in the RV configuration information ⁇ 0 2 3 1 ⁇ .
  • one PUSCH transmission needs to be divided into four (or multiple) PUSCH transmissions or four PUSCH segments, and the four repeated transmissions or four PUSCH segments are respectively seg1, seg2, seg3, seg4.
  • One PUSCH transmission is divided into 8 PUSCH transmissions or PUSCH segments, respectively seg1-8, all segs are sorted from longest to shortest, and the sequence obtained is seg2>seg1>seg5>seg6>seg4>seg3>seg8>seg7.
  • the corresponding RV sequence is formed by concatenating multiple signaling RV sequences, that is, ⁇ 0 2 3 1 0 2 3 1 ⁇ , so seg2
  • the RVs of seg1, seg5, seg6, seg4, seg3, seg8, and seg7 are 0 2 3 1 0 2 3 1 in order.
  • step 223 may include:
  • Step 2235 If the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and the first M repeats/segments in the N repeats/segments of the PUSCH, after sorting according to length, The order of the RVs in the RV sequence corresponds to one RV respectively, and the M+1 to Nth repetitions/segments of the PUSCH respectively correspond to one RV according to the order of the RVs corresponding to the first M repetitions/segments.
  • the gNB informs the UE of resource configuration, DMRS configuration, RV configuration, etc. through RRC signaling and/or activation of PDCCH, so that the UE starts PUSCH uplink transmission.
  • the RV sequence in the RV configuration information ⁇ 0 2 3 1 ⁇ .
  • One PUSCH transmission is divided into 8 PUSCH transmissions or PUSCH segments, respectively seg1-8, all segs are sorted from longest to shortest, and the sequence obtained is seg2>seg1>seg4>seg3. Then when the RV is determined for the sorted repetition/segment, the RVs of seg1, seg2, seg3, and seg4 are 2, 0, 1, 3, and the RVs of seg5, seg6, seg7, and seg8 are also 2, 0, 1, 3.
  • seg5, seg6, seg7, seg8 are no longer sorted by length.
  • the arrangement order of the two repetitions/segments of the PUSCH is sorted according to the time sequence.
  • the RV value of the repetition/segment after the time slot boundary or the uplink/downlink transition time is determined according to the RV value of the repetition/segment before the time slot boundary or the uplink/downlink transition time; for example, the time slot
  • the RV values of the two repetitions/segments before and after the boundary or the uplink and downlink transition time are the same or different.
  • the RV values of the two repetitions/segments (seg1 and seg2) before and after the time slot boundary or the uplink-downlink transition time are the same or different.
  • the two repetitions/segments before and after the time slot boundary or the uplink-downlink transition time are selected according to their corresponding RVs
  • the coded bits corresponding to the RV are output, or the coded bits corresponding to the RV are sequentially selected for output according to the time slot boundary or the length of the two repetitions/segments before and after the uplink-downlink conversion time.
  • the RVs corresponding to seg1 and seg2 shown in Figure 3 are both 2, then seg1 and seg2 are selected according to the RV value of 2 to select their coded bit output.
  • the RVs corresponding to seg1 and seg2 shown in Figure 3 are both 2, then seg1 and seg2 are selected according to the RV value of 2 to select their coded bit output.
  • seg1 occupies 4 symbols (ie The length is 4) and seg2 occupy 10 symbols (that is, the length is 10).
  • 140 can be selected Coded bits, where seg1 selects the first 40 bits of the 140 coded bits (for example, bit 0 to bit 39), and seg2 selects the last 100 bits of the 140 coded bits (for example, bit 40 to bit 139).
  • the first repetition/segmentation of the PUSCH transmission starts according to The first condition and the second condition are determined, or based on the first condition and the third condition; the first condition is that the RV of the repeat/segment is 0; the second condition is the repeat/segment If it belongs to the repeated segmented transmission obtained by segmentation, it is not the repetition/segmentation after the time slot boundary or the uplink-downlink transition time; the third condition is that the repeated/segmented transmission does not belong to the segmented repetition/segmentation.
  • the RVs corresponding to seg1 (which can be PUSCH-repetition) and seg2 (which can be PUSCH-repetition) shown in Figure 3 are both 0, then seg1 and seg2 are both selected according to the RV value of 0 to select their coded bit output.
  • seg1 occupies 4 symbols (that is, the length is 4) and seg2 occupies 10 symbols (that is, the length is 10), assuming that every 10 coded bits occupies 1 symbol (1 or more in the frequency domain) RB), according to the RV value of 0, 140 coded bits can be selected, where seg1 selects the first 40 bits of the 140 coded bits (such as bit 0 to bit 39), and seg2 selects the last 100 of the 140 coded bits Bits (for example, bit 40 to bit 139).
  • seg1 and seg2 when determining whether seg1 and seg2 can be the first repeated/segmented transmission in the two repeated/segmented transmissions corresponding to one PUSCH transmission, two conditions need to be judged.
  • the first is the repeated/segmented transmission.
  • the RV of the segmented transmission is 0.
  • the RVs of seg1 and seg2 are both 0, that is, both meet the first condition; the second is that the repeated/segmented transmission cannot be the repeated segmented transmission obtained by division The repetition/segmentation after the time slot boundary or the uplink/downlink conversion time, where seg2 is the divided time slot boundary or the repetition/segmentation after the uplink/downlink conversion time, seg1 is not, so seg1 can be the first to be transmitted Repeated/segmented transmission, seg2 cannot be used as the first repeated/segmented transmission to be transmitted.
  • the first repeated/segmented transmission to be transmitted refers to the start of the entire PUSCH transmission.
  • the two repetitions/segments before and after the time slot boundary or the uplink/downlink transition time use the same frequency domain resources, that is, the two repetitions/segments do not hop each other.
  • the above-mentioned embodiments of the present disclosure obtain at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH according to the acquired configuration information when the PUSCH is repeatedly/segmented transmission, according to The RV transmits the PUSCH, which improves the reliability of data transmission.
  • an embodiment of the present disclosure also provides a terminal 40, including: a transceiver 41, a processor 42, a memory 43, and a program executable by the processor 42 is stored on the memory 43.
  • the transceiver 41 obtains the configuration information for transmitting the physical uplink shared channel PUSCH; when the processor 42 executes the program, it realizes: when the PUSCH performs repeated/segmented transmission, according to the repeated/segmented transmission of the PUSCH
  • the length and the configuration information obtain at least two redundant versions RVs respectively corresponding to repeated/segmented transmission of the PUSCH; the transceiver 41 transmits the PUSCH according to the RV.
  • the transceiver 41 when the transceiver 41 obtains the configuration information for transmitting the physical uplink shared channel PUSCH, it is specifically used to: receive at least one of downlink control information DCI signaling, radio resource control RRC signaling, and physical downlink control channel PDCCH sent by a network device ;
  • the configuration information includes at least: time domain resource information and RV configuration information for transmitting the PUSCH.
  • the processor 42 is specifically configured to: obtain the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH, and the time slot boundary or the uplink-downlink conversion time;
  • N is an integer greater than or equal to 2;
  • At least two redundant versions RVs respectively corresponding to the repeated/segmented transmission of the PUSCH are obtained.
  • the processor obtains at least two redundant versions RV respectively corresponding to repeated/segmented transmission of the PUSCH according to the RV configuration information, which is specifically used for:
  • the RV sequence in the RV configuration information includes M RVs
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • the N repetitions/segments of the PUSCH are arranged in order from longest to shortest, and each corresponds to one according to the order of the RVs in the RV sequence RV; or,
  • the RV sequence in the RV configuration information includes M RVs
  • the first target RV sequence when N is greater than M, the first target RV sequence is determined, the first target RV sequence includes L*M RVs, and the L RV sequence sequence Arrangement, the N repetitions/segments of the PUSCH are arranged in the order from longest to shortest, and each corresponds to one RV according to the order of the RVs in the first target RV sequence; L is greater than or equal to 1. An integer; or,
  • the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and the first M repetitions/segments in the N repeats/segments of the PUSCH, after sorting according to the length, according to the RV sequence
  • the order of the RVs corresponds to one RV respectively
  • the M+1 to Nth repetitions/segments of the PUSCH respectively correspond to one RV according to the order of the RVs corresponding to the first M repetitions/segments.
  • the arrangement order of the two repetitions/segments of the PUSCH is sorted according to the time sequence.
  • the RV value of the repetition/segment after the time slot boundary or the uplink/downlink conversion time is determined according to the RV value of the repetition/segment before the time slot boundary or the uplink/downlink conversion time.
  • the two repetitions/segments before and after the time slot boundary or the uplink-downlink transition time are selected according to their corresponding RVs.
  • the coded bits corresponding to the RV are output, or the coded bits corresponding to the RV are sequentially selected for output according to the time slot boundary or the length of two repetitions/segments before and after the uplink-downlink transition time.
  • the two repetitions/segments before and after the time slot boundary or the uplink/downlink transition time use the same frequency domain resources, that is, the two repetitions/segments do not hop each other.
  • the transceiver 41 and the processor 42, as well as the transceiver 41 and the memory 43, can be connected via a bus interface.
  • the functions of the transceiver 41 can be implemented by the processor 42, and the functions of the processor 42 can also be implemented by the transceiver 41. .
  • the embodiment of the present disclosure also provides a terminal, including:
  • the transceiver module is used to obtain the configuration information for transmitting the physical uplink shared channel PUSCH;
  • the processing module is configured to obtain the difference of at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the configuration information when the PUSCH is performing repeated/segmented transmission Corresponding redundancy version RV; the transceiver module is also used to transmit the PUSCH according to the RV. All the implementation columns in the method shown in FIG. 2 are applicable to this embodiment, and the same technical effect can be achieved.
  • the embodiment of the present disclosure also provides an information transmission method, including:
  • Step 51 Send configuration information for transmitting the physical uplink shared channel PUSCH;
  • Step 52 When the PUSCH performs repeated/segmented transmission, according to the length of the repeated/segmented transmission of the PUSCH and the configuration information, obtain at least two of the repeated/segmented transmissions of the PUSCH respectively corresponding Redundant version RV;
  • Step 53 receiving the PUSCH according to the RV.
  • step 52 may specifically include:
  • Step 521 Obtain the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH, and the time slot boundary or the uplink-downlink conversion time;
  • Step 522 Divide the PUSCH into N repetitions/segments according to the length of each repetition/segment transmission of the PUSCH, where N is an integer greater than or equal to 2.
  • Step 523 According to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, obtain at least two redundant versions RV respectively corresponding to the repeated/segmented transmission of the PUSCH.
  • step 523 may include at least one of the following:
  • Step 5231 If the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the first repeat/segment of the PUSCH is 0, and the length of the i-th repeat/segment is greater than the previous RV.
  • Step 5233 If the RV sequence in the RV configuration information includes M RVs, the N repetitions/segments of the PUSCH are arranged in the order from longest to shortest, according to the order of the RVs in the RV sequence Each corresponds to a RV.
  • Step 5234 If the RV sequence in the RV configuration information includes M RVs, when N is greater than M, determine a first target RV sequence, the first target RV sequence includes L*M RVs, and L
  • the RV sequences are arranged in sequence, and the N repeats/segments of the PUSCH are arranged in the order from longest to short, and each corresponds to one RV according to the order of the RVs in the first target RV sequence; L is greater than Or an integer equal to 1.
  • Step 5235 If the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and the first M repeats/segments in the N repeats/segments of the PUSCH, after sorting by length, The order of the RVs in the RV sequence corresponds to one RV respectively, and the M+1 to Nth repetitions/segments of the PUSCH respectively correspond to one RV according to the order of the RVs corresponding to the first M repetitions/segments.
  • the arrangement order of the two repetitions/segments of the PUSCH is sorted according to the time sequence.
  • the RV value of the repetition/segment after the time slot boundary or the uplink/downlink conversion time is determined according to the RV value of the repetition/segment before the time slot boundary or the uplink/downlink conversion time.
  • the two repetitions/segments are respectively input to the decoder according to the RV, or the time slot boundary or The two repetitions/segments before and after the uplink and downlink conversion time are cascaded and input to the decoder.
  • the method of this embodiment can be applied to network equipment, such as a base station.
  • the RV corresponding to each repeated/segment transmission of the PUSCH is determined, which is the same as all the implementation columns in the method shown in FIG. 2.
  • the method shown in FIG. All the embodiments in are applicable to this embodiment and can achieve the same technical effect.
  • the embodiment of the present disclosure also provides a network device, including: a processor, a memory, and a program executable by the processor is stored in the memory, and the transceiver sends configuration information for transmitting the physical uplink shared channel PUSCH;
  • a network device including: a processor, a memory, and a program executable by the processor is stored in the memory, and the transceiver sends configuration information for transmitting the physical uplink shared channel PUSCH;
  • the transceiver receives the PUSCH according to the RV.
  • the processor is specifically configured to: obtain the length of each repeated/segment transmission of the PUSCH according to the time domain resource information of the PUSCH, and the time slot boundary or the uplink-downlink conversion time; The length of repeated/segmented transmission, the PUSCH is divided into N repetitions/segments, where N is an integer greater than or equal to 2; according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, at least two The redundancy version RV respectively corresponding to the repeated/segmented transmission of the PUSCH.
  • the processor when the processor obtains at least two redundant versions RV corresponding to the repeated/segmented transmission of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, it specifically uses in:
  • the RV sequence in the RV configuration information includes M RVs
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • the RV corresponding to the first repetition/segment of the PUSCH is 0, and the length of the i-th repetition/segment is greater than the previous repetition with RV of 0.
  • the N repetitions/segments of the PUSCH are arranged in order from longest to shortest, and each corresponds to one according to the order of the RVs in the RV sequence RV; or,
  • the RV sequence in the RV configuration information includes M RVs
  • the first target RV sequence when N is greater than M, the first target RV sequence is determined, the first target RV sequence includes L*M RVs, and the L RV sequence sequence Arrangement, the N repetitions/segments of the PUSCH are arranged in the order from longest to shortest, and each corresponds to one RV according to the order of the RVs in the first target RV sequence; L is greater than or equal to 1. An integer; or,
  • the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and the first M repetitions/segments in the N repeats/segments of the PUSCH, after sorting according to the length, according to the RV sequence
  • the order of the RVs corresponds to one RV respectively
  • the M+1 to Nth repetitions/segments of the PUSCH respectively correspond to one RV according to the order of the RVs corresponding to the first M repetitions/segments.
  • the arrangement order of the two repetitions/segments of the PUSCH is sorted according to the time sequence.
  • the RV value of the repetition/segment after the time slot boundary or the uplink/downlink conversion time is determined according to the RV value of the repetition/segment before the time slot boundary or the uplink/downlink conversion time.
  • the two repetitions/segments are respectively input to the decoder according to the RV, or the time slot boundary or The two repetitions/segments before and after the uplink and downlink conversion time are cascaded and input to the decoder.
  • the embodiment of the present disclosure also provides a network device, including:
  • the transceiver module is used to transmit the configuration information of the physical uplink shared channel PUSCH;
  • the processing module is configured to obtain the difference of at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the configuration information when the PUSCH is performing repeated/segmented transmission The corresponding redundant version RV;
  • the transceiver module is configured to receive the PUSCH according to the RV.
  • the embodiments of the present disclosure also provide a computer storage medium, including instructions, which when the instructions are run on the computer, cause the computer to execute methods such as the terminal side or the network device side. All the implementation manners in the foregoing method implementation column are applicable to this embodiment, and the same technical effect can also be achieved.
  • the disclosed 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 disclosure 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 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 methods described in the various embodiments of the present disclosure.
  • the aforementioned storage media include: U disk, mobile hard disk, ROM, RAM, magnetic disk or optical disk and other media that can store program codes.
  • each component or each step can be decomposed and/or recombined.
  • decomposition and/or recombination should be regarded as equivalent solutions of the present disclosure.
  • the steps of performing the above series of processing can naturally be performed in a time sequence in the order of description, but do not necessarily need to be performed in a time sequence, and some steps can be performed in parallel or independently of each other.
  • the purpose of the present disclosure can also be realized by running a program or a group of programs on any computing device.
  • the computing device may be a well-known general-purpose device. Therefore, the purpose of the present disclosure can also be achieved only by providing a program product containing program code for implementing the method or device. That is, such a program product also constitutes the present disclosure, and a storage medium storing such a program product also constitutes the present disclosure.
  • the storage medium may be any well-known storage medium or any storage medium developed in the future. It should also be pointed out that, in the device and method of the present disclosure, obviously, each component or each step can be decomposed and/or recombined.
  • modules, units, sub-modules, sub-units, etc. can be implemented in one or more application specific integrated circuits (ASICs), digital signal processors (Digital Signal Processing, DSP), digital signal processing equipment ( DSP Device, DSPD), Programmable Logic Device (PLD), Field-Programmable Gate Array (Field-Programmable Gate Array, FPGA), general-purpose processors, controllers, microcontrollers, microprocessors, Other electronic units or combinations thereof that perform the functions described in the present disclosure.
  • ASICs application specific integrated circuits
  • DSP Digital Signal Processing
  • DSP Device digital signal processing equipment
  • PLD Programmable Logic Device
  • Field-Programmable Gate Array Field-Programmable Gate Array
  • FPGA Field-Programmable Gate Array
  • the technology described in the embodiments of the present disclosure can be implemented through modules (for example, procedures, functions, etc.) that perform the functions described in the embodiments of the present disclosure.
  • the software codes can be stored in the memory and executed by the processor.
  • the memory can be implemented in the processor or external to the processor.
  • the purpose of the present disclosure can also be realized by running a program or a group of programs on any computing device.
  • the computing device may be a well-known general-purpose device. Therefore, the purpose of the present disclosure can also be achieved only by providing a program product containing program code for implementing the method or device. That is, such a program product also constitutes the present disclosure, and a storage medium storing such a program product also constitutes the present disclosure.
  • the storage medium may be any well-known storage medium or any storage medium developed in the future. It should also be pointed out that, in the device and method of the present disclosure, obviously, each component or each step can be decomposed and/or recombined.

Landscapes

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

Abstract

本公开公开了一种信息传输方法及终端，其中，信息传输方法包括：获取传输物理上行共享信道PUSCH的配置信息；在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；按照所述RV，传输所述PUSCH。

Description

信息传输方法及终端
相关申请的交叉引用
本申请主张在2019年4月2日在中国提交的中国专利申请号No.201910263377.9、在2019年4月3日在中国提交的中国专利申请号No.201910267628.0以及在2019年11月7日在中国提交的中国专利申请号No.201911083619.2的优先权，其全部内容通过引用包含于此。
技术领域
本公开涉及通信技术领域，尤其涉及一种信息传输方法及终端。
背景技术
随着移动通信业务需求的发展变化，未来移动通信系统都开始研究新的无线通信系统(即5G NR，5 Generation New RAT)。在5G NR系统中，一个重要的需求是低时延、高可靠的通信，出现了URLLC(Ultra Reliable Low Latency Communications，超可靠度和低时延通信)等传输方案。
URLLC的上行传输方案，为了降低时延，采用免调度方案，为了增加可靠性，需要保证足够多的资源。
在FDD(Frequency Division Duplex，频分双工)系统中，当一次占用L个符号的PUSCH(Physical Uplink Shared Channel，物理上行共享信道)传输需要跨越时隙边界时，需要分割成两个或多个PUSCH进行传输，需要确定每个PUSCH传输所要占用的OFDM(Orthogonal Frequency Division Multiplexing，正交频分复用)符号位置。
在TDD(Time Division Duplex，时分双工)系统中，处理时隙边界，还有上下行转换间隔，当一次占用L个符号的PUSCH传输需要跨越时隙边界或上下行转换间隔时，需要分割成两个或多个PUSCH进行传输，需要确定每个PUSCH传输所要占用的OFDM符号位置。
针对一个传输块TB，分成多个PUSCH进行重复/分段进行传输时，需要为每个重复/分段配置冗余版本(RV)，RV的选择需要考虑译码性能和可 自解码性能，通常编码中的系统比特，对译码性能和自解码性能影响更大，编码中的校验比特，对译码性能和自解码性能影响较小，但是系统比特和校验比特数量比例配合的好会有更优的译码性能。
在相关的URLLC中，针对RV配置问题，相关的技术方案如下：按照标准，通过RRC(Radio Resource Control，无线资源控制)配置，比如重复传输次数K＝4、RV＝{0 2 3 1}，时域资源位置为{起始OFDM符号，OFDM符号个数}，这个时域资源位置定义为一个传输机会TO，即完成一次重复传输的资源位置，K＝4意味着要进行四次重复传输需要四个TO。当数据在第一个TO上传输时，采用RV＝0；当数据在第二个TO上传输时，采用RV＝2；当数据在第三个TO上传输时，采用RV＝3；当数据在第四个TO上传输时，采用RV＝1。
图1中，对于一个长度为L的PUSCH传输，当需要跨越时隙边界或上下行转换间隔进行PUSCH传输时，将被分割为两次传输。如果在时隙边界或上下行转换间隔前占用了N个符号，那么时隙边界或上下行转换间隔后将占用L-N个符号，对N或L-N没有限制。当各个重复/分段的长度不同时，各个重复/分段的RV如何配置，还没有解决方法。
发明内容
本公开实施例提供了一种信息传输方法及终端。当PUSCH的各个重复/分段所占用的符号数不同时，可以依据各个重复/分段的长度(占用符号数的多少)，确定每个重复/分段对应的RV，可以提高数据传输的可靠性。
为解决上述技术问题，本公开的实施例提供如下技术方案：
一种信息传输方法，包括：
获取传输物理上行共享信道PUSCH的配置信息；
在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
按照所述RV，传输所述PUSCH。
其中，在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/ 分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；
按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；
根据所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
其中，根据所述PUSCH的重复/分段传输的长度以及RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第N个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝2，3，…，N。
其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝2，3，…，N。
其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序分别对应一个RV。
其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包 括：
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L为大于或者等于1的整数。
其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
其中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
其中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定。
其中，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，时隙边界或者上下行转换时刻前后的两个重复/分段按照其对应的RV，分别选择所述RV对应的编码比特输出，或者，根据时隙边界或者上下行转换时刻前后的两个重复/分段的长度，顺序选择所述RV对应的编码比特输出。
本公开的实施例还提供一种终端，包括：处理器，存储器，所述存储器上存有所述处理器可执行的程序，所述收发机获取传输物理上行共享信道PUSCH的配置信息；所述处理器执行所述程序时，实现：在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；所述收发机按照所述RV，传输所述PUSCH。
其中，所述处理器具体用于：根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；
按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；
根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
其中，所述处理器根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV时，具体用于：
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第N个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝2，3，…，N；或者，
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝2，3，…，N；或者，
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序分别对应一个RV；或者，
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L为大于或者等于1的整数；或者，
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
其中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
其中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定。
其中，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，时隙边界或者上下行转换时刻前后的两个重复/分段按照其对应的RV，分别选择所述RV对应的编码比特输出，或者，根据时隙边界或者上下行转换时刻前后的两个重复/分段的长度，顺序选择所述RV对应的编码比特输出。
本公开的实施例还提供一种终端，包括：
收发模块，用于获取传输物理上行共享信道PUSCH的配置信息；
处理模块，用于在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；所述收发模块，还用于按照所述RV，传输所述PUSCH。
本公开的实施例还提供一种信息传输方法，包括：
发送传输物理上行共享信道PUSCH的配置信息；
在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
按照所述RV，接收所述PUSCH。
其中，在所述PUSCH进行重复/分段传输时，根据所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；
按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；
根据所述PUSCH的重复/分段传输的长度以及RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第N个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝2，3，…，N。
其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝2，3，…，N。
其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序分别对应一个RV。
其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L为大于或者等于1的整数。
其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所 述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
其中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
其中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定。
其中，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，根据所述RV，将两个重复/分段分别输入到译码器，或者，将时隙边界或者上下行转换时刻前后的两个重复/分段级联后输入到译码器。
本公开的实施例还提供一种网络设备，包括：处理器，存储器，所述存储器上存有所述处理器可执行的程序，所述收发机发送传输物理上行共享信道PUSCH的配置信息；所述处理器执行所述程序时，实现：
在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
所述收发机按照所述RV，接收所述PUSCH。
其中，所述处理器具体用于：根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；根据所述PUSCH的重复/分段传输的长度以及RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
其中，所述处理器根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV时，具体用于：
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第 N个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝2，3，…，N；或者，
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝2，3，…，N；或者，
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序分别对应一个RV；或者，
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L为大于或者等于1的整数；或者，
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
其中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
其中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定。
其中，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，根据所述RV，将两个重复/分段分别输入到译码器，或者，将时隙边界或者上下行转换时刻前后的两个重复/分段级联后输入到译码器。
本公开的实施例还提供一种网络设备，包括：
收发模块，用于发送传输物理上行共享信道PUSCH的配置信息；
处理模块，用于在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
所述收发模块，用于按照所述RV，接收所述PUSCH。
本公开的实施例还提供一种计算机存储介质，包括指令，当所述指令在计算机运行时，使得计算机执行如上所述的方法。
本公开实施例的有益效果是：
本公开的上述实施例中，通过获取传输物理上行共享信道PUSCH的配置信息；在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；按照所述RV，传输所述PUSCH。从而实现PUSCH的各个重复/分段所占用的符号数不同时，可以依据各个重复/分段的长度(占用符号数的多少，具体中以是OFDM符号)，确定每个重复/分段对应的RV，可以提高数据传输的可靠性。
附图说明
图1为PUSCH的分段示意图；
图2为本公开的信息传输方法流程示意图；
图3为本公开的实施例中PUSCH的分段示意图；以及
图4为本公开的终端架构示意图。
具体实施方式
下面将参照附图更详细地描述本公开的示例性实施例。虽然附图中显示了本公开的示例性实施例，然而应当理解，可以以各种形式实现本公开而不应被这里阐述的实施例所限制。相反，提供这些实施例是为了能够更透彻地理解本公开，并且能够将本公开的范围完整的传达给本领域的技术人员。
如图2所示，本公开的实施例提供一种信息传输方法，应用于终端，方法包括：
步骤21，获取传输物理上行共享信道(PUSCH)的配置信息；所述配置信息至少包括：传输所述PUSCH的时域资源信息和RV配置信息。当然，还可以包括其它信息，比如DMRS(Demodulation Reference Sgnal，解调参考信号)配置信息。具体的，获取配置信息时，可以接收网络设备发送的下行控 制信息(DCI)信令、无线资源控制(RRC)信令和物理下行控制信道(PDCCH)中的至少一项；从所述DCI信令、RRC信令和PDCCH中的至少一项中，获取传输所述PUSCH的配置信息。
步骤22，在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
步骤23，按照所述RV，传输所述PUSCH。
本公开的实施例通过在所述PUSCH进行重复/分段传输时，根据获取到的配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，按照所述RV，传输所述PUSCH，提高了数据传输的可靠性。
本公开的一实施例中，步骤22具体可以包括：
步骤221，根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；
如图3所示，终端确定时隙边界或TDD上下行(UL/DL)转换的位置，终端根据PUSCH需要占用的时域资源和时隙边界或TDD上下行转换的位置，确定是一次还是多次传输，以及各重复/分段传输的长度，这里，各重复/分段传输的长度用各重复/分段传输占用的符号个数来确定，这里的符号如OFDM(Orthogonal Frequency Division Multiplexing，正交频分复用)符号。
步骤222，按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；
步骤223，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
具体的，该步骤223的一种实现方式可以包括：
步骤2231，若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第N个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝(2，3，…，N)。这里，按照该方法对PUSCH的所有重复/分段分别进行判断，对各重复/分段分别进行RV对应。
比如，gNB(网络设备，如基站)通过RRC信令和/或激活PDCCH，通知UE资源配置、DMRS配置、RV配置等，让UE开始PUSCH上行传输。假设RV配置信息中的RV序列＝{0 2 3 1}。
由于时隙边界或TDD上下行转换，需要把一次PUSCH传输分成四次(或多次)PUSCH传输或者四个PUSCH分段，四次重复传输或者四个PUSCH分段分别为seg1，seg2，seg3，seg4。这里以N和M相等为例进行说明，N和M不相等时，该方法同样也适用；
对于时隙边界或TDD上下行转换时刻之前的PUSCH传输或者PUSCH分段为seg1，时隙边界或TDD上下行转换时刻之后的PUSCH传输或者PUSCH分段为seg2、seg3和seg4；
按照该实施例的方法，seg1对应的RV为0，seg2的长度如果大于seg1，seg2对应的RV为0，seg3和seg4分别对应的RV为2和3，即seg2大于前一个RV为0的PUSCH传输/分段，则seg2对应的RV为0，即RV序列中的第一个RV，seg3和seg4按照RV序列中的RV顺序，依次重新设置其对应的RV，即seg3和seg4分别对应的RV为2和3；
依次再将seg3和seg2的长度进行比对，如果大于，将seg3对应的RV设置为0，seg4对应的RV设置为2，如果seg3小于seg2，则seg3对应的RV为2保持不变。
该步骤223的另一种实现方式可以包括：
步骤2232，若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝(2，3，…，N)，这里，按照该方法对PUSCH的所有重复/分段分别进行判断，对各重复/分段分别进行RV对应。
比如，gNB通过RRC信令和/或激活PDCCH，通知UE资源配置、DMRS配置、RV配置等，让UE开始PUSCH上行传输。假设RV配置信息中的RV序列＝{0 2 3 1}。
由于时隙边界或TDD上下行转换，需要把一次PUSCH传输分成四次(或多次)PUSCH传输或者四个PUSCH分段，四次重复传输或者四个PUSCH 分段分别为seg1，seg2，seg3，seg4。这里以N和M相等为例进行说明，N和M不相等时，该方法同样也适用；
对于时隙边界或TDD上下行转换时刻之前的PUSCH传输或者PUSCH分段为seg1，时隙边界或TDD上下行转换时刻之后的PUSCH传输或者PUSCH分段为seg2、seg3和seg4；
按照该实施例的方法，seg1对应的RV为0，seg2的长度如果大于seg1，seg2对应的RV为0，seg3和seg4分别保持其原来对应的RV不变，即seg3对应的RV为3，seg4对应的RV为1；
如果seg3的长度大于seg2，将seg3对应的RV设置为0，否则保持不变
该步骤223的又一种实现方式可以包括：
步骤2233，若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序分别对应一个RV。
比如，gNB通过RRC信令和/或激活PDCCH(物理下行控制信道)，通知UE资源配置、DMRS配置、RV配置等，让UE开始PUSCH上行传输。假设RV配置信息中的RV序列＝{0 2 3 1}。
由于时隙边界或TDD上下行转换，需要把一次PUSCH传输分成四次(或多次)PUSCH传输或者四个PUSCH分段，四次重复传输或者四个PUSCH分段分别为seg1，seg2，seg3，seg4。这里以N和M相等为例进行说明，N和M不相等时，该方法同样也适用；
对于时隙边界或TDD上下行转换时刻之前的PUSCH传输或者PUSCH分段为seg1，时隙边界或TDD上下行转换时刻之后的PUSCH传输或者PUSCH分段为seg2、seg3和seg4；
按照该实施例的方法，对所有seg按照从长到短进行排序，得到的序列为seg2>seg1>seg4>seg3。那么对排序后的重复/分段确定RV时，seg1、seg2、seg3、seg4的RV依次为2、0、1、3。
该步骤223的又一种实现方式可以包括：
步骤2234，若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L 个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L为大于或者等于1的整数。
比如，gNB通过RRC信令和/或激活PDCCH，通知UE资源配置、DMRS配置、RV配置等，让UE开始PUSCH上行传输。假设RV配置信息中的RV序列＝{0 2 3 1}。
由于时隙边界或TDD上下行转换，需要把一次PUSCH传输分成四次(或多次)PUSCH传输或者四个PUSCH分段，四次重复传输或者四个PUSCH分段分别为seg1，seg2，seg3，seg4。
一次PUSCH传输分成8次PUSCH传输或者PUSCH分段，分别为seg1～8，对所有seg按照从长到短进行排序，得到的序列为seg2>seg1>seg5>seg6>seg4>seg3>seg8>seg7。那么对排序后的重复/分段确定RV时，其对应的RV序列是由多个信令通知的RV序列级联而成的，即{0 2 3 1 0 2 3 1}，所以，seg2、seg1、seg5、seg6、seg4、seg3、seg8、seg7的RV依次为0 2 3 1 0 2 3 1。
该步骤223的又一种实现方式可以包括：
步骤2235，若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
比如，gNB通过RRC信令和/或激活PDCCH，通知UE资源配置、DMRS配置、RV配置等，让UE开始PUSCH上行传输。假设RV配置信息中的RV序列＝{0 2 3 1}。
一次PUSCH传输分成8次PUSCH传输或者PUSCH分段，分别为seg1～8，对所有seg按照从长到短进行排序，得到的序列为seg2>seg1>seg4>seg3。那么对排序后的重复/分段确定RV时，seg1、seg2、seg3、seg4的RV依次为2、0、1、3，seg5、seg6、seg7、seg8的RV也依次为2、0、1、3，这里seg5、seg6、seg7、seg8不再按长度排序。
本公开的上述实施例中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
本公开的一实施例中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定；比如，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同或者不相同。如3所示，时隙边界或者上下行转换时刻前后的两个重复/分段(seg1和seg2)的RV值相同或者不相同。
相应的，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，时隙边界或者上下行转换时刻前后的两个重复/分段按照其对应的RV，分别选择所述RV对应的编码比特输出，或者，根据时隙边界或者上下行转换时刻前后的两个重复/分段的长度，顺序选择所述RV对应的编码比特输出。
比如，图3所示的seg1和seg2对应的RV均为2，则seg1和seg2均按照RV的值为2选择其编码比特输出，在选择其编码比特输出时，seg1占用4个符号(即长度为4)和seg2占用10个符号(即长度为10)，假设每10个编码比特占用1个符号(频域上1个或多个RB)，按照RV的值为2，可以选择140个编码比特，其中，seg1选择14个编码比特中的前40个比特(比如比特0至比特39)，seg2选择14个编码比特中的前100比特(比如比特0至比特99)；在基站侧，基站得到seg1后按照RV＝2进行一次译码，基站得到seg2后按照RV＝2再进行一次译码，基站得到seg2后还可以按照RV＝2与seg1进行软合并后再进行一次译码。
又比如，图3所示的seg1和seg2对应的RV均为2，则seg1和seg2均按照RV的值为2选择其编码比特输出，在选择其编码比特输出时，seg1占用4个符号(即长度为4)和seg2占用10个符号(即长度为10)，假设每10个编码比特占用1个符号(频域上1个或多个RB)，按照RV的值为2，可以选择140个编码比特，其中，seg1选择140个编码比特中的前40个比特(比如比特0至比特39)，seg2选择140个编码比特中的后100比特(比如比特40至比特139)。在基站侧，基站得到seg1和seg2后，进行前后级联，获得新的重复/分段segN，按照RV＝2进行一次译码。
其中，在按照时间先后顺序确定各个PUSCH重复/分段分别对应的RV 的情况下，或者，基于本公开的上述实施例中按照PUSCH重复/分段的长度确定各PUSCH重复/分段对应的RV的情况下，当存在多个RV为0的PUSCH重复/分段并且系统允许从任一个RV为0的PUSCH重复/分段开始PUSCH传输，所述PUSCH传输开始的第1个重复/分段根据第一条件以及第二条件确定，或者，根据第一条件以及第三条件确定；所述第一条件是所述重复/分段的RV为0；所述第二条件是所述重复/分段若属于分割得到的重复分段传输时不是时隙边界或者上下行转换时刻之后的重复/分段；所述第三条件是所述重复/分段传输不属于分割得到的重复/分段。
又比如，图3所示的seg1(可以是PUSCH-repetition)和seg2(可以是PUSCH-repetition)对应的RV均为0，则seg1和seg2均按照RV的值为0选择其编码比特输出，在选择其编码比特输出时，seg1占用4个符号(即长度为4)和seg2占用10个符号(即长度为10)，假设每10个编码比特占用1个符号(频域上1个或多个RB)，按照RV的值为0，可以选择140个编码比特，其中，seg1选择140个编码比特中的前40个比特(比如比特0至比特39)，seg2选择140个编码比特中的后100比特(比如比特40至比特139)。在基站侧，基站得到seg1和seg2后，进行前后级联，获得新的重复/分段segN，按照RV＝0进行一次译码。
其中，在确定seg1、seg2能否成为一次PUSCH传输对应的两个重复/分段传输中第一个被传输的重复/分段传输时，需要判断两个条件，第一个是所述重复/分段传输的RV为0，此时seg1和seg2的RV均为0，即均满足第一个条件；第二个是所述重复/分段传输若属于分割得到的重复分段传输时不能是时隙边界或者上下行转换时刻之后的重复/分段，这里seg2是被分割得到的时隙边界或者上下行转换时刻之后的重复/分段，seg1不是，所以seg1可以作为第一个被传输的重复/分段传输，seg2不可以作为第一个被传输的重复/分段传输。如果第二个条件改变为所述重复/分段传输不属于分割得到的重复/分段，那么seg1和seg2均不可以作为第一个被传输的重复/分段传输。这里的第一个被传输的重复/分段传输，是指开始整个PUSCH的传输。
当inter-PUSCH-repetition跳频开启时，时隙边界或者上下行转换时刻前后的两个重复/分段使用相同的频域资源，即这两个重复/分段不相互跳频。
本公开的上述实施例，通过在所述PUSCH进行重复/分段传输时，根据获取到的配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，按照所述RV，传输所述PUSCH，提高了数据传输的可靠性。
如图4所示，本公开的实施例还提供一种终端40，包括：收发机41，处理器42，存储器43，所述存储器43上存有所述处理器42可执行的程序，所述收发机41获取传输物理上行共享信道PUSCH的配置信息；所述处理器42执行所述程序时，实现：在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；所述收发机41按照所述RV，传输所述PUSCH。
其中，收发机41获取传输物理上行共享信道PUSCH的配置信息时，具体用于：接收网络设备发送的下行控制信息DCI信令、无线资源控制RRC信令和物理下行控制信道PDCCH中的至少一项；
从所述DCI信令、RRC信令和PDCCH中的至少一项中，获取传输所述PUSCH的配置信息。
其中，所述配置信息至少包括：传输所述PUSCH的时域资源信息和RV配置信息。
其中，所述处理器42具体用于：根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；
按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；
根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
其中，所述处理器根据所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，具体用于：
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第N 个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝(2，3，…，N)；或者，
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝(2，3，…，N)；或者，
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序分别对应一个RV；或者，
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L为大于或者等于1的整数；或者，
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
其中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
其中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定。
其中，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，时隙边界或者上下行转换时刻前后的两个重复/分段按照其对应的RV，分别选择所述RV对应的编码比特输出，或者，根据时隙边界或者上下行转换时刻前后的两个重复/分段的长度，顺序选择所述RV对应的编码比特输出。
当inter-PUSCH-repetition跳频开启时，时隙边界或者上下行转换时刻前后的两个重复/分段使用相同的频域资源，即这两个重复/分段不相互跳频。
上述图2所示方法中的所有实施列均适用于该实施例中，也能达到相同的技术效果。收发机41与处理器42，以及，收发机41与存储器43之间， 均可以通过总线接口连接，收发机41的功能可以由处理器42实现，处理器42的功能也可以由收发机41实现。
本公开的实施例还提供一种终端，包括：
收发模块，用于获取传输物理上行共享信道PUSCH的配置信息；
处理模块，用于在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；所述收发模块，还用于按照所述RV，传输所述PUSCH。上述图2所示方法中的所有实施列均适用于该实施例中，也能达到相同的技术效果。
本公开的实施例还提供一种信息传输方法，包括：
步骤51，发送传输物理上行共享信道PUSCH的配置信息；
步骤52，在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
步骤53，按照所述RV，接收所述PUSCH。
其中，步骤52具体可以包括：
步骤521，根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；
步骤522，按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；
步骤523，根据所述PUSCH的重复/分段传输的长度以及RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
其中，步骤523可以包括以下至少一项：
步骤5231，若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第N个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝(2，3，…，N)。
步骤5232，若所述RV配置信息中的RV序列包括M个RV，所述PUSCH 的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝(2，3，…，N)。
步骤5233，若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序分别对应一个RV。
步骤5234，若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L为大于或者等于1的整数。
步骤5235，若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
其中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
其中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定。
其中，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，根据所述RV，将两个重复/分段分别输入到译码器，或者，将时隙边界或者上下行转换时刻前后的两个重复/分段级联后输入到译码器。
该实施例的方法可以应用于网络设备，如基站，该方法中确定PUSCH的各重复/分段传输对应的RV，和上述图2所示方法中的所有实施列相同，上述图2所示方法中的所有实施例均适用于该实施例中，也能达到相同的技术效果。
本公开的实施例还提供一种网络设备，包括：处理器，存储器，所述存储器上存有所述处理器可执行的程序，所述收发机发送传输物理上行共享信 道PUSCH的配置信息；所述处理器执行所述程序时，实现：
在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
所述收发机按照所述RV，接收所述PUSCH。
其中，所述处理器具体用于：根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；根据所述PUSCH的重复/分段传输的长度以及RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
其中，所述处理器根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV时，具体用于：
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第N个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝(2，3，…，N)；或者，
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝(2，3，…，N)；或者，
若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序分别对应一个RV；或者，
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L 为大于或者等于1的整数；或者，
若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
其中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
其中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定。
其中，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，根据所述RV，将两个重复/分段分别输入到译码器，或者，将时隙边界或者上下行转换时刻前后的两个重复/分段级联后输入到译码器。
本公开的实施例还提供一种网络设备，包括：
收发模块，用于发送传输物理上行共享信道PUSCH的配置信息；
处理模块，用于在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
所述收发模块，用于按照所述RV，接收所述PUSCH。
需要说明的是，上述网络设备侧的方法中的所有实施列均适用于该实施例中，也能达到相同的技术效果。
本公开的实施例还提供一种计算机存储介质，包括指令，当所述指令在计算机运行时，使得计算机执行如终端侧或者网络设备侧的方法。上述方法实施列中的所有实现方式均适用于该实施例中，也能达到相同的技术效果。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本公开的范围。
所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描 述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本公开所提供的实施例中，应该理解到，所揭露的装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本公开各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本公开的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本公开各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。
此外，需要指出的是，在本公开的装置和方法中，显然，各部件或各步骤是可以分解和/或重新组合的。这些分解和/或重新组合应视为本公开的等效方案。并且，执行上述系列处理的步骤可以自然地按照说明的顺序按时间顺序执行，但是并不需要一定按照时间顺序执行，某些步骤可以并行或彼此独立地执行。对本领域的普通技术人员而言，能够理解本公开的方法和装置的 全部或者任何步骤或者部件，可以在任何计算装置(包括处理器、存储介质等)或者计算装置的网络中，以硬件、固件、软件或者它们的组合加以实现，这是本领域普通技术人员在阅读了本公开的说明的情况下运用他们的基本编程技能就能实现的。
因此，本公开的目的还可以通过在任何计算装置上运行一个程序或者一组程序来实现。所述计算装置可以是公知的通用装置。因此，本公开的目的也可以仅仅通过提供包含实现所述方法或者装置的程序代码的程序产品来实现。也就是说，这样的程序产品也构成本公开，并且存储有这样的程序产品的存储介质也构成本公开。显然，所述存储介质可以是任何公知的存储介质或者将来所开发出来的任何存储介质。还需要指出的是，在本公开的装置和方法中，显然，各部件或各步骤是可以分解和/或重新组合的。这些分解和/或重新组合应视为本公开的等效方案。并且，执行上述系列处理的步骤可以自然地按照说明的顺序按时间顺序执行，但是并不需要一定按照时间顺序执行。某些步骤可以并行或彼此独立地执行。
可以理解的是，本公开实施例描述的这些实施例可以用硬件、软件、固件、中间件、微码或其组合来实现。对于硬件实现，模块、单元、子模块、子单元等可以实现在一个或多个专用集成电路(Application Specific Integrated Circuits，ASIC)、数字信号处理器(Digital Signal Processing，DSP)、数字信号处理设备(DSP Device，DSPD)、可编程逻辑设备(Programmable Logic Device，PLD)、现场可编程门阵列(Field-Programmable Gate Array，FPGA)、通用处理器、控制器、微控制器、微处理器、用于执行本公开所述功能的其它电子单元或其组合中。
对于软件实现，可通过执行本公开实施例所述功能的模块(例如过程、函数等)来实现本公开实施例所述的技术。软件代码可存储在存储器中并通过处理器执行。存储器可以在处理器中或在处理器外部实现。
因此，本公开的目的还可以通过在任何计算装置上运行一个程序或者一组程序来实现。所述计算装置可以是公知的通用装置。因此，本公开的目的也可以仅仅通过提供包含实现所述方法或者装置的程序代码的程序产品来实现。也就是说，这样的程序产品也构成本公开，并且存储有这样的程序产 品的存储介质也构成本公开。显然，所述存储介质可以是任何公知的存储介质或者将来所开发出来的任何存储介质。还需要指出的是，在本公开的装置和方法中，显然，各部件或各步骤是可以分解和/或重新组合的。这些分解和/或重新组合应视为本公开的等效方案。并且，执行上述系列处理的步骤可以自然地按照说明的顺序按时间顺序执行，但是并不需要一定按照时间顺序执行。某些步骤可以并行或彼此独立地执行。
以上所述的是本公开的可选实施方式，应当指出对于本技术领域的普通人员来说，在不脱离本公开所述的原理前提下还可以作出若干改进和润饰，这些改进和润饰也在本公开的保护范围内。

Claims (35)

  1. 一种信息传输方法，包括：
    获取传输物理上行共享信道PUSCH的配置信息；
    在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
    按照所述RV，传输所述PUSCH。
  2. 根据权利要求1所述的信息传输方法，其中，在所述PUSCH进行重复/分段传输时，根据所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；
    按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；
    根据所述PUSCH的重复/分段传输的长度以及RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
  3. 根据权利要求2所述的信息传输方法，其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第N个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝2，3，…，N。
  4. 根据权利要求2所述的信息传输方法，其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个 重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝2，3，…，N。
  5. 根据权利要求2所述的信息传输方法，其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序分别对应一个RV。
  6. 根据权利要求2所述的信息传输方法，其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L为大于或者等于1的整数。
  7. 根据权利要求2所述的信息传输方法，其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
  8. 根据权利要求3至7任一项所述的信息传输方法，其中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
  9. 根据权利要求2所述的信息传输方法，其中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定。
  10. 根据权利要求9所述的信息传输方法，其中，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，时隙边界或者上下行转换时刻前后的两个重复/分段按照其对应的RV，分别选择所述RV对应的编码比特输出，或者，根据时隙边界或者上下行转换时刻前后的两个重复/分段的长度，顺序选择所述RV对应的编码比特输出。
  11. 一种终端，包括：处理器，存储器，所述存储器上存有所述处理器可执行的程序，所述收发机获取传输物理上行共享信道PUSCH的配置信息；
    所述处理器执行所述程序时，实现：在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
    所述收发机按照所述RV，传输所述PUSCH。
  12. 根据权利要求11所述的终端，其中，所述处理器具体用于：
    根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；
    按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；
    根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
  13. 根据权利要求12所述的终端，其中，所述处理器根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV时，具体用于：
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第N个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝2，3，…，N；或者，
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝2，3，…，N；或者，
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序分别对应一个RV；或者，
    若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L为大于或者等于1的整数；或者，
    若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
  14. 根据权利要求13所述的终端，其中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
  15. 根据权利要求12所述的终端，其中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定。
  16. 根据权利要求15所述的终端，其中，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，时隙边界或者上下行转换时刻前后的两个重复/分段按照其对应的RV，分别选择所述RV对应的编码比特输出，或者，根据时隙边界或者上下行转换时刻前后的两个重复/分段的长度，顺序选择所述RV对应的编码比特输出。
  17. 一种终端，包括：
    收发模块，用于获取传输物理上行共享信道PUSCH的配置信息；
    处理模块，用于在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；所述收发模块还用于按照所述RV，传输所述PUSCH。
  18. 一种信息传输方法，包括：
    发送传输物理上行共享信道PUSCH的配置信息；
    在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
    按照所述RV，接收所述PUSCH。
  19. 根据权利要求18所述的信息传输方法，其中，在所述PUSCH进行重复/分段传输时，根据所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；
    按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；
    根据所述PUSCH的重复/分段传输的长度以及RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
  20. 根据权利要求19所述的信息传输方法，其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第N个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝2，3，…，N。
  21. 根据权利要求19所述的信息传输方法，其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝2，3，…，N。
  22. 根据权利要求19所述的信息传输方法，其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序分别对应一个RV。
  23. 根据权利要求19所述的信息传输方法，其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L为大于或者等于1的整数。
  24. 根据权利要求19所述的信息传输方法，其中，根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV，包括：
    若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
  25. 根据权利要求20至24任一项所述的信息传输方法，其中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
  26. 根据权利要求19所述的信息传输方法，其中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定。
  27. 根据权利要求26所述的信息传输方法，其中，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，根据所述RV，将两个重复/ 分段分别输入到译码器，或者，将时隙边界或者上下行转换时刻前后的两个重复/分段级联后输入到译码器。
  28. 一种网络设备，包括：处理器，存储器，所述存储器上存有所述处理器可执行的程序，所述收发机发送传输物理上行共享信道PUSCH的配置信息；所述处理器执行所述程序时，实现：
    在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
    所述收发机按照所述RV，接收所述PUSCH。
  29. 根据权利要求28所述的网络设备，其中，所述处理器具体用于：根据所述PUSCH的时域资源信息，以及时隙边界或者上下行转换时刻，获得所述PUSCH的各重复/分段传输的长度；按照所述PUSCH的各重复/分段传输的长度，将所述PUSCH分为N个重复/分段，N为大于或者等于2的整数；根据所述PUSCH的重复/分段传输的长度以及RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV。
  30. 根据权利要求29所述的网络设备，其中，所述处理器根据所述PUSCH的重复/分段传输的长度以及所述RV配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV时，具体用于：
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，第i+1个重复/分段至第N个重复/分段按照RV序列中RV的顺序，分别对应RV序列中的第2至第M个RV，i＝2，3，…，N；或者，
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的第1个重复/分段对应的RV为0，第i个重复/分段的长度大于前一个RV为0的重复/分段的长度时，第i个重复/分段对应的RV为0，i＝(2，3，…，N)；或者，
    若所述RV配置信息中的RV序列包括M个RV，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照RV序列中RV的顺序 分别对应一个RV；或者，
    若所述RV配置信息中的RV序列包括M个RV，在N大于M时，确定第一目标RV序列，所述第一目标RV序列包括L*M个RV，且L个所述RV序列顺序排列，所述PUSCH的N个重复/分段按照从长到短的顺序排列后的重复/分段，按照所述第一目标RV序列中RV的顺序分别对应一个RV；L为大于或者等于1的整数；或者，
    若所述RV配置信息中的RV序列包括M个RV，在N大于M时，且所述PUSCH的N个重复/分段中前M个重复/分段，按照长度排序后，按照RV序列中RV的顺序分别对应一个RV，所述PUSCH的第M+1至第N个重复/分段，按照所述前M个重复/分段对应的RV的顺序，分别对应一个RV。
  31. 根据权利要求30所述的网络设备，其中，当所述PUSCH的两个重复/分段的长度相同时，所述PUSCH的两个重复/分段排列顺序按照时间的先后进行排序。
  32. 根据权利要求29所述的网络设备，其中，时隙边界或者上下行转换时刻之后的重复/分段的RV值，根据时隙边界或者上下行转换时刻之前的重复/分段的RV值确定。
  33. 根据权利要求32所述的网络设备，其中，时隙边界或者上下行转换时刻前后的两个重复/分段的RV值相同时，根据所述RV，将两个重复/分段分别输入到译码器，或者，将时隙边界或者上下行转换时刻前后的两个重复/分段级联后输入到译码器。
  34. 一种网络设备，包括：
    收发模块，用于发送传输物理上行共享信道PUSCH的配置信息；
    处理模块，用于在所述PUSCH进行重复/分段传输时，根据所述PUSCH的重复/分段传输的长度以及所述配置信息，得到至少两个所述PUSCH的重复/分段传输的分别对应的冗余版本RV；
    所述收发模块，用于按照所述RV，接收所述PUSCH。
  35. 一种计算机存储介质，包括指令，当所述指令在计算机运行时，使得计算机执行如权利要求1至10任一项所述的方法，或者，权利要求18至27任一项所述的方法。
PCT/CN2020/082050 2019-04-02 2020-03-30 信息传输方法及终端 WO2020200163A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP20783667.7A EP3952530B1 (en) 2019-04-02 2020-03-30 Information transmission method and terminal
US17/600,504 US12095562B2 (en) 2019-04-02 2020-03-30 Information transmission method and user equipment

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
CN201910263377.9 2019-04-02
CN201910263377 2019-04-02
CN201910267628 2019-04-03
CN201910267628.0 2019-04-03
CN201911083619.2 2019-11-07
CN201911083619.2A CN111800870B (zh) 2019-04-02 2019-11-07 信息传输方法及终端

Publications (1)

Publication Number Publication Date
WO2020200163A1 true WO2020200163A1 (zh) 2020-10-08

Family

ID=72664988

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/082050 WO2020200163A1 (zh) 2019-04-02 2020-03-30 信息传输方法及终端

Country Status (3)

Country Link
US (1) US12095562B2 (zh)
EP (1) EP3952530B1 (zh)
WO (1) WO2020200163A1 (zh)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108292976A (zh) * 2015-11-19 2018-07-17 索尼公司 电信装置和方法
WO2019032748A1 (en) * 2017-08-10 2019-02-14 Sharp Laboratories Of America, Inc. PROCEDURES, BASE STATION AND USER EQUIPMENT FOR UPLINK TRANSMISSION WITHOUT AUTHORIZATION

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9526091B2 (en) * 2012-03-16 2016-12-20 Intel Corporation Method and apparatus for coordination of self-optimization functions in a wireless network
US20180152271A1 (en) * 2015-05-23 2018-05-31 Lg Electronics Inc. Wireless device and method for uplink transmission using orthogonal spreading code
CN106993332B (zh) * 2016-01-20 2019-07-02 中兴通讯股份有限公司 上行调度的方法及装置
CN110431781B (zh) * 2017-03-22 2022-01-21 康维达无线有限责任公司 无线电信设备和方法
ES2935609T3 (es) * 2017-03-23 2023-03-08 Ericsson Telefon Ab L M Configuración de paquetes de datos de perforación para un primer servicio en una transmisión de un segundo servicio
WO2019051242A2 (en) * 2017-09-08 2019-03-14 Convida Wireless, Llc COMMUNICATION MANAGEMENT USING DOWNLINK COMMAND INFORMATION
EP3682576A4 (en) * 2017-09-11 2021-04-28 Nokia Technologies Oy UPRIGHT LINK TRANSMISSION PROCESS AND APPARATUS
US11025456B2 (en) * 2018-01-12 2021-06-01 Apple Inc. Time domain resource allocation for mobile communication
CN111788806B (zh) * 2018-02-13 2024-03-01 株式会社Ntt都科摩 用户终端以及无线通信方法
US10849050B2 (en) * 2018-02-16 2020-11-24 Qualcomm Incorporated Methods and apparatuses for rate matching
PL3754876T3 (pl) * 2018-02-17 2024-06-24 Wilus Institute Of Standards And Technology Inc. Sposób przesyłania informacji sterujących łączem wstępującym w systemie komunikacji bezprzewodowej i aparat wykorzystujący ten sposób
JP2019186676A (ja) * 2018-04-05 2019-10-24 シャープ株式会社 基地局装置および端末装置
JP2019193194A (ja) * 2018-04-27 2019-10-31 シャープ株式会社 基地局装置および端末装置
JP2020025183A (ja) * 2018-08-07 2020-02-13 シャープ株式会社 端末装置および基地局装置
EP3648528A1 (en) * 2018-11-01 2020-05-06 Comcast Cable Communications, LLC Radio resource allocation for access link
US11564223B2 (en) * 2019-05-30 2023-01-24 Electronics And Telecommunications Research Institute Method and apparatus for uplink communication in unlicensed band

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108292976A (zh) * 2015-11-19 2018-07-17 索尼公司 电信装置和方法
WO2019032748A1 (en) * 2017-08-10 2019-02-14 Sharp Laboratories Of America, Inc. PROCEDURES, BASE STATION AND USER EQUIPMENT FOR UPLINK TRANSMISSION WITHOUT AUTHORIZATION

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
NOKIA ET AL.: "Summary of Friday offline discussion on potential enhancements for PUSCH for NR URLLC (AI 7.2.6.1.3)", 3GPP TSG-RAN WG1 MEETING #96 R1-1903797, 1 March 2019 (2019-03-01), XP051691042 *
NOKIA ET AL.: "Summary of offline discussion on the potential enhancements for PUSCH for NR URLLC", 3GPP TSG RAN WG1 MEETING #95 R1-1814326, 16 November 2018 (2018-11-16), XP051494779 *
See also references of EP3952530A4 *

Also Published As

Publication number Publication date
EP3952530A4 (en) 2022-06-08
EP3952530A1 (en) 2022-02-09
US20220166551A1 (en) 2022-05-26
EP3952530B1 (en) 2024-06-05
US12095562B2 (en) 2024-09-17

Similar Documents

Publication Publication Date Title
US11689220B2 (en) Method and device for interleaving data
CN110249539B (zh) 极化码交错和比特选择
US11212036B2 (en) Data communication method, device, and system
US9742440B2 (en) HARQ rate-compatible polar codes for wireless channels
CN108347302B (zh) 一种编译码方法和终端
CN109039344B (zh) 编码输入数据为极性码的方法及设备、解码方法及其设备
WO2018196765A1 (zh) Polar码传输方法及装置
US11265108B2 (en) Method and device for rate matching and polar encoding
US12132569B2 (en) Method for sidelink rate matching and resource mapping, and device
CN108696333B (zh) Polar码编解码的方法、装置和设备
CN109039546B (zh) 一种用于信道编码的ue、基站中的方法和设备
WO2020200163A1 (zh) 信息传输方法及终端
CN110519018B (zh) 一种被用于信道编码的ue、基站中的方法和设备
CN108574562A (zh) 数据传输方法及装置
CN111800870B (zh) 信息传输方法及终端
CN109392102B (zh) DCI format消息的发送方法、检测方法、相关设备及系统
EP3857747A1 (en) Bit selection for hybrid automatic repeat requests
KR20090051139A (ko) 이동 통신 시스템에서의 연합 부호화 방법

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2020783667

Country of ref document: EP

Effective date: 20211102