CN111800870A - Information transmission method and terminal - Google Patents
Information transmission method and terminal Download PDFInfo
- Publication number
- CN111800870A CN111800870A CN201911083619.2A CN201911083619A CN111800870A CN 111800870 A CN111800870 A CN 111800870A CN 201911083619 A CN201911083619 A CN 201911083619A CN 111800870 A CN111800870 A CN 111800870A
- Authority
- CN
- China
- Prior art keywords
- pusch
- sequence
- repetition
- repeated
- segmented
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 title abstract description 180
- 238000000034 method Methods 0.000 title abstract description 41
- 101100421134 Schizosaccharomyces pombe (strain 972 / ATCC 24843) sle1 gene Proteins 0.000 description 39
- 230000011218 segmentation Effects 0.000 description 36
- 238000006243 chemical reaction Methods 0.000 description 24
- 230000011664 signaling Effects 0.000 description 13
- 238000012163 sequencing technique Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 230000004913 activation Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000007704 transition Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000000354 decomposition reaction Methods 0.000 description 2
- 230000006798 recombination Effects 0.000 description 2
- 238000005215 recombination Methods 0.000 description 2
- 230000009897 systematic effect Effects 0.000 description 2
- 230000003213 activating effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
Classifications
-
- 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
- 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/189—Transmission or retransmission of more than one copy of a message
-
- 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/12—Wireless traffic scheduling
- H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
- H04W72/1268—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of uplink data flows
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an information transmission method and a terminal, wherein the information transmission method comprises the following steps: acquiring configuration information of a Physical Uplink Shared Channel (PUSCH) to be transmitted; when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information; and transmitting the PUSCH according to the RV. The scheme of the invention can improve the reliability of data transmission.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to an information transmission method and a terminal.
Background
With the development of mobile communication service demand, New wireless communication systems (i.e., 5G NR, 5Generation New RAT) are being researched in the future. In the 5G NR system, an important requirement is Low-delay and high-reliability communication, and transmission schemes such as URLLC (Ultra Reliable Low Latency communication) have appeared.
In the uplink transmission scheme of URLLC, in order to reduce delay, a scheduling-free scheme is adopted, and in order to increase reliability, sufficient resources need to be ensured.
In an FDD (Frequency Division Duplex) system, when PUSCH (Physical Uplink Shared Channel) transmission occupying L symbols at a time needs to cross a slot boundary, PUSCH (Physical Uplink Shared Channel) needs to be divided into two or more PUSCHs for transmission, and an OFDM (Orthogonal Frequency Division Multiplexing) symbol position to be occupied by each PUSCH transmission needs to be determined.
In a TDD (Time Division Duplex) system, a slot boundary and an uplink/downlink switching interval are processed, and when PUSCH transmission occupying L symbols at a Time needs to cross the slot boundary or the uplink/downlink switching interval, PUSCH transmission needs to be divided into two or more PUSCHs for transmission, and an OFDM symbol position to be occupied by each PUSCH transmission needs to be determined.
For a transport block TB, when a plurality of PUSCHs are divided for repeat/segment transmission, a Redundancy Version (RV) needs to be configured for each repeat/segment, and the selection of the RV needs to consider decoding performance and self-decodable performance, usually, systematic bits in encoding have a larger influence on the decoding performance and the self-decodable performance, check bits in encoding have a smaller influence on the decoding performance and the self-decodable performance, but better decoding performance can be achieved if the systematic bits and the check bits are matched in number proportion.
In the existing URLLC, for the RV configuration problem, the related technical solutions are as follows: according TO the current standard, through RRC (Radio Resource Control) configuration, for example, the number of times of repeated transmission K is 4, RV is { 0231 }, the time domain Resource position is { initial OFDM symbol, number of OFDM symbols }, the time domain Resource position is defined as one transmission opportunity TO, that is, the Resource position for completing one repeated transmission, and K4 means that four TOs are required for performing four repeated transmissions. When data is transmitted on the first TO, RV ═ 0 is used; when data is transmitted on the second TO, RV 2 is used; when data is transmitted on the third TO, RV — 3 is used; when data is transmitted on the fourth TO, RV 1 is used.
In fig. 1, for a PUSCH transmission with a length L, when the PUSCH transmission needs to cross a slot boundary or an uplink-downlink switching interval, the PUSCH transmission is divided into two transmissions. If N symbols are occupied before the time slot boundary or the uplink and downlink conversion interval, L-N symbols are occupied after the time slot boundary or the uplink and downlink conversion interval, and N or L-N is not limited. When the lengths of the respective repetitions/segments are different, how the RVs of the respective repetitions/segments are configured, there is no solution at present.
Disclosure of Invention
The embodiment of the invention provides an information transmission method and a terminal. When the number of symbols occupied by each repetition/segment of the PUSCH is different, the RV corresponding to each repetition/segment may be determined according to the length of each repetition/segment (the number of occupied symbols), which may improve the reliability of data transmission.
In order to solve the above technical problem, an embodiment of the present invention provides the following technical solutions:
an information transmission method, comprising:
acquiring configuration information of a Physical Uplink Shared Channel (PUSCH) to be transmitted;
when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information;
and transmitting the PUSCH according to the RV.
When the PUSCH is repeatedly/sectionally transmitted, obtaining redundancy versions RV corresponding to the repeated/sectionally transmitted PUSCH of at least two PUSCH according to the length of the repeated/sectionally transmitted PUSCH and the configuration information, including:
acquiring the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH and a time slot boundary or uplink and downlink conversion time;
dividing the PUSCH into N repetitions/segments according to the length of each repetition/segment transmission of the PUSCH, wherein N is an integer greater than or equal to 2;
and obtaining redundancy versions RV respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the RV configuration information.
Obtaining redundancy versions RV respectively corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, comprising:
if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and when the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and the i +1 th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, where i is 2, 3, …, N, in the RV sequence according to the sequence of the RVs.
Obtaining redundancy versions RV respectively corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, comprising:
if the RV sequence in the RV configuration information includes M RVs, an RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and when the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, where i is 2, 3, …, N.
Obtaining redundancy versions RV respectively corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, comprising:
if the RV sequence in the RV configuration information includes M RVs, the N repetitions/segments of the PUSCH are arranged in a sequence from long to short, and correspond to one RV according to the sequence of the RVs in the RV sequence.
Obtaining redundancy versions RV respectively corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, comprising:
if the RV sequence in the RV configuration information comprises M RVs, when N is larger than M, determining a first target RV sequence, wherein the first target RV sequence comprises L M RVs, the L RV sequences are sequentially arranged, the N repeated/segmented of the PUSCH are repeated/segmented after being sequentially arranged from long to short, and the N repeated/segmented of the PUSCH respectively corresponds to one RV according to the sequence of the RV in the first target RV sequence; l is an integer greater than or equal to 1.
Obtaining redundancy versions RV respectively corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, comprising:
if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and after being sorted according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to nth repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
And when the lengths of the two repetitions/segments of the PUSCH are the same, sequencing the two repetitions/segments of the PUSCH according to the time sequence.
And determining the RV value of the repetition/segmentation after the time slot boundary or the uplink and downlink switching time according to the RV value of the repetition/segmentation before the time slot boundary or the uplink and downlink switching time.
And respectively selecting the coded bit output corresponding to the RV according to the RV corresponding to the time slot boundary or the two repeated/segmented values before and after the uplink and downlink conversion time, or sequentially selecting the coded bit output corresponding to the RV according to the length of the time slot boundary or the two repeated/segmented values before and after the uplink and downlink conversion time.
An embodiment of the present invention further provides a terminal, including: a processor, a memory storing a program executable by the processor, the transceiver obtaining configuration information for transmitting a physical uplink shared channel, PUSCH; the processor, when executing the program, implements: when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information; and the transceiver transmits the PUSCH according to the RV.
Wherein the processor is specifically configured to: acquiring the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH and a time slot boundary or uplink and downlink conversion time;
dividing the PUSCH into N repetitions/segments according to the length of each repetition/segment transmission of the PUSCH, wherein N is an integer greater than or equal to 2;
and obtaining redundancy versions RV respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCHs and the RV configuration information.
Wherein, when the processor obtains redundancy versions RV corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, the processor is specifically configured to:
if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and the (i + 1) th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, where i is 2, 3, …, N, in the RV sequence according to the sequence of the RVs; or,
if the RV sequence in the RV configuration information includes M RVs, an RV corresponding to a 1 st repetition/segment of the PUSCH is 0, and when the length of an ith repetition/segment is greater than the length of a repetition/segment with a previous RV of 0, the RV corresponding to the ith repetition/segment is 0, where i is 2, 3, …, N; or,
if the RV sequence in the RV configuration information comprises M RVs, the N repeated/segmented of the PUSCH are respectively corresponding to one RV according to the sequence of the RVs in the RV sequence, wherein the repeated/segmented N of the PUSCH are arranged according to the sequence from long to short; or,
if the RV sequence in the RV configuration information comprises M RVs, when N is larger than M, determining a first target RV sequence, wherein the first target RV sequence comprises L M RVs, the L RV sequences are sequentially arranged, the N repeated/segmented of the PUSCH are repeated/segmented after being sequentially arranged from long to short, and the N repeated/segmented of the PUSCH respectively corresponds to one RV according to the sequence of the RV in the first target RV sequence; l is an integer greater than or equal to 1; or,
if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and after being sorted according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to nth repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
And when the lengths of the two repetitions/segments of the PUSCH are the same, sequencing the two repetitions/segments of the PUSCH according to the time sequence.
And determining the RV value of the repetition/segmentation after the time slot boundary or the uplink and downlink switching time according to the RV value of the repetition/segmentation before the time slot boundary or the uplink and downlink switching time.
And respectively selecting the coded bit output corresponding to the RV according to the RV corresponding to the time slot boundary or the two repeated/segmented values before and after the uplink and downlink conversion time, or sequentially selecting the coded bit output corresponding to the RV according to the length of the time slot boundary or the two repeated/segmented values before and after the uplink and downlink conversion time.
An embodiment of the present invention further provides a terminal, including:
the receiving and sending module is used for acquiring configuration information of a Physical Uplink Shared Channel (PUSCH);
a processing module, configured to obtain redundancy versions RV corresponding to 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 performs repeated/segmented transmission; the transceiver module is further configured to transmit the PUSCH according to the RV.
The embodiment of the invention also provides an information transmission method, which comprises the following steps:
sending configuration information of a Physical Uplink Shared Channel (PUSCH);
when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information;
and receiving the PUSCH according to the RV.
When the PUSCH is repeatedly/sectionally transmitted, obtaining redundancy versions RV corresponding to the repeated/sectionally transmitted PUSCH of at least two PUSCHs according to the configuration information, respectively, includes:
acquiring the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH and a time slot boundary or uplink and downlink conversion time;
dividing the PUSCH into N repetitions/segments according to the length of each repetition/segment transmission of the PUSCH, wherein N is an integer greater than or equal to 2;
and obtaining redundancy versions RV respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCHs and the RV configuration information.
Obtaining redundancy versions RV respectively corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, comprising:
if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and when the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and the i +1 th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, where i is 2, 3, …, N, in the RV sequence according to the sequence of the RVs.
Obtaining redundancy versions RV respectively corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, comprising:
if the RV sequence in the RV configuration information includes M RVs, an RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and when the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, where i is 2, 3, …, N.
Obtaining redundancy versions RV respectively corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, comprising:
if the RV sequence in the RV configuration information includes M RVs, the N repetitions/segments of the PUSCH are arranged in a sequence from long to short, and correspond to one RV according to the sequence of the RVs in the RV sequence.
Obtaining redundancy versions RV respectively corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, comprising:
if the RV sequence in the RV configuration information comprises M RVs, when N is larger than M, determining a first target RV sequence, wherein the first target RV sequence comprises L M RVs, the L RV sequences are sequentially arranged, the N repeated/segmented of the PUSCH are repeated/segmented after being sequentially arranged from long to short, and the N repeated/segmented of the PUSCH respectively corresponds to one RV according to the sequence of the RV in the first target RV sequence; l is an integer greater than or equal to 1.
Obtaining redundancy versions RV respectively corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, comprising:
if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and after being sorted according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to nth repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
And when the lengths of the two repetitions/segments of the PUSCH are the same, sequencing the two repetitions/segments of the PUSCH according to the time sequence.
And determining the RV value of the repetition/segmentation after the time slot boundary or the uplink and downlink switching time according to the RV value of the repetition/segmentation before the time slot boundary or the uplink and downlink switching time.
And respectively inputting the two repeats/segments into the decoder according to the RV when the RV values of the time slot boundary or the two repeats/segments before and after the uplink and downlink conversion time are the same, or cascading the time slot boundary or the two repeats/segments before and after the uplink and downlink conversion time and then inputting the two repeats/segments into the decoder.
An embodiment of the present invention further provides a network device, including: a processor, a memory, wherein a program executable by the processor is stored on the memory, and the transceiver transmits configuration information for transmitting a Physical Uplink Shared Channel (PUSCH); the processor, when executing the program, implements:
when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information;
and the transceiver receives the PUSCH according to the RV.
Wherein the processor is specifically configured to: acquiring the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH and a time slot boundary or uplink and downlink conversion time; dividing the PUSCH into N repetitions/segments according to the length of each repetition/segment transmission of the PUSCH, wherein N is an integer greater than or equal to 2; and obtaining redundancy versions RV respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCHs and the RV configuration information.
Wherein, when the processor obtains redundancy versions RV corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, the processor is specifically configured to:
if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and the (i + 1) th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, where i is 2, 3, …, N, in the RV sequence according to the sequence of the RVs; or,
if the RV sequence in the RV configuration information includes M RVs, an RV corresponding to a 1 st repetition/segment of the PUSCH is 0, and when the length of an ith repetition/segment is greater than the length of a repetition/segment with a previous RV of 0, the RV corresponding to the ith repetition/segment is 0, where i is 2, 3, …, N; or,
if the RV sequence in the RV configuration information comprises M RVs, the N repeated/segmented of the PUSCH are respectively corresponding to one RV according to the sequence of the RVs in the RV sequence, wherein the repeated/segmented N of the PUSCH are arranged according to the sequence from long to short; or,
if the RV sequence in the RV configuration information comprises M RVs, when N is larger than M, determining a first target RV sequence, wherein the first target RV sequence comprises L M RVs, the L RV sequences are sequentially arranged, the N repeated/segmented of the PUSCH are repeated/segmented after being sequentially arranged from long to short, and the N repeated/segmented of the PUSCH respectively corresponds to one RV according to the sequence of the RV in the first target RV sequence; l is an integer greater than or equal to 1; or,
if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and after being sorted according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to nth repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
And when the lengths of the two repetitions/segments of the PUSCH are the same, sequencing the two repetitions/segments of the PUSCH according to the time sequence.
And determining the RV value of the repetition/segmentation after the time slot boundary or the uplink and downlink switching time according to the RV value of the repetition/segmentation before the time slot boundary or the uplink and downlink switching time.
And respectively inputting the two repeats/segments into the decoder according to the RV when the RV values of the time slot boundary or the two repeats/segments before and after the uplink and downlink conversion time are the same, or cascading the time slot boundary or the two repeats/segments before and after the uplink and downlink conversion time and then inputting the two repeats/segments into the decoder.
An embodiment of the present invention further provides a network device, including:
the receiving and sending module is used for sending configuration information of a Physical Uplink Shared Channel (PUSCH);
a processing module, configured to obtain redundancy versions RV corresponding to 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 performs repeated/segmented transmission;
and the transceiver module is used for receiving the PUSCH according to the RV.
Embodiments of the present invention also provide a computer storage medium including instructions that, when executed on a computer, cause the computer to perform the method as described above.
The embodiment of the invention has the beneficial effects that:
in the embodiment of the invention, the configuration information of the transmission physical uplink shared channel PUSCH is acquired; when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information; and transmitting the PUSCH according to the RV. Therefore, when the number of symbols occupied by each repetition/segment of the PUSCH is different, the RV corresponding to each repetition/segment can be determined according to the length of each repetition/segment (the number of occupied symbols, specifically, OFDM symbols), and the reliability of data transmission can be improved.
Drawings
Fig. 1 is a schematic diagram of a segment of PUSCH;
FIG. 2 is a flow chart of an information transmission method according to the present invention;
fig. 3 is a schematic diagram of a segment of PUSCH in an embodiment of the present invention;
fig. 4 is a schematic diagram of a terminal architecture according to the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention can be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
As shown in fig. 2, an embodiment of the present invention provides an information transmission method, which is applied to a terminal, and the method includes:
Step 22, when the PUSCH is repeatedly/sectionally transmitted, obtaining redundancy versions RV respectively corresponding to the repeated/sectionally transmitted at least two PUSCHs according to the length of the repeated/sectionally transmitted PUSCH and the configuration information;
and step 23, transmitting the PUSCH according to the RV.
According to the embodiment of the invention, when the PUSCH is subjected to repeated/segmented transmission, the redundancy versions RV respectively corresponding to the repeated/segmented transmission of at least two PUSCHs are obtained according to the obtained configuration information, and the PUSCH is transmitted according to the RV, so that the reliability of data transmission is improved.
In an embodiment of the present invention, step 22 may specifically include:
step 221, obtaining 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 and downlink switching time;
as shown in fig. 3, the terminal determines a slot boundary or a position of TDD uplink/downlink (UL/DL) transition, and the terminal determines whether to transmit once or multiple times and a length of each repetition/segmentation transmission according to a time domain resource required to be occupied by PUSCH and the slot boundary or the position of TDD uplink/downlink transition, where the length of each repetition/segmentation transmission is determined by the number of symbols occupied by each repetition/segmentation transmission, where the symbols are, for example, OFDM (Orthogonal Frequency Division Multiplexing) symbols.
Step 222, dividing 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 223, obtaining redundancy versions RV corresponding to the at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information.
Specifically, one implementation of this step 223 may include:
step 2231, if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and the i +1 th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, and i is (2, 3, …, N) in the RV sequence according to the order of the RVs in the RV sequence. Here, according to this method, all repetitions/segments of the PUSCH are determined, and RV association is performed for each repetition/segment.
For example, the gNB (network device, e.g., base station) notifies the UE of resource configuration, DMRS configuration, RV configuration, etc. through RRC signaling and/or activating PDCCH, so as to let the UE start PUSCH uplink transmission. Assume that the RV sequence in the RV configuration information is { 0231 }.
Due to the slot boundary or TDD uplink and downlink switching, a 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 seg1, seg2, seg3 and seg4, respectively. The method is also applicable when N and M are not equal;
for the PUSCH transmission or PUSCH segmentation before the time slot boundary or TDD uplink and downlink switching time to seg1, the PUSCH transmission or PUSCH segmentation after the time slot boundary or TDD uplink and downlink switching time to seg2, seg3 and seg 4;
according to the method of this embodiment, 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, the RV 2 is greater than the PUSCH transmission/segmentation for which the previous RV is 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 according to the RV order in the RV sequence, that is, the RVs corresponding to seg3 and seg4 are 2 and 3, respectively;
and comparing the lengths of seg3 and seg2 in sequence, if the length is larger than the length, setting the RV corresponding to seg3 to be 0, setting the RV corresponding to seg4 to be 2, and if the length of seg3 is smaller than the length of seg2, setting the RV corresponding to seg3 to be 2 and keeping the RV unchanged.
Another implementation of this step 223 may include:
step 2232, if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and i is (2, 3, …, N), where all repetitions/segments of the PUSCH are determined according to this method, and RV corresponding is performed for each repetition/segment.
For example, the gNB notifies the UE of resource configuration, DMRS configuration, RV configuration, and the like through RRC signaling and/or activation of the PDCCH, and allows the UE to start PUSCH uplink transmission. Assume that the RV sequence in the RV configuration information is { 0231 }.
Due to the slot boundary or TDD uplink and downlink switching, a 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 seg1, seg2, seg3 and seg4, respectively. The method is also applicable when N and M are not equal;
for the PUSCH transmission or PUSCH segmentation before the time slot boundary or TDD uplink and downlink switching time to seg1, the PUSCH transmission or PUSCH segmentation after the time slot boundary or TDD uplink and downlink switching time to seg2, seg3 and seg 4;
according to the method of this embodiment, 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 respectively keep the original corresponding RVs unchanged, that is, the RV corresponding to seg3 is 3, and the RV corresponding to seg4 is 1;
if the length of seg3 is greater than seg2, the RV corresponding to seg3 is set to 0, otherwise, the RV is kept unchanged
Yet another implementation of this 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 a sequence from long to short, and correspond to one RV according to the sequence of the RVs in the RV sequence.
For example, the gNB notifies the UE of resource configuration, DMRS configuration, RV configuration, and the like through RRC signaling and/or activation of a PDCCH (physical downlink control channel), so that the UE starts PUSCH uplink transmission. Assume that the RV sequence in the RV configuration information is { 0231 }.
Due to the slot boundary or TDD uplink and downlink switching, a 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 seg1, seg2, seg3 and seg4, respectively. The method is also applicable when N and M are not equal;
for the PUSCH transmission or PUSCH segmentation before the time slot boundary or TDD uplink and downlink switching time to seg1, the PUSCH transmission or PUSCH segmentation after the time slot boundary or TDD uplink and downlink switching time to seg2, seg3 and seg 4;
according to the method of this example, all segs are sorted from long to short, resulting in a sequence seg2> seg1> seg4> seg 3. Then the RV is determined for the sorted repeats/segments, and the RV for seg1, seg2, seg3, seg4 is 2, 0, 1, 3 in that order.
Yet another implementation of this step 223 may include:
step 2234, if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, determining a first target RV sequence, where the first target RV sequence includes L × M RVs, and the L RV sequences are sequentially arranged, and the N repetitions/segments of the PUSCH are arranged according to a sequence from long to short, and correspond to one RV according to the sequence of the RVs in the first target RV sequence; l is an integer greater than or equal to 1.
For example, the gNB notifies the UE of resource configuration, DMRS configuration, RV configuration, and the like through RRC signaling and/or activation of the PDCCH, and allows the UE to start PUSCH uplink transmission. Assume that the RV sequence in the RV configuration information is { 0231 }.
Due to the slot boundary or TDD uplink and downlink switching, a 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 seg1, seg2, seg3 and seg4, respectively.
And one-time PUSCH transmission is divided into 8-time PUSCH transmission or PUSCH segmentation, namely seg 1-8, and all segs are sorted from long to short to obtain a sequence of seg2> seg1> seg5> seg6> seg4> seg3> seg8> seg 7. When the RV is determined for the sorted repetitions/segments, the corresponding RV sequence is formed by cascading a plurality of signaled RV sequences, namely { 02310231 }, so the RVs of seg2, seg1, seg5, seg6, seg4, seg3, seg8, and seg7 are 02310231 in sequence.
Yet another implementation of this 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 after sorting according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to N th repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
For example, the gNB notifies the UE of resource configuration, DMRS configuration, RV configuration, and the like through RRC signaling and/or activation of the PDCCH, and allows the UE to start PUSCH uplink transmission. Assume that the RV sequence in the RV configuration information is { 0231 }.
And one PUSCH transmission is divided into 8 PUSCH transmissions or PUSCH segments, namely segs 1-8, and all segs are sorted from long to short to obtain a sequence of seg2> seg1> seg4> seg 3. Then when determining RV for the sorted repeats/segments, RV of seg1, seg2, seg3, seg4 is sequentially 2, 0, 1, 3, and RV of seg5, seg6, seg7, seg8 is also sequentially 2, 0, 1, 3, where seg5, seg6, seg7, seg8 are no longer sorted by length.
In the above embodiments of the present invention, when the lengths of the two repetitions/segments of the PUSCH are the same, the two repetitions/segments of the PUSCH are arranged in sequence according to the order of time.
In one embodiment of the invention, the RV value of the repetition/segmentation after the time slot boundary or the uplink and downlink switching time is determined according to the RV value of the repetition/segmentation before the time slot boundary or the uplink and downlink switching time; for example, the RV values of two repetitions/segments before and after the slot boundary or the time of the uplink/downlink transition may be the same or different. As shown in fig. 3, the RV values of the two repetitions/segments (seg1 and seg2) before and after the slot boundary or the time of the uplink/downlink transition are the same or different.
Correspondingly, the RV values of the two repetitions/segments before and after the time slot boundary or the uplink and downlink switching time are the same, and the two repetitions/segments before and after the time slot boundary or the uplink and downlink switching time respectively select the coded bit output corresponding to the RV according to the corresponding RVs, or sequentially select the coded bit output corresponding to the RV according to the lengths of the two repetitions/segments before and after the time slot boundary or the uplink and downlink switching time.
For example, the RVs corresponding to seg1 and seg2 shown in fig. 3 are both 2, then seg1 and seg2 both select their coded bit outputs according to the value of RV being 2, and when their coded bit outputs are selected, seg1 occupies 4 symbols (i.e. length is 4) and seg2 occupies 10 symbols (i.e. length is 10), assuming that each 10 coded bits occupy 1 symbol (1 or more RBs in frequency domain), 140 coded bits can be selected according to the value of RV being 2, where seg1 selects the first 40 bits (e.g. bit 0 to bit 39) of 14 coded bits, and seg2 selects the first 100 bits (e.g. bit 0 to bit 99) of 14 coded bits; on the base station side, the base station obtains seg1 and then performs primary decoding according to RV 2, the base station obtains seg2 and then performs secondary decoding according to RV 2, and the base station can also perform soft combining with seg1 according to RV 2 and then performs primary decoding after obtaining seg 2.
For another example, the RVs corresponding to seg1 and seg2 shown in fig. 3 are both 2, then seg1 and seg2 both select their coded bit outputs according to the value of RV being 2, and when their coded bit outputs are selected, seg1 occupies 4 symbols (i.e., length is 4) and seg2 occupies 10 symbols (i.e., length is 10), and assuming that each 10 coded bits occupy 1 symbol (1 or more RBs in the frequency domain), 140 coded bits can be selected according to the value of RV being 2, where seg1 selects the first 40 bits (e.g., bit 0 to bit 39) of 140 coded bits, and seg2 selects the last 100 bits (e.g., bit 40 to bit 139) of 140 coded bits. At the base station side, after obtaining seg1 and seg2, the base station performs tandem concatenation to obtain a new repeated/segmented segN, and performs decoding once according to RV 2.
Wherein, in the case that RVs corresponding to respective PUSCH repetitions/segments are determined in chronological order, or in the case that RVs corresponding to respective PUSCH repetitions/segments are determined according to lengths of PUSCH repetitions/segments in the above embodiment of the present invention, when there are a plurality of PUSCH repetitions/segments with RV of 0 and the system allows PUSCH transmission to start from any PUSCH repetition/segment with RV of 0, the 1 st repetition/segment at which PUSCH transmission starts is determined according to the first condition and the second condition, or is determined according to the first condition and the third condition; the first condition is that the RV of the repeat/segment is 0; the second condition is that the repeated/segmented data is not a time slot boundary or repeated/segmented data after the uplink and downlink switching time if the repeated/segmented data belongs to the repeated segmented data obtained by segmentation; the third condition is that the repeat/segment transmission does not belong to a segmented repeat/segment.
For another example, RV corresponding to seg1 (which may be PUSCH-repetition) and seg2 (which may be PUSCH-repetition) shown in fig. 3 is 0, then seg1 and seg2 both select their coded bit outputs according to RV value being 0, and when their coded bit outputs are selected, seg1 occupies 4 symbols (i.e., length is 4) and seg2 occupies 10 symbols (i.e., length is 10), assuming that each 10 coded bits occupies 1 symbol (1 or more RBs in frequency domain), 140 coded bits may be selected according to RV value being 0, where seg1 selects the first 40 bits (e.g., bits 0 to 39) of 140 coded bits, and seg2 selects the last 100 bits (e.g., bits 40 to 139) of 140 coded bits. At the base station side, after obtaining seg1 and seg2, the base station performs tandem concatenation to obtain a new repeated/segmented segN, and performs decoding once according to RV of 0.
When determining whether seg1 and seg2 can be the first transmitted repeated/segmented transmission in two repeated/segmented transmissions corresponding to one PUSCH transmission, two conditions need to be judged, the first condition is that the RV of the repeated/segmented transmission is 0, and at this time, the RVs of seg1 and seg2 are both 0, namely both the first condition is met; the second is that the repetition/segmentation transmission cannot be the repetition/segmentation after the timeslot boundary or the uplink/downlink switching time if the repetition/segmentation transmission belongs to the segmented repetition segmentation transmission, where seg2 is the repetition/segmentation after the segmented timeslot boundary or the uplink/downlink switching time, and seg1 is not, so seg1 may be transmitted as the first transmitted repetition/segmentation, and seg2 may not be transmitted as the first transmitted repetition/segmentation. If the second condition is that the repetition/segment transmission does not belong to a segmented repetition/segment, neither seg1 nor seg2 can be transmitted as the first transmitted repetition/segment. The first transmitted repeated/segmented transmission here means that the transmission of the entire PUSCH is started.
When inter-PUSCH-repetition frequency hopping is started, the same frequency domain resource is used by a time slot boundary or two repetitions/segments before and after the uplink and downlink conversion time, namely the two repetitions/segments do not hop frequency with each other.
In the embodiment of the present invention, when the PUSCH is repeatedly/sectionally transmitted, according to the acquired configuration information, redundancy versions RV corresponding to the repeated/sectionally transmitted at least two PUSCHs are obtained, and the PUSCH is transmitted according to the RV, so that reliability of data transmission is improved.
As shown in fig. 4, an embodiment of the present invention further provides a terminal 40, including: the device comprises a transceiver 41, a processor 42 and a memory 43, wherein a program executable by the processor 42 is stored on the memory 43, and the transceiver 41 acquires configuration information of a Physical Uplink Shared Channel (PUSCH) for transmission; the processor 42, when executing the program, implements: when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information; the transceiver 41 transmits the PUSCH according to the RV.
When the transceiver 41 acquires configuration information of a transmission physical uplink shared channel PUSCH, the transceiver is specifically configured to: receiving at least one of a Downlink Control Information (DCI) signaling, a Radio Resource Control (RRC) signaling and a Physical Downlink Control Channel (PDCCH) sent by network equipment;
and acquiring configuration information for transmitting the PUSCH from at least one of the DCI signaling, the RRC signaling and the PDCCH.
Wherein the configuration information at least comprises: and transmitting the time domain resource information and RV configuration information of the PUSCH.
Wherein the processor 42 is specifically configured to: acquiring the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH and a time slot boundary or uplink and downlink conversion time;
dividing the PUSCH into N repetitions/segments according to the length of each repetition/segment transmission of the PUSCH, wherein N is an integer greater than or equal to 2;
and obtaining redundancy versions RV respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCHs and the RV configuration information.
Wherein, the processor obtains redundancy versions RV corresponding to the repetition/segmentation transmission of at least two PUSCHs according to the RV configuration information, and is specifically configured to:
if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and the length of the ith repetition/segment is greater than the length of the repetition/segment with the previous RV being 0, the RV corresponding to the ith repetition/segment is 0, and the (i + 1) th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, and i is (2, 3, …, N), in the sequence of the RVs; or,
if the RV sequence in the RV configuration information includes M RVs, an RV corresponding to a 1 st repetition/segment of the PUSCH is 0, and when the length of an ith repetition/segment is greater than the length of a repetition/segment with a previous RV of 0, the RV corresponding to the ith repetition/segment is 0, and i is (2, 3, …, N); or,
if the RV sequence in the RV configuration information comprises M RVs, the N repeated/segmented of the PUSCH are respectively corresponding to one RV according to the sequence of the RVs in the RV sequence, wherein the repeated/segmented N of the PUSCH are arranged according to the sequence from long to short; or,
if the RV sequence in the RV configuration information comprises M RVs, when N is larger than M, determining a first target RV sequence, wherein the first target RV sequence comprises L M RVs, the L RV sequences are sequentially arranged, the N repeated/segmented of the PUSCH are repeated/segmented after being sequentially arranged from long to short, and the N repeated/segmented of the PUSCH respectively corresponds to one RV according to the sequence of the RV in the first target RV sequence; l is an integer greater than or equal to 1; or,
if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and after being sorted according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to nth repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
And when the lengths of the two repetitions/segments of the PUSCH are the same, sequencing the two repetitions/segments of the PUSCH according to the time sequence.
And determining the RV value of the repetition/segmentation after the time slot boundary or the uplink and downlink switching time according to the RV value of the repetition/segmentation before the time slot boundary or the uplink and downlink switching time.
And respectively selecting the coded bit output corresponding to the RV according to the RV corresponding to the time slot boundary or the two repeated/segmented values before and after the uplink and downlink conversion time, or sequentially selecting the coded bit output corresponding to the RV according to the length of the time slot boundary or the two repeated/segmented values before and after the uplink and downlink conversion time.
When inter-PUSCH-repetition frequency hopping is started, the same frequency domain resource is used by a time slot boundary or two repetitions/segments before and after the uplink and downlink conversion time, namely the two repetitions/segments do not hop frequency with each other.
All the embodiments of the method shown in fig. 2 described above are applicable to this embodiment, and the same technical effects can be achieved. The transceiver 41 and the processor 42, and the transceiver 41 and the memory 43 may be connected through a bus interface, and the functions of the transceiver 41 may be implemented by the processor 42, and the functions of the processor 42 may also be implemented by the transceiver 41.
An embodiment of the present invention further provides a terminal, including:
the receiving and sending module is used for acquiring configuration information of a Physical Uplink Shared Channel (PUSCH);
a processing module, configured to obtain redundancy versions RV corresponding to 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 performs repeated/segmented transmission; the transceiver module is further configured to transmit the PUSCH according to the RV. All the embodiments of the method shown in fig. 2 described above are applicable to this embodiment, and the same technical effects can be achieved.
The embodiment of the invention also provides an information transmission method, which comprises the following steps:
step 51, sending configuration information of a transmission Physical Uplink Shared Channel (PUSCH);
step 52, when the PUSCH is repeatedly/sectionally transmitted, obtaining redundancy versions RV respectively corresponding to at least two repeated/sectionally transmitted PUSCHs according to the length of the repeated/sectionally transmitted PUSCH and the configuration information;
and 53, receiving the PUSCH according to the RV.
Wherein, step 52 may specifically include:
step 521, obtaining the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH and a time slot boundary or an uplink and downlink switching time;
step 522, dividing 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, obtaining redundancy versions RV corresponding to the repeated/segmented transmission of at least two PUSCHs, respectively.
Wherein step 523 may comprise at least one of:
step 5231, if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and the i +1 th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, and i is (2, 3, …, N), in the sequence of the RVs.
Step 5232, if the RV sequence in the RV configuration information includes M RVs, and the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and i is (2, 3, …, N).
Step 5233, if the RV sequence in the RV configuration information includes M RVs, the N repetitions/segments of the PUSCH are arranged in a sequence from long to short, and correspond to one RV according to the sequence of the RVs in the RV sequence.
Step 5234, if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, determining a first target RV sequence, where the first target RV sequence includes L × M RVs, and the L RV sequences are sequentially arranged, and the N repetitions/segments of the PUSCH are arranged according to a sequence from long to short, and correspond to one RV according to the sequence of the RVs in the first target RV sequence; l is an integer greater than or equal to 1.
Step 5235, if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and after sorting according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to N th repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
And when the lengths of the two repetitions/segments of the PUSCH are the same, sequencing the two repetitions/segments of the PUSCH according to the time sequence.
And determining the RV value of the repetition/segmentation after the time slot boundary or the uplink and downlink switching time according to the RV value of the repetition/segmentation before the time slot boundary or the uplink and downlink switching time.
And respectively inputting the two repeats/segments into the decoder according to the RV when the RV values of the time slot boundary or the two repeats/segments before and after the uplink and downlink conversion time are the same, or cascading the time slot boundary or the two repeats/segments before and after the uplink and downlink conversion time and then inputting the two repeats/segments into the decoder.
The method of this embodiment may be applied to a network device, such as a base station, and the method determines an RV corresponding to each repeated/segmented transmission of a PUSCH, which is the same as all the embodiments in the method shown in fig. 2, and all the embodiments in the method shown in fig. 2 are applicable to this embodiment, and the same technical effect can also be achieved.
An embodiment of the present invention further provides a network device, including: a processor, a memory, wherein a program executable by the processor is stored on the memory, and the transceiver transmits configuration information for transmitting a Physical Uplink Shared Channel (PUSCH); the processor, when executing the program, implements:
when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information;
and the transceiver receives the PUSCH according to the RV.
Wherein the processor is specifically configured to: acquiring the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH and a time slot boundary or uplink and downlink conversion time; dividing the PUSCH into N repetitions/segments according to the length of each repetition/segment transmission of the PUSCH, wherein N is an integer greater than or equal to 2; and obtaining redundancy versions RV respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCHs and the RV configuration information.
Wherein, when the processor obtains redundancy versions RV corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information, the processor is specifically configured to:
if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and the length of the ith repetition/segment is greater than the length of the repetition/segment with the previous RV being 0, the RV corresponding to the ith repetition/segment is 0, and the (i + 1) th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, and i is (2, 3, …, N), in the sequence of the RVs; or,
if the RV sequence in the RV configuration information includes M RVs, an RV corresponding to a 1 st repetition/segment of the PUSCH is 0, and when the length of an ith repetition/segment is greater than the length of a repetition/segment with a previous RV of 0, the RV corresponding to the ith repetition/segment is 0, and i is (2, 3, …, N); or,
if the RV sequence in the RV configuration information comprises M RVs, the N repeated/segmented of the PUSCH are respectively corresponding to one RV according to the sequence of the RVs in the RV sequence, wherein the repeated/segmented N of the PUSCH are arranged according to the sequence from long to short; or,
if the RV sequence in the RV configuration information comprises M RVs, when N is larger than M, determining a first target RV sequence, wherein the first target RV sequence comprises L M RVs, the L RV sequences are sequentially arranged, the N repeated/segmented of the PUSCH are repeated/segmented after being sequentially arranged from long to short, and the N repeated/segmented of the PUSCH respectively corresponds to one RV according to the sequence of the RV in the first target RV sequence; l is an integer greater than or equal to 1; or,
if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and after being sorted according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to nth repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
And when the lengths of the two repetitions/segments of the PUSCH are the same, sequencing the two repetitions/segments of the PUSCH according to the time sequence.
And determining the RV value of the repetition/segmentation after the time slot boundary or the uplink and downlink switching time according to the RV value of the repetition/segmentation before the time slot boundary or the uplink and downlink switching time.
And respectively inputting the two repeats/segments into the decoder according to the RV when the RV values of the time slot boundary or the two repeats/segments before and after the uplink and downlink conversion time are the same, or cascading the time slot boundary or the two repeats/segments before and after the uplink and downlink conversion time and then inputting the two repeats/segments into the decoder.
An embodiment of the present invention further provides a network device, including:
the receiving and sending module is used for sending configuration information of a Physical Uplink Shared Channel (PUSCH);
a processing module, configured to obtain redundancy versions RV corresponding to 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 performs repeated/segmented transmission;
and the transceiver module is used for receiving the PUSCH according to the RV.
It should be noted that all the embodiments of the method on the network device side described above are applicable to this embodiment, and the same technical effects can be achieved.
Embodiments of the present invention also provide a computer storage medium including instructions that, when executed on a computer, cause the computer to perform a method such as a terminal side or a network device side. All the implementation manners in the above method embodiment are applicable to this embodiment, and the same technical effect can be achieved.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.
Furthermore, it is to be noted that in the device and method of the invention, it is obvious that the individual components or steps can be decomposed and/or recombined. These decompositions and/or recombinations are to be regarded as equivalents of the present invention. Also, the steps of performing the series of processes described above may naturally be performed chronologically in the order described, but need not necessarily be performed chronologically, and some steps may be performed in parallel or independently of each other. It will be understood by those skilled in the art that all or any of the steps or elements of the method and apparatus of the present invention may be implemented in any computing device (including processors, storage media, etc.) or network of computing devices, in hardware, firmware, software, or any combination thereof, which can be implemented by those skilled in the art using their basic programming skills after reading the description of the present invention.
Thus, the objects of the invention may also be achieved by running a program or a set of programs on any computing device. The computing device may be a general purpose device as is well known. The object of the invention is thus also achieved solely by providing a program product comprising program code for implementing the method or the apparatus. That is, such a program product also constitutes the present invention, and a storage medium storing such a program product also constitutes the present invention. It is to be understood that the storage medium may be any known storage medium or any storage medium developed in the future. It is further noted that in the apparatus and method of the present invention, it is apparent that each component or step can be decomposed and/or recombined. These decompositions and/or recombinations are to be regarded as equivalents of the present invention. Also, the steps of executing the series of processes described above may naturally be executed chronologically in the order described, but need not necessarily be executed chronologically. Some steps may be performed in parallel or independently of each other.
While the preferred embodiments of the present invention have been described, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the following claims.
Claims (35)
1. An information transmission method, comprising:
acquiring configuration information of a Physical Uplink Shared Channel (PUSCH) to be transmitted;
when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information;
and transmitting the PUSCH according to the RV.
2. The information transmission method according to claim 1, wherein obtaining redundancy versions RV corresponding to repetition/segmentation transmission of at least two PUSCHs according to the configuration information when performing repetition/segmentation transmission of the PUSCHs comprises:
acquiring the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH and a time slot boundary or uplink and downlink conversion time;
dividing the PUSCH into N repetitions/segments according to the length of each repetition/segment transmission of the PUSCH, wherein N is an integer greater than or equal to 2;
and obtaining redundancy versions RV respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCHs and the RV configuration information.
3. The information transmission method according to claim 2, wherein obtaining redundancy versions RV corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information comprises:
if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and when the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and the i +1 th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, where i is 2, 3, …, N, in the RV sequence according to the sequence of the RVs.
4. The information transmission method according to claim 2, wherein obtaining redundancy versions RV corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information comprises:
if the RV sequence in the RV configuration information includes M RVs, an RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and when the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, where i is 2, 3, …, N.
5. The information transmission method according to claim 2, wherein obtaining redundancy versions RV corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information comprises:
if the RV sequence in the RV configuration information includes M RVs, the N repetitions/segments of the PUSCH are arranged in a sequence from long to short, and correspond to one RV according to the sequence of the RVs in the RV sequence.
6. The information transmission method according to claim 2, wherein obtaining redundancy versions RV corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information comprises:
if the RV sequence in the RV configuration information comprises M RVs, when N is larger than M, determining a first target RV sequence, wherein the first target RV sequence comprises L M RVs, the L RV sequences are sequentially arranged, the N repeated/segmented of the PUSCH are repeated/segmented after being sequentially arranged from long to short, and the N repeated/segmented of the PUSCH respectively corresponds to one RV according to the sequence of the RV in the first target RV sequence; l is an integer greater than or equal to 1.
7. The information transmission method according to claim 2, wherein obtaining redundancy versions RV corresponding to at least two repeated/segmented transmissions of the PUSCH according to the length of the repeated/segmented transmission of the PUSCH and the RV configuration information comprises:
if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and after being sorted according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to nth repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
8. The information transmission method according to any one of claims 3 to 7, wherein when the lengths of the two repetitions/segments of the PUSCH are the same, the two repetitions/segments of the PUSCH are ordered in chronological order.
9. The information transmission method according to claim 2, wherein the RV value of the repetition/segmentation after the slot boundary or the time of the uplink/downlink switching is determined according to the RV value of the repetition/segmentation before the slot boundary or the time of the uplink/downlink switching.
10. The information transmission method according to claim 9, wherein the RV values of the two repetitions/segments before and after the timeslot boundary or the uplink/downlink transition time are the same, and the two repetitions/segments before and after the timeslot boundary or the uplink/downlink transition time respectively select the coded bit output corresponding to the RV according to their corresponding RVs, or sequentially select the coded bit output corresponding to the RV according to the lengths of the timeslot boundary or the two repetitions/segments before and after the uplink/downlink transition time.
11. A terminal, comprising: a processor, a memory, wherein a program executable by the processor is stored on the memory, and the transceiver acquires configuration information of a Physical Uplink Shared Channel (PUSCH) transmission;
the processor, when executing the program, implements: when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information;
and the transceiver transmits the PUSCH according to the RV.
12. The terminal of claim 11, wherein the processor is specifically configured to:
acquiring the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH and a time slot boundary or uplink and downlink conversion time;
dividing the PUSCH into N repetitions/segments according to the length of each repetition/segment transmission of the PUSCH, wherein N is an integer greater than or equal to 2;
and obtaining redundancy versions RV respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCHs and the RV configuration information.
13. The terminal according to claim 12, wherein the processor, when obtaining redundancy versions RV corresponding to at least two PUSCH repetition/segmentation transmissions according to the length of the PUSCH repetition/segmentation transmission and the RV configuration information, is specifically configured to:
if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and the (i + 1) th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, where i is 2, 3, …, N, in the RV sequence according to the sequence of the RVs; or,
if the RV sequence in the RV configuration information includes M RVs, an RV corresponding to a 1 st repetition/segment of the PUSCH is 0, and when the length of an ith repetition/segment is greater than the length of a repetition/segment with a previous RV of 0, the RV corresponding to the ith repetition/segment is 0, where i is 2, 3, …, N; or,
if the RV sequence in the RV configuration information comprises M RVs, the N repeated/segmented of the PUSCH are respectively corresponding to one RV according to the sequence of the RVs in the RV sequence, wherein the repeated/segmented N of the PUSCH are arranged according to the sequence from long to short; or,
if the RV sequence in the RV configuration information comprises M RVs, when N is larger than M, determining a first target RV sequence, wherein the first target RV sequence comprises L M RVs, the L RV sequences are sequentially arranged, the N repeated/segmented of the PUSCH are repeated/segmented after being sequentially arranged from long to short, and the N repeated/segmented of the PUSCH respectively corresponds to one RV according to the sequence of the RV in the first target RV sequence; l is an integer greater than or equal to 1; or,
if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and after being sorted according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to nth repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
14. The terminal of claim 13, wherein when the length of the two repetitions/segments of the PUSCH is the same, the two repetitions/segments of the PUSCH are ordered in chronological order.
15. The terminal of claim 12, wherein the RV value of the repetition/segmentation after the time slot boundary or the time of uplink/downlink switching is determined according to the RV value of the repetition/segmentation before the time slot boundary or the time of uplink/downlink switching.
16. The terminal of claim 15, wherein the RV values of two repetitions/segments before and after the timeslot boundary or the uplink/downlink transition time are the same, and the RV outputs corresponding to the RVs are respectively selected according to their corresponding RVs at the timeslot boundary or the two repetitions/segments before and after the uplink/downlink transition time, or the RV outputs corresponding to the coded bits are sequentially selected according to the length of the timeslot boundary or the two repetitions/segments before and after the uplink/downlink transition time.
17. A terminal, comprising:
the receiving and sending module is used for acquiring configuration information of a Physical Uplink Shared Channel (PUSCH);
a processing module, configured to obtain redundancy versions RV corresponding to 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 performs repeated/segmented transmission; the transceiver module is further configured to transmit the PUSCH according to the RV.
18. An information transmission method, comprising:
sending configuration information of a Physical Uplink Shared Channel (PUSCH);
when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information;
and receiving the PUSCH according to the RV.
19. The information transmission method according to claim 18, wherein obtaining redundancy versions RV corresponding to respective repetition/segmentation transmissions of at least two PUSCHs according to the configuration information when performing repetition/segmentation transmissions of the PUSCH comprises:
acquiring the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH and a time slot boundary or uplink and downlink conversion time;
dividing the PUSCH into N repetitions/segments according to the length of each repetition/segment transmission of the PUSCH, wherein N is an integer greater than or equal to 2;
and obtaining redundancy versions RV respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCHs and the RV configuration information.
20. The information transmission method according to claim 19, wherein obtaining redundancy versions RV corresponding to at least two repetition/segmentation transmissions of the PUSCH according to the length of the repetition/segmentation transmission of the PUSCH and the RV configuration information comprises:
if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and when the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and the i +1 th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, where i is 2, 3, …, N, in the RV sequence according to the sequence of the RVs.
21. The information transmission method according to claim 19, wherein obtaining redundancy versions RV corresponding to at least two repetition/segmentation transmissions of the PUSCH according to the length of the repetition/segmentation transmission of the PUSCH and the RV configuration information comprises:
if the RV sequence in the RV configuration information includes M RVs, an RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and when the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, where i is 2, 3, …, N.
22. The information transmission method according to claim 19, wherein obtaining redundancy versions RV corresponding to at least two repetition/segmentation transmissions of the PUSCH according to the length of the repetition/segmentation transmission of the PUSCH and the RV configuration information comprises:
if the RV sequence in the RV configuration information includes M RVs, the N repetitions/segments of the PUSCH are arranged in a sequence from long to short, and correspond to one RV according to the sequence of the RVs in the RV sequence.
23. The information transmission method according to claim 19, wherein obtaining redundancy versions RV corresponding to at least two repetition/segmentation transmissions of the PUSCH according to the length of the repetition/segmentation transmission of the PUSCH and the RV configuration information comprises:
if the RV sequence in the RV configuration information comprises M RVs, when N is larger than M, determining a first target RV sequence, wherein the first target RV sequence comprises L M RVs, the L RV sequences are sequentially arranged, the N repeated/segmented of the PUSCH are repeated/segmented after being sequentially arranged from long to short, and the N repeated/segmented of the PUSCH respectively corresponds to one RV according to the sequence of the RV in the first target RV sequence; l is an integer greater than or equal to 1.
24. The information transmission method according to claim 19, wherein obtaining redundancy versions RV corresponding to at least two repetition/segmentation transmissions of the PUSCH according to the length of the repetition/segmentation transmission of the PUSCH and the RV configuration information comprises:
if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and after being sorted according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to nth repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
25. The information transmission method according to any one of claims 20 to 24, wherein when the lengths of the two repetitions/segments of the PUSCH are the same, the two repetitions/segments of the PUSCH are ordered in chronological order.
26. The information transmission method according to claim 19, wherein the RV value of the repetition/segmentation after the slot boundary or the time of the uplink/downlink switching is determined according to the RV value of the repetition/segmentation before the slot boundary or the time of the uplink/downlink switching.
27. The information transmission method according to claim 26, wherein the RV values of two repetitions/segments before and after the slot boundary or the uplink/downlink switching time are the same, and the two repetitions/segments are input to the decoder respectively according to the RV values, or the two repetitions/segments before and after the slot boundary or the uplink/downlink switching time are input to the decoder after being concatenated.
28. A network device, comprising: a processor, a memory, wherein a program executable by the processor is stored on the memory, and the transceiver transmits configuration information for transmitting a Physical Uplink Shared Channel (PUSCH); the processor, when executing the program, implements:
when the PUSCH is subjected to repeated/segmented transmission, obtaining Redundancy Versions (RV) respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCH and the configuration information;
and the transceiver receives the PUSCH according to the RV.
29. The network device of claim 28, wherein the processor is specifically configured to: acquiring the length of each repeated/segmented transmission of the PUSCH according to the time domain resource information of the PUSCH and a time slot boundary or uplink and downlink conversion time; dividing the PUSCH into N repetitions/segments according to the length of each repetition/segment transmission of the PUSCH, wherein N is an integer greater than or equal to 2; and obtaining redundancy versions RV respectively corresponding to the repeated/segmented transmission of at least two PUSCHs according to the length of the repeated/segmented transmission of the PUSCHs and the RV configuration information.
30. The network device of claim 29, wherein the processor, when obtaining redundancy versions RV corresponding to at least two PUSCH repetition/segmentation transmissions according to the length of the PUSCH repetition/segmentation transmission and the RV configuration information, is specifically configured to:
if the RV sequence in the RV configuration information includes M RVs, the RV corresponding to the 1 st repetition/segment of the PUSCH is 0, and the length of the ith repetition/segment is greater than the length of the repetition/segment whose previous RV is 0, the RV corresponding to the ith repetition/segment is 0, and the (i + 1) th repetition/segment to the nth repetition/segment correspond to the 2 nd to mth RVs in the RV sequence, respectively, where i is 2, 3, …, N, in the RV sequence according to the sequence of the RVs; or,
if the RV sequence in the RV configuration information includes M RVs, an RV corresponding to a 1 st repetition/segment of the PUSCH is 0, and when the length of an ith repetition/segment is greater than the length of a repetition/segment with a previous RV of 0, the RV corresponding to the ith repetition/segment is 0, and i is (2, 3, …, N); or,
if the RV sequence in the RV configuration information comprises M RVs, the N repeated/segmented of the PUSCH are respectively corresponding to one RV according to the sequence of the RVs in the RV sequence, wherein the repeated/segmented N of the PUSCH are arranged according to the sequence from long to short; or,
if the RV sequence in the RV configuration information comprises M RVs, when N is larger than M, determining a first target RV sequence, wherein the first target RV sequence comprises L M RVs, the L RV sequences are sequentially arranged, the N repeated/segmented of the PUSCH are repeated/segmented after being sequentially arranged from long to short, and the N repeated/segmented of the PUSCH respectively corresponds to one RV according to the sequence of the RV in the first target RV sequence; l is an integer greater than or equal to 1; or,
if the RV sequence in the RV configuration information includes M RVs, when N is greater than M, and after being sorted according to length, the first M repetitions/segments of the N repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs in the RV sequence, and the M +1 th to nth repetitions/segments of the PUSCH respectively correspond to one RV according to the sequence of RVs corresponding to the first M repetitions/segments.
31. The network device of claim 30, wherein when the length of the two repetitions/segments of the PUSCH is the same, the two repetition/segment ordering of the PUSCH is ordered chronologically.
32. The network device of claim 29, wherein the RV value of the repetition/segmentation after the time slot boundary or the time of uplink/downlink switching is determined according to the RV value of the repetition/segmentation before the time slot boundary or the time of uplink/downlink switching.
33. The network device of claim 32, wherein the RV values of two repetitions/segments before and after the timeslot boundary or the uplink/downlink transition time are the same, and the two repetitions/segments are respectively input to the decoder according to the RV values, or the two repetitions/segments before and after the timeslot boundary or the uplink/downlink transition time are cascaded and input to the decoder.
34. A network device, comprising:
the receiving and sending module is used for sending configuration information of a Physical Uplink Shared Channel (PUSCH);
a processing module, configured to obtain redundancy versions RV corresponding to 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 performs repeated/segmented transmission;
and the transceiver module is used for receiving the PUSCH according to the RV.
35. A computer storage medium comprising instructions which, when executed on a computer, cause the computer to perform the method of any of claims 1 to 10, or the method of any of claims 18 to 27.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2020/082050 WO2020200163A1 (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 |
| EP20783667.7A EP3952530B1 (en) | 2019-04-02 | 2020-03-30 | Information transmission method and terminal |
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910263377 | 2019-04-02 | ||
| CN2019102633779 | 2019-04-02 | ||
| CN201910267628 | 2019-04-03 | ||
| CN2019102676280 | 2019-04-03 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111800870A true CN111800870A (en) | 2020-10-20 |
| CN111800870B CN111800870B (en) | 2023-01-03 |
Family
ID=72805459
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911083619.2A Active CN111800870B (en) | 2019-04-02 | 2019-11-07 | Information transmission method and terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111800870B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103378936A (en) * | 2012-04-28 | 2013-10-30 | 中兴通讯股份有限公司 | Data transmission method and device |
| CN106712910A (en) * | 2015-11-13 | 2017-05-24 | 电信科学技术研究院 | Redundant version and change cycle determination and channel estimation method and device thereof |
| US20180375616A1 (en) * | 2015-11-19 | 2018-12-27 | Sony Corporation | Telecommunications apparatus and methods |
| US20190020453A1 (en) * | 2016-01-11 | 2019-01-17 | Zte Corporation | Data transmission method and device |
| US20190053211A1 (en) * | 2017-08-10 | 2019-02-14 | Sharp Laboratories Of America, Inc. | Procedures, base stations and user equipments for uplink transmission without grant |
-
2019
- 2019-11-07 CN CN201911083619.2A patent/CN111800870B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103378936A (en) * | 2012-04-28 | 2013-10-30 | 中兴通讯股份有限公司 | Data transmission method and device |
| CN106712910A (en) * | 2015-11-13 | 2017-05-24 | 电信科学技术研究院 | Redundant version and change cycle determination and channel estimation method and device thereof |
| US20180375616A1 (en) * | 2015-11-19 | 2018-12-27 | Sony Corporation | Telecommunications apparatus and methods |
| US20190020453A1 (en) * | 2016-01-11 | 2019-01-17 | Zte Corporation | Data transmission method and device |
| US20190053211A1 (en) * | 2017-08-10 | 2019-02-14 | Sharp Laboratories Of America, Inc. | Procedures, base stations and user equipments for uplink transmission without grant |
Non-Patent Citations (2)
| Title |
|---|
| NOKIA 等: ""R1-1903480_Summary of Tue offline discussion on 7.2.6.1.3_URLLC PUSCH enh"", 《3GPP TSG_RAN\WG1_RL1》 * |
| NOKIA 等: "Summary of Friday offline discussion on potential enhancements for PUSCH for NR URLLC", 《3GPP TSG-RAN WG1 MEETING #96 R1-1903797》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111800870B (en) | 2023-01-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3949226B1 (en) | Method and apparatus for downlink resource allocation for multi-transmission and reception point transmission | |
| CN110299976B (en) | Information transmission method, receiving method, terminal and network equipment | |
| US11212036B2 (en) | Data communication method, device, and system | |
| US10616910B2 (en) | Uplink data transmission method and apparatus | |
| CN110392433B (en) | Data transmission method and device | |
| US12132569B2 (en) | Method for sidelink rate matching and resource mapping, and device | |
| US10985868B2 (en) | Communications method and apparatus | |
| CN110249539B (en) | Polar code interleaving and bit selection | |
| CN106464455B (en) | Transmit method, terminal device, the network equipment and the device of information | |
| EP3419178B1 (en) | Code block segmentation for polar encoding | |
| JP2019513321A (en) | Resource scheduling and allocation method and apparatus | |
| CN116961864A (en) | Channel configuration method, terminal, storage medium and electronic device | |
| CN110138523B (en) | Feedback codebook determination method and device | |
| US20220345994A1 (en) | Control information transmission method, base station, and terminal | |
| EP4017171A1 (en) | Transmission device, reception device, transmission method, and reception method | |
| US8355377B2 (en) | Method of signalling uplink information | |
| EP3573395A1 (en) | Communication method and device | |
| EP3952530B1 (en) | Information transmission method and terminal | |
| CN111800870B (en) | Information transmission method and terminal | |
| CN108293018B (en) | Method for sending control information, method for transmitting data block and related device | |
| CN109417785B (en) | Method, network device, terminal device and computer-readable medium for transmitting data | |
| CN109964427B (en) | Method and device used in terminal and base station for channel coding | |
| CN113271680B (en) | Configuration method, system, electronic equipment and storage medium for PUSCH transmission | |
| RU2792113C1 (en) | Method for justification and binding of direct connection resource and corresponding device | |
| US8305957B2 (en) | Apparatus, method and computer program product providing per-UE signaling technique for separately coded users |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20210607 Address after: 100085 1st floor, building 1, yard 5, Shangdi East Road, Haidian District, Beijing Applicant after: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd. Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Applicant before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |