CN110750383A - Method for carrying information by using CRC check code - Google Patents
Method for carrying information by using CRC check code Download PDFInfo
- Publication number
- CN110750383A CN110750383A CN201910932768.5A CN201910932768A CN110750383A CN 110750383 A CN110750383 A CN 110750383A CN 201910932768 A CN201910932768 A CN 201910932768A CN 110750383 A CN110750383 A CN 110750383A
- Authority
- CN
- China
- Prior art keywords
- crc
- message
- mask
- target
- bits
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 20
- 238000010586 diagram Methods 0.000 description 4
- 238000013468 resource allocation Methods 0.000 description 3
- 125000004122 cyclic group Chemical group 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1004—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's to protect a block of data words, e.g. CRC or checksum
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Detection And Correction Of Errors (AREA)
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The invention discloses a method for carrying information by using a CRC check code, which comprises the following steps: selecting a target CRC mask from a plurality of candidate CRC masks (masks) according to the type of a message in a data block to be transmitted, selecting a CRC generating polynomial according to the CRC mask bit number to perform CRC calculation on a payload in the data block to obtain a first CRC value, performing logical XOR operation on the first CRC value and the target CRC mask to obtain a CRC check code, and attaching the CRC check code to the payload in the data block. Each CRC mask in the multiple candidate CRC masks corresponds to a unique message type. By establishing the corresponding relation between various message types and the CRC mask, the receiving end can determine the message types according to the corresponding relation during CRC check, and the condition of decoding misjudgment is avoided.
Description
Technical Field
The present invention relates to the field of communications, and more particularly, to a method of carrying information using a CRC check code.
Background
In a Very High Frequency (VHF) Data exchange system (VDES, VHF Data exchange system), each message (message) content always includes an 8-bit "type" field to indicate the corresponding message type. For example, the BB message corresponds to a type value of 20 decimal. If the receiving end successfully receives the data, the type of the message can be distinguished through the type value in the message content. However, for some short message data (short data), 8 bits are used in the message content to represent the message type, which causes too much overhead. Moreover, to meet different application scenarios, more and more message types are potentially required to be supported by the VDES system, and more bits are required to represent the type field, thereby resulting in greater overhead.
Disclosure of Invention
The technical problem is as follows: the invention aims to solve the problem that the existing VDES contains an 8-bit type field in message content to indicate the message type, so that the system overhead is overlarge. It is proposed to use a unique CRC mask corresponding to each message type to potentially indicate the corresponding message type when the CRC check code is generated, thereby omitting a type field indicating the message type within the message content.
The technical scheme is as follows: in order to achieve the purpose, the invention adopts the following technical scheme:
a method for carrying information by using CRC check codes comprises the following steps:
1) selecting a target CRCmask from a plurality of candidate CRC masks (masks) according to the type of the message in the data block to be transmitted;
2) selecting a CRC generator polynomial with the same bit number according to the CRC mask bit number, performing CRC calculation on the effective load in the data block, and taking the calculated CRC result as a first CRC value;
3) and carrying out logical XOR operation on the first CRC value and the target CRC mask to obtain a CRC check code, and attaching the CRC check code to a payload in a data block.
Further, each CRC mask in the plurality of candidate CRC masks in step 1) corresponds to a unique message type, so that each message type corresponds to a unique target CRC mask.
Further, in step 2), after the payload of the original data, bits are complemented by 0 according to the target CRC mask bit number, the binary number of the payload after bit complementation by 0 is used as a dividend, a binary code corresponding to the CRC generator polynomial with the same bit number as the CRC mask is used as a divisor, and an operation is performed according to a modulo-2 division manner, so that an obtained remainder is a first CRC value.
Further, the message types include various message types transmitted in different physical channels of the system, and also include various message types transmitted in a certain physical channel but having different message formats.
Further, in the step 3), the number of bits of the first CRC value is the same as the number of bits of the target CRC mask of the message type corresponding to the payload, and if the remainder of the result calculated in the step 2) does not reach the target number of bits, the first CRC value corresponding to the target number of bits is changed by complementing 0 at the upper bits.
Has the advantages that: compared with the prior art, the invention has the advantages that:
the corresponding relation is established between the CRC mask used in the generation of the CRC check code and different message types, so that the message type can be determined by the receiving end through the CRC check, the type field indicating the message type in the message content is omitted, the saved resources are used for transmitting effective data, and the utilization efficiency of system resources is improved.
Drawings
FIG. 1 is a schematic diagram of the calculation process of the present invention using modulo-2 division;
FIG. 2 is a diagram illustrating the content of a message including a type field in a conventional VDES system;
FIG. 3 is a diagram illustrating the steps of CRC code generation according to the present invention;
fig. 4 is a diagram illustrating the content of a message after the CRC check code of the present invention is used.
Detailed Description
The technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.
A Cyclic Redundancy Check (CRC) method is a commonly used data checking method, and is mainly used for checking errors that may occur after input data is transmitted through a network or stored and saved. In some wireless communication systems, such as VDES, a transmitting end transmits data to a receiving end in blocks (blocks). The sending end calculates a CRC result according to the effective load and the CRC generator polynomial in the data block and sends the CRC result to the receiving end along with the data block. The receiving end calculates a CRC result according to the received data and the same CRC generator polynomial, compares the CRC result with the received CRC, and if the CRC result is equal to the CRC result, the receiving end considers that the data reception is successful; if the two are not equal, the receiving end considers that the data receiving is failed.
To facilitate understanding by those skilled in the art, a description will be given, by way of a specific example, of how a CRC result is calculated from a payload in a data block and a CRC generator polynomial. First, however, a description will be given of a part of the words.
1) Bit width (width): the length of the CRC check code (CRC size) may be understood as the number of binary values included in the CRC check code. A CRC check code with a bit width N is also often denoted CRC-N, e.g. CRC-4 means a CRC check code length of 4, or a CRC-4 consists of 4 binary values. Also, because of the binary number, CRC-4 is also often described as having a CRC length of 4 bits (bits).
2) CRC generator Polynomial (Polynomial): there is at least one CRC generator polynomial for each CRC length. In the generator polynomial, the most significant bit and the least significant bit always take the value 1, that is, the generator polynomial of CRC-N must include xNAnd x0These two terms. The generator polynomial, such as CRC-4, may be x4+ x +1, or x4+x3+x2+x+1。
3) And binary code: also called the abbreviation. Each CRC generator polynomial may be equivalently represented by a binary code, and the binary code for CRC-N has N +1 bits. However, since the most significant bit and the least significant bit are always 1, the most significant bit 1 is also omitted in some publications, or the least significant bit 1 is omitted, and expressed as an N-bit binary code. Generator polynomial x such as CRC-44The equivalent 4+1 + x +1 is "10011" in the 5-bit binary code, "0011" in the 4-bit binary code with the highest omitted bits, and "1001" in the 4-bit binary code with the lowest omitted bits.
4) XOR is a mathematical operator, namely exclusive OR in English, abbreviated as xor, which is applied to logical operation, and has a mathematical symbol of '⊕' and a computer symbol of 'xor', wherein if the two values are different, the XOR result is 1, and if the two values are the same, the XOR result is 0.
5) And a division by a module 2: similar to long division, but without borrowing. Referring to fig. 1, the dividend is 1011010000, the divisor is 10011, and the division modulo-2 has the following steps: (1) the first 5 bits (the same as the number of the divisor) from the left of the dividend 10110 are taken, because the first bit from the left of the 10110 is 1, the first quotient is 1, the result 10011 is obtained by multiplying the result 10011 with the divisor 10110 from the left of the dividend, the result 10011 and the first 5 bits from the left of the dividend are subjected to logic exclusive or operation to obtain a remainder 00101, the first 0 at the left of the remainder is removed, and the 6 th 1 at the left of the dividend is complemented by the lowest right bit to obtain 01011; (2) because the first left bit of the 5-bit value 01011 after the step (1) is 0, the second quotient is 0, the result is multiplied by the divisor 10011 to obtain a result 00000, the result 00000 and the 5-bit value 01011 after the step (1) are subjected to logical exclusive-or operation to obtain a remainder 01011, the first left bit 0 of the remainder is removed, and the lowest right bit is complemented with the 7 th left bit 0 of the dividend to obtain 10110; (3) because the first left bit of the 5-bit value 10110 obtained in the step (2) is 1, the third quotient is 1, the result is 10011 obtained by multiplying the result 10011 with the divisor 10011, the result 10011 and the 5-bit value 10110 obtained in the step (2) are subjected to logical exclusive or operation to obtain a remainder 00101, the first left bit 0 of the remainder is removed, and the lowest right bit is complemented with the 8 th left bit 0 of the dividend to obtain 01010; by analogy … … ends with a quotient 101010 and a remainder 1110.
How the CRC result, i.e. in this embodiment the first CRC value, is calculated from the payload in the data block and the CRC generator polynomial is now explained by the following example. Given the payload in a data block: 101101 (binary), requires the use of CRC-4, whose generator polynomial is x4+ x +1 (the binary code is 10011), and the corresponding 4-bit CRC result can be calculated according to the following steps:
(1) since the goal is to generate a 4-bit CRC result, first add 4 more 0's after the original data payload 101101, resulting in 1011010000;
(2) taking binary code 10011 as a divisor and 1011010000 as a dividend, and performing a modulo-2 division operation as shown in fig. 1 to obtain a remainder 1110;
(3) the remainder 1110 is the CRC result calculated from the payload 101101 and the CRC binary code 10011 in the data block. If the remainder is less than 4 bits, it becomes 4 bits by complementing 0 at the upper bit.
The calculation of the above CRC result is a polynomial division method, and there are many improved methods in practical engineering, such as a CRC-driven table method, a direct-driven table method, etc. which directly look up a table through an already established table.
As described earlier, in the current VDES, the CRC result calculated from the data block to be transmitted and the CRC generator polynomial is directly sent out as a CRC check code attached (attach) to the payload and then sent out together, for example, after the CRC result "1110" is obtained according to the above example, the CRC result is directly added and sent out as "1011011110" after the original payload "101101". The receiving end takes the received data (the length comprises the effective load and the CRC check code) as dividend, takes the same CRC binary code as divisor, calculates the CRC result of the receiving end according to the operation rule of the modulo-2 division, and compares the CRC result with the CRC check code of the transmitting end to determine whether the data is received correctly.
When the current VDES system transmits data of different message types, an 8-bit "type" field is included in the message (message) content to indicate the corresponding message type. Referring to fig. 2, it shows the content contained in the message, for example, the BB message has a corresponding type value of 20, and the payload of the BB message is protected by 32-bit CRC. If the receiving end successfully receives the correct data, that is, the CRC check is successful, the BB message can be distinguished by reading the type value in the message content. However, the use of 8 bits in the message content to indicate the message type results in excessive system resource overhead. If the 8-bit type field is removed to save the overhead, it is possible that the transmitting end transmits another message other than the BB message, the CRC check succeeds when the receiving end attempts to decode the BB message, and it is determined that the message of the type is the BB message by mistake. That is, after the field indicating the message type is removed, a false determination may occur even if the CRC check is successful.
The embodiment of the present application provides a method for carrying information by using cyclic redundancy check CRC check code, please refer to fig. 3, which includes the following steps: 1) selecting a target CRC mask from a plurality of candidate CRC masks (masks) according to the type of the message in the data block to be transmitted; 2) selecting a CRC generator polynomial according to the CRC mask bit number, performing CRC calculation on the effective load in the data block, and taking the calculated CRC result as a first CRC value; 3) the first CRC value is logically xored with the target CRC mask to obtain a CRC check code and attached to the payload in the data block (refer to fig. 4). Each CRC mask in the multiple candidate CRC masks corresponds to a unique message type, so that each message type corresponds to a unique target CRCmask. The step of calculating the first CRC result in step 2) may be performed by referring to the above-mentioned example of the CRC result calculated according to the payload and the CRC binary code in the data block, or may be calculated by other methods. The message types include various message types transmitted in different physical channels of the system, and various message types transmitted in a certain physical channel but having different message formats. The CRC check codes used may be of different lengths for different message types, and therefore CRC masks of different lengths are included in the plurality of candidate CRC masks.
The embodiments of the present application are further illustrated by the previous example of calculating the CRC result. Assume that the target CRC mask of the message type corresponding to the payload "101101" is "1111", that is, the target CRC mask 1111 is selected from the multiple candidate CRC masks according to the message type in the data block to be transmitted in step 1). Since the target CRC mask is 4 bits, the CRC-4 generator polynomial (e.g., binary code 10011 in the example) is selected in step 2). The payload 101101 in the transmitted data block is CRC-settled according to step 2), the remainder (i.e. CRC result) obtained according to fig. 1 is 1110, and the CRC result 1110 is taken as the first CRC value. And finally, according to the step 3), performing logical exclusive-or operation on the first CRC value 1110 and the target CRC mask 1111 determined in the step 1) to obtain a CRC check code 0001, and adding the CRC check code "0001" to the payload "101101" in the data block to obtain "1011010001".
Table 1 correspondence table between CRC mask and different message types
In yet another embodiment, a plurality of candidate CRC masks in a VDES system are shown in Table 1. In table 1, the resource allocation message 1 and the resource allocation message 2 are both transmitted on the downlink channel responsible for resource allocation, the CRC check codes with the same length are used, and each message corresponds to a unique CRC mask. The uplink resource application message and the short message are transmitted on an uplink random access channel, CRC check codes with different lengths are used, and each message corresponds to a unique CRC mask. When the transmitting end needs to transmit the 'BB message', the transmitting end selects a target CRCmask to be 0xFFFFFFFF according to the condition that the CRC mask corresponding to the BB message in the table 1 is 0 xFFFFFFFFFF. Since the bit number of the CRC mask of the BB message is 32 bits, a 32-bit CRC generator polynomial is selected, which may be the following polynomial:
gCRC32(x)＝x32+x26+x23+x22+x16+x12+x11+x10+x8+x7+x5+x4+x2+x+1。
according to the 32-bit CRC generator polynomial, CRC calculation is carried out on the payload of the BB message to obtain a 32-bit CRC result, namely a first CRC value, the first CRC value and a 32-bit target CRC mask (namely 0xFFFFFFFF) are subjected to logic exclusive OR operation (each bit of the first CRC value is different from each bit value of the CRC mask, the exclusive OR result is 1, the values are the same, and the exclusive OR result is 0) to obtain a 32-bit sequence which is used as a final CRC code. When the transmitting end transmits the BB message in the transport block, the generated CRC check code is attached/appended to the payload of the BB message. After receiving the data, the receiving end can complete the CRC check only by using the CRC mask (namely 0xFFFFFFFF) corresponding to the BB message, so that when the CRC check is successful, the receiving is potentially represented as the BB message, that is, the information of 'BB message is transmitted is carried by the CRC mask value of 0 xFFFFFFFFFF', and the condition that other messages are mistakenly judged as the BB message is avoided.
The CRC check code lengths and CRC masks given above for different message types are only preferred embodiments of the present invention. It should be noted that, for those skilled in the art, without departing from the principle of the present invention, several improvements and modifications can be made, and these improvements and modifications should also be construed as the protection scope of the present invention.
Claims (5)
1. A method for carrying information by using CRC check codes is characterized by comprising the following steps:
1) selecting a target CRCmask from a plurality of candidate CRC masks (masks) according to the type of the message in the data block to be transmitted;
2) selecting a CRC generator polynomial with the same bit number according to the CRC mask bit number, performing CRC calculation on the effective load in the data block, and taking the calculated CRC result as a first CRC value;
3) and carrying out logical XOR operation on the first CRC value and the target CRC mask to obtain a CRC check code, and attaching the CRC check code to a payload in a data block.
2. The method as claimed in claim 1, wherein each CRC mask in the plurality of candidate CRC masks in step 1) corresponds to a unique message type, and each message type corresponds to a unique target CRC mask.
3. The method of claim 1, wherein in step 2), the bits of the payload of the original data are complemented by 0 according to the bit number of the target CRC mask, the binary number of the payload after the bit complementation by 0 is used as dividend, the binary code corresponding to the CRC generator polynomial with the same bit number as the CRC mask is used as divisor, and the operation is performed according to the modulo-2 division method, so that the obtained remainder is the first CRC value.
4. The method for carrying information by using CRC code according to claim 1 or 2, wherein the message types include various message types transmitted in different physical channels of the system, and also include various message types transmitted in a certain physical channel but having different message formats.
5. The method as claimed in claim 1, wherein in the step 3), the number of bits of the first CRC value is the same as the number of bits of the target CRC mask for the message type corresponding to the payload, and if the remainder of the result calculated in the step 2) does not reach the target number of bits, the first CRC value corresponding to the target number of bits is changed by complementing 0 at the upper bits.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910932768.5A CN110750383B (en) | 2019-09-29 | 2019-09-29 | Method for carrying information by using CRC (cyclic redundancy check) code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910932768.5A CN110750383B (en) | 2019-09-29 | 2019-09-29 | Method for carrying information by using CRC (cyclic redundancy check) code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110750383A true CN110750383A (en) | 2020-02-04 |
| CN110750383B CN110750383B (en) | 2024-03-15 |
Family
ID=69277334
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910932768.5A Active CN110750383B (en) | 2019-09-29 | 2019-09-29 | Method for carrying information by using CRC (cyclic redundancy check) code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110750383B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111343605A (en) * | 2020-03-06 | 2020-06-26 | 知轮(杭州)科技有限公司 | Wireless communication method for high-speed data transmission of vehicle local area network |
| CN117952324A (en) * | 2024-03-26 | 2024-04-30 | 深圳市智慧企业服务有限公司 | Government affair data management method and related device based on redundant information |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1571284A (en) * | 2003-07-14 | 2005-01-26 | 北京大学 | A fast circulating CRC verification method used for correcting error bits in data frame |
| CN101625653A (en) * | 2009-08-13 | 2010-01-13 | 青岛海信电器股份有限公司 | Method for processing and checking local data in multi-media product |
| CN102263612A (en) * | 2011-07-18 | 2011-11-30 | 杭州晟联通信技术有限公司 | Error detection method used for data block and equipment thereof |
| US20130294547A1 (en) * | 2012-05-07 | 2013-11-07 | Mstar Semiconductor, Inc. | Control Channel Demodulating and Decoding Method and Communication Apparatus Using the Same |
| CN104639294A (en) * | 2015-02-10 | 2015-05-20 | 浪潮电子信息产业股份有限公司 | Improved CRC (Cyclic redundancy check) implementation method |
| CN105975498A (en) * | 2016-04-27 | 2016-09-28 | 华为技术有限公司 | Data query method, device and system |
| CN107733568A (en) * | 2017-09-22 | 2018-02-23 | 烽火通信科技股份有限公司 | The method and device of CRC parallel computations is realized based on FPGA |
| CN108933641A (en) * | 2017-05-22 | 2018-12-04 | 中兴通讯股份有限公司 | Data transmission, processing method and processing device, network side equipment and terminal |
-
2019
- 2019-09-29 CN CN201910932768.5A patent/CN110750383B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1571284A (en) * | 2003-07-14 | 2005-01-26 | 北京大学 | A fast circulating CRC verification method used for correcting error bits in data frame |
| CN101625653A (en) * | 2009-08-13 | 2010-01-13 | 青岛海信电器股份有限公司 | Method for processing and checking local data in multi-media product |
| CN102263612A (en) * | 2011-07-18 | 2011-11-30 | 杭州晟联通信技术有限公司 | Error detection method used for data block and equipment thereof |
| US20130294547A1 (en) * | 2012-05-07 | 2013-11-07 | Mstar Semiconductor, Inc. | Control Channel Demodulating and Decoding Method and Communication Apparatus Using the Same |
| CN104639294A (en) * | 2015-02-10 | 2015-05-20 | 浪潮电子信息产业股份有限公司 | Improved CRC (Cyclic redundancy check) implementation method |
| CN105975498A (en) * | 2016-04-27 | 2016-09-28 | 华为技术有限公司 | Data query method, device and system |
| CN108933641A (en) * | 2017-05-22 | 2018-12-04 | 中兴通讯股份有限公司 | Data transmission, processing method and processing device, network side equipment and terminal |
| CN107733568A (en) * | 2017-09-22 | 2018-02-23 | 烽火通信科技股份有限公司 | The method and device of CRC parallel computations is realized based on FPGA |
Non-Patent Citations (1)
| Title |
|---|
| 杨璇: "短波选频与建链系统数据传输协议设计与实现", 《硕士电子期刊》, no. 3, pages 1 - 71 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111343605A (en) * | 2020-03-06 | 2020-06-26 | 知轮(杭州)科技有限公司 | Wireless communication method for high-speed data transmission of vehicle local area network |
| CN111343605B (en) * | 2020-03-06 | 2023-08-29 | 知轮(杭州)科技有限公司 | Wireless communication method for high-speed data transmission of vehicle local area network |
| CN117952324A (en) * | 2024-03-26 | 2024-04-30 | 深圳市智慧企业服务有限公司 | Government affair data management method and related device based on redundant information |
| CN117952324B (en) * | 2024-03-26 | 2024-05-28 | 深圳市智慧企业服务有限公司 | Government affair data management method and related device based on redundant information |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110750383B (en) | 2024-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3371890B1 (en) | Signature-enabled polar encoder and decoder | |
| JP4271855B2 (en) | Method and apparatus for transmitting identifier information in communication system | |
| CN109039344B (en) | Method and equipment for coding input data into polar code, decoding method and equipment thereof | |
| US20170294990A1 (en) | Data transmission method and device | |
| EP3614589B1 (en) | Information transmission method, decoding method and device | |
| CN105991227B (en) | Data coding method and device | |
| EP3484126B1 (en) | Method and apparatus for carrying identifier information | |
| US5142539A (en) | Method of processing a radio signal message | |
| US11683052B2 (en) | Data processing method and device | |
| US10644835B1 (en) | System and method for interleaving distributed CRC in polar codes for early termination | |
| US11075653B2 (en) | Polar code encoding and decoding method and apparatus | |
| CN110750383B (en) | Method for carrying information by using CRC (cyclic redundancy check) code | |
| US11075715B2 (en) | Encoding method and apparatus | |
| CN101483441A (en) | Device for adding cyclic redundancy check in communication system | |
| US11502780B2 (en) | Channel decoding method and apparatus in wireless communications | |
| US20240048157A1 (en) | Encoding method, decoding method, electronic device and storage medium | |
| US9853766B2 (en) | Radio communication devices, access points, method for controlling a radio communication device, and methods for controlling an access point | |
| EP3605849A1 (en) | Polar code encoding method and device | |
| US11456819B2 (en) | Partial pseudo-randomization processing method, and corresponding apparatus and device, and storage medium | |
| KR102105428B1 (en) | Decoder for multi-error-correction of sec-code and the decoding method thereof | |
| JP2019083507A (en) | Reception device, transmission device, reception method and transmission method | |
| CN112821984B (en) | Method, device and equipment for processing wireless local area network data | |
| US10999009B2 (en) | Channel encoding method and apparatus in wireless communications | |
| WO2018201377A1 (en) | A unified error correction and error detection code generator | |
| WO2024091727A1 (en) | Decoding correlated received multi-symbol data by guessing noise effect |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |