Sequence processing method and communication apparatus

Abstract

The present application discloses a sequence processing method and a communication apparatus. The sequence processing method comprises: receiving first indication information; acquiring a first bit sequence and a second bit sequence; and when the first indication information indicates a first transmission mechanism, outputting a third bit sequence, wherein the third bit sequence is obtained on the basis of superposing the first bit sequence with the second bit sequence. The present application can meet the transmission requirements of low-latency services.

Description

Sequence processing method and communication device

[0001] This application claims priority to the Chinese patent application with application number 202311871888.1 filed with the State Intellectual Property Office of China on December 29, 2023, and priority to the Chinese patent application with the invention name “SEQUENCE PROCESSING METHOD AND COMMUNICATION DEVICE”, all contents of which are incorporated by reference into this application. Technical Field

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

[0003] With the continuous development of fifth-generation mobile networks (5G), data transmission latency continues to decrease, and transmission capacity is increasing. 5G communication systems are gradually infiltrating multimedia services with strong real-time requirements and large data capacity, 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 communication transmission rates, real-time video transmission services have gradually become one of the core services in current networks. Traditional hybrid automatic repeat reQuest (HARQ) increases latency due to the feedback of acknowledgment / negative-acknowledgement (ACK / NACK) information, making it difficult to play a role in some services with low latency requirements. Summary of the Invention

[0004] 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.

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

[0006] Receive first indication information; illustratively, the first indication information can be used to indicate a transmission mechanism.

[0007] Obtain a first bit sequence and a second bit sequence; and 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. Alternatively, the first transmission mechanism may be a superposition transmission mechanism.

[0008] Implementing the method described in the first aspect, when the terminal device receives the indication information indicating the first transmission mechanism, it superimposes the two bit sequences to obtain the superimposed bit sequence for transmission, and one of the two superimposed bit sequences (the first bit sequence or the second bit sequence) is a bit sequence that has been transmitted, and the transmitted bit sequence is superimposed with the untransmitted bit sequence (that is, the other bit sequence of the two superimposed bit sequences) to obtain a third bit sequence, and the third bit sequence contains the bit sequence that has been transmitted, thereby having the effect of secondary transmission for the bit sequence that has been transmitted, which can be equivalent to having a similar effect of retransmission for the bit sequence that has been transmitted, thereby improving transmission reliability, and does not require HARQ feedback, which can improve spectrum efficiency and meet the needs of low-latency services. Furthermore, for the untransmitted bit sequence superimposed this time, in the next superposition, the untransmitted bit sequence is the bit sequence that has been transmitted, and the bit sequence that has been transmitted can be further superimposed with other untransmitted bit sequences. The bit sequence obtained by superimposing the transmitted bit sequence with the subsequent bit sequence to be transmitted can have a similar effect of retransmission for the bit sequence that has been transmitted.

[0009] In one 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;

[0010] The third bit sequence is obtained by superimposing the first bit sequence and the second bit sequence and specifically includes:

[0011] 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,

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

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

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

[0015] Exemplarily, the bit superposition may be a bit exclusive OR.

[0016] By 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 one of the bit sequences can be interleaved and superimposed with the other bit sequence to obtain the third bit sequence, thereby improving transmission reliability and spectrum efficiency.

[0017] In a possible implementation, the first bit sequence includes K bits, the second bit sequence includes N bits, and the third bit sequence includes N bits, K and N are positive integers, and K is smaller than N.

[0018] The third bit sequence is obtained by superimposing the first bit sequence and the second bit sequence and specifically includes:

[0019] 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,

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

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

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

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

[0024] In a case where the first indication information indicates the second transmission mechanism, the first bit sequence or the second bit sequence is output.

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

[0026] When implementing this method, if the first indication information indicates the second transmission mechanism, a bit sequence is output, and the output bit sequence is a bit sequence that is not transmitted. The first indication information can be used to flexibly switch between the first transmission mechanism and the second transmission mechanism to meet various business needs. For example, the second transmission mechanism can be used for businesses with unrestricted latency, and the first transmission mechanism can be used for businesses with low latency requirements.

[0027] In one possible implementation, the first bit sequence and the second bit sequence may correspond to transport blocks (TBs), with the first bit sequence corresponding to the first TB and the second bit sequence corresponding 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 correspond to code blocks (CBs), with the first bit sequence corresponding to the first CB and the second bit sequence corresponding 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.

[0028] By implementing this method, the bit sequence corresponding to TB can be superimposed, or the bit sequence corresponding to CB can be superimposed, thereby achieving an equivalent or approximate effect of retransmitting TB or CB, meeting low-latency service requirements.

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

[0030] By implementing this method, the bit sequences corresponding to different CBs in the same TB are superimposed, and differentiated superposition parameters can be designed for different TBs, making the superposition parameter design more flexible.

[0031] In one possible implementation, the method further includes:

[0032] Second indication information is received, where the second indication information indicates that the first bit sequence and the second bit sequence correspond to a TB or a CB. The first bit sequence and the second bit sequence corresponding to a TB can be understood as meaning that the first bit sequence and the second bit sequence are bit sequences encoded as different TBs, and the first bit sequence and the second bit sequence corresponding to a CB can be understood as meaning that the first bit sequence and the second bit sequence are bit sequences encoded as different CBs.

[0033] By implementing this method, the second indication information can be used to indicate whether the superimposed transmission is the superimposition of the bit sequence corresponding to TB or the superimposition of the bit sequence corresponding to CB, and the two superimposition methods can be flexibly switched.

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

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

[0036] By implementing this method, the mode indicated by the indication information can indirectly indicate the superposition of the bit sequence corresponding to TB or the superposition of the bit sequence corresponding to CB, thereby achieving flexible switching between the two superposition methods.

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

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

[0039] By implementing this method, the superimposed bit sequence can be output through a process, thereby enabling one or more processes to output the superimposed sequence in parallel.

[0040] In one possible implementation, the M processes are processes used for the first transmission mechanism among the 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;

[0041] Among the Q processes, Z processes other than M processes are processes for the second transmission mechanism, where Z is an integer less than or equal to Q and greater than or equal to 0. Exemplarily, Z=QM.

[0042] By 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, thereby meeting the needs of various business scenarios.

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

[0044] When the first instruction information indicates the first transmission mechanism, instructing the first process to output the third bit sequence includes:

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

[0046] By implementing this approach, the first indication information can indicate which processes are used for the first transmission mechanism, and the processes indicated by the first indication information as being used for the first transmission mechanism output the superimposed bit sequence, thereby facilitating flexible control of the processes that output the superimposed sequence.

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

[0048] By implementing this approach, the first indication information can also indicate which processes are used for the second transmission mechanism, thereby enabling different processes to use different transmission mechanisms to output bit sequences and achieving the coexistence of the two transmission mechanisms.

[0049] In a possible implementation, 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 discontinuous.

[0050] When this method is implemented, the value of M is greater than 1, that is, the number of processes used for the first transmission mechanism is multiple, and the index values ​​of TBs corresponding to the bit sequences superimposed in the same process are discontinuous, which can better resist continuity errors.

[0051] In a second aspect, an embodiment of the present application provides another sequence processing method, wherein the method can be performed by a network device or a component of the network device (such as a processor, chip, or chip system). The sequence processing method may include:

[0052] sending a fourth instruction message;

[0053] obtaining a fourth bit sequence and a fifth bit sequence;

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

[0055] The sixth bit sequence is obtained by superimposing the fourth bit sequence and the fifth bit sequence.

[0056] 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 superimposed bit sequences (the fourth bit sequence or the fifth bit sequence) is a bit sequence that has been transmitted. The transmitted bit sequence is superimposed with the untransmitted bit sequence (i.e., the other bit sequence of the two superimposed bit sequences) to obtain a sixth bit sequence. The sixth bit sequence contains the bit sequence that has been transmitted, thereby achieving a secondary transmission effect on the bit sequence that has been transmitted, which can be equivalent to a similar retransmission effect on the bit sequence that has been transmitted, thereby improving transmission reliability, and does not require HARQ feedback, which can improve spectrum efficiency and meet the needs of low-latency services. Furthermore, for the untransmitted bit sequence superimposed this time, in the next superposition, the untransmitted bit sequence is the bit sequence that has been transmitted, and the bit sequence that has been transmitted can be further superimposed with other untransmitted bit sequences. The bit sequence obtained by superimposing the transmitted bit sequence with the subsequent bit sequence to be transmitted can have a similar retransmission effect on the bit sequence that has been transmitted.

[0057] In one 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;

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

[0059] 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,

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

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

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

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

[0064] 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,

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

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

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

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

[0069] In a case where the fourth indication information indicates the second transmission mechanism, the fourth bit sequence or the fifth bit sequence is output.

[0070] In one possible implementation, the fourth bit sequence and the fifth bit sequence may correspond to 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,

[0071] The fourth bit sequence and the fifth bit sequence may correspond to 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 a bit sequence after encoding the third CB, and the fifth bit sequence is a bit sequence after encoding the fourth CB.

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

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

[0074] Fifth indication information is sent, indicating that the fourth and fifth bit sequences correspond to TBs or CBs. The fourth and fifth bit sequences corresponding to TBs can be understood as meaning that the fourth and fifth bit sequences are bit sequences encoded for different TBs, and the fourth and fifth bit sequences corresponding to CBs can be understood as meaning that the fourth and fifth bit sequences are bit sequences encoded for different CBs. The fifth indication information may indicate that the fourth and fifth bit sequences are bit sequences encoded for different TBs or different CBs.

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

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

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

[0078] When the fourth indication information indicates the first transmission mechanism, the second process is instructed to output the sixth bit sequence based on the decoding results of other superimposed bit sequences or the decoded soft information, and the second process is one of R processes, where R is an integer greater than or equal to 1.

[0079] In one possible implementation, the R processes are processes used 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;

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

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

[0082] When the fourth indication information indicates the first transmission mechanism, instructing the second process to output a sixth bit sequence according to the decoding results of other superimposed bit sequences or the decoded soft information specifically includes:

[0083] When the fourth indication information indicates that the second process is used for the first transmission mechanism, the second process is instructed to output a sixth bit sequence according to the decoding results of other superimposed bit sequences or the decoded soft information.

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

[0085] 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 discontinuous.

[0086] The beneficial effects of various possible implementations of the second aspect can refer to the beneficial effects of various possible implementations of the first aspect, and will not be repeated here.

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

[0088] sending first instruction information;

[0089] When the first indication information indicates the first transmission mechanism, superposition decoding is performed on the received third bit sequence based on decoding results of other superimposed bit sequences or decoded soft information to obtain a first bit sequence and a second bit sequence, where the other superimposed bit sequence includes at least a superimposed bit sequence of the first bit sequence or the second bit sequence.

[0090] The superimposed bit sequence of the first bit sequence or the second bit sequence can be understood as the superimposed bit sequence obtained by superimposing the first bit sequence or the second bit sequence and other bit sequences. The superimposed bit sequence may be the initial transmission of the first bit sequence or the second bit sequence.

[0091] By implementing the method described in the third aspect, the network device may indicate the first transmission mechanism to the terminal device, and perform superposition decoding on the bit sequence sent by the terminal device to recover the first bit sequence and the second bit sequence. Since the third bit sequence superimposes the first bit sequence and the second bit sequence, other superimposed bit sequences also include the first bit sequence or the second bit sequence. The third bit sequence is jointly decoded in combination with the decoding results of other superimposed bit sequences, or is decoded in combination with the soft information after decoding of other superimposed bit sequences, which can be equivalent to the effect of retransmission, thereby not relying on HARQ feedback, improving transmission reliability and spectrum efficiency, and meeting the needs of low-latency services.

[0092] 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;

[0093] The step of performing superposition decoding on the received third bit sequence to obtain the first bit sequence and the second bit sequence according to the decoding results of the other superposition bit sequences or the decoded soft information includes:

[0094] Performing superposition decoding on the i-th bit in the third bit sequence based on decoding results of other superposition bit sequences or decoded soft information to obtain the i-th bit in the first bit sequence and the i-th bit in the second bit sequence; or

[0095] Performing superposition decoding on the i-th bit in the third bit sequence based on decoding results of other superimposed bit sequences or decoded soft information to obtain the i-th bit of an interleaved first bit sequence and the i-th bit in the second bit sequence, and deinterleaving the interleaved first bit sequence to obtain a first bit sequence;

[0096] Performing superposition decoding on the i-th bit in the third bit sequence based on decoding results of other superimposed bit sequences or decoded soft information to obtain the i-th bit of the first bit sequence and the i-th bit of the interleaved second bit sequence, and deinterleaving the interleaved second bit sequence to obtain a second bit sequence;

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

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

[0099] The step of performing superposition decoding on the received third bit sequence to obtain the first bit sequence and the second bit sequence according to the decoding results of the other superposition bit sequences or the decoded soft information includes:

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

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

[0102] Performing superposition decoding on the i-th bit in the third bit sequence based on decoding results of other superimposed bit sequences or decoded soft information to obtain the i-th bit of the first bit sequence and the i-th bit of the interleaved second bit sequence, and deinterleaving the interleaved second bit sequence to obtain a second bit sequence;

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

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

[0105] In a case where the first indication information indicates the second transmission mechanism, the received first bit sequence or the second bit sequence is output.

[0106] In a possible implementation, 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 a bit sequence encoded by the first TB, and the second bit sequence corresponding to the second TB can be understood as the second bit sequence being a bit sequence encoded by the second TB; or,

[0107] 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 first bit sequence is the bit sequence encoded by the first CB, and the second bit sequence corresponding to the second CB can be understood as the second bit sequence is the bit sequence encoded by the second CB.

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

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

[0110] Second indication information is sent, where the second indication information indicates that the first bit sequence and the second bit sequence correspond to a TB or a CB. The first bit sequence and the second bit sequence corresponding to a TB can be understood as the first bit sequence and the second bit sequence being bit sequences encoded as different TBs, and the first bit sequence and the second bit sequence corresponding to a CB can be understood as the first bit sequence and the second bit sequence being bit sequences encoded as different CBs.

[0111] 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;

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

[0113] In a possible implementation, when the first indication information indicates the first transmission mechanism, performing superposition decoding on the received third bit sequence according to decoding results of other superimposed bit sequences or decoded soft information to obtain the first bit sequence and the second bit sequence includes:

[0114] When the first indication information indicates a first transmission mechanism, the first process is instructed to perform superposition decoding on the received third bit sequence according to the decoding results of other superimposed bit sequences or the decoded soft information to obtain a first bit sequence and a second bit sequence, and the first process is one of M processes, where M is an integer greater than or equal to 1.

[0115] In a possible implementation, the M processes are processes used for the first transmission mechanism among the 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;

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

[0117] In a possible implementation, the first indication information indicates the M processes used for the first transmission mechanism; and when the first indication information indicates the first transmission mechanism, instructing the first process to perform superposition decoding on the received third bit sequence according to decoding results of other superimposed bit sequences or decoded soft information to obtain the first bit sequence and the second bit sequence includes:

[0118] When the first indication information indicates that the first process is used for the first transmission mechanism, the first process is instructed to perform superposition decoding on the received third bit sequence according to the decoding results of other superimposed bit sequences or the decoded soft information to obtain the first bit sequence and the second bit sequence.

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

[0120] In a possible implementation, 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 discontinuous.

[0121] The beneficial effects of various possible implementations of the third aspect can refer to the beneficial effects of various possible implementations of the first aspect, and will not be repeated here.

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

[0123] receiving fourth instruction information;

[0124] When the fourth indication information indicates the first transmission mechanism, superposition decoding is performed on the received sixth bit sequence based on decoding results of other superimposed bit sequences or decoded soft information to obtain a fourth bit sequence and a fifth bit sequence, where the other superimposed bit sequences include at least a superimposed bit sequence of the fourth bit sequence or the fifth bit sequence.

[0125] The superimposed bit sequence of the fourth bit sequence or the fifth bit sequence can be understood as the superimposed bit sequence obtained by superimposing the fourth bit sequence or the fifth bit sequence and other bit sequences. The superimposed bit sequence may be the initial transmission of the fourth bit sequence or the fifth bit sequence.

[0126] When implementing the method described in the fourth aspect, when the terminal device receives the fourth indication information indicating the first transmission mechanism sent by the network device, the terminal device performs superposition decoding on the received bit sequence to recover the fourth bit sequence and the fifth bit sequence. Since the sixth bit sequence superimposes the fourth bit sequence and the fifth bit sequence, other superimposed 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 results of other superimposed bit sequences, or is decoded in combination with the soft information after decoding of other superimposed bit sequences, which can be equivalent to the effect of retransmission, improve transmission reliability, and does not rely on HARQ feedback, thereby improving spectrum efficiency and meeting the needs of low-latency services.

[0127] 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;

[0128] The step of performing superposition decoding on the received sixth bit sequence to obtain the fourth bit sequence and the fifth bit sequence according to the decoding results of the other superposition bit sequences or the decoded soft information includes:

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

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

[0131] Performing superposition decoding on the i-th bit in the sixth bit sequence based on decoding results of other superimposed bit sequences or decoded soft information to obtain the i-th bit of a fourth bit sequence and the i-th bit of an interleaved fifth bit sequence, and deinterleaving the interleaved fifth bit sequence to obtain a fifth bit sequence;

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

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

[0134] The step of performing superposition decoding on the received sixth bit sequence to obtain the fourth bit sequence and the fifth bit sequence according to the decoding results of the other superposition bit sequences or the decoded soft information includes:

[0135] Performing superposition decoding on the i-th bit in the sixth bit sequence based on decoding results of other superposition bit sequences or decoded soft information to obtain the i-th bit in the fourth bit sequence and the i-th bit in the fifth bit sequence; or

[0136] Performing superposition decoding on the i-th bit in the sixth bit sequence based on decoding results of other superimposed bit sequences or decoded soft information to obtain the i-th bit of an interleaved fourth bit sequence and the i-th bit in the fifth bit sequence, and deinterleaving the interleaved fourth bit sequence to obtain a fourth bit sequence;

[0137] Performing superposition decoding on the i-th bit in the sixth bit sequence based on decoding results of other superimposed bit sequences or decoded soft information to obtain the i-th bit of a fourth bit sequence and the i-th bit of an interleaved fifth bit sequence, and deinterleaving the interleaved fifth bit sequence to obtain a fifth bit sequence;

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

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

[0140] In a case where the fourth indication information indicates the second transmission mechanism, the received fourth bit sequence or fifth bit sequence is output.

[0141] In one possible implementation, the fourth bit sequence and the fifth bit sequence may correspond to 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,

[0142] The fourth bit sequence and the fifth bit sequence may correspond to 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 a bit sequence encoded by the third CB, and the fifth bit sequence is a bit sequence encoded by the fourth CB.

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

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

[0145] Fifth indication information is received, where the fifth indication information indicates that the fourth bit sequence and the fifth bit sequence correspond to a TB or a CB. The fourth bit sequence and the fifth bit sequence corresponding to a TB can be understood as meaning that the fourth bit sequence and the fifth bit sequence are bit sequences encoded by different TBs, respectively; and the fourth bit sequence and the fifth bit sequence corresponding to a CB can be understood as meaning that the fourth bit sequence and the fifth bit sequence are bit sequences encoded by different CBs, respectively. The fifth indication information may indicate that the fourth bit sequence and the fifth bit sequence are bit sequences encoded by different TBs or different CBs.

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

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

[0148] In a possible implementation, when the fourth indication information indicates the first transmission mechanism, superimposing and decoding the received sixth bit sequence according to decoding results of other superimposed bit sequences or decoded soft information to obtain a fourth bit sequence and a fifth bit sequence includes:

[0149] When the fourth indication information indicates the first transmission mechanism, the second process is instructed to perform superposition decoding on the received sixth bit sequence according to the decoding results of other superimposed bit sequences or the decoded soft information to obtain a fourth bit sequence and a fifth bit sequence, and the second process is one of R processes, where R is an integer greater than or equal to 1.

[0150] In a possible implementation, the R processes are processes used 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;

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

[0152] In a possible implementation, the fourth indication information indicates the R processes used for the first transmission mechanism; and when the fourth indication information indicates the first transmission mechanism, instructing the second process to perform superposition decoding on the received sixth bit sequence according to decoding results of other superimposed bit sequences or decoded soft information to obtain a fourth bit sequence and a fifth bit sequence includes:

[0153] When the fourth indication information indicates that the second process is used for the first transmission mechanism, the second process is instructed to perform superposition decoding on the received sixth bit sequence according to the decoding results of other superimposed bit sequences or the decoded soft information to obtain a third bit sequence and a fourth bit sequence.

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

[0155] 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 discontinuous.

[0156] The beneficial effects of various possible implementations of the fourth aspect can refer to the beneficial effects of various possible implementations of the second aspect, and will not be repeated here.

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

[0158] receiving first instruction information;

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

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

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

[0162] sending a fourth instruction message;

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

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

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

[0166] a transceiver unit, configured to receive first indication information;

[0167] A processing unit is configured to obtain a first bit sequence and a second bit sequence; and output a third bit sequence when the first indication information indicates a first transmission mechanism; the third bit sequence is obtained based on the superposition of the first bit sequence and the second bit sequence.

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

[0169] a transceiver unit, configured to send fourth indication information;

[0170] A processing unit is configured to obtain a fourth bit sequence and a fifth bit sequence; and when the fourth indication information indicates a first transmission mechanism, output a sixth bit sequence; the sixth bit sequence is obtained based on the superposition of the fourth bit sequence and the fifth bit sequence.

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

[0172] a transceiver unit, configured to send first indication information;

[0173] The processing unit is configured to, when the first indication information indicates the first transmission mechanism, perform superposition decoding on the received third bit sequence according to decoding results of other superposition bit sequences or decoded soft information to obtain the first bit sequence and the second bit sequence.

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

[0175] a transceiver unit, configured to receive fourth indication information;

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

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

[0178] In a possible implementation, the memory is located outside the communication device.

[0179] In a possible implementation, the memory is located within the communication device.

[0180] 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.

[0181] In a possible implementation, the communication device further includes a transceiver, where the transceiver is configured to receive a signal or send a signal.

[0182] In the twelfth aspect, an embodiment of the present application provides a communication device, which includes a logic circuit and an interface, and the logic circuit and the interface are coupled; the interface is used to input and / or output sequences, and the logic circuit is used to perform processing operations.

[0183] In the thirteenth aspect, an embodiment of the present application provides a computer-readable storage medium for storing a computer program, which, when run on a computer, enables the method shown in any possible implementation of the above-mentioned first to sixth aspects to be executed.

[0184] In the fourteenth aspect, an embodiment of the present application provides a computer program product, which includes a computer program or computer code, and when the computer program product is run on a computer, the method shown in any possible implementation of the above-mentioned first to sixth aspects is executed.

[0185] In a fifteenth aspect, an embodiment of the present application provides a computer program. When the computer program is run on a computer, the method shown in any possible implementation of the above-mentioned first to sixth aspects is executed.

[0186] In a sixteenth aspect, an embodiment of the present application provides a wireless communication system, comprising a first communication device and a second communication device, wherein the first communication device is used to execute the method in any possible implementation manner of the first aspect above, and the second communication device is used to execute the method in any possible implementation manner of the third aspect above; or,

[0187] The first communication device is used to execute the method in any possible implementation of the second aspect above, and the second communication device is used to execute the method in any possible implementation of the fourth aspect above.

[0188] The technical effects achieved in the seventh to sixteenth aspects mentioned above 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

[0189] FIG1 is a schematic diagram of a communication system provided in an embodiment of the present application;

[0190] FIG2 is a schematic diagram of redundancy versions RV0 to RV3 provided in an embodiment of the present application;

[0191] FIG3 is a schematic diagram of superposition transmission provided in an embodiment of the present application;

[0192] FIG4 is a decoding diagram provided in an embodiment of the present application;

[0193] FIG5a is a schematic flow chart of a sequence processing method provided in an embodiment of the present application;

[0194] FIG5b is a schematic diagram of superposition of bit sequences corresponding to CBs provided in an embodiment of the present application;

[0195] FIG5c is a schematic diagram of the superposition of bit sequences corresponding to TBs provided in an embodiment of the present application;

[0196] FIG5 d is a schematic diagram of two process superimposed transmissions provided in an embodiment of the present application;

[0197] FIG5e is a schematic diagram of the multiplexing of two processes provided in an embodiment of the present application;

[0198] FIG6 is a flow chart of another sequence processing method provided in an embodiment of the present application;

[0199] FIG7 is a flow chart of another sequence processing method provided in an embodiment of the present application;

[0200] FIG8 is a flow chart of another sequence processing method provided in an embodiment of the present application;

[0201] FIG9 is a schematic structural diagram of a communication device provided in an embodiment of the present application;

[0202] FIG10 is a schematic structural diagram of another communication device provided in an embodiment of the present application;

[0203] FIG11 is a schematic structural diagram of another communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0204] The present application can be applied to the protocol framework of various wireless communication systems, and 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., and future evolved communication systems such as future networks or sixth generation communication systems.

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

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

[0207] It is understood that the number and configuration of devices shown in FIG1 are for illustrative purposes only and do not constitute a limitation on the embodiments of the present application. For example, an actual application may include two or more network devices.

[0208] In an embodiment of the present application, a network device is a device deployed in a wireless 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 using different wireless access technologies, the name of the network device may be different, such as eNB or eNodeB (evolutionary nodeB) in LTE (long term evolution). The network device may also be a wireless 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 an in-vehicle device. The network device may also be a transmission and reception point (TRP). The network device may also refer to the general term for all devices on 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 network devices. The network device may also be an access network device or a module of an access network device in an open access network (open RAN, ORAN) system. The network device may be a module or unit that can implement some functions of a base station. For example, the network device may be a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). In the ORAN system, the CU may also be referred to as an O-CU, the DU may also be referred to as an open (O)-DU, the CU-CP may also be referred to as an O-CU-CP, the CU-UP may also be referred to as an O-CUP-UP, and the RU may also be referred to as an O-RU.

[0209] In the embodiments of this application, a terminal device is a device with wireless transceiver capabilities, also known as user equipment (UE), mobile station (MS), or mobile terminal (MT). It refers to a device that provides voice and / or data connectivity to users, and also includes devices capable of sidelink communication, such as vehicle-mounted terminals or handheld terminals capable of V2X communication. It can be deployed on land, including indoors or outdoors, handheld, wearable, or vehicle-mounted; it can also be deployed on water (such as ships); and it can also be deployed in the air (such as aircraft, balloons, and satellites). 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 a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, a wearable terminal device, an extended reality (XR) device, etc. Wearable terminal devices may include, for example, user devices such as a head-mounted display (HMD) or smart glasses (such as VR glasses or AR glasses).

[0210] The embodiments of this application do not limit the application scenarios. Terminal devices may also be referred to as terminals, user equipment (UE), access terminal devices, vehicle-mounted terminals, industrial control terminals, UE units, UE stations, mobile stations, mobile stations, remote stations, remote terminal devices, mobile devices, UE agents, or UE devices. Terminal devices may also be fixed or mobile.

[0211] 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. Ordinary technicians in this field will know that with the evolution of 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.

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

[0213] 1. HARQ retransmission mechanism

[0214] The HARQ retransmission mechanism uses a stop-and-wait protocol to send data. After the sender sends a transport block (TB), it stops and waits for confirmation information. The receiver can use 1 bit of information to ACK or NACK the transport block. However, the sender stops and waits for confirmation after each transmission, which results in very low throughput. Therefore, multiple parallel HARQ processes can be used. While one HARQ process is waiting for confirmation information, the sender can use another HARQ process to continue sending data. Similarly, while the receiver is using one process to process received information, 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.

[0215] In the downlink transmission direction, the base station can configure the maximum number of processes supported by the terminal device through the high-level signaling parameter nrofHARQ-ProcessesForPDSCH according to the network deployment. 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.

[0216] The sender needs to determine whether the transmission is successful based on the ACK / NACK fed back by the receiver. ACK (Acknowledgement) indicates successful transmission, and NACK (Negative Acknowledgement) indicates transmission failure. In the case of transmission failure, retransmission is required. In NR, the soft combining scheme is divided into chase combining (CC) and incremental redundancy (IR) according to whether the retransmitted bit information is the same as the initial transmission. In chase combining, the retransmitted bit information is the same as the initial transmission, and 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 check bits generated by the encoder are concatenated to form a sequence. Each RV defines the transmission starting point in the sequence. Different RVs are used for the first transmission and each HARQ retransmission to achieve the gradual accumulation of redundant bits and complete the incremental redundancy HARQ operation. As shown in Figure 2, it is a schematic diagram of the redundant versions RV0 to RV3 provided in an embodiment of the present application. Multiple retransmissions are usually performed in the order of RV0, RV2, RV3, and RV1. That is, when a TB is initially transmitted, RV0 bits are usually used to ensure that the initial transmission is correct as much as possible; when it is retransmitted, bits of other RV versions are selected to send check bits different from RV0. This allows the receiver to obtain as much information as possible after combining the initial and retransmitted information, thereby increasing 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 a unit of HARQ retransmission.

[0219] 3. Overlay transmission

[0220] Superposition transmission technology is a block Markov superpositon transmission (BMST) coding scheme. The transmitter divides the data block into multiple sub-blocks and encodes each sub-block using a low-density parity check code (LDPC) code to obtain the corresponding coded codeword for each sub-block. Furthermore, 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 codeword sequence transmitted, thus forming a chain superposition transmission based on a sliding window. The superposition operation can be an exclusive-or operation on the corresponding bits. One of the two codewords to be superimposed can be interleaved before the superposition operation.

[0221] The following example illustrates superposition transmission with reference to Figure 3. u1, u2, u3, and u4 are information bit sequences in different subblocks. Figure 3 uses information bit sequences corresponding to four subblocks as an example, but can also include information bit sequences corresponding to more subblocks, and so on. Information bit sequence u1 is LDPC-encoded to obtain codeword sequence c1. Since it is the first codeword sequence, superposition is not required, and the corresponding transmitted v1 sequence is sequence c1. Information bit sequence u2 is also LDPC-encoded to obtain codeword sequence c2. After bit selection and interleaving, the previous codeword sequence c1 is superimposed on the corresponding bits of codeword sequence c2 to obtain the actual transmitted superposition codeword sequence v2. Similarly, u3 and u4 are processed in the same manner to obtain superposition codeword sequences v3 and v4. The corresponding superposition transmission threshold is determined based on the maximum superposition length. For example, if a maximum of k information bit sequences are allowed to be superimposed, the maximum number can only reach uk, and the actual transmitted superposition codeword sequences are v1 to vk.

[0222] The receiving end decodes according to the decoding algorithm based on the sliding window. Considering the joint decoding of multiple received sequences in the decoding window, taking the decoding window length equal to 2 as an example, as shown in Figure 4, the sliding window contains y (t) and y (t+1) The soft information sequence of two codewords, in Figure 4, node LDPC represents the NR LDPC codec, for the t-th codeword, by using the soft information sequence y (t) And the superimposed transmission codeword soft information sequence y (t+1) The soft value external information z in 1→0 As input, decode; and convert the corresponding soft information z 0→1 The t+1th codeword is passed to the decoding process; the t+1th codeword uses the soft information sequence y (t+1) And the superimposed transmission codeword soft information sequence y (t) The soft value external information z in 0→1As input, decoding is performed; 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 associated soft information of the previous and next codewords to perform information transmission decoding algorithm, which can improve decoding performance. The superimposed codeword contains the soft information of the previous codeword, which is equivalent to the effect of retransmission. At the same time, it does not rely on feedback and reduces latency.

[0224] The following examples describe embodiments of the sequence processing method of the present application. It should be noted that the various technical solutions (or embodiments) of the present application can be implemented independently or in combination based on certain internal connections. This application is not limited thereto. Furthermore, the various terms and definitions between the various embodiments can be referenced to each other. In each embodiment of the present application, different implementation methods can also be implemented in combination or independently.

[0225] Please refer to Figure 5a, which is a flow chart of a sequence processing method provided in an embodiment of the present application. Figure 1 can be a system architecture diagram applicable to the sequence processing method. The execution order of the various steps of the sequence processing method shown in Figure 5a is not limited by the embodiment of the present application. As shown in Figure 5a, the sequence processing method of the embodiment of the present application includes but is not limited to the following steps. It can be understood that in some scenarios, some steps of the following steps may be included but not all steps, and this application does not limit them:

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

[0227] Exemplarily, the first indication information may be used to indicate a transmission mechanism, for example, the first indication information may indicate a first transmission mechanism and / or a second transmission mechanism. Alternatively, the first transmission mechanism may be referred to as a superposition transmission mechanism, and the second transmission mechanism may be referred to as a HARQ retransmission mechanism.

[0228] Network devices can select corresponding transmission mechanisms for different services. For example, a first transmission mechanism is selected for low-latency service data transmission, and a second transmission mechanism is selected for service data transmission with no latency constraints. Low-latency services may include, but are not limited to, XR services, real-time video transmission services, and audio transmission services. Services with no latency constraints may include, but are not limited to, email transmission services and communication message transmission services.

[0229] In one possible implementation, if the first indication information indicates a first state value, then the first transmission mechanism is indicated; if the first indication information indicates a second state value, then the second transmission mechanism is indicated. For example, the first indication information occupies one bit, and if the value of the one bit is 1, then the first indication information indicates the first state value; if the value of the one bit is 0, then the first indication information indicates the second state value. It is understandable that, taking the first state value as 1 and the second state value as 0 as an example, the first state value may also be 0 and the second state value may be 1, and this application does not limit this.

[0230] In one possible implementation, the first indication information may be carried in downlink control information (DCI). Exemplarily, a field Field may be added to the DCI, and the newly added field carries the first indication information. For example, the name of the newly added field is Superposed_Transmission_enable_Field. When the value of the field is 0, it indicates that the superposed transmission mechanism is not adopted and the HARQ retransmission mechanism is adopted; when the value of the field is 1, it indicates that the superposed transmission mechanism is adopted. The value in the newly added field can be understood as an enable switch for the superposed transmission mechanism. Exemplarily, the first indication information may also be carried in an existing field in the DCI, for example, by indicating the transmission mechanism through a reserved bit in the existing field.

[0231] In one possible implementation, the first indication information may be carried in a Radio Resource Control (RRC) message. Exemplarily, a field Field may be added to the RRC message, and the newly added field carries the first indication information. For example, the name of the newly added field is Superposed_Transmission_enable_Field. When the value of the field is 0, it indicates that the superimposed transmission mechanism is not adopted and the HARQ retransmission mechanism is adopted; when the value of the field is 1, it indicates that the superimposed transmission mechanism is adopted. Exemplarily, the first indication information may also be carried in an existing field in the RRC, for example, by indicating the transmission mechanism through a reserved bit in the existing field.

[0232] In one possible implementation, the network device may indicate the transmission mechanism by implicit indication. For example, when scheduling a TB or CB transmission, if the network device indicates two HARQ processes, the TB or CB is instructed to adopt the first transmission mechanism, that is, the superposition transmission mechanism; if the network device indicates one HARQ process, the TB or CB is instructed to adopt the second transmission mechanism for transmission, that is, the HARQ retransmission mechanism. Wherein the TB or CB adopting the first transmission mechanism means that the bit sequence corresponding to the TB or CB is superimposedly transmitted. For example, the bit sequence corresponding to the TB or CB may refer to the bit sequence encoded by the TB or CB.

[0233] In one possible implementation, the first indication information may indicate a first transmission mechanism and a second transmission mechanism. For example, the first indication information may indicate one or more processes used for the first transmission mechanism. Exemplarily, the first indication information may also indicate one or more processes used for the second transmission mechanism. For details, please refer to the relevant description in the subsequent embodiments of "First transmission mechanism based on one or more processes transmission" and will not be repeated 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 bit sequences among a plurality of bit sequences to be transmitted by the terminal device.

[0236] In one implementation, a bit sequence may correspond to a TB, and the first bit sequence and the second bit sequence may correspond to different TBs, respectively. 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 first bit sequence being the bit sequence encoded by 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 encoded by 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 correspond to different CBs, respectively. 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 first bit sequence being the bit sequence encoded by the first CB, and the second bit sequence corresponding to the second CB can be understood as the bit sequence encoded by 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. Accordingly, the network device receives the third bit sequence.

[0239] If 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 respectively 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, the value of i in the following superposition 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, the value of i in the following superposition is an integer greater than or equal to 1 and less than or equal to K. The following three possible implementation methods are used to illustrate the superposition method of the first bit sequence and the second bit sequence:

[0240] In a first possible implementation, the i-th bit in the first bit sequence and the i-th bit in the second bit sequence are superimposed to obtain the i-th bit in the third bit sequence.

[0241] In a second possible implementation, the i-th bit of the interleaved first bit sequence and the i-th bit of the second bit sequence are superimposed to obtain the i-th bit of the third bit sequence.

[0242] In a third possible implementation, the i-th bit of the second bit sequence after interleaving is superimposed with the i-th bit in the first bit sequence to obtain the i-th bit in the third bit sequence.

[0243] Illustratively, in the above three possible implementations, bit superposition may be bit exclusive OR.

[0244] In some embodiments, the first bit sequence and the second bit sequence correspond to different CBs, respectively. 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. For example, the first bit sequence can be the bit sequence encoded by the first CB, and the second bit sequence can be the bit sequence encoded by the second CB. 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 a TB. For example, as shown in FIG5b, a schematic diagram of superimposing bit sequences corresponding to CBs provided in an embodiment of the present application is shown, where 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 the bit sequence corresponding to CB1 and the bit sequence corresponding to CB2 superimposed, CB3' is the bit sequence corresponding to CB2 and the bit sequence corresponding to CB3 superimposed, and so on. The bit sequence corresponding to the nth CB is superimposed with the bit sequence corresponding to the n-1th CB to obtain the nth superimposed bit sequence CBn'. The terminal device transmits the superimposed bit sequence CBn'. In Figure 5b, the bit sequence corresponding to CB can be understood as the bit sequence after CB encoding. The structure within TB is changed by superimposing the bit sequences corresponding to CB, and a coupling relationship between CBs is introduced. Different superposition coding parameters can be designed for different TBs, and each TB can also adopt a unified superposition coding parameter.

[0245] In some embodiments, the first bit sequence and the second bit sequence correspond to different TBs, respectively. 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 may be the bit sequence encoded by the first TB, and the second bit sequence may be the bit sequence encoded by the second TB. Superimposing the first bit sequence and the second bit sequence can be understood as superimposing bit sequences corresponding to different TBs. For example, FIG5c shows a schematic diagram of superimposing bit sequences corresponding to TBs according to an embodiment of the present application, where TBn' is the nth superimposed bit sequence, n is an integer greater than 1, TB1' is the bit sequence corresponding to TB1, TB2' is the superimposition of the bit sequence corresponding to TB1 and the bit sequence corresponding to TB2, TB3' is the superimposition of the bit sequence corresponding to TB2 and the bit sequence corresponding to TB3, and so on. The bit sequence corresponding to the i-th TB is superimposed with the bit sequence corresponding to the i-1-th TB to obtain the i-th superimposed bit sequence TBn'. The terminal device transmits the superimposed bit sequence TBn'. In FIG5c, the bit sequence corresponding to the TB can be understood as the bit sequence encoded by the TB. The superposition of bit sequences corresponding to each TB may adopt a unified superposition coding parameter.

[0246] In some implementations, the network device may send second indication information to the terminal device, indicating that the first bit sequence and the second bit sequence correspond to a TB or CB. Alternatively, the second indication information may indicate superimposed transmission of bit sequences corresponding to different TBs or superimposed transmission of 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 superimposed 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 superimposed transmission between bit sequences corresponding to different CBs.

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

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

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

[0251] The other superimposed bit sequences at least include superimposed bit sequences of the first bit sequence or the second bit sequence.

[0252] The superimposed bit sequence of the first or second bit sequence can be understood as being obtained by superimposing the first or second bit sequence and other bit sequences. This superimposed bit sequence can be understood as the initial transmission of the first or second bit sequence. The network device can decode the third bit sequence in conjunction with the decoding results of other superimposed bit sequences or decoded soft information, effectively achieving a retransmission effect. This eliminates reliance on HARQ feedback, improves reliability and spectrum efficiency, and meets the requirements of low-latency services.

[0253] Due to channel effects, the third bit sequence received by the network device may differ from the third bit sequence sent by the terminal device. For ease of description, they are described using the same naming. 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 first bit sequence, the second bit sequence, and the third bit sequence contain the same number of bits. In this example, the value of i in the following decoding process is an integer greater than or equal to 1 and less than or equal to N. As another example, the first bit sequence, the second bit sequence, and the third bit sequence may contain different numbers of bits. 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, the value of i in the following decoding process is an integer greater than or equal to 1 and less than or equal to K. The decoding process is illustrated below using three possible implementations:

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

[0256] In a second possible implementation, the network device performs superposition decoding on the i-th bit in the third bit sequence based on the decoding results of other superimposed bit sequences or the decoded soft information to obtain the i-th bit of the interleaved first bit sequence and the i-th bit in the second bit sequence, and further deinterleaves the interleaved first bit sequence to obtain the first bit sequence.

[0257] In a third possible implementation, the network device performs superposition decoding on the i-th bit in the third bit sequence based on the decoding results of other superimposed bit sequences or the decoded soft information to obtain the i-th bit of the first bit sequence and the i-th bit in the interleaved second bit sequence, and further deinterleaves the interleaved second bit sequence to obtain the second bit sequence.

[0258] The following example describes the first transmission mechanism based on one or more process transmissions:

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

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

[0261] When the first indication information indicates the first transmission mechanism, the terminal device may instruct the first process to output the third bit sequence. If M = 1, the first process is a process for the first transmission mechanism. When M = 1, the bit sequences corresponding to different CBs may be superimposed (for example, as shown in FIG5b ), or the bit sequences corresponding to different TBs may be superimposed (for example, as shown in FIG5c ).

[0262] If the value of M is greater than 1, that is, there are multiple processes used for the first transmission mechanism, the first process can be any one of the M processes. It can be understood that each process outputs a superimposed bit sequence. The superposition method can refer to the process of superimposing the first bit sequence and the second bit sequence to obtain the third bit sequence, which will not be described in detail here. In some implementations, when the value of M is greater than 1, the index value of the first TB corresponding to the first bit sequence used for superposition and the index value of the second TB corresponding to the second bit sequence may be discontinuous. For example, the bit sequence corresponding to TB1 and the bit sequence corresponding to TB3 are superimposed to better combat continuous errors. Among them, the bit sequence corresponding to TB can be understood as the bit sequence after TB encoding.

[0263] Accordingly, the network device receiving the third bit sequence may instruct the first process to perform superposition decoding on the received third bit sequence based on the decoding results of other superimposed bit sequences or the decoded soft information to obtain the first bit sequence and the second bit sequence. The network device uses the process corresponding to the same process ID as the terminal device to perform superposition decoding on the received third bit sequence.

[0264] The following uses FIG5d as an example of a multiple process for the first transmission mechanism. FIG5d illustrates a case in which there are two processes and the bit sequences used for superposition are the superposition of bit sequences corresponding to different TBs. The bit sequences corresponding to TBs can be understood as the bit sequences after TB encoding. The superposed bit sequences output by process 1 are TB1', TB2', and TB3', respectively. TB1' is the bit sequence corresponding to TB1, TB2' is the superposition of the bit sequence corresponding to TB1 and the bit sequence corresponding to TB3, and TB3' is the superposition of the bit sequence corresponding to TB3 and the bit sequence corresponding to TB5. In other words, TB1, TB3, and TB5 are scheduled to process 1 for superposition transmission. The superposed bit sequences output by process 2 are TB1', TB2', and TB3', respectively. TB1' is the bit sequence corresponding to TB1, TB2' is the superposition of the bit sequence corresponding to TB2 and the bit sequence corresponding to TB4, and TB3' is the superposition of the bit sequence corresponding to TB4 and the bit sequence corresponding to TB6. In other words, TB2, TB4, and TB6 are scheduled to process 2 for superposition transmission. In FIG5 d , the index values ​​of the TBs corresponding to the two superimposed bit sequences are discontinuous, which can better resist continuity errors and improve the robustness of transmission.

[0265] In another implementation, the first transmission mechanism and the second transmission mechanism may reuse Q processes, using M of the Q processes for the first transmission mechanism, and using Z of the Q processes except the M processes 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] For example, Z may be equal to QM, that is, all processes of the Q processes except the M processes used for the first transmission mechanism are used for the second transmission mechanism (i.e., the HARQ retransmission mechanism). Z may also be less than QM, that is, some processes of the Q processes except 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 uses FIG5e as an example of multiplexing Q processes in the first transmission mechanism and the second transmission mechanism. For example, Q = 2, and one of the two processes (e.g., process 2) is used for the first transmission mechanism, and the other process (e.g., process 1) is used for the second transmission mechanism (i.e., the HARQ retransmission mechanism). FIG5e takes the superposition of bit sequences corresponding to different TBs as an example. The bit sequence corresponding to a TB can be understood as the bit sequence after TB encoding. For process 1, since the bit sequence is output based on the second transmission mechanism, process 1 is instructed to output the bit sequence corresponding to each TB in sequence, and there is no need to superimpose 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 superimposed bit sequence TBn' in sequence, where TBn' is the nth superimposed bit sequence, n is an integer greater than 1, TB1' is the bit sequence corresponding to TB1, TB2' is the superposition of the bit sequence corresponding to TB1 and the bit sequence corresponding to TB2, TB3' is the superposition of the bit sequence corresponding to TB2 and the bit sequence corresponding to TB3, and so on. The bit sequence corresponding to the i-th TB is superimposed with the bit sequence corresponding to the i-1-th TB to obtain the i-th superimposed bit sequence TBn'. Process 2 outputs the superimposed bit sequence TBn'.

[0268] If M=Q, the number of processes used 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 used for the first transmission mechanism is 0, that is, all Q processes are used for the second transmission mechanism.

[0269] Exemplarily, the Q processes mentioned above may be processes that multiplex the second transmission mechanism (ie, the HARQ retransmission mechanism), that is, part of the Q processes of the second transmission mechanism are used for the first transmission mechanism, and 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 M processes used for the first transmission mechanism. For example, if the first indication information in step 501 indicates M processes used for the first transmission mechanism, then in step 504, if 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, then the terminal device instructs the first process to output the third bit sequence.

[0271] Exemplarily, the first indication information may also indicate the Z processes used for the second transmission mechanism, with Z=QM being used as an example below. Exemplarily, the first indication information may indicate the transmission mechanisms corresponding to the Q processes through a bitmap. For example, the first indication information indicates through Q bits that each of the Q processes is used for the first transmission mechanism or the second transmission mechanism, and one bit in the Q bits corresponds to one process. If the value of a bit is 1, it indicates that the process corresponding to the bit is used for the first transmission mechanism. If the value of a bit is 0, it indicates that the process corresponding to the bit is used for the second transmission mechanism. It can be understood that indicating the first transmission mechanism with a bit value of 1 and indicating the second transmission mechanism with a bit value of 0 is only an example.

[0272] In this implementation, the first indication information may indicate M processes for the first transmission mechanism and Z processes for the second transmission mechanism, thereby enabling the first indication information to simultaneously indicate the first transmission mechanism and the second transmission mechanism. The terminal device may output a bit sequence based on the first transmission mechanism in the indicated M processes, and may output a bit sequence based on the second transmission mechanism in the indicated Z processes. Outputting the bit sequence based on the second transmission mechanism may be understood as transmission using the HARQ retransmission mechanism.

[0273] Please refer to Figure 6, which is a flow chart of another sequence processing method provided in an embodiment of the present application. Figure 1 can be a system architecture diagram applicable to the sequence processing method. The execution order of the various steps of the sequence processing method shown in Figure 6 is not limited by the embodiment of the present application. As shown in Figure 6, the sequence processing method of the embodiment of the present application includes but is not limited to the following steps. It can be understood that in some scenarios, some steps of the following steps may be included but not all steps, and this application does not limit them:

[0274] 601: The network device sends 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. Accordingly, the network device receives the third bit sequence.

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

[0278] For steps 601 to 604 in the embodiment of the present application, please refer to the description of steps 501 to 504 in the embodiment of Figure 5a, which will not be repeated 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. The output bit sequence may be a bit sequence that the terminal device has not transmitted. That is, when the first indication information indicates the second transmission mechanism, bit sequence superposition is not required.

[0281] Exemplarily, if the first bit sequence and the second bit sequence are bit sequences corresponding to different CBs, respectively, the terminal device may output the bit sequence corresponding to the CB with the larger CB index value. For example, as shown in FIG5b , 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 already been transmitted, the bit sequence corresponding to CB2 with the larger CB index value may be output.

[0282] Exemplarily, if the first bit sequence and the second bit sequence are bit sequences corresponding to different TBs, the terminal device outputs the bit sequence corresponding to the TB with the larger TB index value. For example, as shown in FIG5c , 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 already been transmitted, the bit sequence corresponding to TB2 with the larger TB index value may 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 output the received first bit sequence or second bit sequence without superposition decoding, and determine whether to transmit an ACK or NACK to the terminal device. Due to channel influences, the bit sequence sent by the terminal device and the bit sequence received by the network device may differ. For ease of description, this application uses the same name for both.

[0285] Please refer to Figure 7, which is a flow chart of another sequence processing method provided in an embodiment of the present application. Figure 1 can be a system architecture diagram applicable to the sequence processing method. The execution order of the various steps of the sequence processing method shown in Figure 7 is not limited by the embodiment of the present application. As shown in Figure 7, the sequence processing method of the embodiment of the present application includes but is not limited to the following steps. It can be understood that in some scenarios, some steps of the following steps may be included but not all steps, and this application does not limit them:

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

[0287] The fourth indication information in step 701 of the embodiment of the present application can refer to the description of the first indication information in step 501 of the embodiment of Figure 5a, and will not be repeated here.

[0288] 702. The network device obtains a fourth bit sequence and a 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 a description of the fourth bit sequence and the fifth bit sequence, please refer to the description of the first bit sequence and the second bit sequence in step 502 of the embodiment of FIG. 5a , and will not be repeated here.

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

[0291] In the case where 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 a 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 include the same number of bits. As another example, the fourth bit sequence, the fifth bit sequence, and the sixth bit sequence may also include different numbers of bits, for example, the fourth bit sequence includes K bits, the fifth bit sequence includes N bits, and the sixth bit sequence includes N bits. Regarding the superposition method of the fourth bit sequence and the fifth bit sequence, reference can be made to the superposition of the first bit sequence and the second bit sequence in step 503 of the embodiment of Figure 5a, which will not be repeated here.

[0292] In some implementations, the network device may further send fifth indication information to the terminal device, where the fifth indication information indicates that the fourth bit sequence and the fifth bit sequence correspond to a TB or a CB. Alternatively, the fifth indication information may indicate superimposed transmission of bit sequences corresponding to different TBs or superimposed transmission of bit sequences corresponding to different CBs. The bit sequence corresponding to a TB may be understood as a bit sequence after TB encoding, and the bit sequence corresponding to a CB may be understood as a bit sequence after CB encoding.

[0293] Exemplarily, when the fifth indication information indicates the first mode, the fourth bit sequence and the fifth bit sequence correspond to TBs, indicating superimposed 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 superimposed transmission between bit sequences corresponding to different CBs.

[0294] In some embodiments, the fifth indication information may be carried in the mode field. For details, please refer to the carrying method of the second indication information in step 503 in Figure 5a, which will not be repeated here.

[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 results of other superposition bit sequences or the decoded soft information to obtain a fourth bit sequence and a fifth bit sequence.

[0296] The other superimposed bit sequences include at least the superimposed bit sequence of the fourth bit sequence or the fifth bit sequence.

[0297] The superimposed bit sequence of the fourth bit sequence or the fifth bit sequence can be understood as the superimposed bit sequence obtained by superimposing the fourth bit sequence or the fifth bit sequence and other bit sequences. The superimposed bit sequence can be understood as the initial transmission of the fourth bit sequence or the fifth bit sequence. The network device can decode the sixth bit sequence in combination with the decoding results of other superimposed bit sequences, or decode the sixth bit sequence in combination with the soft information after decoding of other superimposed bit sequences, which can achieve the equivalent effect of retransmission, thereby not relying on HARQ feedback, improving reliability and spectrum efficiency, and meeting the needs of low-latency services.

[0298] The terminal device receives the fourth indication information indicating the first transmission mechanism from the network device. Therefore, the terminal device needs to perform superposition decoding on the received sixth bit sequence to recover the fourth and fifth bit sequences. The specific superposition decoding method is described in step 504 of FIG. 5 a and is not further described here.

[0299] In the embodiment shown in FIG7 , the first transmission mechanism may also be based on one or more process transmissions:

[0300] In one implementation, in step 703, the first transmission mechanism may be based on one or more processes. For ease of description, the number of processes used in 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 number of processes R used for the first transmission mechanism may be configured by reusing the higher-layer signaling parameter nrofHARQ-ProcessesForPDSCH. Exemplarily, the value of R may be one of the following: 1, 2, 4, 6, 10, 12, or 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, the second process is a process used for the first transmission mechanism. In the case of R=1, the bit sequences corresponding to different CBs may be superimposed (for example, as shown in FIG5b ), or the bit sequences corresponding to different TBs may be superimposed (for example, as shown in FIG5c ). 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 is understandable that each process outputs the superimposed bit sequence. In some implementations, when the value of R is greater than 1, the index value of the TB corresponding to the fourth bit sequence used for superposition and the index value of the TB corresponding to the fifth bit sequence may be discontinuous. For example, the bit sequence corresponding to TB1 and the bit sequence corresponding to TB3 are superimposed to better combat continuous errors.

[0303] Accordingly, the terminal device receiving the sixth bit sequence may instruct the second process to perform superposition decoding on the received sixth bit sequence based on the decoding results of other superimposed bit sequences or the decoded soft information to obtain the fourth bit sequence and the fifth bit sequence. The terminal device uses the process corresponding to the same process ID 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, using R processes out of the P processes for the first transmission mechanism, and using Y processes out of the P processes excluding R processes 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] For example, Y may be equal to PR, that is, all processes in the P processes except the R processes used for the first transmission mechanism are used for the second transmission mechanism (ie, HARQ retransmission mechanism). Y may also be less than PR, which is not limited in this application.

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

[0307] In some embodiments, the network device may indicate which of 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 specific indication methods, please refer to the relevant description in the aforementioned embodiments and will not be repeated here.

[0308] Please refer to Figure 8, which is a flow chart of another sequence processing method provided in an embodiment of the present application. Figure 1 can be a system architecture diagram applicable to the sequence processing method. The execution order of the various steps of the sequence processing method shown in Figure 8 is not limited by the embodiment of the present application. As shown in Figure 8, the sequence processing method of the embodiment of the present application includes but is not limited to the following steps. It can be understood that in some scenarios, some steps of the following steps may be included but not all steps, and this application does not limit them:

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

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

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

[0312] 804. 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 results of other superposition bit sequences or the decoded soft information to obtain a fourth bit sequence and a fifth bit sequence.

[0313] For steps 801 to 804 in the embodiment of this application, please refer to the description of steps 701 to 704 in the embodiment of Figure 7, which will not be repeated here.

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

[0315] If the network device determines to use the second transmission mechanism for transmission and sends fourth indication information to the terminal device indicating 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, bit sequence superposition is not required. For details, please refer to the relevant description of step 605 in the embodiment of Figure 6, and will not be repeated here.

[0316] 806. When the fourth indication information indicates the second transmission mechanism, the terminal device outputs the received fourth bit sequence or 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 may output the received fourth bit sequence or fifth bit sequence without superposition decoding for the received bit sequence, and determine whether to transmit an ACK or NACK to the terminal device. Due to channel influences, the bit sequence sent by the terminal device may differ from the bit sequence received by the network device. For ease of description, this application uses the same name for both.

[0318] The following describes a communication device according to an embodiment of the present application.

[0319] The present application divides the functional modules of the communication device according to the above-mentioned method embodiment. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above-mentioned integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in this application is schematic and is only a logical functional division. There may be other division methods in actual implementation. The communication device of the embodiment of the present application will be described in detail below with reference to Figures 9 to 11.

[0320] FIG9 is a schematic structural diagram of a communication device provided in an embodiment of the present application. As shown in FIG9 , the communication device 1000 may implement the functions or steps implemented by the network device or the terminal device in the above-mentioned various method embodiments.

[0321] In some possible implementations, the communication device 1000 can implement the behaviors and functions of the terminal device in the above-described method embodiments. For example, the communication device 1000 can be a terminal device, or a component (e.g., a chip or circuit) used in the terminal device. The transceiver unit 1100 can, for example, be used to perform all receiving or transmitting operations performed by the terminal device in the above-described method embodiments. The processing unit 1200 is used to perform all operations performed by the terminal device except for the transmitting and receiving operations.

[0322] In one 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; and output a third bit sequence when the first indication information indicates a first transmission mechanism; 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, 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, and includes:

[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 of 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 of the first bit sequence and the i-th bit of the second bit sequence after interleaving;

[0330] The i is an integer greater than or equal to 1 and less than or equal to the N or the 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 coding 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, where 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 the first mode, the first bit sequence and the second bit sequence correspond to TB;

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

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

[0339] Exemplarily, the M processes are processes used for the first transmission mechanism among the 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] The Z processes other than the M processes among the Q processes are processes used for the second transmission mechanism, where 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 used for the first transmission mechanism; the transceiver unit 1100 is specifically used to instruct the first process to output a third bit sequence when the first indication information indicates that the first process is used for the first transmission mechanism.

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

[0343] Exemplarily, 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 discontinuous.

[0344] The specific description and beneficial effects of the device embodiment shown in FIG9 can be referred to the description of the aforementioned method embodiment, which will not be repeated here.

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

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

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

[0348] Illustratively, 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, 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, and includes:

[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 of 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 of the fourth bit sequence and the i-th bit of the fifth bit sequence after interleaving;

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

[0354] Exemplarily, the transceiver unit 1100 is further configured 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 a third transport block TB, and the fifth bit sequence corresponds to a fourth TB; or,

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

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

[0358] Exemplarily, the transceiver unit 1100 is further configured to send 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.

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

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

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

[0362] Exemplarily, the R processes are processes used 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 in the P processes are processes used for the second transmission mechanism, and the Y is an integer less than or equal to the P and greater than or equal to 0.

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

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

[0366] Exemplarily, the fourth indication information further indicates the Y processes used 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 discontinuous.

[0368] The specific description and beneficial effects of the device embodiment shown in FIG9 can be referred to the description of the aforementioned method embodiment, which will not be repeated here.

[0369] The above describes the terminal device and network device of the embodiments of the present application. The following describes possible product forms of the terminal device and the network device. It should be understood that any product in any form that has the functions of the terminal device described in Figure 9 above, or any product in any form that has the functions of the network device described in Figure 9 above, falls within the scope of protection of the embodiments of the present application. It should also be understood that the following description is for illustrative purposes only and does not limit the product forms of the network device and terminal device of the embodiments of the present application to these examples.

[0370] In one possible implementation, in the communication device shown in FIG9 , the processing unit 1200 may be one or more processors, the transceiver unit 1100 may be a transceiver, or the transceiver unit 1100 may be a transmitting unit and a receiving unit, the transmitting unit may be a transmitter, the receiving unit may be a receiver, and the transmitting unit and the receiving unit are integrated into a single device, such as a transceiver. In the embodiment of the present application, the processor and the transceiver may be coupled, etc., and the embodiment of the present application does not limit the connection method between the processor and the transceiver.

[0371] Figure 10 is a schematic diagram of the structure of another communication device 2000 provided in an embodiment of the present application. The communication device in Figure 10 can be the above-mentioned terminal device or the above-mentioned network device.

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

[0373] In various implementations of the communication device shown in FIG10 , the transceiver may include a receiver and a transmitter, wherein the receiver is configured to perform a receiving function (or operation) and the transmitter is configured to perform a transmitting function (or operation). The transceiver is configured to communicate with other devices / apparatuses via 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 memories 2300 are coupled to the processor 2200. 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, and is used for information exchange between the devices, units, or modules. The processor 2200 may operate in conjunction with the memories 2300. The processor 2200 may execute program instructions stored in the memories 2300.

[0375] The specific connection medium between the transceiver 2100, processor 2200, and memory 2300 is not limited in the embodiments of the present application. In Figure 10, the embodiment of the present application shows that the transceiver 2100, processor 2200, and memory 2300 are connected via bus 2400. The bus is represented by a bold line in Figure 10. The connection methods between other components are only for schematic illustration and are not limiting. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, Figure 10 only uses a single bold line, but this does not mean that there is only one bus or only one type of bus.

[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 device, a discrete gate or transistor logic device, a discrete hardware component, etc., and may 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 methods disclosed in the embodiments of the present application may be directly implemented as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor, etc.

[0377] In the embodiment of the present application, memory may include but is not limited to non-volatile memories such as hard disk drive (HDD) or solid-state drive (SSD), random access memory (RAM), erasable programmable read-only memory (EPROM), read-only memory (ROM) or portable read-only memory (CD-ROM), etc. 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 embodiment of the present application can also be a circuit or other arbitrarily capable of realizing a storage function, for storing program instructions and / or data.

[0378] The processor 2200 is primarily used to process communication protocols and communication data, control the entire communication device, execute software programs, and process software program data. The memory 2300 is primarily used to store software programs and data. The transceiver 2100 may include a control circuit and an antenna. The control circuit is primarily used to convert baseband signals into radio frequency signals and process radio frequency signals. The antenna is primarily used to transmit and receive radio frequency signals in the form of electromagnetic waves. Input and output devices, such as a touch screen, display, and keyboard, are primarily used to receive user input and output data to the user.

[0379] When the communication device is turned 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 sent wirelessly, the processor 2200 performs baseband processing on the data to be sent and outputs the 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 to the outside 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 RF circuit and antenna may be provided independently of the processor performing baseband processing. For example, in a distributed scenario, the RF circuit and antenna may be remotely arranged independent of the communication device.

[0381] It is understood that the communication device shown in the embodiment of the present application may also have more components than those in Figure 10, and the embodiment of the present application is not limited to this. The method performed by the processor and transceiver shown above is only an example. For the specific steps performed by the processor and transceiver, please refer to the method described above.

[0382] In another possible implementation, in the communication device shown in FIG9 , the processing unit 1200 may be one or more logic circuits, and the transceiver unit 1100 may be an input / output interface, or may be called a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiver unit 1100 may also be a sending unit and a receiving unit, the sending unit may be an output interface, the receiving unit may be an input interface, and the sending unit and the receiving unit are integrated into one unit, such as an input / output interface. As shown in FIG11 , the communication device shown in FIG11 includes a logic circuit 3001 and an interface 3002. That is, the above-mentioned processing unit 1200 can be implemented using a logic circuit 3001, and the transceiver unit 1100 can be implemented using an interface 3002. 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. For example, FIG11 is illustrated using the above-mentioned communication device as a chip, and the chip includes a logic circuit 3001 and an interface 3002.

[0383] In the embodiment of the present application, the logic circuit and the interface may also be coupled to each other. The embodiment of the present application does not limit the specific connection method between the logic circuit and the interface.

[0384] It can be understood that the communication device shown in the embodiment of the present application can implement the method provided in the embodiment of the present application in the form of hardware, or can implement the method provided in the embodiment of the present application in the form of software, etc., and the embodiment of the present application is not limited to this.

[0385] An embodiment of the present application also provides a wireless communication system, which includes a network device and a terminal device. The network device and the terminal device can be used to execute the method in any of the aforementioned embodiments.

[0386] In addition, the present application also provides a computer-readable storage medium, which stores computer code. When the computer code runs on a computer, the computer executes the operations and / or processing performed 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 computer program. When the computer code or computer program runs on a computer, the operations and / or processing performed by the network device and the terminal device in the method provided by the present application are executed.

[0388] In the several embodiments provided in this 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 only schematic. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, or can be electrical, mechanical or other forms of connection.

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

[0390] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0391] If the 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 this understanding, the technical solution of the present application is essentially or the contributing part, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a readable storage medium, including a number of instructions for enabling 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 method described in each embodiment of the present application. The aforementioned readable storage medium includes: various media that can store program codes, 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 disk.

[0392] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

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 after interleaving 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 and the i-th bit after interleaving the second bit sequence; 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, the second indication information indicating 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 to 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, the first process being one of M processes, and M being 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 fourth bit sequence after interleaving 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 fifth bit sequence after interleaving; 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, characterized in that, 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, wherein The R processes are the processes among the P processes that are used for 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 used for 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 used for 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 used for 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 further indicates the Y processes used for 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, Comprising a unit for executing the method according to any one of claims 1-12, or comprising a unit for executing the method according to any one of claims 13-24.

26. A communication device, characterized in that, Comprising a processor, where 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.

28. A computer program product, characterized in that, Comprising a computer program or code, when the computer program or code runs on a computer, causing the method according to any one of claims 1-12 to be executed, or causing the method according to any one of claims 13-24 to be executed.

29. A computer program, characterized in that, When the computer program runs on a computer, causing the method according to any one of claims 1-12 to be executed, or causing the method according to any one of claims 13-24 to be executed.

Images