CN110896342A

CN110896342A - URLLC single transmission method and device, storage medium and terminal

Info

Publication number: CN110896342A
Application number: CN201811069561.1A
Authority: CN
Inventors: 燕威; 谢静; 徐志昆
Original assignee: Spreadtrum Semiconductor Nanjing Co Ltd
Current assignee: Spreadtrum Semiconductor Nanjing Co Ltd
Priority date: 2018-09-13
Filing date: 2018-09-13
Publication date: 2020-03-20
Anticipated expiration: 2038-09-13
Also published as: CN110896342B

Abstract

A URLLC single transmission method and device, a storage medium and a terminal are provided, the method comprises the following steps: circularly repeating the coded bit sequence to obtain a transmission bit sequence, wherein the coded bit sequence comprises information bits and check bits; placing information bits in the transmission bit sequence in front of check bits in the transmission bit sequence to obtain a first output sequence; and processing the first output sequence to obtain an output signal and outputting the output signal. By the technical scheme provided by the invention, the decoding performance can be obviously improved, and the reliability and robustness of single transmission of the URLLC can be enhanced.

Description

URLLC single transmission method and device, storage medium and terminal

Technical Field

The present invention relates to wireless communication technologies, and in particular, to a URLLC single transmission method and apparatus, a storage medium, and a terminal.

Background

The 3rd Generation Partnership Project (3 GPP) is studying The New Radio (NR) system of The Fifth-Generation mobile communications (5G). The three 5G scenarios defined by the 3GPP conference include: enhanced mobile BroadBand (eMBB) communication, Mass Machine Type Communication (MMTC), and Ultra-reliable low latency communication (URLLC). The eMBB mainly aims at high-flow application scenes such as ultra-high-definition videos and the like; the MMTC mainly aims at application scenes such as smart homes, intelligent transportation, smart cities and the like; URLLC is mainly directed at application scenarios such as industrial automation, autopilot, mobile medical treatment.

For URLLC scenarios, cell edge users with poor channel quality need to adopt channel coding with very low code rate to ensure the reliability of communication. In order to meet the 1 millisecond (ms) delay requirement of the URLLC service, there is a scenario in which part of the URLLC service is encoded by using a channel with an extremely low bit rate, and the reliability requirement of the URLLC service cannot be guaranteed by a Hybrid Automatic repeat request (HARQ) mechanism of multiple retransmissions, and reliable communication can be completed by ensuring one transmission. This transmission is called a single (One-Shot) transmission. The coding mode and the code rate matching process adopted by the current URLLC single transmission are consistent with those adopted by the eMBB service. However, in the service scenario of URLLC, an extremely low code rate option is added to a Channel Quality Indicator (CQI) table and a Modulation and Coding Scheme (MCS) table in the latest 3GPP conference.

When there is an extremely low code rate, the reliability of a single transmission of URLLC is low.

Disclosure of Invention

The invention solves the technical problem of how to enhance the reliability of single transmission of the URLLC.

In order to solve the above technical problem, an embodiment of the present invention provides a URLLC single transmission method, where the URLLC single transmission method includes: circularly repeating the coded bit sequence to obtain a transmission bit sequence, wherein the coded bit sequence comprises information bits and check bits; placing information bits in the transmission bit sequence in front of check bits in the transmission bit sequence to obtain a first output sequence; and processing the first output sequence to obtain an output signal and outputting the output signal.

Optionally, before processing the first output sequence, the URLLC single-transmission method further includes: and repeating the information bits in the first output sequence, and placing the repeated information bits in the first output sequence before the check bits in the first output sequence to obtain a second output sequence.

Optionally, after the information bits in the repeated first output sequence are placed before the check bits in the first output sequence to obtain a second output sequence, the URLLC single transmission method further includes: and when the length of the second output sequence exceeds the length of a preset sequence, tail truncation is adopted to obtain a third output sequence with the same length as the preset sequence.

Optionally, before cyclically repeating the encoded bit sequence, the URLLC single transmission method further includes: the number of repetitions of cyclic repetition of the encoded bit sequence is determined.

Optionally, the determining the number of repetitions of cyclic repetition of the encoded bit sequence includes: determining a base graph of the LDPC code; and determining the repetition times according to the lowest code rate of the base graph and a target code rate, wherein the target code rate refers to the code rate in the MCS table configured by the DCI.

Optionally, the cyclically repeating the encoded bit sequence includes: storing the encoded bit sequence to a circular buffer; cyclically repeating the encoded bit sequence based on the cyclic buffer when the target code rate is less than or equal to the lowest code rate of the base graph.

Optionally, the coded bit sequence is determined as follows: adding check bits to information bits to be transmitted to obtain a first bit sequence, wherein the information bits to be transmitted refer to information bits in the coded bit sequence; adding preset bits to the first bit sequence to obtain a second bit sequence; and performing LDPC coding on the second bit sequence according to the lowest code rate of the base graph to obtain the coded bit sequence.

Optionally, the preset bit is a shortening bit, and the length of the shortening bit

Wherein B denotes a length of the first bit sequence, Z denotes a spreading factor of the LDPC check matrix,

is a pair of

And rounding up.

To solve the foregoing technical problem, an embodiment of the present invention further provides a URLLC single transmission apparatus, including: a repetition module adapted to perform cyclic repetition on the encoded bit sequence to obtain a transmission bit sequence; the coded bit sequence comprises information bits and check bits; the preposition module is suitable for placing the information bits in the transmission bit sequence in front of the check bits in the transmission bit sequence to obtain a first output sequence; and the output module is suitable for processing the first output sequence to obtain an output signal and outputting the output signal.

To solve the foregoing technical problem, an embodiment of the present invention further provides a storage medium, where computer instructions are stored, and when the computer instructions are executed, the steps of the URLLC single transmission method are executed.

In order to solve the above technical problem, an embodiment of the present invention further provides a terminal, including a memory and a processor, where the memory stores computer instructions executable on the processor, and the processor executes the steps of the URLLC single transmission method when executing the computer instructions.

Compared with the prior art, the technical scheme of the embodiment of the invention has the following beneficial effects:

the embodiment of the invention provides a single URLLC transmission method, which comprises the following steps: circularly repeating the coded bit sequence to obtain a transmission bit sequence, wherein the coded bit sequence comprises information bits and check bits; placing information bits in the transmission bit sequence in front of check bits in the transmission bit sequence to obtain a first output sequence; and processing the first output sequence to obtain an output signal and outputting the output signal. According to the technical scheme provided by the embodiment of the invention, the coded bit sequence is repeated circularly, and the information bit in the transmission sequence is prepositioned to obtain the first output bit sequence, so that the information bit is positioned in front of each symbol in the symbol mapping process of the first output sequence by using HSPA (high speed packet access) row-column interleaving, namely the information bit is positioned at a position with larger weight, and the information bit has stronger anti-interference capability in the transmission process. Further, in a URLLC service scenario, when an extremely low code rate (e.g., 30/1024, 50/1024) is used for URLLC single transmission, the technical solution provided by the embodiments of the present invention can achieve significant improvement of decoding performance, and enhance reliability and robustness of URLLC single transmission.

Further, before processing the first output sequence, the method further includes: and repeating the information bits in the first output sequence, and placing the repeated information bits in the first output sequence before the check bits in the first output sequence to obtain a second output sequence. Through the technical scheme provided by the embodiment of the invention, the information bits in the first output sequence can be repeated for a plurality of times, the weight of the information bits is further increased, and the possibility of further improving the decoding performance is provided.

Further, when the length of the second output sequence exceeds the length of the first output sequence, tail truncation is adopted to obtain a third output sequence with the same length as the first output sequence. By the technical scheme provided by the embodiment of the invention, the number of transmitted check bits can be further reduced, the weight of information bits can be further increased, and the decoding performance can be further improved.

Drawings

Fig. 1 is a schematic coding diagram of coding a URLLC service by using a base map of LDPC codes in the prior art;

fig. 2 is a diagram of an embodiment of a scenario for URLLC service in the prior art;

fig. 3 is a schematic diagram of another embodiment of a scenario for URLLC service in the prior art;

fig. 4 is a flowchart illustrating a URLLC single transmission method according to an embodiment of the present invention;

fig. 5 is a schematic diagram of a specific implementation of the URLLC service scenario according to an embodiment of the present invention;

fig. 6 is a schematic diagram of another specific implementation of the URLLC service scenario according to an embodiment of the present invention;

fig. 7 is a schematic diagram of another specific implementation of the URLLC service scenario according to an embodiment of the present invention;

FIGS. 8-11 are simulation diagrams comparing performance of embodiments of the present invention with prior art solutions;

fig. 12 is a schematic structural diagram of a URLLC single transmission apparatus according to an embodiment of the present invention.

Detailed Description

As will be appreciated by those skilled in the art, as background, enhancing the reliability of a single transmission of URLLC with very low code rates is a very considerable problem to study.

Specifically, a Radio Access Network working group one (RAN1 for short) of 3GPP conference 93 (RAN1#93) passes through a CQI table and an MCS table of a new URLLC, two extremely low code rates (30/1024 and 50/1024) are added to the new CQI table on the basis of an eMBB service CQI table of NR, and several extremely low code rates (30/1024, 40/1024, 50/1024, 64/1024, 78/1024, and 99/1024) are also added to a corresponding MCS table, respectively. The target Block Error Rate (BLock Error Rate, BLER for short) of the URLLC CQI Table is 10^-5。

TABLE 1

For a Physical Downlink Shared Channel (PDSCH) and a Physical Uplink Shared Channel (PUSCH) that transmit Cyclic Prefix (CP) -Orthogonal Frequency Division Multiplexing (OFDM) symbols, the URLLC introduces a new MCS table, as shown in table 2.

TABLE 2

For PUSCH transmit pre-coding, URLLC introduces a new MCS table, as shown in table 3.

TABLE 3

Further, in general, the URLLC service is encoded by using LDPC base map 2, where the lowest code rate that can be achieved by base map 2 is 1/5, and correspondingly, the lowest code rate of the circular buffer is 1/5. For LDPC, the number of check equations participated by information bits in an LDPC check matrix is far more than that of check bits, and the information bits occupy higher weight in the decoding capability of the LDPC.

Specifically, the coding mode and the code rate matching process adopted by the URLLC single transmission are consistent with those adopted by the eMBB service. More specifically, referring to fig. 1, the encoding process when the current URLLC single transmission is rate matched is as follows: first, operation s1 is executed to add Cyclic Redundancy Check (CRC) to the end (also called tail) of the information bit sequence of the Coding Block (CB) to obtain a bit sequence B; secondly, operation s2 is executed, and shortening (shortening) bits F are added after the bit sequence B to obtain a bit sequence U, so that the information bit length is an integer multiple of the sub-cyclic matrix of the selected base map; then, operation s3 is executed, the bit sequence U is encoded according to the selected base diagram to obtain an encoded bit sequence, and if the encoded bit sequence exceeds a preset bit length, a (puncuttrue) partial check bit (check bit) and a partial information bit may be truncated; further, operation s4 is performed, and bits to be transmitted are selected from the coded bit sequence, so as to complete code rate matching, and obtain a bit sequence C. Further, operation s5 is performed to perform code rate matching on the bit sequence C, i.e. store the bit sequence C into a circular buffer (buffer). The bit sequence C may then be transmitted (not shown).

Those skilled in the art understand that the shortening bits are padding bits added to satisfy an integer multiple of the sub-circulant matrix of the selected base graph.

Wherein, from the start bit (i.e. bit k0) of the bit sequence C, Redundancy Version (RV) 0 may cycle several times based on the circular buffer when the length of RV0 exceeds the circular buffer. Accordingly, the RV1 starts from the bit k1, the RV2 starts from the bit k2, and the RV starts from the bit k3, which may also be cycled for several times based on the circular buffer.

The length of the circular buffer is calculated according to the buffer resources of each CB. The length of the circular buffer is related to the code rate of an MCS table configured by Downlink Control Information (DCI) at each transmission and the lowest code rate of the LDPC base map selected by the transmission service. The code rate of the MCS table refers to a target code rate expected to be obtained by rate matching the information sequence.

When the code rate (i.e. the target code rate) in the MCS table configured by the DCI is higher than the lowest code rate of the selected base graph, a sequence of the target code rate length corresponding to the MCS table may be intercepted from the coded bit sequence for transmission.

Further, the 3GPP recent conference has agreed: aiming at URLLC service scene, an extremely low code rate is added in a CQI table and an MCS table. Therefore, when the target code rate in the MCS table configured by the DCI is lower than the lowest code rate of the selected base map, the coded bit sequence may be cyclically repeated and transmitted according to the lowest code rate of the base map.

Specifically, in the prior art, the code rate matching scheme of the URLLC service is the same as the code rate matching scheme of the eMBB service. As shown in fig. 2, when the coding rate of the MCS table configured by DCI is lower than the lowest coding rate that can be achieved by the base graph, if the prior art code rate matching scheme is still adopted, the length len of the cyclic buffer can be calculated according to the lowest coding rate that can be achieved by the base graph in the bit selection process, so that the length of the coded transmission bit sequence len1 may exceed the length of the cyclic buffer. Because the length len1 of the coded transmission bit sequence is much longer than the length of the cyclic buffer len corresponding to the lowest bit rate that can be achieved by the base map, when URLLC single transmission is performed, the bit sequence to be transmitted is obtained by cyclically repeating the bit sequence in the cyclic buffer a plurality of times.

Further, after the code rate matching, the bit sequence to be transmitted may be subjected to row-column interleaving, and bits may be mapped to symbols in columns.

As shown in fig. 3, by adopting High Speed Packet Access (HSPA) row-column interleaving, it can be ensured that the information bits are at the High bits of the symbol and the check bits are at the low bits of the symbol, so that the information bits can occupy a larger weight in the energy of the symbol and are subjected to less interference during transmission. By using the characteristic of HSPA row-column interleaving, the bit sequence to be transmitted with extremely low code rate can be changed so as to enhance the reliability of single transmission of URLLC.

The embodiment of the invention provides a single URLLC transmission method, which comprises the following steps: circularly repeating the coded bit sequence to obtain a transmission bit sequence; the coded bit sequence comprises information bits and check bits; placing information bits in the transmission bit sequence in front of check bits in the transmission bit sequence to obtain a first output sequence; and processing the first output sequence to obtain an output signal and outputting the output signal. According to the technical scheme provided by the embodiment of the invention, the bit sequence after cyclic repetition coding is the first output bit sequence obtained by preposing the information bits in the transmission sequence, and HSPA (high speed packet access) row-column interleaving can be utilized to ensure that the information bits are positioned in front of each symbol in the symbol mapping process of the first output sequence, namely the information bits are positioned at the position with larger weight of each symbol, so that the information bits have stronger anti-interference capability in the transmission process.

Further, in a URLLC service scenario, if an extremely low code rate (e.g., 30/1024, 50/1024) is used for URLLC single transmission, the technical solution provided by the embodiments of the present invention can achieve significant improvement in decoding performance, and enhance reliability and robustness of URLLC single transmission.

In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in detail below.

Fig. 4 is a flowchart illustrating a URLLC single transmission method according to an embodiment of the present invention. The URLLC single transmission refers to a transmission that requires one transmission to complete reliable communication, and is applicable to the user equipment side, e.g., performed by the UE.

Specifically, the URLLC single transmission method may include the following steps:

step S101, carrying out cyclic repetition on the coded bit sequence to obtain a transmission bit sequence, wherein the coded bit sequence comprises information bits and check bits;

step S102, placing the information bit in the transmission bit sequence in front of the check bit in the transmission bit sequence to obtain a first output sequence;

and step S103, processing the first output sequence to obtain an output signal and outputting the output signal.

More specifically, in step S101, the UE may encode information bits to be transmitted (also referred to as systematic bits) to obtain an encoded bit sequence. In a specific implementation, a base graph (base graph) of the LDPC code may be determined first. In general, the base map of URLLC single transmission selection is base map 2. Secondly, adding Cyclic Redundancy Check (CRC) bits at the tail of the information bit sequence to be transmitted to obtain a first bit sequence. For example, it may be a CRC check bit of length 16.

After obtaining the first bit sequence, shortening bits may be added according to actual requirements to obtain a second bit sequence. The length of the shortened bit

is a pair of

And rounding up. The second bit sequence enables the length of the information bits to be transmitted to be integral multiple of the sub-circulant matrix of the base map. Those skilled in the art understand that the UE may determine the LDPC coding matrix according to the base graph, which is not described herein.

After obtaining the second bit sequence, LDPC encoding may be performed on the second bit sequence according to the lowest code rate that can be achieved by the base graph, so as to obtain the encoded bit sequence.

If the code rate of the MCS table configured by the DCI is small, the code rate may be referred to as an extremely low code rate. If the very low code rate R1 is 90/1024, then the code rate R may be considered as a normal code rate when the MCS table indicates a code rate R > 90/1024. The coding unit of the UE may code the input bit sequence according to the lowest code rate R1 that the base graph can achieve.

Taking R1-90/1024 as an example, as shown in fig. 5, an encoded sequence D is obtained after encoding, and the encoded bit sequence D may be stored in a circular buffer. If the code rate R is less than or equal to 90/1024, the code rate is an extremely low code rate. In this case, the UE may encode the input bit sequence according to the lowest code rate that can be achieved by the base map by using the encoding unit and cyclically repeat the encoded bit sequence to obtain the transmission sequence E. If the code rate R is greater than 90/1024, the input bit sequence can be coded with the lowest code rate that the base map can reach to obtain a sending sequence E and output.

If the MCS table indicates a target code rate R ≦ R1, then the transmission bit sequence in the cyclic buffer may be cyclically repeated to obtain a transmission bit sequence E1, as shown in FIG. 6. Thereafter, in step S102, all the information bits in the sequence E1 may be placed in advance to the front of the sequence, and all the check bits in the sequence E1 may be placed to the tail of the sequence, so as to obtain a sequence E2. If the sequence E2 is subjected to HSPA row-column interleaving, the information bits can be obtained to be at the high bits of the symbol, and the check bits are obtained to be at the low bits of the symbol, so that the information bits have larger weight in the energy of the symbol and are less interfered in the transmission process, and the reliability and the robustness of single transmission of the URLLC can be improved.

In a specific implementation, according to an actual implementation requirement, 1 or more copies of all information bit portions located at the front of the sequence E2 may be repeatedly placed at the front of the sequence, and parity bits are placed behind the information bit portions, so as to obtain a sequence E3, and further improve the weight of the information bits.

If the check bit length of the sequence E3 exceeds the preset sequence length, a tail truncation mode may be used to obtain the transmitted sequence E with the same length as the preset sequence length. The preset column length is related to the target code rate R indicated by the MCS table, and correspondingly, the length of the transmission sequence E is also related to the target code rate R indicated by the MCS table.

As a non-limiting example, in a URLLC service scenario, the UE may select the base graph 2 of the LDPC code as a coding matrix, where the lowest code rate that can be achieved by the coding matrix corresponding to the base graph 2 is 1/5, and if a lower code rate (e.g., 50/1024) is to be achieved, the coding matrix must be implemented by repeating a bit sequence. When the MCS table indicates a code rate of 50/1024, the length of the transmitted actual codeword is approximately equal to 4 times the length of the circular buffer (

Integer quotient of).

As shown in fig. 7, a sequence a is obtained by a prior art scheme, and the sequence a is obtained by cyclically repeating a bit sequence in a circular buffer, wherein information bits and check bits are alternately placed in the sequence a.

The sequence B is obtained by pre-positioning all information bits in the sequence A, and all information bits in the sequence A can be placed at the forefront of a transmission sequence through HSPA row-column interleaving, so that the information bits can be ensured to be positioned at the position with larger weight of each symbol in the symbol mapping process, and the information bits have stronger anti-jamming capability in the transmission process.

The sequence C is obtained by repeating the information bits in the sequence B for a plurality of times and reducing the number of transmission check bits, so that the advantage that the information bits in the LDPC check matrix have larger decoding weight can be more fully utilized, and the transmission reliability and robustness are improved.

In step S103, the UE may process (e.g., bit interleave, resource mapping, etc.) the first output sequence to obtain an output signal and output the output signal.

As a variation, the UE may process (e.g., bit interleave, resource mapping, etc.) the second output sequence to obtain an output signal and output the output signal.

As another variation, the UE may process (e.g., bit interleave, resource mapping, etc.) the third output sequence to obtain an output signal and output the output signal.

Referring to fig. 8 and 9, a simulation result of the prior art compared with the prior art can be obtained, fig. 8 and 9 are schematic diagrams of simulation curves of the prior art compared with the prior art, the information bit length in fig. 8 is 500, and the information bit length in fig. 9 is 3840, when the information bit length is 500 and 3840, the fig. 8 and 9 respectively simulate 30/1024 and 50/1024 code rates, in the prior art scheme, the information bits and the check bits are alternately arranged, the information bits in the embodiment of the invention are before, the check bits are after, and other bits are not modified (i.e. the first output sequence).

Fig. 10 and 11 are schematic diagrams of still another simulation curves of the embodiment of the present invention and the prior art, in which when the information bit length is 500 and 3840 respectively, rates of 30/1024 and 50/1024 are simulated, and the information bit is preceded and the number of bits is doubled in the embodiment of the present invention, wherein the vertical axis of the coordinate represents BLER, the horizontal axis represents dB domain snr. "Δ" represents the curve obtained in the embodiment of the present invention, and "◇" represents the curve obtained in the prior art, and compared with the prior art, the performance curve of the embodiment of the present invention in which the information bit is preceded and the number of information bits is doubled (i.e., compared with the performance of the second output sequence obtained in the embodiment of the present invention and the sequence in the prior art) brings about 0.3dB performance gain.

Therefore, by the technical scheme provided by the embodiment of the invention, the information bits are positioned in front of each symbol in the symbol mapping process of the bit sequence by using HSPA (high speed packet access) row-column interleaving, and the information bits are positioned at the position with larger weight of each symbol in the symbol mapping process of the first output sequence, so that the information bits have stronger anti-interference capability in the transmission process. Further, in a URLLC service scenario, when an extremely low code rate (e.g., 30/1024, 50/1024) is used for URLLC single transmission, the technical solution provided by the embodiments of the present invention can achieve significant improvement of decoding performance, and enhance reliability and robustness of URLLC single transmission.

Fig. 12 is a schematic structural diagram of a URLLC single transmission apparatus according to an embodiment of the present invention, which can be applied to a user equipment side, for example, executed by a UE. Specifically, the URLLC single transmission apparatus 10 may include:

a repetition module 102, adapted to perform cyclic repetition on an encoded bit sequence to obtain a transmission bit sequence, where the encoded bit sequence includes information bits and check bits; a pre-positioning module 103, adapted to position information bits in the transmission bit sequence before check bits in the transmission bit sequence to obtain a first output sequence; and the output module 106 is adapted to process the first output sequence to obtain an output signal and output the output signal.

Before processing the first output sequence, the URLLC single-transmission apparatus 10 may further include: and the repeated output module 104 is adapted to repeat the information bits in the first output sequence, and place the repeated information bits in the first output sequence before the check bits in the first output sequence to obtain a second output sequence.

In a specific implementation, the URLLC single transmission apparatus 10 may further include: and the truncating module 105 is adapted to obtain a second output sequence after the information bits in the repeated first output sequence are placed in front of the check bits in the first output sequence, and obtain a third output sequence with the same length as the preset sequence by adopting tail truncation when the length of the second output sequence exceeds the length of the preset sequence.

The URLLC single transmission apparatus 10 may further include: the determining module 101 is adapted to determine a repetition number of the cyclic repetition of the encoded bit sequence before the cyclic repetition of the encoded bit sequence.

In a specific implementation, the determining module 101 may be further configured to determine a base graph of an LDPC code; and determining the repetition times according to the lowest code rate of the base graph and a target code rate, wherein the target code rate refers to the code rate in the MCS table configured by the DCI.

The repetition module 102 may be configured to store the encoded bit sequence in a circular buffer; cyclically repeating the encoded bit sequence based on the cyclic buffer when the target code rate is less than or equal to the lowest code rate of the base graph.

Wherein the encoded bit sequence may be determined as follows: adding check bits to information bits to be transmitted to obtain a first bit sequence, wherein the information bits to be transmitted refer to information bits in the coded bit sequence; adding preset bits to the first bit sequence to obtain a second bit sequence; and performing LDPC coding on the second bit sequence according to the lowest code rate of the base graph to obtain the coded bit sequence.

The preset bit is a shortening bit, and the length of the shortening bit

is a pair of

And rounding up.

Those skilled in the art understand that in practical applications, the modules may run simultaneously and perform parallel processing to speed up the code rate matching, which is not described herein again.

For more contents of the operation principle and the operation mode of the URLLC single transmission apparatus 10, reference may be made to the relevant descriptions in fig. 4 to fig. 7, which are not described herein again.

Further, the embodiment of the present invention further discloses a storage medium, on which computer instructions are stored, and when the computer instructions are executed, the method technical solutions described in the embodiments shown in fig. 4 to fig. 7 are executed. Preferably, the storage medium may include a computer-readable storage medium. The storage medium may include ROM, RAM, magnetic or optical disks, etc.

Further, an embodiment of the present invention further discloses a terminal, which includes a memory and a processor, where the memory stores a computer instruction capable of running on the processor, and the processor executes the method technical solution described in the embodiments shown in fig. 4 to 7 when running the computer instruction. Preferably, the base station may interact with the user equipment, and specifically, the terminal may be a user equipment (i.e., UE).

Although the present invention is disclosed above, the present invention is not limited thereto. Various changes and modifications may be effected therein by one skilled in the art without departing from the spirit and scope of the invention as defined in the appended claims.

Claims

1. A URLLC single transmission method is characterized by comprising the following steps:

circularly repeating the coded bit sequence to obtain a transmission bit sequence, wherein the coded bit sequence comprises information bits and check bits;

placing information bits in the transmission bit sequence in front of check bits in the transmission bit sequence to obtain a first output sequence;

and processing the first output sequence to obtain an output signal and outputting the output signal.

2. The URLLC single-transmission method of claim 1, further comprising, prior to processing said first output sequence:

and repeating the information bits in the first output sequence, and placing the repeated information bits in the first output sequence before the check bits in the first output sequence to obtain a second output sequence.

3. The URLLC single-transmission method of claim 2, wherein after the step of placing the repeated information bits in the first output sequence before the check bits in the first output sequence to obtain a second output sequence, further comprises:

and when the length of the second output sequence exceeds the length of a preset sequence, tail truncation is adopted to obtain a third output sequence with the same length as the preset sequence.

4. The URLLC single-transmission method of claim 1, further comprising, before cyclically repeating the encoded bit sequence:

the number of repetitions of cyclic repetition of the encoded bit sequence is determined.

5. The URLLC single-transmission method of claim 4, wherein said determining the number of repetitions of cyclic repetition of the encoded bit sequence comprises:

determining a base graph of the LDPC code;

and determining the repetition times according to the lowest code rate of the base graph and a target code rate, wherein the target code rate refers to the code rate in the MCS table configured by the DCI.

6. The URLLC single-transmission method of claim 5, wherein said cyclically repeating the encoded bit sequence comprises:

storing the encoded bit sequence to a circular buffer;

cyclically repeating the encoded bit sequence based on the cyclic buffer when the target code rate is less than or equal to the lowest code rate of the base graph.

7. The URLLC single-transmission method of claim 5, wherein said encoded bit sequence is determined as follows:

adding check bits to information bits to be transmitted to obtain a first bit sequence, wherein the information bits to be transmitted refer to information bits in the coded bit sequence;

adding preset bits to the first bit sequence to obtain a second bit sequence;

and performing LDPC coding on the second bit sequence according to the lowest code rate of the base graph to obtain the coded bit sequence.

8. According toThe URLLC single transmission method of claim 7 wherein said predetermined bits are shortening bits, and wherein said shortening bits have a length

is a pair of

And rounding up.

9. A URLLC single-transfer apparatus, comprising:

a repetition module adapted to perform cyclic repetition on the encoded bit sequence to obtain a transmission bit sequence;

the coded bit sequence comprises information bits and check bits;

the preposition module is suitable for placing the information bits in the transmission bit sequence in front of the check bits in the transmission bit sequence to obtain a first output sequence;

and the output module is suitable for processing the first output sequence to obtain an output signal and outputting the output signal.

10. A storage medium having stored thereon computer instructions, characterized in that said computer instructions when executed perform the steps of the URLLC single-transfer method of any one of claims 1 to 8.

11. A terminal comprising a memory and a processor, said memory having stored thereon computer instructions executable on said processor, characterized in that said processor, when executing said computer instructions, performs the steps of the URLLC single transmission method of any one of claims 1-8.