Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Codeword constructing method for variable length Polar code

A construction method and a variable technology, applied in the field of communication channel coding, can solve problems such as increased decoding error probability and loss of communication system performance, and achieve the effects of reducing bit error rate, improving communication system performance, and reducing delay

Active Publication Date: 2017-08-01
BEIHANG UNIV
View PDF7 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although this method realizes the Polar code construction with variable code length, its decoding error probability is also increased, which seriously degrades the performance of the communication system

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Codeword constructing method for variable length Polar code
  • Codeword constructing method for variable length Polar code
  • Codeword constructing method for variable length Polar code

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0058] Example 1 : The construction process of the generator matrix of the Polar code with code length N=6.

[0059] Step 1: A binary bit sequence with code length N=6 is expressed as s={1,1,0}.

[0060] Step 2: according to the binary bit sequence that step 1 obtains, select the combination matrix that forms code length N=6:

[0061] According to 6=2 2 +2 1 = l 1 +l 2 , so the sub-matrix with a code length of 6 is obtained as G 4×4 ,G 2×2 .

[0062] Step 3: Combine the sub-matrices obtained in step 2 to form the generator matrix with code length N=6 through the Combo-Sum operation. The operation process is as follows:

[0063]

Embodiment 2

[0064] Example 2 : The process of constructing the generator matrix of the Polar code with code length N=11.

[0065] Step 1: A binary bit sequence with code length N=11 is expressed as s={1,0,1,1}.

[0066] Step 2: according to the binary bit sequence that step 1 obtains, select the combination matrix that forms code length N=11:

[0067] According to 11=2 3 +2 1 +2 0 = l 1 +l 2 +l 3 , the size of the submatrix is ​​l 1 =8, l 2 = 2, l 3 =1. Therefore, the sub-matrix with a code length of 11 is obtained as G 8×8 ,G 2×2 ,G 1×1 .

[0068] Step 3: Combine the sub-matrices obtained in step 2 to form the generator matrix with code length N=11 through the Combo-Sum operation. The operation process is as follows:

[0069]

[0070]

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a codeword constructing method for a variable length Polar code, which belongs to the field of communication. According to the invention, a long code generation matrix is constructed by extending the generation matrix of a short code. The method comprises the steps that based on integer binary representation, the code length is expressed as the sum of the powers of two; the value of each term constituting the sum form is used as the size of the sub-matrix which makes up a new generation matrix; and finally, the new generation matrix is constructed through combo-sum combination operation. Compared with a traditional variable length Polar code construction method, the method provided by the invention has the advantages that the puncturing delete operation is not needed; the coding complexity is reduced; delay is reduced; on the decoding end, the likelihood information for the unknown bit is known, which avoids the problems of a traditional method which uses prior knowledge to estimate the unknown bit likelihood information; the error bit rate of decoding is reduced; and the system performance is improved.

Description

technical field [0001] The invention belongs to the field of communication channel coding, and specifically refers to a code word construction method of a variable-length Polar code. Background technique [0002] Polar Codes, that is, polar codes, was developed in 2009 by E. A new type of channel coding is proposed. Polar codes are designed based on channel polarization (Channel Polarization), which is the first constructive coding scheme that can prove channel capacity through rigorous mathematical methods. However, polar codes are constructed by Kronecker powers. This construction method limits the code length of Polar codes, which is not convenient for Polar codes to be used in practical systems. The original method can only construct a code length of 2 n Polar codes for (n=1,2,...). Although Polar codes of other code lengths can be constructed by other polar cores such as BCH code cores, the code length of Polar codes constructed by this method is still limited to t...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H03M13/13H04L1/00
CPCH03M13/13H04L1/0057
Inventor 刘荣科冯宝平王闰昕赵岭
Owner BEIHANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com