Sequence processing method and communication device

Abstract

The invention discloses a sequence processing method and a communication device, and the method comprises the steps: receiving first indication information; obtaining a first bit sequence and a second bit sequence; outputting a third bit sequence under the condition that the first indication information indicates a first transmission mechanism; the third bit sequence is obtained based on superposition of the first bit sequence and the second bit sequence. By adopting the method and the device, the transmission requirement of the low-delay service can be met.

Description

Technical Field

[0001] The application relates to the field of communication technologies, and in particular, to a sequence processing method and a communication device. Background Art

[0002] With the continuous development of the fifth-generation mobile communication technology (5G), the data transmission delay is continuously reduced, and the transmission capacity is getting larger and larger. 5G communication systems are gradually penetrating into some multimedia services with strong real-time requirements and large data capacity requirements, such as video transmission, cloud gaming (CG), and extended reality (XR), where XR includes virtual reality (VR) and augmented reality (AR). With the rapid increase in the communication transmission rate, real-time video transmission services have gradually become one of the core services in the current network. Traditional hybrid automatic repeat request (HARQ) is difficult to play a role in some services with low latency requirements because the feedback of acknowledgement / negative-acknowledgement (ACK / NACK) information will increase the latency. Summary of the Invention

[0003] The present application provides a sequence processing method and a communication device, which can improve transmission reliability and spectrum efficiency and meet the transmission requirements of low-latency services.

[0004] In a first aspect, an embodiment of the present application provides a sequence processing method. The method can be executed by a terminal device or by a component of the terminal device (such as a processor, a chip, or a chip system, etc.). The sequence processing method may include:

[0005] Receiving first indication information; Exemplarily, the first indication information may be used to indicate a transmission mechanism.

[0006] Obtaining a first bit sequence and a second bit sequence; When the first indication information indicates a first transmission mechanism, outputting a third bit sequence; The third bit sequence is obtained by superimposing the first bit sequence and the second bit sequence. Alternatively, the first transmission mechanism may be a superimposed transmission mechanism.

[0007] Implementing the method described in the first aspect, when the terminal device receives the indication information indicating the first transmission mechanism, it superimposes two bit sequences to obtain the superimposed bit sequence for transmission. One of the two bit sequences (the first bit sequence or the second bit sequence) for superimposition is the bit sequence that has been transmitted. The bit sequence that has been transmitted is superimposed with the non-transmitted bit sequence (i.e., the other bit sequence among the two bit sequences for superimposition) to obtain the third bit sequence. The third bit sequence contains the bit sequence that has been transmitted, thereby achieving the effect of retransmitting the bit sequence that has been transmitted. It can equivalently achieve an effect similar to retransmission for the bit sequence that has been transmitted, thereby improving the transmission reliability, and no HARQ feedback is required, which can improve the spectral efficiency and meet the requirements of low-latency services. Further, for the non-transmitted bit sequence superimposed this time, in the next superimposition, this non-transmitted bit sequence becomes the bit sequence that has been transmitted, and this bit sequence that has been transmitted can be further superimposed with other non-transmitted bit sequences. The bit sequence obtained by superimposing the transmitted bit sequence with the subsequent bit sequence to be transmitted can achieve an effect similar to retransmission for the bit sequence that has been transmitted.

[0008] In a possible implementation, the first bit sequence, the second bit sequence, and the third bit sequence each include N bits, where N is a positive integer;

[0009] The third bit sequence is obtained based on the superimposition of the first bit sequence and the second bit sequence, specifically including:

[0010] The i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence and the i-th bit in the second bit sequence; or,

[0011] The i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence after interleaving and the i-th bit in the second bit sequence; or,

[0012] The i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence and the i-th bit in the second bit sequence after interleaving;

[0013] i is an integer greater than or equal to 1 and less than or equal to N.

[0014] Exemplarily, the above bit superimposition can be bitwise exclusive OR.

[0015] Implementing this method, the i-th bit in the first bit sequence and the i-th bit in the second bit sequence can be superimposed to obtain the i-th bit in the third bit sequence. Or, it can also be that one of the bit sequences is interleaved and then superimposed with the other bit sequence to obtain the third bit sequence, thereby providing transmission reliability and spectral efficiency.

[0016] In a possible implementation, the first bit sequence includes K bits, the second bit sequence includes N bits, the third bit sequence includes N bits, where K and N are positive integers, and K is less than N;

[0017] The third bit sequence is obtained by superimposing the first bit sequence and the second bit sequence, specifically including:

[0018] The i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence and the i-th bit in the second bit sequence; or,

[0019] The i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence after interleaving and the i-th bit in the second bit sequence; or,

[0020] The i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence and the i-th bit in the second bit sequence after interleaving;

[0021] i is an integer greater than or equal to 1 and less than or equal to K.

[0022] In a possible implementation, the method further includes:

[0023] When the first indication information indicates the second transmission mechanism, output the first bit sequence or the second bit sequence.

[0024] Exemplarily, the second transmission mechanism may be a HARQ retransmission mechanism.

[0025] Implementing this method, if the first indication information indicates the second transmission mechanism, then output a bit sequence, and the output bit sequence is the untransmitted bit sequence. Through the first indication information, it can flexibly switch between the first transmission mechanism and the second transmission mechanism, so as to meet various service requirements. For example, for services with unrestricted latency, the second transmission mechanism can be used, and for services with low latency requirements, the first transmission mechanism can be used.

[0026] In a possible implementation, the first bit sequence and the second bit sequence may be corresponding transport blocks (TBs). The first bit sequence corresponds to the first TB, and the second bit sequence corresponds to the second TB. For example, the first bit sequence is the bit sequence after encoding the first TB, and the second bit sequence is the bit sequence after encoding the second TB. Alternatively, the first bit sequence and the second bit sequence may be corresponding code blocks (CBs). The first bit sequence corresponds to the first CB, and the second bit sequence corresponds to the second CB. For example, the first bit sequence is the bit sequence after encoding the first CB, and the second bit sequence is the bit sequence after encoding the second CB.

[0027] Implementing this method can superimpose the bit sequences corresponding to the TBs or superimpose the bit sequences corresponding to the CBs, thereby achieving an equivalent or approximate effect of retransmitting the TBs or CBs and meeting the requirements of low-latency services.

[0028] In a possible implementation, the first CB and the second CB may be CBs in the same TB.

[0029] Implementing this method superimposes the bit sequences corresponding to different CBs in the same TB. For different TBs, differential superimposition parameter design can be performed, and the superimposition parameter design is more flexible.

[0030] In a possible implementation, the method further includes:

[0031] Receiving second indication information, where the second indication information indicates that the first bit sequence and the second bit sequence correspond to a TB or a CB. Here, the first bit sequence and the second bit sequence corresponding to a TB can be understood as the bit sequences after encoding different TBs, and the first bit sequence and the second bit sequence corresponding to a CB can be understood as the bit sequences after encoding different CBs.

[0032] Implementing this method can indicate through the second indication information whether the superimposed transmission is the superimposition of the bit sequences corresponding to the TBs or the superimposition of the bit sequences corresponding to the CBs, and can flexibly switch between the two superimposition methods.

[0033] In a possible implementation, when the second indication information indicates the first mode, the first bit sequence and the second bit sequence correspond to TBs;

[0034] When the second indication information indicates the second mode, the first bit sequence and the second bit sequence correspond to CBs.

[0035] Implementing this method can indirectly indicate whether the superimposition of the bit sequences corresponding to the TBs or the superimposition of the bit sequences corresponding to the CBs through the mode indicated by the indication information, so as to achieve flexible switching between the two superimposition methods.

[0036] In a possible implementation, when the first indication information indicates the first transmission mechanism, output a third bit sequence, including:

[0037] When the first indication information indicates the first transmission mechanism, instruct the first process to output a third bit sequence, where the first process is one of M processes, and M is an integer greater than or equal to 1.

[0038] Implementing this method, the superimposed bit sequence can be output through processes, so that the output of the superimposed sequence by one or more processes in parallel can be achieved.

[0039] In a possible implementation, the M processes are the processes for the first transmission mechanism among Q processes, M is an integer less than or equal to Q and greater than or equal to 0, and Q is an integer greater than 1;

[0040] The Z processes among the Q processes other than the M processes are the processes for the second transmission mechanism, and Z is an integer less than or equal to Q and greater than or equal to 0. Exemplarily, Z = Q - M.

[0041] Implementing this method, all or part of the Q processes can be used for the first transmission mechanism, or all or part of the Q processes can be used for the second transmission mechanism, so as to meet the requirements of various service scenarios.

[0042] In a possible implementation, the first indication information indicates the M processes for the first transmission mechanism;

[0043] When the first indication information indicates the first transmission mechanism, instruct the first process to output a third bit sequence, including:

[0044] When the first indication information indicates that the first process is for the first transmission mechanism, instruct the first process to output a third bit sequence.

[0045] Implementing this method, the first indication information can indicate which processes are used for the first transmission mechanism, and the processes used for the first transmission mechanism indicated by the first indication information output the superimposed bit sequence, so as to facilitate flexible control of the processes outputting the superimposed sequence.

[0046] In a possible implementation, the first indication information further indicates the Z processes for the second transmission mechanism.

[0047] Implementing this method, the first indication information can further indicate which processes are used for the second transmission mechanism, so that the output of the bit sequence can be achieved by different processes using different transmission mechanisms, and the coexistence of two transmission mechanisms can be realized.

[0048] In a possible implementation, when the value of M is greater than 1, the index values of the first TB corresponding to the first bit sequence and the index values of the second TB corresponding to the second bit sequence are not consecutive.

[0049] Implementing this method, when the value of M is greater than 1, that is, the number of processes for the first transmission mechanism is multiple, and the index values of the TBs corresponding to the bit sequences superimposed by the same process are not consecutive, which can better combat consecutive errors.

[0050] In a second aspect, an embodiment of the present application provides another sequence processing method. Among them, this method can be executed by a network device or by components of the network device (such as a processor, a chip, or a chip system, etc.). The sequence processing method may include:

[0051] Sending fourth indication information;

[0052] Obtaining a fourth bit sequence and a fifth bit sequence;

[0053] When the fourth indication information indicates the first transmission mechanism, outputting a sixth bit sequence;

[0054] Among them, the sixth bit sequence is obtained by superimposing the fourth bit sequence and the fifth bit sequence.

[0055] Implementing the method described in the second aspect, the network device outputs a sixth bit sequence obtained by superimposing the fourth bit sequence and the fifth bit sequence. The sixth bit sequence superimposes two bit sequences. One of the two bit sequences (the fourth bit sequence or the fifth bit sequence) for superimposition is a bit sequence that has been transmitted. The bit sequence that has been transmitted is superimposed with the bit sequence that has not been transmitted (that is, the other bit sequence among the two bit sequences for superimposition) to obtain the sixth bit sequence. The sixth bit sequence contains the bit sequence that has been transmitted, thereby achieving the effect of retransmitting the bit sequence that has been transmitted. It can equivalently achieve an effect similar to retransmission for the bit sequence that has been transmitted, improve transmission reliability, and does not require HARQ feedback, which can improve spectrum efficiency and meet the requirements of low-latency services. Further, for the bit sequence that has not been transmitted in this superimposition, in the next superimposition, the bit sequence that has not been transmitted becomes the bit sequence that has been transmitted, and the bit sequence that has been transmitted can be further superimposed with other bit sequences that have not been transmitted. By superimposing the transmitted bit sequence with the subsequent bit sequence to be transmitted, a bit sequence can be obtained, which can achieve an effect similar to retransmission for the bit sequence that has been transmitted.

[0056] In a possible implementation, the fourth bit sequence, the fifth bit sequence, and the sixth bit sequence each include W bits, where W is a positive integer;

[0057] The sixth bit sequence is obtained by superimposing the fourth bit sequence and the fifth bit sequence, and includes:

[0058] The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit in the fourth bit sequence and the i-th bit in the fifth bit sequence; or,

[0059] The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit after interleaving the fourth bit sequence and the i-th bit in the fifth bit sequence; or,

[0060] The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit in the fourth bit sequence and the i-th bit after interleaving the fifth bit sequence;

[0061] i is an integer greater than or equal to 1 and less than or equal to W.

[0062] In a possible implementation, the fourth bit sequence includes K bits, the fifth bit sequence includes W bits, the sixth bit sequence includes W bits, K and N are positive integers, and K is less than W;

[0063] The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit in the fourth bit sequence and the i-th bit in the fifth bit sequence; or,

[0064] The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit after interleaving the fourth bit sequence and the i-th bit in the fifth bit sequence; or,

[0065] The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit in the fourth bit sequence and the i-th bit after interleaving the fifth bit sequence;

[0066] i is an integer greater than or equal to 1 and less than or equal to K.

[0067] In a possible implementation, the method further includes:

[0068] When the fourth indication information indicates the second transmission mechanism, output the fourth bit sequence or the fifth bit sequence.

[0069] In a possible implementation, the fourth bit sequence and the fifth bit sequence may correspond to the corresponding TBs, the fourth bit sequence corresponds to the third TB, and the fifth bit sequence corresponds to the fourth TB. For example, the fourth bit sequence is the bit sequence after encoding the third TB, and the fifth bit sequence is the bit sequence after encoding the fourth TB; or,

[0070] The fourth bit sequence and the fifth bit sequence may be corresponding CBs. The fourth bit sequence corresponds to the third CB, and the fifth bit sequence corresponds to the fourth CB. For example, the fourth bit sequence is the bit sequence after encoding the third CB, and the fifth bit sequence is the bit sequence after encoding the fourth CB.

[0071] In a possible implementation, the third CB and the fourth CB are CBs in the same TB.

[0072] In a possible implementation, the method further includes:

[0073] Sending fifth indication information, where the fifth indication information indicates that the fourth bit sequence and the fifth bit sequence correspond to a TB or a CB. Herein, the fourth bit sequence and the fifth bit sequence corresponding to a TB can be understood as the fourth bit sequence and the fifth bit sequence being the bit sequences after encoding different TBs respectively, and the fourth bit sequence and the fifth bit sequence corresponding to a CB can be understood as the fourth bit sequence and the fifth bit sequence being the bit sequences after encoding different CBs respectively. The fifth indication information can indicate that the fourth bit sequence and the fifth bit sequence are the bit sequences after encoding different TBs or different CBs.

[0074] In a possible implementation, when the fifth indication information indicates the first mode, the fourth bit sequence and the fifth bit sequence correspond to a TB;

[0075] When the fifth indication information indicates the second mode, the fourth bit sequence and the fifth bit sequence correspond to a CB.

[0076] In a possible implementation, when the fourth indication information indicates the first transmission mechanism, outputting a sixth bit sequence includes:

[0077] When the fourth indication information indicates the first transmission mechanism, instructing a second process to output the sixth bit sequence according to the decoding result or the decoded soft information of other superimposed bit sequences. The second process is one of the R processes, and R is an integer greater than or equal to 1.

[0078] In a possible implementation, the R processes are the processes for the first transmission mechanism among the P processes, R is an integer less than or equal to P and greater than or equal to 0, and P is an integer greater than 1;

[0079] The Y processes among the P processes other than the R processes are the processes for the second transmission mechanism, and Y is an integer less than or equal to P and greater than or equal to 0.

[0080] In a possible implementation, the fourth indication information indicates the R processes for the first transmission mechanism;

[0081] In the case where the fourth indication information indicates the first transmission mechanism, the second process is instructed to output a sixth bit sequence according to the decoding result of other superimposed bit sequences or the decoded soft information, specifically including:

[0082] In the case where the fourth indication information indicates that the second process is for the first transmission mechanism, the second process is instructed to output a sixth bit sequence according to the decoding result of other superimposed bit sequences or the decoded soft information.

[0083] In a possible implementation, the fourth indication information further indicates Y processes for the second transmission mechanism.

[0084] In a possible implementation, when the value of R is greater than 1, the index value of the third TB corresponding to the fourth bit sequence and the index value of the fourth TB corresponding to the fifth bit sequence are not consecutive.

[0085] The beneficial effects of various possible implementation manners in the second aspect may refer to the beneficial effects of various possible implementation manners in the first aspect, which will not be elaborated here.

[0086] In a third aspect, an embodiment of the present application provides a sequence processing method, where the method may be executed by a network device or by a component of the network device (such as a processor, a chip, or a chip system, etc.). The sequence processing method may include:

[0087] Sending first indication information;

[0088] In the case where the first indication information indicates the first transmission mechanism, superposition decoding is performed on the received third bit sequence according to the decoding result of other superimposed bit sequences or the decoded soft information to obtain a first bit sequence and a second bit sequence. Among them, the other superimposed bit sequences include at least the superimposed bit sequences of the first bit sequence or the second bit sequence.

[0089] The superimposed bit sequence of the first bit sequence or the second bit sequence can be understood that the superimposed bit sequence is obtained by superimposing the first bit sequence or the second bit sequence and other bit sequences. The first transmission of the first bit sequence or the second bit sequence may be included in the superimposed bit sequence.

[0090] When implementing the method described in the third aspect, the network device may indicate a first transmission mechanism to the terminal device, and perform superposition decoding on the bit sequence sent by the terminal device to recover a first bit sequence and a second bit sequence. Since the third bit sequence is superimposed with the first bit sequence and the second bit sequence, and other superimposed bit sequences also include the first bit sequence or the second bit sequence, the third bit sequence combines the decoding results of other superimposed bit sequences for joint decoding, or decodes by combining the soft information after decoding of other superimposed bit sequences, which can equivalently achieve the effect of retransmission, thereby not relying on HARQ feedback, improving transmission reliability and spectrum efficiency, and meeting the requirements of low-latency services.

[0091] In a possible implementation manner, the first bit sequence, the second bit sequence, and the third bit sequence each include N bits, where N is a positive integer;

[0092] Performing superposition decoding on the received third bit sequence to obtain a first bit sequence and a second bit sequence according to the decoding result or the soft information after decoding of other superimposed bit sequences includes:

[0093] Performing superposition decoding on the i-th bit in the third bit sequence according to the decoding result or the soft information after decoding of other superimposed bit sequences to obtain the i-th bit in the first bit sequence and the i-th bit in the second bit sequence; or,

[0094] Performing superposition decoding on the i-th bit in the third bit sequence according to the decoding result or the soft information after decoding of other superimposed bit sequences to obtain the i-th bit in the interleaved first bit sequence and the i-th bit in the second bit sequence, and deinterleaving the interleaved first bit sequence to obtain the first bit sequence;

[0095] Performing superposition decoding on the i-th bit in the third bit sequence according to the decoding result or the soft information after decoding of other superimposed bit sequences to obtain the i-th bit in the first bit sequence and the i-th bit in the interleaved second bit sequence, and deinterleaving the interleaved second bit sequence to obtain the second bit sequence;

[0096] The i is an integer greater than or equal to 1 and less than or equal to N.

[0097] In a possible implementation manner, the first bit sequence includes K bits, the second bit sequence includes N bits, the third bit sequence includes N bits, K and N are positive integers, and K is less than N;

[0098] Performing superposition decoding on the received third bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain a first bit sequence and a second bit sequence, including:

[0099] Performing superposition decoding on the i-th bit in the third bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain the i-th bit in the first bit sequence and the i-th bit in the second bit sequence; or,

[0100] Performing superposition decoding on the i-th bit in the third bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain the i-th bit in the interleaved first bit sequence and the i-th bit in the second bit sequence, and deinterleaving the interleaved first bit sequence to obtain the first bit sequence;

[0101] Performing superposition decoding on the i-th bit in the third bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain the i-th bit in the first bit sequence and the i-th bit in the interleaved second bit sequence, and deinterleaving the interleaved second bit sequence to obtain the second bit sequence;

[0102] The i is an integer greater than or equal to 1 and less than or equal to K.

[0103] In a possible implementation manner, the method further includes:

[0104] When the first indication information indicates a second transmission mechanism, outputting the received first bit sequence or second bit sequence.

[0105] In a possible implementation manner, the first bit sequence corresponds to a first TB, and the second bit sequence corresponds to a second TB. Exemplarily, the first bit sequence corresponding to the first TB can be understood as the first bit sequence being the bit sequence after encoding of the first TB, and the second bit sequence corresponding to the second TB can be understood as the second bit sequence being the bit sequence after encoding of the second TB; or,

[0106] The first bit sequence corresponds to a first CB, and the second bit sequence corresponds to a second CB. Exemplarily, the first bit sequence corresponding to the first CB can be understood as the first bit sequence being the bit sequence after encoding of the first CB, and the second bit sequence corresponding to the second CB can be understood as the second bit sequence being the bit sequence after encoding of the second CB.

[0107] In a possible implementation manner, the first CB and the second CB are CBs in the same TB.

[0108] In a possible implementation manner, the method further includes:

[0109] Send a second indication message, where the second indication message indicates that the first bit sequence and the second bit sequence correspond to a transport block (TB) or a codeblock (CB). Herein, the first bit sequence and the second bit sequence corresponding to a TB can be understood as the bit sequences after different TB encodings, and the first bit sequence and the second bit sequence corresponding to a CB can be understood as the bit sequences after different CB encodings.

[0110] In a possible implementation, when the second indication message indicates the first mode, the first bit sequence and the second bit sequence correspond to a TB;

[0111] When the second indication message indicates the second mode, the first bit sequence and the second bit sequence correspond to a CB.

[0112] In a possible implementation, when the first indication message indicates the first transmission mechanism, perform superposition decoding on the received third bit sequence based on the decoding result or the decoded soft information of other superposed bit sequences to obtain the first bit sequence and the second bit sequence, including:

[0113] When the first indication message indicates the first transmission mechanism, indicate that a first process performs superposition decoding on the received third bit sequence based on the decoding result or the decoded soft information of other superposed bit sequences to obtain the first bit sequence and the second bit sequence. The first process is one of M processes, and M is an integer greater than or equal to 1.

[0114] In a possible implementation, the M processes are the processes used for the first transmission mechanism among Q processes, M is an integer less than or equal to Q and greater than or equal to 0, and Q is an integer greater than 1;

[0115] The Z processes among the Q processes other than the M processes are the processes used for the second transmission mechanism, and Z is an integer less than or equal to Q and greater than or equal to 0.

[0116] In a possible implementation, the first indication message indicates the M processes used for the first transmission mechanism; when the first indication message indicates the first transmission mechanism, indicating that a first process performs superposition decoding on the received third bit sequence based on the decoding result or the decoded soft information of other superposed bit sequences to obtain the first bit sequence and the second bit sequence, including:

[0117] When the first indication information indicates that the first process is for the first transmission mechanism, it is indicated that the first process performs superposition decoding on the received third bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain a first bit sequence and a second bit sequence.

[0118] In a possible implementation manner, the first indication information further indicates the Z processes for the second transmission mechanism.

[0119] In a possible implementation manner, when the value of M is greater than 1, the index value of the first TB corresponding to the first bit sequence and the index value of the second TB corresponding to the second bit sequence are not consecutive.

[0120] The beneficial effects of various possible implementation manners in the third aspect can refer to the beneficial effects of various possible implementation manners in the first aspect, and will not be elaborated here.

[0121] In a fourth aspect, an embodiment of the present application provides a sequence processing method. Among them, this method can be executed by a terminal device or by a component of the terminal device (such as a processor, a chip, or a chip system, etc.). The sequence processing method may include:

[0122] Receiving fourth indication information;

[0123] When the fourth indication information indicates the first transmission mechanism, superposition decoding is performed on the received sixth bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain a fourth bit sequence and a fifth bit sequence. Among them, the other superposition bit sequences at least include the superposition bit sequences of the fourth bit sequence or the fifth bit sequence.

[0124] The superposition bit sequence of the fourth bit sequence or the fifth bit sequence can be understood that this superposition bit sequence is obtained by superposing based on the fourth bit sequence or the fifth bit sequence, and other bit sequences. In this superposition bit sequence, it can be the initial transmission of the fourth bit sequence or the fifth bit sequence.

[0125] When implementing the method described in the fourth aspect, when the terminal device receives the fourth indication information sent by the network device indicating the first transmission mechanism, superposition decoding is performed on the received bit sequence to recover the fourth bit sequence and the fifth bit sequence. Since the sixth bit sequence superposes the fourth bit sequence and the fifth bit sequence, and the other superposition bit sequences also include the fourth bit sequence or the fifth bit sequence, the sixth bit sequence is jointly decoded in combination with the decoding result of the other superposition bit sequences, or decoded in combination with the decoded soft information of the other superposition bit sequences, which can equivalently achieve the effect of retransmission, improve the transmission reliability, and do not depend on HARQ feedback, improve the spectrum efficiency, and meet the requirements of low-latency services.

[0126] In a possible implementation, the fourth bit sequence, the fifth bit sequence, and the sixth bit sequence each include W bits, where W is a positive integer;

[0127] Performing superposition decoding on the received sixth bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain the fourth bit sequence and the fifth bit sequence includes:

[0128] Performing superposition decoding on the i-th bit in the sixth bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain the i-th bit in the fourth bit sequence and the i-th bit in the fifth bit sequence; or,

[0129] Performing superposition decoding on the i-th bit in the sixth bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain the i-th bit in the interleaved fourth bit sequence and the i-th bit in the fifth bit sequence, and deinterleaving the interleaved fourth bit sequence to obtain the fourth bit sequence;

[0130] Performing superposition decoding on the i-th bit in the sixth bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain the i-th bit in the fourth bit sequence and the i-th bit in the interleaved fifth bit sequence, and deinterleaving the interleaved fifth bit sequence to obtain the fifth bit sequence;

[0131] The i is an integer greater than or equal to 1 and less than or equal to W.

[0132] In a possible implementation, the fourth bit sequence includes K bits, the fifth bit sequence includes W bits, the sixth bit sequence includes W bits, K and N are positive integers, and K is less than W;

[0133] Performing superposition decoding on the received sixth bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain the fourth bit sequence and the fifth bit sequence includes:

[0134] Performing superposition decoding on the i-th bit in the sixth bit sequence according to the decoding result or decoded soft information of other superposition bit sequences to obtain the i-th bit in the fourth bit sequence and the i-th bit in the fifth bit sequence; or,

[0135] Perform superposition decoding on the i-th bit in the sixth bit sequence according to the decoding result of other superposition bit sequences or the decoded soft information, to obtain the i-th bit of the interleaved fourth bit sequence and the i-th bit of the fifth bit sequence, and de-interleave the interleaved fourth bit sequence to obtain the fourth bit sequence;

[0136] Perform superposition decoding on the i-th bit in the sixth bit sequence according to the decoding result of other superposition bit sequences or the decoded soft information, to obtain the i-th bit of the fourth bit sequence and the i-th bit of the interleaved fifth bit sequence, and de-interleave the interleaved fifth bit sequence to obtain the fifth bit sequence;

[0137] The i is an integer greater than or equal to 1 and less than or equal to K.

[0138] In a possible implementation, the method further includes:

[0139] When the fourth indication information indicates the second transmission mechanism, output the received fourth bit sequence or fifth bit sequence.

[0140] In a possible implementation, the fourth bit sequence and the fifth bit sequence may correspond to the corresponding TBs. The fourth bit sequence corresponds to the third TB, and the fifth bit sequence corresponds to the fourth TB. For example, the fourth bit sequence is the bit sequence after encoding the third TB, and the fifth bit sequence is the bit sequence after encoding the fourth TB; or,

[0141] The fourth bit sequence and the fifth bit sequence may correspond to the corresponding CBs. The fourth bit sequence corresponds to the third CB, and the fifth bit sequence corresponds to the fourth CB. For example, the fourth bit sequence is the bit sequence after encoding the third CB, and the fifth bit sequence is the bit sequence after encoding the fourth CB.

[0142] In a possible implementation, the third CB and the fourth CB are CBs in the same TB.

[0143] In a possible implementation, the method further includes:

[0144] Receive fifth indication information, where the fifth indication information indicates that the fourth bit sequence and the fifth bit sequence correspond to TBs or CBs. Here, the fourth bit sequence and the fifth bit sequence corresponding to TBs can be understood as the fourth bit sequence and the fifth bit sequence being the bit sequences after encoding different TBs respectively, and the fourth bit sequence and the fifth bit sequence corresponding to CBs can be understood as the fourth bit sequence and the fifth bit sequence being the bit sequences after encoding different CBs respectively. The fifth indication information can indicate that the fourth bit sequence and the fifth bit sequence are the bit sequences after encoding different TBs or different CBs.

[0145] In a possible implementation, when the fifth indication information indicates the first mode, the fourth bit sequence and the fifth bit sequence correspond to the TB;

[0146] In the case where the fifth indication information indicates the second mode, the fourth bit sequence and the fifth bit sequence correspond to the CB.

[0147] In a possible implementation, when the fourth indication information indicates the first transmission mechanism, the fourth bit sequence and the fifth bit sequence are obtained by performing superposition decoding on the received sixth bit sequence according to the decoding result or the decoded soft information of other superposed bit sequences, including:

[0148] When the fourth indication information indicates the first transmission mechanism, it is indicated that the second process performs superposition decoding on the received sixth bit sequence according to the decoding result or the decoded soft information of other superposed bit sequences to obtain the fourth bit sequence and the fifth bit sequence. The second process is one of the R processes, and R is an integer greater than or equal to 1.

[0149] In a possible implementation, the R processes are the processes for the first transmission mechanism among the P processes, R is an integer less than or equal to P and greater than or equal to 0, and P is an integer greater than 1;

[0150] The Y processes among the P processes other than the R processes are the processes for the second transmission mechanism, and Y is an integer less than or equal to P and greater than or equal to 0.

[0151] In a possible implementation, the fourth indication information indicates the R processes for the first transmission mechanism; when the fourth indication information indicates the first transmission mechanism, indicating that the second process performs superposition decoding on the received sixth bit sequence according to the decoding result or the decoded soft information of other superposed bit sequences to obtain the fourth bit sequence and the fifth bit sequence, including:

[0152] When the fourth indication information indicates that the second process is for the first transmission mechanism, it is indicated that the second process performs superposition decoding on the received sixth bit sequence according to the decoding result or the decoded soft information of other superposed bit sequences to obtain the third bit sequence and the fourth bit sequence.

[0153] In a possible implementation, the fourth indication information further indicates the Y processes for the second transmission mechanism.

[0154] In a possible implementation, when the value of R is greater than 1, the index value of the third TB corresponding to the fourth bit sequence and the index value of the fourth TB corresponding to the fifth bit sequence are not consecutive.

[0155] For the beneficial effects of various possible implementations in the fourth aspect, reference may be made to the beneficial effects of various possible implementations in the second aspect, which will not be elaborated here.

[0156] In a fifth aspect, an embodiment of the present application provides another sequence processing method. Wherein, this method can be executed by a terminal device or by a component of the terminal device (such as a processor, a chip, or a chip system, etc.). The method includes:

[0157] Receiving first indication information;

[0158] When the first indication information indicates a first transmission mechanism, outputting a superimposed bit sequence, where the superimposed bit sequence is generated by superimposing X bit sequences, and X is an integer greater than or equal to 2.

[0159] For various possible implementations of the first aspect, reference may be made to the various possible implementations of the first aspect.

[0160] In a sixth aspect, an embodiment of the present application provides another sequence processing method. Wherein, this method can be executed by a network device or by a component of the network device (such as a processor, a chip, or a chip system, etc.). The sequence processing method may include:

[0161] Sending fourth indication information;

[0162] When the fourth indication information indicates a first transmission mechanism, outputting a superimposed bit sequence, where the superimposed bit sequence is generated by superimposing X bit sequences, and X is an integer greater than or equal to 2.

[0163] For various possible implementations of the sixth aspect, reference may be made to the various possible implementations of the second aspect.

[0164] In a seventh aspect, an embodiment of the present application provides a communication device, including:

[0165] A transceiver unit, configured to receive first indication information;

[0166] A processing unit, configured to obtain a first bit sequence and a second bit sequence; when the first indication information indicates a first transmission mechanism, output a third bit sequence; the third bit sequence is obtained by superimposing the first bit sequence and the second bit sequence.

[0167] In an eighth aspect, an embodiment of the present application provides a communication device, including:

[0168] A transceiver unit, configured to send fourth indication information;

[0169] A processing unit, configured to obtain a fourth bit sequence and a fifth bit sequence; and output a sixth bit sequence when the fourth indication information indicates a first transmission mechanism; the sixth bit sequence is obtained by superimposing the fourth bit sequence and the fifth bit sequence.

[0170] In a ninth aspect, an embodiment of the present application provides a communication device, including:

[0171] A transceiver unit, configured to send first indication information;

[0172] A processing unit, configured to perform superimposed decoding on a received third bit sequence to obtain a first bit sequence and a second bit sequence according to a decoding result of other superimposed bit sequences or decoded soft information when the first indication information indicates a first transmission mechanism.

[0173] In a tenth aspect, an embodiment of the present application provides a communication device, including:

[0174] A transceiver unit, configured to receive fourth indication information;

[0175] A processing unit, configured to perform superimposed decoding on a received sixth bit sequence to obtain a fourth bit sequence and a fifth bit sequence according to a decoding result of other superimposed bit sequences or decoded soft information when the fourth indication information indicates a first transmission mechanism.

[0176] In an eleventh aspect, an embodiment of the present application provides a communication device, which includes a processor configured to execute the method in any possible implementation manner of the first aspect to the sixth aspect above. Alternatively, the processor is configured to execute a program stored in a memory, and when the program is executed, the method in any possible implementation manner of the first aspect to the sixth aspect above is executed.

[0177] In a possible implementation manner, the memory is located outside the above-mentioned communication device.

[0178] In a possible implementation manner, the memory is located inside the above-mentioned communication device.

[0179] In an embodiment of the present application, the processor and the memory may also be integrated into one device, that is, the processor and the memory may also be integrated together.

[0180] In a possible implementation manner, the communication device further includes a transceiver, which is configured to receive or send signals.

[0181] In a twelfth aspect, an embodiment of the present application provides a communication device, which includes a logic circuit and an interface, and the logic circuit is coupled to the interface; the interface is used for inputting and / or outputting sequences, and the logic circuit is used for performing processing operations.

[0182] In a thirteenth aspect, an embodiment of the present application provides a computer-readable storage medium, which is used for storing a computer program. When it runs on a computer, the methods shown in any possible implementation manners of the above first aspect to sixth aspect are executed.

[0183] In a fourteenth aspect, an embodiment of the present application provides a computer program product, which includes a computer program or computer code. When it runs on a computer, the methods shown in any possible implementation manners of the above first aspect to sixth aspect are executed.

[0184] In a fifteenth aspect, an embodiment of the present application provides a computer program. When it runs on a computer, the methods shown in any possible implementation manners of the above first aspect to sixth aspect are executed.

[0185] In a sixteenth aspect, an embodiment of the present application provides a wireless communication system, which includes a first communication device and a second communication device. The first communication device is used for executing the method in any possible implementation manner of the above first aspect, and the second communication device is used for executing the method in any possible implementation manner of the above third aspect; or,

[0186] The first communication device is used for executing the method in any possible implementation manner of the above second aspect, and the second communication device is used for executing the method in any possible implementation manner of the above fourth aspect.

[0187] The technical effects achieved by the above seventh aspect to sixteenth aspect can refer to the technical effects of the first aspect or the beneficial effects in the method embodiments shown below, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0188] Figure 1 is a schematic diagram of a communication system provided by an embodiment of the present application;

[0189] Figure 2 is a schematic diagram of redundant versions RV0 to RV3 provided by an embodiment of the present application;

[0190] Figure 3 is a schematic diagram of superimposed transmission provided by an embodiment of the present application;

[0191] Figure 4 is a schematic diagram of decoding provided by an embodiment of the present application;

[0192] Figure 5a It is a schematic flowchart of a sequence processing method provided by an embodiment of the present application;

[0193] Figure 5b It is a schematic diagram of superposition between bit sequences corresponding to CB provided by an embodiment of the present application;

[0194] Figure 5c It is a schematic diagram of superposition between bit sequences corresponding to TB provided by an embodiment of the present application;

[0195] Figure 5d It is a schematic diagram of superposition transmission of two processes provided by an embodiment of the present application;

[0196] Figure 5e It is a schematic diagram of multiplexing of two processes provided by an embodiment of the present application;

[0197] Figure 6 It is a schematic flowchart of another sequence processing method provided by an embodiment of the present application;

[0198] Figure 7 It is a schematic flowchart of yet another sequence processing method provided by an embodiment of the present application;

[0199] Figure 8 It is a schematic flowchart of yet another sequence processing method provided by an embodiment of the present application;

[0200] Figure 9 It is a schematic diagram of the structure of a communication device provided by an embodiment of the present application;

[0201] Figure 10 It is a schematic diagram of the structure of another communication device provided by an embodiment of the present application;

[0202] Figure 11 It is a schematic diagram of the structure of yet another communication device provided by an embodiment of the present application. Detailed implementation manners

[0203] The present application can be applied to the protocol frameworks of various wireless communication systems. The wireless communication systems may include, but are not limited to, long term evolution (LTE) systems, new radio access technology (NR) systems, future evolved communication systems, etc. Future evolved communication systems such as future networks or sixth-generation communication systems, etc.

[0204] Figure 1 It is a schematic diagram of a communication system provided by an embodiment of the present application. It can be understood that, Figure 1This is only exemplary and does not limit the network architecture applicable to the present application. Moreover, the present application does not limit transmissions such as uplink, downlink, access link, backhaul link, sidelink, etc.

[0205] Please refer to Figure 1 , which is a schematic diagram of a communication system provided by an embodiment of the present application. Figure 1 The shown network architecture includes network devices and terminal device 1 and terminal device 2. Among them, the number of network devices can be one or more, and the number of terminal devices can be one or more.

[0206] It can be understood that Figure 1 The number and form of the shown devices are for illustration purposes and do not constitute a limitation on the embodiments of the present application. For example, in actual applications, there may be two or more network devices.

[0207] In the embodiments of the present application, a network device is a device deployed in a radio access network to provide wireless communication functions for terminal devices. The network device may include various forms of macro base stations, micro base stations (also known as small stations), relay stations, access points, etc. In systems adopting different radio access technologies, the name of the network device may be different. For example, in LTE (long term evolution), it is eNB or eNodeB (evolutional nodeB). The network device may also be a radio controller in a cloud radio access network (CRAN) scenario. The network device may also be a base station device in a 5G network or a network device in a future evolved network. The network device may also be a wearable device or a vehicle-mounted device. The network device may also be a transmission and reception point (TRP). The network device may also generally refer to all devices at the network end. For example, when multiple TRPs are used to transmit data to a terminal device, the multiple TRPs are collectively referred to as the network device. The network device may also be an access network device or a module of an access network device in an open RAN (ORAN) system. The network device may be a module or unit capable of implementing some functions of a base station. For example, the network device may be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. Among them, in the ORAN system, the CU may also be called O-CU, the DU may also be called open (O)-DU, the CU-CP may also be called O-CU-CP, the CU-UP may also be called O-CUP-UP, and the RU may also be called O-RU.

[0208] In the embodiments of the present application, the terminal device is a device with wireless transceiver function, also known as user equipment (UE), mobile station (MS), mobile terminal (MT), etc., which refers to a device that provides voice and / or data connectivity to users, and also includes a device capable of sidelink communication, such as a vehicle-mounted terminal, or a handheld terminal capable of V2X communication, etc. It can be deployed on land, including indoors or outdoors, handheld, wearable or vehicle-mounted; it can also be deployed on the water (such as ships, etc.); it can also be deployed in the air (such as airplanes, balloons and satellites, etc.). The terminal device may be a mobile phone, a tablet computer, a computer with wireless transceiver function, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a vehicle-mounted terminal device, a wireless terminal in self-driving, a wireless terminal in remote medical, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, a wearable terminal device, an extended reality (XR) device, etc. The wearable terminal device may include, for example, a head mounted display (HMD) or a user device such as smart glasses (such as VR glasses, AR glasses).

[0209] The embodiments of the present application do not limit the application scenarios. Terminal equipment may also be sometimes referred to as terminal, user equipment (UE), access terminal equipment, vehicle-mounted terminal, industrial control terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal equipment, mobile equipment, UE agent or UE device, etc. Terminal equipment may also be fixed or mobile.

[0210] The network architecture and business scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. A person of ordinary skill in the art can appreciate that with the evolution of the network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems.

[0211] Before introducing the method of the present application in detail, some concepts involved in the present application are briefly introduced first.

[0212] 1. HARQ Retransmission Mechanism

[0213] The HARQ retransmission mechanism uses the stop-and-wait protocol to send data. After the sender sends a transport block (TB), it stops and waits for the acknowledgement information. The receiver can use 1-bit information to ACK or NACK the transport block. However, the sender stops and waits for the acknowledgement after each transmission, which results in low throughput. Therefore, multiple parallel HARQ processes can be used. When one HARQ process is waiting for the acknowledgement information, the sender can use another HARQ process to continue sending data. Similarly, when the receiver is processing the received information using one process, it can use another process to continue receiving information. Multiple HARQ processes are processed in parallel to form a HARQ entity. Each uplink or downlink carrier corresponds to a HARQ entity. 3GPP TS 38.214 defines that a HARQ entity supports a maximum of 16 HARQ processes.

[0214] In the downlink transmission direction, the base station can configure the maximum number of processes supported by the terminal device through the high-layer signaling parameter nrofHARQ-ProcessesForPDSCH according to the network deployment situation. The value range is {2, 4, 6, 10, 12, 16}. If the configuration parameter is empty, the default maximum number of HARQ processes for downlink transmission is 8. In the uplink transmission direction, the maximum number of HARQ processes supported by each carrier is always 16.

[0215] The sender needs to determine whether the transmission is successful according to the ACK / NACK feedback from the receiver. ACK (Acknowledgement) indicates that the transmission is successful, and NACK (Negative Acknowledgement) indicates that the transmission fails. In the case of transmission failure, retransmission is required. In NR, according to whether the retransmitted bit information is the same as the initial transmission, the soft combining scheme is divided into Chase Combining (CC) and Incremental Redundancy (IR). In Chase Combining, the retransmitted bit information is the same as the initial transmission. In Incremental Redundancy, the retransmitted bit information does not need to be the same as the initial transmission. For IR combining, the information bits and parity bits generated by the encoder are concatenated to form a sequence. Each RV defines the starting point of transmission in this sequence. The first transmission and each HARQ retransmission use different RVs to achieve the gradual accumulation of redundant bits and complete the incremental redundancy HARQ operation. For example Figure 2As shown, it is a schematic diagram of redundant versions RV0 to RV3 provided by an embodiment of the present application. Multiple retransmissions are usually performed in the order of RV0, RV2, RV3, and RV1. That is, when the TB is initially transmitted, the bits of RV0 are usually used for transmission to ensure the correctness of the initial transmission as much as possible; while in the case of retransmission, the bits of other RV versions are selected, so that different parity bits from RV0 can be sent, enabling the receiving

[0216] end to obtain as much information as possible after combining the information of the initial transmission and the retransmission, thereby increasing the retransmission efficiency.

[0217] 2. Transport Block (TB)

[0218] A transport block can be a data block from a higher layer. For example, a transport block can contain a data block of a media access control (MAC) protocol data unit (PDU). This data block can be transmitted in a time unit or can be the unit of HARQ retransmission.

[0219] 3. Superposition Transmission

[0220] The superposition transmission technology is a coding scheme of block Markov superposition transmission (BMST). The transmitting end divides the data block into multiple sub-blocks and encodes each sub-block using a Low Density Parity Check Code (LDPC) to obtain the encoded codeword corresponding to each sub-block. Further, the codeword corresponding to the previous sub-block is superimposed with the codeword corresponding to the current sub-block, and the superimposed codeword is used as the actual transmitted codeword sequence, thereby forming a sliding window-based chain superposition transmission. The superposition operation can be an exclusive OR operation on the corresponding bits. One of the two codewords for the superposition operation can be interleaved first and then the superposition operation is performed.

[0221] The following is an example of superposition transmission in combination with Figure 3 where u1, u2, u3, and u4 are information bit sequences in different sub-blocks. In Figure 3Taking the information bit sequences corresponding to 4 sub - blocks as an example in China, it can also include information bit sequences corresponding to more sub - blocks, and so on. The information bit sequence u1 is encoded according to LDPC to obtain the codeword sequence c1. Since it is the first codeword sequence, there is no need for superposition, and the corresponding transmitted v1 sequence is the c1 sequence; for the information bit sequence u2, it is also encoded according to LDPC to obtain the codeword sequence c2. After bit selection and interleaving of the previous codeword sequence c1, it is superimposed on the corresponding bits of the codeword sequence c2 to obtain the actually transmitted superimposed codeword sequence v2; and so on, u3 and u4 are processed in the same way to obtain the superimposed codeword sequences v3 and v4. According to the maximum superposition length, the corresponding superposition transmission threshold is determined. For example, if at most k information bit sequences are allowed to be superimposed and transmitted, then it can only go up to uk at most, and the actually transmitted superimposed codeword sequences are v1 to vk.

[0222] The receiving end decodes according to the sliding - window - based decoding algorithm. Considering joint decoding of multiple received sequences in the decoding window, taking the decoding window length equal to 2 as an example, as Figure 4 shown, the sliding window contains the soft - information sequences of two codewords y (t) and y (t+1) . In Figure 4 , the node LDPC represents the NR LDPC encoder - decoder. For the t - th codeword, by using the soft - information sequence y (t) and the soft - value extrinsic information z (t+1) in the superimposed - transmission codeword soft - information sequence y 1→0 as inputs, decoding is performed; and the corresponding soft - information z 0→1 is passed to the decoding process of the (t + 1) - th codeword; the (t + 1) - th codeword then uses the soft - information sequence y (t+1) and the soft - value extrinsic information z (t) in the superimposed - transmission codeword soft - information sequence y 0→1 as inputs to perform decoding; a hard decision is made on the corresponding codeword to finally obtain the corresponding true codeword c(t), and then the information bit sequence u(t) is obtained.

[0223] This decoding algorithm makes full use of the correlated soft information of the previous and subsequent codewords for information - passing decoding algorithm, which can improve the decoding performance. The superimposed codewords contain the soft information of the previous codeword, equivalently achieving the effect of re - transmission, and at the same time, it does not rely on feedback, reducing the delay.

[0224] The embodiments of the sequence processing method of the present application will be described below by way of examples. It should be noted that the various technical solutions (or various embodiments) of the present application can be implemented independently or can be combined based on certain internal connections. The present application does not make any restrictions. And various terms and definitions between the various embodiments can be referenced to each other. In each embodiment of the present application, different implementation manners can also be combined or implemented independently.

[0225] Please refer to Figure 5a , which is a schematic flowchart of a sequence processing method provided by an embodiment of the present application. Figure 1 It can be a system architecture diagram applicable to the sequence processing method. Figure 5a The present application embodiments do not limit the execution order of the steps of the sequence processing method shown. As Figure 5a shown, the sequence processing method of the embodiments of the present application includes but is not limited to the following steps. It can be understood that in some scenarios, it may include some of the following steps rather than all steps. The present application does not make any restrictions:

[0226] 501. The network device sends the first indication information. Correspondingly, the terminal device receives the first indication information.

[0227] Exemplarily, the first indication information can be used to indicate the transmission mechanism. For example, the first indication information can indicate the first transmission mechanism and / or the second transmission mechanism. Alternatively, the first transmission mechanism can be called the superposition transmission mechanism, and the second transmission mechanism can be called the HARQ retransmission mechanism.

[0228] The network device can select the corresponding transmission mechanism for different services. Exemplarily, for the transmission of low-latency service data, the first transmission mechanism is selected, and for the transmission of delay-unconstrained service data, the second transmission mechanism is selected. Low-latency services can include, for example, but are not limited to: XR services, real-time video transmission services, audio transmission services, etc. Delay-unconstrained services can include, for example, but are not limited to: mail transmission services, communication message transmission services, etc.

[0229] In a possible implementation manner, if the first indication information indicates the first state value, it indicates the first transmission mechanism, and if the first indication information indicates the second state value, it indicates the second transmission mechanism. For example, the first indication information occupies 1 bit. If the value of this 1 bit is 1, it means that the first indication information indicates the first state value. If the value of this 1 bit is 0, it means that the first indication information indicates the second state value. It can be understood that taking the first state value as 1 and the second state value as 0 as an example, it can also be that the first state value is 0 and the second state value is 1. The present application does not make any restrictions.

[0230] In a possible implementation, the first indication information may be carried in Downlink Control Information (DCI). Exemplarily, a field may be added to the DCI. The first indication information is carried in the newly added field. For example, the name of the newly added field is Superposed_Transmission_enable_Filed. When the value of this field is 0, it indicates that the superposition transmission mechanism is not adopted and the HARQ retransmission mechanism is adopted; when the value of this field is 1, it indicates that the superposition transmission mechanism is adopted. The value in the newly added field can be understood as the enable switch of the superposition transmission mechanism. Exemplarily, the first indication information may also be carried in an existing field in the DCI. For example, the transmission mechanism is indicated by reserved bits in the existing field.

[0231] In a possible implementation, the first indication information may be carried in a Radio Resource Control (RRC) message. Exemplarily, a field may be added to the RRC message. The first indication information is carried in the newly added field. For example, the name of the newly added field is Superposed_Transmission_enable_Filed. When the value of this field is 0, it indicates that the superposition transmission mechanism is not adopted and the HARQ retransmission mechanism is adopted; when the value of this field is 1, it indicates that the superposition transmission mechanism is adopted. Exemplarily, the first indication information may also be carried in an existing field in the RRC. For example, the transmission mechanism is indicated by reserved bits in the existing field.

[0232] In a possible implementation, the network device may indicate the transmission mechanism in an implicit manner. Exemplarily, when the network device schedules the transmission of a transport block (TB) or a codeblock (CB), if two HARQ processes are indicated, it indicates that the TB or CB adopts the first transmission mechanism, that is, the superposition transmission mechanism; if one HARQ process is indicated, it indicates that the TB or CB adopts the second transmission mechanism for transmission, that is, the HARQ retransmission mechanism. Here, the TB or CB adopting the first transmission mechanism means that the bit sequence corresponding to the TB or CB is superposed for transmission. For example, the bit sequence corresponding to the TB or CB may refer to the bit sequence after encoding of the TB or CB.

[0233] In a possible implementation, the first indication information may indicate the first transmission mechanism and the second transmission mechanism. For example, the first indication information may indicate one or more processes for the first transmission mechanism. Exemplarily, the first indication information may also indicate one or more processes for the second transmission mechanism. For specific reference, please refer to the relevant description in "The first transmission mechanism based on the transmission of one or more processes" in the subsequent embodiments, which will not be elaborated here.

[0234] 502, The terminal device obtains a first bit sequence and a second bit sequence.

[0235] The first bit sequence and the second bit sequence may be two of the multiple bit sequences to be transmitted by the terminal device.

[0236] In one implementation, one bit sequence may correspond to one TB, and the first bit sequence and the second bit sequence may respectively correspond to different TBs. For example, the first bit sequence corresponds to the first TB, and the second bit sequence corresponds to the second TB. Exemplarily, the first bit sequence corresponding to the first TB can be understood as the bit sequence after encoding the first TB, and the second bit sequence corresponding to the second TB can be understood as the bit sequence after encoding the second TB. In some implementations, the first bit sequence may also be the first TB, and the second bit sequence may be the second TB.

[0237] In another implementation, one bit sequence corresponds to one CB, and the first bit sequence and the second bit sequence may respectively correspond to different CBs. For example, the first bit sequence corresponds to the first CB, and the second bit sequence corresponds to the second CB. Exemplarily, the first bit sequence corresponding to the first CB can be understood as the bit sequence after encoding the first CB, and the second bit sequence corresponding to the second CB can be understood as the bit sequence after encoding the second CB. In some implementations, the first bit sequence may also be the first CB, and the second bit sequence may be the second CB. Exemplarily, the first CB and the second CB may be CBs in the same TB.

[0238] 503, When the first indication information indicates the first transmission mechanism, the terminal device outputs a third bit sequence. The third bit sequence is obtained by superimposing the first bit sequence and the second bit sequence. Correspondingly, the network device receives the third bit sequence.

[0239] When the first indication information sent by the network device indicates the first transmission mechanism (also known as the superposition transmission mechanism), the terminal device superimposes the first bit sequence and the second bit sequence to obtain a third bit sequence and outputs the third bit sequence. As an example, the first bit sequence, the second bit sequence, and the third bit sequence may each include N bits, where N is a positive integer, that is, the first bit sequence, the second bit sequence, and the third bit sequence contain the same number of bits. In this example, in the following superposition, the value of i is an integer greater than or equal to 1 and less than or equal to N. As another example, the number of bits contained in the first bit sequence, the second bit sequence, and the third bit sequence may also be different. For example, the first bit sequence includes K bits, the second bit sequence includes N bits, and the third bit sequence includes N bits. In this example, in the following superposition, the value of i is an integer greater than or equal to 1 and less than or equal to K. The following uses three possible implementation methods as examples to illustrate the superposition method of the first bit sequence and the second bit sequence:

[0240] The first possible implementation method is to superimpose the i-th bit in the first bit sequence and the i-th bit in the second bit sequence to obtain the i-th bit in the third bit sequence.

[0241] The second possible implementation method is to superimpose the i-th bit after the first bit sequence is interleaved and the i-th bit in the second bit sequence to obtain the i-th bit in the third bit sequence.

[0242] The third possible implementation method is to superimpose the i-th bit after the second bit sequence is interleaved and the i-th bit in the first bit sequence to obtain the i-th bit in the third bit sequence.

[0243] Exemplarily, in the above three possible implementation methods, bit superposition may be bitwise exclusive OR.

[0244] In some embodiments, the first bit sequence and the second bit sequence respectively correspond to different CBs. For example, the first bit sequence is the bit sequence corresponding to the first CB, and the second bit sequence is the bit sequence corresponding to the second CB. Exemplarily, the first bit sequence may be the bit sequence after the first CB is encoded, and the second bit sequence may be the bit sequence after the second CB is encoded. The first CB and the second CB are CBs within the same TB. Superimposing the first bit sequence and the second bit sequence can be understood as superimposing the bit sequences corresponding to different CBs within one TB. For example, as Figure 5bAs shown in the figure, it is a schematic diagram of the superposition between the bit sequences corresponding to CBs provided by an embodiment of the present application. Among them, CBn’ is the bit sequence after the nth superposition, n is an integer greater than 1, CB1’ is the bit sequence corresponding to CB1, CB2’ is obtained by superposing the bit sequence corresponding to CB1 and the bit sequence corresponding to CB2, CB3’ is obtained by superposing the bit sequence corresponding to CB2 and the bit sequence corresponding to CB3, and so on. The bit sequence corresponding to the nth CB is superposed with the bit sequence corresponding to the (n - 1)th CB to obtain the bit sequence CBn’ after the nth superposition, and the terminal device transmits the bit sequence CBn’ after the superposition. In Figure 5b , the bit sequence corresponding to CB can be understood as the bit sequence after CB coding. By superposing the bit sequences corresponding to CBs, the structure within the TB is changed, and the coupling relationship between CBs is introduced. For different TBs, differential superposition coding parameter design can be performed, and a unified superposition coding parameter can also be adopted for each TB.

[0245] In some embodiments, the first bit sequence and the second bit sequence respectively correspond to different TBs. For example, the first bit sequence is the bit sequence corresponding to the first TB, and the second bit sequence is the bit sequence corresponding to the second TB. Exemplarily, the first bit sequence can be the bit sequence after the first TB is coded, and the second bit sequence can be the bit sequence after the second TB is coded. Superposing the first bit sequence and the second bit sequence can be understood as superposing the bit sequences corresponding to different TBs. For example, as Figure 5c shown in the figure, it is a schematic diagram of the superposition between the bit sequences corresponding to TBs provided by an embodiment of the present application. Among them, TBn’ is the bit sequence after the nth superposition, n is an integer greater than 1, TB1’ is the bit sequence corresponding to TB1, TB2’ is obtained by superposing the bit sequence corresponding to TB1 and the bit sequence corresponding to TB2, TB3’ is obtained by superposing the bit sequence corresponding to TB2 and the bit sequence corresponding to TB3, and so on. The bit sequence corresponding to the ith TB is superposed with the bit sequence corresponding to the (i - 1)th TB to obtain the bit sequence TBn’ after the ith superposition, and the terminal device transmits the bit sequence TBn’ after the superposition. In Figure 5c it, the bit sequence corresponding to the TB can be understood as the bit sequence after the TB is coded. A unified superposition coding parameter can be adopted for the superposition between the bit sequences corresponding to each TB.

[0246] In some implementation manners, the network device may send second indication information to the terminal device, and the second indication information indicates that the first bit sequence and the second bit sequence correspond to TBs or CBs. Alternatively, the second indication information may indicate the superposition transmission between the bit sequences corresponding to different TBs or the superposition transmission between the bit sequences corresponding to different CBs. Exemplarily, the second indication information may be carried in a DCI or RRC message.

[0247] Exemplarily, when the second indication information indicates the first mode, the first bit sequence and the second bit sequence correspond to TBs, indicating superposed transmission between bit sequences corresponding to different TBs. When the second indication information indicates the second mode, the first bit sequence and the second bit sequence correspond to CBs, indicating superposed transmission between bit sequences corresponding to different CBs.

[0248] In some embodiments, the second indication information may be carried in a mode field. For example, a new mode field Superposed_Mode is added. This mode field can be used to indicate different modes. It can be understood that the name of this mode field is only for illustration. This mode field may include one or more bits, and the corresponding mode is indicated by the value of these one or more bits. For example, taking the mode field including 2 bits as an example, the 2 bits can indicate 4 modes. For instance, if the value of this mode field is 00, it indicates mode 1, and mode 1 indicates that the first bit sequence and the second bit sequence correspond to CBs, for superposed transmission between bit sequences corresponding to different CBs. If the value of this mode field is 01, it indicates mode 2, and mode 2 indicates that the first bit sequence and the second bit sequence correspond to TBs, for superposed transmission between bit sequences corresponding to different TBs. The values 10 and 11 of the mode field can be reserved modes for indicating other transmission mechanisms.

[0249] The bit sequence corresponding to the CB can be understood as the bit sequence after CB coding, and the bit sequence corresponding to the TB can be understood as the bit sequence after TB coding.

[0250] 504. The network device performs superposed decoding on the received third bit sequence based on the decoding result or decoded soft information of other superposed bit sequences to obtain the first bit sequence and the second bit sequence.

[0251] Among them, the other superposed bit sequences at least include the superposed bit sequence of the first bit sequence or the second bit sequence.

[0252] The superposed bit sequence of the first bit sequence or the second bit sequence can be understood that this superposed bit sequence is obtained by superposing based on the first bit sequence or the second bit sequence and other bit sequences. In this superposed bit sequence, it can be understood as the initial transmission of the first bit sequence or the second bit sequence. The network device can perform decoding on the third bit sequence by combining the decoding result or decoded soft information of other superposed bit sequences, which can equivalently achieve the effect of retransmission, thereby not relying on HARQ feedback, improving reliability and spectral efficiency, and meeting the requirements of low-latency services.

[0253] Due to channel effects, the third bit sequence received by the network device may be different from the third bit sequence sent by the terminal device. For ease of description, the same naming is used here. The network device performs superposition decoding on the received third bit sequence using a superposition decoding method corresponding to the superposition coding method of the terminal device, thereby recovering the first bit sequence and the second bit sequence.

[0254] As an example, the number of bits included in the first bit sequence, the second bit sequence, and the third bit sequence is the same. In this example, in the following decoding process, the value of i is an integer greater than or equal to 1 and less than or equal to N. As another example, the number of bits included in the first bit sequence, the second bit sequence, and the third bit sequence may also be different. For example, the first bit sequence includes K bits, the second bit sequence includes N bits, and the third bit sequence includes N bits. In this example, in the following decoding process, the value of i is an integer greater than or equal to 1 and less than or equal to K. The following uses three possible implementation methods to illustrate the decoding process:

[0255] The first possible implementation method is that the network device performs superposition decoding on the i-th bit in the third bit sequence according to the decoding results or decoded soft information of other superposition bit sequences, to obtain the i-th bit in the first bit sequence and the i-th bit in the second bit sequence.

[0256] The second possible implementation method is that the network device performs superposition decoding on the i-th bit in the third bit sequence according to the decoding results or decoded soft information of other superposition bit sequences, to obtain the i-th bit of the interleaved first bit sequence and the i-th bit in the second bit sequence, and further de-interleave the interleaved first bit sequence to obtain the first bit sequence.

[0257] The third possible implementation method is that the network device performs superposition decoding on the i-th bit in the third bit sequence according to the decoding results or decoded soft information of other superposition bit sequences, to obtain the i-th bit in the first bit sequence and the i-th bit of the interleaved second bit sequence, and further de-interleave the interleaved second bit sequence to obtain the second bit sequence.

[0258] The following uses an example to describe the first transmission mechanism based on the transmission of one or more processes:

[0259] In one implementation method, in step 503 above, the first transmission mechanism may be based on the transmission of one or more processes. For ease of description, the number of processes used for the first transmission mechanism is represented by M, and M is an integer greater than or equal to 1. The number of processes depends on the latency requirements of the service.

[0260] The number of processes M for the first transmission mechanism can be configured by the network device. For example, the network device can indicate the number of processes M for the first transmission mechanism through indication information. For example, the high-layer signaling parameter nrofHARQ-ProcessesForPDSCH can be reused to configure the number of processes M for the first transmission mechanism. Exemplarily, the value of M can be one of the following: 1, 2, 4, 6, 10, 12, 16.

[0261] When the first indication information indicates the first transmission mechanism, the terminal device can indicate that the first process outputs a third bit sequence. If M = 1, then this first process is one process for the first transmission mechanism. When M = 1, superposition can be performed between bit sequences corresponding to different CBs (for example Figure 5b as shown), or superposition can also be performed between bit sequences corresponding to different TBs (for example Figure 5c as shown).

[0262] If the value of M is greater than 1, that is, there are multiple processes for the first transmission mechanism, the first process can be any one of the M processes. It can be understood that each process outputs the bit sequence after superposition. The superposition method can refer to the process of obtaining the third bit sequence by superposing the first bit sequence and the second bit sequence, which will not be elaborated here. In some implementation manners, when the value of M is greater than 1, the index values of the first TB corresponding to the first bit sequence for superposition and the second TB corresponding to the second bit sequence can be discontinuous. For example, the bit sequence corresponding to TB1 and the bit sequence corresponding to TB3 are superposed to better combat consecutive errors. Among them, the bit sequence corresponding to the TB can be understood as the bit sequence after TB coding.

[0263] Correspondingly, for the network device that receives the third bit sequence, it can indicate that the first process performs superposition decoding on the received third bit sequence according to the decoding result or the decoded soft information of other superposed bit sequences to obtain the first bit sequence and the second bit sequence. The network device uses the process corresponding to the same process number as the terminal device to perform superposition decoding on the received third bit sequence.

[0264] Next, taking the case where there are multiple processes for the first transmission mechanism as an example, in Figure 5d as an example Figure 5dTaking the number of processes as 2 in the middle, and taking the superposition of bit sequences corresponding to different TBs as an example, the bit sequences corresponding to TBs can be understood as the bit sequences after TB coding. The bit sequences after superposition output by Process 1 are TB1’, TB2’, and TB3’ respectively. Among them, TB1’ is the bit sequence corresponding to TB1, TB2’ is obtained by superposing the bit sequence corresponding to TB1 and the bit sequence corresponding to TB3, and TB3’ is obtained by superposing the bit sequence corresponding to TB3 and the bit sequence corresponding to TB5, that is, TB1, TB3, and TB5 are scheduled to Process 1 for superposition transmission. The bit sequences after superposition output by Process 2 are TB1’, TB2’, and TB3’ respectively. Among them, TB1’ is the bit sequence corresponding to TB1, TB2’ is obtained by superposing the bit sequence corresponding to TB2 and the bit sequence corresponding to TB4, and TB3’ is obtained by superposing the bit sequence corresponding to TB4 and the bit sequence corresponding to TB6, that is, TB2, TB4, and TB6 are scheduled to Process 2 for superposition transmission. In Figure 5d In the middle, the index values of the TBs corresponding to the two bit sequences for superposition are not continuous, which can better resist continuous errors and improve the robustness of transmission.

[0265] In another implementation manner, the first transmission mechanism and the second transmission mechanism can reuse Q processes. M processes among the Q processes are used for the first transmission mechanism, and Z processes among the Q processes other than the M processes are used for the second transmission mechanism, where M is an integer less than or equal to Q and greater than or equal to 0, Q is an integer greater than 1, and Z is an integer less than or equal to Q and greater than or equal to 0.

[0266] Exemplarily, Z can be equal to Q - M, that is, all processes among the Q processes other than the M processes used for the first transmission mechanism are used for the second transmission mechanism (i.e., the HARQ retransmission mechanism). Z can also be less than Q - M, that is, some processes among the Q processes other than the M processes used for the first transmission mechanism are used for the second transmission mechanism, which is not limited in this application.

[0267] The following combines Figure 5e Taking the reuse of Q processes for the first transmission mechanism and the second transmission mechanism as an example, for example, Q = 2. One process (such as Process 2) among the 2 processes is used for the first transmission mechanism, and the other process (such as Process 1) is used for the second transmission mechanism (i.e., the HARQ retransmission mechanism). In Figure 5eTaking the superposition between bit sequences corresponding to different transport blocks (TBs) as an example, the bit sequence corresponding to a TB can be understood as the bit sequence after TB coding. For process 1, since the bit sequence is output based on the second transmission mechanism, process 1 is instructed to output the bit sequences corresponding to each TB in sequence, and there is no need to superpose the bit sequences corresponding to each TB. For process 2, since the bit sequence is output based on the first transmission mechanism, process 2 is instructed to output the superposed bit sequence TBn' in sequence, where TBn' is the nth superposed bit sequence, n is an integer greater than 1, TB1' is the bit sequence corresponding to TB1, TB2' is obtained by superposing the bit sequence corresponding to TB1 and the bit sequence corresponding to TB2, TB3' is obtained by superposing the bit sequence corresponding to TB2 and the bit sequence corresponding to TB3, and so on. The bit sequence corresponding to the ith TB is superposed with the bit sequence corresponding to the (i - 1)th TB to obtain the ith superposed bit sequence TBn', and what process 2 outputs is the superposed bit sequence TBn'.

[0268] If M = Q, the number of processes for the second transmission mechanism is 0, that is, all Q processes are used for the first transmission mechanism. If Z = Q, the number of processes for the first transmission mechanism is 0, that is, all Q processes are used for the second transmission process.

[0269] Exemplarily, the above Q processes can be processes that multiplex the second transmission mechanism (i.e., the HARQ retransmission mechanism), that is, a part of the Q processes of the second transmission mechanism are used for the first transmission mechanism and a part of the processes are used for the second transmission mechanism.

[0270] In some embodiments, the network device may indicate which of the Q processes are used for the first transmission mechanism, that is, the network device may indicate the M processes used for the first transmission mechanism. For example, if the first indication information in step 501 indicates the M processes used for the first transmission mechanism, then in step 504, when the first indication information indicates that the first process is a process used for the first transmission mechanism, that is, the first process is one of the M processes, the terminal device instructs the first process to output the third bit sequence.

[0271] Exemplarily, the first indication information may further indicate the Z processes for the second transmission mechanism. Here, Z = Q - M is taken as an example. Exemplarily, the first indication information may indicate the transmission mechanisms corresponding to Q processes through a bitmap. For example, the first indication information indicates, through Q bits, the transmission mechanism used by each of the Q processes. One of the Q bits corresponds to one process. If the value of a bit is 1, it indicates that the process corresponding to the bit uses the first transmission mechanism. If the value of a bit is 0, it indicates that the process corresponding to the bit uses the second transmission mechanism. It can be understood that using a bit value of 1 to indicate the first transmission mechanism and a bit value of 0 to indicate the second transmission mechanism is only an example.

[0272] In this implementation manner, the first indication information may indicate the M processes for the first transmission mechanism and the Z processes for the second transmission mechanism, so as to implement that the first indication information can indicate both the first transmission mechanism and the second transmission mechanism at the same time. The terminal device may output a bit sequence based on the first transmission mechanism in the indicated M processes, and the terminal device may output a bit sequence based on the second transmission mechanism in the indicated Z processes. Among them, outputting a bit sequence based on the second transmission mechanism can be understood as using the HARQ retransmission mechanism for transmission.

[0273] Please refer to Figure 6 , which is a schematic flowchart of another sequence processing method provided by an embodiment of the present application. Figure 1 It may be a system architecture diagram applicable to the sequence processing method. Figure 6 The execution order of each step of the sequence processing method shown is not limited in the embodiments of the present application. As Figure 6 shown, the sequence processing method of the embodiments of the present application includes but is not limited to the following steps. It can be understood that in some scenarios, it may include some of the following steps rather than all steps, and the present application does not make a limitation:

[0274] 601. The network device sends the first indication information. Correspondingly, the terminal device receives the first indication information.

[0275] 602. The terminal device obtains a first bit sequence and a second bit sequence.

[0276] 603. When the first indication information indicates the first transmission mechanism, the terminal device outputs a third bit sequence. The third bit sequence is obtained by superimposing the first bit sequence and the second bit sequence. Correspondingly, the network device receives the third bit sequence.

[0277] 604. The network device performs superimposed decoding on the received third bit sequence according to the decoding result or decoded soft information of other superimposed bit sequences to obtain the first bit sequence and the second bit sequence.

[0278] For steps 601 - 604 in the embodiments of this application, please refer to Figure 5a the descriptions of steps 501 - 504 in the embodiments, which will not be elaborated here.

[0279] 605. When the first indication information indicates the second transmission mechanism, the terminal device outputs the first bit sequence or the second bit sequence. Correspondingly, the network device receives the first bit sequence or the second bit sequence.

[0280] If the first indication information indicates the second transmission mechanism (i.e., the HARQ retransmission mechanism), the terminal device outputs one of the first bit sequence and the second bit sequence, and the output bit sequence can refer to the bit sequence not transmitted by the terminal device. That is, when the first indication information indicates the second transmission mechanism, there is no need to perform bit sequence superposition.

[0281] Exemplarily, if the first bit sequence and the second bit sequence are bit sequences corresponding to different CBs respectively, the terminal device can output the bit sequence corresponding to the CB with a larger CB index value. For example, as Figure 5b shown, if the first bit sequence is the bit sequence corresponding to CB1 and the second bit sequence is the bit sequence corresponding to CB2, since the bit sequence corresponding to CB1 has been transmitted, the bit sequence corresponding to CB2 with a larger CB index value can be output.

[0282] Exemplarily, if the first bit sequence and the second bit sequence are bit sequences corresponding to different TBs respectively, the terminal device outputs the bit sequence corresponding to the TB with a larger TB index value. For example, as Figure 5c shown, if the first bit sequence is the bit sequence corresponding to TB1 and the second bit sequence is the bit sequence corresponding to TB2, since the bit sequence corresponding to TB1 has been transmitted, the bit sequence corresponding to TB2 with a larger TB index value can be output.

[0283] 606. The network device outputs the received first bit sequence or second bit sequence.

[0284] When using the second transmission mechanism (i.e., the HARQ retransmission mechanism), the network device can perform non - superposition decoding, output the received first bit sequence or second bit sequence, and determine to transmit ACK or NACK to the terminal device. Due to the influence of the channel, there may be a difference between the bit sequence sent by the terminal device and the bit sequence received by the network device. For the convenience of description in this application, they are named with the same name.

[0285] Please refer to Figure 7 , which is a schematic flowchart of another sequence processing method provided by the embodiments of this application. Figure 1 It can be a system architecture diagram applicable to this sequence processing method. Figure 7The execution order of each step of the sequence processing method shown is not limited in the embodiments of the present application. As Figure 7 shown, the sequence processing method of the embodiments of the present application includes but is not limited to the following steps. It can be understood that in some scenarios, it may include some of the following steps rather than all steps, and the present application does not make a limitation:

[0286] 701. The network device sends the fourth indication information. Correspondingly, the terminal device receives the fourth indication information.

[0287] The fourth indication information in step 701 of the embodiments of the present application may refer to Figure 5a the description of the first indication information in step 501 of the embodiments, which will not be elaborated here.

[0288] 702. The network device obtains the fourth bit sequence and the fifth bit sequence.

[0289] The fourth bit sequence and the fifth bit sequence may be two bit sequences among multiple bit sequences to be transmitted by the network device. One bit sequence may correspond to one TB or one bit sequence may correspond to one CB. For the relevant description of the fourth bit sequence and the fifth bit sequence, please refer to Figure 5a the description of the first bit sequence and the second bit sequence in step 502 of the embodiments, which will not be elaborated here.

[0290] 703. When the fourth indication information indicates the first transmission mechanism, the network device outputs the sixth bit sequence. The sixth bit sequence is obtained by superimposing the fourth bit sequence and the fifth bit sequence. Correspondingly, the terminal device receives the sixth bit sequence.

[0291] When the network device determines to adopt the first transmission mechanism, for example, the fourth indication information indicates the first transmission mechanism, the network device may superimpose the fourth bit sequence and the fifth bit sequence to obtain the sixth bit sequence and output the sixth bit sequence. As an example, the fourth bit sequence, the fifth bit sequence, and the sixth bit sequence may each include W bits, where W is a positive integer, that is, the fourth bit sequence, the fifth bit sequence, and the sixth bit sequence contain the same number of bits. As another example, the number of bits contained in the fourth bit sequence, the fifth bit sequence, and the sixth bit sequence may also be different. For example, the fourth bit sequence includes K bits, the fifth bit sequence includes N bits, and the sixth bit sequence includes N bits. The superimposing method of the fourth bit sequence and the fifth bit sequence may refer to Figure 5a the superimposing of the first bit sequence and the second bit sequence in step 503 of the embodiments, which will not be elaborated here.

[0292] In some implementations, the network device may also send fifth indication information to the terminal device. The fifth indication information indicates that the fourth bit sequence and the fifth bit sequence correspond to a transport block (TB) or a codeblock (CB). Alternatively, the fifth indication information may indicate the superposition transmission between bit sequences corresponding to different TBs or the superposition transmission between bit sequences corresponding to different CBs. Herein, the bit sequence corresponding to a TB may be understood as the bit sequence after TB coding, and the bit sequence corresponding to a CB may be understood as the bit sequence after CB coding.

[0293] Exemplarily, when the fifth indication information indicates the first mode, the fourth bit sequence and the fifth bit sequence correspond to TBs, indicating the superposition transmission between bit sequences corresponding to different TBs. When the fifth indication information indicates the second mode, the fourth bit sequence and the fifth bit sequence correspond to CBs, indicating the superposition transmission between bit sequences corresponding to different CBs.

[0294] In some embodiments, the fifth indication information may be carried in a mode field. For the specific manner, reference may be made to Figure 5a the manner of carrying the second indication information in step 503 in

[0295] 704. When the fourth indication information indicates the first transmission mechanism, the terminal device performs superposition decoding on the received sixth bit sequence according to the decoding result or the decoded soft information of other superposed bit sequences to obtain the fourth bit sequence and the fifth bit sequence.

[0296] Herein, other superposed bit sequences include at least the superposed bit sequences of the fourth bit sequence or the fifth bit sequence.

[0297] The superposed bit sequence of the fourth bit sequence or the fifth bit sequence may be understood as that the superposed bit sequence is obtained by superposing the fourth bit sequence or the fifth bit sequence and other bit sequences. In the superposed bit sequence, it may be understood as the initial transmission of the fourth bit sequence or the fifth bit sequence. The network device may decode the sixth bit sequence in combination with the decoding result of other superposed bit sequences, or decode the sixth bit sequence in combination with the decoded soft information of other superposed bit sequences, which can equivalently achieve the effect of retransmission, thereby not relying on HARQ feedback, improving reliability and spectrum efficiency, and meeting the requirements of low-latency services.

[0298] The terminal device receives the fourth indication information sent by the network device indicating the first transmission mechanism. Therefore, the terminal device needs to perform superposition decoding on the received sixth bit sequence to recover the fourth bit sequence and the fifth bit sequence. For the specific superposition decoding manner, reference may be made to Figure 5a the description of step 504 in

[0299] In Figure 7In the illustrated embodiment, the first transmission mechanism may also be based on one or more processes for transmission:

[0300] In one implementation, in step 703 above, the first transmission mechanism may be based on one or more processes for transmission. For ease of description, the number of processes used for the first transmission mechanism is represented by R, where R is an integer greater than or equal to 1. The number of processes depends on the latency requirements of the service.

[0301] The number of processes R used for the first transmission mechanism may be configured by the network device. For example, the network device may indicate the number of processes R used for the first transmission mechanism through indication information. For example, the high-layer signaling parameter nrofHARQ-ProcessesForPDSCH may be reused to configure the number of processes R used for the first transmission mechanism. Exemplarily, the value of R may be one of the following: 1, 2, 4, 6, 10, 12, 16.

[0302] When the network device determines to use the first transmission mechanism, the network device may instruct the second process to output the sixth bit sequence. If R = 1, then this second process is the one process used for the first transmission mechanism. In the case of R = 1, superposition may be performed between bit sequences corresponding to different CBs (as shown, for example Figure 5b ), or superposition may also be performed between bit sequences corresponding to different TBs (as shown, for example Figure 5c ). If the value of R is greater than 1, that is, there are multiple processes used for the first transmission mechanism, the second process may be any one of the R processes. It can be understood that each process outputs the superposed bit sequence. In some implementations, when the value of R is greater than 1, the index values of the TBs corresponding to the fourth bit sequence for superposition and the index values of the TBs corresponding to the fifth bit sequence may not be consecutive. For example, the bit sequence corresponding to TB1 and the bit sequence corresponding to TB3 are superposed to better combat consecutive errors.

[0303] Correspondingly, for the terminal device receiving the sixth bit sequence, it may be instructed that the second process performs superposition decoding on the received sixth bit sequence according to the decoding results or decoded soft information of other superposed bit sequences to obtain the fourth bit sequence and the fifth bit sequence. The terminal device uses the process corresponding to the same process number as the network device to perform superposition decoding on the received sixth bit sequence.

[0304] In another implementation, the first transmission mechanism and the second transmission mechanism may reuse P processes. R of the P processes are used for the first transmission mechanism, and Y processes among the P processes other than the R processes are used for the second transmission mechanism, where R is an integer less than or equal to P and greater than or equal to 0, P is an integer greater than 1, and Y is an integer less than or equal to P and greater than or equal to 0.

[0305] Exemplarily, Y may be equal to P - R, that is, all processes among the P processes except for the R processes used for the first transmission mechanism are used for the second transmission mechanism (i.e., the HARQ retransmission mechanism). Y may also be less than P - R, which is not limited in this application.

[0306] Exemplarily, the above P processes may be processes that multiplex the second transmission mechanism (i.e., the HARQ retransmission mechanism), that is, a part of the P processes of the second transmission mechanism is used for the first transmission mechanism, and a part of the processes is used for the second transmission mechanism.

[0307] In some embodiments, the network device may indicate which processes among the P processes are used for the first transmission mechanism through the fourth indication information, that is, the network device may indicate the R processes used for the first transmission mechanism through the fourth indication information. Exemplarily, the fourth indication information may also indicate the Y processes used for the second transmission mechanism. For the specific indication method, please refer to the relevant description in the foregoing embodiments and will not be elaborated here.

[0308] Please refer to Figure 8 , which is a schematic flowchart of another sequence processing method provided by the embodiments of this application. Figure 1 It may be a system architecture diagram applicable to the sequence processing method. Figure 8 The execution order of each step of the sequence processing method shown is not limited in the embodiments of this application. As Figure 8 shown, the sequence processing method of the embodiments of this application includes but is not limited to the following steps. It can be understood that in some scenarios, it may include some of the following steps rather than all steps, which is not limited in this application:

[0309] 801. The network device sends the fourth indication information. Correspondingly, the terminal device receives the fourth indication information.

[0310] 802. The network device obtains the fourth bit sequence and the fifth bit sequence.

[0311] 803. When the fourth indication information indicates the first transmission mechanism, the network device outputs the sixth bit sequence. The sixth bit sequence is obtained by superimposing the fourth bit sequence and the fifth bit sequence. Correspondingly, the terminal device receives the sixth bit sequence.

[0312] 804. When the fourth indication information indicates the first transmission mechanism, the terminal device performs superimposed decoding on the received sixth bit sequence according to the decoding result or decoded soft information of other superimposed bit sequences to obtain the fourth bit sequence and the fifth bit sequence.

[0313] For steps 801 - step 804 of the embodiments of this application, please refer to Figure 7 the description of steps 701 - step 704 in the embodiments and will not be elaborated here.

[0314] 805. When the fourth indication information indicates the second transmission mechanism, the network device outputs the fourth bit sequence or the fifth bit sequence.

[0315] If the network device determines to use the second transmission mechanism for transmission and sends the fourth indication information to the terminal device to indicate the second transmission mechanism (i.e., the HARQ retransmission mechanism), the network device outputs one of the fourth bit sequence and the fifth bit sequence. That is, when the fourth indication information indicates the second transmission mechanism, there is no need to perform bit sequence superposition. For details, reference can be made to Figure 6 the relevant description of step 605 in the embodiment, which will not be elaborated here.

[0316] 806. When the fourth indication information indicates the second transmission mechanism, the terminal device outputs the received fourth bit sequence or the fifth bit sequence.

[0317] When the fourth indication information received by the terminal device indicates the second transmission mechanism (i.e., the HARQ retransmission mechanism), the terminal device can perform non-superposition decoding on the received bit sequence, output the received fourth bit sequence or the fifth bit sequence, and determine to transmit ACK or NACK to the terminal device. Due to the influence of the channel, there may be differences between the bit sequence sent by the terminal device and the bit sequence received by the network device. For the convenience of description in this application, the same name is used for naming.

[0318] The communication device provided in the embodiment of the present application will be introduced below.

[0319] The present application divides the communication device into functional modules according to the above method embodiments. For example, each functional module can be corresponding to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of a software functional module. It should be noted that the division of modules in the present application is illustrative, only a logical function division, and there may be other division methods in actual implementation. The following will be combined with Figures 9 to 11 to describe the communication device in the embodiment of the present application in detail.

[0320] Figure 9 is a schematic structural diagram of a communication device provided in the embodiment of the present application. As Figure 9 shown, the communication device 1000 can correspondingly implement the functions or steps implemented by the network device or the terminal device in the above respective method embodiments.

[0321] In some possible embodiments, the communication device 1000 can correspondingly implement the behaviors and functions of the terminal device in the above method embodiments. For example, the communication device 1000 can be a terminal device, or a component applied to the terminal device (such as a chip or a circuit). The transceiver unit 1100 can be used, for example, to perform all the receiving or sending operations performed by the terminal device in the above method embodiments. The processing unit 1200 is used to perform all operations other than the transceiver operations performed by the terminal device.

[0322] In a possible design, the communication device 1000 includes: a processing unit 1200 and a transceiver unit 1100.

[0323] The transceiver unit 1100 is configured to receive first indication information;

[0324] The processing unit 1200 is configured to obtain a first bit sequence and a second bit sequence; when the first indication information indicates a first transmission mechanism, output a third bit sequence; the third bit sequence is obtained by superimposing the first bit sequence and the second bit sequence.

[0325] Exemplarily, the first bit sequence, the second bit sequence, and the third bit sequence each include N bits, or the first bit sequence includes K bits, the second bit sequence and the third bit sequence include N bits, where K and N are positive integers, and K is less than N;

[0326] The third bit sequence is obtained by superimposing the first bit sequence and the second bit sequence, including:

[0327] The i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence and the i-th bit in the second bit sequence; or,

[0328] The i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence after interleaving and the i-th bit in the second bit sequence; or,

[0329] The i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence and the i-th bit in the second bit sequence after interleaving;

[0330] The i is an integer greater than or equal to 1 and less than or equal to N or K.

[0331] Exemplarily, the transceiver unit 1100 is further configured to output the first bit sequence or the second bit sequence when the first indication information indicates a second transmission mechanism.

[0332] Exemplarily, the first bit sequence corresponds to a first transport block TB, and the second bit sequence corresponds to a second TB; or,

[0333] the first bit sequence corresponds to a first coded block CB, and the second bit sequence corresponds to a second CB.

[0334] Exemplarily, the first CB and the second CB are CBs in the same TB.

[0335] Exemplarily, the transceiver unit 1100 is further configured to receive second indication information, and the second indication information indicates that the first bit sequence and the second bit sequence correspond to a TB or a CB.

[0336] Exemplarily, when the second indication information indicates a first mode, the first bit sequence and the second bit sequence correspond to a TB;

[0337] when the second indication information indicates a second mode, the first bit sequence and the second bit sequence correspond to a CB.

[0338] Exemplarily, the transceiver unit 1100 is specifically configured to, when the first indication information indicates a first transmission mechanism, instruct a first process to output a third bit sequence, where the first process is one of M processes, and M is an integer greater than or equal to 1.

[0339] Exemplarily, the M processes are processes for the first transmission mechanism among Q processes, M is an integer less than or equal to Q and greater than or equal to 0, and Q is an integer greater than 1;

[0340] Z processes among the Q processes other than the M processes are processes for a second transmission mechanism, and Z is an integer less than or equal to Q and greater than or equal to 0.

[0341] Exemplarily, the first indication information indicates the M processes for the first transmission mechanism; the transceiver unit 1100 is specifically configured to, when the first indication information indicates that the first process is for the first transmission mechanism, instruct the first process to output a third bit sequence.

[0342] Exemplarily, the first indication information further indicates the Z processes for the second transmission mechanism.

[0343] Exemplarily, when the value of M is greater than 1, the index values of the first TB corresponding to the first bit sequence and the second TB corresponding to the second bit sequence are not consecutive.

[0344] Figure 9For the specific description and beneficial effects of the device embodiments shown, reference may be made to the description of the foregoing method embodiments, which will not be elaborated herein.

[0345] Multiplexing Figure 9 , the communication device 1000 can correspondingly implement the behaviors and functions of the network device in the foregoing method embodiments. For example, the communication device 1000 can be a network device or a component (such as a chip or a circuit) applied to the network device. The transceiver unit 1100 can be used, for example, to perform all the receiving or sending operations performed by the network device in the foregoing method embodiments. The processing unit 1200 is used to perform all the operations performed by the network device except for the transceiver operations.

[0346] In a possible design, the transceiver unit 1100 is used to send the fourth indication information;

[0347] The processing unit 1200 is used to obtain the fourth bit sequence and the fifth bit sequence; when the fourth indication information indicates the first transmission mechanism, output the sixth bit sequence; the sixth bit sequence is obtained by superimposing the fourth bit sequence and the fifth bit sequence.

[0348] Exemplarily, the fourth bit sequence, the fifth bit sequence, and the sixth bit sequence each include W bits, or the fourth bit sequence includes K bits, and the fifth bit sequence and the sixth bit sequence include W bits, where W and K are positive integers, and K is less than W;

[0349] The sixth bit sequence is obtained by superimposing the fourth bit sequence and the fifth bit sequence, including:

[0350] The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit in the fourth bit sequence and the i-th bit in the fifth bit sequence; or,

[0351] The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit in the fourth bit sequence after interleaving and the i-th bit in the fifth bit sequence; or,

[0352] The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit in the fourth bit sequence and the i-th bit in the fifth bit sequence after interleaving;

[0353] The i is an integer greater than or equal to 1 and less than or equal to W or K.

[0354] Exemplarily, the transceiver unit 1100 is further used to output the fourth bit sequence or the fifth bit sequence when the fourth indication information indicates the second transmission mechanism.

[0355] Exemplarily, the fourth bit sequence corresponds to the third transport block TB, and the fifth bit sequence corresponds to the fourth TB; or,

[0356] the fourth bit sequence corresponds to the third coded block CB, and the fifth bit sequence corresponds to the fourth CB.

[0357] Exemplarily, the third CB and the fourth CB are the CBs in the same TB.

[0358] Exemplarily, the transceiver unit 1100 is further configured to send fifth indication information, and the fifth indication information indicates that the fourth bit sequence and the fifth bit sequence correspond to a TB or a CB.

[0359] Exemplarily, when the fifth indication information indicates the first mode, the fourth bit sequence and the fifth bit sequence correspond to a TB;

[0360] when the fifth indication information indicates the second mode, the fourth bit sequence and the fifth bit sequence correspond to a CB.

[0361] Exemplarily, when the fourth indication information indicates the first transmission mechanism, the transceiver unit 1100 is specifically configured to, when the fourth indication information indicates the first transmission mechanism, instruct the second process to output a sixth bit sequence, where the second process is one of the R processes, and R is an integer greater than or equal to 1.

[0362] Exemplarily, the R processes are the processes for the first transmission mechanism among the P processes, R is an integer less than or equal to P and greater than or equal to 0, and P is an integer greater than 1;

[0363] the Y processes other than the R processes among the P processes are the processes for the second transmission mechanism, and Y is an integer less than or equal to P and greater than or equal to 0.

[0364] Exemplarily, the fourth indication information indicates the R processes for the first transmission mechanism;

[0365] The transceiver unit 1100 is specifically configured to, when the fourth indication information indicates that the second process is for the first transmission mechanism, instruct the second process to output a sixth bit sequence.

[0366] Exemplarily, the fourth indication information further indicates the Y processes for the second transmission mechanism.

[0367] Exemplarily, when the value of R is greater than 1, the index value of the third TB corresponding to the fourth bit sequence and the index value of the fourth TB corresponding to the fifth bit sequence are not continuous.

[0368] Figure 9 For the specific description and beneficial effects of the device embodiments shown, reference may be made to the description of the foregoing method embodiments, which will not be elaborated herein.

[0369] The terminal device and network device of the embodiments of the present application are introduced above. The following introduces the possible product forms of the terminal device and the network device. It should be understood that any product form that has the functions of the foregoing Figure 9 terminal device, or any product form that has the functions of the foregoing Figure 9 network device falls within the protection scope of the embodiments of the present application. It should also be understood that the following introduction is only for example and does not limit the product forms of the network device and terminal device of the embodiments of the present application to this.

[0370] In a possible implementation manner, Figure 9 In the communication device shown, the processing unit 1200 may be one or more processors, and the transceiver unit 1100 may be a transceiver, or the transceiver unit 1100 may also be a sending unit and a receiving unit. The sending unit may be a transmitter, and the receiving unit may be a receiver. The sending unit and the receiving unit are integrated in a device, such as a transceiver. In the embodiments of the present application, the processor and the transceiver may be coupled, etc. The connection manner of the processor and the transceiver is not limited in the embodiments of the present application.

[0371] Figure 10 FIG. 2000 is a schematic structural diagram of another communication device provided by an embodiment of the present application. Figure 10 The communication device in

[0372] may be the above-mentioned terminal device or the above-mentioned network device. Figure 10 As

[0373] shown, the communication device 2000 includes one or more processors 2200 and a transceiver 2100. The transceiver 2100 can implement the functions of the transceiver unit 1100, and the processor 2200 can implement the functions of the processing unit 1200.

[0373] In Figure 10 each implementation manner of the communication device shown, the transceiver may include a receiver and a transmitter. The receiver is used to perform the receiving function (or operation), and the transmitter is used to perform the transmitting function (or operation). And the transceiver is used to communicate with other devices / devices through a transmission medium.

[0374] Optionally, the communication device 2000 may further include one or more memories 2300 for storing program instructions and / or data. The memory 2300 is coupled to the processor 2200. The coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, units or modules, which may be electrical, mechanical or other forms for information interaction between devices, units or modules. The processor 2200 may cooperate with the memory 2300. The processor 2200 may execute the program instructions stored in the memory 2300.

[0375] In the embodiments of the present application, the specific connection medium between the transceiver 2100, the processor 2200 and the memory 2300 is not limited. In the embodiments of the present application Figure 10 it is shown that the transceiver 2100, the processor 2200 and the memory 2300 are connected through a bus 2400. The bus is represented by a thick line in Figure 10 The connection manners between other components are only for illustrative purposes and are not to be construed as limiting. The bus may be divided into an address bus, a data bus, a control bus, etc. For the sake of simplicity of representation, Figure 10 only one thick line is used to represent it in

[0376] In the embodiments of the present application, the processor may be a general-purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., which can implement or execute the various methods, steps and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the method disclosed in combination with the embodiments of the present application may be directly embodied as being executed by a hardware processor, or executed by a combination of hardware and software modules in the processor, etc.

[0377] In the embodiments of the present application, the memory may include, but is not limited to, non-volatile memories such as hard disk drives (HDDs) or solid-state drives (SSDs), random access memories (RAMs), erasable programmable read-only memories (EPROMs), read-only memories (ROMs), or compact disc read-only memories (CD-ROMs), etc. The memory is any storage medium that can be used to carry or store program code in the form of instructions or data structures and can be read and / or written by a computer (such as the communication device shown in the present application), but is not limited thereto. The memory in the embodiments of the present application may also be a circuit or any other device capable of implementing a storage function, for storing program instructions and / or data.

[0378] The processor 2200 is mainly used for processing communication protocols and communication data, and controlling the entire communication device, executing software programs, and processing the data of software programs. The memory 2300 is mainly used for storing software programs and data. The transceiver 2100 may include a control circuit and an antenna. The control circuit is mainly used for converting baseband signals into radio frequency signals and processing radio frequency signals. The antenna is mainly used for transmitting and receiving radio frequency signals in the form of electromagnetic waves. Input / output devices, such as touchscreens, displays, keyboards, etc., are mainly used for receiving data input by users and outputting data to users.

[0379] After the communication device is powered on, the processor 2200 can read the software program in the memory 2300, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be wirelessly transmitted, the processor 2200 performs baseband processing on the data to be transmitted and then outputs a baseband signal to the radio frequency circuit. The radio frequency circuit performs radio frequency processing on the baseband signal and then transmits the radio frequency signal in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor 2200. The processor 2200 converts the baseband signal into data and processes the data.

[0380] In another implementation, the radio frequency circuit and the antenna may be provided independently of the processor performing baseband processing. For example, in a distributed scenario, the radio frequency circuit and the antenna may be independent of the communication device and arranged in a remote manner.

[0381] It can be understood that the communication device shown in the embodiments of the present application may also have more Figure 10More components, etc., are not limited in the embodiments of the present application. The methods executed by the above-mentioned processor and transceiver are only examples. For the specific steps executed by the processor and transceiver, reference may be made to the methods introduced above.

[0382] In another possible implementation, Figure 9 In the communication device shown, the processing unit 1200 may be one or more logic circuits, and the transceiver unit 1100 may be an input / output interface, also referred to as a communication interface, or an interface circuit, or an interface, etc. Or the transceiver unit 1100 may also be a sending unit and a receiving unit. The sending unit may be an output interface, and the receiving unit may be an input interface. The sending unit and the receiving unit are integrated into one unit, such as an input / output interface. As Figure 11 shown, Figure 11 the communication device shown includes a logic circuit 3001 and an interface 3002. That is, the above-mentioned processing unit 1200 may be implemented by the logic circuit 3001, and the transceiver unit 1100 may be implemented by the interface 3002. Among them, the logic circuit 3001 may be a chip, a processing circuit, an integrated circuit, or a system on chip (SoC) chip, etc., and the interface 3002 may be a communication interface, an input / output interface, a pin, etc. Exemplarily, Figure 11 is shown with the above-mentioned communication device as a chip. The chip includes a logic circuit 3001 and an interface 3002.

[0383] In the embodiments of the present application, the logic circuit and the interface may also be coupled to each other. For the specific connection manner between the logic circuit and the interface, the embodiments of the present application do not make any limitations.

[0384] It can be understood that the communication device shown in the embodiments of the present application may implement the method provided in the embodiments of the present application in the form of hardware, or may also implement the method provided in the embodiments of the present application in the form of software, etc. The embodiments of the present application do not make any limitations in this regard.

[0385] The embodiments of the present application further provide a wireless communication system, which includes a network device and a terminal device. The network device and the terminal device may be used to execute the methods in any of the foregoing embodiments.

[0386] In addition, the present application further provides a computer-readable storage medium, in which computer code is stored. When the computer code runs on a computer, the computer is caused to execute the operations and / or processes executed by the network device and the terminal device in the method provided by the present application.

[0387] The present application also provides a computer program product, which includes computer code or a computer program. When the computer code or the computer program runs on a computer, the operations and / or processes performed by the network device and the terminal device in the method provided by the present application are executed.

[0388] In several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed coupling or direct coupling or communication connection between each other can be an indirect coupling or communication connection through some interfaces, devices, or units, or can also be in the form of electrical, mechanical, or other connections.

[0389] The units described as separate components may or may not be physically separated. The components displayed as units may or may not be physical units, that is, they can be located in one place, or can also be distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the technical effects of the solutions provided by the embodiments of the present application.

[0390] In addition, each functional unit in various embodiments of the present application can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

[0391] If the above-mentioned integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present application, in essence, or the part that makes a contribution, or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a readable storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present application. The foregoing readable storage medium includes: various media such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disc that can store program codes.

[0392] As described above, it is only the specific implementation manner of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art within the technical scope disclosed by the present application can easily think of changes or substitutions, which should all be covered within the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims described above.

Claims

1. A sequence processing method, characterized in that, including: receiving first indication information; obtaining a first bit sequence and a second bit sequence; when the first indication information indicates a first transmission mechanism, outputting a third bit sequence; the third bit sequence is obtained by superimposing the first bit sequence and the second bit sequence.

2. The method according to claim 1, wherein The first bit sequence, the second bit sequence, and the third bit sequence each include N bits, or the first bit sequence includes K bits, the second bit sequence and the third bit sequence include N bits, where N and K are positive integers and K is less than N; The third bit sequence is obtained by superimposing the first bit sequence and the second bit sequence, including: the i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence and the i-th bit in the second bit sequence; or the i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence after interleaving and the i-th bit in the second bit sequence; or the i-th bit in the third bit sequence is obtained by superimposing the i-th bit in the first bit sequence and the i-th bit in the second bit sequence after interleaving; i is an integer greater than or equal to 1 and less than or equal to N or K.

3. The method according to claim 1 or 2, characterized in that The method further includes: when the first indication information indicates a second transmission mechanism, outputting the first bit sequence or the second bit sequence.

4. The method according to claim 1 or 2, characterized in that, The first bit sequence corresponds to a first TB, and the second bit sequence corresponds to a second TB; or The first bit sequence corresponds to a first CB, and the second bit sequence corresponds to a second CB.

5. The method according to claim 4, wherein the first CB and the second CB are CBs in the same TB.

6. The method according to claim 4 or 5, characterized in that, The method further includes: receiving second indication information, where the second indication information indicates that the first bit sequence and the second bit sequence correspond to a TB or a CB.

7. The method according to claim 6, wherein when the second indication information indicates a first mode, the first bit sequence and the second bit sequence correspond to a TB; when the second indication information indicates a second mode, the first bit sequence and the second bit sequence correspond to a CB.

8. The method according to any one of claims 1-7, characterized in that, The outputting the third bit sequence when the first indication information indicates the first transmission mechanism includes: when the first indication information indicates the first transmission mechanism, instructing a first process to output the third bit sequence, where the first process is one of M processes, and M is an integer greater than or equal to 1.

9. The method according to claim 8, wherein The M processes are the processes for the first transmission mechanism among Q processes, M is an integer less than or equal to Q and greater than or equal to 0, and Q is an integer greater than 1; The Z processes among the Q processes other than the M processes are the processes for the second transmission mechanism, and Z is an integer less than or equal to Q and greater than or equal to 0.

10. The method according to claim 9, wherein The first indication information indicates the M processes for the first transmission mechanism; When the first indication information indicates the first transmission mechanism, indicating that the first process outputs a third bit sequence, includes: When the first indication information indicates that the first process is for the first transmission mechanism, indicating that the first process outputs a third bit sequence.

11. The method according to claim 10, wherein The first indication information further indicates the Z processes for the second transmission mechanism.

12. The method according to any one of claims 8-11, characterized in that, When the value of M is greater than 1, the index value of the first TB corresponding to the first bit sequence and the index value of the second TB corresponding to the second bit sequence are not consecutive.

13. A sequence processing method, characterized in that, Includes: Sending fourth indication information; Obtaining a fourth bit sequence and a fifth bit sequence; When the fourth indication information indicates the first transmission mechanism, outputting a sixth bit sequence; The sixth bit sequence is obtained by superimposing the fourth bit sequence and the fifth bit sequence.

14. The method according to claim 13, wherein The fourth bit sequence, the fifth bit sequence, and the sixth bit sequence each include W bits, or the first bit sequence includes K bits, the second bit sequence and the third bit sequence include W bits, where W and K are positive integers, and K is less than W; The sixth bit sequence is obtained by superimposing the fourth bit sequence and the fifth bit sequence, includes: The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit in the fourth bit sequence and the i-th bit in the fifth bit sequence; or, The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit in the interleaved fourth bit sequence and the i-th bit in the fifth bit sequence; or, The i-th bit in the sixth bit sequence is obtained by superimposing the i-th bit in the fourth bit sequence and the i-th bit in the interleaved fifth bit sequence; The i is an integer greater than or equal to 1 and less than or equal to W or K.

15. The method according to claim 13 or 14, characterized in that, The method further includes: When the fourth indication information indicates the second transmission mechanism, outputting the fourth bit sequence or the fifth bit sequence.

16. The method according to claim 13 or 14, characterized in that The fourth bit sequence corresponds to a third transport block TB, and the fifth bit sequence corresponds to a fourth TB; or, The fourth bit sequence corresponds to a third codeblock CB, and the fifth bit sequence corresponds to a fourth CB.

17. The method according to claim 16, wherein The third CB and the fourth CB are codeblocks in the same TB.

18. The method according to claim 16 or 17, characterized in that, The method further includes: Sending fifth indication information, where the fifth indication information indicates that the fourth bit sequence and the fifth bit sequence correspond to a TB or a CB.

19. The method according to claim 18, wherein When the fifth indication information indicates the first mode, the fourth bit sequence and the fifth bit sequence correspond to a TB; When the fifth indication information indicates the second mode, the fourth bit sequence and the fifth bit sequence correspond to a CB.

20. The method according to any one of claims 13-19, characterized in that, When the fourth indication information indicates the first transmission mechanism, outputting a sixth bit sequence, includes: When the fourth indication information indicates the first transmission mechanism, indicating that a second process outputs the sixth bit sequence, where the second process is one of the R processes, and R is an integer greater than or equal to 1.

21. The method according to claim 20, characterized in that The R processes are the processes among the P processes that use the first transmission mechanism, where R is an integer less than or equal to P and greater than or equal to 0, and P is an integer greater than 1; The Y processes among the P processes other than the R processes are the processes that use the second transmission mechanism, where Y is an integer less than or equal to P and greater than or equal to 0.

22. The method according to claim 21, wherein The fourth indication information indicates the R processes that use the first transmission mechanism; When the fourth indication information indicates the first transmission mechanism, indicating that the second process outputs a sixth bit sequence includes: When the fourth indication information indicates that the second process is a process that uses the first transmission mechanism, indicating that the second process outputs a sixth bit sequence.

23. The method according to claim 21, wherein The fourth indication information also indicates the Y processes that use the second transmission mechanism.

24. The method according to any one of claims 20-23, characterized in that, When the value of R is greater than 1, the index value of the third TB corresponding to the fourth bit sequence and the index value of the fourth TB corresponding to the fifth bit sequence are not consecutive.

25. A communication device, characterized in that, It includes a unit for executing the method according to any one of claims 1-12, or includes a unit for executing the method according to any one of claims 13-24.

26. A communication device, characterized in that, It includes a processor, and the processor is used to execute the method according to any one of claims 1-12, or the processor is used to execute the method according to any one of claims 13-24.

27. A computer-readable storage medium, characterized in that, The computer-readable storage medium is used to store a computer program, and when the computer program is executed, the method according to any one of claims 1-12 is executed, or the method according to any one of claims 13-24 is executed.

Images