Data processing method and device, and storage medium

Abstract

The present disclosure provides a data processing method and device, and a storage medium. The method comprises: obtaining a first bit sequence; and, on the basis of a generator polynomial of a CRC check code, performing CRC encoding on the first bit sequence to obtain a second bit sequence. The generator polynomial of the CRC check code can be obtained on the basis of a first generator polynomial.

Description

Data processing method and device, and storage medium

[0001] The present disclosure claims priority to Chinese Patent Application No. 202410465714.3, filed on April 17, 2024, the entire contents of which are incorporated herein by reference. TECHNICAL FIELD

[0002] The present disclosure relates to the technical field of communication, and in particular to a data processing method and device and storage medium. BACKGROUND

[0003] With the development of intelligent transportation, intelligent industrial control, intelligent logistics and other industries, the number of user equipment in wireless communication networks is rapidly increasing, and users have increasingly high requirements for ultra-low latency and ultra-high reliability communication. In a wireless communication system, due to the influence of factors such as multipath, noise and interference, errors may occur in data processing in a data processing channel. SUMMARY

[0004] In one aspect, the present disclosure provides a data processing method. In the method, a first bit sequence is obtained. The first bit sequence is CRC encoded according to a CRC check code generator polynomial to obtain a second bit sequence, the CRC check code generator polynomial being obtainable based on a first generator polynomial.

[0005] In another aspect, a data processing method is provided. In the method, a second bit sequence is obtained. The second bit sequence is CRC checked according to a CRC check code generator polynomial to obtain a CRC check result, the CRC check code generator polynomial being obtainable based on a first generator polynomial.

[0006] In another aspect, a data processing device is provided, comprising an obtaining module and a processing module. The obtaining module is configured to obtain a first bit sequence. The processing module is configured to CRC encode the first bit sequence according to a CRC check code generator polynomial to obtain a second bit sequence, the CRC check code generator polynomial being obtainable based on a first generator polynomial.

[0007] In another aspect, a data processing device is provided, comprising an obtaining module and a processing module. The obtaining module is configured to obtain a second bit sequence. The processing module is configured to CRC check the second bit sequence according to a CRC check code generator polynomial to obtain a CRC check result, the CRC check code generator polynomial being obtainable based on a first generator polynomial.

[0008] In yet another aspect, a communication node is provided, comprising: a memory and a processor; the memory and the processor are coupled; the memory is configured to store a computer program; the processor is configured to implement the method in any one of the above aspects or embodiments when executing the computer program.

[0009] In yet another aspect, a communication node is provided, comprising: a memory and a processor; the memory and the processor are coupled; the memory is configured to store a computer program; the processor is configured to implement the method in any one of the above aspects or embodiments when executing the computer program.

[0010] In yet another aspect, a computer readable storage medium is provided, and the computer readable storage medium stores computer program instructions, and the computer program instructions are executed by a processor to implement the method in any one of the above aspects or embodiments.

[0011] In yet another aspect, a computer program product is provided, and the computer program product comprises computer program instructions, and the computer program instructions are executed to implement the method in any one of the above aspects or embodiments. BRIEF DESCRIPTION OF DRAWINGS

[0012] FIG. 1 is a communication system architecture diagram provided by an embodiment of the present disclosure.

[0013] FIG. 2 is a flow diagram of a data processing method provided by an embodiment of the present disclosure.

[0014] FIG. 3 is a flow diagram of another data processing method provided by an embodiment of the present disclosure.

[0015] FIG. 4 is a circuit diagram of data processing provided by an embodiment of the present disclosure.

[0016] FIG. 5 is a circuit diagram of another data processing provided by an embodiment of the present disclosure.

[0017] FIG. 6 is a circuit diagram of another data processing provided by an embodiment of the present disclosure.

[0018] FIG. 7 is a circuit diagram of another data processing provided by an embodiment of the present disclosure.

[0019] FIG. 8 is a circuit diagram of another data processing provided by an embodiment of the present disclosure.

[0020] FIG. 9 is a structural diagram of a data processing apparatus provided by an embodiment of the present disclosure.

[0021] FIG. 10 is a structural diagram of another data processing apparatus provided by an embodiment of the present disclosure.

[0022] FIG. 11 is a structural diagram of another data processing apparatus provided by an embodiment of the present disclosure.

[0023] FIG. 12 is a conceptual partial view of a computer program product according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0024] The technical solutions in the embodiments of the present disclosure will be described clearly and completely below with reference to the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only part of the embodiments of the present disclosure, rather than all the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by a person of ordinary skill in the art without creative work fall within the protection scope of the present disclosure.

[0025] The character " / " in the present disclosure generally represents an "or" relationship between the front and rear associated objects. For example, A / B can be understood as A or B.

[0026] The terms "first" and "second" and the like in the description and claims of the present disclosure are used to distinguish different objects, rather than to describe a specific order of the objects.

[0027] In addition, the terms "comprising" and "having" and any variations thereof mentioned in the description of the present disclosure are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device that includes a series of steps or modules is not limited to the listed steps or modules, but in some embodiments, other steps or modules not listed are also included, or in some embodiments, other steps or modules inherent to the process, method, product or device are also included.

[0028] In addition, in the embodiments of the present disclosure, the words "exemplarily" or "for example" are used to represent as an example, illustration or description. Any embodiment or design scheme described as "exemplarily" or "for example" in the present disclosure should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the words "exemplarily" or "for example" are intended to present the concept in an exemplary manner.

[0029] With the rapid development of technologies such as big data, cloud computing, and latency-sensitive networks, user equipment in wireless communication networks is experiencing explosive growth, and wireless communication networks will carry diverse applications and massive data, which puts very high requirements on data processing throughput, reliability, latency, etc. With the development of intelligent transportation, intelligent industrial control, and intelligent logistics, the requirements for ultra-low latency and ultra-high reliability of communication are becoming stronger and stronger, that is, some large throughput data need to be sent and successfully received within a very short time.

[0030] Currently, in a wireless communication system, a transmitting end performs channel coding on data to be transmitted to obtain sub-coding blocks, and then maps the sub-coding blocks into constellation modulation symbols and sends the constellation modulation symbols to a receiving end. In a data processing channel, data processing may be erroneous due to influences of factors such as multipath, noise, and interference. The transmitting end adds some redundant information in the data to be transmitted through channel coding, and the receiving end can recover the original data to be transmitted through the redundant information, that is, eliminate distortion caused by the data in the transmission process. The receiving end needs to perform channel decoding on the received constellation modulation symbols to recover the data to be transmitted. Channel coding methods can include LDPC coding, polar coding, turbo coding, and convolutional coding.

[0031] In addition, various channel coding methods can eliminate distortion caused by the data in the transmission process, but it is still relatively difficult to achieve a relatively low false alarm rate. Generally, CRC check code can be used to check the received data to determine whether the data is received correctly. In CRC coding, some redundant bits (i.e., check bits of the CRC check code) are added to the original data, and these redundant bits are referred to as CRC check bits. However, implementing CRC coding and decoding at the hardware level requires a special circuit or processor, resulting in a high degree of complexity of hardware design and increasing the hardware implementation cost.

[0032] It should be noted that the CRC check code can be described in various ways. For example, a generator polynomial can be used for description, such as a generator polynomial of a CRC check code with 16 CRC check bits (i.e., a length of the redundant bits in the CRC check code is 16 bits) is g CRC16 (x) = x 16 + x 12 + x 5 + 1. For another example, a register can be used for description, such as a generator polynomial of a CRC check code with 16 CRC check bits is described by a register as g CRC16 (D) = D 16 + D 12 + D 5+1, where "x" in the polynomial is replaced by "D", and the exponent of each term indicates the number of clocks (i.e., the number of shift registers) that need to be delayed. For example, a binary representation can be used. In a binary representation of a CRC generator polynomial, the first bit value (leftmost) corresponds to the coefficient of the highest power of the generator polynomial, and the last bit value (rightmost) corresponds to the coefficient of the lowest power of the generator polynomial. For example, the CRC generator polynomial of the above example with 16 CRC check bits can be represented in binary as {1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1}. For another example, hexadecimal can be used for the description. The CRC generator polynomial of the above example with 16 CRC check bits can be represented in hexadecimal as {11021} 16 or 0x11021. For another example, the powers of the non-zero coefficient terms can be used for the description. The CRC generator polynomial of the above example with 16 CRC check bits can be represented as {16, 12, 5, 0}.

[0033] The degree of a generator polynomial is represented as the power of the term with the highest power in the generator polynomial (i.e., the highest power). For example, the generator polynomial g CRC16 (x) = x 16 + x 12 + x 5 + 1 has a degree (highest power) of 16, and the degree of a generator polynomial is equal to the number of CRC check bits that the generator polynomial corresponds to. The order of the terms in a generator polynomial does not affect its description. For example, the generator polynomial g CRC16 (x) = x 16 + x 12 + x 5 + 1 can be written as g CRC16 (x) = 1 + x 5 + x 12 + x 16 , and the generator polynomial g CRC16 (D) = D 16 + D 12 + D 5 + 1 can be written as g CRC16 (D) = 1 + D 5 + D 12 + D 16 .

[0034] For any two non-zero polynomials f(x) and g(x), there exist two polynomials q(x) and r(x) satisfying f(x) = q(x)g(x) + r(x). Then, f(x) is the dividend polynomial, g(x) is the divisor polynomial, q(x) is the quotient polynomial, and r(x) is the remainder polynomial. That is, the dividend polynomial f(x) divided by the divisor polynomial g(x) can obtain the quotient polynomial q(x) and the remainder polynomial r(x). For example, the dividend polynomial f(x) = 1 + x 5 +x 12 , and the divisor polynomial is g(x) = x 6 , then f(x) divided by g(x) can obtain the quotient polynomial q(x) = x 6 , and the remainder polynomial r(x) = 1 + x 5 .

[0035] To solve the above problems, an embodiment of the present disclosure provides a data processing method, a first bit sequence is obtained. The first bit sequence is CRC encoded according to a CRC check code generation polynomial to obtain a second bit sequence. The CRC check code generation polynomial can be obtained based on a first generation polynomial. That is, one generation polynomial with a nested relationship can be transformed to obtain another generation polynomial, that is, the hardware circuit of the two generation polynomials can be multiplexed. In this way, the hardware complexity and hardware cost can be reduced, and the robustness of data communication can be increased. Moreover, the user equipment such as the tag device can be guaranteed to realize the minimalist design and the reliability of the transmitted data, and the energy consumption is reduced.

[0036] To facilitate understanding of the embodiments of the present disclosure, first, the communication system shown in FIG. 1 is taken as an example to explain the communication system applicable to the embodiments of the present disclosure in detail. Exemplarily, FIG. 1 is an architecture schematic diagram of a communication system applicable to the data processing method provided by the embodiments of the present disclosure. As shown in FIG. 1, the communication system includes a terminal and a network device.

[0037] The terminal is a terminal having a radio transceiver function for accessing the communication system or a chip or chip system that can be provided in the terminal. The terminal can also be referred to as a user equipment, an access terminal, a subscriber unit, a subscriber station, a mobile station, a mobile, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent, a tag, a passive device, an ambient IoT device, an Internet of Things (IoT) device, or a user equipment. The terminal in the embodiments of the present disclosure can be a mobile phone, a tablet, a computer with a radio transceiver function, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in self driving, a wireless terminal in remote medical, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, a vehicle-mounted terminal, a road side unit (RSU) with a terminal function, a physical network terminal, or the like. The terminal of the present disclosure can also be a vehicle-mounted module, a vehicle-mounted module, a vehicle-mounted component, a vehicle-mounted chip, or a vehicle-mounted unit built in a vehicle as one or more components or units, and the vehicle can implement the communication method provided by the present disclosure through the built-in vehicle-mounted module, vehicle-mounted module, vehicle-mounted component, vehicle-mounted chip, or vehicle-mounted unit.

[0038] The network device is located at the network side of the communication system and has a wireless transceiving function or a chip or chip system that can be arranged in the device. The network device includes but is not limited to a base station (BS), a reader, an interrogator, an access point (AP), a node B, a g node B (generalized node B), a radio network controller (RNC), an evolved node B (eNB), a base station controller (BSC), a base transceiver station (BTS), a transceiver function (TF), a radio router, a radio transceiver, a basic service set (BSS), an extended service set (ESS), or a radio base station (RBS), a home base station (for example, a home evolved NodeB or a home node B (HNB)), a baseband unit (BBU), a wireless relay node, a wireless backhaul node, a transmission and reception point (TRP or transmission point (TP), etc. It can also be a gNB in a 5G, such as a new radio (NR) system, or one or a group of antenna panels (including multiple antenna panels) of a base station in a 5G system, or a network node that constitutes a gNB or a transmission point, such as a distributed unit (DU), a road side unit (RSU) with base station functions, etc.

[0039] In the embodiments of the present disclosure, the terminal can channel encode the bit sequence and send the encoded bit sequence to the network device (such as a base station). The base station performs the decoding process. Alternatively, the base station can channel encode the bit sequence and send the encoded bit sequence to the terminal, and the terminal performs the decoding.

[0040] In some embodiments, the communication system can further include a core network in communication with the network device. The core network can provide access authorization, user authentication, Internet protocol connectivity, tracking, and other access, routing, or mobility management functions.

[0041] It should be noted that the application scenarios of the embodiments of the present disclosure are not limited. For example, the embodiments of the present disclosure can be applied to automatically adapt the network of wireless communication devices, such as IoT. The application examples for IoT can include smart metering, inventory monitoring, water level monitoring, temperature monitoring, device monitoring, medical monitoring, animal monitoring, weather and geographical event monitoring, vehicle fleet management and tracking, remote security sensing, physical access control, and business transactions, and the like, which are not limited herein. The sending end and the receiving end can be devices (for example, machine type communication devices) that communicate through IoT, and can include but are not limited to various types of sensors, water meters, electricity meters, product labels, or article data labels, and the like.

[0042] For example, the battery power of the devices in IoT is low, the throughput of the devices is low, the data volume of the deployed application is low, and the energy consumption is required to be low so as to communicate for a very long time without replacing the battery. Alternatively, the devices in IoT do not need to store energy by the battery, but directly transmit signals to the receiving end (for example, a base station) through backscattering. In the case that the tag collects energy and backscatters the signal to the receiving end, the IoT device can be a passive IoT device, which can use the licensed spectrum, for example, to transmit signals to the base station, or access the existing cellular mobile network.

[0043] In some scenarios, the IoT device can also communicate in unlicensed spectrum. Alternatively, the IoT device transmits data by using an impedance network, and different data signals are indicated according to different impedance network parameters.

[0044] It should be noted that the methods in the following embodiments can be implemented in the above communication system or application scenario. The schemes in the embodiments of the present disclosure can also be applied to other communication systems, and the corresponding names can also be replaced by the names of corresponding functions in other communication systems.

[0045] After introducing the application scenarios and implementation environments of the embodiments of the present disclosure, the data processing method provided by the embodiments of the present disclosure will be described in detail in combination with the above implementation environment.

[0046] As shown in FIG. 2, a data processing method provided by the embodiments of the present disclosure includes:

[0047] S201, a first bit sequence is acquired.

[0048] It should be noted that the length of the first bit sequence is not limited in the embodiments of the present disclosure. For example, the length of the first bit sequence is 2, 4, 10, 64, 128, 1000, and the like.

[0049] S202, performing CRC encoding on the first bit sequence according to a generation polynomial of the CRC check code to obtain a second bit sequence.

[0050] The generation polynomial of the CRC check code is a generation polynomial with a nested relationship, which means that the generation polynomial of the CRC check code can be obtained based on a first generation polynomial.

[0051] For example, the first generation polynomial is g CRC16 (x) = x 16 + x 10 + x 5 + x 3 + 1, and the generation polynomial of the CRC check code is g CRC5 (x) = x 5 + x 3 + 1. Thus, g CRC5 (x) can be obtained based on the first generation polynomial, for example, by removing x 16 and x 10 , that is, by dividing g CRC16 (x) by x 6 , the remainder polynomial obtained is g CRC5 (x). Alternatively, the first generation polynomial is g CRC16 (x) = x 16 + x 14 + x 11 + x 7 + 1, and the generation polynomial of the CRC check code is g CRC5 (x) = x 5 + x 3 + 1. Thus, the quotient polynomial obtained by dividing g CRC16 (x) by x 16-5 is g CRC5 (x).

[0052] In some embodiments, the method further comprises: determining the generation polynomial of the CRC check code from M generation polynomials, M being an integer greater than 1; wherein the M generation polynomials include at least N generation polynomials, any two of the N generation polynomials being: a first generation polynomial and a second generation polynomial, L1 being greater than L2, L1 representing the number of CRC check bits corresponding to the first generation polynomial, and L2 representing the number of CRC check bits corresponding to the second generation polynomial; and wherein a third generation polynomial obtained based on the first generation polynomial is equal to the second generation polynomial.

[0053] It should be noted that the N generation polynomials include the first generation polynomial and the second generation polynomial, which means that the N generation polynomials include but are not limited to the first generation polynomial and the second generation polynomial. That is, the N generation polynomials can include not only the first generation polynomial and the second generation polynomial, but also other generation polynomials.

[0054] Exemplarily, the third generation polynomial is a remainder polynomial obtained by dividing the first generation polynomial by a target polynomial, and the target polynomial is a monomial with a degree equal to L2+1. For example, the M generation polynomials include at least N=2 generation polynomials, the first generation polynomial is g CRC14 (x) = x 14 +x 7 +x 5 +x 3 +1, and the corresponding CRC check bit number L1=14; the second generation polynomial is g CRC5 (x) = x 5 +x 3 +1, and the corresponding CRC check bit number L2=5. The N=2 generation polynomials are the following combinations: g CRC14 (x) = x 14 +x 9 +x 7 +x 6 +x 5 +x 3 +1, g CRC5 (x) = x 5 +x 3 +1. Alternatively, the N=2 generation polynomials corresponding to L1=15 and L2=5 are the following combinations: g CRC15 (x) = x 15 +x 9 +x 8 +x 6 +x 5 +x 3 +1, g CRC5 (x) = x 5 +x 3 +1. Alternatively, the N=2 generation polynomials corresponding to L1=15 and L2=5 are the following combinations: g CRC15 (x) = x 15 +x 9 +x 8 +x 6 +x 5 +x 3 +1, g CRC5 (x) = x 5 +x 3 +1. Alternatively, the N=2 generation polynomials corresponding to L1=17 and L2=5 are the following combinations: g CRC17(x) = x 17 + x 6 + x 5 + x 3 + 1, g CRC5 (x) = x 5 + x 3 + 1. Alternatively, the N = 2 generator polynomials corresponding to L1= 18, L2= 5 are the following combinations: g CRC18 (x) = x 18 + x 12 + x 5 + x 3 + 1, g CRC5 (x) = x 5 + x 3 + 1.

[0055] Illustratively, the third generator polynomial is a quotient polynomial obtained by dividing the first generator polynomial by a target polynomial, the target polynomial being a monomial of degree equal to L1-L2. For example, the M generator polynomials include at least N = 2 generator polynomials, the first generator polynomial is g CRC16 (x) = x 16 + x 14 + x 11 + x 4 + x 3 + x 2 + 1, corresponding to a CRC check bit number L1= 16; the second generator polynomial is g CRC5 (x) = x 5 + x 3 + 1, corresponding to a CRC check bit number L2= 5. Alternatively, the N = 2 generator polynomials corresponding to L1= 14, L2= 5 are the following combinations: g CRC14 (x) = x 14 + x 12 + x 9 + x 2 + 1, g CRC5 (x) = x 5 + x 3 + 1. Alternatively, the N = 2 generator polynomials corresponding to L1= 18, L2= 5 are the following combinations: g CRC18 (x) = x 18 + x 16 + x 13 + x 3 + 1, g CRC5 (x) = x 5 + x 3 + 1.

[0056] Exemplarily, the third generator polynomial is a first remainder polynomial obtained by dividing a first quotient polynomial by a first target polynomial, the first quotient polynomial is obtained by dividing the first generator polynomial by a second target polynomial; wherein the first target polynomial is a monomial with a degree equal to L2+1, the second target polynomial is a monomial with a degree equal to c, and c is a positive integer less than L1-L2. In an example, c can be equal to 1, 2, 3, or 4.

[0057] Exemplarily, N can be equal to M. In an example, N and M are both equal to 2, 3, 4, 5, or 6.

[0058] Exemplarily, N is equal to 2, 3, 4, 5, 6, 7, or 8.

[0059] Exemplarily, the maximum number of CRC check bits corresponding to the N generator polynomials is equal to one of the following: 14, 15, 16, 17, 18, 19, 20, 22, 24, 28, 32.

[0060] Exemplarily, the number of CRC check bits corresponding to the N generator polynomials are different.

[0061] Exemplarily, the number of CRC check bits corresponding to the N generator polynomials includes at least two of the following: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 28, 32.

[0062] Exemplarily, the number of CRC check bits corresponding to the N generator polynomials includes one of the following combinations: {5, 16}, {6, 16}, {8, 16}, {5, 10, 16}, {5, 11, 16}, {5, 12, 16}, {6, 10, 16}, {6, 11, 16}, {6, 12, 16}, {5, 10, 16, 24}, {5, 11, 16, 24}, {6, 10, 16, 24}, {6, 11, 16, 24}, {6, 12, 16, 24}, {6, 12, 18, 24}.

[0063] In some embodiments, the plurality of CRC check codes can include M generator polynomials. A generator polynomial of the CRC check code can be determined from the M generator polynomials, M being an integer greater than 1. The M generator polynomials include a first generator polynomial, and each of the M generator polynomials can be obtained based on the first generator polynomial.

[0064] In a possible implementation, the M generation polynomials include: N generation polynomials including the first generation polynomial and the second generation polynomial, and Y generation polynomials, N and Y are integers. Generation polynomials in the N generation polynomials can be obtained based on the first generation polynomial, and generation polynomials in the Y generation polynomials cannot be obtained based on the first generation polynomial.

[0065] That is, the M generation polynomials include the N generation polynomials with a nested relationship and the Y generation polynomials without a nested relationship.

[0066] For example, in a case where Y is greater than 0, part of the M generation polynomials can be obtained based on the first generation polynomial, and M is greater than N.

[0067] In another possible implementation, generation polynomials in the M generation polynomials can be obtained based on the first generation polynomial, M is equal to N, and N is equal to 2, 3, 4, 5, 6, 7, or 8.

[0068] For example, in a case where Y is equal to 0, M is equal to N, and generation polynomials in the M generation polynomials can be obtained based on the first generation polynomial.

[0069] In the embodiment of the present disclosure, coefficients of terms with a target length in the N generation polynomials are not 0, and the target length is the minimum value in the number of CRC check bits of CRC check codes corresponding to the N generation polynomials.

[0070] For example, N=2 generation polynomials include: g CRC16 (x) = x 16 +x 11 +x 6 +x 5 +1, g CRC5 (x) = x 6 +x 5 +1, and the target length is the number of CRC check bits of the generation polynomial g CRC5 (x) corresponding to 5. Alternatively, N=3 generation polynomials include: g CRC16 (x) = x 16 +x 15 +x 14 +x 12 +x 11 +x 10 +x 8 +x 7 +x 6 +x 5 +1, g CRC11 (x) = x 11 +x 10 +x 8 +x7 +x 6 +x 5 +1、g CRC5 (x)=x 6 +x 5 +1。

[0071] In the embodiments of the present disclosure, the N polynomials correspond to different numbers of CRC check bits.

[0072] For example, if the two polynomials include: g CRC16 (x)=x 16 +x 9 +x 8 +x 4 +x 3 +x 2 +1、g CRC8 (x)=x 8 +x 4 +x 3 +x 2 +1, then the number of CRC check bits corresponding to g CRC16 (x) is 16, and the number of CRC check bits corresponding to g CRC8 (x) is 8.

[0073] In some other embodiments, a polynomial of a CRC check code is determined according to a first polynomial and a first monomial, the first polynomial is a non-zero polynomial, and the first monomial is a monomial with a degree related to U, where U is a positive integer less than or equal to the degree of the first polynomial.

[0074] That is, the polynomial of the CRC check code is generated based on the first polynomial.

[0075] In a possible implementation, U is one of N integers, and N is equal to 2, 3, 4, 5, 6, 7, or 8.

[0076] In another possible implementation, U is one of N integers, and the N integers include at least two of the following integers: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 28, and 32.

[0077] In another possible implementation, U is one of N integers, and the N integers are one of the following combinations: {5, 16}, {6, 16}, {8, 16}, {5, 10, 16}, {5, 11, 16}, {5, 12, 16}, {6, 10, 16}, {6, 11, 16}, {6, 12, 16}, {5, 10, 16, 24}, {5, 11, 16, 24}, {6, 10, 16, 24}, {6, 11, 16, 24}, {6, 12, 16, 24}.

[0078] Based on the technical solution, after the first bit sequence is obtained, the first bit sequence can be CRC encoded using a generator polynomial of a CRC check code having a nested relationship to obtain a second bit sequence, wherein the generator polynomial of the CRC check code can be obtained based on the first generator polynomial. That is, one generator polynomial having a nested relationship can be transformed to obtain another generator polynomial, that is, the hardware circuits of the two generator polynomials can be multiplexed. In this way, the hardware complexity and hardware cost can be reduced, and the robustness of data communication can be increased. Moreover, the tag device can be implemented in an extremely simple design, the reliability of transmitted data can be guaranteed, and energy consumption is reduced.

[0079] The following describes the plurality of generator polynomials having a nested relationship in combination with some examples.

[0080] The following describes a third generator polynomial obtained based on the first generator polynomial.

[0081] In a possible implementation, the two generator polynomials have the following nested relationship I: a new polynomial formed by all terms in the first generator polynomial having a degree less than or equal to L2 is the same as the second generator polynomial. The third generator polynomial includes at least one first target term, and the first target term is a term in the first generator polynomial having a degree less than or equal to L2.

[0082] For example, assuming that the first generator polynomial is g CRC16 (x)=x 16 +x 12 +x 5 +x 3 +1, and the second generator polynomial is g CRC5 (x)=x 5 +x 3 +1. It can be learned that L2 is 5, the first target term includes x 5 , x 3 , and 1, and the third generator polynomial includes x 5 , x 3 , and 1. The third generator polynomial formed by each first target term is the same as the second generator polynomial.

[0083] In another possible implementation, the third generator polynomial is obtained based on the first generator polynomial, the first length and the second length. The two generator polynomials have the following nested relationship two: the first generator polynomial is divided by x L1-L2 , and the polynomial composed of the terms with the power greater than or equal to 0 in the quotient polynomial obtained after the division is the same as the second generator polynomial.

[0084] For example, assuming that the first generator polynomial is g CRC16 (x) = x 16 + x 14 + x 11 + x 7 + 1, and the second generator polynomial is g CRC5 (x) = x 5 + x 3 + 1, it can be seen that x L1-L2 is x 11 , and the quotient polynomial obtained after the first generator polynomial is divided by x 11 is x 5 + x 3 + x 0 , and the terms with the power greater than or equal to 0 include x 5 , x 3 and 1.

[0085] In another possible implementation, the two generator polynomials have the following nested relationship three: the remainder polynomial obtained after the first generator polynomial is divided by x q , and the polynomial composed of the terms with the power greater than or equal to 0 and less than or equal to L2 is the same as the second generator polynomial, where q is a positive integer greater than or equal to 1 and less than or equal to L1-L2-1.

[0086] For example, assuming that the first generator polynomial is g CRC16 (x) = x 16 + x 14 + x 6 + x 4 + x + 1, the second generator polynomial is g CRC5 (x) = x 5 + x 3 + 1, and q is 1, it can be seen that the terms with the power less than or equal to 5 in the new polynomial obtained after the first generator polynomial is divided by x include x 5 , x 3 and 1.

[0087] Alternatively, the third generator polynomial includes at least one third target term, and the third target term is a term with the power less than or equal to L2 in a fifth generator polynomial, and the fifth generator polynomial is a generator polynomial obtained by reducing the power of each term of the first generator polynomial by a preset power.

[0088] For example, assuming that the first generator polynomial is g CRC16 (x) = x 16 + x 14 + x 6 + x 4 + x + 1, the second generator polynomial is g CRC5 (x) = x 5 + x 3 + 1, and the preset power is 1. Thus, the fifth generator polynomial is x 15 + x 13 + x 5 + x 3 + 1 + x -1 , and the third target term includes x 5 , x 3 , and 1.

[0089] In another possible implementation, the two generator polynomials have the following nested relationship four: the third generator polynomial is a quotient polynomial obtained by dividing the first generator polynomial by a target polynomial, and the target polynomial is a monomial with a degree equal to L2.

[0090] For example, assuming that the first generator polynomial is g CRC16 (x) = x 16 + x 10 + x 8 + x 5 + x 3 + 1, the second generator polynomial is g CRC5 (x) = x 5 + x 3 + 1, and the target polynomial is x 5 . Thus, the remainder polynomial obtained by dividing g CRC16 (x) by x 6 is x 5 + x 3 + 1.

[0091] In another possible implementation, the third generator polynomial is a first remainder polynomial obtained by dividing a first quotient polynomial by a first target polynomial, and the first quotient polynomial is a quotient polynomial obtained by dividing the first generator polynomial by a second target polynomial. The first target polynomial is a monomial with a degree equal to L2+1, and the second target polynomial is a monomial with a degree equal to c, where c is a positive integer less than L1-L2.

[0092] For example, assuming that the first generator polynomial is g CRC16 (x) = x 16 + x 12 + x 9 + x 7 + x4 +1, the second generating polynomial is g CRC5 (x) = x 3 +1, c is 4, the second target polynomial is x 4 , the first target polynomial is x 4 . Then the first quotient polynomial is x 12 + x 8 + x 5 + x 3 +1, the first remainder polynomial is x 3 +1.

[0093] It should be noted that the coefficients of each term of the third generating polynomial are not 0.

[0094] In some embodiments, the power of a part of the terms in the first generating polynomial has a corresponding relationship with the power of each term in the second generating polynomial. The corresponding relationship can include: corresponding relationship one, corresponding relationship two and corresponding relationship three.

[0095] In the corresponding relationship one, the first set and the second set are the same, the first set includes: the power of the term in the first polynomial whose power is less than or equal to L2 and whose coefficient is not 0, and the second set includes: the power of each term in the second polynomial whose coefficient is not 0.

[0096] Exemplarily, assuming that the first generating polynomial is g CRC16 (x) = x 16 + x 12 + x 5 + x 3 +1, the second generating polynomial is g CRC5 (x) = x 5 + x 3 +1. Therefore, the power of the term in the first generating polynomial whose power is less than or equal to L2 = 5 and whose coefficient is not 0 constitutes the first set and the second set, both of which are {5, 3, 0}.

[0097] In the corresponding relationship two, the third set and the second set are the same, the third set includes: the set obtained by subtracting the third length from the power of the term in the first generating polynomial whose power is greater than or equal to the third length and whose coefficient is not 0. The third length is equal to L1-L2.

[0098] Exemplarily, assuming that the first generating polynomial is g CRC16 (x) = x 16 + x 14 + x 11 + x 7 +1, the second generating polynomial is g CRC5 (x) = x 5 + x 3+1. From this, we can see that the third length is 11, and the set obtained by subtracting the third length from the powers of the terms in the first generating polynomial whose powers are greater than or equal to the third length and whose coefficients are not 0 is {5, 3, 0}.

[0099] In the correspondence relationship three, the fourth set is the same as the second set, and the fourth set includes: the power of the fifth generating polynomial is greater than or equal to 0 and less than or equal to L2, and the power of the term whose coefficient is not 0.

[0100] For example, if the first generating polynomial is g CRC16 (x) = x 16 +x 14 +x 6 +x 4 +x+1, the second generating polynomial is g CRC5 (x) = x 5 +x 3 +1, the preset power is 1. Therefore, we can know that the fifth generating polynomial is x 15 +x 13 +x 5 +x 3 +1+x -1 , the fourth set is {5, 3, 0}.

[0101] In another example, N generator polynomials with a nested relationship, sorted from small to large according to the number of CRC check bits supported, include: g0(x), g1(x), g2(x), ..., g N-1 (x). The sets of powers whose coefficients in each of the N generating polynomials are not equal to 0 are: S0, S1, S2...S N-1 , every set is a non-empty set. For example, S0 is S i A subset of , i is any integer from 1 to N-1. For example, S a It's S a+1 A subset of , where a is any integer from 0 to N–2. For example, S a With S a+1 The set consisting of all elements less than or equal to La in is the same, where La represents the number of CRC check bits supported by the a-th generator polynomial. N is equal to 2, 3, 4, 5, 6, 7, or 8.

[0102] In another example, N generator polynomials with a nested relationship, sorted from small to large according to the number of CRC check bits supported, include: g0(x), g1(x), g2(x), ..., g N-1(x) the i-th generator polynomial is equal to a remainder polynomial obtained by dividing the (i+1)-th generator polynomial by a target polynomial, where the target polynomial is a monomial with a degree equal to Li+1, Li is used to represent the number of CRC check bits corresponding to the i-th generator polynomial, i equals 0, 1, 2,..., N-2.

[0103] Alternatively, the i-th generator polynomial is equal to a remainder polynomial obtained by dividing the (i+1)-th generator polynomial by a target polynomial, where the target polynomial is a monomial with a degree equal to Li+1, Li is used to represent the number of CRC check bits corresponding to the i-th generator polynomial, i equals 0, 1, 2,..., N-2. i+1 -L i .

[0104] Alternatively, in the (N-1)-th generator polynomial, the coefficient of the term with a degree of Li i , i equals 0, 1, 2,..., N-2.

[0105] In some embodiments, a generator polynomial of a CRC check code is determined according to a first generator polynomial and U, the first generator polynomial is a non-zero polynomial, and U is a positive integer less than or equal to a degree of the first generator polynomial.

[0106] In a possible implementation, U is equal to the number of CRC check bits corresponding to the generator polynomial of the CRC check code.

[0107] In a possible implementation, the generator polynomial of the CRC check code is a remainder polynomial obtained by dividing the first generator polynomial by a first polynomial, the first polynomial is a monomial with a degree equal to U+1. For example, the first generator polynomial is g CRC16 (x) = x 16 + x 11 + x 6 + x 5 + 1, or g CRC16 (x) = x 16 + x 12 + x 11 + x 10 + x 6 + x 5 + 1, or g CRC16 (x) = x 16 + x 13 + x 8 + x 7 + x 6 + x 5 + 1. Correspondingly, U can be equal to 6 and 16.

[0108] In another possible implementation, the generator polynomial of the CRC check code is a quotient polynomial obtained by dividing the first generator polynomial by the first polynomial, and the first polynomial is a monomial of degree equal to L1-U, where L1 is equal to the degree of the first generator polynomial. For example, for example, the first generator polynomial is g CRC16 (x) = x 16 +x 15 +x 10 +x 4 +1, or g CRC16 (x) = x 16 +x 15 +x 10 +x 4 +x 3 +x 1 +1, or g CRC16 (x) = x 16 +x 15 +x 10 +x 5 +x 4 +x 1 +1. The corresponding U can take the values ​​of 6 and 16.

[0109] In another possible implementation, a generator polynomial of a CRC check code is determined based on the first generator polynomial and U, including: dividing the first generator polynomial by the first polynomial to obtain a second quotient polynomial, where the first polynomial is a monomial of degree equal to i, i is a positive integer less than L1-U, where L1 is equal to the degree of the first generator polynomial; dividing the second quotient polynomial by the second polynomial to obtain a remainder polynomial as the generator polynomial of the CRC check code, where the second polynomial is a monomial of degree equal to U+1.

[0110] In another possible implementation, the generator polynomial of the CRC check code is determined based on the first generator polynomial and U, including: dividing the first generator polynomial by the first polynomial to obtain a second remainder polynomial, where the first polynomial is a monomial of degree equal to i, where i is a positive integer greater than U+1 and less than L1+2; dividing the second remainder polynomial by the second polynomial to obtain a quotient polynomial as the generator polynomial of the CRC check code, where the second polynomial is a monomial of degree equal to L1-U, where L1 is equal to the degree of the first generator polynomial.

[0111] In one example, U is any integer among N integers, and N is equal to 2, 3, 4, 5, 6, 7, or 8.

[0112] In one example, U is an integer among N integers, and the N integers include at least two of the following integers: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 28, and 32.

[0113] In an example, U is one of N integers, and the N integers are one of the following combinations: {5, 16}, {6, 16}, {8, 16}, {5, 10, 16}, {5, 11, 16}, {5, 12, 16}, {6, 10, 16}, {6, 11, 16}, {6, 12, 16}, {5, 10, 16, 24}, {5, 11, 16, 24}, {6, 10, 16, 24}, {6, 11, 16, 24}, {6, 12, 16, 24}.

[0114] For example, the N integers are {6, 12, 16}, and the first generator polynomial is g CRC16 (x) = x 16 + x 15 + x 10 + x 8 + x 6 + x 5 + x 4 + x 3 + 1, or g CRC16 (x) = x 16 + x 15 + x 10 + x 8 + x 7 + x 6 + x 4 + x 3 + 1, or g CRC16 (x) = x 16 + x 15 + x 10 + x 8 + x 6 + x 5 + x 4 + x 3 + x 2 + x 1 + 1. The corresponding U can be 6, 12, and 16. That is, the generator polynomial of the CRC check code is a quotient polynomial obtained by dividing the first generator polynomial by a first polynomial, and the first polynomial is a monomial with a degree equal to L1-U. L1 is equal to 16.

[0115] In an example, the degree of the first generator polynomial (or the number of CRC check bits corresponding thereto) is equal to one of the following: 14, 15, 16, 17, 18, 19, 20, 22, 24, 28, 32.

[0116] In some embodiments, the generator polynomial of the CRC check code is determined according to a first generator polynomial and a first polynomial, the first generator polynomial being a non-zero polynomial, and the first polynomial being a monomial with a degree related to U, U being a positive integer less than or equal to the degree of the first generator polynomial.

[0117] In one possible implementation, the generator polynomial of the CRC check code is a remainder polynomial obtained by dividing the first generator polynomial by the first polynomial, the first polynomial being a monomial with a degree equal to U+1.

[0118] For example, assuming that the first generator polynomial is g CRC16 (x) = x 16 +x 12 +x 5 +x 3 +1, U is 5, and the first polynomial is x 6 , the generator polynomial of the CRC check code is x 5 +x 3 +1.

[0119] In another possible implementation, the generator polynomial of the CRC check code is a quotient polynomial obtained by dividing the first generator polynomial by the first polynomial, the first polynomial being a monomial with a degree equal to L1-U.

[0120] For example, assuming that the first generator polynomial is g CRC16 (x) = x 16 +x 15 +x 10 +x 4 +1, U is 6, and the first polynomial is x 10 , the generator polynomial of the CRC check code is x 6 +x 5 +1.

[0121] In another possible implementation, the first generator polynomial is divided by the first polynomial to obtain a second quotient polynomial, the first polynomial being a monomial with a degree equal to i, i being a positive integer less than L1-U. A remainder polynomial obtained by dividing the second quotient polynomial by a second polynomial is taken as the generator polynomial of the CRC check code, the second polynomial being a monomial with a degree equal to U+1.

[0122] For example, assuming that the first generator polynomial is g CRC16 (x) = x 16 +x 12 +x 9 +x 7 +x 4 +1, U is 5, and i is 4, the first polynomial is x 4 , and the second quotient polynomial is x 12+x 8 +x 5 +x 3 +1. The second polynomial is x 6 , and the remainder polynomial is x 5 +x 3 +1.

[0123] In another possible implementation, the first generator polynomial is divided by a first polynomial to obtain a second remainder polynomial, the first polynomial being a monomial with a degree equal to i, i being a positive integer greater than U+1 and smaller than L1+2. A quotient polynomial obtained by dividing the second remainder polynomial by a second polynomial is taken as the generator polynomial of the CRC check code, the second polynomial being a monomial with a degree equal to L1-U.

[0124] For example, assuming that the first generator polynomial is g CRC16 (x) = x 16 +x 12 +x 9 +x 7 +x 6 +x 4 +1, U is 10, and i is 12, the first polynomial is x 12 , the second remainder polynomial is x 9 +x 7 +x 6 +x 4 +1. The second polynomial is x 6 , and the quotient polynomial is x 3 +x+1.

[0125] It should be noted that, in the embodiments of the present disclosure, the plurality of generator polynomials having the nested relationship satisfy at least one of the above-mentioned nested relationships (i.e., the first nested relationship, the second nested relationship, the third nested relationship, the fourth nested relationship, and the fifth nested relationship), and / or at least one of the corresponding relationships (i.e., the first corresponding relationship, the second corresponding relationship, and the third corresponding relationship), and / or at least one of the generation manners.

[0126] In some embodiments, the generator polynomial of the CRC check code, and / or the length of the CRC check code corresponding to the generator polynomial of the CRC check code, is determined based on at least one of the following parameters: the length of the first bit sequence, the data processing direction, the reader signaling, the tag signaling, the tag state, the modulation format, and the encoding manner.

[0127] As shown in FIG. 3, a data processing method provided by an embodiment of the present disclosure includes the following steps.

[0128] S301, obtaining a second bit sequence.

[0129] S302, performing CRC check on the second bit sequence according to the generation polynomial of the CRC check code to obtain a CRC check result.

[0130] The generation polynomial of the CRC check code can be obtained based on the first generation polynomial.

[0131] In the embodiments of the present disclosure, after performing the CRC check on the second bit sequence, if it is determined that the second bit sequence belongs to the code word space of the CRC encoding, the CRC check result is used to indicate that the received data is correct, and the originally transmitted bit sequence is output, which corresponds to the first bit sequence above. If it is determined that the second bit sequence does not belong to the code word space of the CRC encoding, the CRC check result is used to indicate that the received data is incorrect.

[0132] In some embodiments, after performing the CRC check, the originally transmitted bit sequence is output

[0133] Based on the above technical solution, after obtaining the encoded second bit sequence, the generation polynomial of the CRC check code with a nested relationship can be used to perform CRC check on the second bit sequence to obtain a CRC check result, wherein the generation polynomial of the CRC check code can be obtained based on the first generation polynomial. That is, one generation polynomial with a nested relationship can be transformed to obtain another generation polynomial, that is, the hardware circuit of the two generation polynomials can be multiplexed. In this way, the hardware complexity and hardware cost can be reduced, and the robustness of data communication can be increased. Moreover, the tag device can be designed simply and the reliability of the transmitted data can be guaranteed, and the energy consumption is reduced.

[0134] In the following, some examples are used to introduce the hardware circuit for performing CRC encoding using the generation polynomials with a nested relationship.

[0135] Example 1

[0136] Suppose M=N=2, and the number of CRC check bits supported by the two generation polynomials is 5 and 16 respectively. The generation polynomial supporting the number of CRC check bits of 5 is: g CRC5 (x) = x 5 + x 3 + 1. The generation polynomial supporting the number of CRC check bits of 16 is: g CRC16 (x) = x 16 + x 14 + x 13 + x 12 + x 5 + x 3 + 1.

[0137] As can be seen, g CRC5 (x) and g CRC16 (x) have a nested relationship. gCRC16 (x) is x 5 , x 3 , 1, which is the same as g CRC5 (x). That is, the generator polynomial g CRC5 (x) is the remainder polynomial obtained by dividing the first generator polynomial g CRC16 (x) by the target polynomial, which is a monomial with degree equal to L2+1=6, i.e., x 6 The advantage of having two or more generator polynomials with nested relationship is that the hardware circuit for processing can be reused when CRC encoding or CRC decoding is performed, thus reducing hardware complexity, reducing hardware development cost, and improving product competitiveness.

[0138] For example, the exemplary hardware implementation circuit of g CRC5 (x) and g CRC16 (x) is shown in FIG. 4. The entire CRC encoding circuit 410 includes 16 registers, 6 XOR gates, a two-way selection circuit 430, and some wires. Dz represents the zth register. When the two-way selection circuit 430 selects 1 (solid line), CRC encoding is performed with the generator polynomial g CRC16 (x), and the entire circuit 410 is in action. When the two-way selection circuit 430 selects 2 (dashed line), CRC encoding is performed with the generator polynomial g CRC5 (x), and the circuit 420 (only 5 registers and 2 XOR gates) is in action.

[0139] Let the first bit sequence (original bit sequence) be [a0, a1, a2,..., a k-1 ], which is sequentially input into the input (Data In) shown in FIG. 4 in descending order of the subscript. After the last bit of the first bit sequence is input, the state in the register (the state in the register constitutes the CRC check bit sequence) is sequentially output, i.e., the second bit sequence (encoded bit sequence) is obtained. That is, the first bit sequence [a0, a1, a2,..., a k-1 ] and the CRC check bit sequence [a0, a1, a2,..., a k-1 ] are combined to form the second bit sequence. The encoded bit sequence is described in polynomial form as follows: a0x k+h-1 +a1x k+h-2 +...+a k-1 x L +p0x L-1 +p1x L-2 +...+p L-2 x 1 +p L-1 .

[0140] a i corresponding to the i-th bit in the first bit sequence, i is a non-negative integer less than k. L is used to represent the number of CRC check bits corresponding to the generating polynomial, p j is the j-th bit in the CRC check bit sequence, j = 0, 1,..., L-1. In this example, L equals 5 and 16, i.e. it can be understood that L1= 16 corresponds to the number of CRC check bits of the first generating polynomial g CRC16 (x), and L2= 5 corresponds to the number of CRC check bits of the first generating polynomial g CRC5 (x). When the number of CRC check bits L equals 16, p j corresponds to the state (0 or 1) of the 15-j register D 15-j , j equals 0, 1,..., 15; when the number of CRC check bits L equals 5, p j corresponds to the state (0 or 1) of the 4-j register D 4-j , j equals 0, 1,..., 4.

[0141] Based on the above example one, it can be known that the hardware circuit of CRC encoding or decoding of any two generating polynomials with nested relationship can be reused, and the same circuit can support different numbers of CRC check bits corresponding to different generating polynomials. For the decoding process of the received CRC check code, only the received bit sequence needs to be sequentially entered into the circuit, and when all the bits of the received bit sequence completely enter the circuit, it can be judged according to the register state whether the corresponding received bit sequence belongs to the CRC code word space, and if so, it is judged as correct reception. In this way, for a terminal device requiring extreme simplicity, using generating polynomials with nested relationship can reduce the number of registers and XOR gates, thereby greatly saving hardware cost.

[0142] Example two

[0143] Suppose M = N = 3, and the numbers of CRC check bits supported by the three generating polynomials are 5, 9 and 16 respectively. The generating polynomial supporting the number of CRC check bits of 5 is: g CRC5 (x) = x 5 + x 3 + 1. The generating polynomial supporting the number of CRC check bits of 9 is: g CRC9 (x) = x 9 + x 6 + x 5 + x 3 + 1. The generating polynomial supporting the number of CRC check bits of 16 is: g CRC16 (x) = x 16 + x 13 + x 12 + x11 +x 9 +x 6 +x 5 +x 3 +1.

[0144] Thus, the generating polynomial g CRC5 (x) in Example Two has a nested relationship with the generating polynomial g CRC9 (x) and the generating polynomial g CRC16 (x). The new polynomial formed by all the terms in the generating polynomial g CRC16 (x) with power less than or equal to 5 is the same as the generating polynomial g CRC5 (x), the new polynomial formed by all the terms in the generating polynomial g CRC9 (x) with power less than or equal to 5 is the same as the generating polynomial g CRC5 (x), and the new polynomial formed by all the terms in the generating polynomial g CRC16 (x) with power less than or equal to 9 is the same as the generating polynomial g CRC9 (x).

[0145] Also, the set of powers with non-zero coefficients in the generating polynomial g CRC5 (x) is S0=[0,3,5], the set of powers with non-zero coefficients in the generating polynomial g CRC9 (x) is S1=[0,3,5,6,9], and the set of powers with non-zero coefficients in the generating polynomial g CRC16 (x) is S2=[0,3,5,6,9,11,12,13,16]. It can be seen that the above three generating polynomials have a nested relationship.

[0146] In this example, the exemplary hardware implementation circuit for the generating polynomial g CRC5 (x), the generating polynomial g CRC9 (x), and the generating polynomial g CRC16 (x) is shown in Fig. 5. The entire CRC encoding (or decoding) circuit includes 16 registers, 9 XOR gates, a three-to-one circuit 530, and some wires. When the three-to-one circuit 530 selects 1 (the solid line), then the CRC encoding with the generating polynomial g CRC16 (x) is performed, and the entire circuit is in action, i.e., the number of CRC check bits L is equal to 16, and the jth bit p j in the CRC check bit sequence corresponds to the state (0 or 1) of the 15-jth register D 15-j , j is equal to 0, 1,..., 15; when the three-to-one circuit 530 selects 2 (the dashed line), then the CRC encoding with the generating polynomial g CRC9CRC encoding of (x) corresponding to circuit 510 (only 9 registers and 4 XOR gates) in action, i.e. the number of CRC check bits L is equal to 9, the jth bit p j in the sequence of CRC check bits corresponds to the state (0 or 1) of the 8-jth register D 8-j , j is equal to 0, 1,..., 8; when the three-to-one circuit 530 selects 3 (dashed line), then the generating polynomial is g CRC5 CRC encoding of (x) corresponding to circuit 520 (only 5 registers and 2 XOR gates) in action, i.e. the number of CRC check bits L is equal to 5, the jth bit p j in the sequence of CRC check bits corresponds to the state (0 or 1) of the 4-jth register D 4-j , j is equal to 0, 1,..., 4.

[0147] It can be seen that, for any three generating polynomials with nested relationship, the hardware circuit of CRC encoding can be reused, and the same circuit can support different number of CRC check bits. In this example, the same set of hardware circuit can support CRC encoding with check bits number of 5, 9 and 16 at the same time. In this way, the hardware cost can be saved.

[0148] Example Three

[0149] Suppose M=N=3, the CRC check bit numbers supported by the three generating polynomials are 6, 11 and 16 respectively. The generating polynomial supporting CRC check bit number of 6 is: g CRC6 (x) = x 6 +x 5 +1. The generating polynomial supporting CRC check bit number of 11 is: g CRC11 (x) = x 11 +x 10 +x 6 +x 5 +1. The generating polynomial supporting CRC check bit number of 16 is: g CRC16 (x) = x 16 +x 13 +x 11 +x 10 +x 6 +x 5 +1.

[0150] Therefore, the generating polynomial g CRC6 (x) in Example Three, the generating polynomial g CRC11 (x) and the generating polynomial g CRC16 (x) have nested relationship. The new polynomial formed by all terms with power less than or equal to 6 in the generating polynomial g CRC16 (x) is gCRC6 (x) is the same, generating polynomial g CRC11 The new polynomial formed by all terms in (x) with power less than or equal to 6 and g CRC6 (x) is the same, generating polynomial g CRC16 The new polynomial formed by all terms in (x) with a power less than or equal to 11 and g CRC11 (x)Same.

[0151] And, the generating polynomial g CRC6 The set of powers whose coefficients in (x) are not equal to 0 is S0 = [0, 5, 6], and the generating polynomial g CRC11 The set of powers whose coefficients in (x) are not equal to 0 is S1 = [0, 5, 6, 10, 11], and the generating polynomial g CRC16 The set of powers whose coefficients in (x) are not equal to 0 is S2 = [0, 5, 6, 10, 11, 13, 16]. It can be seen that the above three generating polynomials have a nested relationship.

[0152] In this example, the generator polynomial g CRC6 (x), generating polynomial g CRC11 (x) and the generating polynomial g CRC16 An example of an exemplary hardware implementation circuit of (x) is shown in FIG6. The entire CRC encoding circuit includes 16 registers, 6 XOR gates, a three-choose-one circuit 630, and some connections. When the three-choose-one circuit 630 selects 1 (solid line), the generator polynomial is g CRC16 The CRC code of (x) corresponds to the entire circuit being in effect, that is, the number of CRC check bits L is equal to 16, and the jth bit p in the CRC check bit sequence is equal to 16. j Corresponding to the 15-jth register D 15-j The state of (0 or 1), j is equal to 0, 1, ..., 15. When the three-choose-one circuit 630 selects 2 (dashed line), the generating polynomial is g CRC11 The CRC encoding of (x) corresponds to the circuit 610 (only 11 registers and 4 XOR gates) in action, that is, the number of CRC check bits L is equal to 11, and the jth bit p in the CRC check bit sequence is j Corresponding to the 10-jth register D 10-j The state of (0 or 1), j is equal to 0, 1, ..., 10. When the three-choose-one circuit 630 selects 3 (dashed line), the generating polynomial is g CRC6 The CRC encoding of (x) corresponds to the circuit 620 (only 6 registers and 2 XOR gates) in action, that is, the number of CRC check bits L is equal to 6, and the jth bit p in the CRC check bit sequence is j Corresponding to the 5-jth register D5-j The state of (0 or 1), j is equal to 0, 1, ..., 5.

[0153] As can be seen, the CRC encoding hardware circuit can be reused for any three nested generator polynomials, and the same circuit can support different numbers of CRC parity bits. In this example, the same hardware circuit can simultaneously support CRC encoding with 6, 11, and 16 CRC parity bits.

[0154] Example 4

[0155] If M=N=2, the number of CRC check bits supported by the two generating polynomials are 5 and 16 respectively. The generating polynomial that supports CRC check bits of 5 is: g CRC5 (x) = x 5 +x 3 +1. The generating polynomial that supports 16 CRC check bits is: g CRC16 (x) = x 16 +x 14 +x 11 +x 7 +1.

[0156] From this we can see that the generating polynomial g in Example 4 CRC5 (x) and the generating polynomial g CRC16 (x) has a nested relationship. Generating polynomial g CRC16 (x) divided by the polynomial x 16-5 The obtained quotient polynomial and g CRC5 (x)Same.

[0157] In this example, the generator polynomial g CRC5 (x) and the generating polynomial g CRC16 An example of an exemplary hardware implementation circuit of (x) is shown in FIG7 . The entire CRC encoding circuit includes 16 registers, 4 XOR gates, and a switch circuit 730. Initially, the states of the 16 registers are all set to 0. When the switch circuit 730 remains connected, the generator polynomial is g CRC16 The CRC encoding of (x) corresponds to the entire circuit 710 being in effect, that is, the number of CRC check bits L is equal to 16, and the j-th bit p in the CRC check bit sequence is equal to 16. j Corresponding to the 15-jth register D 15-j The state (0 or 1), j is equal to 0, 1, ..., 15. When the switch circuit 730 is disconnected, the generating polynomial is g CRC5 The CRC encoding of (x) corresponds to the circuit 720 (only 5 registers and 2 XOR gates) in action, that is, the number of CRC check bits L is equal to 5, and the jth bit p in the CRC check bit sequence isj the state (0 or 1) of the 15th-j register D 15-j , j equals 0, 1,..., 4.

[0158] Example Five

[0159] Suppose M=N=3, the CRC check bit number supported by the three generator polynomials are 5, 10 and 16 respectively. The generator polynomial supporting CRC check bit number 5 is: CRC5 (x) = x 5 + x 3 + 1. The generator polynomial supporting CRC check bit number 10 is: CRC10 (x) = x 10 + x 8 + x 5 + x 1 + 1. The generator polynomial supporting CRC check bit number 16 is: CRC16 (x) = x 16 + x 14 + x 11 + x 7 + x 6 + x + 1.

[0160] It can be seen that the generator polynomial g CRC5 (x) in Example Five, the generator polynomial g CRC10 (x) and the generator polynomial g CRC16 (x) have a nested relationship. The quotient polynomial obtained by dividing the generator polynomial g CRC16 (x) by the polynomial x 16-10 is the same as g CRC10 (x). The quotient polynomial obtained by dividing the generator polynomial g CRC10 (x) by the polynomial x 10-5 is the same as g CRC5 (x).

[0161] In this example, an exemplary hardware implementation circuit of the generator polynomial g CRC5 (x), the generator polynomial g CRC10 (x) and the generator polynomial g CRC16 (x) is shown in FIG. 8. The entire CRC encoding circuit includes 16 registers, 6 XOR gates and 2 switch circuits. When the switch circuit 810 and the switch circuit 820 remain connected, then the CRC encoding with the generator polynomial g CRC16 (x) is performed, corresponding to the entire circuit in action, i.e. the CRC check bit number L equals 16, the jth bit p j in the CRC check bit sequence corresponds to the 15th-j register D 15-jthe state (0 or 1) of the 15-th to the j-th register D, j being equal to 0, 1,..., 15. When the switch circuit 810 is disconnected and the switch circuit 820 remains connected, then the generating polynomial is g CRC10 (x) of the CRC code, corresponding to the circuit 830 (only 10 registers and 4 XOR gates) being in action, i.e. the number L of CRC check bits is equal to 10, the j-th bit p j of the CRC check bit sequence corresponding to the 15-th to the j-th register D 15-j the state (0 or 1) of the 15-th to the j-th register D, j being equal to 0, 1,..., 15. When the switch circuit 810 is disconnected and the switch circuit 820 remains connected, then the generating polynomial is g CRC5 (x) of the CRC code, corresponding to the circuit 840 (only 5 registers and 2 XOR gates) being in action, i.e. the number L of CRC check bits is equal to 5, the j-th bit p j of the CRC check bit sequence corresponding to the 15-th to the j-th register D 15-j the state (0 or 1) of the 15-th to the j-th register D, j being equal to 0, 1,..., 4.

[0162] Example Six

[0163] The data processing method provided by the present example comprises the following steps:

[0164] Step one, obtaining a first bit sequence.

[0165] Step two, performing CRC encoding on the first bit sequence according to a generating polynomial of a CRC check code to obtain a second bit sequence.

[0166] The generating polynomial of the CRC check code is determined according to a first generating polynomial and U, the first generating polynomial being a non-zero polynomial, and U being a positive integer less than or equal to the degree of the first generating polynomial.

[0167] U is the number of CRC check bits corresponding to the generating polynomial of the CRC check code.

[0168] The generating polynomial of the CRC check code is a remainder polynomial obtained by dividing the first generating polynomial by a first polynomial, the first polynomial being a monomial with a degree equal to U+1.

[0169] In a possible implementation, the degree (the highest power) of the first generating polynomial is equal to one of the following: 14, 15, 16, 17, 18, 19, 20, 22, 24, 28, 32.

[0170] In an example, the generation polynomial of the CRC check code is a remainder polynomial obtained by dividing a first generation polynomial by a first polynomial, the first polynomial being a monomial of degree equal to U+1. U is any one of the N integers, the N integers being {6, 16}, and the first generation polynomial is of degree (highest power) equal to 16. The first generation polynomial is g(D) = 1 + D 1 +D 6 +D 12 +D 16 If U is equal to 16, the generation polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 6 +D 12 +D 16 If U is equal to 6, the generation polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 6 In addition, the first generation polynomial can also be g(D) = 1 + D 5 +D 6 +D 11 +D 16 , g(D) = 1 + D 1 +D 6 +D 7 +D 8 +D 10 +D 16 , g(D) = 1 + D 1 +D 6 +D 7 +D 9 +D 10 +D 16 , g(D) = 1 + D 1 +D 6 +D 7 +D 8 +D 11 +D 16 , g(D) = 1 + D 1 +D 6 +D 8 +D 10 +D 11 +D 16 , g(D) = 1 + D 1 +D 6 +D 9 +D 10 +D 12 +D 16 , g(D) = 1 + D 1 +D 6 +D 8 +D 11 +D 13 +D 16, g(D) = 1 + D 1 + D 6 + D 7 + D 12 + D 13 + D 16 , or g(D) = 1 + D 1 + D 4 + D 5 + D 6 + D 7 + D 9 + D 10 + D 12 + D 13 + D 14 + D 15 + D 16 .

[0171] In another example, U is any one of N integers, the N integers are {5, 14}, and the degree (the highest power) of the first generator polynomial is equal to 14. The first generator polynomial is g(D) = 1 + D 2 + D 5 + D 12 + D 14 If U is equal to 14, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 + D 5 + D 12 + D 14 If U is equal to 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 + D 5 In another example, the first generator polynomial is g(D) = 1 + D 3 + D 5 + D 7 + D 14 .

[0172] In another example, U is any one of N integers, the N integers are {5, 15}, and the degree (the highest power) of the first generator polynomial is equal to 15. The first generator polynomial is one of the following: g(D) = 1 + D 2 + D 5 + D 7 + D 15 , g(D) = 1 + D 2 + D 5 + D 8 + D 15 , g(D) = 1 + D 2 + D 5 + D 12 + D 15 , g(D) = 1 + D 2 + D 5+D 13 +D 15 , g(D) = 1 + D 2 +D 5 +D 14 +D 15 .

[0173] In another example, U is any one of N integers, the N integers are {5, 16}, and the degree (the highest power) of the first generator polynomial is equal to 16. The first generator polynomial is one of the following: g(D) = 1 + D 2 +D 5 +D 9 +D 16 , g(D) = 1 + D 3 +D 5 +D 10 +D 16 , g(D) = 1 + D 2 +D 5 +D 6 +D 7 +D 9 +D 16 .

[0174] In another example, U is any one of N integers, the N integers are {6, 14}, and the degree (the highest power) of the first generator polynomial is equal to 14. The first generator polynomial is one of the following: g(D) = 1 + D 1 +D 6 +D 8 +D 14 , g(D) = 1 + D 1 +D 6 +D 10 +D 14 , g(D) = 1 + D 1 +D 6 +D 11 +D 14 , g(D) = 1 + D 5 +D 6 +D 9 +D 14 , g(D) = 1 + D 5 +D 6 +D 11 +D 14 .

[0175] In another example, U is any one of N integers, the N integers are {6, 15}, and the degree (the highest power) of the first generator polynomial is equal to 15. The first generator polynomial is one of the following: g(D) = 1 + D 1 +D 6 +D 7 +D15 , g(D) = 1 + D 1 + D 6 + D 12 + D 15 , g(D) = 1 + D 1 + D 6 + D 13 + D 15 , g(D) = 1 + D 5 + D 6 + D 8 + D 15 , g(D) = 1 + D 5 + D 6 + D 11 + D 15 , g(D) = 1 + D 5 + D 6 + D 12 + D 15 .

[0176] In another example, U is any one of N integers, the N integers are {6, 15}, and the degree (the highest power) of the first generator polynomial is equal to 15. The first generator polynomial is one of the following: g(D) = 1 + D 1 + D 6 + D 7 + D 15 , g(D) = 1 + D 1 + D 6 + D 12 + D 15 , g(D) = 1 + D 1 + D 6 + D 13 + D 15 , g(D) = 1 + D 5 + D 6 + D 8 + D 15 , g(D) = 1 + D 5 + D 6 + D 11 + D 15 , g(D) = 1 + D 5 + D 6 + D 12 + D 15 .

[0177] In another example, U is any one of N integers, the N integers are {7, 14}, and the degree (the highest power) of the first generator polynomial is equal to 14. The first generator polynomial is one of the following: g(D) = 1 + D 1 + D 7 + D 11 + D 14, g(D) = 1 + D 3 + D 7 + D 13 + D 14 .

[0178] In another example, U is any one of N integers, the N integers are {8, 16}, and the first generator polynomial has a degree (highest power) equal to 16. The first generator polynomial is one of the following: g(D) = 1 + D 2 + D 3 + D 4 + D 8 + D 9 + D 16 , g(D) = 1 + D 2 + D 3 + D 4 + D 8 + D 12 + D 16 .

[0179] In another example, U is any one of N integers, the N integers are {5, 9, 16}, the first generator polynomial has a degree (highest power) equal to 16, and the first generator polynomial has a number of non-zero coefficient terms equal to 9. The first generator polynomial is: g(D) = 1 + D 2 + D 5 + D 7 + D 9 + D 11 + D 12 + D 14 + D 16 If U takes the value of 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 + D 5 + D 7 + D 9 + D 11 + D 12 + D 14 + D 16 If U takes the value of 9, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 + D 5 + D 7 + D 9 If U takes the value of 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 + D 5 In other examples, the corresponding N integers are {5, 9, 16}, and the first generator polynomial is one of the following: g(D) = 1 + D 2 + D 5 + D 7 + D 9 + D11 +D 13 +D 14 +D 16 +D 2 +D 5 +D 7 +D 9 +D 10 +D 13 +D 15 +D 16 +D 3 +D 5 +D 6 +D 9 +D 11 +D 12 +D 13 +D 16 +D 3 +D 5 +D 6 +D 9 +D 10 +D 11 +D 15 +D 16 .

[0180] In another example, U is any one of N integers, N integers are {5, 10, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, and the number of non-zero coefficient terms of the first generator polynomial is equal to 7. The first generator polynomial is: g(D) = 1 + D 2 +D 5 +D 9 +D 10 +D 15 +D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 5 +D 9 +D 10 +D 15 +D 16 If U is equal to 10, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 5 +D 9 +D 10 If U is equal to 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 5 In some other examples, N integers are {5, 10, 16}, and the first generator polynomial is one of the following: g(D) = 1 + D 2 +D 5 +D6 +D 10 +D 11 +D 12 +D 15 +D 16 +D 2 +D 5 +D 6 +D 10 +D 11 +D 14 +D 15 +D 16 +D 2 +D 5 +D 6 +D 7 +D 8 +D 10 +D 11 +D 16 .

[0181] In another example, U is any one of N integers, N integers are {5, 11, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, and the number of non-zero coefficient terms of the first generator polynomial is equal to 7. The first generator polynomial is: g(D) = 1 + D 2 +D 5 +D 8 +D 11 +D 12 +D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 5 +D 8 +D 11 +D 12 +D 16 If U is equal to 11, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 5 +D 8 +D 11 If U is equal to 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 5 In some other examples, N integers are {5, 11, 16}, and the first generator polynomial is one of the following: g(D) = 1 + D 3 +D 5 +D 7 +D 11 +D 12 +D 16 g(D) = 1 + D 3 +D 5 +D7 +D 11 +D 13 +D 16 +D 3 +D 5 +D 7 +D 11 +D 14 +D 16 +D 3 +D 5 +D 9 +D 11 +D 13 +D 16 .

[0182] In another example, U is any one of N integers, N integers are {6, 12, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, and the number of non-zero coefficient terms of the first generator polynomial is equal to 9. The first generator polynomial is: g(D) = 1 + D 1 +D 6 +D 8 +D 9 +D 10 +D 12 +D 13 +D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 6 +D 8 +D 9 +D 10 +D 12 +D 13 +D 16 If U is equal to 12, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 6 +D 8 +D 9 +D 10 +D 12 If U is equal to 6, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 6 In some other examples, N integers are {6, 12, 16}, and the first generator polynomial is g(D) = 1 + D 1 +D 6 +D 8 +D 10 +D 11 +D 12 +D 13 +D 16 .

[0183] In another example, U is any one of N integers, N integers are {5, 9, 12, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, the number of non-zero coefficient terms of the first generator polynomial is equal to 9. The first generator polynomial is: g(D) = 1 + D 3 + D 5 + D 6 + D 9 + D 11 + D 12 + D 13 + D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 3 + D 5 + D 6 + D 9 + D 11 + D 12 + D 13 + D 16 If U is equal to 12, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 3 + D 5 + D 6 + D 9 + D 11 + D 12 If U is equal to 9, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 3 + D 5 + D 6 + D 9 If U is equal to 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 3 + D 5 In another example, N integers are {5, 9, 12, 16}, the first generator polynomial is g(D) = 1 + D 2 + D 5 + D 7 + D 9 + D 10 + D 12 + D 13 + D 14 + D 15 + D 16 .

[0184] In another example, U is any one of N integers, N integers are {5, 9, 12, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, the number of non-zero coefficient terms of the first generator polynomial is equal to 9. The first generator polynomial is: g(D) = 1 + D 3 + D 5 + D 6+D 9 +D 11 +D 12 +D 13 +D 16 If U takes the value of 16, the generator polynomial of the CRC check code equals g(D) = 1 + D 3 +D 5 +D 6 +D 9 +D 11 +D 12 +D 13 +D 16 If U takes the value of 12, the generator polynomial of the CRC check code equals g(D) = 1 + D 3 +D 5 +D 6 +D 9 +D 11 +D 12 If U takes the value of 9, the generator polynomial of the CRC check code equals g(D) = 1 + D 3 +D 5 +D 6 +D 9 If U takes the value of 5, the generator polynomial of the CRC check code equals g(D) = 1 + D 3 +D 5 In other examples, the N integers are {5, 9, 12, 16}, the first generator polynomial equals g(D) = 1 + D 2 +D 5 +D 7 +D 9 +D 10 +D 12 +D 13 +D 14 +D 15 +D 16 .

[0185] In another example, U is any one of the N integers, the N integers are {6, 12, 18, 24}, the first generator polynomial has a degree (highest power) equal to 24, and the first generator polynomial has a number of non-zero coefficient terms equal to 13. The first generator polynomial is: g(D) = 1 + D 5 +D 6 +D 8 +D 12 +D 13 +D 14 +D 15 +D 16 +D 17 +D 18+ D 23 +D 24In other examples, the N integers are {6, 12, 18, 24} and the first generator polynomial is one of: g(D) = 1 + D 5 +D 6 +D 7 +D 9 +D 11 +D 12 +D 14 +D 16 +D 17 +D 18 +D 21 +D 24 +D 1 +D 2 +D 5 +D 6 +D 9 +D 12 +D 13 +D 15 +D 17 +D 18 +D 21 +D 24 +D 1 +D 2 +D 5 +D 6 +D 10 +D 12 +D 14 +D 15 +D 17 +D 18 +D 21 +D 24 +D 1 +D 2 +D 5 +D 6 +D 7 +D 8 +D 11 +D 12 +D 17 +D 18 +D 20 +D 24 .

[0186] In another example, U is any one of the N integers, the N integers are {3, 7, 11, 16}, the first generator polynomial has a degree (highest power) of 16, and the first generator polynomial has 9 non-zero coefficient terms. The first generator polynomial is: g(D) = 1 + D 2 +D 3 +D 4 +D 7 +D 9 +D 11 +D15 +D 16 If U takes the value 16, the generator polynomial of the CRC check code equals g(D) = 1 + D 2 +D 3 +D 4 +D 7 +D 9 +D 11 +D 15 +D 16 If U takes the value 11, the generator polynomial of the CRC check code equals g(D) = 1 + D 2 +D 3 +D 4 +D 7 +D 9 +D 11 If U takes the value 7, the generator polynomial of the CRC check code equals g(D) = 1 + D 2 +D 3 +D 4 +D 7 If U takes the value 3, the generator polynomial of the CRC check code equals g(D) = 1 + D 2 +D 3 In other examples, the N integers are {3, 7, 11, 16} and the first generator polynomial is g(D) = 1 + D 2 +D 3 +D 4 +D 7 +D 10 +D 11 +D 12 +D 16 g(D) = 1 + D 2 +D 3 +D 4 +D 7 +D 10 +D 11 +D 15 +D 16 g(D) = 1 + D 1 +D 3 +D 5 +D 7 +D 9 +D 11 +D 12 +D 13 +D 14 +D 16 g(D) = 1 + D 2 +D 3 +D 4 +D 7 +D 9 +D 11 +D13 +D 14 +D 15 +D 16 .

[0187] In another example, U is any one of N integers, the N integers are {4, 7, 12, 16}, and the degree (highest power) of the first generator polynomial is equal to 16. The first generator polynomial is one of: g(D) = 1 + D 1 +D 4 +D 6 +D 7 +D 10 +D 12 +D 13 +D 14 +D 15 +D 16 , g(D) = 1 + D 1 +D 4 +D 6 +D 7 +D 8 +D 9 +D 11 +D 12 +D 13 +D 16 .

[0188] In another example, U is any one of N integers, the N integers are {3, 8, 12, 18, 24}, and the degree (highest power) of the first generator polynomial is equal to 24. The number of non-zero coefficient terms of the first generator polynomial is equal to 11. The first generator polynomial is: g(D) = 1 + D 2 +D 3 +D 4 +D 8 +D 9 +D 12 +D 16 +D 18 +D 20 +D 24 .

[0189] In another example, U is any one of N integers, the N integers are {4, 9, 13, 17, 21, 24}, and the degree (highest power) of the first generator polynomial is equal to 24. The number of non-zero coefficient terms of the first generator polynomial is equal to 15. The first generator polynomial is one of: g(D) = 1 + D 3 +D 4 +D 5 +D 7 +D 8 +D 9 +D 12 +D 13 +D14 +D 17 +D 19 +D 21+ D 23 +D 24 , g(D) = 1 + D 3 +D 4 +D 6 +D 7 +D 8 +D 9 +D 11 +D 13 +D 16 +D 17 +D 20 +D 21+ D 23 +D 24 .

[0190] Example Seven

[0191] The difference between the present example and Example Six is that only the first generator polynomial and the N integers are listed, and the example implementation circuit can be designed with reference to the description of Examples One to Five, which will not be repeated here.

[0192] The generator polynomial of the CRC check code is a quotient polynomial obtained by dividing the first generator polynomial by a first polynomial, and the first polynomial is a monomial with a degree equal to L1-U, where L1 is the degree (the highest power) of the first generator polynomial.

[0193] In an example, U is any one of the N integers, the N integers are {5, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, and the number of non-zero coefficient terms of the first generator polynomial is equal to 5. The first generator polynomial is g(D) = 1 + D 6 +D 11 +D 13 +D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 6 +D 11 +D 13 +D 16 If U is equal to 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 5 In addition, the first generator polynomial can also be g(D) = 1 + D 7 +D 11 +D 14 +D 16 .

[0194] In one example, U is any one of N integers, N integers are {5, 14}, the degree (the highest power) of the first generator polynomial is equal to 14, the number of non-zero coefficient terms of the first generator polynomial is equal to 5. The first generator polynomial is g(D) = 1 + D 7 +D 9 +D 11 +D 14 If U is equal to 14, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 7 +D 9 +D 11 +D 14 If U is equal to 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 5 In addition, the first generator polynomial can also be one of the following: g(D) = 1 + D 2 +D 9 +D 12 +D 14 .

[0195] In one example, U is any one of N integers, N integers are {5, 15}, the degree (the highest power) of the first generator polynomial is equal to 15, the number of non-zero coefficient terms of the first generator polynomial is equal to 5. The first generator polynomial is g(D) = 1 + D 1 +D 10 +D 13 +D 15 If U is equal to 15, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 10 +D 13 +D 15 If U is equal to 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 3 +D 5 In addition, the first generator polynomial can also be one of the following: g(D) = 1 + D 2 +D 10 +D 13 +D 15 , g(D) = 1 + D 3 +D 10 +D 13 +D 15 , g(D) = 1 + D 7 +D 10 +D 13 +D 15 , g(D) = 1 + D 8 +D 10 +D 13 +D 15 .

[0196] In one example, U is any one of N integers, N integers are {6, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, the number of non-zero coefficient terms of the first generator polynomial is equal to 5. The first generator polynomial is g(D) = 1 + D 5 +D 10 +D 11 +D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 5 +D 10 +D 11 +D 16 If U is equal to 6, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 6 In addition, the first generator polynomial can also be one of the following: g(D) = 1 + D 4 +D 10 +D 15 +D 16 .

[0197] In one example, U is any one of N integers, N integers are {6, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, the number of non-zero coefficient terms of the first generator polynomial is equal to 5. The first generator polynomial is g(D) = 1 + D 4 +D 10 +D 15 +D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 4 +D 10 +D 15 +D 16 If U is equal to 6, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 5 +D 6 In addition, the first generator polynomial can also be one of the following: g(D) = 1 + D 2 +D 3 +D 8 +D 10 +D 15 +D 16 , g(D) = 1 + D 1 +D 4 +D 8 +D 10 +D 15 +D 16 , g(D) = 1 + D 3 +D 5 +D 8 +D10 +D 15 +D 16 +D 5 +D 6 +D 8 +D 10 +D 15 +D 16 +D 2 +D 7 +D 8 +D 10 +D 15 +D 16 .

[0198] In one example, U is any one of N integers, N integers are {6, 10, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, and the number of non-zero coefficient terms of the first generator polynomial is equal to 7. The first generator polynomial is g(D) = 1 + D 4 +D 6 +D 7 +D 10 +D 15 +D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 4 +D 6 +D 7 +D 10 +D 15 +D 16 If U is equal to 10, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 4 +D 9 +D 10 If U is equal to 6, N integers are {6, 10, 16}, and the generator polynomial of the CRC check code is equal to g(D) = 1 + D 5 +D 6 In addition, the first generator polynomial can also be one of the following: g(D) = 1 + D 5 +D 6 +D 8 +D 10 +D 15 +D 16 , g(D) = 1 + D 1 +D 2 +D 3 +D 6 +D 7 +D 10 +D 15 +D 16 , g(D) = 1 + D 2 +D3 +D 4 +D 6 +D 7 +D 10 +D 15 +D 16 .

[0199] In one example, U is any one of N integers, N integers are {6, 12, 18, 24}, the degree (the highest power) of the first generating polynomial is equal to 24, the number of non-zero coefficient terms of the first generating polynomial is equal to 15. The first generating polynomial is g(D) = 1 + D 1 +D 2 +D 3 +D 4 +D 5 +D 6 +D 8 +D 12 +D 13 +D 14 +D 16 +D 18+ D 23 +D 24 If U takes the value of 24, the generating polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 2 +D 3 +D 4 +D 5 +D 6 +D 8 +D 12 +D 13 +D 14 +D 16 +D 18+ D 23 +D 24 If U takes the value of 18, the generating polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 6 +D 7 +D 8 +D 10 +D 12 +D 17 +D 18 If U takes the value of 12, the generating polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 2 +D 4 +D 6 +D 11 +D 12 If U takes the value of 6, the generating polynomial of the CRC check code is equal to g(D) = 1 + D 5 +D 6In addition, the N integers are {6, 12, 18, 24}, and the first generator polynomial can also be one of the following: g(D) = 1 + D 1 +D 3 +D 5 +D 6 +D 7 +D 9 +D 10 +D 12 +D 14 +D 15 +D 16 +D 18+ D 23 +D 24 , g(D) = 1 + D 2 +D 3 +D 5 +D 6 +D 7 +D 9 +D 10 +D 12 +D 14 +D 15 +D 16 +D 18+ D 23 +D 24 , g(D) = 1 + D 3 +D 6 +D 7 +D 8 +D 9 +D 10 +D 11 +D 12 +D 14 +D 15 +D 16 +D 18+ D 23 +D 24 .

[0200] In one example, U is any one of the N integers, the N integers are {5, 14}, the degree (the highest power) of the first generator polynomial is equal to 14, and the number of non-zero coefficient terms of the first generator polynomial is equal to 5. The first generator polynomial is g(D) = 1 + D 2 +D 9 +D 12 +D 14 If U is equal to 14, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 9 +D 12 +D 14 If U is equal to 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 3 +D5 .

[0201] In one example, U is any one of N integers, N integers are {5, 15}, the degree (the highest power) of the first generator polynomial is equal to 15, the number of non-zero coefficient terms of the first generator polynomial is equal to 5. The first generator polynomial is one of the following: g(D) = 1 + D 1 + D 10 + D 13 + D 15 , g(D) = 1 + D 2 + D 10 + D 13 + D 15 , g(D) = 1 + D 3 + D 10 + D 13 + D 15 , g(D) = 1 + D 7 + D 10 + D 13 + D 15 , g(D) = 1 + D 8 + D 10 + D 13 + D 15 .

[0202] In one example, U is any one of N integers, N integers are {5, 18}, the degree (the highest power) of the first generator polynomial is equal to 18, the number of non-zero coefficient terms of the first generator polynomial is equal to 5. The first generator polynomial is one of the following: g(D) = 1 + D 3 + D 13 + D 16 + D 18 , g(D) = 1 + D 6 + D 13 + D 16 + D 18 .

[0203] In one example, U is any one of N integers, N integers are {5, 12, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, the number of non-zero coefficient terms of the first generator polynomial is equal to 9. The first generator polynomial is one of the following: g(D) = 1 + D 2 + D 4 + D 5 + D 6 + D 9 + D 11 + D 14 + D 16 . In another example, the first generator polynomial is g(D) = 1 + D 3 + D 4 + D5 +D 8 +D 10 +D 11 +D 14 +D 16 In another example, the first generator polynomial is one of: g(D) = 1 + D 1 +D 2 +D 3 +D 4 +D 6 +D 7 +D 9 +D 11 +D 14 +D 16 .

[0204] In one example, U is any one of N integers, the N integers are {5, 11, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, and the number of non-zero coefficient terms of the first generator polynomial is equal to 7. The first generator polynomial is g(D) = 1 + D 4 +D 5 +D 8 +D 11 +D 14 +D 16 In another example, the first generator polynomial is one of: g(D) = 1 + D 1 +D 2 +D 3 +D 5 +D 8 +D 11 +D 14 +D 16 , g(D) = 1 + D 2 +D 5 +D 8 +D 9 +D 10 +D 11 +D 14 +D 16 , g(D) = 1 + D 4 +D 5 +D 8 +D 9 +D 10 +D 11 +D 14 +D 16 , g(D) = 1 + D 1 +D 5 +D 6 +D 7 +D 8 +D 9 +D 10 +D 11 +D14 +D 16 .

[0205] In one example, U is any one of N integers, N integers are {5, 10, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, and the number of non-zero coefficient terms of the first generator polynomial is equal to 7. The first generator polynomial is g(D) = 1 + D 1 +D 6 +D 7 +D 11 +D 14 +D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 6 +D 7 +D 11 +D 14 +D 16 If U is equal to 10, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 5 +D 8 +D 10 If U is equal to 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 3 +D 5 In another example, the first generator polynomial is one of the following: g(D) = 1 + D 1 +D 3 +D 4 +D 6 +D 7 +D 11 +D 14 +D 16 , g(D) = 1 + D 1 +D 2 +D 5 +D 6 +D 10 +D 11 +D 14 +D 16 , g(D) = 1 + D 1 +D 4 +D 5 +D 6 +D 10 +D 11 +D 14 +D 16 .

[0206] In one example, U is any one of N integers, N integers are {8, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, and the number of non-zero coefficient terms of the first generator polynomial is equal to 7. The first generator polynomial is g(D) = 1 + D 7 + D 8 + D 10 + D 11 + D 12 + D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 7 + D 8 + D 10 + D 11 + D 12 + D 16 If U is equal to 8, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 + D 3 + D 4 + D 8 In addition, N integers are {8, 16}, and the first generator polynomial can also be one of the following: g(D) = 1 + D 3 + D 8 + D 9 + D 11 + D 13 + D 16 , g(D) = 1 + D 6 + D 8 + D 10 + D 11 + D 13 + D 16 , g(D) = 1 + D 7 + D 8 + D 10 + D 11 + D 13 + D 16 .

[0207] In one example, U is any one of N integers, N integers are {5, 10, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, and the number of non-zero coefficient terms of the first generator polynomial is equal to 7. The first generator polynomial is g(D) = 1 + D 1 + D 6 + D 7 + D 11 + D 14 + D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 + D 6 + D 7 + D11 +D 14 +D 16 If U takes the value 10, the generator polynomial of the CRC check code equals g(D) = 1 + D 1 +D 5 +D 8 +D 10 If U takes the value 5, the generator polynomial of the CRC check code equals g(D) = 1 + D 3 +D 5 In addition, the N integers are {5, 10, 16} and the first generator polynomial can also be one of the following: g(D) = 1 + D 1 +D 3 +D 4 +D 6 +D 7 +D 11 +D 14 +D 16 , g(D) = 1 + D 1 +D 2 +D 5 +D 6 +D 10 +D 11 +D 14 +D 16 , g(D) = 1 + D 1 +D 4 +D 5 +D 6 +D 10 +D 11 +D 14 +D 16 .

[0208] In one example, U is any one of the N integers, the N integers being {5, 11, 16}, the degree (the highest power) of the first generator polynomial equals 16, and the number of non-zero coefficient terms of the first generator polynomial equals 7. The first generator polynomial is g(D) = 1 + D 3 +D 5 +D 7 +D 11 +D 13 +D 16 If U takes the value 16, the generator polynomial of the CRC check code equals g(D) = 1 + D 3 +D 5 +D 7 +D 11 +D 13 +D 16 If U takes the value 11, the generator polynomial of the CRC check code equals g(D) = 1 + D 2 +D 6 +D8 +D 11 If U takes the value 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 5 In addition, the N integers are {5, 11, 16} and the first generator polynomial can also be one of the following: g(D) = 1 + D 2 +D 5 +D 9 +D 11 +D 13 +D 16 , g(D) = 1 + D 3 +D 5 +D 9 +D 11 +D 13 +D 16 , g(D) = 1 + D 4 +D 5 +D 9 +D 11 +D 13 +D 16 , g(D) = 1 + D 4 +D 5 +D 8 +D 11 +D 14 +D 16 .

[0209] In one example, U is any one of the N integers, the N integers being {6, 11, 16}, the degree (the highest power) of the first generator polynomial being equal to 16 and the number of non-zero coefficient terms of the first generator polynomial being equal to 7. The first generator polynomial is g(D) = 1 + D 3 +D 5 +D 6 +D 10 +D 11 +D 16 If U takes the value 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 3 +D 5 +D 6 +D 10 +D 11 +D 16 If U takes the value 11, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 5 +D 6 +D 11 If U takes the value 6, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 6In addition, the N integers are {6, 11, 16}, and the first generator polynomial can also be one of the following: g(D) = 1 + D 4 +D 5 +D 6 +D 10 +D 11 +D 16 +D 1 +D 5 +D 7 +D 10 +D 11 +D 16 .

[0210] In one example, U is any one of the N integers, the N integers are {5, 9, 12, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, and the number of non-zero coefficient terms of the first generator polynomial is equal to 9. The first generator polynomial is g(D) = 1 + D 3 +D 4 +D 5 +D 7 +D 10 +D 11 +D 13 +D 16 If U is equal to 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 3 +D 4 +D 5 +D 7 +D 10 +D 11 +D 13 +D 16 If U is equal to 12, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 3 +D 6 +D 7 +D 9 +D 12 If U is equal to 9, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 3 +D 4 +D 6 +D 9 If U is equal to 5, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 5 In addition, the N integers are {5, 9, 12, 16}, and the first generator polynomial can also be one of the following: g(D) = 1 + D 1 +D 2 +D 3 +D 4 +D 6+D 7 +D 9 +D 11 +D 14 +D 16 .

[0211] In one example, U is any one of N integers, N integers are {6, 12, 18, 24}, the degree (the highest power) of the first generator polynomial is equal to 24, and the number of non-zero coefficient terms of the first generator polynomial is equal to 13. The first generator polynomial is g(D) = 1 + D 1 +D 6 +D 7 +D 8 +D 9 +D 10 +D 11 +D 12 +D 16 +D 18 +D 19 +D 24 If U is equal to 24, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 6 +D 7 +D 8 +D 9 +D 10 +D 11 +D 12 +D 16 +D 18 +D 19 +D 24 If U is equal to 18, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 2 +D 3 +D 4 +D 5 +D 6 +D 10 +D 12 +D 13 +D 18 If U is equal to 12, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 4 +D 6 +D 7 +D 12 If U is equal to 6, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 6 In addition, N integers are {5, 9, 12, 16}, and the first generator polynomial can also be one of the following: g(D) = 1 + D 3 +D 6 +D7 +D 8 +D 10 +D 12 +D 13 +D 15 +D 17 +D 18 +D 19 +D 24 , g(D) = 1 + D 3 +D 6 +D 7 +D 9 +D 10 +D 12 +D 14 +D 18 +D 19 +D 22+ D 23 +D 24 , g(D) = 1 + D 3 +D 6 +D 7 +D 9 +D 11 +D 12 +D 15 +D 18 +D 19 +D 22+ D 23 +D 24 .

[0212] In one example, U is any one of N integers, N integers are {5, 9, 13, 16}, the degree (the highest power) of the first generating polynomial is equal to 16, the number of non-zero coefficient terms of the first generating polynomial is equal to 9. The first generating polynomial is g(D) = 1 + D 2 +D 3 +D 5 +D 7 +D 9 +D 11 +D 14 +D 16 If U takes the value of 16, the generating polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 3 +D 5 +D 7 +D 9 +D 11 +D 14 +D 16 If U takes the value of 13, the generating polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 4 +D 6 +D 8 +D11 +D 13 If U takes the value 13, the generator polynomial of the CRC check code equals g(D) = 1 + D 2 +D 4 +D 7 +D 9 If U takes the value 5, the generator polynomial of the CRC check code equals g(D) = 1 + D 3 +D 5 In addition, the N integers are {5, 9, 13, 16}, and the first generator polynomial can also be one of the following: g(D) = 1 + D 1 +D 3 +D 4 +D 5 +D 6 +D 7 +D 10 +D 11 +D 13 +D 16 , g(D) = 1 + D 1 +D 3 +D 6 +D 7 +D 9 +D 11 +D 12 +D 14 +D 15 +D 16 .

[0213] In one example, U is any one of the N integers, the N integers are {3, 6, 9, 13}, the degree (the highest power) of the first generator polynomial equals 13, and the number of non-zero coefficient terms of the first generator polynomial equals 9. The first generator polynomial is g(D) = 1 + D 2 +D 4 +D 5 +D 7 +D 8 +D 10 +D 11 +D 13 If U takes the value 13, the generator polynomial of the CRC check code equals g(D) = 1 + D 2 +D 4 +D 5 +D 7 +D 8 +D 10 +D 11 +D 13 If U takes the value 9, the generator polynomial of the CRC check code equals g(D) = 1 + D 1 +D 3 +D 4 +D6 +D 7 +D 9 If U takes the value 6, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 3 +D 4 +D 6 If U takes the value 3, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 3 In addition, the N integers are {3, 6, 9, 13} and the first generator polynomial can also be one of the following: g(D) = 1 + D 1 +D 4 +D 6 +D 7 +D 9 +D 10 +D 12 +D 13 , g(D) = 1 + D 2 +D 4 +D 6 +D 7 +D 9 +D 10 +D 12 +D 13 .

[0214] In one example, U is any one of the N integers, the N integers being {3, 7, 11, 16}, the degree (the highest power) of the first generator polynomial being equal to 16, and the number of non-zero coefficient terms of the first generator polynomial being equal to 9. The first generator polynomial is g(D) = 1 + D 1 +D 5 +D 6 +D 9 +D 12 +D 13 +D 14 +D 16 If U takes the value 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 5 +D 6 +D 9 +D 12 +D 13 +D 14 +D 16 If U takes the value 11, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 4 +D 7 +D 8 +D 9 +D 11; if U takes the value 7, the CRC check code generator polynomial equals g(D) = 1 + D 3 +D 4 +D 5 +D 7 ; if U takes the value 3, the CRC check code generator polynomial equals g(D) = 1 + D 1 +D 3 In addition, the N integers are {3, 7, 11, 16} and the first generator polynomial can also be one of the following: g(D) = 1 + D 4 +D 5 +D 6 +D 9 +D 12 +D 13 +D 14 +D 16 , g(D) = 1 + D 1 +D 5 +D 7 +D 9 +D 12 +D 13 +D 14 +D 16 .

[0215] In one example, U is any one of the N integers, the N integers are {3, 6, 9, 13, 16}, the first generator polynomial has a degree (highest power) equal to 16 and the first generator polynomial has a number of non-zero coefficient terms equal to 11. The first generator polynomial is g(D) = 1 + D 1 +D 3 +D 4 +D 7 +D 9 +D 10 +D 12 +D 13 +D 15 +D 16 If U takes the value 16, the CRC check code generator polynomial equals g(D) = 1 + D 1 +D 3 +D 4 +D 7 +D 9 +D 10 +D 12 +D 13 +D 15 +D 16 If U takes the value 13, the CRC check code generator polynomial equals g(D) = 1 + D 1 +D 4 +D 6 +D 7 +D 9 +D10 +D 12 +D 13 If U takes the value 9, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 3 +D 5 +D 6 +D 8 +D 9 If U takes the value 6, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 3 +D 5 +D 6 If U takes the value 3, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 2 +D 3 .

[0216] In one example, U is any one of N integers, N integers are {4, 7, 10, 13, 16}, the degree (the highest power) of the first generator polynomial is equal to 16, the number of non-zero coefficient terms of the first generator polynomial is equal to 11. The first generator polynomial is g(D) = 1 + D 1 +D 3 +D 4 +D 6 +D 7 +D 9 +D 10 +D 12 +D 15 +D 16 If U takes the value 16, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 3 +D 4 +D 6 +D 7 +D 9 +D 10 +D 12 +D 15 +D 16 If U takes the value 13, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 3 +D 4 +D 6 +D 7 +D 9 +D 12 +D 13 If U takes the value 10, the generator polynomial of the CRC check code is equal to g(D) = 1 + D 1 +D 3 +D 4 +D6 +D 9 +D 10 If U takes the value 7, the generator polynomial of the CRC check code equals g(D) = 1 + D 1 +D 3 +D 6 +D 7 If U takes the value 4, the generator polynomial of the CRC check code equals g(D) = 1 + D 3 +D 4 .

[0217] In one example, U is any one of N integers, N integers are {4, 9, 13, 17, 21, 24}, the degree (the highest power) of the first generator polynomial equals 24, the number of non-zero coefficient terms of the first generator polynomial equals 15. The first generator polynomial is g(D) = 1 + D 1 +D 3 +D 4 +D 7 +D 8 +D 11 +D 13 +D 15 +D 16 +D 17 +D 18 +D 20 +D 21 +D 24 If U takes the value 24, the generator polynomial of the CRC check code equals g(D) = 1 + D 1 +D 3 +D 4 +D 7 +D 8 +D 11 +D 13 +D 15 +D 16 +D 17 +D 18 +D 20 +D 21 +D 24 If U takes the value 21, the generator polynomial of the CRC check code equals g(D) = 1 + D 1 +D 4 +D 5 +D 8 +D 10 +D 12 +D 13 +D 14 +D 15 +D 17 +D 18 +D 21; if U takes the value 17, the generating polynomial of the CRC check code equals g(D) = 1 + D 1 +D 4 +D 6 +D 8 +D 9 +D 10 +D 11 +D 13 +D 14 +D 17 ; if U takes the value 13, the generating polynomial of the CRC check code equals g(D) = 1 + D 2 +D 4 +D 5 +D 6 +D 7 +D 9 +D 10 +D 13 ; if U takes the value 9, the generating polynomial of the CRC check code equals g(D) = 1 + D 1 +D 2 +D 3 +D 5 +D 6 +D 9 ; if U takes the value 4, the generating polynomial of the CRC check code equals g(D) = 1 + D 1 +D 4 . In addition, the N integers are {4, 9, 13, 17, 21, 24}, and the first generating polynomial can also be one of the following: g(D) = 1 + D 1 +D 3 +D 5 +D 7 +D 10 +D 11 +D 12 +D 15 +D 16 +D 17 +D 19 +D 20 +D 21 +D 24 .

[0218] Example Eight

[0219] The difference between this example and the above examples is that only multiple generating polynomials with a nested relationship are listed, and the example implementation circuit can be designed with reference to the description of Examples One to Five, which will not be repeated here.

[0220] In one example, the CRC encoding includes N = 2 polynomials, the number of CRC check bits supported by the 2 polynomials are 5 and 16, respectively. The number of non-zero coefficients in the polynomial with 5 CRC check bits is equal to 3, and the number of non-zero coefficients in the polynomial with 16 CRC check bits is equal to 5. The 2 polynomials are g(D) = 1 + D 3 +D 5 , and g(D) = 1 + D 3 +D 5 +D 10 +D 16 , respectively. Alternatively, the 2 polynomials are g(D) = 1 + D 2 +D 5 , and g(D) = 1 + D 2 +D 5 +D 9 +D 16 , respectively.

[0221] In one example, the CRC encoding includes N = 2 polynomials, the number of CRC check bits supported by the 2 polynomials are 6 and 16, respectively. In one example, the number of non-zero coefficients in the polynomial with 6 CRC check bits is equal to 3, and the number of non-zero coefficients in the polynomial with 16 CRC check bits is equal to 5. The 2 polynomials are g(D) = 1 + D 5 +D 6 , and g(D) = 1 + D 5 +D 6 +D 11 +D 16 , respectively. Alternatively, the 2 polynomials are g(D) = 1 + D 1 +D 6 , and g(D) = 1 + D 1 +D 6 +D 12 +D 16 , respectively.

[0222] In one example, the CRC encoding includes N = 2 polynomials, the number of CRC check bits supported by the 2 polynomials are 8 and 16, respectively. In one example, the number of non-zero coefficients in the polynomial with 8 CRC check bits is equal to 5, and the number of non-zero coefficients in the polynomial with 16 CRC check bits is equal to 7. The 2 polynomials are g(D) = 1 + D 4 +D 5 +D 6 +D 8 , and g(D) = 1 + D 4 +D 5 +D6 +D 8 +D 9 +D 16 Alternatively, the two generator polynomials are g(D) = 1 + D 3 +D 5 +D 7 +D 8 , g(D) = 1 + D 3 +D 5 +D 7 +D 8 +D 13 +D 16 Alternatively, the two generator polynomials are g(D) = 1 + D 3 +D 5 +D 6 +D 8 , g(D) = 1 + D 3 +D 5 +D 6 +D 8 +D 10 +D 16 Alternatively, the two generator polynomials are g(D) = 1 + D 3 +D 5 +D 6 +D 8 , g(D) = 1 + D 3 +D 5 +D 6 +D 8 +D 9 +D 16 .

[0223] In one example, the CRC encoding includes N = 3 generator polynomials, and the number of CRC check bits supported by the 3 generator polynomials are 5, 10, and 16, respectively. In one example, the number of terms with non-zero coefficients in the generator polynomial for the 5 CRC check bits is equal to 3, the number of terms with non-zero coefficients in the generator polynomial for the 10 CRC check bits is equal to 5, and the number of terms with non-zero coefficients in the generator polynomial for the 16 CRC check bits is equal to 7. The 3 generator polynomials are g(D) = 1 + D 2 +D 5 , g(D) = 1 + D 2 +D 5 +D 9 +D 10 , g(D) = 1 + D 2 +D 5 +D 9 +D 10 +D 15 +D 16 .

[0224] In one example, the CRC encoding includes N=3 generator polynomials, and the number of CRC check bits supported by the 3 generator polynomials are 5, 11 and 16, respectively. In one example, the number of terms with non-zero coefficients in the generator polynomial with 5 CRC check bits is equal to 3, the number of terms with non-zero coefficients in the generator polynomial with 11 CRC check bits is equal to 5, and the number of terms with non-zero coefficients in the generator polynomial with 16 CRC check bits is equal to 7. The 3 generator polynomials are g(D) = 1 + D 3 +D 5 , g(D) = 1 + D 3 +D 5 +D 9 +D 11 , g(D) = 1 + D 3 +D 5 +D 9 +D 11 +D 13 +D 16 , or the 3 generator polynomials are g(D) = 1 + D 3 +D 5 , g(D) = 1 + D 3 +D 5 +D 7 +D 11 , g(D) = 1 + D 3 +D 5 +D 7 +D 11 +D 13 +D 16 , or the 3 generator polynomials are g(D) = 1 + D 2 +D 5 , g(D) = 1 + D 2 +D 5 +D 8 +D 11 , g(D) = 1 + D 2 +D 5 +D 8 +D 11 +D 12 +D 16 .

[0225] In one example, the CRC encoding includes N=3 generator polynomials, the N=3 generator polynomials support CRC check bit numbers of 5, 12, and 16, respectively. In one example, the number of terms in the generator polynomial with CRC check bit number 5 that have a non-zero coefficient is equal to 5, the number of terms in the generator polynomial with CRC check bit number 11 that have a non-zero coefficient is equal to 7, and the number of terms in the generator polynomial with CRC check bit number 16 that have a non-zero coefficient is equal to 9. The N=3 generator polynomials are g(D) = 1 + D 1 +D 2 +D 4 +D 5 , g(D) = 1 + D 1 +D 2 +D 4 +D 5 +D 9 +D 12 , g(D) = 1 + D 1 +D 2 +D 4 +D 5 +D 9 +D 12 +D 13 +D 16 .

[0226] In one example, the CRC encoding includes N=3 generator polynomials, the N=3 generator polynomials support CRC check bit numbers of 6, 12, and 16, respectively. In one example, the number of terms in the generator polynomial with CRC check bit number 6 that have a non-zero coefficient is equal to 3, the number of terms in the generator polynomial with CRC check bit number 12 that have a non-zero coefficient is equal to 7, and the number of terms in the generator polynomial with CRC check bit number 16 that have a non-zero coefficient is equal to 9. The N=3 generator polynomials are g(D) = 1 + D 1 +D 6 , g(D) = 1 + D 1 +D 6 +D 8 +D 10 +D 11 +D 12 , g(D) = 1 + D 1 +D 6 +D 8 +D 10 +D 11 +D 12 +D 13 +D 16 . Alternatively, the N=3 generator polynomials are g(D) = 1 + D 1 +D 6 , g(D) = 1 + D 1 +D6 +D 8 +D 9 +D 10 +D 12 , g(D) = 1 + D 1 +D 6 +D 8 +D 9 +D 10 +D 12 +D 13 +D 16 .

[0227] In one example, the CRC encoding includes N = 4 generator polynomials, the N = 4 generator polynomials support CRC check bit numbers of 5, 10, 16, and 24, respectively. In one example, the number of terms with non-zero coefficients in the generator polynomial for a CRC check bit number of 6 is equal to 3, the number of terms with non-zero coefficients in the generator polynomial for a CRC check bit number of 12 is equal to 7, and the number of terms with non-zero coefficients in the generator polynomial for a CRC check bit number of 16 is equal to 9. The N = 3 generator polynomials are g(D) = 1 + D 1 +D 6 , g(D) = 1 + D 1 +D 6 +D 8 +D 10 +D 11 +D 12 , g(D) = 1 + D 1 +D 6 +D 8 +D 10 +D 11 +D 12 +D 13 +D 16 . Alternatively, the 3 generator polynomials are g(D) = 1 + D 1 +D 6 , g(D) = 1 + D 1 +D 6 +D 8 +D 9 +D 10 +D 12 , g(D) = 1 + D 1 +D 6 +D 8 +D 9 +D 10 +D 12 +D 13 +D 16 .

[0228] Example Nine

[0229] The data processing method provided in the example comprises the following steps:

[0230] Step one, obtaining a first bit sequence.

[0231] Step two, performing CRC encoding on the first bit sequence according to a generation polynomial of the CRC check code to obtain a second bit sequence.

[0232] The generation polynomial of the CRC check code is determined from M generation polynomials, where M is an integer greater than 1.

[0233] In a possible implementation, the M generation polynomials comprise N generation polynomials comprising the first generation polynomial and the second generation polynomial, and Y generation polynomials, where N is a positive integer, and Y is an integer greater than or equal to 0. The generation polynomials in the N generation polynomials can be obtained based on the first generation polynomial, and the generation polynomials in the Y generation polynomials cannot be obtained based on the first generation polynomial. That is, the M generation polynomials comprise N+1 generation polynomials (including the first generation polynomial) having a nested relationship and Y generation polynomials not having a nested relationship.

[0234] In one example, Y is an integer greater than 0. The Y generation polynomials are at least one of the following: g CRC24A (D)=D 24 +D 23 +D 18 +D 17 +D 14 +D 11 +D 10 +D 7 +D 6 +D 5 +D 4 +D 3 +D+1, and the corresponding number of CRC check bits is 24; g CRC24B (D)=[D 24 +D 23 +D 6 +D 5 +D+1], and the corresponding number of CRC check bits is 24; g CRC24c (D)=D 24 +D 23 +D 21 +D 20 +D 17 +D 15 +D 13 +D 12 +D 8 +D 4 +D 2 +D+1, and the corresponding number of CRC check bits is 24; g CRC16 (D)=D16 +D 12 +D 5 +1, the corresponding number of CRC check bits is 16;g CRC11 (D)=D 11 +D 10 +D 9 +D 5 +1, the corresponding number of CRC check bits is 11;g CRC6 (D)=D 6 +D 5 +1, the corresponding number of CRC check bits is 6.

[0235] In a possible implementation, each of the N polynomials can be obtained based on the first polynomial, and can include: any one of the N polynomials is a remainder polynomial obtained by dividing the first polynomial by a target polynomial, and the target polynomial is a monomial with a degree of L2+1. L2 is the number of CRC check bits corresponding to any one of the N polynomials, and L2 is a positive integer.

[0236] In one example, the first polynomial is: g(D)=1+D 2 +D 5 +D 9 +D 10 +D 15 +D 16 , and the corresponding number of CRC check bits is 16; the N polynomials are: g(D)=1+D 2 +D 5 , g(D)=1+D 2 +D 5 +D 9 +D 10 , and the corresponding number of CRC check bits is {5, 11}.

[0237] In one example, the first polynomial is: g(D)=1+D 3 +D 5 +D 9 +D 11 +D 13 +D 16 , and the corresponding number of CRC check bits is 16; the N polynomials are: g(D)=1+D 3 +D 5 , g(D)=1+D 3 +D 5 +D 9 +D 11 , and the corresponding number of CRC check bits is {5, 11}.

[0238] In another possible implementation, each of the N generation polynomials can be obtained based on the first generation polynomial, which can include that any generation polynomial of the N generation polynomials is a quotient polynomial obtained by dividing the first generation polynomial by a target polynomial, and the target polynomial is a monomial with a degree equal to L1-L2. L2 is a number of CRC check bits corresponding to any generation polynomial of the N generation polynomials, and L2 is a positive integer. L1 is a number of CRC check bits (or a degree or a highest power) corresponding to the first generation polynomial.

[0239] In one example, the first generation polynomial is g(D) = 1 + D 1 +D 6 +D 7 +D 11 +D 14 +D 16 , and a corresponding number of CRC check bits is 16; the N generation polynomials are g(D) = 1 + D 3 +D 5 , g(D) = 1 + D 1 +D 5 +D 8 +D 10 , and corresponding numbers of CRC check bits are {5, 10}, respectively.

[0240] In one example, the first generation polynomial is g(D) = 1 + D 4 +D 6 +D 7 +D 12 +D 13 +D 16 +D 17 +D 18 +D 19 +D 22+ D 23 +D 24 , and a corresponding number of CRC check bits is 24; the N generation polynomials are g(D) = 1 + D 1 +D 4 +D 5 +D 6 , g(D) = 1 + D 1 +D 4 +D 5 +D 6 +D 7 +D 10 +D 11 +D 12 , and g(D) = 1 + D 1 +D 6 +D 7 +D 10 +D11 +D 12 +D 13 +D 16 +D 17 +D 18 The corresponding CRC check bit numbers are {6, 12, 18} respectively.

[0241] Example ten

[0242] The data processing method provided in this example comprises the following steps:

[0243] Step one, obtaining a first bit sequence.

[0244] Step two, performing CRC encoding on the first bit sequence according to a CRC check code generator polynomial to obtain a second bit sequence. The CRC check code generator polynomial is determined from M generator polynomials, where M is an integer greater than 1.

[0245] In a possible implementation, the M generator polynomials include N generator polynomials, and after being sorted in ascending order according to the number of CRC check bits supported, the N generator polynomials include: g0(D), g1(D), g2(D), …, g N-1 (D). The i-th generator polynomial is equal to the remainder polynomial obtained by dividing the (i+1)-th generator polynomial by a target polynomial, where the target polynomial is a monomial with a degree equal to Li+1, Li is used to represent the number of CRC check bits corresponding to the i-th generator polynomial, and i is equal to 0, 1, 2, …, N-2. N is a positive integer less than or equal to M.

[0246] In one example, the N=3 generator polynomials are: g(D)=1+D 2 +D 5 , g(D)=1+D 2 +D 5 +D 9 +D 10 , and g(D)=1+D 2 +D 5 +D 9 +D 10 +D 15 +D 16 The corresponding CRC check bit numbers are {5, 10, 16} respectively.

[0247] In one example, the N=3 generator polynomials are: g(D)=1+D 5 +D 6 , g(D)=1+D 5 +D 6 +D 9 +D 11 , and g(D)=1+D5 +D 6 +D 9 +D 11 +D 15 +D 16 The corresponding number of CRC check bits are {6, 11, 16}, respectively. Alternatively, the N=3 generator polynomials are: g(D) = 1 + D 5 +D 6 , g(D) = 1 + D 5 +D 6 +D 10 +D 11 , and g(D) = 1 + D 5 +D 6 +D 10 +D 11 +D 12 +D 16 Alternatively, the N=3 generator polynomials are: g(D) = 1 + D 5 +D 6 , g(D) = 1 + D 5 +D 6 +D 10 +D 11 , and g(D) = 1 + D 5 +D 6 +D 10 +D 11 +D 13 +D 16 .

[0248] In one example, the N=4 generator polynomials are: g(D) = 1 + D 5 +D 6 , g(D) = 1 + D 5 +D 6 +D 10 +D 11 , g(D) = 1 + D 5 +D 6 +D 10 +D 11 +D 13 +D 16 , and g(D) = 1 + D 5 +D 6 +D 10 +D 11 +D 13 +D 16 +D 19 +D 20 +D 21 +D 24 The corresponding number of CRC check bits are {6, 11, 16, 24}, respectively. Alternatively, the N=4 generator polynomials are: g(D) = 1 + D5 +D 6 , g(D) = 1 + D 5 +D 6 +D 10 +D 11 , g(D) = 1 + D 5 +D 6 +D 10 +D 11 +D 13 +D 16 , and g(D) = 1 + D 5 +D 6 +D 10 +D 11 +D 13 +D 16 +D 18 +D 19+ D 23 +D 24 . Alternatively, the N = 4 generator polynomials are: g(D) = 1 + D 5 +D 6 , g(D) = 1 + D 5 +D 6 +D 10 +D 11 , g(D) = 1 + D 5 +D 6 +D 10 +D 11 +D 12 +D 13 +D 15 +D 16 , and g(D) = 1 + D 5 +D 6 +D 10 +D 11 +D 12 +D 13 +D 15 +D 16 +D 18 +D 24 .

[0249] In one example, the N = 5 generator polynomials are: g(D) = 1 + D 1 +D 4 , g(D) = 1 + D 1 +D 4 +D 6 +D 7 , g(D) = 1 + D 1 +D 4 +D 6 +D 7 +D 9 +D 10, g(D) = 1 + D 1 + D 4 + D 6 + D 7 + D 9 + D 10 + D 12 + D 13 , and g(D) = 1 + D 1 + D 4 + D 6 + D 7 + D 9 + D 10 + D 12 + D 13 + D 15 + D 16 The corresponding CRC check bit numbers are {4, 7, 10, 13, 16}, respectively.

[0250] In one example, N = 6 generator polynomials are: g(D) = 1 + D 3 + D 4 , g(D) = 1 + D 3 + D 4 + D 5 + D 7 + D 8 + D 9 , g(D) = 1 + D 3 + D 4 + D 5 + D 7 + D 8 + D 9 + D 12 + D 13 , g(D) = 1 + D 3 + D 4 + D 5 + D 7 + D 8 + D 9 + D 12 + D 13 + D 14 + D 17 , g(D) = 1 + D 3 + D 4 + D 5 + D 7 + D 8 + D 9 + D 12 + D 13 + D 14 + D 17 + D 19 + D 21 , and g(D) = 1 + D 3 + D 4+D 5 +D 7 +D 8 +D 9 +D 12 +D 13 +D 14 +D 17 +D 19 +D 21+ D 23 +D 24 , and the corresponding CRC check bit numbers are {4, 9, 13, 17, 21, 24} respectively.

[0251] In another possible implementation, the M generation polynomials include N generation polynomials, and after being sorted in ascending order according to the supported CRC check bit numbers, the N generation polynomials include: g0(D), g1(D), g2(D), …, g N-1 (D). The i-th generation polynomial is equal to a quotient polynomial obtained by dividing the (i+1)-th generation polynomial by a target polynomial, where the target polynomial is a monomial with a degree equal to L i+1 -L i , and L i is used to represent the CRC check bit number corresponding to the i-th generation polynomial, L i+1 is used to represent the CRC check bit number corresponding to the (i+1)-th generation polynomial, and i is equal to 0, 1, 2, …, N-2. N is a positive integer less than or equal to M. L i and L i+1 are positive integers, L i is less than L i+1 .

[0252] In one example, the N=2 generation polynomials are: g(D)=1+D 5 +D 6 and g(D)=1+D 4 +D 10 +D 15 +D 16 , and the corresponding CRC check bit numbers are {6, 16} respectively. Alternatively, the N=2 generation polynomials are: g(D)=1+D 5 +D 6 and g(D)=1+D 2 +D 3 +D 4 +D 12 +D 17 +D 18 , and the corresponding CRC check bit numbers are {6, 18} respectively.

[0253] In one example, the N=3 generation polynomials are: g(D)=1+D 5 +D6 , g(D) = 1 + D 2 + D 4 + D 9 + D 10 , and g(D) = 1 + D 5 + D 6 + D 8 + D 10 + D 15 + D 16 The corresponding CRC check bit numbers are {6, 10, 16}, respectively. Alternatively, the N = 4 generator polynomials are: g(D) = 1 + D 5 + D 6 , g(D) = 1 + D 1 + D 2 + D 4 + D 6 + D 11 + D 12 , g(D) = 1 + D 2 + D 6 + D 7 + D 8 + D 10 + D 12 + D 17 + D 18 , and g(D) = 1 + D 1 + D 2 + D 3 + D 4 + D 5 + D 6 + D 8 + D 12 + D 13 + D 14 + D 16 + D 18+ D 23 + D 24 The corresponding CRC check bit numbers are {6, 12, 18, 24}, respectively.

[0254] In one example, the N = 2 generator polynomials are: g(D) = 1 + D 3 + D 5 and g(D) = 1 + D 7 + D 11 + D 14 + D 16 The corresponding CRC check bit numbers are {5, 16}, respectively. Alternatively, the N = 3 generator polynomials are: g(D) = 1 + D 3 + D 5 , g(D) = 1 + D 1 + D 4 + D 6 + D7 +D 10 +D 12 , and g(D) = 1 + D 3 +D 4 +D 5 +D 8 +D 10 +D 11 +D 14 +D 16 The corresponding CRC check bit numbers are {5, 12, 16}, respectively. Alternatively, the N = 4 generator polynomials are: g(D) = 1 + D 3 +D 5 , g(D) = 1 + D 3 +D 4 +D 5 +D 6 +D 9 +D 11 , g(D) = 1 + D 2 +D 5 +D 8 +D 9 +D 10 +D 11 +D 14 +D 16 , and g(D) = 1 + D 7 +D 8 +D 10 +D 13 +D 16 +D 17 +D 18 +D 19 +D 22 +D 24 The corresponding CRC check bit numbers are {5, 11, 16, 24}, respectively. Alternatively, the N = 5 generator polynomials are: g(D) = 1 + D 2 +D 3 , g(D) = 1 + D 2 +D 3 +D 5 +D 6 , g(D) = 1 + D 2 +D 3 +D 5 +D 6 +D 8 +D 9 , g(D) = 1 + D 1 +D 4 +D 6 +D 7 +D 9 +D 10 +D 12 +D 13, and g(D) = 1 + D 1 +D 3 +D 4 +D 7 +D 9 +D 10 +D 12 +D 13 +D 15 +D 16 The corresponding CRC check bit numbers are {3, 6, 9, 13, 16} respectively. Alternatively, the N = 6 generating polynomials are: g(D) = 1 + D 1 +D 3 , g(D) = 1 + D 4 +D 5 +D 6 +D 8 , g(D) = 1 + D 2 +D 4 +D 8 +D 9 +D 10 +D 12 , g(D) = 1 + D 3 +D 4 +D 6 +D 8 +D 12 +D 13 +D 14 +D 16 , g(D) = 1 + D 1 +D 3 +D 6 +D 7 +D 9 +D 11 +D 15 +D 16 +D 17 +D 19 , and g(D) = 1 + D 3 +D 5 +D 6 +D 8 +D 11 +D 12 +D 14 +D 16 +D 20 +D 21 +D 22 +D 24 The corresponding CRC check bit numbers are {3, 8, 12, 16, 19, 24} respectively.

[0255] Example Eleven

[0256] The data processing method provided in this example comprises the following steps:

[0257] Step one, obtaining a second bit sequence.

[0258] Step two, performing CRC check on the second bit sequence according to a CRC check code polynomial to obtain a CRC check result, and outputting the originally transmitted bit sequence.

[0259] According to the first polynomial and U, the polynomial of the CRC check code is determined, the first polynomial is a non-zero polynomial, and U is a positive integer less than or equal to the degree of the first polynomial.

[0260] The first polynomial is the first polynomial in any of the above embodiments or examples, which will not be repeated here.

[0261] The above mainly introduces the scheme provided by the embodiments of the disclosure from the perspective of the method. It can be understood that the data processing apparatus or the electronic device contains the hardware structure and / or software module corresponding to the execution of each function in order to realize the above functions. Those skilled in the art should easily realize that the data processing method steps of each example described in combination with the embodiments disclosed by the disclosure can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in hardware or computer software driven hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the disclosure.

[0262] The embodiments of the disclosure also provide a data processing apparatus. The data processing apparatus can be a communication node (or a computer device), a CPU in the communication node, a communication module for wireless communication in the communication node, or a client for wireless communication in the communication node.

[0263] The embodiments of the disclosure can divide the data processing apparatus into functional modules or functional units according to the above method examples, for example, each functional module or functional unit can be divided according to each function, or two or more functions can be integrated into one processing module. The integrated module can be realized in the form of hardware or software functional module or functional unit. The division of modules or units in the embodiments of the disclosure is illustrative, and is only a logical function division. When actually implemented, there can be another division manner.

[0264] As shown in FIG. 9, it is a structure schematic diagram of a data processing apparatus provided by the embodiments of the disclosure. The data processing apparatus is used to execute the data processing method shown in FIG. 2. The data processing apparatus can include an acquisition module 901 and a processing module 902.

[0265] The obtaining module 901 is configured to obtain a first bit sequence. The processing module 902 is configured to perform CRC encoding on the first bit sequence according to a generation polynomial of a CRC check code to obtain a second bit sequence, and the generation polynomial of the CRC check code can be obtained based on a first generation polynomial.

[0266] In some embodiments, the processing module 902 is configured to determine the generation polynomial of the CRC check code from M generation polynomials, where M is an integer greater than 1. The M generation polynomials include at least N generation polynomials, and any two of the N generation polynomials are: a first generation polynomial and a second generation polynomial, L1 is greater than L2, L1 is used to represent a number of CRC check bits corresponding to the first generation polynomial, and L2 is used to represent a number of CRC check bits corresponding to the second generation polynomial. A third generation polynomial obtained based on the first generation polynomial is equal to the second generation polynomial.

[0267] In other embodiments, the third generation polynomial is a remainder polynomial obtained by dividing the first generation polynomial by a target polynomial, and the target polynomial is a monomial with a degree equal to L2+1.

[0268] In other embodiments, the third generation polynomial is a quotient polynomial obtained by dividing the first generation polynomial by a target polynomial, and the target polynomial is a monomial with a degree equal to L1-L2.

[0269] In other embodiments, the third generation polynomial is a first remainder polynomial obtained by dividing a first quotient polynomial by a first target polynomial, and the first quotient polynomial is a quotient polynomial obtained by dividing the first generation polynomial by a second target polynomial. The first target polynomial is a monomial with a degree equal to L2+1, and the second target polynomial is a monomial with a degree equal to c, where c is a positive integer less than L1-L2.

[0270] In other embodiments, N is equal to M.

[0271] In other embodiments, N is equal to 2, 3, 4, 5, 6, 7, or 8.

[0272] In other embodiments, a maximum number of CRC check bits corresponding to the N generation polynomials is equal to one of the following: 14, 15, 16, 17, 18, 19, 20, 22, 24, 28, and 32.

[0273] In other embodiments, the N generation polynomials correspond to different numbers of CRC check bits.

[0274] In some embodiments, the number of CRC check bits corresponding to the N polynomials comprises at least two of: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 28, 32.

[0275] In some embodiments, the number of CRC check bits corresponding to the N polynomials comprises one of the following combinations: {5, 16}, {6, 16}, {8, 16}, {5, 10, 16}, {5, 11, 16}, {5, 12, 16}, {6, 10, 16}, {6, 11, 16}, {6, 12, 16}, {5, 10, 16, 24}, {5, 11, 16, 24}, {6, 10, 16, 24}, {6, 11, 16, 24}, {6, 12, 16, 24}, {6, 12, 18, 24}.

[0276] In some embodiments, the processing module 902 is configured to determine a generator polynomial of the CRC check code according to a first generator polynomial and U, the first generator polynomial being a non-zero polynomial, and U being a positive integer less than or equal to a degree of the first generator polynomial.

[0277] In some embodiments, the generator polynomial of the CRC check code is a remainder polynomial obtained by dividing the first generator polynomial by a first polynomial, the first polynomial being a monomial with a degree equal to U+1.

[0278] In some embodiments, the generator polynomial of the CRC check code is a quotient polynomial obtained by dividing the first generator polynomial by a first polynomial, the first polynomial being a monomial with a degree equal to L1-U, where L1 is equal to a degree of the first generator polynomial.

[0279] In some embodiments, the processing module 902 is configured to divide the first generator polynomial by a first polynomial to obtain a second quotient polynomial, the first polynomial being a monomial with a degree equal to i, i being a positive integer less than L1-U, and divide the second quotient polynomial by a second polynomial to obtain a remainder polynomial as the generator polynomial of the CRC check code, the second polynomial being a monomial with a degree equal to U+1.

[0280] In some embodiments, the processing module 902 is configured to divide the first generator polynomial by a first polynomial to obtain a second remainder polynomial, the first polynomial being a monomial with a degree equal to i, i being a positive integer greater than U+1 and less than L1+2, where L1 is equal to a degree of the first generator polynomial, and divide the second remainder polynomial by a second polynomial to obtain a quotient polynomial as the generator polynomial of the CRC check code, the second polynomial being a monomial with a degree equal to L1-U, where L1 is equal to a degree of the first generator polynomial.

[0281] In some embodiments, U is one of N integers, and N is equal to 2, 3, 4, 5, 6, 7, or 8.

[0282] In some embodiments, U is one of N integers, and N integers include at least two of the following integers: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 28, 32.

[0283] In some embodiments, U is one of N integers, and N integers are any combination of the following groups: {5, 16}, {6, 16}, {8, 16}, {5, 10, 16}, {5, 11, 16}, {5, 12, 16}, {6, 10, 16}, {6, 11, 16}, {6, 12, 16}, {5, 10, 16, 24}, {5, 11, 16, 24}, {6, 10, 16, 24}, {6, 11, 16, 24}, {6, 12, 16, 24}, {6, 12, 18, 24}.

[0284] In some embodiments, the first generator polynomial has a degree equal to one of the following: 14, 15, 16, 17, 18, 19, 20, 22, 24, 28, 32.

[0285] As shown in FIG. 10, a structural schematic diagram of a data processing apparatus provided by an embodiment of the present disclosure is shown. The data processing apparatus is used to execute the data processing method shown in FIG. 3. The data processing apparatus can include an acquisition module 1001 and a processing module 1002.

[0286] The acquisition module 1001 is configured to acquire a second bit sequence. The processing module 1002 is configured to perform CRC check on the second bit sequence according to a generator polynomial of a CRC check code, to obtain a CRC check result, and the generator polynomial of the CRC check code can be obtained based on a first generator polynomial.

[0287] FIG. 11 is a hardware structural schematic diagram of a data processing apparatus according to an exemplary embodiment. The data processing apparatus can include a processor 1102, which is configured to execute application program codes, thereby implementing the data processing method in the present disclosure.

[0288] The processor 1102 can be a central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling program execution of the present disclosure.

[0289] As shown in FIG. 11, the data processing apparatus can further include a memory 1103. The memory 1103 is configured to store application program codes for implementing the solutions of the present disclosure, and the execution is controlled by the processor 1102.

[0290] The memory 1103 can be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disk storage, a magneto-optical disk, a magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program codes in the form of instructions or data structures and that can be accessed by a computer, but is not limited to this. The memory 1103 can exist independently and be connected to the processor 1102 through the bus 1104. The memory 1103 can also be integrated with the processor 1102.

[0291] As shown in FIG. 11, the data processing apparatus can further include a communication interface 1101, wherein the communication interface 1101, the processor 1102 and the memory 1103 can be coupled with each other, for example, through the bus 1104. The communication interface 1101 is configured to interact with other devices, for example, to support information interaction between the data processing apparatus and other devices.

[0292] It should be noted that the device structure shown in FIG. 11 does not constitute a limitation on the data processing apparatus, and the data processing apparatus can include more or fewer components than those shown in FIG. 11, or combine certain components, or have different component arrangements.

[0293] In actual implementation, the functions implemented by the processing module 902 can be implemented by the processor 1102 in FIG. 11 calling the program codes in the memory 1103.

[0294] The present disclosure also provides a computer-readable storage medium (for example, including a non-transitory computer-readable storage medium) having instructions stored thereon, which when executed by a processor of a computer device, enable the computer to perform the data processing method provided by the above-described embodiments. For example, the computer-readable storage medium can be a memory 1103 including instructions executable by the processor 1102 of the computer device to complete the above method. In some embodiments, the computer-readable storage medium can be a non-transitory computer-readable storage medium, for example, the non-transitory computer-readable storage medium can be a ROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device, etc.

[0295] FIG. 12 schematically illustrates a conceptual partial view of a computer program product including a computer program for executing a computer process on a computing device, according to an embodiment of the present disclosure.

[0296] In one embodiment, the computer program product is provided using a signal bearing medium 1200. The signal bearing medium 1200 can include one or more program instructions which, when executed by one or more processors, can provide the functionality or some portion thereof described above with respect to FIG. 2 or FIG. 3. Thus, for example, one or more features of S201-S202, with reference to the embodiment illustrated in FIG. 2, can be undertaken by one or more instructions associated with the signal bearing medium 1200. Further, the program instructions in FIG. 12 also describe example instructions.

[0297] In some examples, the signal bearing medium 1200 can comprise a computer- readable medium 1201, such as, but not limited to, a hard disk drive, a compact disc (CD), a digital video disc (DVD), a digital tape, memory, read-only memory (ROM), or random access memory (RAM), etc.

[0298] In some embodiments, the signal bearing medium 1200 can comprise a computer- recordable medium 1202, such as, but not limited to, a memory, a read / write (R / W) CD, a R / W DVD, etc.

[0299] In some embodiments, the signal bearing medium 1200 can comprise a communication medium 1203, such as, but not limited to, a digital and / or an analog communication medium (e.g., a fiber optic cable, a waveguide, a wired communication link, a wireless communication link, etc.).

[0300] The signal bearing medium 1200 can be conveyed by a wireless form of the communication medium 1203. The one or more program instructions can be, for example, computer-executable instructions or logic-implemented instructions.

[0301] In some examples, the data processing apparatus described with respect to FIG. 9 can be configured to provide various operations, functions, or actions in response to program instructions of one or more of computer-readable media 1201, computer-recordable media 1202, and / or communication media 1203.

[0302] From the above description of the embodiments, it is apparent that for the convenience and conciseness of description, only the division of the above functional modules is taken as an example for description, and in actual application, the above functions can be completed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.

[0303] In several embodiments provided in the present disclosure, it should be understood that the disclosed apparatus and method can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, for example, the division of the modules or units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another device, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units or components shown or discussed can be indirect coupling or communication connection through some interfaces, devices or units, and can be electrical, mechanical or other forms.

[0304] The units described as separate components can or can not be physically separate, and the components shown as units can be one physical unit or multiple physical units, that is, can be located in one place, or can be distributed to multiple different places. Part or all of the units can be selected according to actual needs to achieve the purpose of the present embodiment scheme.

[0305] In addition, each functional unit in each embodiment of the present disclosure can be integrated in one processing unit, or each unit can be physically present separately, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0306] The integrated unit, if implemented in the form of a software function unit and sold or used as an independent product, can be stored in a readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present disclosure, essentially or in other words, the part that contributes to the prior art or the whole or part of the technical solutions can be embodied in the form of a software product. The software product is stored in a storage medium, including a number of instructions to make a device (which can be a single-chip microcomputer, a chip, etc.) or a processor execute all or part of the steps of the various embodiments of the present disclosure method. The aforementioned storage medium includes U disk, mobile hard disk, ROM, RAM, magnetic disk or optical disk, and various media that can store program codes.

[0307] The above is only a specific embodiment of the present disclosure, but the protection scope of the present disclosure is not limited thereto. Any changes or replacements within the technical scope disclosed by the present disclosure should be covered within the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure should be subject to the protection scope of the claims.

Claims

1. A data processing method comprising: obtaining a first bit sequence; CRC encoding the first bit sequence according to a generator polynomial of a cyclic redundancy check (CRC) check code, to obtain a second bit sequence, the generator polynomial of the CRC check code being obtainable based on a first generator polynomial.

2. The method of claim 1, further comprising: determining the generator polynomial of the CRC check code from M generator polynomials, M being an integer greater than 1; wherein the M generator polynomials comprise at least N generator polynomials, any two of the N generator polynomials being the first generator polynomial and a second generator polynomial, LI being greater than L2, LI representing a number of CRC check bits corresponding to the first generator polynomial, and L2 representing a number of CRC check bits corresponding to the second generator polynomial; wherein a third generator polynomial obtainable based on the first generator polynomial is equal to the second generator polynomial.

3. The method of claim 2, wherein: the third generator polynomial is a remainder polynomial obtained by dividing the first generator polynomial by a target polynomial, the target polynomial being a monomial with a degree equal to L2+1.

4. The method of claim 2, wherein: the third generator polynomial is a quotient polynomial obtained by dividing the first generator polynomial by a target polynomial, the target polynomial being a monomial with a degree equal to LI-L2.

5. The method of claim 2, wherein: the third generator polynomial is a first remainder polynomial obtained by dividing a first quotient polynomial by a first target polynomial, the first quotient polynomial being a quotient polynomial obtained by dividing the first generator polynomial by a second target polynomial; wherein the first target polynomial is a monomial with a degree equal to L2+1, and the second target polynomial is a monomial with a degree equal to c, c being a positive integer less than LI-L2.

6. The method of claim 2, wherein, N is equal to M.

7. The method of claim 2, wherein, N is equal to 2, 3, 4, 5, 6, 7, or 8.

8. The method of claim 2, wherein, A maximum number of CRC check bits corresponding to the N generator polynomials is equal to one of: 14, 15, 16, 17, 18, 19, 20, 22, 24, 28, 32.

9. The method of claim 2, wherein, The N generator polynomials correspond to different numbers of CRC check bits.

10. The method of claim 2, wherein, The N generator polynomials correspond to at least two of: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 28, 32.

11. The method of claim 2, wherein, The N generator polynomials correspond to a combination of: {5, 16}, {6, 16}, {8, 16}, {5, 10, 16}, {5, 11, 16}, {5, 12, 16}, {6, 10, 16}, {6, 11, 16}, {6, 12, 16}, {5, 10, 16, 24}, {5, 11, 16, 24}, {6, 10, 16, 24}, {6, 11, 16, 24}, {6, 12, 16, 24}, {6, 12, 18, 24}.

12. The method of claim 1, further comprising: determining a generator polynomial of the CRC check code according to the first generator polynomial and U, the first generator polynomial being a non-zero polynomial, and the U being a positive integer less than or equal to a degree of the first generator polynomial.

13. The method of claim 12, wherein the generator polynomial of the CRC check code is a remainder polynomial obtained by dividing the first generator polynomial by a first polynomial, the first polynomial being a monomial with a degree equal to U+1.

14. The method of claim 12, wherein the generator polynomial of the CRC check code is a quotient polynomial obtained by dividing the first generator polynomial by a first polynomial, the first polynomial being a monomial with a degree equal to L1-U, where L1 is equal to a degree of the first generator polynomial.

15. The method of claim 12, wherein, the determining the generator polynomial of the CRC check code according to the first generator polynomial and U comprises: dividing the first generator polynomial by a first polynomial to obtain a second quotient polynomial, the first polynomial being a monomial with a degree equal to i, i being a positive integer less than L1-U, where L1 is equal to a degree of the first generator polynomial; obtaining a remainder polynomial by dividing the second quotient polynomial by a second polynomial, the second polynomial being a monomial with a degree equal to U+1, as the generator polynomial of the CRC check code.

16. The method of claim 12, wherein, the determining the generator polynomial of the CRC check code according to the first generator polynomial and U comprises: dividing the first generator polynomial by a first polynomial to obtain a second remainder polynomial, the first polynomial being a monomial with a degree equal to i, i being a positive integer greater than U+1 and less than L1+2, where L1 is equal to a degree of the first generator polynomial; obtaining a quotient polynomial by dividing the second remainder polynomial by a second polynomial, the second polynomial being a monomial with a degree equal to L1-U, as the generator polynomial of the CRC check code.

17. The method of claim 12, wherein, U is one of N integers, the N being equal to 2, 3, 4, 5, 6, 7, or 8.

18. The method of claim 12, wherein, U is one of N integers, the N integers including at least 2 of the following integers: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 28, 32.

19. The method of claim 12, wherein, U is one of N integers, the N integers being one of the following combinations: {5, 16}, {6, 16}, {8, 16}, {5, 10, 16}, {5, 11, 16}, {5, 12, 16}, {6, 10, 16}, {6, 11, 16}, {6, 12, 16}, {5, 10, 16, 24}, {5, 11, 16, 24}, {6, 10, 16, 24}, {6, 11, 16, 24}, {6, 12, 16, 24}, {6, 12, 18, 24}.

20. The method of claim 12, wherein, the degree of the first generator polynomial is equal to one of the following: 14, 15, 16, 17, 18, 19, 20, 22, 24, 28, 32.

21. A data processing method comprising: obtaining a second bit sequence; performing a CRC check on the second bit sequence according to a CRC check code generator polynomial to obtain a CRC check result, the CRC check code generator polynomial being obtainable based on a first generator polynomial.

22. The method of claim 21, further comprising: determining a CRC check code generator polynomial from M generator polynomials, M being an integer greater than 1; wherein the M generator polynomials comprise at least N generator polynomials, any two of the N generator polynomials being the first generator polynomial and a second generator polynomial, L1 being greater than L2, L1 representing a number of CRC check bits corresponding to the first generator polynomial, and L2 representing a number of CRC check bits corresponding to the second generator polynomial; wherein a third generator polynomial obtainable based on the first generator polynomial is equal to the second generator polynomial.

23. The method of claim 22, wherein: the third generator polynomial is a remainder polynomial obtained by dividing the first generator polynomial by a target polynomial, the target polynomial being a monomial of degree equal to L2+1.

24. The method of claim 22, wherein: the third generator polynomial is a quotient polynomial obtained by dividing the first generator polynomial by a target polynomial, the target polynomial being a monomial of degree equal to L1-L2.

25. The method of claim 22, wherein: the third generator polynomial is a first remainder polynomial obtained by dividing a first quotient polynomial by a first target polynomial, the first quotient polynomial being a quotient polynomial obtained by dividing the first generator polynomial by a second target polynomial; wherein the first target polynomial is a monomial of degree equal to L2+1, and the second target polynomial is a monomial of degree equal to c, c being a positive integer less than L1-L2.

26. The method of claim 22, wherein, N is equal to M.

27. The method of claim 22, wherein, N is equal to 2, 3, 4, 5, 6, 7, or 8.

28. The method of claim 22, wherein, A maximum number of CRC check bits corresponding to the N generator polynomials is equal to one of: 14, 15, 16, 17, 18, 19, 20, 22, 24, 28, 32.

29. The method of claim 22, wherein, The N generator polynomials correspond to different numbers of CRC check bits.

30. The method of claim 22, wherein, The N generator polynomials correspond to at least two of: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 28, 32.

31. The method of claim 22, wherein, The N generator polynomials correspond to a combination of numbers of CRC check bits selected from the group consisting of: {5, 16}, {6, 16}, {8, 16}, {5, 10, 16}, {5, 11, 16}, {5, 12, 16}, {6, 10, 16}, {6, 11, 16}, {6, 12, 16}, {5, 10, 16, 24}, {5, 11, 16, 24}, {6, 10, 16, 24}, {6, 11, 16, 24}, {6, 12, 16, 24}, {6, 12, 18, 24}.

32. The method of claim 21, further comprising: determining a generator polynomial of the CRC check code according to the first generator polynomial and U, the first generator polynomial being a non-zero polynomial, and the U being a positive integer less than or equal to a degree of the first generator polynomial.

33. The method of claim 32, wherein the generator polynomial of the CRC check code is a remainder polynomial obtained by dividing the first generator polynomial by a first polynomial, the first polynomial being a monomial with a degree equal to U+1.

34. The method of claim 32, wherein the generator polynomial of the CRC check code is a quotient polynomial obtained by dividing the first generator polynomial by a first polynomial, the first polynomial being a monomial with a degree equal to L1-U, where L1 is equal to a degree of the first generator polynomial.

35. The method of claim 32, wherein, the determining the generator polynomial of the CRC check code according to the first generator polynomial and U comprises: dividing the first generator polynomial by a first polynomial to obtain a second quotient polynomial, the first polynomial being a monomial with a degree equal to i, i being a positive integer less than L1-U, where L1 is equal to a degree of the first generator polynomial; obtaining a remainder polynomial by dividing the second quotient polynomial by a second polynomial, the second polynomial being a monomial with a degree equal to U+1, as the generator polynomial of the CRC check code.

36. The method of claim 32, wherein, the determining the generator polynomial of the CRC check code according to the first generator polynomial and U comprises: dividing the first generator polynomial by a first polynomial to obtain a second remainder polynomial, the first polynomial being a monomial with a degree equal to i, i being a positive integer greater than U+1 and less than L1+2, where L1 is equal to a degree of the first generator polynomial; obtaining a quotient polynomial by dividing the second remainder polynomial by a second polynomial, the second polynomial being a monomial with a degree equal to L1-U, as the generator polynomial of the CRC check code.

37. The method of claim 32, wherein, U is one of N integers, the N being equal to 2, 3, 4, 5, 6, 7, or 8.

38. The method of claim 32, wherein, U is one of N integers, the N integers including at least 2 of the following integers: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 24, 28, 32.

39. The method of claim 32, wherein, U is one of N integers, the N integers being one of the following combinations: {5, 16}, {6, 16}, {8, 16}, {5, 10, 16}, {5, 11, 16}, {5, 12, 16}, {6, 10, 16}, {6, 11, 16}, {6, 12, 16}, {5, 10, 16, 24}, {5, 11, 16, 24}, {6, 10, 16, 24}, {6, 11, 16, 24}, {6, 12, 16, 24}, {6, 12, 18, 24}.

40. The method of claim 32, wherein, a degree of the first generator polynomial is equal to one of the following: 14, 15, 16, 17, 18, 19, 20, 22, 24, 28, 32.

41. A node device comprising: a memory and a processor; The memory and the processor are coupled; The memory is configured to store instructions executable by the processor; The processor executes the instructions to perform the method according to any one of claims 1-20.

42. A node device comprising: A memory and a processor; The memory and the processor are coupled; The memory is configured to store instructions executable by the processor; The processor executes the instructions to perform the method according to any one of claims 21-40.

43. A computer readable storage medium, wherein, The computer readable storage medium stores computer instructions, when the computer instructions run on a computer, make the computer execute the method according to any one of claims 1-40.

44. A computer program product, comprising: A computer program or instructions, when the computer program or instructions run on a computer, make the computer execute the method according to any one of claims 1-40.

Images