WO2017185213A1

WO2017185213A1 - Encoding method and encoding device

Info

Publication number: WO2017185213A1
Application number: PCT/CN2016/080156
Authority: WO
Inventors: 武雨春
Original assignee: 华为技术有限公司
Priority date: 2016-04-25
Filing date: 2016-04-25
Publication date: 2017-11-02

Abstract

Provided in embodiments of the present invention are an encoding method and an encoding device. The encoding method comprises: obtaining an information set and a frozen set of a polar code having a code length of N, the number of 1 in a binary number corresponding to an index number of any polarized channel in the information set being greater than or equal to the number of 1 in a binary number corresponding to an index number of any polarized channel in the frozen set, wherein a Bhattacharya parameter of the 2i-1th polarized channel in N polarized channels is greater than or equal to a Bhattacharya parameter of the 2ith polarized channel, and a binary representation, the binary number of which is n-1 and which corresponds to an index number of the nth polarized channel in the N polarized channels, is n∈[1,N], and N, i, n are positive integers; carrying out polar code encoding according to the information set and frozen set. According to the embodiments of the present invention, determining the information set and frozen set no longer requires calculating the Bhattacharya parameter of each polarized channel at each communication, thereby reducing the complexity of coding.

Description

Coding method and coding device

Technical field

The present invention relates to the field of channel coding and decoding, and more particularly to an encoding method and an encoding apparatus.

Background technique

Forward Error Correction (FEC) is a key technology in wireless communication by encoding source information and adding certain redundant information to resist errors in channel transmission. The location of the general communication system and FEC encoding and FEC decoding in the system is shown in Figure 1. Polar Codes is a new type of FEC code that appeared in 2009. It is theoretically proven to achieve Shannon channel capacity and has a simpler coding and decoding algorithm.

Polar Codes is a channel dependent encoding, which performs Polar Codes polarization processing on N identical channels W to obtain N polarized channels. When N→∞, the N polarized channels The Bhattacharyya parameter either tends to zero or tends to 1. In practical application, an important work of Polar Codes is to calculate the reliability of all N=2 ⁿ polarized channels for different channels W, and then select K polarized channels with higher reliability to polarize these. The set of location index numbers corresponding to the channel is called an Information Set. When Polar Code is encoded, K<=N information symbols are placed at the position corresponding to the information set, and the remaining (NK) positions (called Frozen Sets) are placed with fixed known symbols, which can generally be taken (NK The fixed known symbols are all 0 symbols.

The selection of information sets has a great impact on the performance of Polar Codes encoding. However, in practical applications, the reliability of each polarization channel is calculated for different channels W, so that obtaining an accurate information set is often complicated or even difficult to implement. Therefore, practical applications usually require a certain approximation to achieve a compromise between complexity and performance.

In the existing scheme, the arbitrary channel W is regarded as a Binary Erasure Channel (BEC). For the BEC channel, Polar Codes has an explicit and simple formula for calculating the reliability of each polarized channel. The reliability of each polarized channel is generally expressed in terms of Paging parameters or Bit Error Rate (BER).

If the Barthel parameter is used, the smaller the Barth's parameter of one channel, the higher the reliability of the channel. Assuming that the erasure probability of the BEC channel W is e, the Paging parameter of the BEC channel W is e, and the P&B parameters of the N polarized channels can be calculated by the recursive algorithm. Calculate N polarization letters After the Pap test of the channel, the PB parameters are sorted from small to large, and the index numbers of the polarization channels with the smaller K Pap parameters are selected to form a information set.

In the existing solution, as the channel changes, the Barth parameters of each polarized channel are calculated in real time in each communication, thereby determining the information set, which makes the encoding process more complicated.

Summary of the invention

The embodiment of the invention provides an encoding method and an encoding device, which can calculate the Barth's parameter of each polarized channel at each encoding, and can reduce the complexity of the encoding.

In a first aspect, an encoding method is provided, including: acquiring an information set and a frozen set of a polarization code having a code length N, wherein a binary number corresponding to an index number of any polarized channel in the information set is 1 The number is greater than or equal to the number of 1 in the binary number corresponding to the index number of any of the polarized channels in the frozen set, wherein the Paging parameter of the 2i-1th polarized channel in the N polarized channels is greater than or a PB parameter equal to the 2i-th polarized channel, wherein the binary number corresponding to the index number of the n-th polarized channel of the N polarized channels is a binary representation of n-1,

N ∈ [1, N], N, i, n are positive integers; polarization code encoding is performed according to the information set and the frozen set.

Since the information set and the frozen set are determined according to the number of 1 in the binary number corresponding to the index number of the polarized channel, even if the channel changes, the information set and the frozen set do not change, so it is not necessary to calculate each time by each communication. The Paging parameter of the polarized channel to determine the information set and the frozen set can reduce the complexity of the coding.

With reference to the first aspect, in a first possible implementation manner of the first aspect, the acquiring an information set and a freeze set of a polarization code having a code length N include: acquiring an index number of the N polarized channels; Determining, respectively, a binary number corresponding to an index number of the N polarized channels; and selecting, according to a binary number corresponding to an index number of the N polarized channels, an number of 1 from an index number of the N polarized channels The index number of the K polarized channels corresponding to the most K binary numbers, the index numbers of the K polarized channels constitute the information set, and the remaining NK polarizations in the index numbers of the N polarized channels The index number of the channel constitutes the frozen set, and K is a positive integer less than or equal to N.

Optionally, the K poles corresponding to the K number of the largest number of 1 are selected from the index numbers of the N polarized channels according to the binary numbers corresponding to the index numbers of the N polarized channels respectively. The index number of the channel includes: sorting the N binary numbers corresponding to the index numbers of the N binary number polarization channels according to the number of 1 in the binary number; selecting the K numbers corresponding to the K number of the largest number of 1 The index number of the polarized channel.

With reference to the first aspect, or the first possible implementation manner of the first aspect, in the second possible implementation manner of the first aspect, the performing the polarization code encoding according to the information set and the frozen set includes: Determining, according to the information set and the frozen set, a sequence of length N consisting of an information symbol and a fixed symbol, where the information symbol is placed in an index number of a polarized channel in the information set in the sequence Positionally, the fixed symbol is placed at a position corresponding to an index number of a polarized channel in the frozen set in the sequence; the sequence is coded by a polarization code.

In conjunction with the first aspect or the first or second possible implementation of the first aspect, in a third possible implementation of the first aspect, the binary number comprises a log ₂ N number of bits.

With reference to the first aspect or the first or second or the third possible implementation manner of the first aspect, in a third possible implementation manner of the first aspect, the fixed symbol is an encoding end and a decoding end Known symbols.

In a second aspect, there is provided an encoding apparatus for performing the encoding method of any one of the above-described possible implementations of the first aspect or the first aspect. Specifically, the encoding apparatus includes: an acquiring unit, configured to acquire an information set and a frozen set of a polarization code with a code length of N, where a binary number corresponding to an index number of any polarized channel in the information set is 1 The number is greater than or equal to the number of 1 in the binary number corresponding to the index number of any of the polarized channels in the frozen set, wherein the Paging parameter of the 2i-1th polarized channel in the N polarized channels is greater than Or equal to the PB parameter of the 2ith polarized channel, and the binary number corresponding to the index number of the nth polarized channel of the N polarized channels is a binary representation of n-1,

N ∈ [1, N], N, i, n are positive integers; a coding unit is configured to perform polarization code encoding according to the information set and the frozen set.

With reference to the second aspect, in a first possible implementation manner of the second aspect, the acquiring unit is specifically configured to: obtain an index number of the N polarized channels; and determine an index number of the N polarized channels Corresponding binary numbers respectively; selecting K poles corresponding to the K number of the largest number of 1 from the index numbers of the N polarized channels according to the binary numbers corresponding to the index numbers of the N polarized channels The index number of the channel, the index number of the K polarized channels constitutes the information set, and the index numbers of the remaining NK polarized channels in the index numbers of the N polarized channels constitute the frozen set, K Is a positive integer less than or equal to N.

With reference to the second aspect or the first possible implementation manner of the second aspect, in a second possible implementation manner of the second aspect, the coding unit is specifically configured to: according to the information set and the frozen set, Determining a sequence of length N consisting of an information symbol and a fixed symbol, the information symbol being placed at a position corresponding to an index number of a polarized channel in the information set in the sequence, A fixed symbol is placed at a position corresponding to an index number of a polarized channel in the frozen set in the sequence; the sequence is coded by a polarization code.

In conjunction with the second aspect or the first or second possible implementation of the second aspect, in a third possible implementation of the second aspect, the binary number comprises a log ₂ N digit.

With reference to the second aspect or the first or second or the third possible implementation manner of the second aspect, in a fourth possible implementation manner of the second aspect, the fixed symbol is an encoding end and a decoding end Known symbols.

In a third aspect, an encoding apparatus is provided, comprising: a processor, a memory, and a bus system. The processor and the storage are coupled by the bus system, the memory is for storing instructions, the processor is configured to execute the memory stored instructions, such that the encoding device performs the first aspect or the first aspect An encoding method as described in any of the possible implementations above.

In a fourth aspect, a computer readable storage medium is provided, the computer readable storage medium storing a program, the program being executed to cause the encoding device to perform the first aspect or any of the above possible implementations of the first aspect The encoding method described.

DRAWINGS

Figure 1 is a schematic diagram of a communication system employing FEC encoding;

2 is a schematic flowchart of an encoding method according to an embodiment of the present invention;

Figure 3 is a schematic diagram of polarization code encoding;

4 is a schematic block diagram of an encoding apparatus according to an embodiment of the present invention;

FIG. 5 is a schematic block diagram of an encoding apparatus according to an embodiment of the present invention.

detailed description

The technical solutions in the embodiments of the present invention will be described below with reference to the accompanying drawings in the embodiments of the present invention.

2 is a schematic flow chart of an encoding method 200 in accordance with an embodiment of the present invention. The encoding method 200 may be performed by an encoding device, which is a device that applies polarization code encoding. For example, the encoding device may be a base station, a User Equipment (UE), a Relay node, or the like.

As shown in FIG. 2, the encoding method 200 includes the following.

210. Obtain an information set and a frozen set of a polarization code with a code length of N. The number of 1s in the binary number corresponding to the index number of any polarization channel in the information set is greater than or equal to any polarized channel in the frozen set. The number of 1s in the binary number corresponding to the index number, the PB parameter of the 2i-1th polarized channel in the N polarized channels is greater than or equal to the P&B parameter of the 2ith polarized channel, and the N polarized channels The binary number corresponding to the index number of the nth polarized channel is a binary representation of n-1, K≤N,

N ∈ [1, N], K, N, i, n are positive integers.

In other words, for N polarized channels with index numbers {0, 1, 2, 3, ..., (N-1)}, the information set can be expressed as

A frozen collection is a complement of a collection of information, which can be expressed as

A you select an arbitrary element of a _s, a _s corresponding to the binary number containing

1; arbitrarily select one of the elements in A ^c b _t , b _t corresponding to the binary number

1, then

Optionally, the binary number corresponding to the index number of any one of the N polarized channels includes a log ₂ N digit. For example, if N=8, the binary numbers corresponding to the index numbers {0, 1, 2, 3, ..., 7} of the eight polarized channels are: 000, 001, 010, 011, 100, 101, 110, 111 . However, the embodiment of the present invention is not limited thereto, and the binary number corresponding to the index number of any one of the N polarized channels may further include (x+log ₂ N) digits, where x is a positive integer. For example, the binary numbers corresponding to the index numbers {0, 1, 2, 3, ..., 7} of the eight polarized channels may also be: 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111.

It should be understood that each symbol position in the polarization code of code length N corresponds to the index number of the N polarization channels.

220. Perform polarization code encoding according to the information set and the frozen set.

Optionally, performing polarization code encoding according to the information set and the frozen set includes:

Determining a sequence of length N consisting of an information symbol and a fixed symbol according to the information set and the frozen set, the information symbol is placed at a position corresponding to the index number of the polarized channel in the information set in the sequence, and the fixed symbol is placed in the sequence to freeze The position corresponding to the index number of the polarized channel in the set;

The sequence is subjected to polarization code encoding.

Specifically, the K information symbols are placed at K positions corresponding to the index numbers of the polarized channels in the information set, and the NK fixed symbols are placed at the NK positions corresponding to the index numbers of the polarized channels in the frozen set. An input sequence of length N, as shown in Figure 4 [u ₀ , u ₁ ... u _N-1 ]. The fixed symbol is a symbol known both at the encoding end and the decoding end. For example, NK fixed symbols can be all zero sequences.

Then, multiply the input sequence [u ₀ , u ₁ ... u _N-1 ] by the coding matrix

Get the encoded sequence [x ₀ , x ₁ ... x _N-1 ]:

Where B _N is a bit flip matrix,

Represents the Kronecker product, N = 2 ⁿ .

The information set in the coding method of the embodiment of the present invention is composed of index numbers of polarized channels corresponding to more than one binary number, and the calculation is simple, and the complexity of coding can be reduced.

In addition, in the existing coding scheme, the information set and the freeze set are determined according to the Pap's parameter of the polarized channel, and the Paging parameter of any polarized channel in the information set is less than or equal to any polarization in the frozen set. The Barthel's parameters of the channel. Due to the channel change, the Barthel parameters of each polarized channel will also change. Therefore, in each communication, the Pall parameters of each polarized channel need to be calculated in real time, and then the adopted information set and frozen set are determined, so that the coding is performed. The process is more complicated. In the embodiment of the present invention, the information set and the frozen set are determined according to the number of 1 in the binary number corresponding to the index number of the polarized channel, and the information set and the frozen set do not change even if the channel changes. Therefore, the coding method of the embodiment of the present invention can reduce the complexity of coding by calculating the information set and the freeze set by calculating the Barth parameters of the respective polarization channels at each communication.

The coding method of the embodiment of the present invention is equivalent to the performance of the existing scheme, and is even superior to the existing scheme at high SNR. Moreover, the performance of the coding method of the embodiment of the present invention is far superior to the Tail Biting Convolutional Code (TBCC) in the existing LTE, and has great application prospects in the future communication system.

The simulation results show that the code rate is lower (such as N=32 or N=64), and the code rate is lower (such as

or

), or a higher code rate (such as

or

The coding method of the embodiment of the present invention has better performance and is even better than the existing algorithm, and the coding complexity of the coding method of the embodiment of the present invention is much lower than that of the existing algorithm, so it is very suitable for a short code length. , application scenarios with lower or higher bit rate.

Optionally, the information set and the frozen set of obtaining the polarization code with the code length N in 210 include:

Obtain an index number of N polarized channels;

Determining a binary number corresponding to an index number of the N polarized channels;

And selecting, according to the binary numbers corresponding to the index numbers of the N polarized channels, the index numbers of the K polarized channels corresponding to the K number of the largest number of 1 from the index numbers of the N polarized channels, the K The index number of the polarized channel constitutes a set of information, and the index numbers of the remaining NK polarized channels in the index numbers of the N polarized channels constitute a frozen set.

Specifically, the N binary numbers corresponding to the index numbers of the N polarized channels may be arranged according to the number of 1 in the binary number (such as ascending or descending order), and then the K number of the largest number of 1 is selected. The index numbers of the K polarized channels constitute an information set, and the index numbers of the remaining NK polarized channels constitute a frozen set. When the number of 1s in the binary numbers corresponding to the index numbers of the plurality of polarized channels is the same, the order of the index numbers of the plurality of polarized channels is randomly arranged.

For example, when N=8 and K=2, the binary numbers corresponding to the index numbers {0,1,2,3,4,5,6,7} of the eight polarized channels are: 000, 001, 010, 011 , 100, 101, 110, 111, according to the number of 1 from the most to the least (ie, descending order) is 111, 011, 101, 110, 001, 010, 100, 000, then {7, 3} is the information set , {5,6,1,2,4,0} is a frozen set.

The foregoing method for obtaining the information set and the frozen set may be implemented by software or by hardware, which is not limited by the embodiment of the present invention.

It should be noted that, in the embodiment of the present invention, the information set and the frozen set may also be acquired in other manners. For example, it is also possible to predetermine the set of information and store it in memory, then obtain the set of information from the memory in step 210, and then determine the frozen set from the set of information. Both the information set and the frozen set can also be stored in memory such that in step 210 the information set and the frozen set can be retrieved directly from memory. The collection of information is obtained from the memory during the communication process, and since no calculation is required, the power consumption of the device can be greatly saved.

Therefore, the embodiment of the present invention is meaningful for an application scenario in which the device consumes a small amount of power, such as Massive Machine Type Communication (MMTC) and URLLC.

After step 220, the encoding device may output the sequence encoded by the polarization code, and the sequence encoded by the polarization code passes through the channel to the decoding device, and the decoding device performs decoding according to the information set and the fixed symbol sequence in the frozen set. And then output the decoded sequence to the receiving end. The channel in the embodiment of the present invention includes, but is not limited to, a communication channel and a storage channel, where the storage channel refers to an equivalent noisy channel in the storage process due to aging of the device and the like, causing some storage symbols to be destroyed.

In other words, embodiments of the present invention can be used in a communication system as well as in a storage system. For example, the encoding method of an embodiment of the present invention can be used to recover some of the errors in the storage system.

4 is a schematic block diagram of an encoding device 400 in accordance with an embodiment of the present invention. As shown in FIG. 4, the encoding device 400 includes an obtaining unit 410 and an encoding unit 420.

The obtaining unit 410 is configured to obtain an information set and a frozen set of a polarization code with a code length of N. The number of 1 in the binary number corresponding to the index number of any polarized channel in the information set is greater than or equal to any one of the frozen sets. The number of 1s in the binary number corresponding to the index number of the channel, wherein the Paging parameter of the 2i-1th polarized channel in the N polarized channels is greater than or equal to the Barth parameter of the 2i polarized channel, N The binary number corresponding to the index number of the nth polarized channel in the polarized channel is a binary representation of n-1,

N ∈ [1, N], N, i, n are positive integers.

The encoding unit 420 is configured to perform polarization code encoding according to the information set and the frozen set.

In the embodiment of the present invention, the information set and the frozen set are determined according to the number of 1 in the binary number corresponding to the index number of the polarized channel, and the information set and the frozen set do not change even if the channel changes. Therefore, the coding method of the embodiment of the present invention can reduce the complexity of coding by calculating the information set and the freeze set by calculating the Barth parameters of the respective polarization channels at each communication.

Optionally, the obtaining unit 410 may be specifically configured to:

Obtain an index number of N polarized channels;

According to the binary numbers corresponding to the index numbers of the N polarized channels, the index numbers of the K polarized channels corresponding to the K number of the largest number of 1 are selected from the index numbers of the N polarized channels, K polarizations The index number of the channel constitutes a set of information, and the index numbers of the remaining NK polarized channels in the index numbers of the N polarized channels constitute a frozen set, and K is a positive integer equal to or less than N.

Optionally, the encoding unit 420 is specifically configured to:

The sequence is subjected to polarization code encoding.

Optionally, the encoding device 400 may further include: a storage unit, configured to store the information set. Accordingly, the obtaining unit 410 may acquire a set of information from the storage unit and determine a frozen set according to the set of information. Alternatively, the storage unit may be further configured to store the information set and the frozen set, and the obtaining unit 410 may directly obtain the information set and the frozen set from the storage unit.

Optionally, the binary number corresponding to the index number of any polarized channel includes a log ₂ N number of bits.

Optionally, a known symbol is placed at a position corresponding to the index number of the polarized channel in the frozen set in the polarization code.

It should be noted that in the embodiment of the present invention, the obtaining unit 410 and the encoding unit 420 may be implemented by a processor, and the storage unit may be implemented by a memory. As shown in FIG. 5, the encoding according to an embodiment of the present invention The device can include a processor 510, a memory 520, and a bus system 530. The memory 520 can be used to store code and the like executed by the processor 510.

The various components in encoding device 500 are coupled together by a bus system 530, which may include, in addition to the data bus, a power bus, a control bus, and a status signal bus.

The encoding device 400 shown in FIG. 4 or the encoding device 500 shown in FIG. 5 can implement the various processes implemented by the encoding device in the foregoing method embodiments. To avoid repetition, details are not described herein again.

It should be noted that the above described method embodiments of the present invention may be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the foregoing method embodiment may be completed by an integrated logic circuit of hardware in a processor or an instruction in a form of software. The processor may be a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a Field Programmable Gate Array (FPGA), or the like. Programming logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps, and logical block diagrams disclosed in the embodiments of the present invention may be implemented or carried out. The general purpose processor may be a microprocessor or the processor or any conventional processor or the like. The steps of the method disclosed in the embodiments of the present invention may be directly implemented by the hardware decoding processor, or may be performed by a combination of hardware and software modules in the decoding processor. The software module can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like. The storage medium is located in the memory, and the processor reads the information in the memory and combines the hardware to complete the steps of the above method.

It is to be understood that the memory in the embodiments of the present invention may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory may be a read-only memory (ROM), a programmable read only memory (PROM), an erasable programmable read only memory (Erasable PROM, EPROM), or an electric Erase programmable read only memory (EEPROM) or flash memory. The volatile memory can be a Random Access Memory (RAM) that acts as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (Synchronous DRAM). SDRAM), double data rate synchronous dynamic random access memory (Double Data Rate SDRAM, DDR SDRAM), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM), Synchronous Connection Dynamic Random Access Memory (SDRAM), and Direct Memory Bus (DR RAM). It should be noted that the memories of the systems and methods described herein are intended to comprise, without being limited to, these and any other suitable types of memory.

Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the various examples described in connection with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both, for clarity of hardware and software. Interchangeability, the composition and steps of the various examples have been generally described in terms of function in the above description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods for implementing the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present invention.

A person skilled in the art can clearly understand that, for the convenience and brevity of the description, the specific working process of the system, the device and the unit described above can refer to the corresponding process in the foregoing method embodiment, and details are not described herein again.

In the several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the device embodiments described above are merely illustrative. For example, the division of cells is only a logical function division. In actual implementation, there may be another division manner. For example, multiple units or components may be combined or integrated. Go to another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, or an electrical, mechanical or other form of connection.

The units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the embodiments of the present invention.

In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.

Through the description of the above embodiments, those skilled in the art can clearly understand this The invention may be implemented in hardware, or in firmware, or a combination thereof. When implemented in software, the functions described above may be stored in or transmitted as one or more instructions or code on a computer readable medium. Computer readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one location to another. A storage medium may be any available media that can be accessed by a computer. By way of example and not limitation, computer readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage media or other magnetic storage device, or can be used for carrying or storing in the form of an instruction or data structure. The desired program code and any other medium that can be accessed by the computer. Also. Any connection may suitably be a computer readable medium. For example, if the software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave. Then, coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, wireless, and microwave are included in the fixing of the associated medium. As used in the present invention, a disk and a disc include a compact disc (CD), a laser disc, a compact disc, a digital versatile disc (DVD), a floppy disk, and a Blu-ray disc, wherein the disc is usually magnetically copied, and the disc is The laser is used to optically replicate the data. Combinations of the above should also be included within the scope of the computer readable media.

In conclusion, the above is only a preferred embodiment of the technical solution of the present invention, and is not intended to limit the scope of the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Claims

An encoding method, comprising:

Acquiring an information set and a frozen set of a polarization code having a code length N, wherein the number of 1s in the binary number corresponding to the index number of any polarization channel in the information set is greater than or equal to any polarization in the frozen set The number of 1s in the binary number corresponding to the index number of the channel, wherein the Paging parameter of the 2i-1th polarized channel in the N polarized channels is greater than or equal to the P&B parameter of the 2ith polarized channel, The binary number corresponding to the index number of the nth polarized channel in the N polarized channels is a binary representation of n-1,
N∈[1,N], N, i, n are positive integers;

Polarization code encoding is performed according to the information set and the frozen set.
The encoding method according to claim 1, wherein the acquiring the information set and the frozen set of the polarization code having the code length N comprises:

Obtaining an index number of the N polarized channels;

Determining, respectively, a binary number corresponding to an index number of the N polarized channels;

And selecting, according to the binary numbers corresponding to the index numbers of the N polarized channels, the index numbers of the K polarized channels corresponding to the K number of the largest number of Ks from the index numbers of the N polarized channels, The index numbers of the K polarized channels constitute the information set, and the index numbers of the remaining NK polarized channels in the index numbers of the N polarized channels constitute the frozen set, and K is a positive value equal to or less than N. Integer.
The encoding method according to claim 1 or 2, wherein the performing polarization code encoding according to the information set and the frozen set comprises:

Determining, according to the information set and the frozen set, a sequence of length N consisting of an information symbol and a fixed symbol, where the information symbol is placed in an index number of a polarized channel in the information set in the sequence Positionally, the fixed symbol is placed at a position corresponding to an index number of a polarized channel in the frozen set in the sequence;

The sequence is subjected to polarization code encoding.
The encoding method according to any one of claims 1 to 3, wherein the binary number comprises a log 2 N number of bits.
The encoding method according to any one of claims 1 to 4, wherein the fixed symbol is a symbol known at the encoding end and the decoding end.
An encoding device, comprising:

An acquiring unit, configured to obtain an information set and a frozen set of a polarization code with a code length N, where the number of 1 in the binary number corresponding to the index number of any polarized channel in the information set is greater than or equal to the frozen set The number of 1s in the binary number corresponding to the index number of any of the polarized channels, wherein the Paging parameter of the 2i-1th polarized channel of the N polarized channels is greater than or equal to the 2i polarized channel a P&B parameter, wherein the binary number corresponding to the index number of the nth polarized channel of the N polarized channels is a binary representation of n-1,
N∈[1,N], N, i, n are positive integers;

And a coding unit, configured to perform polarization code coding according to the information set and the frozen set.
The encoding device according to claim 6, wherein the obtaining unit is specifically configured to:

Obtaining an index number of the N polarized channels;

Determining, respectively, a binary number corresponding to an index number of the N polarized channels;

And selecting, according to the binary numbers corresponding to the index numbers of the N polarized channels, the index numbers of the K polarized channels corresponding to the K number of the largest number of Ks from the index numbers of the N polarized channels, The index numbers of the K polarized channels constitute the information set, and the index numbers of the remaining NK polarized channels in the index numbers of the N polarized channels constitute the frozen set, and K is a positive value equal to or less than N. Integer.
The encoding device according to claim 6 or 7, wherein the encoding unit is specifically configured to:

Determining, according to the information set and the frozen set, a sequence of length N consisting of an information symbol and a fixed symbol, where the information symbol is placed in an index number of a polarized channel in the information set in the sequence Positionally, the fixed symbol is placed at a position corresponding to an index number of a polarized channel in the frozen set in the sequence;

The sequence is subjected to polarization code encoding.
The encoding apparatus according to any one of claims 6 to 8, wherein the binary number includes a log 2 N number of bits.
The encoding apparatus according to any one of claims 6 to 9, wherein the fixed symbol is a symbol known at the encoding end and the decoding end.