CN113162728B - Polarized Polar coding method and device, electronic equipment and storage medium - Google Patents
Polarized Polar coding method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN113162728B CN113162728B CN202110318482.5A CN202110318482A CN113162728B CN 113162728 B CN113162728 B CN 113162728B CN 202110318482 A CN202110318482 A CN 202110318482A CN 113162728 B CN113162728 B CN 113162728B
- Authority
- CN
- China
- Prior art keywords
- sequence
- lookup table
- address
- interleaving
- coded
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
- H04L1/0013—Rate matching, e.g. puncturing or repetition of code symbols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0071—Use of interleaving
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Error Detection And Correction (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The embodiment of the application provides a polarized Polar coding method, a polarized Polar coding device, electronic equipment and a storage medium, relates to the technical field of communication, and can simplify the judgment logic of information bit placement positions. The method for coding the polarized Polar comprises the following steps: respectively reading each element in a bit position sequence lookup table to be coded, wherein the element in the bit position sequence lookup table to be coded is an address of a coding sequence to be generated; reading elements read from a bit position sequence lookup table to be coded as elements in an address reading interleaving address sequence lookup table, wherein the elements in the interleaving address sequence lookup table are positions of coded sequences after code block interleaving, and the addresses in the interleaving address sequence lookup table are addresses of the coded sequences; and determining whether the element read from the interleaved address sequence lookup table belongs to a placing position or a non-placing position, placing information bits at the placing position, not placing information bits at the non-placing position, and generating a coded sequence after all the information bits are placed.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for coding polarized Polar, an electronic device, and a storage medium.
Background
In the 5G New Radio (NR) technology, a Polar encoder needs to place information bits in a coding sequence, rate matching is performed after the coding is completed, and when the rate matching is performed, information bits cannot be placed in punctured bit positions and shortened bit positions in the sequence, so that the placement positions need to be determined when the information bits are placed. In the current method, the judgment process of the information bit placement position is relatively complicated.
Disclosure of Invention
The embodiment of the application provides a polarized Polar coding method, a polarized Polar coding device, electronic equipment and a storage medium, which can simplify the judgment logic of information bit placement positions.
In a first aspect, an embodiment of the present application provides a method for coding polarized Polar, including:
respectively reading each element in a bit position sequence lookup table to be coded, wherein the element in the bit position sequence lookup table to be coded is an address of a coding sequence to be generated;
taking the element read from the bit position sequence lookup table to be coded as an element in an address reading interleaving address sequence lookup table, wherein the element in the interleaving address sequence lookup table is the position of the code sequence after code block interleaving, and the address in the interleaving address sequence lookup table is the address of the code sequence;
and determining whether the element read from the interleaved address sequence lookup table belongs to a placing position or a non-placing position, placing information bits at the placing position, not placing information bits at the non-placing position, and generating a coding sequence after all the information bits are placed.
In a possible implementation manner, in the sequence of the addresses in the bit position sequence lookup table to be coded from high to low, the reliability of the sequence is decreased;
the process of reading each element in the bit position sequence lookup table to be coded separately is as follows: and sequentially reading each element in the bit position sequence lookup table to be coded according to the sequence of addresses from high to low.
In a possible embodiment, the non-placed positions are punctured bit position intervals or shortened bit position intervals.
In a possible implementation, before the separately reading each element in the look-up table of bit positions to be coded, the method further includes:
and acquiring an interleaving sequence lookup table, and exchanging the positions of the elements and the addresses in the interleaving sequence lookup table to obtain the interleaving address sequence lookup table, wherein the elements in the interleaving sequence lookup table are the addresses of the coding sequences, and the addresses in the interleaving address sequence lookup table are the positions of the coding sequences after the code blocks are interleaved.
In a possible embodiment, after the generating the coding sequence, the method further includes:
code block interleaving and rate matching are performed on the code sequence.
In a second aspect, an embodiment of the present application provides a Polar encoding apparatus, including:
the first reading module is used for respectively reading each element in a bit position sequence lookup table to be coded, wherein the element in the bit position sequence lookup table to be coded is an address of a coding sequence to be generated;
a second reading module, configured to read an element from the bit position sequence lookup table to be coded as an element in an address reading interleaving address sequence lookup table, where the element in the interleaving address sequence lookup table is a position of the code sequence after code block interleaving, and an address in the interleaving address sequence lookup table is an address of the code sequence;
and the placement module is used for determining whether the elements read from the interleaving address sequence lookup table belong to placement positions or non-placement positions, placing information bits at the placement positions, not placing the information bits at the non-placement positions, and generating a coding sequence after all the information bits are placed.
In a third aspect, an embodiment of the present application provides a Polar encoding apparatus, including:
a processor and a memory for storing at least one instruction, which is loaded and executed by said processor to implement the above-mentioned polarized Polar encoding method.
In a fourth aspect, an embodiment of the present application provides an electronic device, including the polarized Polar encoding apparatus of the second aspect or the third aspect.
In a fifth aspect, the present application provides a computer-readable storage medium, where a computer program is stored, and when the computer program runs on a computer, the computer is caused to execute the above-mentioned polarized Polar encoding method.
In the method, the apparatus, the electronic device and the storage medium for coding polarization Polar in the embodiment of the application, the element in the bit position sequence Q lookup table to be coded is the address in the coding sequence U, the element in the interleaved address sequence Y ' lookup table is the position of the coding sequence U after code block interleaving, and the address in the interleaved address sequence Y ' lookup table is the address in the coding sequence U, so that the corresponding element in the interleaved address sequence Y ' lookup table can be directly read as the address according to the element read from the bit position sequence Q to be coded, and then whether the element belongs to a non-placement position is determined.
Drawings
FIG. 1 is a diagram illustrating a correspondence between different sequences in the prior art;
FIG. 2 is a diagram illustrating a prior art method for determining information bit placement positions by traversal comparison;
FIG. 3 is a flowchart of a method for encoding Polar in the embodiment of the present application;
FIG. 4 is a diagram illustrating a mapping relationship between different sequences according to an embodiment of the present disclosure;
FIG. 5 is a diagram illustrating a correspondence relationship between Y and Y' in an embodiment of the present application;
FIG. 6 is a diagram illustrating an example of determining the placement of information bits in an embodiment of the present application;
FIG. 7 is a flow chart of another method for encoding polarized Polar in the embodiment of the present application;
FIG. 8 is a block diagram of a polarized Polar encoding apparatus in the embodiment of the present application;
FIG. 9 is a block diagram of another polarized Polar encoding apparatus in the embodiment of the present application.
Detailed Description
The terminology used in the description of the embodiments section of the present application is for the purpose of describing particular embodiments of the present application only and is not intended to be limiting of the present application.
Before describing the embodiments of the present application, first, a technical problem in the prior art is described, as shown in fig. 1 and fig. 2, first, a placement position and a non-placement position of an information bit in a coding sequence U need to be determined, a bit position sequence Q to be coded is used to indicate a position of the information bit in the coding sequence U, an interleaving sequence Y is used to indicate a position of the coding sequence U after code block interleaving, the bit position sequence Q to be coded, the coding sequence U and the interleaving sequence Y all include N position addresses from 0 to N-1, reliability of the bit position sequence Q to be coded decreases in an order of addresses from high to low, when rate matching is performed, a puncturing pattern and a shortening pattern are included, in the puncturing pattern, first m (puncturing bit length) data of the interleaving sequence Y are punctured, last N (puncturing bit length) data of the interleaving sequence Y are punctured, first m elements from 0 to m-1 in the interleaving sequence Y are respectively a to f, since first m (puncturing bit length) data of the interleaving sequence Y are punctured, a specific bit position element is generated, and a search table is used to search for searching the first m elements of the interleaving sequence Y, and the coding sequence Y is not found, and the information bit position element is found in the coding sequence U. When the length of the mother code is 1024, the m multiplied by 1024 comparisons are needed totally, so that the generation process of the coding sequence U is complicated, and required devices occupy larger area and have larger power consumption when the code is realized through hardware. The following describes a technical solution of an embodiment of the present application.
As shown in fig. 3 to fig. 6, an embodiment of the present application provides a method for coding polarized Polar, including:
102, reading elements in an interleaved address sequence Y ' lookup table by taking elements read from a bit position sequence Q lookup table to be coded as addresses, wherein the elements in the interleaved address sequence Y ' lookup table are the positions of a coding sequence U after code block interleaving, and the addresses in the interleaved address sequence Y ' lookup table are the addresses of the coding sequence U;
and 103, determining whether the element read from the interleaved address sequence Y' lookup table belongs to a placing position or a non-placing position, placing information bits at the placing position, not placing information bits at the non-placing position, and generating a coding sequence U after all the information bits are placed.
Specifically, addresses of the sequences in fig. 4 to 6 are all 0 to N-1, and in the embodiment of the present application, the placement position and the non-placement position of the information bit in the coding sequence U are no longer determined according to the bit position sequence Q to be coded and the interleaving sequence Y, but are determined according to the bit position sequence Q to be coded and the interleaving address sequence Y ', where the interleaving address sequence Y' is a sequence formed after elements and addresses of the interleaving sequence Y are interchanged. Because the address in the interleaved address sequence Y 'lookup table and the element in the bit position sequence Q lookup table to be coded are both the address of the coding sequence U, the corresponding element in the interleaved address sequence Y' lookup table can be directly read as the address according to the element read from the bit position sequence Q to be coded, then whether the element belongs to the non-placement position is judged, if the element belongs to the placement position, the information bit is placed, and if the element belongs to the non-placement position, the information bit is not placed at the position after the position is separated, so that the non-placement position of the information bit can be determined without a complex traversal comparison process in the prior art.
In the Polar coding method in the embodiment of the present application, the element in the bit position sequence Q lookup table to be coded is the address in the coding sequence U, the element in the interleaved address sequence Y ' lookup table is the position of the coding sequence U after code block interleaving, and the address in the interleaved address sequence Y ' lookup table is the address in the coding sequence U, so that the corresponding element in the interleaved address sequence Y ' lookup table can be directly read as an address according to the element read from the bit position sequence Q to be coded, and then it is determined whether the element belongs to a non-placement position.
In a possible implementation manner, the reliability of the sequence is decreased in the sequence from high to low in the lookup table of the bit position sequence Q to be coded, namely the reliability of the bit position sequence Q to be coded is decreased in the sequence from the address N-1 to 0; the process of reading each element in the bit position sequence to be coded Q lookup table in step 101 is as follows: and sequentially reading each element in the bit position sequence Q lookup table to be coded according to the sequence of addresses from high to low.
Specifically, for example, in step 101, an element corresponding to an address N-1 in a bit position sequence Q lookup table to be encoded is read first, then in step 102, the element is read as an address into an element in an interleaved address sequence Y' lookup table, then in step 103, it is determined whether the element belongs to non-placement positions [0,m-1], if the element belongs to the non-placement positions, the position is separated, that is, an information bit is not placed at the position, if the element does not belong to the non-placement positions, then the step 101 is re-entered, an element corresponding to a next address N-2 is read in the bit position sequence Q lookup table to be encoded, and so on, based on the above logic until all information bits are placed, the determination of an information bit position in an encoding sequence U and the generation of an encoding sequence U can be achieved. For example, when the element corresponding to the address 0 read into the bit position sequence Q to be encoded in step 101 is a, then a is read as an address into the interleaved address sequence Y' lookup table in step 102 is 0, and then in step 103, it is determined that the element 0 belongs to [0,m-1], and the position is passed.
In one possible embodiment, the non-placement positions are puncturing bit position regions or shortened bit position regions, the puncturing bit position regions are, for example, regions corresponding to m puncturing bits from addresses 0 to m-1 of the interleaving sequence Y, that is, regions corresponding to the first m elements of the interleaving sequence Y, and the shortened bit position regions are, for example, regions corresponding to the last n elements of the interleaving sequence Y.
Specifically, for example, in the puncturing mode, data of a puncturing bit position interval is punctured in the subsequent rate matching mode, and therefore, in the process of generating the code sequence, if it is determined in step 103 that an element read from the interleaved address sequence Y 'lookup table belongs to the puncturing bit position interval [0,m-1], no information bit is placed at a position corresponding to the element, and when it is determined that the element read from the interleaved address sequence Y' lookup table is located outside the puncturing bit position interval [0,m-1], an information bit is placed at the position; similarly, in the shortening mode, the data of the shortening bit position interval is discarded in the subsequent rate matching mode, and therefore, in the process of generating the coding sequence, if it is determined in step 103 that the element read from the lookup table of the interleaved address sequence Y 'belongs to the shortening bit position interval, for example, the last n elements, no information bit is disposed at the position corresponding to the element, and when it is determined that the element read from the lookup table of the interleaved address sequence Y' is located outside the shortening bit position interval, an information bit is disposed at the position.
In a possible implementation, as shown in fig. 7, before reading each element in the sequence of bit positions to be coded Q lookup table in step 101, the method further includes:
Specifically, in addition to the manner of directly generating and using the interleaving address sequence Y ' lookup table, the interleaving address sequence Y ' lookup table may be obtained first, and elements and addresses in the interleaving sequence Y lookup table are exchanged to obtain the interleaving address sequence Y ' lookup table.
In a possible embodiment, as shown in fig. 7, after the generating the coding sequence in step 103, the method further includes:
and 104, performing code block interleaving and rate matching on the coding sequence U. In the process of rate matching, if the pattern is a puncturing pattern, the data of the puncturing bit position interval is punched out in the above manner, and if the pattern is a shortening pattern, the data of the shortening bit position interval is punched out in the above manner.
As shown in fig. 8, an embodiment of the present application further provides a polarized Polar encoding apparatus, including:
a first reading module 201, configured to read each element in a bit position sequence Q lookup table to be encoded, where the element in the bit position sequence Q lookup table to be encoded is an address of an encoding sequence U to be generated;
a second reading module 202, configured to read an element read from the bit position sequence Q lookup table to be encoded as an element in an address reading interleaved address sequence Y ' lookup table, where the element in the interleaved address sequence Y ' lookup table is a position of the code sequence U after the code block is interleaved, and an address in the interleaved address sequence Y ' lookup table is an address of the code sequence U;
a placing module 203, configured to determine whether an element read from the lookup table of the interleaved address sequence Y' belongs to a placing position or a non-placing position, place an information bit at the placing position, place no information bit at the non-placing position, and generate the coding sequence U after all information bits are placed.
The above-mentioned polarized Polar encoding method may be applied to the polarized Polar encoding apparatus, and the specific process and principle are the same as those in the above-mentioned embodiments, and are not described herein again. The polarized Polar coding device can be an encoder or a baseband chip, for example.
It should be understood that the division of each module of the polarized Polar coding apparatus shown in fig. 8 is only a division of a logic function, and the actual implementation may be wholly or partially integrated into one physical entity, or may be physically separated. And these modules can be realized in the form of software called by processing element; or may be implemented entirely in hardware; and part of the modules can be realized in the form of calling by the processing element in software, and part of the modules can be realized in the form of hardware. For example, any one of the first reading module 201, the second reading module 202 and the placing module 203 may be a processing element that is set up separately, or may be integrated in the Polar encoding apparatus, for example, be integrated in a certain chip of the Polar encoding apparatus for implementation, or may be stored in a memory of the Polar encoding apparatus in the form of a program, and a certain processing element of the Polar encoding apparatus calls and executes the functions of the above modules. The other modules are implemented similarly. In addition, all or part of the modules can be integrated together or can be independently realized. The processing element described herein may be an integrated circuit having signal processing capabilities. In implementation, each step of the above method or each module above may be implemented by an integrated logic circuit of hardware in a processor element or an instruction in the form of software.
For example, the first reading module 201, the second reading module 202, and the placing module 203 may be one or more integrated circuits configured to implement the above methods, such as: one or more Application Specific Integrated Circuits (ASICs), or one or more microprocessors (DSPs), or one or more Field Programmable Gate Arrays (FPGAs), among others. As another example, when one of the above modules is implemented in the form of a Processing element scheduler, the Processing element may be a general purpose processor, such as a Central Processing Unit (CPU) or other processor capable of invoking programs. As another example, these modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).
In a possible implementation manner, in the sequence of addresses in the bit position sequence to be coded Q lookup table from high to low, the reliability of the sequence is decreased; the first reading module 201 is specifically configured to sequentially read each element in the bit position sequence to be coded Q lookup table according to the order from high to low of the address.
In one possible embodiment, the non-placed positions are punctured bit position intervals or shortened bit position intervals.
In a possible embodiment, as shown in fig. 9, the polarized Polar encoding apparatus further comprises: the obtaining module 204 is configured to obtain an interleaving sequence Y lookup table, and exchange positions of elements and addresses in the interleaving sequence Y lookup table to obtain an interleaving address sequence Y 'lookup table, where an element in the interleaving sequence Y lookup table is an address of the code sequence U, and an address in the interleaving address sequence Y' lookup table is a position of the code sequence U after the code block is interleaved.
In a possible embodiment, as shown in fig. 9, the polarized Polar encoding apparatus further comprises: and a processing module 205, configured to perform code block interleaving and rate matching on the coding sequence U.
The embodiment of the present application further provides a polarized Polar encoding apparatus, including: a processor and a memory, the memory being used for storing at least one instruction, the instruction being loaded and executed by the processor to implement the Polar encoding method in any of the embodiments described above.
The above-mentioned polarized Polar encoding method may be applied to the polarized Polar encoding apparatus, and the specific process and principle are the same as those in the above-mentioned embodiments, and are not described herein again. The polarized Polar coding device can be an encoder or a baseband chip, for example.
The number of processors may be one or more, and the processors and memory may be connected by a bus or other means. The memory, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the polarized Polar encoding apparatus in the embodiments of the present application. The processor executes various functional applications and data processing by executing non-transitory software programs, instructions and modules stored in the memory, i.e., implementing the methods in any of the method embodiments described above. The memory may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; and necessary data, etc. Further, the memory may include high speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid state storage device.
The embodiment of the present application further provides an electronic device, which includes the polarized Polar encoding apparatus in any of the above embodiments.
The electronic device related to the present application may be any product having a wireless communication function, such as a mobile phone, a tablet computer, a Personal Computer (PC), a Personal Digital Assistant (PDA), a smart watch, a netbook, a wearable electronic device, an Augmented Reality (AR) device, a Virtual Reality (VR) device, an onboard device, an unmanned aerial vehicle device, a smart car, a smart audio, a robot, and smart glasses.
The embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored, and when the computer program runs on a computer, the computer is caused to execute the Polar encoding method in any embodiment described above.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the procedures or functions described in accordance with the present application are generated, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., coaxial cable, fiber optic, digital subscriber line) or wirelessly (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid State Disk), among others.
In the embodiments of the present application, "at least one" means one or more, and "a plurality" means two or more. "and/or" describes the association relationship of the associated objects, and means that there may be three relationships, for example, a and/or B, and may mean that a exists alone, a and B exist simultaneously, and B exists alone. Wherein A and B can be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" and similar expressions refer to any combination of these items, including any combination of singular or plural items. For example, at least one of a, b, and c may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or multiple.
The above description is only a preferred embodiment of the present application and is not intended to limit the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (9)
1. A method for coding polarized Polar is characterized by comprising the following steps:
respectively reading each element in a bit position sequence lookup table to be coded, wherein the element in the bit position sequence lookup table to be coded is an address of a coding sequence to be generated;
taking the element read from the bit position sequence lookup table to be coded as an element in an address reading interleaving address sequence lookup table, wherein the element in the interleaving address sequence lookup table is the position of the code sequence after code block interleaving, and the address in the interleaving address sequence lookup table is the address of the code sequence;
and determining whether the element read from the interleaved address sequence lookup table belongs to a placing position or a non-placing position, placing information bits at the placing position, not placing information bits at the non-placing position, and generating a coding sequence after all the information bits are placed.
2. The method of coding polarized Polar according to claim 1, wherein,
in the sequence of the addresses in the bit position sequence lookup table to be coded from high to low, the reliability of the sequence is decreased progressively;
the process of reading each element in the bit position sequence lookup table to be coded separately is as follows: and sequentially reading each element in the bit position sequence lookup table to be coded according to the sequence of addresses from high to low.
3. The polarized Polar encoding method according to claim 1,
the non-placement positions are punctured bit position intervals or shortened bit position intervals.
4. The polarized Polar encoding method according to claim 1,
before the separately reading each element in the look-up table of the bit position sequence to be coded, the method further includes:
and acquiring an interleaving sequence lookup table, and exchanging the positions of the elements and the addresses in the interleaving sequence lookup table to obtain the interleaving address sequence lookup table, wherein the elements in the interleaving sequence lookup table are the addresses of the coding sequences, and the addresses in the interleaving address sequence lookup table are the positions of the coding sequences after the code blocks are interleaved.
5. The polarized Polar encoding method according to claim 1,
after the generating of the coding sequence, further comprising:
code block interleaving and rate matching are performed on the code sequence.
6. A polarized Polar coding device, comprising:
the first reading module is used for respectively reading each element in a bit position sequence lookup table to be coded, wherein the element in the bit position sequence lookup table to be coded is an address of a coding sequence to be generated;
a second reading module, configured to read an element from the bit position sequence lookup table to be coded as an element in an address reading interleaving address sequence lookup table, where the element in the interleaving address sequence lookup table is a position of the code sequence after code block interleaving, and an address in the interleaving address sequence lookup table is an address of the code sequence;
and the placement module is used for determining whether the elements read from the interleaving address sequence lookup table belong to placement positions or non-placement positions, placing information bits at the placement positions, not placing the information bits at the non-placement positions, and generating a coding sequence after all the information bits are placed.
7. A polarized Polar coding device, comprising:
a processor and a memory for storing at least one instruction which is loaded and executed by said processor to implement the Polar encoding method as claimed in any one of claims 1 to 5.
8. An electronic device, characterized by comprising the polarized Polar encoding apparatus of claim 6 or 7.
9. A computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, which, when run on a computer, causes the computer to perform the Polar encoding method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110318482.5A CN113162728B (en) | 2021-03-25 | 2021-03-25 | Polarized Polar coding method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110318482.5A CN113162728B (en) | 2021-03-25 | 2021-03-25 | Polarized Polar coding method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113162728A CN113162728A (en) | 2021-07-23 |
| CN113162728B true CN113162728B (en) | 2022-11-04 |
Family
ID=76885111
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110318482.5A Active CN113162728B (en) | 2021-03-25 | 2021-03-25 | Polarized Polar coding method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113162728B (en) |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100424998C (en) * | 2006-01-20 | 2008-10-08 | 北京华环电子股份有限公司 | Single-bit error correction and form-checking method based on CRC and its circuit |
-
2021
- 2021-03-25 CN CN202110318482.5A patent/CN113162728B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN113162728A (en) | 2021-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105740405B (en) | Method and device for storing data | |
| CN110851748A (en) | Short link generation method, server, storage medium and computer equipment | |
| CN112988458B (en) | Data backup method and device, electronic equipment and storage medium | |
| CN113641873B (en) | Data processing method and device, electronic equipment and readable storage medium | |
| CN113162728B (en) | Polarized Polar coding method and device, electronic equipment and storage medium | |
| CN117215650A (en) | Register updating method and device, electronic equipment and readable storage medium | |
| CN115964984B (en) | Method and device for balanced winding of digital chip layout | |
| CN112486848A (en) | Test data generation method and device, chip and storage medium | |
| CN111597403A (en) | Method and device for constructing graph index, electronic equipment and storage medium | |
| CN113672669B (en) | Data query method and device based on distributed storage | |
| CN114070901B (en) | Data transmitting and receiving method, device and equipment based on multi-data alignment | |
| CN112511441A (en) | Message processing method and device | |
| CN113360448A (en) | Data packet processing method and device | |
| CN108664417B (en) | Directory updating method and device | |
| CN111384976A (en) | Storage method and reading method of sparse check matrix | |
| CN111274228B (en) | Policy data migration storage method, system, equipment and readable storage medium | |
| CN112395243B (en) | Access method and device of processor | |
| CN113434508B (en) | Method and apparatus for storing information | |
| CN116360708B (en) | Data writing method and device, electronic equipment and storage medium | |
| CN110968454B (en) | Method and apparatus for determining recovery data for lost data blocks | |
| CN106649427B (en) | Information identification method and device | |
| CN111800779B (en) | Device source identification method and apparatus, computer system, and readable storage medium | |
| CN117200800A (en) | Data compression method, device, equipment and storage medium | |
| WO2022249008A1 (en) | Logic circuit for anti-circular shift-and-add multiplication | |
| CN117931758A (en) | Log processing method, device, equipment, readable storage medium and vehicle |
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 |