Communication method and apparatus

Abstract

Embodiments of the present application provide a communication method and device, which are applied to the technical field of communication. The method comprises: performing processing on a first transport block (TB) according to a target check code appending mode in a plurality of check code appending modes to obtain first data, the first data containing M code blocks (CBs), wherein M is a positive integer; generating at least one code word according to the M CBs; and transmitting the at least one code word. A communication system, a computer readable storage medium and a computer program are also provided accordingly. Through the embodiments of the present application, the transmission performance can be improved, and the efficiency of data transmission can be improved.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to communication methods and apparatus. Background Technology

[0002] With the continuous development of global communication technologies, the development and application of wireless communication technology are booming. Intelligent transportation equipment, smart home devices, robots, and other intelligent terminals based on wireless communication technology are gradually entering people's daily lives. Wireless communication technology is widely used in terminals due to its advantages such as convenient connection, good scalability, and ease of maintenance. Taking intelligent transportation equipment as an example, vehicle-mounted wireless communication can further reduce the number, length, and weight of wiring harnesses in the vehicle, as well as the corresponding installation, maintenance, and repair costs. This makes vehicle-mounted communication technology gradually trend towards wireless development.

[0003] As applications diversify, the number and types of nodes within vehicles are increasing, placing higher demands on in-vehicle communication capabilities. For example, to improve the reliability of in-vehicle communication, the transmitting end needs to add Cyclic Redundancy Check (CRC) to the data, and the receiving end uses the CRC to determine whether it has accurately received the data sent by the transmitting end.

[0004] In current communication systems, a transport block (TB) is divided into multiple code blocks (CBs) when transmitting data, and each CB contains a CRC (Corrective Chronology). The receiver can verify the correctness of each CB based on its CRC, allowing the sender to retransmit only the erroneous CBs. This improves data reliability and reduces the amount of data retransmitted. However, this method of including a CRC in each CB increases the proportion of CRC in the transmitted bits, reducing the transmission rate and impacting transmission performance. Especially in applications with low reliability requirements, or for applications that only require verifying the correctness of the transport block, or for certain broadcast / multicast channels, adding a CRC to each CB does not provide additional reliability benefits; instead, it reduces data transmission efficiency, increases latency, and negatively impacts transmission performance. Summary of the Invention

[0005] This application provides a communication method and apparatus that can improve transmission performance and increase data transmission efficiency.

[0006] In a first aspect, embodiments of this application provide a communication method, including: Based on the target checksum appending method among multiple checksum appending methods, the first TB is processed to obtain the first data, the first data containing M checksum appending methods, the multiple checksum appending methods being predefined or configured, where M is a positive integer; Generate at least one codeword based on the M coded blocks; Send at least one codeword.

[0007] In this context, a code block can refer to the data or data sequence input to the encoder. A codeword can refer to the data after it has passed through the encoder. The code length can refer to the length of the codeword (or the length of the data output by the encoder).

[0008] Based on the above, a target checksum method can be determined from multiple checksum addition methods, and checksums are added to the TB (and / or a portion of the data in the TB) based on the target checksum method. Because the checksum addition method can be flexibly determined, a checksum addition method suitable for the current scenario (or channel type, transmitted message type, or code rate, etc.) can be selected for different transmission scenarios (or channel type, transmitted message type, or code rate, etc.), thereby improving transmission performance.

[0009] For example, when using a broadcast channel to transmit data or send broadcast information, the code block may not contain a checksum, thereby increasing the code rate, improving data transmission efficiency, and reducing latency.

[0010] For example, when the channel quality is good, the coded block may not contain a checksum, thus improving the efficiency of data transmission.

[0011] For example, in some scenarios, checksums can be added to transport blocks. Some sub-data can be appended with checksums separately, while other sub-data can be appended with a single checksum. This improves the flexibility of adding checksums and increases the efficiency of data transmission.

[0012] Optionally, this method is applicable to any communication node with communication capabilities, such as the sending node.

[0013] In one possible implementation of the first aspect, the method described above is implemented at the physical layer of wireless communication. The physical layer is implemented on the underlying hardware device, which has strong processing capabilities and can perform various operations faster. Therefore, processing the additional checksum at the physical layer can reduce the time overhead of calculating the checksum, improve data transmission efficiency, and reduce latency.

[0014] In one possible implementation of the first aspect, the method further includes: sending first indication information, the first indication information being used to indicate a target checksum appending method among the plurality of checksum appending methods. In this implementation, the sending node may send the first indication information to indicate to the receiving side which checksum appending method to use. In this case, the sending node can flexibly determine the applicable checksum appending method from among the plurality of checksum appending methods and indicate it to the receiving side through the indication information.

[0015] Optionally, the first indication information can be sent when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is transmitted.

[0016] Alternatively, the first and second nodes may negotiate the method of appending the checksum during the connection establishment process. Or, the first or second node may notify the other end of the appropriate checksum appending method via a first indication message.

[0017] In another possible implementation of the first aspect, the first indication information is sent via signaling. This signaling may include, for example, one or more of the following: broadcast information, system messages, higher-layer configuration signaling, media access control layer signaling, etc.

[0018] In another possible implementation of the first aspect, the first indication information is carried in the header of the frame. The frame is a transmission unit, and the frame header, also called the frame header, may contain one or more fields. Specifically, the first indication information can be transmitted through the fields in the frame header. In this implementation, the first indication information is included in the frame header, and the receiving end can determine the target checksum appending method based on the frame header.

[0019] In one design, the first indication information can be used to indicate the checksum appending method used in the data portion of a frame, and the target checksum appending method used in any frame can be flexibly set, further improving flexibility.

[0020] In another possible implementation of the first aspect, the target checksum appending method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, node communication capability, or code rate, etc. The node's communication capability (also referred to as the node's ability) may include one or more of the following aspects: the checksum appending methods supported by the node, the node's checksum capability, and indication information for the above aspects. In this way, a target checksum appending method suitable for the current communication conditions can be determined, improving transmission efficiency.

[0021] For example, the first and second nodes can negotiate the method of appending the checksum during the connection establishment process. Alternatively, the sending or receiving end can notify the other end of the checksum appending method to be used during each communication.

[0022] In another possible implementation of the first aspect, the target checksum appending method is one of the plurality of checksum appending methods supported by the receiving end. In one design, the receiving end can provide feedback to the sending end on the checksum appending methods it supports, and the sending end determines the target checksum appending method from the checksum appending methods supported by the receiving end.

[0023] In another possible implementation of the first aspect, the correspondence is predefined, preconfigured, or negotiated.

[0024] In yet another possible implementation of the first aspect, the target check code appending method is the first check code appending method among the plurality of check code appending methods; The first TB and the first cyclic redundancy check (CRC) together correspond to N sub-data, where the first CRC is the CRC corresponding to the first TB, and N is a positive integer. The M CBs include M1 first CBs, each first CB contains a sub-data and a second CRC, the second CRC is the CRC corresponding to the sub-data, and M1≥0; The M CBs include M2 ​​second CBs, the M2 second CBs correspond to N1 sub-data and a third CRC, the third CRC is the CRC that the N1 sub-data all correspond to, M2≥0, N1≥0.

[0025] In the above implementation, some sub-data includes a separate CRC, while other sub-data (together) correspond to a third CRC. This reduces the computational load of the checksum and also lowers the proportion of the checksum in the transmitted bits, thus improving transmission efficiency.

[0026] In yet another possible implementation of the first aspect, the code length corresponding to the first CB belongs to the first code length; The code length corresponding to the second CB belongs to the second code length, and the first code length and the second code length are different.

[0027] In the above implementation, each CB contains a CRC; a CB of a partial code length corresponds to a CRC.

[0028] In yet another possible implementation of the first aspect, M2 + N1 = N.

[0029] In another possible implementation of the first aspect, the M CBs include M3 third CBs, the M3 third CBs correspond to M3 sub-data, the third CBs do not contain CRC, M3≥0, N2≥0.

[0030] In yet another possible implementation of the first aspect, the target check code appending method is the second check code appending method among the plurality of check code appending methods; The first TB and the first CRC together correspond to the M CBs, and the first CRC is the CRC corresponding to the first TB.

[0031] In the above method, a CRC is appended to the TB block, and the CB obtained by dividing the TB block does not contain a separate CRC. In some scenarios (such as scenarios with high signal-to-noise ratio, or where the receiver does not support CB or CBG feedback, etc.), it is not necessary to include a CRC in each CB to check whether the CRC of each CB passes. Instead, it is sufficient to check whether the first TB is transmitted correctly by the first CRC. In this case, the bit rate can be increased, improving transmission efficiency.

[0032] In yet another possible implementation of the first aspect, the target check code appending method is the third check code appending method among the plurality of check code appending methods; The first TB and the first CRC of the first TB together correspond to M sub-data, where the first CRC is the CRC corresponding to the first TB, and: Each of the M CBs contains a sub-data and a second CRC, where the second CRC is the CRC corresponding to the sub-data.

[0033] In the above method, each CB contains a separate CRC, and each TB block also has an attached CRC. The receiver can verify whether each CB has been received correctly based on the CRC of each CB, so that the sender can only retransmit the CB that has erroneous, reducing the system overhead in retransmission scenarios, improving data transmission efficiency, and enhancing transmission performance.

[0034] In another possible implementation of the first aspect, processing is performed on the first TB to obtain the first data according to a target checksum appending method among a plurality of checksum appending methods, including: Based on the target checksum appending method among multiple checksum appending methods, the first CRC is appended to the first TB to obtain the TB with checksum; According to the target segmentation method among multiple segmentation methods, the TB with checksum is segmented to obtain the M CBs.

[0035] Optionally, the multiple checksum appending methods can be predefined and preconfigured. For example, multiple checksum appending methods can be defined through a protocol. Alternatively, multiple checksum appending methods can be written into the node at the factory. Or, multiple checksum appending methods can be configured in the node through a communication interface. In the above embodiments, the transmitting end supports multiple TB block segmentation methods. When segmenting a transport block, a target segmentation method can be determined from multiple segmentation methods, and the TB is segmented based on the target segmentation method. Because the segmentation method can be flexibly determined, a segmentation method suitable for the current scenario can be determined in different transmission scenarios, thereby improving transmission performance.

[0036] In another possible implementation of the first aspect, the segmentation operation described above is implemented at the physical layer of wireless communication. Segmentation at the physical layer can reduce the time overhead of calculating check codes, improve data transmission efficiency, and reduce latency.

[0037] In yet another possible implementation of the first aspect, the target segmentation method is a first segmentation method among a plurality of segmentation methods; The M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0038] The above example illustrates one possible segmentation method. Multiple block lengths (CBs) can be obtained from a TB block, and these CBs must include the block with the smallest code length. In this way, the receiver can decode multiple CBs in a pipelined manner, resulting in low decoding latency. Pipeline decoding means that while the decoding module is completing the decoding of the previous CB, the next CB is already ready for decoding. For example, if the CB code lengths include 128 and 64, the 64-code-length CB has finer granularity and is more flexible in decoding time. The receiver decodes the 128-code-length CB, and after the 128-code-length CB is decoded, the decoding module can immediately proceed to decode the 64-code-length CB, improving decoding efficiency and reducing latency. If the CB code lengths include 256 and 64, it is possible that the 64-code-length data is received, but the 256-code-length data is not yet decoded, requiring waiting for the 256-code-length data to be decoded before the 64-code-length data can be decoded.

[0039] In yet another possible implementation of the first aspect, the target segmentation method is the second segmentation method among a plurality of segmentation methods; The M code blocks do not necessarily include a third code block. The code length corresponding to the third code block is the minimum code length among a plurality of predefined code lengths.

[0040] For example, if we take multiple predefined code lengths {1024, 512, 256, 128, 64} as an example, then among the M CBs, there may be a CB with a corresponding code length of 64, or there may be no CB with a corresponding code length of 64.

[0041] In one possible implementation, the code length of any one of the M code blocks is higher than the minimum code length among a set of predefined code lengths.

[0042] In one possible implementation, the code length corresponding to the M CBs is related to the length of the TB. For example, if the data length of the first TB belongs to the first data length, the code length corresponding to any one of the M CBs is higher than the lowest code length among a plurality of predefined code lengths; If the data length of the first TB belongs to the second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a predefined plurality of code lengths. The first data length can contain at least one data, multiple data lengths, or a range of data lengths. Similarly, the second data length can contain at least one data, multiple data lengths, or a range of data lengths.

[0043] The above example illustrates another possible segmentation method. The resulting checksum blocks (CBs) may all have relatively long code lengths (not necessarily including the lowest code length block). For a TB block of the same length, fewer checksum blocks can be obtained. This can reduce the time consumed in calculating the checksum, increase the code rate, and improve the efficiency of data transmission.

[0044] In yet another possible implementation of the first aspect, the method further includes: A second indication message is sent, which indicates the target segmentation method among multiple segmentation methods. In this embodiment, the sending node can send the second indication message to indicate to the receiving side which segmentation method to use. At this time, the sending node can flexibly determine the applicable segmentation method from multiple segmentation methods and indicate it to the receiving end through the indication message.

[0045] Optionally, the second indication information can be sent when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is transmitted.

[0046] Optionally, the first indication information and the second indication information can be the same indication information. For example, there is a correspondence between the checksum appending method and the segmentation method. When using the first checksum appending method, the first segmentation method is also used. In this case, the first indication information can indicate the first checksum appending method, and thus can also indicate the first segmentation method.

[0047] In another possible implementation of the first aspect, the second indication information is sent via signaling. This signaling may include, for example, one or more of the following: broadcast information, system messages, higher-layer configuration signaling, media access control layer signaling, etc.

[0048] In another possible implementation of the first aspect, the second indication information is carried in the header of a frame, which is a transmission unit. Optionally, the second indication information can be transmitted through fields in the frame header.

[0049] In this implementation, the target segmentation method is indicated by the header of the transmission unit. This allows for flexible setting of the segmentation method used by any transmission unit, further enhancing flexibility. Furthermore, using the header of the transmission unit as an indicator allows the receiving side to determine the segmentation method based on the header, reducing signaling overhead and improving communication efficiency.

[0050] In another possible implementation of the first aspect, the code length corresponding to the CB The following equations must be satisfied: .

[0051] By ensuring the code length of the coded block is a power of 2, it is possible to directly transmit or receive codewords encoded from the coded block at a given code rate without requiring an additional rate matching module. This simplifies the encoding / decoding process and reduces system power consumption. In one design, the above implementation is based on Polar codes. By ensuring the code length of the coded block is a power of 2, the system design for Polar code encoding / decoding can be effectively simplified, thereby reducing the system power consumption for Polar code encoding / decoding.

[0052] In another possible implementation of the first aspect, the code length corresponding to the CB belongs to one or more predefined code lengths, the predefined code lengths including at least one of 1024, 512, 256, 128 or 64.

[0053] The predefined code length satisfies the form of a positive integer power of 2, which can simplify the encoding / decoding process and reduce system power consumption.

[0054] Secondly, embodiments of this application provide a communication method, including: Receive at least one codeword; Processing is performed on the at least one codeword according to the target checksum appending method among multiple checksum appending methods to obtain the information of the first TB, wherein the multiple checksum appending methods are predefined or configured.

[0055] Optionally, this method is applicable to any communication node with communication capabilities, such as a receiving node.

[0056] In one possible implementation of the second aspect, the above method is implemented at the object layer of wireless communication.

[0057] In another possible implementation of the second aspect, the information of the first TB includes one or more of the following: The first TB, the verification result of the first TB, the sub-data corresponding to at least one CB, the verification result of at least one CB, the sub-data corresponding to at least one code block group (CBG), or the verification result of at least one CBG.

[0058] In yet another possible implementation of the second aspect, the method further includes: Receive first indication information, which is used to indicate the target check code appending method among the plurality of check code appending methods.

[0059] In another possible implementation of the second aspect, the method further includes receiving first indication information by receiving signaling.

[0060] In another possible implementation of the second aspect, the first indication information is carried in the header of the frame. The frame is a transmission unit, and the frame header, also called the frame header, may contain one or more fields. Specifically, the first indication information can be transmitted through the fields in the frame header.

[0061] In another possible implementation of the second aspect, the target checksum appending method corresponds to one or more of the following information: Communication channel type, communication scenario type, channel quality indicator, node communication capability, or code rate, etc.

[0062] In another possible implementation of the second aspect, the correspondence is predefined, preconfigured, or negotiated.

[0063] In another possible implementation of the second aspect, the target checksum appending method is one of the plurality of checksum appending methods supported by the receiving end. In one design, the receiving end can report the checksum appending methods it supports to the sending end, and the sending end determines the target checksum appending method from the checksum appending methods supported by the receiving end.

[0064] In another possible implementation of the second aspect, the step of processing the at least one codeword according to a target checksum appending method among a plurality of checksum appending methods to obtain information of the first TB includes: M CBs are obtained based on the at least one codeword, where M is a positive integer; The M CBs are verified according to the target checksum appending method among multiple checksum appending methods to obtain the information of the first TB.

[0065] In another possible implementation of the second aspect, the first TB and the first cyclic redundancy check (CRC) together correspond to N sub-data, where the first CRC is the CRC corresponding to the first TB, and N is a positive integer. in: The M CBs include M1 first CBs, each first CB contains a sub-data and a first CRC, the first CRC corresponds to the sub-data, and M1≥0; The M CBs include M2 ​​second CBs, the M2 second CBs correspond to N1 sub-data and a third CRC, the third CRC is the CRC that the N1 sub-data all correspond to, M2≥0, N1≥0.

[0066] In another possible implementation of the second aspect, the step of verifying the M CBs according to the target checksum appending method among multiple checksum appending methods to obtain the information of the first TB includes: For the M1 first CBs, the sub-data corresponding to the first CB is verified to be transmitted correctly based on the second CRC contained in each first CB; For the M2 second CBs, the N1 sub-data are verified to ensure they are transmitted correctly according to the third CRC.

[0067] In yet another possible implementation of the second aspect, the method further includes: When the M1 sub-data corresponding to the M1 first CBs are transmitted correctly and the N1 sub-datas are transmitted correctly, a first TB with a checksum is obtained based on the M1 sub-datas and the N1 sub-datas. The first TB with a checksum includes the first TB and the first CRC. The first TB is verified based on the first CRC, and the first TB or the verification result of the first TB is obtained.

[0068] In another possible implementation of the second aspect, the code length corresponding to the first CB belongs to the first code length; The code length corresponding to the second CB belongs to the second code length, and the first code length and the second code length are different.

[0069] In another possible implementation of the second aspect, M2 + N1 = N.

[0070] In another possible implementation of the second aspect, the M CBs include M3 third CBs, the M3 third CBs correspond to N2 sub-data, the third CBs do not contain CRC, M3≥0, N2≥0.

[0071] In another possible implementation of the second aspect, the first TB and the first CRC jointly correspond to the M CBs, and the first CRC is the CRC corresponding to the first TB.

[0072] In another possible implementation of the second aspect, the step of verifying the M CBs according to the target checksum appending method among multiple checksum appending methods to obtain the information of the first TB includes: Based on the M CBs, a first TB with a checksum is obtained, wherein the first TB with a checksum includes the first TB and the first CRC; The first TB is verified based on the first CRC, and the first TB or the verification result of the first TB is obtained.

[0073] In another possible implementation of the second aspect, the first TB and the first cyclic redundancy check (CRC) of the first TB together correspond to M sub-data, wherein: Each CB contains a sub-data and a second CRC corresponding to the sub-data.

[0074] In another possible implementation of the second aspect, the step of verifying the M CBs according to the target checksum appending method among multiple checksum appending methods to obtain the information of the first TB includes: For the M CBs, the sub-data contained in each CB is checked for correct transmission based on the second CRC contained in each CB; When the M sub-data are transmitted correctly, a first TB with a checksum is obtained based on the M sub-data, wherein the first TB with a checksum includes the first TB and the first CRC; The first TB is verified based on the first CRC, and the first TB or the verification result of the first TB is obtained.

[0075] In another possible implementation of the second aspect, the M CBs are obtained based on a target segmentation method among multiple segmentation methods.

[0076] In yet another possible implementation of the second aspect, the target segmentation method is the first segmentation method among a plurality of segmentation methods; The M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0077] In yet another possible implementation of the second aspect, the target segmentation method is the second segmentation method among a plurality of segmentation methods; The M code blocks do not necessarily include a third code block. The code length corresponding to the third code block is the minimum code length among a plurality of predefined code lengths.

[0078] For example, if we take multiple predefined code lengths {1024, 512, 256, 128, 64} as an example, then among the M CBs, there may be a CB with a corresponding code length of 64, or there may be no CB with a corresponding code length of 64.

[0079] In one possible implementation, the code length of any one of the M code blocks is higher than the minimum code length among a set of predefined code lengths.

[0080] In one possible implementation, the code length corresponding to the M CBs is related to the length of the TB. For example, if the data length of the first TB belongs to the first data length, the code length corresponding to any one of the M CBs is higher than the lowest code length among a plurality of predefined code lengths; If the data length of the first TB belongs to the second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0081] In yet another possible implementation of the second aspect, the method further includes: Receive second instruction information, which is used to indicate the target segmentation method among multiple segmentation methods.

[0082] In another possible implementation of the second aspect, the method further includes: receiving the second indication information by receiving signaling.

[0083] In another possible implementation of the second aspect, the second indication information is carried in the header of a frame, which is a transmission unit. Optionally, the second indication information can be transmitted through fields in the frame header.

[0084] In another possible implementation of the second aspect, the code length corresponding to the CB The following equations must be satisfied: .

[0085] In another possible implementation of the second aspect, the code length corresponding to the CB belongs to one or more predefined code lengths, and the predefined code lengths include at least one of 1024, 512, 256, 128 or 64.

[0086] Thirdly, embodiments of this application provide a communication method, including: Based on the target segmentation method among multiple segmentation methods, first data is obtained based on the first TB. The first data contains M CBs. The multiple segmentation methods are predefined or configured, and M is a positive integer. Generate at least one codeword based on the M coded blocks; Send at least one codeword.

[0087] In the above embodiments, the transmitting end supports multiple TB block segmentation methods. When segmenting a transport block, a target segmentation method can be determined from multiple segmentation methods, and the TB is segmented based on the target segmentation method. Because the segmentation method can be flexibly determined, a segmentation method suitable for the current scenario can be determined in different transmission scenarios, thereby improving transmission performance.

[0088] Optionally, this method is applicable to any communication node with communication capabilities, such as the sending node.

[0089] In one possible implementation of the third aspect, the above method is implemented at the object layer of wireless communication.

[0090] In another possible implementation of the third aspect, the target segmentation method is the first segmentation method among a plurality of segmentation methods; The M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0091] In yet another possible implementation of the third aspect, the target segmentation method is the second segmentation method among a plurality of segmentation methods; The M code blocks do not necessarily include a third code block. The code length corresponding to the third code block is the minimum code length among a plurality of predefined code lengths.

[0092] For example, if we take multiple predefined code lengths {1024, 512, 256, 128, 64} as an example, then among the M CBs, there may be a CB with a corresponding code length of 64, or there may be no CB with a corresponding code length of 64.

[0093] In one possible implementation, the code length of any one of the M code blocks is higher than the minimum code length among a set of predefined code lengths.

[0094] In one possible implementation, the code length corresponding to the M CBs is related to the length of the TB. For example, if the data length of the first TB belongs to the first data length, the code length corresponding to any one of the M CBs is higher than the lowest code length among a plurality of predefined code lengths; If the data length of the first TB belongs to the second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0095] In yet another possible implementation of the third aspect, the method further includes: Send a second instruction message, which is used to indicate the target segmentation method among multiple segmentation methods.

[0096] Optionally, the second indication information can be sent when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is transmitted.

[0097] In another possible implementation of the third aspect, the second instruction information is sent via signaling.

[0098] In another possible implementation of the third aspect, the second indication information is carried in the header of a frame, which is a transmission unit. Optionally, the second indication information can be transmitted through fields in the frame header.

[0099] In yet another possible implementation of the third aspect, the code length corresponding to the CB is... The following equations must be satisfied: .

[0100] In another possible implementation of the third aspect, the code length corresponding to the CB belongs to one or more predefined code lengths, and the predefined code lengths include at least one of 1024, 512, 256, 128 or 64.

[0101] In another possible implementation of the third aspect, the target segmentation method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indication, or node communication capabilities, etc. The node's communication capabilities (also referred to as node capabilities) may include one or more of the following aspects: the checksum appending methods supported by the node, the node's checksum capabilities, and indication information for the aforementioned aspects.

[0102] In another possible implementation of the third aspect, the target segmentation method belongs to the segmentation methods supported by the receiving end. In one design, the receiving end can feed back the segmentation methods it supports to the sending end, and the sending end determines the target checksum appending method from the segmentation methods supported by the receiving end.

[0103] In another possible implementation of the third aspect, the correspondence is predefined, preconfigured, or negotiated.

[0104] Fourthly, embodiments of this application provide a communication method, including: Based on the target segmentation method among multiple segmentation methods, the second data is received to obtain at least one codeword, wherein the multiple segmentation methods are predefined or configured; Processing is performed on the at least one codeword to obtain information for the first TB.

[0105] In one possible implementation of the fourth aspect, receiving the second data to obtain at least one codeword according to a target segmentation method among multiple segmentation methods includes: Receive the second data; The at least one codeword is obtained based on the second data according to the target segmentation method in the segmentation method.

[0106] In another possible implementation of the fourth aspect, the at least one codeword corresponds to M CBs.

[0107] In yet another possible implementation of the fourth aspect, the information of the first TB includes one or more of the following: The first TB, the verification result of the first TB, the sub-data corresponding to at least one CB, the verification result of at least one CB, the sub-data corresponding to at least one CBG, or the verification result of at least one CBG.

[0108] In another possible implementation of the fourth aspect, the above method is implemented at the object layer of wireless communication.

[0109] In another possible implementation of the fourth aspect, the M CBs include at least one third CB, the code length of which is the lowest among a plurality of predefined code lengths.

[0110] In another possible implementation of the fourth aspect, among the M CBs, the code length corresponding to any one CB is higher than the lowest code length among a plurality of predefined code lengths.

[0111] In yet another possible implementation of the fourth aspect, the method further includes: Receive second instruction information, which is used to indicate the target segmentation method among multiple segmentation methods.

[0112] Optionally, the second indication information can be received when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is being transmitted.

[0113] In another possible implementation of the fourth aspect, the method further includes: receiving the second indication information by receiving signaling.

[0114] In another possible implementation of the fourth aspect, the second indication information is carried in the header of a frame, which is a transmission unit. Optionally, the second indication information can be transmitted through fields in the frame header.

[0115] In yet another possible implementation of the fourth aspect, the code length corresponding to the CB is... The following equations must be satisfied: .

[0116] In another possible implementation of the fourth aspect, the code length corresponding to the CB belongs to one or more predefined code lengths, and the predefined code lengths include at least one of 1024, 512, 256, 128 or 64.

[0117] In another possible implementation of the fourth aspect, the target segmentation method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, or node communication capability, etc.

[0118] In another possible implementation of the fourth aspect, the target segmentation method belongs to the segmentation methods supported by the receiver. In one design, the receiver can feed back the segmentation methods it supports to the transmitter, and the transmitter determines the target checksum appending method from the segmentation methods supported by the receiver.

[0119] In another possible implementation of the fourth aspect, the correspondence is predefined, preconfigured, or negotiated.

[0120] Fifthly, embodiments of this application provide a communication device, which includes a processing unit and a communication unit, and is used to implement the method described in the first aspect or any possible implementation of the first aspect.

[0121] In one possible implementation of the fifth aspect, the processing unit is configured to: Based on the target checksum appending method among multiple checksum appending methods, the first TB is processed to obtain the first data, the first data containing M checksum appending methods, the multiple checksum appending methods being predefined or configured, and M being a positive integer; Generate at least one codeword based on the M coded blocks; The communication unit is used to send the at least one codeword.

[0122] Optionally, the communication device is a communication node or a component within a communication node.

[0123] In one possible implementation of the fifth aspect, the communication unit is further configured to: send first indication information, the first indication information being used to indicate a target checksum appending method among the plurality of checksum appending methods.

[0124] Optionally, the first indication information can be sent when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is transmitted.

[0125] In one possible implementation of the fifth aspect, the first indication information is sent via signaling.

[0126] In one possible implementation of the fifth aspect, the first indication information is carried in the header of the frame. The frame is a transmission unit, and the frame header, also called the frame header, may contain one or more fields. Specifically, the first indication information can be transmitted through the fields in the frame header.

[0127] In one possible implementation of the fifth aspect, the target check code appending method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, node communication capability, or code rate, etc.

[0128] In one possible implementation of the fifth aspect, the target checksum appending method is one of the plurality of checksum appending methods supported by the receiving end. In one design, the receiving end can provide feedback to the sending end on the checksum appending methods it supports, and the sending end determines the target checksum appending method from the checksum appending methods supported by the receiving end.

[0129] In one possible implementation of the fifth aspect, the correspondence is predefined, preconfigured, or negotiated.

[0130] In one possible implementation of the fifth aspect, the target check code appending method is the first check code appending method among the plurality of check code appending methods; The first TB and the first cyclic redundancy check (CRC) together correspond to N sub-data, where the first CRC is the CRC corresponding to the first TB, and N is a positive integer. The M CBs include M1 first CBs, each first CB contains a sub-data and a second CRC, the second CRC is the CRC corresponding to the sub-data, and M1≥0; The M CBs include M2 ​​second CBs, the M2 second CBs correspond to N1 sub-data and a third CRC, the third CRC is the CRC that the N1 sub-data all correspond to, M2≥0, N1≥0.

[0131] In one possible implementation of the fifth aspect, the code length corresponding to the first CB belongs to the first code length; The code length corresponding to the second CB belongs to the second code length, and the first code length and the second code length are different.

[0132] In one possible implementation of the fifth aspect, M2+N1=N.

[0133] In one possible implementation of the fifth aspect, the M CBs include M3 third CBs, the M3 third CBs correspond to N2 sub-data, the third CBs do not contain CRC, M3≥0, N2≥0.

[0134] In one possible implementation of the fifth aspect, the target check code appending method is the second check code appending method among the plurality of check code appending methods; The first TB and the first CRC together correspond to the M CBs, and the first CRC is the CRC corresponding to the first TB.

[0135] In one possible implementation of the fifth aspect, the target check code appending method is the third check code appending method among the plurality of check code appending methods; The first TB and the first CRC of the first TB together correspond to M sub-data, where the first CRC is the CRC corresponding to the first TB, and: Each of the M CBs contains a sub-data and a second CRC, where the second CRC is the CRC corresponding to the sub-data.

[0136] In one possible implementation of the fifth aspect, the processing unit is further configured to: Based on the target checksum appending method among multiple checksum appending methods, the first CRC is appended to the first TB to obtain the TB with checksum; According to the target segmentation method among multiple segmentation methods, the TB with checksum is segmented to obtain the M CBs.

[0137] In one possible implementation of the fifth aspect, the above segmentation operation is implemented at the object layer of wireless communication.

[0138] In one possible implementation of the fifth aspect, the target segmentation method is the first segmentation method among a plurality of segmentation methods; The M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0139] In one possible implementation of the fifth aspect, the target segmentation method is the second segmentation method among a plurality of segmentation methods; The M code blocks do not necessarily include a third code block. The code length corresponding to the third code block is the minimum code length among a plurality of predefined code lengths.

[0140] For example, if we take multiple predefined code lengths {1024, 512, 256, 128, 64} as an example, then among the M CBs, there may be a CB with a corresponding code length of 64, or there may be no CB with a corresponding code length of 64.

[0141] In one possible implementation, the code length of any one of the M code blocks is higher than the minimum code length among a set of predefined code lengths.

[0142] In one possible implementation, the code length corresponding to the M CBs is related to the length of the TB. For example, if the data length of the first TB belongs to the first data length, the code length corresponding to any one of the M CBs is higher than the lowest code length among a plurality of predefined code lengths; If the data length of the first TB belongs to the second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0143] In one possible implementation of the fifth aspect, the communication unit is further configured to: Send a second instruction message, which is used to indicate the target segmentation method among multiple segmentation methods.

[0144] Optionally, the second indication information can be sent when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is transmitted.

[0145] In one possible implementation of the fifth aspect, the second instruction information is sent via signaling.

[0146] In one possible implementation of the fifth aspect, the second indication information is carried in the header of a frame, which is a transmission unit. Optionally, the second indication information can be transmitted through fields in the frame header.

[0147] In one possible implementation of the fifth aspect, the code length corresponding to the CB is... The following equations must be satisfied: .

[0148] In one possible implementation of the fifth aspect, the code length corresponding to the CB belongs to one or more predefined code lengths, and the predefined code lengths include at least one of 1024, 512, 256, 128 or 64.

[0149] In a sixth aspect, embodiments of this application provide a communication device, which includes a processing unit and a communication unit, and is used to implement the method described in the first aspect or any possible implementation of the first aspect.

[0150] In one possible implementation of the sixth aspect, the communication unit is configured to receive at least one codeword; The processing unit is configured to process the at least one codeword according to a target checksum appending method among multiple checksum appending methods to obtain information of the first TB, wherein the multiple checksum appending methods are predefined or configured.

[0151] Optionally, the communication device is a communication node or a component within a communication node.

[0152] In yet another possible implementation of the sixth aspect, the information of the first TB includes one or more of the following: The first TB, the verification result of the first TB, the sub-data corresponding to at least one CB, the verification result of at least one CB, the sub-data corresponding to at least one CBG, or the verification result of at least one CBG.

[0153] In yet another possible implementation of the sixth aspect, the communication unit is further configured to: Receive first indication information, which is used to indicate the target check code appending method among the plurality of check code appending methods.

[0154] In another possible implementation of the sixth aspect, the communication unit is further configured to: receive first instruction information by receiving signaling.

[0155] In another possible implementation of the sixth aspect, the first indication information is carried in the header of the frame. The frame is a transmission unit, and the frame header, also called the frame header, may contain one or more fields. Specifically, the first indication information can be transmitted through the fields in the frame header.

[0156] In yet another possible implementation of the sixth aspect, the target check code appending method corresponds to one or more of the following information: Communication channel type, communication scenario type, channel quality indicator, node communication capability, or code rate, etc.

[0157] In another possible implementation of the sixth aspect, the correspondence is predefined, preconfigured, or negotiated.

[0158] In another possible implementation of the sixth aspect, the target checksum appending method is one of the plurality of checksum appending methods supported by the receiving end. In one design, the receiving end can provide feedback to the sending end on the checksum appending methods it supports, and the sending end determines the target checksum appending method from the checksum appending methods supported by the receiving end.

[0159] In yet another possible implementation of the sixth aspect, the processing unit is further configured to: M CBs are obtained based on the at least one codeword, where M is a positive integer; The M CBs are verified according to the target checksum appending method among multiple checksum appending methods to obtain the information of the first TB.

[0160] In another possible implementation of the sixth aspect, the first TB and the first cyclic redundancy check (CRC) together correspond to N sub-data, where the first CRC is the CRC corresponding to the first TB, and N is a positive integer. in: The M CBs include M1 first CBs, each first CB contains a sub-data and a first CRC, the first CRC corresponds to the sub-data, and M1≥0; The M CBs include M2 ​​second CBs, the M2 second CBs correspond to N1 sub-data and a third CRC, the third CRC is the CRC that the N1 sub-data all correspond to, M2≥0, N1≥0.

[0161] In yet another possible implementation of the sixth aspect, the processing unit is further configured to: For the M1 first CBs, the sub-data corresponding to the first CB is verified to be transmitted correctly based on the second CRC contained in each first CB; For the M2 second CBs, the N1 sub-data are verified to ensure they are transmitted correctly according to the third CRC.

[0162] In yet another possible implementation of the sixth aspect, the processing unit is further configured to: When the M1 sub-data corresponding to the M1 first CBs are transmitted correctly and the N1 sub-datas are transmitted correctly, a first TB with a checksum is obtained based on the M1 sub-datas and the N1 sub-datas. The first TB with a checksum includes the first TB and the first CRC. The first TB is verified based on the first CRC, and the first TB or the verification result of the first TB is obtained.

[0163] In yet another possible implementation of the sixth aspect, the code length corresponding to the first CB belongs to the first code length; The code length corresponding to the second CB belongs to the second code length, and the first code length and the second code length are different.

[0164] In another possible implementation of the sixth aspect, M2+N1=N.

[0165] In another possible implementation of the sixth aspect, the M CBs include M3 third CBs, the M3 third CBs correspond to N2 sub-data, the third CBs do not contain CRC, M3≥0, N2≥0.

[0166] In another possible implementation of the sixth aspect, the first TB and the first CRC jointly correspond to the M CBs, and the first CRC is the CRC corresponding to the first TB.

[0167] In yet another possible implementation of the sixth aspect, the processing unit is further configured to: Based on the M CBs, a first TB with a checksum is obtained, wherein the first TB with a checksum includes the first TB and the first CRC; The first TB is verified based on the first CRC, and the first TB or the verification result of the first TB is obtained.

[0168] In another possible implementation of the sixth aspect, the first TB and the first cyclic redundancy check (CRC) of the first TB together correspond to M sub-data, wherein: Each CB contains a sub-data and a second CRC corresponding to the sub-data.

[0169] In yet another possible implementation of the sixth aspect, the processing unit is further configured to: For the M CBs, the sub-data contained in each CB is checked for correct transmission based on the second CRC contained in each CB; When the M sub-data are transmitted correctly, a first TB with a checksum is obtained based on the M sub-data, wherein the first TB with a checksum includes the first TB and the first CRC; The first TB is verified based on the first CRC, and the first TB or the verification result of the first TB is obtained.

[0170] In another possible implementation of the sixth aspect, the M CBs are obtained based on a target segmentation method among multiple segmentation methods.

[0171] In another possible implementation of the sixth aspect, the target segmentation method is the first segmentation method among a plurality of segmentation methods; The M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0172] In yet another possible implementation of the sixth aspect, the target segmentation method is the second segmentation method among a plurality of segmentation methods; The M code blocks do not necessarily include a third code block. The code length corresponding to the third code block is the minimum code length among a plurality of predefined code lengths.

[0173] For example, if we take multiple predefined code lengths {1024, 512, 256, 128, 64} as an example, then among the M CBs, there may be a CB with a corresponding code length of 64, or there may be no CB with a corresponding code length of 64.

[0174] In one possible implementation, the code length of any one of the M code blocks is higher than the minimum code length among a set of predefined code lengths.

[0175] In one possible implementation, the code length corresponding to the M CBs is related to the length of the TB. For example, if the data length of the first TB belongs to the first data length, the code length corresponding to any one of the M CBs is higher than the lowest code length among a plurality of predefined code lengths; If the data length of the first TB belongs to the second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0176] In yet another possible implementation of the sixth aspect, the communication unit is further configured to: Receive second instruction information, which is used to indicate the target segmentation method among multiple segmentation methods.

[0177] In another possible implementation of the sixth aspect, the communication unit is further configured to: receive the second indication information by receiving signaling.

[0178] In another possible implementation of the sixth aspect, the second indication information is carried in the header of a frame, which is a transmission unit. Optionally, the second indication information can be transmitted through fields in the frame header.

[0179] In yet another possible implementation of the sixth aspect, the code length corresponding to the CB is... The following equations must be satisfied: .

[0180] In another possible implementation of the sixth aspect, the code length corresponding to the CB belongs to one or more predefined code lengths, the predefined code lengths including at least one of 1024, 512, 256, 128 or 64.

[0181] In a seventh aspect, embodiments of this application provide a communication device, which includes a processing unit and a communication unit, and is used to implement the method described in the first aspect or any possible implementation of the first aspect.

[0182] In one possible implementation of the seventh aspect, the processing unit is configured to: Based on the target segmentation method among multiple segmentation methods, first data is obtained based on the first TB. The first data contains M CBs. The multiple segmentation methods are predefined or configured, and M is a positive integer. Generate at least one codeword based on the M coded blocks; The communication unit is used to send the at least one codeword.

[0183] Optionally, the communication device is a communication node or a component within a communication node.

[0184] In yet another possible implementation of the seventh aspect, the above method is implemented at the object layer of wireless communication.

[0185] In another possible implementation of the seventh aspect, the target segmentation method is the first segmentation method among a plurality of segmentation methods; The M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0186] In yet another possible implementation of the seventh aspect, the target segmentation method is the second segmentation method among a plurality of segmentation methods; The M code blocks do not necessarily include a third code block. The code length corresponding to the third code block is the minimum code length among a plurality of predefined code lengths.

[0187] For example, if we take multiple predefined code lengths {1024, 512, 256, 128, 64} as an example, then among the M CBs, there may be a CB with a corresponding code length of 64, or there may be no CB with a corresponding code length of 64.

[0188] In one possible implementation, the code length of any one of the M code blocks is higher than the minimum code length among a set of predefined code lengths.

[0189] In one possible implementation, the code length corresponding to the M CBs is related to the length of the TB. For example, if the data length of the first TB belongs to the first data length, the code length corresponding to any one of the M CBs is higher than the lowest code length among a plurality of predefined code lengths; If the data length of the first TB belongs to the second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0190] In yet another possible implementation of the seventh aspect, the communication unit is further configured to: Send a second instruction message, which is used to indicate the target segmentation method among multiple segmentation methods.

[0191] Optionally, the second indication information can be sent when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is transmitted.

[0192] In another possible implementation of the seventh aspect, the second instruction information is sent via signaling.

[0193] In another possible implementation of the seventh aspect, the second indication information is carried in the header of a frame, which is a transmission unit. Optionally, the second indication information can be transmitted through fields in the frame header.

[0194] In yet another possible implementation of the seventh aspect, the code length corresponding to the CB is... The following equations must be satisfied: .

[0195] In another possible implementation of the seventh aspect, the code length corresponding to the CB belongs to one or more predefined code lengths, the predefined code lengths including at least one of 1024, 512, 256, 128 or 64.

[0196] In another possible implementation of the seventh aspect, the target segmentation method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, or node communication capability, etc.

[0197] In another possible implementation of the seventh aspect, the target segmentation method belongs to the segmentation methods supported by the receiver. In one design, the receiver can feed back its supported segmentation methods to the transmitter, and the transmitter determines the target checksum appending method from the segmentation methods supported by the receiver.

[0198] In another possible implementation of the seventh aspect, the correspondence is predefined, preconfigured, or negotiated.

[0199] Eighthly, embodiments of this application provide a communication device, the communication device including a processing unit and a communication unit, the communication device being used to implement the method described in the first aspect or any possible implementation of the first aspect.

[0200] In one possible implementation of the eighth aspect, the communication unit is configured to receive the second data to obtain at least one codeword according to a target segmentation method among a plurality of segmentation methods, wherein the plurality of segmentation methods are predefined or configured. The processing unit is used to process the at least one codeword to obtain information of the first TB.

[0201] In one possible implementation of the eighth aspect, the communication unit is further configured to receive second data; The processing unit is further configured to obtain the at least one codeword based on the second data according to the target segmentation method in the segmentation method.

[0202] In another possible implementation of the eighth aspect, the at least one codeword corresponds to M CBs.

[0203] In yet another possible implementation of the eighth aspect, the above method is implemented at the object layer of wireless communication.

[0204] In another possible implementation of the eighth aspect, the M CBs include at least one third CB, the code length of which is the lowest among a plurality of predefined code lengths.

[0205] In another possible implementation of the eighth aspect, among the M CBs, the code length corresponding to any one CB is higher than the lowest code length among a plurality of predefined code lengths.

[0206] In yet another possible implementation of the eighth aspect, the communication unit is further configured to: Receive second instruction information, which is used to indicate the target segmentation method among multiple segmentation methods.

[0207] Optionally, the second indication information can be received when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is being transmitted.

[0208] In another possible implementation of the eighth aspect, the communication unit is further configured to: receive the second indication information by receiving signaling.

[0209] In another possible implementation of the eighth aspect, the second indication information is carried in the header of a frame, which is a transmission unit. Optionally, the second indication information can be transmitted through fields in the frame header.

[0210] In yet another possible implementation of the eighth aspect, the code length corresponding to the CB is... The following equations must be satisfied: .

[0211] In another possible implementation of the eighth aspect, the code length corresponding to the CB belongs to one or more predefined code lengths, the predefined code lengths including at least one of 1024, 512, 256, 128 or 64.

[0212] In another possible implementation of the eighth aspect, the target segmentation method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, or node communication capability, etc.

[0213] In another possible implementation of the eighth aspect, the target segmentation method belongs to the segmentation methods supported by the receiving end. In one design, the receiving end can feed back the segmentation methods it supports to the sending end, and the sending end determines the target checksum appending method from the segmentation methods supported by the receiving end.

[0214] In another possible implementation of the eighth aspect, the correspondence is predefined, preconfigured, or negotiated.

[0215] Ninthly, embodiments of this application provide a communication device including a processor and a communication interface. The communication interface is used to receive and / or transmit data, and / or to provide input and / or output to the processor. The communication device is used to implement the methods described in any of the possible implementations of the first to fourth aspects.

[0216] It should be noted that the processor included in the communication device described in aspect nine above can be a processor specifically designed to execute these methods (referred to as a dedicated processor for easy distinction), or a processor that executes these methods by calling a computer program, such as a general-purpose processor. Optionally, at least one processor may include both dedicated and general-purpose processors.

[0217] Optionally, the computer program described above may reside in memory. For example, the memory may be non-transitory memory, such as read-only memory (ROM).

[0218] The memory can be integrated with the processor on the same device or it can be set on different devices. This application does not limit the type of memory or the way the memory and processor are set.

[0219] In one possible implementation, at least one of the aforementioned memories is located outside the aforementioned communication device.

[0220] In yet another possible implementation, the at least one memory is located within the communication device.

[0221] In another possible implementation, a portion of the memory of the at least one memory is located within the communication device, while another portion of the memory is located outside the communication device.

[0222] In a tenth aspect, embodiments of this application provide a communication system comprising a first node and a second node, wherein the first node is configured to implement the method described in any of the first aspects; and the second node is configured to implement the method described in any of the second aspects.

[0223] Eleventhly, embodiments of this application provide a communication system, the communication system comprising a first node and a second node, the first node being used to implement the method described in any of the third aspects; the second node being used to implement the method described in any of the fourth aspects.

[0224] In a twelfth aspect, this application provides a chip that may include a processor and an interface, the processor being configured to read instructions via the interface to perform the method as described in any one of the first to fourth aspects above.

[0225] In a thirteenth aspect, this application provides a terminal for implementing the method as described in any one of the first to fourth aspects.

[0226] Alternatively, the aforementioned terminal may include the communication device described in any of the fifth to ninth aspects.

[0227] Examples of terminals include, but are not limited to: smart home devices (such as televisions, robot vacuum cleaners, smart lamps, audio systems, smart lighting systems, appliance control systems, home background music systems, home theater systems, intercom systems, video surveillance, etc.), smart transportation equipment (such as cars, ships, drones, trains, freight cars, trucks, etc.), smart manufacturing equipment (such as robots, industrial equipment, smart logistics, smart factories, etc.), and smart terminals (mobile phones, computers, tablets, PDAs, desktop computers, headphones, speakers, wearable devices, in-vehicle devices, virtual reality devices, augmented reality devices, etc.).

[0228] In a fourteenth aspect, embodiments of this application provide a computer-readable storage medium storing instructions that, when executed on at least one processor, implement the method described in any one of the first or second aspects above.

[0229] In a fifteenth aspect, this application provides a computer program product comprising computer instructions that, when executed on at least one processor, implement the method described in any of the first or second aspects above.

[0230] The beneficial effects of some implementations of the technical solutions provided in the second to fifteenth aspects of this application can be referred to the beneficial effects of the technical solutions in the first aspect, and will not be repeated here. Attached Figure Description

[0231] The accompanying drawings used in the description of the embodiments will be briefly introduced below.

[0232] Figure 1 This is a schematic diagram illustrating an application scenario provided in an embodiment of this application; Figure 2 This is a schematic diagram of a wireless communication system provided in an embodiment of this application; Figure 3 This is a flowchart illustrating a communication method provided in an embodiment of this application; Figures 4-7 This is a schematic diagram illustrating some verification code appending methods provided in the embodiments of this application; Figure 8 This is a schematic diagram of a segmentation method provided in an embodiment of this application; Figure 9 This is a schematic diagram illustrating a decoding delay provided in an embodiment of this application; Figure 10 This is a schematic diagram of yet another segmentation method provided in the embodiments of this application; Figure 11 This is a schematic diagram illustrating the location design of redundant information provided in an embodiment of this application; Figure 12 This is a structural diagram of a transmission unit provided in an embodiment of this application; Figure 13 This is a structural diagram of another transmission unit provided in the embodiments of this application; Figure 14 This is a flowchart illustrating a communication method provided in an embodiment of this application; Figure 15 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application; Figure 16 This is a schematic diagram of the structure of another communication device provided in the embodiments of this application. Detailed Implementation

[0233] The embodiments of this application will now be described in detail with reference to the accompanying drawings. Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. In case of any inconsistency, the meaning set forth in this specification or derived from the content described herein shall prevail. Furthermore, the terminology used herein is for the purpose of describing the embodiments of this application only and is not intended to limit this application.

[0234] For ease of understanding, the following examples illustrate some concepts related to the embodiments of this application for reference. As follows: 1. Cyclic Redundancy Check (CRC) CRC is a channel coding technique that generates a short, fixed-length checksum based on data such as network packets or computer files. It is mainly used to detect or verify errors that may occur after data transmission or storage.

[0235] 2. Transmission Unit In this embodiment of the application, the transmission unit is the data unit transmitted between peer levels during the communication process.

[0236] For example, a transmission unit can be a Protocol Data Unit (PDU). In the protocol stack of a communication system, each layer entity can create its own PDU. The PDU contains information from the upper layer entity and additional information attached by the current layer entity, and is then transmitted to the next layer. In some scenarios, the information from the current layer entity may not be attached, such as in transparent transmission.

[0237] In one possible approach, a frame is a transmission unit that can contain data, a header, or a trailer transmitted from the upper layer. Taking a data packet as an example, after the data packet arrives at the current layer, the current layer's protocol header and trailer are added to form a frame. That is, the beginning of a frame contains a header, the end of a frame contains a trailer, and the data packet serves as the data part of the frame, thus forming a complete frame.

[0238] Optionally, due to differences in communication scenarios, frame length, or protocol specifications, frames may have multiple types or formats.

[0239] For example, a control type transmission unit can also be called a control frame or a management frame, and a data type transmission unit can also be called a data frame.

[0240] For example, in one possible scheme, frames can have long frame format and short frame format according to the protocol.

[0241] 3. Transmission Block (TB) Data transmitted from the upper layer (above the physical layer), which can be at least one of the media access layer, link control layer, data link layer, network layer, transport layer, and application layer. In some scenarios, it is also referred to as business data or raw data. Optionally, the transport block can be in packet form, also known as a data packet in some scenarios.

[0242] 4. Sub-data Subdata is a portion of the data in a TB (or a TB with validation).

[0243] 5. Coded Block (CB) The data unit or sub-data packet to be encoded.

[0244] Furthermore, in this application, the data length of CB refers to the length of the data input to the encoder, which may include the length of the additional CRC or not. The code length, on the other hand, refers to the number of bits in the codeword obtained after encoding the coded block. For example, if a coded block has a data length of 512 bits and a code length of 1024 bits, it means that the coded block contains 512 bits of data before encoding and a 1024-bit codeword after encoding.

[0245] 6. Polar codes Polar codes are a theoretically proven encoding method that can achieve Shannon capacity, and are characterized by high performance and low encoding / decoding complexity.

[0246] In polar codes, the code length of the encoded codeword is a positive integer power of 2. If the code length of the encoded codeword is inconsistent with the number of bits that the physical layer can transmit, an additional rate matching module is required. This module can then perform channel retransmission or puncturing on the encoded codeword to match the actual transmission capacity of the channel.

[0247] 7. Cockpit Domain Controller (CDC) Domain controller integration, with domains as the unit, has become the mainstream architecture for vehicle control systems. In this architecture, the vehicle control system can be divided into multiple communication domains, such as powertrain domain, body electronics domain, driver assistance domain, cockpit domain, etc., and each domain is dominated by a corresponding domain controller.

[0248] Among them, CDC, also known as vehicle infotainment system, is the domain controller in the vehicle cockpit domain.

[0249] 8. Nodes A node is an electronic device with communication capabilities, also known as a communication node. For example, a node can include independent devices such as handheld terminals, vehicles, in-vehicle equipment, network-side equipment, user equipment, access terminals, user units, user stations, mobile stations, mobile stations, remote stations, remote terminals, wireless communication equipment, user agents, or user devices, or it can be a component (such as a chip or integrated circuit) contained within an independent device. A node can be any possible smart terminal device (such as a mobile phone), smart transportation equipment (such as vehicles, drones, etc.), smart manufacturing equipment, smart home devices (such as large screens, speakers, etc.), etc. In one possible scenario, within a vehicle, the node can also be a battery management system and the battery in the battery pack.

[0250] For example, when the node is an in-vehicle device, it can be a cockpit domain device or a module of a cockpit domain device, such as one or more modules such as a cockpit domain controller (CDC), camera, screen, microphone, audio, electronic key, keyless entry or start system controller, etc.

[0251] The nodes in this application embodiment can be applied to a variety of application scenarios, such as the following: mobile internet (MI), industrial control, self-driving, transportation safety, internet of things (IoT), smart city, or smart home, etc.

[0252] The nodes in this application can be applied to various communication systems, such as the following: Global System for Mobile Communication (GSM), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA), General Packet Radio Service (GPRS), Long Term Evolution (LTE), LTE Frequency Division Duplex (FDD), LTE Time Division Duplex (TDD), Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX), 5th Generation (5G) or New Radio (NR) millimeter-wave communication systems, 6th Generation (6G), various existing short-range communication systems (e.g., vehicular wireless communication systems), future evolved short-range communication systems, or general short-range communication systems, etc.

[0253] In certain application scenarios or network types, devices with similar communication capabilities may not be called nodes. However, for ease of description, electronic devices with communication capabilities are collectively referred to as nodes in this application embodiment.

[0254] The above exemplary description of the concepts can be applied to the embodiments described below.

[0255] The following describes the application scenarios and system architecture of the embodiments of this application.

[0256] Communication systems typically consist of multiple nodes that can communicate with each other to transmit data. Taking an in-vehicle communication system as an example, multiple communication domains can exist within a vehicle. A communication domain refers to a system composed of a group of nodes with communication relationships and the communication connections (i.e., communication links) between these nodes, usually used to perform a specific function. For example, a communication domain may include a master node and one or more slave nodes. The master and slave nodes can communicate with each other, or between master and master nodes, or between slave nodes. The master node manages the slave nodes, has the function of allocating resources, and is responsible for allocating resources to the slave nodes; the slave nodes follow the master node's scheduling, using the resources allocated by the master node to communicate with the master node and / or other nodes.

[0257] For example, Figure 1 A schematic diagram of a possible application scenario is shown. In this diagram, the CDC, screen, speaker, or microphone, etc., can constitute a communication domain (e.g., Figure 1 The first communication domain shown), keyless entry and start (PEPS) system, mobile phone key and car key can constitute a communication domain (e.g., Figure 1 (The first communication domain is shown). Taking the first communication domain as an example, the CDC can be the master node, and the other nodes can be slave nodes. For example, the CDC can establish communication connections with a screen, speaker, and / or microphone via wired or wireless communication.

[0258] In some specific implementation scenarios, the master node can also be called a G node, management node, or control node, while the slave node can be called a T node or terminal. The communication link from the G node to the T node can be called a C link or downlink, and the communication link from the T node to the G node can be called a T link or uplink.

[0259] Those skilled in the art should understand that Figure 1 The application scenario shown is merely one exemplary scenario to which the solution of this application can be applied. The node types and numbers in the communication domain are only examples. Besides... Figure 1 In addition to the application scenarios shown, the solution of this application can also be applied to any other suitable application scenarios, such as but not limited to home, office, showroom, and production scenarios.

[0260] For example, consider a communication node that includes a first node and a second node. Figure 2 This is a schematic diagram of a possible wireless communication system provided in an embodiment of this application. The first node 201 sends data to the second node 202, therefore the first node 201 is referred to as the transmitter and the second node 202 is referred to as the receiver.

[0261] It should be understood that the communication system may include more nodes, but for ease of description, they are shown here as the first node and the second node.

[0262] To ensure reliable transmission, the sending end needs to add a checksum, such as CRC, to the data. The receiving end can use the checksum to determine whether it has accurately received the data sent by the sending end.

[0263] The sending end can divide the transmitted data into bounding boxes (CBs), each CB containing a CRC (Corrective Chronology). The receiving end can determine whether each CB was received correctly, allowing the sending end to retransmit any erroneous CBs. However, this method of including a CRC in each CB increases the proportion of CRC in the transmitted bits, thereby reducing the transmission rate and impacting transmission performance. In particular, for some applications or channels with low reliability requirements, adding a CRC to each CB does not provide additional reliability benefits; instead, it reduces data transmission efficiency, increases latency, and negatively affects transmission performance.

[0264] Furthermore, for certain channels, such as broadcast channels, which are one-way broadcasts and do not require the receiver to provide feedback on the reception status of the transport block or CB, adding a CRC to each CB in this case would reduce transmission performance.

[0265] In view of this, the technical solutions of the embodiments of this application are provided.

[0266] The methods of the embodiments of this application will be described in detail below.

[0267] Example 1 Please see Figure 3 , Figure 3 This is a flowchart illustrating a communication method provided in an embodiment of this application. Optionally, this method can be applied... Figure 2 The aforementioned communication system. For example... Figure 3 The version management method described above includes at least steps S301 to S304, as follows: S301: The first node processes the first TB according to the target checksum appending method among multiple checksum appending methods to obtain the first data. The first data contains M checksum appending codes, where M is a positive integer.

[0268] The first TB is the data to be transmitted. Processing the first TB may include adding a checksum to the first TB, segmenting it, or adding a checksum to a portion of the first TB (for convenience, referred to as sub-data). The checksum can be used to verify whether the corresponding data has been transmitted correctly.

[0269] The checksum appending method indicates the rules for appending the checksum; different appending methods correspond to different rules. In this embodiment, the checksum appending method used is one of multiple checksum appending methods. These multiple checksum appending methods can be predefined or preconfigured. For example, multiple checksum appending methods can be defined through a protocol. Alternatively, multiple checksum appending methods can be written into the memory of the first node at the factory. Or, multiple checksum appending methods can be configured for the first node through a management interface.

[0270] For example, taking CRC as the checksum, the following illustrates four possible ways to append the checksum: Checksum appending method 1: The first TB and the first CRC together correspond to N sub-data; each CB contains one sub-data and a second CRC, where the second CRC is the CRC corresponding to the sub-data. In this case, M=N.

[0271] For example, please see Figure 4 , Figure 4 This is a schematic diagram of a checksum appending method provided in an embodiment of this application. The first node can calculate the first CRC corresponding to the first TB based on the entire first TB. The first CRC is, for example, [example CRC]. Figure 4 The "TB-CRC" section is shown. This first CRC can be appended to the first TB to obtain a first TB with a checksum, as shown in area 401. The first TB with the checksum can be divided into N sub-data, such as... Figure 4 The sub-data 1 to sub-data N are shown. The first node can calculate a second CRC based on each sub-data, such as... Figure 4 The “CB-CRC” section is shown. A second CRC is appended to the sub-data to obtain CB.

[0272] For example, CB(1) contains subdata 1 and the CRC corresponding to subdata 1; CB(2) contains subdata 2 and the CRC corresponding to subdata 2, and so on for the rest of CB.

[0273] Method 2 for appending the checksum: The first TB and the first CRC together correspond to N sub-data. Among the N sub-data, some sub-data correspond to the CRC individually; some sub-data (together) correspond to the third CRC.

[0274] Specifically, the M CBs contain M1 (M1≥0) first CBs, each containing one sub-data and one second CRC. The second CRC is the CRC corresponding to one sub-data. The M CBs also contain M2 (M2≥0) second CBs, each corresponding to N1 (N1≥0) sub-data and a third CRC. The third CRC is the CRC shared by all N1 sub-data.

[0275] For example, please see Figure 5 , Figure 5 This is a schematic diagram illustrating a verification code appending method provided in an embodiment of this application. For a more detailed description of the N sub-data, please refer to the foregoing. Figure 4 In N sub-data points, some sub-data points (e.g., N2 sub-data points) correspond to individual CRCs, thus forming M1 (M1 = N2) first CBs. For example... Figure 5 As shown, the first CB contains sub-data and the CRC corresponding to the sub-data. For example, CB(a1) contains sub-data and the CRC corresponding to sub-data 1. For CB(a2), it contains sub-data (a2) and the CRC corresponding to sub-data (a2). The rest of the first CBs follow the same pattern.

[0276] The CRC corresponding to a portion of the sub-data (e.g., N1 sub-data) is appended after (or before, or in the middle of) this portion of sub-data; this application does not limit the appending position. This checked portion (N1 sub-data) can be further divided into one or more second CBs, such as CB(b1), CB(b2), etc. It should be noted that... Figure 5 Taking N1 sub-data as an example, in the specific processing, N1 can be 0, 1, or other positive integers.

[0277] In one possible scenario, the first CB corresponds to a code length of the first code length; the second CB corresponds to a code length of the second code length, and the first and second code lengths are different. That is to say, for some code length CBs, each CB contains a CRC; for others, the CBs correspond to sub-data with CRC.

[0278] Optionally, the first code length can be a single code length, such as 1024 or 512 code lengths, or it can be a set of code lengths containing multiple code lengths, such as the second code length being {256, 128, 64}, etc. Similarly, the second code length can be a single code length, such as 1024 or 512 code lengths, or it can be a set of code lengths containing multiple code lengths.

[0279] In one possible design, N2 + N1 = N.

[0280] In another possible design, the M third CBs also include M3 fourth CBs, each corresponding to one of the M3 sub-data items, and none of the M3 third CBs contain a corresponding CRC. For example, as shown... Figure 6 The diagram illustrates another method of adding a checksum according to an embodiment of this application. For N3 sub-data out of N sub-data, these sub-data directly form the third checksum without adding a checksum.

[0281] Optionally, the code length corresponding to the third CB belongs to the third code length. The third code length can be a single code length, such as a 1024-code length or a 512-code length, or it can be a set of code lengths obtained from multiple code lengths.

[0282] Checksum appending method three: The first TB and the first CRC together correspond to M CBs. For example... Figure 7 The diagram shown is a schematic of another checksum appending method provided in an embodiment of this application. The first TB for appending the checksum can be divided into M CBs, each CB not containing a separate checksum.

[0283] Method 4 for appending check codes: The first TB corresponds to N sub-data, and each of the N sub-data is appended with a CRC to form M check codes. Specifically, the first node can divide the TB into N sub-data, and each sub-data is appended with a CRC to form a check code. In this case, N=M.

[0284] It should be understood that the four checksum appending methods described above are possible scenarios exemplified in this application. In specific implementations, multiple checksum appending methods may include more or fewer checksum appending methods. For example, multiple checksum appending methods may include checksum appending method two and checksum appending method three. Alternatively, multiple checksum appending methods may also include other CRC appending methods not exemplified in this application.

[0285] The above explains the method of appending the checksum. The following explains the segmentation method of the TB. To further reduce power consumption and improve performance, the code length of the encoded CB needs to satisfy the form of an integer power of 2. That is, the code length of the CB satisfies the following equation: .

[0286] In one possible design, the code length of the CB belongs to one or more of a predefined set of code lengths. For example, the predefined set of code lengths may include one or more of the following code lengths: 1024, 512, 256, 128, or 64.

[0287] It should be noted that among the aforementioned M CBs, the code lengths corresponding to different CBs can be the same or different. The code lengths corresponding to CBs and the number of CBs of each code length can be determined by the segmentation method. In this embodiment, when segmenting TB, the target segmentation method used can be one of multiple segmentation methods. Optionally, multiple segmentation methods can be pre-configured or pre-defined. For example, multiple checksum appending methods can be defined through a protocol. Or, multiple checksum appending methods can be written into the node at the factory. Alternatively, multiple checksum appending methods can be configured in the node through a communication interface. To facilitate understanding, the following are some possible ways of segmenting: Segmentation Method 1: Among the M CBs, there is at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0288] For example, if a predefined set of code lengths (or a predefined set of code lengths) contains five code lengths: 1024, 512, 256, 128, and 64, then among the M code lengths, at least one code length 64 must be included. Figure 8 The diagram shown is a possible segmentation method provided in an embodiment of this application. Among the M CBs, the code length corresponding to CB(M) is 64.

[0289] Segmentation Method 2: Among the M code blocks (CBs), the code length of each CB belongs to multiple consecutive code lengths from a predefined set of code lengths. For example, the predefined code lengths include 5 code lengths: 1024, 512, 256, 128, and 64. In this case, among the M CBs, the code length of each CB includes 3 code lengths (for ease of description, referred to as L1, L2, and L3), and these 3 code lengths belong to consecutive code lengths from the 5 code lengths. That is, (L1, L2, L3) can be (1024, 512, 256), (512, 256, 128), or (256, 128, 64). Optionally, the positions of the CBs in L1, L2, and L3 are only examples.

[0290] In one design, when CBs of different lengths are encoded into codewords, the length of the CBs decreases as the codewords form a sequence.

[0291] For example, if the code length of the CB is 1024, 512, 256, 128, and 64, the number of CBs corresponding to each code length is 1, 1, 1, 1, and 1, respectively. After the CBs are encoded, when forming a sequence in the bearer portion of the transmission unit, the codeword corresponding to the 1024-code-length CB is at the beginning of the sequence, and the codewords corresponding to the 1024, 512, 256, 128, and 64-code-length CBs are respectively from front to back. Figure 9 The diagram shows a possible decoding delay, illustrating the timing of receiving and decoding sequences of different code lengths of CB. The receiver first receives the codeword (1) with a code length of 1024. While decoding codeword (1), it can receive codeword (2); while decoding codeword (2), it can receive codeword (3)... Thus, within the time it takes to receive the next codeword, it can decode the previous codeword, achieving pipelined decoding, improving decoding efficiency, and reducing delay.

[0292] Segmentation Method 3: Among the M code blocks, the third code block may not be included. The code length corresponding to the third code block is the minimum code length among a number of predefined code lengths.

[0293] For example, consider multiple predefined code lengths {1024, 512, 256, 128, 64}. Among the M code blocks, there may or may not be a code block with a corresponding code length of 64.

[0294] In one possible implementation, the code length of any one of the M code blocks is higher than the minimum code length among a set of predefined code lengths.

[0295] In one possible implementation, the code lengths corresponding to the M CBs are related to the length of the TB. For example, if the data length of the first TB belongs to a first data length, the code length corresponding to any one of the M CBs is higher than the lowest code length among a predefined plurality of code lengths; if the data length of the first TB belongs to a second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a predefined plurality of code lengths. The first data length can include at least one data, multiple data lengths, or one or more data length ranges. Similarly, the second data length can include at least one data, multiple data lengths, or one or more data length ranges.

[0296] For TB blocks of equal length, CBs are obtained by segmenting them into four parts. Since a CB may not contain the block with the smallest code length, fewer CBs can be obtained. This reduces the time spent calculating the checksum, increases the code rate, and improves the efficiency of data transmission. Furthermore, since a longer codeword corresponding to a coded block results in a stronger error correction capability for the transmission system, increasing the code length corresponding to the CB can improve the error correction capability.

[0297] Segmentation Method 4: The code lengths of the M code blocks (CBs) can be non-contiguous. For example, a predefined code length includes 5 code lengths: 1024, 512, 256, 128, and 64. In this case, if the code length of one of the M CBs contains 3 code lengths (referred to as L1, L2, and L3 for ease of description), these 3 code lengths can be non-contiguous. That is, (L1, L2, L3) can be (1024, 512, 128), (1024, 512, 64), or (512, 256, 64), etc. The positions of L1, L2, and L3 are merely examples.

[0298] The above four segmentation methods are merely examples; in actual implementation, more or fewer segmentation methods may be included. For instance, multiple segmentation methods could include Segmentation Method 1, Segmentation Method 2, and Segmentation Method 3. When the first node processes the first TB, it includes the process of segmenting the first TB based on one of the above three segmentation methods. It should be understood that the above four segmentation methods can be combined without mutual exclusion. For example, Segmentation Method 1 and Segmentation Method 2 can be combined, for example, to obtain Segmentation Method 5. Segmentation Method 5 is: among the M CBs, there is at least one CB with the lowest code length; and the code length of the CB belongs to multiple consecutive code lengths among a predefined set of code lengths.

[0299] In one design, the code length L of the CB is related to one or more of the following parameters: the data length of the CB, a preset first code rate, a reduction threshold, and redundancy information. The first code rate can be the code rate required by the transmission format, a code rate manually selected according to requirements, or a code rate selected from multiple predefined or configured code rates according to rules such as round-robin selection or random selection; the specific rules are not limited. The reduction threshold can adjust the code rate.

[0300] In one possible implementation, the first node predefines or configures a correspondence between S code lengths, T code rates, and S×T data lengths. Each of the S×T data lengths corresponds to one code length among the S code lengths and one code rate among the T code rates, representing the data length of a coded block when transmitting a coded block of the corresponding code length using the corresponding code rate, as pre-set or configured. S and T are both positive integers. Optionally, the correspondence between the S code lengths, T code rates, and S×T data lengths can be represented by one or more of the following forms: table, stack, database, queue, or others. For example, when represented in tabular form, Table 1 shows an exemplary correspondence table of S code lengths, T code rates, and S×T data lengths (data length of CB) set or configured according to correspondence one. This correspondence table is also called a segment length reference table, or simply the K table. In "512×(1 / 4-1 / 8)", 1 / 8 is a reduction threshold that can adjust the code rate.

[0301] Table 1: A specific example of a K-table

[0302] For example, the first node can process the TB to form M CBs based on target segmentation method five and checksum attachment method two. Among the M CBs, the one with the smallest code length is included, and the code lengths of the M CBs decrease in an ascending order. Using Table 1 above as the K table, with a preset first code rate of 1 / 2, a first TB length of 750 bits, and a CRC data length of 20 bits (for example only), and predefined code lengths of 1024, 512, 256, 128, and 64 bits as examples, the first node appends the first CRC to the first TB, resulting in a TB block with a checksum (770 bits).

[0303] like Figure 10 The diagram illustrates a possible segmentation method provided in this application. According to this segmentation method, the TB with checksum is segmented into 5 sub-data, which can form 5 CBs. For example... Figure 10 As shown, the number of code blocks (CBs) with code lengths of 1024, 512, 256, 128, and 64 are 1, 1, 1, 1, and 1, respectively. Thus, among the 5 CBs, there is a CB with a code length of 64, and the code lengths corresponding to the CBs show a continuously increasing trend.

[0304] Among them, CB(1) contains sub-data 1 and the CRC corresponding to sub-data 1. The size of CB1 is 512 bits, and the corresponding code length is 1024. Similarly, CB(2) contains sub-data 2 and the CRC corresponding to sub-data 2. The size of CB2 is 192 bits, and the corresponding code length is 512. The remaining CBs follow the same pattern. Optionally, for CB(5), redundant information can be added to form a CB with a data length of 24 bits. The CRC (20 bits) contained in CB(7) is used to verify sub-data 5 and redundant information, or to verify sub-data 5.

[0305] The specific implementation details of other segmentation methods will not be illustrated here.

[0306] Optionally, the CB may include redundancy information to ensure that the formed CB meets a certain code length. This redundancy information can be a predefined, pre-configured, or negotiated segment of data. For example, the redundancy information can be multiple bits of 0 or 1. Further optionally, the location of the redundancy information can be designed in various ways. Figure 11 The diagram shows a design illustration of the possible locations for redundant information. For example... Figure 11 In part (a), the redundant information can be located after the sub-data and before the checksum; for example... Figure 11 In part (b), the redundant information can be located at the beginning of CB; for example... Figure 11 In part (c), the redundant information can be located at the rear of CB.

[0307] In one possible design, the target checksum appending method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, node communication capability, or code rate. The node's communication capability (also referred to as the node's capabilities) may include one or more of the following aspects: the checksum appending methods supported by the node, the node's checksum capabilities, and indication information for the aforementioned aspects.

[0308] Optionally, the correspondence between the verification code appending method and the above information can be predefined, preconfigured, or negotiated. Optionally, the correspondence can be represented by one or more of the following forms: table, stack, database, queue, or others. The following uses a table as an example to illustrate the possible correspondence between the target verification code appending method and the above information: Case 1: Table 2 shows an example of the correspondence between possible communication channel types and checksum appending methods provided in this application embodiment. It can be seen that in the broadcast channel, checksum appending method three can be used to append the checksum. In the downlink control channel, checksum appending method two can be used to append the checksum, and the remaining cases are shown in Table 2.

[0309] Table 2: Correspondence between Communication Channel Types and Check Code Attachment Methods

[0310] Scenario 2: Table 3 shows an example of the correspondence between a possible communication scenario type (or transmission unit type, such as frame type) and a verification code appending method provided in the embodiments of this application. It can be seen that in the video call scenario, verification code appending method one can be used to append the verification code. In the short video viewing scenario, verification code appending method one can be used to append the verification code; other cases are shown in Table 3.

[0311] Table 3: Correspondence between Communication Scenarios and Verification Code Attachment Methods

[0312] Case 3: Taking the channel quality indicator as the signal-to-noise ratio (SNR) as an example, Table 4 shows a possible correspondence between SNR levels and checksum appending methods provided in this application embodiment. If the current SNR falls within the range corresponding to the first SNR level, checksum appending method one is used; if the current SNR falls within the range corresponding to the second SNR level, checksum appending method two is used; and so on for other cases.

[0313] Table 4: Correspondence between signal-to-noise ratio level and checksum appending method

[0314] Scenario 4: The second node can inform the first node of the checksum appending methods it supports. The first node determines the target checksum appending method from the checksum appending methods supported by the second node. Optionally, if the second node supports only one checksum appending method, then subsequent communication can only use this one checksum appending method. Optionally, if the second node supports at least two checksum appending methods, the target checksum appending method can be determined through negotiation, priority, or other means.

[0315] Alternatively, the first and second nodes can negotiate the method of appending the checksum during the connection establishment process. Or, the sending or receiving end can notify the other side of the appropriate checksum appending method.

[0316] In summary, the target checksum appending method used by the first node is a checksum appending method supported by the receiving end (such as the second node).

[0317] Scenario 5: Different checksum appending methods can be used for different bitrates. For example, when the encoding bitrate is 3 / 4, checksum appending method one is used; when the encoding bitrate is 1 / 2, checksum appending method two is used; and so on. Optionally, the bitrate here refers to the bitrate of the frame header (or control information) portion.

[0318] The above scenarios 1-5 are provided as examples for ease of understanding of this scheme and are not intended to limit the form of the correspondence, the method of adding the check code to the specified channel, or the method of adding the check code to the specified code rate.

[0319] In another possible design, the segmentation method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, or node communication capability, code rate, etc. For related descriptions and possible scenarios, please refer to the preceding description of checksum appending methods.

[0320] In one possible implementation, the first node can send first indication information, which indicates the target checksum appending method among the plurality of checksum appending methods. Optionally, the timing of sending the first indication information can be designed in several ways; for example, it can be sent when the sending node and the receiving node establish a communication connection, or after the connection is established, or it can be sent while transmitting a segment of information. Optionally, the first indication information can be sent via signaling. Alternatively, the first indication information can be carried in the header of a frame. Here, a frame is a possible transmission unit. Further, the second indication information can be transmitted through one or more fields in the frame header.

[0321] In another possible implementation, the first node can send a second indication message, which indicates the target segmentation method among multiple segmentation methods. The timing and method of sending the second indication message can be referenced in the above-described checksum appending method.

[0322] Figure 12 A schematic structural diagram of a transmission unit is shown. The transmission unit may, exemplarily, include a preamble, a header, a data portion (or valid data, payload), or other fields. The preamble may be used for frequency synchronization, symbol timing estimation (STE), automatic gain control (AGC), etc. The data portion may include valid data (or payload). The header contains a checksum appending method indication field and / or a segmentation method indication field, as well as other fields. The checksum appending method indication field indicates the target checksum appending method, the segmentation method indication field indicates the target segmentation method, and other fields may indicate, for example, the type of data unit, the device address type for sending data, the device address type for receiving data, the number of bytes of valid data, etc. Optionally, the transmission unit may also include a synchronization channel (not shown), an access address, a connection interval (CI), or a termination symbol (TERM), etc.

[0323] For example, Table 5 shows a description of the possible values ​​of the verification code appending method indicator field provided in an embodiment of this application. When the verification code appending method indicator field is 00, it indicates verification code appending method one; the other cases are shown in Table 5.

[0324] Table 5: Values ​​and corresponding descriptions of the field indicating the verification code attachment method

[0325] For example, Table 6 shows a description of the possible values ​​of the segmentation method indicator field provided in an embodiment of this application. When the segmentation method indicator field is 000, it indicates segmentation method one; the other cases are shown in Table 6.

[0326] Table 6: Values ​​and corresponding descriptions of the segmentation method indicator field

[0327] In yet another possible implementation, the first indication information and the second indication information may be the same indication information. See also... Figure 13A schematic structural diagram of another transmission unit is shown. The checksum appending method indicator field indicates the target checksum appending method and the segmentation method. For example, the checksum appending method can be related to the segmentation method; indicating that checksum appending method one is used corresponds to segmentation method one. Furthermore, the diagram shows a possible value description of the checksum appending method indicator field provided by an embodiment of this application. When the segmentation method indicator field is 0x000, it indicates both checksum appending method one and segmentation method one; other cases are shown in Table 7.

[0328] Table 7: Values ​​and corresponding descriptions of the field indicating the verification code attachment method

[0329] S302: The first node generates at least one codeword based on the M CBs.

[0330] Specifically, the first node encodes M CBs to generate at least one codeword. For example, encoding a CB can form a codeword.

[0331] In one possible design, the encoding method is polar code encoding.

[0332] For example, after obtaining M CBs, the transmitting device can also perform one or more of the following operations: bit mapping, higher-order modulation, or symbol interleaving. The order of these operations—encoding the M CBs, bit mapping, higher-order modulation, or symbol interleaving—is not specifically limited; for example, these operations can be performed in one go, sequentially, or in parallel.

[0333] In one possible implementation, after one or more of the above operations are completed, the codewords of the M CBs will form a complete sequence. The codewords of each first coded block and each second coded block in this sequence can be arranged together in a permutation order. Optionally, this permutation order can be pre-configured, pre-set, or defined by the protocol. Alternatively, the permutation order can be sent by the receiving end to the receiving end so that the receiving end device can also obtain the M coded blocks in sequence.

[0334] S303: The first node sends at least one codeword.

[0335] Specifically, the first node can carry the codewords of M coded blocks in the transmission unit and transmit them through the channel. The codewords of the M coded blocks can be presented as a data sequence in the transmission unit for easy description, and this data sequence is called the second data.

[0336] Accordingly, the second node receives at least one codeword. Optionally, the second node can receive at least one codeword in the following way: the second node receives the second data, and the second node segments the second data to extract the codewords corresponding to M coded blocks, thus obtaining at least one codeword.

[0337] In one design, the second node segments the second data into M codewords corresponding to each coded block based on the target segmentation method among multiple segmentation methods.

[0338] Optionally, the target segmentation method is indicated by a second indication. For example, the second node receives indication information from the first node to determine the target segmentation method.

[0339] Optionally, when receiving the second data, the second node may perform one or more operations such as bit mapping and demodulation. This application does not specify the order of bit mapping, demodulation, etc.

[0340] S304: The second node performs processing on the at least one codeword according to the target check code appending method among multiple check code appending methods to obtain the information of the first TB.

[0341] Optionally, the information in the first TB includes one or more of the following: the first TB, the verification result of the first TB, the sub-data corresponding to at least one CB, the verification result of at least one CB, the sub-data corresponding to at least one coded block group (CBG), or the verification result of at least one CBG. The verification result may include one or more of the following: verification success indication information, verification failure indication information, or data bits that failed verification. A CBG is a group formed by one or more CBs and can be used as a data unit for encoding, decoding, verification, or retransmission operations in some scenarios.

[0342] Understandably, the first node processes the first TB according to the target checksum appending method to obtain M encoded blocks, and then obtains at least one codeword from the M encoded blocks. Correspondingly, the second node decodes the at least one codeword to obtain M encoded blocks; and verifies whether the data has been correctly transmitted by using the checksum of the corresponding data according to the target checksum appending method.

[0343] In one scenario, when the second node verifies the CB, it can obtain the corresponding sub-data of the CB if the verification is successful, or it may also include an indication that the CB verification was successful. If the verification fails, it can obtain an indication that the CB verification failed.

[0344] In another scenario, the second node performs verification in the form of a CBG (Confirmation Block Group). Upon successful verification, the corresponding sub-data of the CBG can be obtained, or it may include an indication that the CBG verification was successful. Conversely, upon failed verification, an indication that the CBG verification failed can be obtained.

[0345] In another scenario, if all M CBs (Confirmation Blocks) are verified as correctly transmitted, the TB (Test Block) can be generated from N sub-data packets with checksums. The TB is then verified using the checksum corresponding to its corresponding checksum. If verification is successful, the TB is retrieved, or an indication of successful TB verification may be included. If verification fails, an indication of TB verification failure is retrieved.

[0346] In one possible design, the second node decodes at least one codeword to obtain M encoded blocks. The second node then verifies whether the data has been transmitted correctly based on the corresponding data's checksum, according to the target checksum appending method. Several possible implementation methods are illustrated below: Implementation Method 1: The target check code is appended using appending method one. For the M check blocks, the second node checks whether the sub-data contained in each check block has been correctly transmitted based on the second CRC contained in each check block. For example, as... Figure 4 As shown, for CB(1), the CRC contained in CB(1) is used to verify whether the sub-data 1 is transmitted correctly; for CB(2), the CRC contained in CB(2) is used to verify whether the sub-data 2 is transmitted correctly, and so on for the rest.

[0347] Furthermore, when the N (N=M at this time) sub-data are transmitted correctly, the second node obtains a first TB with a checksum based on the N sub-data. This first TB with a checksum includes the first TB and a first CRC. The second node verifies the first TB according to the first CRC to obtain either the first TB or the checksum result of the first TB.

[0348] Implementation Method 2: The target check code is appended using Method 2. For the M1 first check codes, the sub-data corresponding to each first check code is verified to be correctly transmitted based on the second CRC contained in each first check code; for the M2 second check codes, the N1 sub-data are verified to be correctly transmitted based on the third CRC.

[0349] For example, such as Figure 5As shown, for CB(a1), the CRC contained in CB(a1) is used to verify whether the sub-data (a1) is transmitted correctly; for CB(a2), the CRC contained in CB(a2) is used to verify whether the sub-data (a2) is transmitted correctly, and so on for the remaining first CBs. For the second CB, based on one or more second CBs with checksums (N1 sub-data), the CRC is used to verify whether the N1 sub-data are transmitted correctly, thereby determining whether the sub-data is transmitted correctly.

[0350] Furthermore, when M1 sub-data corresponding to the M1 first CBs are transmitted correctly and N1 sub-data are transmitted correctly, a first TB with a checksum is obtained based on the M1 and N1 sub-data. This first TB with a checksum includes the first TB and the first CRC. The second node verifies the first TB based on the first CRC to obtain the first TB or the verification result of the first TB.

[0351] Implementation Method 3: The target checksum is appended using Method 3. The second node obtains a first TB with a checksum based on M CBs. This first TB with a checksum includes a first TB and a first CRC. The second node verifies the first TB based on the first CRC to obtain either the first TB or the verification result of the first TB.

[0352] exist Figure 3 In the illustrated embodiment, the first node can determine the target checksum method from multiple checksum addition methods, and add checksums to the TB (and / or its sub-data) based on the target checksum method. Because the checksum addition method can be flexibly determined, a suitable checksum addition method can be identified for different transmission scenarios, thus improving transmission performance.

[0353] For example, when using a broadcast channel to transmit data, there is no need to add checksums to the sub-data of the transport block, thereby increasing the bit rate, improving data transmission efficiency, and reducing latency.

[0354] For example, when the channel quality is good, there is no need to add checksums to the sub-data of the transport block, thus improving the efficiency of data transmission.

[0355] For example, in some scenarios, checksums can be added to transport blocks. Some sub-data can be appended with checksums separately, while other sub-data can be associated with a single checksum. This improves the flexibility of adding checksums and enhances the efficiency of data transmission.

[0356]

Example 2

[0357] Specifically, the first TB is the data to be transmitted. To reduce encoding / decoding latency and power consumption, the first TB can be segmented to obtain M CBs. In some designs, the first node can first calculate the checksum of the first TB, resulting in a first TB with a checksum. The first node then segments the first TB to be checked, obtaining M CBs. This application describes the segmentation of the first TB, which may or may not include a checksum, and is not limited to segmentation based on the first TB itself.

[0358] The segmentation method indicates the segmentation rules for the first TB. Different segmentation methods indicate different segmentation rules, resulting in different numbers or lengths of checksums (CBs). The first node can segment the first TB based on a target segmentation method from multiple segmentation methods to form CBs. It should be understood that a CB can contain a portion of the first TB's data (hereinafter referred to as sub-data for ease of description), or it can contain both sub-data and the corresponding checksums, or it can contain only the checksums corresponding to the sub-data. These multiple checksum appending methods can be predefined and pre-configured. For example, multiple checksum appending methods can be defined through a protocol. Alternatively, multiple checksum appending methods can be written into the node at the factory. Or, multiple checksum appending methods can be configured in the node through a communication interface. For relevant segmentation methods, please refer to the possible segmentation methods listed in step S301, which will not be elaborated here.

[0359] In another possible design, the target segmentation method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, or node communication capability, code rate, etc. Optionally, the correspondence between the target segmentation method and the above information can be predefined, preconfigured, or negotiated. A related description can be found in step S301.

[0360] Optionally, the correspondence can be represented using one or more of the following methods: table, stack, database, queue, or others. The following example uses a table to illustrate the possible scenarios for determining the method of appending the target checksum: Scenario 1: Table 8 shows an example of the correspondence between possible communication channel types and segmentation methods provided in this application embodiment. It can be seen that since broadcast channels do not have high latency requirements, segmentation method three can be used to segment the TB in a broadcast channel, improving segmentation efficiency. Similarly, in the downlink control channel, segmentation method one can be used to reduce latency and improve user experience. Other scenarios are shown in Table 8.

[0361] Table 8: Correspondence between Communication Channel Types and Segmentation Methods

[0362] Scenario 2: Table 9 shows an example of the correspondence between possible communication scenario types and segmentation methods provided in the embodiments of this application. It can be seen that in the video call scenario, segmentation method one can be used to reduce latency and improve user experience. In the scenario of uploading recorded data, segmentation method three can be used. Other scenarios are shown in Table 9.

[0363] Table 9: Correspondence between Communication Scenarios and Verification Code Attachment Methods

[0364] For descriptions related to channel quality indication and code rate, please refer to the descriptions in cases 3 and 5 of step S301. They will not be repeated here.

[0365] In one possible design, the second node can inform the first node of the segmentation methods it supports. The first node then determines the target segmentation method from among the segmentation methods supported by the second node. Optionally, if the second node supports only one segmentation method, then subsequent communication can only use that segmentation method. Optionally, if the second node supports at least two segmentation methods, the segmentation method to be used can be determined through negotiation, priority, or other methods. Further optionally, the first and second nodes can negotiate the segmentation method to be used during the connection establishment process. Alternatively, each time communication occurs, the sending or receiving end can notify the other side of the segmentation method to be used.

[0366] In summary, the target segmentation method used by the first node is a segmentation method supported by the receiving end (such as the second node).

[0367] Optionally, the first node may send a second indication message, which is used to indicate the target segmentation method among multiple segmentation methods. For details regarding the actual sending of the second indication message and the method of sending it, please refer to the relevant description in step S301.

[0368] Optionally, for possible methods of attaching a checksum to the TB and / or sub-data, please refer to the relevant description of the checksum attachment method in step S301.

[0369] S1402: The first node generates at least one codeword based on the M coded blocks.

[0370] For relevant descriptions, please refer to the description in step S302, which will not be repeated here.

[0371] S1403: The first node sends at least one codeword.

[0372] Specifically, the first node can carry the codewords of M coded blocks in the transmission unit and transmit them through the channel. The codewords of the M coded blocks can be presented as a data sequence in the transmission unit for easy description, and this data sequence is called the second data.

[0373] S1404: The second node receives at least one codeword.

[0374] Accordingly, the second node receives at least one codeword. Specifically, the second node receives the second data, and then segments the second data into M coded blocks, each containing its corresponding codeword, to obtain at least one codeword.

[0375] In one design, the second node segments the second data into M codewords corresponding to each coded block based on the target segmentation method among multiple segmentation methods.

[0376] Optionally, the target segmentation method is indicated by a second indication. For example, the second node receives indication information from the first node to determine the target segmentation method.

[0377] Optionally, when receiving the second data, the second node may perform one or more operations such as bit mapping and demodulation. This application does not specify the order of bit mapping, demodulation, etc.

[0378] Optional, Figure 14 The method shown may also include step S1405. Specifically, as follows: S1405: The second node processes the at least one codeword to obtain the information of the first TB.

[0379] Specifically, the second node decodes the at least one codeword to obtain M encoded blocks. When there is a checksum corresponding to the M encoded blocks and / or the first TB, the checksum of the corresponding data is used to verify whether the data has been transmitted correctly.

[0380] For related descriptions, please refer to the relevant descriptions in step S304.

[0381] The above method supports multiple TB block segmentation methods. When segmenting transport blocks, a target segmentation method can be determined from multiple segmentation methods, and the TB is segmented based on the target segmentation method. Because the segmentation method can be flexibly determined, a suitable segmentation method can be determined for different transmission scenarios, thereby improving transmission performance.

[0382] The methods of the embodiments of this application have been described in detail above. The apparatus of the embodiments of this application is provided below.

[0383] It is understood that the various devices provided in the embodiments of this application, such as communication devices, include hardware structures, software units, or combinations of hardware and software structures to perform the functions described in the above method embodiments in order to achieve the functions. Those skilled in the art should readily recognize that, in conjunction with the units and algorithm steps of the various examples described in the embodiments disclosed herein, the embodiments of this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed by hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different device implementations in different usage scenarios to implement the aforementioned method embodiments, and different device implementations should not be considered beyond the scope of the embodiments of this application.

[0384] The embodiments of this application can divide the device into functional units. For example, each function can be divided into its own functional unit, or two or more functions can be integrated into one functional unit. The integrated module can be implemented in hardware or as a software functional unit. It should be noted that the unit division in the embodiments of this application is illustrative and is only a logical functional division; other division methods may be used in actual implementation.

[0385] This application exemplifies a possible communication device, such as Figure 15 As shown. The communication device 150 is used to implement the aforementioned communication method, for example... Figure 3 or and Figure 14 The signal processing method described in this embodiment.

[0386] In one possible implementation, the communication device 150 may include a processing unit 1501 and a communication unit 1502. The processing unit 1501 may be used to implement the processing, generation, or calculation functions in the aforementioned communication method, such as S301 or S302, and / or to support other processes described in the aforementioned method. The communication unit 1502 may be used to execute receiving and / or sending operations in the aforementioned communication method, such as S303, and / or to support other processes described in the aforementioned method, such as sending instruction information, receiving instruction information, etc. In some possible implementations, the communication unit 1502 may also be replaced by a communication interface module and / or a transceiver module, and this interface module and / or transceiver module may be used to support other processes of the technology described in the aforementioned method.

[0387] In one possible design, the communication device 150 is used to implement Figure 3 The method on the first node side of the illustrated embodiment.

[0388] In one possible implementation, the processing unit 1501 is configured to: Based on the target checksum appending method among multiple checksum appending methods, the first TB is processed to obtain the first data, the first data containing M checksum appending methods, the multiple checksum appending methods being predefined or configured, and M being a positive integer; Generate at least one codeword based on the M coded blocks; The communication unit 1502 is used to send the at least one codeword.

[0389] In one possible implementation, the communication unit 1502 is further configured to: send first indication information, the first indication information being used to indicate a target checksum appending method among the plurality of checksum appending methods.

[0390] Optionally, the first indication information can be sent when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is transmitted.

[0391] In one possible implementation, the first indication information is sent via signaling.

[0392] In one possible implementation, the first indication information is carried in the frame header. The frame is a transmission unit, and the frame header, also called the frame header, may contain one or more fields. Specifically, the first indication information can be transmitted through the fields in the frame header.

[0393] In one possible implementation, the target check code appending method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, node communication capability, or code rate, etc.

[0394] In one possible implementation, the target checksum appending method is one of the checksum appending methods supported by the receiving node. In one design, the receiving end can report the checksum appending methods it supports to the sending end, and the sending end determines the target checksum appending method from the checksum appending methods supported by the receiving end.

[0395] In one possible implementation, the correspondence is predefined, preconfigured, or negotiated.

[0396] In one possible implementation, the target checksum appending method is the first checksum appending method among the plurality of checksum appending methods; The first TB and the first cyclic redundancy check (CRC) together correspond to N sub-data, where the first CRC is the CRC corresponding to the first TB, and N is a positive integer. The M CBs include M1 first CBs, each first CB contains a sub-data and a second CRC, the second CRC is the CRC corresponding to the sub-data, and M1≥0; The M CBs include M2 ​​second CBs, the M2 second CBs correspond to N1 sub-data and a third CRC, the third CRC is the CRC that the N1 sub-data all correspond to, M2≥0, N1≥0.

[0397] In one possible implementation, the code length corresponding to the first CB belongs to the first code length; The code length corresponding to the second CB belongs to the second code length, and the first code length and the second code length are different.

[0398] In one possible implementation, M2 + N1 = N.

[0399] In one possible implementation, the M CBs include M3 third CBs, the M3 third CBs correspond to N2 sub-data, the third CBs do not contain CRC, M3≥0, N2≥0.

[0400] In one possible implementation, the target checksum appending method is the second checksum appending method among the plurality of checksum appending methods; The first TB and the first CRC together correspond to the M CBs, and the first CRC is the CRC corresponding to the first TB.

[0401] In one possible implementation, the target checksum appending method is the third checksum appending method among the plurality of checksum appending methods; The first TB and the first CRC of the first TB together correspond to M sub-data, where the first CRC is the CRC corresponding to the first TB, and: Each of the M CBs contains a sub-data and a second CRC, where the second CRC is the CRC corresponding to the sub-data.

[0402] In one possible implementation, the processing unit 1501 is further configured to: Based on the target checksum appending method among multiple checksum appending methods, the first CRC is appended to the first TB to obtain the TB with checksum; According to the target segmentation method among multiple segmentation methods, the TB with checksum is segmented to obtain the M CBs.

[0403] In one possible implementation, the segmentation operation described above is implemented at the object layer of wireless communication.

[0404] In one possible implementation, the target segmentation method is the first segmentation method among multiple segmentation methods; The M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0405] In one possible implementation, the target segmentation method is the second segmentation method among multiple segmentation methods; The M code blocks do not necessarily include a third code block. The code length corresponding to the third code block is the minimum code length among a plurality of predefined code lengths.

[0406] For example, if we take multiple predefined code lengths {1024, 512, 256, 128, 64} as an example, then among the M CBs, there may be a CB with a corresponding code length of 64, or there may be no CB with a corresponding code length of 64.

[0407] In one possible implementation, the code length of any one of the M code blocks is higher than the minimum code length among a set of predefined code lengths.

[0408] In one possible implementation, the code length corresponding to the M CBs is related to the length of the TB. For example, if the data length of the first TB belongs to the first data length, the code length corresponding to any one of the M CBs is higher than the lowest code length among a plurality of predefined code lengths; If the data length of the first TB belongs to the second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0409] In one possible implementation, the communication unit 1502 is further configured to: Send a second instruction message, which is used to indicate the target segmentation method among multiple segmentation methods.

[0410] Optionally, the second indication information can be sent when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is transmitted.

[0411] In one possible implementation, the second indication information is sent via signaling.

[0412] In one possible implementation, the second indication information is carried in the header of the frame. The frame is a possible transmission unit. Furthermore, the second indication information can be transmitted through one or more fields in the frame header.

[0413] In one possible implementation, the code length corresponding to the CB is... The following equations must be satisfied: .

[0414] In one possible implementation, the code length corresponding to the CB belongs to one or more predefined code lengths, and the predefined code lengths include at least one of 1024, 512, 256, 128 or 64.

[0415] In one possible design, the communication device 150 is used to implement Figure 3 The method on the second node side of the illustrated embodiment.

[0416] In one possible implementation, the communication unit 1502 is used to receive at least one codeword; The processing unit 1501 is used to process the at least one codeword according to the target check code appending method among multiple check code appending methods to obtain the information of the first TB, wherein the multiple check code appending methods are predefined or configured.

[0417] In yet another possible implementation, the information in the first TB includes one or more of the following: The first TB, the verification result of the first TB, the sub-data corresponding to at least one CB, the verification result of at least one CB, the sub-data corresponding to at least one CBG, or the verification result of at least one CBG.

[0418] In yet another possible implementation, the communication unit 1502 is further configured to: Receive first indication information, which is used to indicate the target check code appending method among the plurality of check code appending methods.

[0419] In yet another possible implementation, the communication unit 1502 is further configured to: receive first indication information by receiving signaling.

[0420] In another possible implementation, the first indication information is carried in the frame header. Here, the frame is a transmission unit, and the frame header, also called the frame header, may contain one or more fields. Specifically, the first indication information can be transmitted through the fields in the frame header.

[0421] In another possible implementation, the target check code appending method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, node communication capability, or code rate, etc.

[0422] In another possible implementation, the correspondence is predefined, preconfigured, or negotiated.

[0423] In another possible implementation, the target checksum appending method is one of the plurality of checksum appending methods supported by the receiving end. In one design, the receiving end can report its supported checksum appending methods to the sending end, and the sending end determines the target checksum appending method from the checksum appending methods supported by the receiving end.

[0424] In yet another possible implementation, the processing unit 1501 is further configured to: M CBs are obtained based on the at least one codeword, where M is a positive integer; The M CBs are verified according to the target checksum appending method among multiple checksum appending methods to obtain the information of the first TB.

[0425] In another possible implementation, the first TB and the first cyclic redundancy check (CRC) together correspond to N sub-data, where the first CRC is the CRC corresponding to the first TB, and N is a positive integer. Wherein: the M CBs include M1 first CBs, each first CB contains a sub-data and a first CRC, the first CRC corresponds to the sub-data, and M1≥0; The M CBs include M2 ​​second CBs, the M2 second CBs correspond to N1 sub-data and a third CRC, the third CRC is the CRC that the N1 sub-data all correspond to, M2≥0, N1≥0.

[0426] In yet another possible implementation, the processing unit 1501 is further configured to: For the M1 first CBs, the sub-data corresponding to the first CB is verified to be transmitted correctly based on the second CRC contained in each first CB; For the M2 second CBs, the N1 sub-data are verified to ensure they are transmitted correctly according to the third CRC.

[0427] In yet another possible implementation, the processing unit 1501 is further configured to: When the M1 sub-data corresponding to the M1 first CBs are transmitted correctly and the N1 sub-datas are transmitted correctly, a first TB with a checksum is obtained based on the M1 sub-datas and the N1 sub-datas. The first TB with a checksum includes the first TB and the first CRC. The first TB is verified based on the first CRC, and the first TB or the verification result of the first TB is obtained.

[0428] In yet another possible implementation, the code length corresponding to the first CB belongs to the first code length; The code length corresponding to the second CB belongs to the second code length, and the first code length and the second code length are different.

[0429] In yet another possible implementation, M2 + N1 = N.

[0430] In another possible implementation, the M CBs include M3 third CBs, the M3 third CBs correspond to N2 sub-data, the third CBs do not contain CRC, M3≥0, N2≥0.

[0431] In another possible implementation, the first TB and the first CRC together correspond to the M CBs, and the first CRC is the CRC corresponding to the first TB.

[0432] In yet another possible implementation, the processing unit 1501 is further configured to: Based on the M CBs, a first TB with a checksum is obtained, wherein the first TB with a checksum includes the first TB and the first CRC; The first TB is verified based on the first CRC, and the first TB or the verification result of the first TB is obtained.

[0433] In another possible implementation, the first TB and the first cyclic redundancy check (CRC) of the first TB together correspond to M sub-data, wherein: Each CB contains a sub-data and a second CRC corresponding to the sub-data.

[0434] In yet another possible implementation, the processing unit 1501 is further configured to: For the M CBs, the sub-data contained in each CB is checked for correct transmission based on the second CRC contained in each CB; When the M sub-data are transmitted correctly, a first TB with a checksum is obtained based on the M sub-data, wherein the first TB with a checksum includes the first TB and the first CRC; The first TB is verified based on the first CRC, and the first TB or the verification result of the first TB is obtained.

[0435] In another possible implementation, the M CBs are obtained based on a target segmentation method among multiple segmentation methods.

[0436] In yet another possible implementation, the target segmentation method is the first segmentation method among a plurality of segmentation methods; The M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0437] In yet another possible implementation, the target segmentation method is the second segmentation method among multiple segmentation methods; The M code blocks do not necessarily include a third code block. The code length corresponding to the third code block is the minimum code length among a plurality of predefined code lengths.

[0438] For example, if we take multiple predefined code lengths {1024, 512, 256, 128, 64} as an example, then among the M CBs, there may be a CB with a corresponding code length of 64, or there may be no CB with a corresponding code length of 64.

[0439] In one possible implementation, the code length of any one of the M code blocks is higher than the minimum code length among a set of predefined code lengths.

[0440] In one possible implementation, the code length corresponding to the M CBs is related to the length of the TB. For example, if the data length of the first TB belongs to the first data length, the code length corresponding to any one of the M CBs is higher than the lowest code length among a plurality of predefined code lengths; If the data length of the first TB belongs to the second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0441] In yet another possible implementation, the communication unit 1502 is further configured to: Receive second instruction information, which is used to indicate the target segmentation method among multiple segmentation methods.

[0442] In yet another possible implementation, the communication unit is further configured to: receive the second indication information by receiving signaling.

[0443] In another possible implementation, the second indication information is carried in the header of a frame, which is a transmission unit. Optionally, the second indication information can be transmitted through fields in the frame header.

[0444] In yet another possible implementation, the code length corresponding to the CB is... The following equations must be satisfied: .

[0445] In another possible implementation, the code length corresponding to the CB belongs to one or more predefined code lengths, and the predefined code lengths include at least one of 1024, 512, 256, 128 or 64.

[0446] In one possible design, the communication device 150 is used to implement Figure 14 The method on the first node side of the illustrated embodiment.

[0447] In one possible implementation, the processing unit 1501 is configured to: Based on the target segmentation method among multiple segmentation methods, first data is obtained based on the first TB. The first data contains M CBs. The multiple segmentation methods are predefined or configured, and M is a positive integer. Generate at least one codeword based on the M coded blocks; The communication unit 1502 is used to send the at least one codeword.

[0448] Optionally, the communication device is a communication node or a component within a communication node.

[0449] In yet another possible implementation, the above method is implemented at the object layer of wireless communication.

[0450] In yet another possible implementation, the target segmentation method is the first segmentation method among a plurality of segmentation methods; The M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0451] In yet another possible implementation, the target segmentation method is the second segmentation method among multiple segmentation methods; The M code blocks do not necessarily include a third code block. The code length corresponding to the third code block is the minimum code length among a plurality of predefined code lengths.

[0452] For example, if we take multiple predefined code lengths {1024, 512, 256, 128, 64} as an example, then among the M CBs, there may be a CB with a corresponding code length of 64, or there may be no CB with a corresponding code length of 64.

[0453] In one possible implementation, the code length of any one of the M code blocks is higher than the minimum code length among a set of predefined code lengths.

[0454] In one possible implementation, the code length corresponding to the M CBs is related to the length of the TB. For example, if the data length of the first TB belongs to the first data length, the code length corresponding to any one of the M CBs is higher than the lowest code length among a plurality of predefined code lengths; If the data length of the first TB belongs to the second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

[0455] In yet another possible implementation, the communication unit 1502 is further configured to: Send a second instruction message, which is used to indicate the target segmentation method among multiple segmentation methods.

[0456] Optionally, the second indication information can be sent when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is transmitted.

[0457] In yet another possible implementation, the second indication information is sent via signaling.

[0458] In another possible implementation, the second indication information is carried in the header of a frame, which is a transmission unit. Optionally, the second indication information can be transmitted through fields in the frame header.

[0459] In yet another possible implementation, the code length corresponding to the CB is... The following equations must be satisfied: .

[0460] In another possible implementation, the code length corresponding to the CB belongs to one or more predefined code lengths, and the predefined code lengths include at least one of 1024, 512, 256, 128 or 64.

[0461] In another possible implementation, the target segmentation method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, or node communication capability, etc.

[0462] In another possible implementation, the target segmentation method belongs to the segmentation methods supported by the receiver. In one design, the receiver can report its supported segmentation methods to the transmitter, and the transmitter determines the target checksum appending method from the segmentation methods supported by the receiver.

[0463] In another possible implementation, the correspondence is predefined, preconfigured, or negotiated.

[0464] In one possible design, the communication device 150 is used to implement Figure 14 The method on the second node side of the illustrated embodiment.

[0465] In one possible implementation, the communication unit 1502 is configured to receive the second data to obtain at least one codeword according to a target segmentation method among a plurality of segmentation methods, wherein the plurality of segmentation methods are predefined or configured. The processing unit 1501 is used to process the at least one codeword to obtain information of the first TB.

[0466] In one possible implementation, the communication unit 1502 is further configured to receive second data; The processing unit 1501 is further configured to obtain the at least one codeword based on the second data according to the target segmentation method in the segmentation method.

[0467] In yet another possible implementation, the at least one codeword corresponds to M CBs.

[0468] In yet another possible implementation, the above method is implemented at the object layer of wireless communication.

[0469] In another possible implementation, the M CBs include at least one third CB, the code length of which is the lowest among a plurality of predefined code lengths.

[0470] In another possible implementation, among the M CBs, the code length corresponding to any one CB is higher than the lowest code length among a plurality of predefined code lengths.

[0471] In yet another possible implementation, the communication unit 1502 is further configured to: Receive second instruction information, which is used to indicate the target segmentation method among multiple segmentation methods.

[0472] Optionally, the second indication information can be received when the sending node and the receiving node establish a communication connection, or after the connection is established, or when a certain piece of information is being transmitted.

[0473] In another possible implementation, the communication unit 1502 is further configured to: receive the second indication information by receiving signaling.

[0474] In another possible implementation, the second indication information is carried in the header of a frame, which is a transmission unit. Optionally, the second indication information can be transmitted through fields in the frame header.

[0475] In yet another possible implementation, the code length corresponding to the CB is... The following equations must be satisfied: .

[0476] In another possible implementation, the code length corresponding to the CB belongs to one or more predefined code lengths, and the predefined code lengths include at least one of 1024, 512, 256, 128 or 64.

[0477] In another possible implementation, the target segmentation method corresponds to one or more of the following information: communication channel type, communication scenario type, channel quality indicator, or node communication capability, etc.

[0478] In another possible implementation, the target segmentation method belongs to the segmentation methods supported by the receiving end. In one design, the receiving end can report the segmentation methods it supports to the sending end, and the sending end determines the target checksum appending method from the segmentation methods supported by the receiving end.

[0479] In another possible implementation, the correspondence is predefined, preconfigured, or negotiated.

[0480] Please see Figure 16 , Figure 16 This is a schematic diagram of the structure of a communication device 160 provided in an embodiment of this application. The communication device 160 can be a node or a component within a node (such as a chip, software module, or hardware module). The communication device 160 may include at least one processor 1601. Optionally, it may also include a communication interface 1602. Further optionally, the communication device 160 may also include at least one memory 1603. Even more optionally, it may also include a bus 1604, wherein the processor 1601, the communication interface 1602, and the memory 1603 are connected through the bus 1604.

[0481] The processor 1601 is a module that performs arithmetic and / or logical operations. Specifically, it can be one or a combination of processing modules such as a central processing unit (CPU), a graphics processing unit (GPU), a microprocessor unit (MPU), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), a complex programmable logic device (CPLD), a coprocessor (to assist the central processing unit in completing corresponding processing and applications), and a microcontroller unit (MCU).

[0482] The communication interface 1602 can be used to provide information input or output to the at least one processor. And / or, the communication interface 1602 can be used to receive data transmitted externally and / or transmit data externally, and can be a wired link interface including an Ethernet cable, or a wireless link interface (Wi-Fi, Bluetooth, general wireless transmission, vehicular short-range communication technology, and other short-range wireless communication technologies, etc.). Optionally, the communication interface 1602 may also include a transmitter (such as a radio frequency transmitter, antenna, etc.) or a receiver coupled to the interface.

[0483] The memory 1603 provides storage space, in which data such as the operating system and computer programs can be stored. The memory 1603 can be one or a combination of several of the following: random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), or compact disc read-only memory (CD-ROM).

[0484] At least one processor 1601 in the communication device 160 is used to execute the aforementioned communication method, for example... Figure 3 ,or Figure 14 The methods described in the embodiments are as follows. Related content can be found in the foregoing and will not be repeated here.

[0485] Optionally, processor 1601 can be a processor specifically designed to execute these methods (for clarity, referred to as a dedicated processor), or a processor that executes these methods by invoking a computer program, such as a general-purpose processor. Optionally, at least one processor may include both dedicated and general-purpose processors. Optionally, if the communication device 160 includes at least one processor 1601, the aforementioned computer program may be stored in memory 1603.

[0486] This application provides a chip that may include a processor and an interface, the processor being configured to read instructions through the interface to perform the method as described in any one of the first to fourth aspects above.

[0487] This application also provides a computer-readable storage medium storing instructions that, when executed on at least one processor, implement the aforementioned communication method, for example... Figure 3 ,or Figure 14 The method described.

[0488] This application also provides a computer program product including computer instructions that, when executed by a computing device, implement the aforementioned communication method, for example... Figure 3 ,or Figure 14 The method described.

[0489] In this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplary" or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner.

[0490] In this application, "at least one" in the embodiments refers to one or more items, and "more than one" refers to two or more items. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or multiple items. For example, at least one of a, b, or c can represent: a, b, c, (a and b), (a and c), (b and c), or (a and b and c), where a, b, and c can be single or multiple. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects have an "or" relationship.

[0491] Furthermore, unless otherwise stated, the use of ordinal numbers such as "first" and "second" in the embodiments of this application is for distinguishing multiple objects and is not for limiting the order, sequence, priority, or importance of multiple objects. For example, "first device" and "second device" are only for ease of description and do not indicate that the first device and the second device are different in structure, importance, etc. In some embodiments, the first device and the second device may also be the same device.

[0492] In the above embodiments, the term "when..." can be interpreted, depending on the context, as meaning "if...", "after...", "in response to determining...", or "in response to detecting...". The above descriptions are merely optional embodiments of this application and are not intended to limit this application. Any modifications, equivalent substitutions, improvements, etc., made within the concept and principles of this application should be included within the protection scope of this application.

[0493] Those skilled in the art will understand that all or part of the steps of the above embodiments can be implemented by hardware or by a program instructing related hardware. The program can be stored in a computer-readable storage medium, such as a read-only memory, a disk, or an optical disk.

Claims

1. A communication method, characterized in that, include: According to the target check code appending method among multiple check code appending methods, the first transport block TB is processed to obtain the first data, the first data containing M coded blocks CB; The multiple checksum appending methods are used to indicate the rules for appending checksums to the first TB and the sub-data corresponding to the first TB. The multiple checksum appending methods are predefined or configured, and M is a positive integer. Generate at least one codeword based on the M coded blocks; Send at least one codeword; The plurality of check code appending methods include at least a first check code appending method; The first checksum appending method is to append a first CRC to the first TB, and the first TB and the first CRC together correspond to N sub-data. Among the N sub-data, N2 sub-data are appended with CRC separately, and N1 sub-data among the N sub-data together correspond to a third CRC. N is a positive integer, N1>0, N2>0. The M CBs include M1 first CBs, each first CB contains a sub-data and a second CRC, the second CRC is the CRC corresponding to the sub-data, M1>0, M1=N2; The M CBs include M2 ​​second CBs, each corresponding to one of the N1 sub-data items and a third CRC. The third CRC is the CRC commonly associated with the N1 sub-data items. 0; The code length corresponding to the first CB belongs to the first code length, and the code length corresponding to the second CB belongs to the second code length. The first code length and the second code length are different.

2. The method according to claim 1, characterized in that, The method further includes: Send a first indication message, which is used to indicate the target check code appending method among the plurality of check code appending methods.

3. The method according to claim 2, characterized in that, The first indication information is carried in the header of the frame.

4. The method according to claim 1, characterized in that, The target verification code appending method corresponds to one or more of the following information: Communication channel type, communication scenario type, channel quality indicator, node communication capability, or code rate.

5. The method according to claim 4, characterized in that, The correspondence is predefined, preconfigured, or negotiated.

6. The method according to claim 1, characterized in that, The target checksum appending method is one of the multiple checksum appending methods supported by the receiving end.

7. The method according to any one of claims 1-6, characterized in that, The plurality of checksum appending methods also includes a second checksum appending method, wherein the target checksum appending method is the second checksum appending method: The first TB and the first CRC together correspond to the M CBs, and the first CRC is the CRC corresponding to the first TB.

8. The method according to any one of claims 1-6, characterized in that, The plurality of checksum appending methods also includes a third checksum appending method, and the target checksum appending method is the third checksum appending method: The first TB and the first CRC of the first TB together correspond to M sub-data, where the first CRC is the CRC corresponding to the first TB, and: Each of the M CBs contains a sub-data and a second CRC, where the second CRC is the CRC corresponding to the sub-data.

9. The method according to any one of claims 1-6, characterized in that, Based on the target checksum appending method among multiple checksum appending methods, the first transport block TB is processed to obtain the first data, including: Based on the target checksum appending method among multiple checksum appending methods, the first CRC is appended to the first TB to obtain the TB with checksum; According to the target segmentation method among multiple segmentation methods, the TB with checksum is segmented to obtain the M CBs.

10. The method according to claim 9, characterized in that, The target segmentation method is the first segmentation method among multiple segmentation methods: The M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

11. The method according to claim 9, characterized in that, The target segmentation method is the second segmentation method among multiple segmentation methods: If the data length of the first TB belongs to the first data length, then the code length of any one of the M CBs is higher than the lowest code length among the predefined multiple code lengths; If the data length of the first TB belongs to the second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

12. The method according to claim 9, characterized in that, The method further includes: Send a second instruction message, which is used to indicate the target segmentation method among multiple segmentation methods.

13. The method according to claim 12, characterized in that, The second indication information is carried in the header of the frame.

14. The method according to any one of claims 1-6, characterized in that, The code length corresponding to the CB The following equations must be satisfied: ； Alternatively, the code length corresponding to the CB belongs to one or more predefined code lengths, and the predefined code lengths include at least one of 1024, 512, 256, 128 or 64.

15. A communication method, characterized in that, include: Receive at least one codeword, which is generated by M coded blocks CB; Based on the target check code appending method among multiple check code appending methods, the at least one codeword is processed to obtain the information of the first transport block TB; The multiple checksum appending methods are used to indicate the rules for appending checksums to the first TB and the sub-data corresponding to the first TB. The multiple checksum appending methods are predefined or configured. The plurality of check code appending methods include at least a first check code appending method; The first checksum appending method is to append a first CRC to the first TB, and the first TB and the first CRC together correspond to N sub-data. Among the N sub-data, N2 sub-data are appended with CRC separately, and N1 sub-data among the N sub-data together correspond to a third CRC. N is a positive integer, N1>0, N2>0. The M CBs include M1 first CBs, each first CB contains a sub-data and a second CRC, the second CRC is the CRC corresponding to the sub-data, M1>0, M1=N2; The M CBs include M2 ​​second CBs, each M2 second CB corresponding to the N1 sub-data and the third CRC, the third CRC being the CRC commonly corresponding to the N1 sub-data. 0; The code length corresponding to the first CB belongs to the first code length, and the code length corresponding to the second CB belongs to the second code length. The first code length and the second code length are different.

16. The method according to claim 15, characterized in that, The information of the first transport block TB includes one or more of the following: The first TB, the verification result of the first TB, the sub-data corresponding to at least one coded block CB, the verification result of at least one CB, the sub-data corresponding to at least one coded block group CBG, or the verification result of at least one CBG.

17. The method according to claim 15, characterized in that, The method further includes: Receive first indication information, which is used to indicate the target check code appending method among the plurality of check code appending methods.

18. The method according to claim 17, characterized in that, The first indication information is carried in the header of the frame.

19. The method according to claim 15, characterized in that, The target verification code appending method corresponds to one or more of the following information: Communication channel type, communication scenario type, channel quality indicator, node communication capability, or code rate.

20. The method according to claim 19, characterized in that, The correspondence is predefined, preconfigured, or negotiated.

21. The method according to any one of claims 15-20, characterized in that, The step of processing the at least one codeword according to the target checksum appending method among multiple checksum appending methods to obtain the information of the first transport block TB includes: M CBs are obtained based on the at least one codeword, where M is a positive integer; The M CBs are verified according to the target checksum appending method among multiple checksum appending methods to obtain the information of the first TB.

22. The method according to any one of claims 15-20, characterized in that, The step of verifying the M CBs according to the target checksum appending method among multiple checksum appending methods to obtain the information of the first TB includes: For the M1 first CBs, the sub-data corresponding to the first CB is verified to be transmitted correctly based on the second CRC contained in each first CB; For the M2 second CBs, the N1 sub-data are verified to ensure they are transmitted correctly according to the third CRC.

23. The method according to claim 22, characterized in that, The method further includes: When the M1 sub-data corresponding to the M1 first CBs are transmitted correctly and the N1 sub-datas are transmitted correctly, a first TB with a checksum is obtained based on the M1 sub-datas and the N1 sub-datas. The first TB with a checksum includes the first TB and the first CRC. The first TB is verified based on the first CRC, and the first TB or the verification result of the first TB is obtained.

24. The method according to claim 21, characterized in that, The first TB and the first CRC together correspond to the M CBs, and the first CRC is the CRC corresponding to the first TB.

25. The method according to claim 24, characterized in that, The step of verifying the M CBs according to the target checksum appending method among multiple checksum appending methods to obtain the information of the first TB includes: Based on the M CBs, a first TB with a checksum is obtained, wherein the first TB with a checksum includes the first TB and the first CRC; The first TB is verified based on the first CRC, and the first TB or the verification result of the first TB is obtained.

26. The method according to claim 21, characterized in that, The M CBs are obtained based on the target segmentation method among multiple segmentation methods.

27. The method according to claim 26, characterized in that, The target segmentation method is the first segmentation method among multiple segmentation methods: The M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

28. The method according to claim 26, characterized in that, The target segmentation method is the second segmentation method among multiple segmentation methods: If the data length of the first TB belongs to the first data length, then the code length of any one of the M CBs is higher than the lowest code length among the predefined multiple code lengths; If the data length of the first TB belongs to the second data length, the M CBs include at least one third CB, and the code length corresponding to the third CB is the lowest code length among a plurality of predefined code lengths.

29. The method according to any one of claims 26-28, characterized in that, The method further includes: Receive second instruction information, which is used to indicate the target segmentation method among multiple segmentation methods.

30. The method according to claim 29, characterized in that, The second indication information is carried in the header of the frame.

31. The method according to any one of claims 15-20, characterized in that, The code length corresponding to the CB The following equations must be satisfied: ； Alternatively, the code length corresponding to the CB belongs to one or more predefined code lengths, and the predefined code lengths include at least one of 1024, 512, 256, 128 or 64.

32. A communication device, comprising a processing unit and a communication unit, the communication device being used to implement the method according to any one of claims 1-14.

33. A communication device, comprising a processing unit and a communication unit, the communication device being used to implement the method according to any one of claims 15-31.

34. A communication device, characterized in that, The communication device includes at least one processor and a communication interface; The communication interface is used to receive and / or send data, and / or the communication interface is used to provide input and / or output to the processor; The at least one processor is used to implement the method according to any one of claims 1-14, or to implement the method according to any one of claims 15-31.

35. A terminal, characterized in that, The terminal includes the communication device as described in any one of claims 32-34.

36. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores instructions that, when executed on at least one processor, implement the method as described in any one of claims 1-14, or implement the method as described in any one of claims 15-31.

Images