Communication method, device, equipment, chip and medium

By dynamically controlling the encoding process and determining whether to stop encoding based on the information length and target bit rate, the problems of low encoding efficiency and long encoding time are solved, achieving more efficient encoding operations and resource utilization.

CN121333488APending Publication Date: 2026-01-13BEIJING X RING TECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202511393916.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-09-26
Publication Date
2026-01-13

AI Technical Summary

Technical Problem

In communication protocols, there are problems such as low encoding throughput and excessive encoding time during the encoding process. In particular, when the encoding length is greater than the available transmission resources, puncturing is required, which leads to the generation of redundant check bits and affects encoding efficiency.

Method used

By encoding the first information, the encoding length is dynamically determined, and the length of the encoded output and the information length are used to determine whether to stop encoding, thus avoiding unnecessary encoding operations. Precise control is achieved by combining the target bitrate and base map type.

Benefits of technology

It improved coding throughput, shortened coding time, optimized resource utilization, and enhanced the overall performance of the communication system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121333488A_ABST
    Figure CN121333488A_ABST
Patent Text Reader

Abstract

The invention provides a communication method and device, equipment, a chip and a medium, and the communication method comprises the steps: carrying out the coding of first information, and obtaining second information; determining a first coding length according to the length of the first information; and determining whether to stop coding according to the length of the second information and the first coding length. The technical problem that the coding time is prolonged due to the fact that the throughput efficiency of coding is not high in the face of large data volume in the prior art is solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to a communication method, apparatus, device, chip, and medium. Background Technology

[0002] As communication protocols continue to evolve, physical layer technology is also constantly innovating to more efficiently support higher-level data transmission. In these protocols, the physical layer not only provides data services through transmission channels but also generates uplink and downlink control information to support related operations. The physical layer performs several processing steps on the data and control information of the upper-layer transmission channels, including Cyclic Redundancy Check (CRC), code block segmentation, channel coding, rate matching, and code block concatenation. Summary of the Invention

[0003] This disclosure aims to at least partially address one of the technical problems in the related art.

[0004] To this end, this disclosure proposes a communication method, apparatus, communication device, chip, computer-readable storage medium, and computer program product that can control the encoding operation based on the actual length of the encoded output to avoid unnecessary encoding operations, thereby improving the encoding throughput and shortening the encoding time.

[0005] A first aspect of this disclosure provides a communication method, comprising: encoding first information to obtain second information; determining a first encoding length based on the length of the first information; and determining whether to stop encoding based on the length of the second information and the first encoding length.

[0006] A second aspect of this disclosure provides a communication device, comprising: an encoding module for encoding first information to obtain second information; a first determining module for determining a first encoding length based on the length of the first information; and a second determining module for determining whether to stop encoding based on the length of the second information and the first encoding length.

[0007] A third aspect of this disclosure provides a communication device, including: a processor and a memory communicatively connected to the processor; the memory stores computer-executable instructions; the processor executes the computer-executable instructions stored in the memory to implement the communication method as described in the above-described aspects of this disclosure.

[0008] A fourth aspect of this disclosure provides a chip including a processing circuit and an interface circuit; wherein the interface circuit is used to read instructions and send instructions to the processing circuit so that the processing circuit executes the communication method as proposed in the first aspect of this disclosure.

[0009] A fifth aspect of this disclosure provides a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, are used to implement the communication method described above.

[0010] The communication method, apparatus, communication device, chip, computer-readable storage medium, and computer program product provided in this disclosure encode first information to obtain second information, determine a first encoding length based on the length of the first information, and determine whether to stop encoding based on the length of the second information and the first encoding length. Therefore, the encoding operation can be controlled based on the actual length of the encoded output to avoid unnecessary encoding operations, thereby improving encoding throughput and shortening encoding time.

[0011] Additional aspects and advantages of this disclosure will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of this disclosure. Attached Figure Description

[0012] The above and / or additional aspects and advantages of this disclosure will become apparent and readily understood from the following description of the embodiments taken in conjunction with the accompanying drawings, in which:

[0013] Figure 1 This is a schematic diagram of the architecture of a communication system according to an embodiment of the present disclosure;

[0014] Figure 2 This is a flowchart illustrating a communication method provided in an embodiment of the present disclosure;

[0015] Figure 3 This is a flowchart illustrating another communication method provided in an embodiment of the present disclosure;

[0016] Figure 4 This is a schematic diagram of the encoding processing flow in an embodiment of this disclosure;

[0017] Figure 5 This is a schematic diagram of the structure of a communication device provided in an embodiment of the present disclosure;

[0018] Figure 6 A block diagram of an exemplary communication device suitable for implementing embodiments of the present disclosure is shown;

[0019] Figure 7 This is a schematic diagram of the structure of a chip according to an embodiment of this disclosure;

[0020] Figure 8 This is a schematic diagram of another chip structure proposed in an embodiment of this disclosure. Detailed Implementation

[0021] Embodiments of this disclosure are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and intended to explain this disclosure, and should not be construed as limiting this disclosure.

[0022] In the embodiments of this disclosure, the communication device may be, for example, a terminal, a network device, or a chip, and there is no limitation thereto.

[0023] Figure 1 This is a schematic diagram of the architecture of a communication system according to embodiments of this disclosure. Figure 1 As shown, the communication system 100 may include a terminal 101 and a network device 102. The network device 102 may include at least one of an access network device and a core network device.

[0024] In some embodiments, terminal 101 includes, but is not limited to, at least one of the following: mobile phone, wearable device, Internet of Things device, car with communication function, smart car, tablet computer, computer with wireless transceiver function, virtual reality (VR) terminal, augmented reality (AR) terminal, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, and wireless terminal in smart home.

[0025] In some embodiments, the access network device is, for example, a node or device that connects a terminal to a wireless network. The access network device may include, but is not limited to, at least one of the following in a 5G communication system: evolved Node B (eNB), next-generation eNB (ng-eNB), next-generation Node B (gNB), node B (NB), home node B (HNB), home evolved node B (HeNB), wireless backhaul device, radio network controller (RNC), base station controller (BSC), base transceiver station (BTS), base band unit (BBU), mobile switching center, base station in a 6G communication system, open RAN, cloud RAN, base station in other communication systems, and access node in a WiFi system.

[0026] In some embodiments, the technical solutions of this disclosure can be applied to the Open RAN architecture. In this case, the interfaces between or within access network devices involved in the embodiments of this disclosure can be transformed into internal interfaces of Open RAN. The processes and information interactions between these internal interfaces can be implemented by software or programs.

[0027] In some embodiments, the access network device may be composed of a central unit (CU) and a distributed unit (DU). The CU may also be called a control unit. The CU-DU structure can separate the protocol layer of the access network device. Some of the protocol layer functions are centrally controlled by the CU, while the remaining part or all of the protocol layer functions are distributed in the DU and centrally controlled by the CU. However, this is not the only possibility.

[0028] In some embodiments, a core network device may be a single device comprising one or more network elements, or it may be multiple devices or a group of devices, each comprising all or part of one or more network elements. Network elements may be virtual or physical. The core network includes, for example, at least one of an Evolved Packet Core (EPC), a 5G Core Network (5GCN), and a Next Generation Core (NGC).

[0029] It is understood that the communication system described in this disclosure is for the purpose of more clearly illustrating the technical solutions of this disclosure, and does not constitute a limitation on the technical solutions proposed in this disclosure. As those skilled in the art will know, with the evolution of system architecture and the emergence of new business scenarios, the technical solutions proposed in this disclosure are also applicable to similar technical problems.

[0030] The following embodiments of this disclosure can be applied to Figure 1 The communication system 100 shown, or a part thereof, but not limited to it. Figure 1 The entities shown are illustrative; a communication system may include... Figure 1 All or part of the main body, or may include Figure 1 Other entities besides the main body, the number and form of each entity are arbitrary, the connection relationship between the entities is illustrative, the entities may not be connected or may be connected, and the connection can be in any way, it can be a direct connection or an indirect connection, it can be a wired connection or a wireless connection.

[0031] The embodiments disclosed herein can be applied to Long Term Evolution (LTE), LTE-Advanced (LTE-A), LTE-Beyond (LTE-B), SUPER 3G, IMT-Advanced, 4th generation mobile communication system (4G), 5th generation mobile communication system (5G), 5G new radio (NR), 6th generation mobile communication system (6G), Future Radio Access (FRA), New-Radio Access Technology (RAT), New Radio (NR), New Radio Access (NX), Future Generation Radio Access (FX), Global System for Mobile Communications (GSM), CDMA2000, Ultra Mobile Broadband (UMB), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), and IEEE 802.20, Ultra-Wideband (UWB), Bluetooth (a registered trademark), Public Land Mobile Network (PLMN) networks, Device-to-Device (D2D) systems, Machine-to-Machine (M2M) systems, Internet of Things (IoT) systems, Vehicle-to-Everything (V2X) systems, systems utilizing other communication methods, and next-generation systems built upon them, etc. Furthermore, multiple systems can be combined (e.g., a combination of LTE or LTE-A with 5G).

[0032] As communication protocols continue to evolve, physical layer technologies are also constantly innovating to more efficiently support higher-level data transmission. In these protocols, the physical layer not only provides data services through transmission channels but also generates uplink and downlink control information to support related operations. The physical layer performs several processing steps on the data and control information of the upper-layer transmission channels, including Cyclic Redundancy Check (CRC), block segmentation, channel coding, rate matching, and block concatenation. For traffic channels, advanced coding techniques are particularly important due to the large volume and high complexity of data. Advances in rate matching technology further improve transmission efficiency by matching the number of encoded bits with the actual available transmission resources, ensuring optimal resource utilization. The continuous development of these technologies supports the advancement of communication technologies and plays a crucial role in improving overall network performance.

[0033] In communication protocols, the length of the encoded code block remains relatively fixed during the coding process of downlink service channels. According to the protocol, when using Low Density Parity Check (LDPC) coding, there are two base graphs: base graph 1 with parameters N = 66 Zc and base graph 2 with parameters N = 50 Zc. After coding, the rate matching stage begins. If the number of encoded bits N is greater than the available transmission resource E, puncturing is required to reduce the number of bits to fit the transmission resource. Conversely, if N is less than E, repetition is used to increase the number of bits to meet the required transmission resource requirements. These steps ensure that the encoded data can be effectively transmitted through the physical channel, which is a key technology for improving transmission efficiency and flexibility in communication systems. However, when the coding length N is greater than the available transmission resource E, puncturing is required to remove redundant NE bits. This means that the redundant bits generate redundant parity bits exceeding E in high-rate coding. When dealing with large data volumes, the coding throughput is low, thus prolonging the coding time.

[0034] The method provided in this embodiment encodes first information to obtain second information, determines a first encoding length based on the length of the first information, and determines whether to stop encoding based on the length of the second information and the first encoding length. Therefore, the encoding operation can be controlled based on the actual length of the encoded output to avoid unnecessary encoding operations, thereby improving encoding throughput and shortening encoding time.

[0035] The following description, with reference to the accompanying drawings, describes a communication method, apparatus, device, system, chip, and storage medium according to embodiments of the present disclosure.

[0036] Figure 2 This is a flowchart illustrating a communication method provided in an embodiment of the present disclosure.

[0037] The communication method provided in this embodiment can be applied to a terminal, a network device, or a chip. Optionally, the entity executing the communication method in this embodiment can be, for example, a terminal, a network device, or a chip. The chip can be deployed in a terminal or a network device, or it can be deployed in any other possible device, without limitation.

[0038] like Figure 2 As shown, the communication method includes:

[0039] Step S201: Encode the first information to obtain the second information.

[0040] Optionally, the first information is the encoded input information. For example, the first information could be code block information. Alternatively, the first information could be the information after adding CRC.

[0041] Optionally, the second information is the encoded output information. For example, the second information is the encoded information.

[0042] Optionally, the first information can be input into the encoder, and the encoder can encode the first information to obtain the second information output by the encoder.

[0043] Optionally, the second information output by the encoder can be determined dynamically and in real time during the encoding of the first information. The length of the second information output by the encoder can be different at different encoding times.

[0044] In other words, during the encoding of the first information, the second information of the encoded output can be dynamically determined. The determined second information can be used to determine when to stop the encoding operation. For details, please refer to the following embodiments.

[0045] Step S202: Determine the first encoding length based on the length of the first information.

[0046] Optionally, the length of the first information is used to represent the number of bits contained in the first information.

[0047] Optionally, the first encoding length is a threshold length required to determine the length of the "first information" when the encoding operation stops. The first encoding length can be used as the number of bits to reference whether to stop the encoding operation. The first encoding length can be flexibly set according to actual encoding requirements to adapt to various communication needs.

[0048] Optionally, the first encoding length can be related to the length of the first information. For example, the first encoding length can be calculated based on the length of the first information and the actual encoding requirements, or the first encoding length can be determined based on the length of the first information and the agreed correspondence (which may include the lengths of some possible first information and their corresponding first encoding lengths).

[0049] Optionally, in determining the first encoding length based on the length of the first information, the target bitrate of the physical layer can be obtained, and the first encoding length can be determined based on the length of the first information and the target bitrate. This improves the reference value of the first encoding length and enables more precise encoding operation control.

[0050] In other words, the embodiments of this disclosure are applied to bit-level signal processing at the physical layer, and a target code rate can be configured for the physical layer to achieve fine-grained control over data transmission efficiency and reliability. When determining the first encoding length, it can be calculated by combining the length of the first information and the target code rate.

[0051] Optionally, in determining the first encoding length based on the length of the first information and the target bitrate, the ratio of the length of the first information to the target bitrate can be determined, and this ratio can be used as the first encoding length. This improves the accuracy of the first encoding length, makes it applicable to the actual length of the first information and the target bitrate configured for the physical layer, and also improves computational efficiency and convenience.

[0052] For example, the length of the first information can be represented as K, and the target bit rate is R. Then the length of the first encoding is K / R, where " / " indicates the ratio.

[0053] Step S203: Determine whether to stop encoding based on the length of the second information and the length of the first encoding.

[0054] After encoding the first information to obtain the second information, and determining the first encoding length based on the length of the first information, the length of the second information and the first encoding length can be combined to determine whether to stop encoding.

[0055] Optionally, the length of the second information represents the number of bits contained in the second information. The length of the second information can change dynamically as the encoding process progresses. In this embodiment, the dynamically changing length of the second information can be compared with the first encoding length to determine when to stop the encoding operation.

[0056] Optionally, based on the length of the second information and the length of the first encoding, it can be determined whether a redundant check bit will be generated. If a redundant check bit is generated, encoding can be stopped, and subsequent rate matching operations can be triggered. If no redundant check bit is generated, encoding can continue to be stopped, that is, the first information can be changed to update the second information without restriction.

[0057] In this embodiment, second information is obtained by encoding the first information, and a first encoding length is determined based on the length of the first information. Furthermore, whether to stop encoding is determined based on the length of the second information and the first encoding length. Therefore, the encoding operation can be controlled based on the actual length of the encoded output to avoid unnecessary encoding operations, thereby improving encoding throughput and shortening encoding time.

[0058] Figure 3 This is a flowchart illustrating another communication method provided in an embodiment of the present disclosure.

[0059] The communication method provided in this embodiment can be applied to a terminal, a network device, or a chip. Optionally, the entity executing the communication method in this embodiment can be, for example, a terminal, a network device, or a chip. The chip can be deployed in a terminal or a network device, or it can be deployed in any other possible device, without limitation.

[0060] like Figure 3 As shown, the communication method includes:

[0061] Step S301: Encode the first information to obtain the second information.

[0062] Step S302: Determine the first encoding length based on the length of the first information.

[0063] For a detailed description of S301-S302, please refer to the above embodiments, which will not be repeated here.

[0064] Step S303: If the length of the second information reaches the first encoding length, determine and stop encoding.

[0065] Optionally, the first encoding length is a threshold length that must be reached to determine the length of the "first information" when the encoding operation stops. The first encoding length can be used as the number of bits to reference whether to stop the encoding operation. If the length of the second information reaches the first encoding length (e.g., equal to or greater than the first encoding length), it may indicate that continuing to encode the first information would generate redundant check bits. In this case, the encoding operation can be stopped, which is effective for processing large amounts of data and greatly improves the encoding throughput efficiency while saving encoding time.

[0066] Optionally, after determining and stopping the encoding operation, rate matching of the second information can be initiated. For example, based on the length of the second information, it can be determined whether to perform rate matching punching or rate matching repetition on the second information.

[0067] Step S304: If the length of the second information does not reach the length of the first encoding, determine that encoding will not stop.

[0068] Optionally, if the length of the second information does not reach the first encoding length (e.g., less than the first encoding length), it may mean that the first information continues to be encoded and no redundant check bits are generated. In this case, it can be determined that the encoding operation will not be stopped, which can improve the accuracy of encoding control and ensure the encoding effect.

[0069] Optionally, if it is determined that the length of the second information has not reached the length of the first encoding, encoding will not stop. The length of the encoded output second information can then be checked. This can be done in real-time, periodically, or based on instructions, etc., without limitation.

[0070] Optionally, if it is determined that the length of the second information has not reached the length of the first encoding, encoding will not be stopped. The timing for stopping the encoding operation can then be determined based on the following steps S305-S306.

[0071] Step S305: Determine the second coding length by using the base map required for physical layer coding.

[0072] Optionally, the base graph, also known as `base_graph`, is a sparse matrix template that constrains the checksum of the LDPC code through the distribution of non-zero elements at fixed positions. Optionally, the type of base graph required for encoding can be configured for the physical layer. The base graph types can include `base_graph1` and `base_graph2`, where `base_graph1` has parameters N = 66Zc, and `base_graph2` has parameters N = 50Zc, where N represents the second encoding length, and "Zc" represents the size of the zero matrix in the checksum matrix H.

[0073] The second encoding length is the maximum length required to encode and output the first information. Optionally, the second encoding length can be determined by the type of the base map required for physical layer encoding and the size of the zero matrix in the parity check matrix H.

[0074] Step S306: When the length of the second information reaches the second encoding length, stop encoding the first information.

[0075] Optionally, if it is determined that the length of the second information has not reached the first encoding length, and it is determined that encoding will not stop, then the first information can continue to be encoded until the length of the encoded output second information reaches the second encoding length, at which point the encoding of the first information stops.

[0076] Step S307: Perform rate matching on the second information.

[0077] Optionally, after determining and stopping the encoding operation, rate matching of the second information can be initiated. For example, based on the length of the second information, it can be determined whether to perform rate matching punching or rate matching repetition on the second information.

[0078] In this embodiment, second information is obtained by encoding the first information, and the first encoding length is determined based on the length of the first information. Furthermore, the decision to stop encoding is made based on the length of the second information and the first encoding length. This allows for control of the encoding operation based on the actual length of the encoded output, avoiding unnecessary encoding operations, thereby improving encoding throughput and shortening encoding time. If the length of the second information reaches the first encoding length (e.g., equal to or greater than the first encoding length), it may indicate that continuing to encode the first information would generate redundant check bits. In this case, the encoding operation can be stopped, effectively applicable to large data processing and significantly improving encoding throughput while saving encoding time. If the length of the second information does not reach the first encoding length (e.g., less than the first encoding length), it may indicate that continuing to encode the first information will not generate redundant check bits. In this case, the encoding operation can be continued, improving the accuracy of encoding control and ensuring encoding effectiveness. Moreover, after determining not to stop encoding based on the length of the second information and the first encoding length, the second encoding length can be determined using the base map required for physical layer encoding. If the length of the second information reaches the second encoding length, encoding of the first information can be stopped. It achieves precise coding control and also supports triggering subsequent rate matching after coding stops, thus effectively ensuring compatibility with existing channel processing logic and improving practicality.

[0079] Examples of the above embodiments are illustrated below:

[0080] like Figure 4 As shown, Figure 4 This is a schematic diagram of the encoding process in an embodiment of this disclosure.

[0081] Step 1: You can configure the parameters.

[0082] During the physical layer processing, corresponding coding and rate matching parameters can be configured. These include the base graph (base_graph) configured for the physical layer, the length K of the input code block after adding CRC, the size Zc of the zero matrix in the parity-check matrix H, the target code rate R, and the length E of the rate matching input code block, etc. The configuration of these parameters is used to ensure signal processing performance.

[0083] Step 2: After CRC check, encode the code block.

[0084] Optionally, the input to the Encoder is the code block information obtained from CRC check (an optional example of the first information above). The sequence of the code block information is, for example:

[0085] c0, c1, c2, c3,..., c K-1 ;

[0086] Where K represents the number of bits of the input code block information (an optional example of the length of the first information above).

[0087] Optionally, after the encoder processing, the length of the encoding output can be judged according to the actual situation (an optional example of the length of the second information above), and the encoding is stopped when the set condition (an optional example of configuring the first encoding length above) is reached. This allows dynamic adjustment of the encoding process to improve efficiency and reduce unnecessary computational burden.

[0088] Step 3: Calculate K / R (an optional example of the first encoding length above, K is an optional example of the length of the first information above, R represents the target code rate of the physical layer, and " / " represents finding the ratio).

[0089] Optionally, according to the protocol agreement, K / R can be calculated through the target code rate R.

[0090] Optionally, assume the length of the code block information K = 8448 bit (bits), the target code rate (R) = 948 / 1024 = 0.925, then K / R = 8448 / 0.925 = 9125 bit.

[0091] Step 4: Judge whether N > E.

[0092] Optionally, if N < E, directly encode according to the following encoding method until the length N is completed. The encoded information is, for example: d0, d1, d2, d3,..., d N-1 , and then enter the rate matching repetition.

[0093] Optionally, the encoding method is, for example:

[0094]

[0095] Among them, the parity-check matrix H, c represents the codeword, and w represents the weight.

[0096] Optionally, if N > E, the fifth step can be specifically performed according to whether the output length (encode_length) of the encoder reaches the target code rate.

[0097] The fifth step: Determine whether the target code rate is reached.

[0098] Optionally, during the encoding process, it is determined whether the target code rate is reached by judging whether the output length encode_length of the encoder exceeds K / R.

[0099] Optionally, if encode_length exceeds K / R, the encoding can be stopped to ensure the efficiency of the encoding process and the optimal utilization of resources, which is an important strategy for optimizing the encoding process.

[0100] The sixth step: Rate matching. Optionally, if encode_length > E, enter rate-matching puncturing, and punch out some bits according to a certain pattern and remove them from the bit sequence. Optionally, if N < E, enter rate-matching repetition, and insert the current bit once between the current bit and the subsequent bit.

[0101] Optionally, the rate-matching output is: f0, f1, f2, f3,..., f E-1 .

[0102] In the solution provided in the embodiments of the present disclosure, by prematurely terminating the encoding when the encoding length of the encoder output exceeds E / R, the encoding throughput rate is improved by reducing unnecessary encoding operations, and the encoding time is shortened. Therefore, within the same channel processing time, the same number of data encoding tasks can be completed with fewer encoders. This not only improves the efficiency of the system but also reduces the consumption of hardware resources and energy usage, resulting in a significant improvement in the overall system performance.

[0103] Figure 5 It is a schematic structural diagram of a communication device provided by an embodiment of the present disclosure.

[0104] As Figure 5 shown, the communication device 50 includes:

[0105] An encoding module 501, configured to encode the first information to obtain second information.

[0106] A first determination module 502, configured to determine a first encoding length according to the length of the first information.

[0107] The second determining module 503 is used to determine whether to stop encoding based on the length of the second information and the length of the first encoding.

[0108] Optionally, in some embodiments of this disclosure, the first determining module 502 is configured to:

[0109] Obtain the target bitrate at the physical layer;

[0110] The first encoding length is determined based on the length of the first information and the target bit rate.

[0111] Optionally, in some embodiments of this disclosure, the first determining module 502 is configured to:

[0112] Determine the ratio of the length of the first information to the target bit rate, and set the ratio as the first coding length.

[0113] Optionally, in some embodiments of this disclosure, the second determining module 503 is used for:

[0114] When the length of the second information reaches the length of the first encoding, the encoding is stopped.

[0115] If the length of the second information does not reach the length of the first encoding, it is determined not to stop encoding.

[0116] Optionally, in some embodiments of this disclosure, the second determining module 503 is used to stop encoding the first information after determining to stop encoding.

[0117] Optionally, in some embodiments of this disclosure, the second determining module 503 is used to determine the second encoding length by means of the base map required for encoding at the physical layer after determining that encoding should not be stopped; and to stop encoding the first information when the length of the second information reaches the second encoding length.

[0118] Optionally, in some embodiments of this disclosure, the second determining module 503 is further configured to perform rate matching on the second information.

[0119] It should be noted that the foregoing explanation of the communication method embodiment also applies to the communication device of this embodiment, and will not be repeated here.

[0120] In this embodiment, second information is obtained by encoding the first information, and a first encoding length is determined based on the length of the first information. Furthermore, whether to stop encoding is determined based on the length of the second information and the first encoding length. Therefore, the encoding operation can be controlled based on the actual length of the encoded output to avoid unnecessary encoding operations, thereby improving encoding throughput and shortening encoding time.

[0121] To implement the above embodiments, this disclosure also proposes a communication device, including: a processor and a memory communicatively connected to the processor; the memory stores computer-executable instructions; the processor executes the computer-executable instructions stored in the memory to implement the method provided in the foregoing embodiments.

[0122] Alternatively, in some embodiments, the communication device may be, for example, a terminal, a network device, or a chip, without limitation.

[0123] Figure 6 A block diagram of an exemplary communication device suitable for implementing embodiments of the present disclosure is shown. Figure 6 The communication device 12 shown is merely an example and should not be construed as limiting the functionality and scope of the embodiments disclosed herein. The communication device may be, for example, a terminal, and there is no limitation thereto.

[0124] like Figure 6 As shown, the communication device 12 is presented in the form of a general-purpose computing device. The components of the communication device 12 may include, but are not limited to: one or more processors or processing units 16, memory 28, and bus 18 connecting different system components (including memory 28 and processing unit 16).

[0125] Bus 18 represents one or more of several bus architectures, including a memory bus or memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any of the various bus architectures. For example, these architectures include, but are not limited to, the Industry Standard Architecture (ISA) bus, the Micro Channel Architecture (MAC) bus, the Enhanced ISA bus, the Video Electronics Standards Association (VESA) local bus, and the Peripheral Component Interconnect (PCI) bus.

[0126] The communication device 12 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the communication device 12, including volatile and non-volatile media, and removable and non-removable media.

[0127] Memory 28 may include computer system readable media in the form of volatile memory, such as Random Access Memory (RAM) 30 and / or cache 32. Communication device 12 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, storage system 34 may be used to read and write non-removable, non-volatile magnetic media (…). Figure 6 Not shown; usually referred to as a "hard drive".

[0128] although Figure 6 Not shown, a disk drive for reading and writing to a removable non-volatile disk (e.g., a "floppy disk") and an optical disc drive for reading and writing to a removable non-volatile optical disc (e.g., a compact disc read-only memory (CD-ROM), a digital video disc read-only memory (DVD-ROM), or other optical media) may be provided. In these cases, each drive may be connected to bus 18 via one or more data media interfaces. Memory 28 may include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of the embodiments of this disclosure.

[0129] A program / utility 40 having a set (at least one) of program modules 42 may be stored, for example, in memory 28. Such program modules 42 include, but are not limited to, an operating system, one or more application programs, other program modules, and program data. Each or some combination of these examples may include an implementation of a network environment. Program modules 42 typically perform the functions and / or methods described in the embodiments of this disclosure.

[0130] The communication device 12 can also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), and with one or more devices that enable human interaction with the communication device 12, and / or with any device that enables the communication device 12 to communicate with one or more other computing devices (e.g., network card, modem, etc.). This communication can be performed via input / output (I / O) interface 22. Furthermore, the communication device 12 can also communicate with one or more networks (e.g., local area network (LAN), wide area network (WAN), and / or public networks, such as the Internet) via network adapter 20. As shown, network adapter 20 communicates with other modules of the communication device 12 via bus 18. It should be understood that, although not shown in the figures, other hardware and / or software modules can be used in conjunction with the communication device 12, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0131] The processing unit 16 executes various functional applications and data processing by running programs stored in the memory 28, such as implementing the methods mentioned in the foregoing embodiments.

[0132] To implement the above embodiments, this disclosure also proposes a chip, including: the chip includes processing circuitry configured to perform the methods provided in the foregoing embodiments.

[0133] Figure 7 This is a schematic diagram of the structure of a chip according to an embodiment of this disclosure. See also... Figure 7 The diagram shown is a schematic representation of the structure of chip 700, but is not limited thereto.

[0134] Chip 700 includes processing circuit 701 and interface circuit 702. Interface circuit 702 is used to read instructions and send instructions to processing circuit 701 so that processing circuit 701 executes the method in the above embodiment.

[0135] Optionally, such as Figure 8 As shown, Figure 8 This is a schematic diagram of another chip structure proposed in an embodiment of this disclosure. Chip 700 may further include: a memory 703 for storing instructions, and an interface circuit 702 for reading the instructions stored in the memory 703.

[0136] Optionally, the interface circuit 702 is connected to the memory 703. The interface circuit 702 can be used to receive signals from the memory 703 or other devices, and can also be used to send signals to the memory 703 or other devices. For example, the interface circuit 702 can read instructions stored in the memory 703 and send those instructions to the processing circuit 701.

[0137] Optionally, the number of memories 703 can be one or more. The number of interface circuits 702 can also be one or more.

[0138] In some embodiments, the interface circuit 702 performs at least one of the communication steps such as sending and / or receiving in the above method, and the processing circuit 701 performs other steps.

[0139] In some embodiments, the terms interface circuit, interface, transceiver pin, transceiver, etc., can be used interchangeably.

[0140] Alternatively, all or part of the memory 703 may be located outside of the chip 700.

[0141] To implement the above embodiments, this disclosure also proposes a non-transitory computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the methods proposed in the foregoing embodiments of this disclosure.

[0142] To implement the above embodiments, this disclosure also proposes a computer program product that, when instructions in the computer program product are executed by a processor, performs the method proposed in the foregoing embodiments of this disclosure.

[0143] The collection, storage, use, processing, transmission, provision, and disclosure of user personal information involved in this disclosure all comply with the provisions of relevant laws and regulations and do not violate public order and good morals.

[0144] It should be noted that personal information collected from users should be used for legitimate and reasonable purposes and should not be shared or sold outside of these legitimate uses. Furthermore, such collection / sharing should only be conducted after receiving the user's informed consent, including but not limited to notifying the user to read the user agreement / user notice and sign an agreement / authorization that includes authorization of relevant user information before the user uses the function. In addition, any necessary steps must be taken to protect and safeguard access to such personal information data and ensure that others with access to personal information data comply with their privacy policies and procedures.

[0145] This disclosure is intended to provide implementation schemes for users to selectively prevent the use or access to their personal information data. Specifically, this disclosure is intended to provide hardware and / or software to prevent or block access to such personal information data. Once personal information data is no longer needed, risks can be minimized by restricting data collection and deleting data. Furthermore, where applicable, such personal information is de-identified to protect user privacy.

[0146] In the foregoing descriptions of the embodiments, the terms "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., refer to specific features, structures, materials, or characteristics described in connection with that embodiment or example, which are included in at least one embodiment or example of this disclosure. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples. Moreover, without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification, as well as the features of different embodiments or examples.

[0147] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of that feature. In the description of this disclosure, "a plurality of" means at least two, such as two, three, etc., unless otherwise explicitly specified.

[0148] Any process or method description in the flowchart or otherwise herein can be understood as representing a module, segment, or portion of code comprising one or more executable instructions for implementing custom logic functions or processes, and the scope of preferred embodiments of this disclosure includes additional implementations in which functions may be performed not in the order shown or discussed, including substantially simultaneously or in reverse order depending on the functions involved, as will be understood by those skilled in the art to which embodiments of this disclosure pertain.

[0149] The logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as a sequenced list of executable instructions for implementing logical functions, and can be embodied in any computer-readable medium for use by, or in conjunction with, an instruction execution system, apparatus, or device (such as a computer-based system, a processor-included system, or other system that can fetch and execute instructions from, an instruction execution system, apparatus, or device). For the purposes of this specification, "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transmit programs for use by, or in conjunction with, an instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of computer-readable media include: an electrical connection having one or more wires (electronic device), a portable computer disk drive (magnetic device), random access memory (RAM), read-only memory (ROM), erasable and editable read-only memory (EPROM or flash memory), fiber optic devices, and portable optical disc read-only memory (CDROM). Alternatively, the computer-readable medium may be paper or other suitable media on which the program can be printed, since the program can be obtained electronically, for example, by optically scanning the paper or other medium, followed by editing, interpreting, or otherwise processing as necessary, and then stored in a computer memory.

[0150] It should be understood that various parts of this disclosure can be implemented using hardware, software, firmware, or a combination thereof. In the above embodiments, multiple steps or methods can be implemented using software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware as in another embodiment, it can be implemented using any one or a combination of the following techniques known in the art: discrete logic circuits having logic gates for implementing logical functions on data signals, application-specific integrated circuits (ASICs) having suitable combinational logic gates, programmable gate arrays (PGAs), field-programmable gate arrays (FPGAs), etc.

[0151] Those skilled in the art will understand that all or part of the steps of the methods in the above embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, the program includes one or a combination of the steps of the method embodiments.

[0152] Furthermore, the functional units in the various embodiments of this disclosure can be integrated into a processing module, or each unit can exist physically separately, or two or more units can be integrated into a module. The integrated module can be implemented in hardware or as a software functional module. If the integrated module is implemented as a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium.

[0153] The storage medium mentioned above can be a read-only memory, a disk, or an optical disk, etc. Although embodiments of the present disclosure have been shown and described above, it is to be understood that the above embodiments are exemplary and should not be construed as limiting the present disclosure. Those skilled in the art can make changes, modifications, substitutions, and variations to the above embodiments within the scope of the present disclosure.

Claims

1. A communication method, characterized in that, include: The first information is encoded to obtain the second information; The first encoding length is determined based on the length of the first information; as well as Based on the length of the second information and the length of the first encoding, determine whether to stop the encoding.

2. The method according to claim 1, characterized in that, Determining the first encoding length based on the length of the first information includes: Obtain the target bitrate at the physical layer; The first encoding length is determined based on the length of the first information and the target bit rate.

3. The method according to claim 2, characterized in that, Determining the first encoding length based on the length of the first information and the target bit rate includes: Determine the ratio of the length of the first information to the target bit rate, and set the ratio as the first encoding length.

4. The method according to claim 1, characterized in that, The step of determining whether to stop the encoding based on the length of the second information and the length of the first encoding includes: If the length of the second information reaches the length of the first encoding, the encoding is stopped. If the length of the second information does not reach the length of the first encoding, it is determined that the encoding will not be stopped.

5. The method according to claim 4, characterized in that, After determining to stop the encoding, the method further includes: Stop encoding the first information.

6. The method according to claim 4, characterized in that, After determining that the encoding will not be stopped, the method further includes: The second coding length is determined by encoding the base map required by the physical layer. When the length of the second information reaches the second encoding length, the encoding of the first information is stopped.

7. The method according to claim 5 or 6, characterized in that, The method further includes: Rate matching is performed on the second information.

8. A communication device, characterized in that, include: The encoding module is used to encode the first information to obtain the second information; The first determining module is used to determine the first encoding length based on the length of the first information; The second determining module is used to determine whether to stop the encoding based on the length of the second information and the length of the first encoding.

9. A communication device, characterized in that, include: A processor, and a memory communicatively connected to the processor; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory to implement the method as described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the method as described in any one of claims 1-7.

11. A computer program product, characterized in that, Includes a computer program that, when executed by a processor, implements the method of any one of claims 1-7.

12. A chip, said chip comprising a processing circuit and an interface circuit; wherein, The interface circuit is used to read instructions and sends the instructions to the processing circuit so that the processing circuit performs the method as described in any one of claims 1-7.