CN110233698A - Coding and interpretation method, sending device, receiving device, the medium of polarization code - Google Patents

Coding and interpretation method, sending device, receiving device, the medium of polarization code Download PDF

Info

Publication number
CN110233698A
CN110233698A CN201810183937.5A CN201810183937A CN110233698A CN 110233698 A CN110233698 A CN 110233698A CN 201810183937 A CN201810183937 A CN 201810183937A CN 110233698 A CN110233698 A CN 110233698A
Authority
CN
China
Prior art keywords
index
polarization code
bit
row
row weight
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
Application number
CN201810183937.5A
Other languages
Chinese (zh)
Other versions
CN110233698B (en
Inventor
徐旻子
樊婷婷
徐志昆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Spreadtrum Hi Tech Communications Technology Co Ltd
Original Assignee
Beijing Spreadtrum Hi Tech Communications Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Spreadtrum Hi Tech Communications Technology Co Ltd filed Critical Beijing Spreadtrum Hi Tech Communications Technology Co Ltd
Priority to CN201810183937.5A priority Critical patent/CN110233698B/en
Publication of CN110233698A publication Critical patent/CN110233698A/en
Application granted granted Critical
Publication of CN110233698B publication Critical patent/CN110233698B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13Linear codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0057Block codes
    • H04L1/0058Block-coded modulation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0064Concatenated codes

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

A kind of coding and interpretation method, sending device, receiving device, medium of polarization code, the coding method of the polarization code include: the row weight for obtaining polarization code generator matrix, and calculating the polarization code generator matrix;Row weight based on the polarization code generator matrix, determines the corresponding position of CRC bit and information bit in uncoded bit sequence;The CRC bit and the information bit are placed on the corresponding position in the uncoded bit sequence, generate uncoded bit sequence;By the uncoded bit sequence input polarization code coder, the code word of polarization code is generated.Using above scheme, the number of low weight code word in the polarization code generated can be made less, there is preferable error-correcting performance in the case where high s/n ratio, to improve performance of the CRC cascade polarization code under high s/n ratio.

Description

Coding and interpretation method, sending device, receiving device, the medium of polarization code
Technical field
The present embodiments relate to the coding and interpretation method of communication system more particularly to a kind of polarization code, sending device, Receiving device, medium.
Background technique
Since with lower encoding and decoding complexity and good error-correcting performance, polarization code is probably used for 5G system In short packet data transmitting scene.
The encoding scheme of existing cyclic redundancy check (Cyclic Redundancy Check, CRC) cascade polarization code In, it is calculated first using Gaussian approximation building method or polarization weights (Polarization Weight, PW) building method N number of Then the reliability of the corresponding subchannel of bit selects the index of the highest preceding K+X position of reliability, as set A.For The source sequence of K bit, i.e. information bit are first sent to CRC encoder, generate the CRC code of X bit, i.e. CRC ratio It is special.CRC code is attached to behind source sequence again, is placed on the position of set A, then input polarization code coder, generates pole Change code.The cascade polarization code of generation is modulated again, generates modulation symbol.Modulation symbol is sent into demodulation after channel adds and makes an uproar Information after demodulation is sent into CRC and serially offsets list (Successive Cancellation List, SCL) decoder by device It is decoded.
The scheme of existing CRC cascade polarization code (CRC-polar), the weight spectrum of the cascade polarization code constructed without Optimization, the number of low weight code word is more, to influence to cascade error-correcting performance of the polarization code under high s/n ratio, leads to CRC grades It is poor to join performance of the polarization code under high s/n ratio.
Summary of the invention
The technical issues of embodiment of the present invention solves is the performance for how improving CRC cascade polarization code under high s/n ratio.
In order to solve the above technical problems, the embodiment of the present invention provides a kind of coding method of polarization code, the coding method It include: the row weight for obtaining polarization code generator matrix, and calculating the polarization code generator matrix;Based on the polarization code generator matrix Row weight, determine the corresponding position of CRC bit and information bit in uncoded bit sequence;By the CRC bit and described Information bit is placed on the corresponding position in the uncoded bit sequence, generates uncoded bit sequence;It will be described uncoded Bit sequence input polarization code coder, generates the code word of polarization code.
Optionally, before placing the CRC bit and the information bit, further includes: determine in the information bit Participate in generating the target bits of the CRC bit;It participates in generating described in the target bits generation of the CRC bit based on described CRC bit.
Optionally, the target bits for participating in generating the CRC bit in the determination information bit include: according to such as Lower formula determines the rope of corresponding position of the target bits for participating in generating the CRC bit in the uncoded bit sequence Draw, as set C:
C={ i:Wi≤mWmin,i∈B};
Wherein: set B is the index of corresponding position of the information bit in the uncoded bit sequence, WminFor The corresponding minimum row weight of set B,N is the line number of the polarization code generator matrix, WiIt is described The row weight of i-th row in polarization code generator matrix.
Optionally, the row for calculating the polarization code generator matrix includes: to calculate the polarization according to the following formula again The row weight of code the i-th row of generator matrix:
Wi=2B(i)
Wherein: WiFor the row weight of the i-th row in the polarization code generator matrix, B (i) is the corresponding binary coding of numerical value i The number of middle code word 1,1≤i≤N, N are the line number of the polarization code generator matrix.
Optionally, the determining CRC bit and corresponding position of the information bit in uncoded bit sequence include: in institute It states in polarization code generator matrix, selects the maximum preceding K+X row of row weight, using the index of the K+X row as set A, wherein K is institute The number of information bit is stated, X is the number of the CRC bit;By the index for the row that row weight in the set A is N and row weight It is correspondence position of the CRC bit in uncoded bit sequence that the index of the smallest preceding X-1 row, which is used as set D, the set D, The index set;Regarding other indexes that the set D is removed in the set A as set B, the set B is the information bit The index of corresponding position in uncoded bit sequence.
Optionally, the determining CRC bit and corresponding position of the information bit in uncoded bit sequence include: to be based on Gaussian approximation building method or PW building method generate reliable degree series;In the reliable degree series, reliability highest is selected Preceding K+X position, using the index of the K+X position as set A ', wherein K is the number of the information bit, and X is institute State the number of CRC bit;From other indexes for removing the set A ' in set { 0,1,2 ..., N-1 }, corresponding row weight is selected The corresponding minimum row weight of the simultaneously greater than described set A ' of maximum and the index of the highest position of reliability, and replace the set A ' In the corresponding index of minimum row weight, generate set A;The index for the row that row weight in the set A is N and reliability is minimum X-1 position index be used as set D, the set D be corresponding position of the CRC bit in uncoded bit sequence Index;Regarding other indexes that the set D is removed in the set A as set B, the set B is that the information bit exists The index of corresponding position in uncoded bit sequence.
Optionally, the corresponding minimum row weight of the set A ' is a line or multirow;When the corresponding minimum of the set A ' When row weight is multirow, select corresponding row weight is maximum to be simultaneously greater than the corresponding minimum row weight of A ' and the highest multiple positions of reliability Index, replace the corresponding index of minimum row weight in the set A ', generate set A.
Optionally, the determining CRC bit and corresponding position of the information bit in uncoded bit sequence include: to be based on Gaussian approximation building method or PW building method generate reliable degree series;In the reliable degree series, reliability highest is selected Preceding K+X position, using the index of the position K+X as set A ', wherein K is the number of the information bit, and X is described The number of CRC bit;By the index of X-1 minimum position of the index for the row that row weight in the set A ' is N and reliability As set D, the set D is the index of corresponding position of the CRC bit in uncoded bit sequence;By the set It is the information bit in uncoded bit sequence that other indexes in A ' except the set D, which are used as set B, the set B, Corresponding position index.
The embodiment of the present invention provides a kind of interpretation method of polarization code, comprising: receives the code word of polarization code, the polarization code Code word generated using the coding method of polarization code described in any of the above-described kind;The polarization code is handled based on decoding algorithm Code word.
Optionally, the decoding algorithm includes any of the following: OSD algorithm, SCL algorithm.
The embodiment of the present invention provides a kind of sending device, comprising: and computing unit is suitable for obtaining polarization code generator matrix, and Calculate the row weight of the polarization code generator matrix;First determination unit, suitable for the row weight based on the polarization code generator matrix, really Determine the corresponding position of CRC bit and information bit in uncoded bit sequence;First generation unit is suitable for the CRC ratio The special and described information bit is placed on the corresponding position in the uncoded bit sequence, generates uncoded bit sequence;Second Generation unit is suitable for the uncoded bit sequence input polarization code coder generating the code word of polarization code.
Optionally, the sending device further include: the second determination unit is adapted to determine that and participates in generating in the information bit The target bits of the CRC bit;Third generation unit, suitable for based on the target bits for participating in generating the CRC bit Generate the CRC bit.
Optionally, second determination unit, suitable for determining the target for participating in generating the CRC bit according to the following formula The index of corresponding position of the bit in the uncoded bit sequence, as set C:
C={ i:Wi≤mWmin,i∈B};
Wherein: set B is the index of corresponding position of the information bit in the uncoded bit sequence, WminFor The corresponding minimum row weight of set B,N is the line number of the polarization code generator matrix, WiIt is described The row weight of i-th row in polarization code generator matrix.
Optionally, the computing unit, suitable for calculating the row of i-th row of polarization code generator matrix according to the following formula Weight:
Wi=2B(i)
Wherein: WiFor the row weight of the i-th row in the polarization code generator matrix, B (i) is the corresponding binary coding of numerical value i The number of middle code word 1,1≤i≤N, N are the line number of the polarization code generator matrix.
Optionally, first determination unit includes: first choice subelement, is suitable in the polarization code generator matrix In, the maximum preceding K+X row of row weight is selected, and using the index of the K+X row as set A, wherein K is of the information bit Number, X are the number of the CRC bit;First determine subelement, suitable for by row weight in the set A for N row index and It is pair of the CRC bit in uncoded bit sequence that the index of the smallest preceding X-1 row of row weight, which is used as set D, the set D, Answer the index of position;Second determines subelement, suitable for regarding other indexes for removing the set D in the set A as set B, The set B is the index of corresponding position of the information bit in uncoded bit sequence.
Optionally, first determination unit includes: generation subelement, is suitable for being based on Gaussian approximation building method or PW structure It makes method and generates reliable degree series;Second selection subelement, is suitable in the reliable degree series, before selecting reliability highest K+X position, and using the index of the K+X position as set A ', wherein K is the number of the information bit, and X is described The number of CRC bit;Third selects subelement, is suitable for other indexes from set { 0,1,2 ..., N-1 } except the set A ' In, select the maximum rope for being simultaneously greater than the corresponding minimum row weight of the set A ' and the highest position of reliability of corresponding row weight Draw, and replace the corresponding index of the weight of the minimum row in the set A ', generates set A;Third determines subelement, and being suitable for will be described Row weight is as set D, the set D in set A for the index of X-1 minimum position of the index and reliability of the row of N The index of corresponding position of the CRC bit in uncoded bit sequence;4th determines subelement, is suitable for the set A In except the set D other index be used as set B, the set B be the information bit in uncoded bit sequence The index of corresponding position.
Optionally, the corresponding minimum row weight of the set A ' is a line or multirow;When the corresponding minimum of the set A ' When row weight is multirow, the third selects subelement, and it is corresponding to be suitably selected for the corresponding maximum simultaneously greater than described set A ' of row weight Minimum row weight and the highest multiple positions of reliability index, replace the corresponding index of minimum row weight in the set A ', Generate set A.
Optionally, first determination unit includes: generation subelement, is suitable for being based on Gaussian approximation building method or PW structure It makes method and generates reliable degree series;;4th selection subelement, is suitable in the reliable degree series, selects reliability highest Preceding K+X position, and using the index of the K+X position as set A ', wherein K is the number of the information bit, and X is institute State the number of CRC bit;5th determines subelement, is suitable for the index and reliability of the row that row weight in the set A ' is N It is correspondence of the CRC bit in uncoded bit sequence that the index of X-1 minimum position, which is used as set D, the set D, The index of position;6th determines subelement, is suitable for regarding other indexes for removing the set D in the set A ' as set B, institute State the index that set B is corresponding position of the information bit in uncoded bit sequence.
The embodiment of the present invention provides a kind of receiving device, comprising: receiving unit, it is described suitable for receiving the code word of polarization code The code word of polarization code is generated using the coding method of polarization code described in any of the above-described kind;Processing unit is suitable for based on decoding The code word of polarization code described in algorithm process.
Optionally, the decoding algorithm includes any of the following: OSD algorithm, SCL algorithm.
The embodiment of the present invention provides a kind of computer readable storage medium, and computer readable storage medium is non-volatile deposits Storage media or non-transitory storage media, are stored thereon with computer instruction, and the computer instruction executes any of the above-described when running The step of interpretation method of the coding method of kind of the polarization code or polarization code.
The embodiment of the present invention provides a kind of sending device, including memory and processor, and being stored on the memory can The computer instruction run on the processor, the processor execute any of the above-described kind of institute when running the computer instruction The step of coding method for the polarization code stated.
The embodiment of the present invention provides a kind of receiving device, including memory and processor, and being stored on the memory can The computer instruction run on the processor, the processor execute any of the above-described kind of institute when running the computer instruction The step of interpretation method for the polarization code stated.
Compared with prior art, the technical solution of the embodiment of the present invention has the advantages that
The embodiment of the present invention is heavy by the row for calculating polarization code generator matrix, and the row weight based on polarization code generator matrix is true Determine the corresponding position of CRC bit and information bit in uncoded bit sequence, is then based on corresponding position, placement information bit With CRC bit, and the code word of polarization code is generated, the number of low weight code word in the polarization code generated can be made less, in height There is preferable error-correcting performance, to improve performance of the CRC cascade polarization code under high s/n ratio in the case where signal-to-noise ratio.
Further, the mesh of CRC bit is generated by combined optimization CRC bit, the corresponding position of information bit and participation Bit is marked, the number of low weight code word in the polarization code generated can be made to be further reduced, had in the case where high s/n ratio There is preferable error-correcting performance, to further increase performance of the CRC cascade polarization code under high s/n ratio.
Detailed description of the invention
Fig. 1 is the cataloged procedure of existing CRC cascade polarization code and the schematic diagram of decoding process;
Fig. 2 is a kind of flow chart of the coding method of polarization code provided in an embodiment of the present invention;
Fig. 3 is a kind of flow chart of the interpretation method of polarization code provided in an embodiment of the present invention;
Fig. 4 is a kind of cataloged procedure of polarization code provided in an embodiment of the present invention and the schematic diagram of decoding process;
Fig. 5 is a kind of structural schematic diagram of sending device provided in an embodiment of the present invention;
Fig. 6 is a kind of structural schematic diagram of receiving device provided in an embodiment of the present invention.
Specific embodiment
Referring to Fig. 1, the cataloged procedure and decoding process of existing CRC cascade polarization code be may include steps of:
Transmitting terminal executes step S101~step S104 and generates cascade polarization code and send:
Step S101 is based on reliability, determines the position of information bit and CRC bit.
Step S102 is based on the information bit, generates CRC bit by CRC encoder.
Step S103 generates CRC by Polar encoder and cascades polarization code.
Step S104 is sent after modulating the cascade polarization code of generation.
Modulated signal receives receiving end after wireless channel transmission, and the receiving end executes step S105~step S106:
Step S105 demodulates the signal received.
Step S106 is decoded by SCL decoder to signal is received.
The scheme of existing CRC-polar is determined the position of information bit and CRC bit based on reliability, constructed The weight spectrum of polarization code is cascaded without optimization, the number of low weight code word is more, to influence to cascade polarization code in high noise Error-correcting performance than under causes performance of the CRC cascade polarization code under high s/n ratio poor.
The embodiment of the present invention is heavy by the row for calculating polarization code generator matrix, and the row weight based on polarization code generator matrix is true Determine the corresponding position of CRC bit and information bit in uncoded bit sequence, is then based on corresponding position, placement information bit With CRC bit, and the code word of polarization code is generated, the number of low weight code word in the polarization code generated can be made less, in height There is preferable error-correcting performance, to improve performance of the CRC cascade polarization code under high s/n ratio in the case where signal-to-noise ratio.
It is understandable to enable above-mentioned purpose of the invention, feature and beneficial effect to become apparent, with reference to the accompanying drawing to this The specific embodiment of invention is described in detail.
Referring to fig. 2, it the embodiment of the invention provides a kind of coding method of polarization code, may include steps of:
Step S201 obtains polarization code generator matrix, and calculates the row weight of the polarization code generator matrix.
In practical applications, the encoding scheme of existing CRC cascade polarization code, using Gaussian approximation building method or PW structure It makes method and calculates reliability, then select the highest preceding K+X position of reliability as CRC bit and information bit in the pole Change the corresponding position in code generator matrix, the weight spectrum of the concatenated code constructed without optimization, the number of low weight code word compared with It is more, to influence to cascade error-correcting performance of the polarization code under high s/n ratio, lead to property of the CRC cascade polarization code under high s/n ratio It can be poor.
The embodiment of the present invention is based on the polarization code generator matrix by calculating the row weight of the polarization code generator matrix Row weight, determine the corresponding position of CRC bit and information bit in the uncoded bit sequence, it is possible to reduce low weight code The number of word.
In specific implementation, the polarization code generator matrix can be two-dimensional matrix, for example, the polarization code generator matrix The two-dimensional matrix that can be arranged for N row, N, wherein N is positive integer.
In an embodiment of the present invention, the row weight of i-th row of polarization code generator matrix is calculated according to the following formula:
Wi=2B(i)
Wherein, i is line number index, WiFor the row weight of the i-th row in the polarization code generator matrix, B (i) corresponds to for numerical value i Binary coding in code word 1 number, 1≤i≤N, N be the polarization code generator matrix line number.
Step S202, the row weight based on the polarization code generator matrix, determines CRC bit and information bit in uncoded ratio Corresponding position in special sequence.
It in specific implementation, can be based on the row of the polarization code generator matrix in order to reduce the number of low weight code word Weight, determines the corresponding position of CRC bit and information bit in the uncoded bit sequence.
In specific implementation, it can be based only upon the row weight of the polarization code generator matrix, determine CRC bit and information bit Corresponding position in uncoded bit sequence, can also be based on the row weight and reliability of the polarization code generator matrix, joint Determine the corresponding position of CRC bit and information bit in uncoded bit sequence.
In an embodiment of the present invention, the correspondence of the determining CRC bit and information bit in uncoded bit sequence Position includes: the maximum preceding K+X row of row weight to be selected, using the index of the K+X row as collection in the polarization code generator matrix A is closed, wherein K is the number of the information bit, and X is the number of the CRC bit;The row for being N by row weight in the set A It is the CRC bit in uncoded bit sequence that the index of index and the smallest preceding X-1 row of row weight, which is used as set D, the set D, The index of corresponding position in column;It is as set B, the set B by other indexes for removing the set D in the set A The index of corresponding position of the information bit in uncoded bit sequence.
In specific implementation, it is weighed when transmitting terminal is based only upon the capable of the polarization code generator matrix, does not consider the polarization code The reliability of generator matrix, when determining the corresponding position of CRC bit and information bit in the uncoded bit sequence, in order to Preferable decoding performance is obtained, receiving end can be using the hierarchical statistics decoding of the higher near-maximum-likelihood decoding of complexity (Ordered Statistic Decoding, OSD) algorithm is decoded.
In specific implementation, since the complexity of OSD algorithm is higher, receiving end may use relatively simple SCL algorithm Decoding.It, can be based on the row weight and reliability of the polarization code generator matrix, joint when receiving end is decoded using SCL algorithm Determine the corresponding position of CRC bit and information bit in the uncoded bit sequence.
In an embodiment of the present invention, the correspondence position of the determining CRC bit and information bit in uncoded bit sequence Set includes: to generate reliable degree series based on Gaussian approximation building method or PW building method;In the reliable degree series, selection The highest preceding K+X position of reliability, using the index of the K+X position as set A ', wherein K is the information bit Number, X are the number of the CRC bit;From other indexes in set { 0,1,2 ..., N-1 } except the set A ', choosing The maximum index for being simultaneously greater than the corresponding minimum row weight of the set A ' and the highest position of reliability of corresponding row weight is selected, and is replaced The corresponding index of minimum row weight in the set A ' is changed, set A is generated;
Using the index for the row that row weight in the set A is N and the index of the smallest X-1 position of reliability as set D, the set D are the index of corresponding position of the CRC bit in uncoded bit sequence;Institute will be removed in the set A It is correspondence position of the information bit in uncoded bit sequence that other indexes for stating set D, which are used as set B, the set B, The index set.
In specific implementation, the corresponding minimum row of the set A ' can be a line again, or multirow (two rows with On).
In an embodiment of the present invention, when the corresponding minimum row weight of the set A ' is multirow, corresponding row weight is selected The corresponding minimum row weight of the simultaneously greater than described set A ' of maximum and the index of the highest multiple positions of reliability, replace the set The corresponding index of minimum row weight in A ', generates set A.For example, when the corresponding minimum row weight of the set A ' is two row, choosing Select the heavy rope that is maximum, being simultaneously greater than the corresponding minimum row weight of the set A ' and highest two positions of reliability of corresponding row Draw, replaces corresponding two indexes of minimum row weight in the set A ', generate set A.
In an embodiment of the present invention, the correspondence of the determining CRC bit and information bit in uncoded bit sequence Position includes: to generate reliable degree series based on Gaussian approximation building method or PW building method;In the reliable degree series, choosing The highest preceding K+X position of reliability is selected, using the index of the position K+X as set A ', wherein K is the information bit Number, X are the number of the CRC bit;By the X-1 that the index for the row that row weight in the set A ' is N and reliability are minimum It is the rope of corresponding position of the CRC bit in uncoded bit sequence that the index of a position, which is used as set D, the set D, Draw;Regarding other indexes that the set D is removed in the set A ' as set B, the set B is that the information bit is not being compiled The index of corresponding position in code bit sequence.
The CRC bit and the information bit are placed on the correspondence in the uncoded bit sequence by step S203 Position generates uncoded bit sequence.
In specific implementation, when determining the CRC bit and the information bit in the uncoded bit sequence It, can be based on the identified CRC bit and the information bit in the uncoded bit sequence after corresponding position The index of corresponding position places the CRC bit and the information bit into the uncoded bit sequence.For example, being based on Corresponding position of the information bit in uncoded bit sequence, places the information bit;Based on the CRC bit not Corresponding position in sequences of code bits places the CRC bit;The information bit will be removed in the uncoded bit sequence With the other positions of the CRC bit, bit 0 is placed.
In specific implementation, in order to further decrease the number of low weight code word, it is also an option that partial information bit is joined With the generation CRC bit.
In embodiments of the present invention, before placing the CRC bit and the information bit, the letter can also be determined The target bits for participating in generating the CRC bit in bit are ceased, it is raw based on the target bits for participating in generating the CRC bit At the CRC bit.
In specific implementation, it can be determined again based on the row of the polarization code generator matrix and participate in life in the information bit At the target bits of the CRC bit, it can also be combined based on the row weight and reliability of the polarization code generator matrix and determine institute State the target bits for participating in generating the CRC bit in information bit.
It in specific implementation, can be from the index of corresponding position of the information bit in the uncoded bit sequence In, selection row is less than or equal to the index of the row of m times of minimum row weight again, as the information bit for participating in generating the CRC bit The index of position determines that the target bits for participating in generating the CRC bit generate square in the polarization code according to the following formula The index of corresponding position in battle array, as set C:
C={ i:Wi≤mWmin,i∈B}
Wherein, set B is the index of corresponding position of the information bit in the uncoded bit sequence, WminFor The corresponding minimum row weight of set B,N is the line number of the polarization code generator matrix, WiIt is described The row weight of i-th row in polarization code generator matrix.
In specific implementation, the set B can be generated using method described in above-described embodiment, no longer superfluous herein It states.
The uncoded bit sequence input polarization code coder is generated the code word of polarization code by step S204.
In specific implementation, the uncoded bit sequence input polarization code can be encoded using existing implementation Device generates the code word of polarization code, i.e. CRC cascades the code word of polarization code, and details are not described herein again.
To more fully understand those skilled in the art and implementing the present invention, the embodiment of the present invention is directed to actual scene, mentions It has supplied to generate the detailed step of polarization code using the coding method of polarization code in above-described embodiment, as follows:
In embodiment 1, the line number N=128 of polarization code generator matrix, code rate R=2/3, the number of information bit are 85, The number of CRC bit is 8, and the multinomial of generation is 0x131.
Detailed step and the relevant parameter for generating polarization code are as follows:
(1) the heavy W of row of 128 rows, 128 the i-th rows of polarization code generator matrix for arranging (i.e. 128 × 128) is calculatediCalculation formula is such as Under:
Wi=2B(i)
Wherein, B (i) is the number of code word 1 in the corresponding binary coding of numerical value i, 1≤i≤N.
According to row weight calculated, choosing minimum row weight is 8.
(2) according to row weight calculated, the index of maximum 93 row of row weight is selected, as set A={ 7 11 13 14 15 19 21 22 23 26 27 29 30 31 39 42 43 44 45 46 47 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 67 69 70 71 73 74 75 76 77 78 79 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127}。
(3) it selects the 127th index as the bit position CRC, the index of the smallest 7 row of row weight in set A is selected to make For the remaining bit position CRC, as set D, i.e. set D={ 22 26 42 44 49 50 52 127 }.Set D is CRC The index of corresponding position of the bit in uncoded bit sequence.
Using the index of 85 row remaining in set A as set B, i.e. set B={ 7 11 13 14 15 19 21 23 27 29 30 31 39 43 45 46 47 51 53 54 55 56 57 58 59 60 61 62 63 67 69 70 71 73 74 75 76 77 78 79 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126}.The set B is corresponding position of the information bit in uncoded bit sequence Index.
(4) it selects row to be less than or equal to the index of the row of 16 (m=2, minimum row weight=8) again from set B, is given birth to as participation At the information bit of CRC bit, as set C, i.e. set C={ 7 11 13 14 15 19 21 23 27 29 30 39 43 45 46 51 53 54 56 57 58 60 67 69 70 71 73 74 75 76 77 78 81 82 83 84 85 86 88 89 90 92 97 98 99 100 101 102 104 105 106 108 112 113 114 116 120}。
(5) it is directed to the source sequence of 85 bits, i.e. information bit, it is corresponding that source sequence is placed on set B first On position, then according to the corresponding information bit of set C, generates CRC sequence and be placed on the corresponding position set D, will not compile Other 35 positions of code bit sequence, which are put into, freezes bit 0.The long sequence of 128 bits of generation is finally sent into polarization code Encoder generates the code word of polarization code.
For the actual scene in embodiment 1, the coding method of polarization code described in embodiment 1, the pole of generation are utilized The number for changing low weight code word in code is 112, and utilizes existing CRC8-polar implementation, low heavy in the polarization code of generation The number for measuring code word is 525, therefore the coding method of polarization code provided in an embodiment of the present invention, can be made in the polarization code generated The number of low weight code word is less, has preferable error-correcting performance in the case where high s/n ratio, to improve CRC cascade polarization Performance of the code under high s/n ratio.
In specific implementation, the polarization code constructed for embodiment 1, can be according to the code of its minimum weight and minimum weight Word number estimates the joint circle P of frame error rate performance under maximum-likelihood decodingB, calculation formula is as follows:
Wherein, AdIndicate that codewords weight is the code word number of d, R indicates code rate, Eb/N0For signal-to-noise ratio, function
Under in the case where high s/n ratio, the minimum weight codewords dminWith its number of codewords AdminValue to PBValue rise decisive work With, therefore can estimate to obtain
Further, for the actual scene in embodiment 1, when the number of CRC bit is 16, the multinomial of generation is 0x18005.Using existing CRC16-polar implementation, the number of low weight code word is 211 in the polarization code of generation;Benefit With the coding method of polarization code described in embodiment 1, the number of low weight code word is 4 in the polarization code of generation.
Therefore the coding method of the polarization code of the offer of embodiment 1, of low weight code word in the polarization code generated can be made Number is less, has preferable error-correcting performance in the case where high s/n ratio, to improve CRC cascade polarization code under high s/n ratio Performance.
The polarization code generated using the coding method of polarization code described in embodiment 1, is based only upon the pole in transmitting terminal The row weight for changing code generator matrix, does not consider the reliability of the polarization code generator matrix, determines CRC bit and information bit in institute State the corresponding position in polarization code generator matrix.In order to obtain preferable decoding performance, receiving end needs higher using complexity Near-maximum-likelihood decoding OSD decoding algorithm, cause the system complexity of receiving end higher.
It in specific implementation, can be raw based on polarization code in order to neutralize the cascade code performance after decoding complexity and optimization At row matrix weight and reliability, the corresponding position of CRC bit and information bit in the uncoded bit sequence is determined.
In example 2, the line number N=128 of polarization code generator matrix, code rate R=2/3 or 1/3, of information bit Number is that the number of 85, CRC bit is 8, and the multinomial of generation is 0x131.
The detailed step for generating polarization code is as follows:
(1) reliable degree series are generated using Gaussian approximation building method.
(2) index for selecting highest 93 positions of reliability, as set A '.
(3) will row weight is N in set A ' row index and the minimum X-1 position of reliability index as gathering D, set D are the index of corresponding position of the CRC bit in uncoded bit sequence.
(4) regarding other indexes in set A ' except the set D as set B, set B is information bit in uncoded ratio The index of corresponding position in special sequence.
(5) it selects row to be less than or equal to the index of the row of 16 (m=2, minimum row weight=8) again from set B, is given birth to as participation At the index of the information bit of CRC bit, as set C.
(6) it is directed to the source sequence of 85 bits, i.e. information bit, it is corresponding that source sequence is placed on set B first On position, then according to the corresponding information bit of set C, generates CRC sequence and be placed on the corresponding position set D, will not compile Other 35 positions are put into bit 0 as freezing position in code bit sequence.Finally the long sequence of 128 bits of generation is sent into Polarize code coder, generates the code word of polarization code.
The coding of polarization code described in embodiment 2 is utilized when code rate is 2/3 for the actual scene in embodiment 2 Method, the number of low weight code word is 365 in the polarization code of generation, and utilizes existing CRC8-polar scheme, the pole of generation The number for changing low weight code word in code is 525.
It is low heavy in the polarization code of generation using the coding method of polarization code described in embodiment 2 when code rate is 1/3 The number for measuring code word is 25, and utilizes existing CRC8-polar scheme, and the number of low weight code word is in the polarization code of generation 52。
Therefore the coding method of the polarization code of the offer of embodiment 2, of low weight code word in the polarization code generated can be made Number is less, has preferable error-correcting performance in the case where high s/n ratio, to improve CRC cascade polarization code under high s/n ratio Performance.
In order to more fully understand those skilled in the art, the beneficial effect of the embodiment of the present invention, the embodiment of the present invention are provided The polarization code generated using distinct methods, the simulation result of the frame error rate size under different scenes are as follows:
When receiving end decodes polarization code using SCL algorithm, the polarization code generated using distinct methods is corresponding The sequence of frame error rate from small to large is successively are as follows: and the cascade polarization code that cascade polarization code < existing scheme that embodiment 2 generates generates < The cascade polarization code that embodiment 1 generates.
When receiving end decodes polarization code using OSD algorithm, the polarization code generated using distinct methods is corresponding The sequence of frame error rate from small to large is successively are as follows: the cascade polarization code that cascade polarization code < embodiment 2 that embodiment 1 generates generates < existing There is the cascade polarization code of schemes generation.
As can be seen that no matter receiving end uses SCL algorithm or OSD algorithm, using polarization provided in an embodiment of the present invention The polarization code that the coding method of code generates, frame error rate can be less than the cascade polarization code that existing scheme generates, therefore the present invention is real The polarization code that the coding method of the polarization code of example offer generates is applied, there is preferable error-correcting performance in the case where high s/n ratio.
It in specific implementation, can since the different decoding algorithm in receiving end corresponds to different performances, therefore in a particular application According to the actual situation, to select reasonable decoding algorithm, to obtain preferable performance.
In specific implementation, in order to further enhance performance, the number of low weight code word is reduced, it can also be to embodiment 2 It is advanced optimized, the row re-optimization set A ' based on polarization generator matrix.
In embodiment 3, the line number N=128 of polarization code generator matrix, code rate R=2/3 or 1/3, of information bit Number K is that the number X of 85, CRC bit is 8, and the multinomial of generation is 0x131.
Detailed step and the relevant parameter for generating polarization code are as follows:
(1) reliable degree series are generated using Gaussian approximation construction, and selects the index of highest 93 positions of reliability, made For set A ', i.e. set A '={ 15 23 25 26 27 28 29 30 31 37 38 39 41 42 43 44 45 46 47 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 67 69 70 71 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127}。
(2) from set { 0,1,2 ..., N-1 }/set A ', i.e., maximum, right simultaneously except corresponding row weight is selected in set A ' The great corresponding minimum row weight in set A ' of the row answered and the index { 19,35 } of the corresponding highest bit position of reliability, And the corresponding index { 80,96 } in bit position of minimum row weight in set A ' is replaced, and regard replaced set as set A, That is set A={ 15 19 23 25 26 27 28 29 30 31 35 37 38 39 41 42 43 44 45 46 47 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 67 69 70 71 73 74 75 76 77 78 79 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127}。
(3) selecting row weight in set A is the correspondence indexed as CRC bit in uncoded bit sequence of a line of N The index of position selects the index for the X-1 position that reliability is minimum in set A as remaining CRC bit in uncoded ratio The index of corresponding position in special sequence, as set D, i.e. set D={ 25 26 28 35 37 38 41 127 }.Set D For the index of corresponding position of the CRC bit in uncoded bit sequence.
The index of remaining K position is used as set B, i.e. set B={ 15 19 23 27 29 30 31 39 in set A 42 43 44 45 46 47 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 67 69 70 71 73 74 75 76 77 78 79 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126}.Set B is the rope of corresponding position of the information bit in uncoded bit sequence Draw.
(4) index of the row again less than or equal to the row of 16 (2 times of minimum row weights) is selected from set B, generates CRC as participation The corresponding index of the information bit of bit, as set C, i.e. set C={ 15 19 23 27 29 30 31 39 42 43 44 45 46 47 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 67 69 70 71 73 74 75 76 77 78 79 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126}。
(5) it is directed to the source sequence of K bit, i.e. information bit, source sequence is placed on the corresponding position set B first It sets, then according to the corresponding information bit of set C, generates CRC sequence and be placed on the corresponding position set D, it will be uncoded Other N-K-X position is put into bit 0 as freezing position in bit sequence.Finally the long sequence of N number of bit of generation is sent into Polarize code coder, generates the code word of polarization code.
The coding of polarization code described in embodiment 3 is utilized when code rate is 2/3 for the actual scene in embodiment 3 Method, the number of low weight code word is 365 in the polarization code of generation, and utilizes existing CRC8-polar scheme, the pole of generation The number for changing low weight code word in code is 525.
It is low heavy in the polarization code of generation using the coding method of polarization code described in embodiment 3 when code rate is 2/3 The number for measuring code word is 25, and utilizes existing CRC8-polar scheme, and the number of low weight code word is in the polarization code of generation 52。
Therefore the coding method of the polarization code of the offer of embodiment 3, of low weight code word in the polarization code generated can be made Number is less, has preferable error-correcting performance in the case where high s/n ratio, to improve CRC cascade polarization code under high s/n ratio Performance.
It is understood that the set B is using the determining information bit of distinct methods in the uncoded ratio The index of corresponding position in special sequence, can also be defined as different titles, and above-mentioned naming method is not constituted to the present invention The limitation of protection scope.
It is understood that the set D is using the determining CRC bit of distinct methods in the uncoded bit The index of corresponding position in sequence can also be defined as different titles, and above-mentioned naming method, which is not constituted, protects the present invention Protect the limitation of range.
It is understood that the set C is the corresponding index of information bit for participating in generating CRC bit, can also determine Justice is different titles, and above-mentioned naming method does not constitute a limitation on the scope of protection of the present invention.
It is understood that it is described index can also be named as subscript etc. other can with the title of home position, above-mentioned life Name mode does not constitute a limitation on the scope of protection of the present invention.
Row weight using above scheme, by calculating the row weight of polarization code generator matrix, and based on polarization code generator matrix It determines the corresponding position of CRC bit and information bit in uncoded bit sequence, is then based on corresponding position, placement information ratio Special and CRC bit, and the code word of polarization code is generated, the number of low weight code word in the polarization code generated can be made less, There is preferable error-correcting performance, to improve performance of the CRC cascade polarization code under high s/n ratio in the case where high s/n ratio.
Beneficial effect in order to enable those skilled in the art to better understand the present invention, the embodiment of the invention also provides one kind The interpretation method of polarization code, as shown in Figure 3.
Referring to Fig. 3, the interpretation method of the polarization code be may include steps of:
Step S301 receives the code word of polarization code, and the code word of the polarization code is using polarization code described in any of the above-described kind Coding method generated.
In specific implementation, the code word of polarization code can be using polarization provided in above-mentioned steps S201~step S204 The coding method of code generates, and is not repeated herein.
Step S302 handles the code word of the polarization code based on decoding algorithm.
In specific implementation, the code word of the polarization code can be handled based on decoding algorithm, decoding obtains wraps in polarization code The information bit and CRC bit contained.
In specific implementation, the decoding algorithm both can be OSD algorithm, or SCL algorithm.OSD algorithm is one The decoding algorithm of kind near-maximum-likelihood, complexity are higher.In a particular application, it can be examined with binding performance and complexity compromise Consider.
In specific implementation, using different decoding algorithms, different frame error rate performances may be corresponded to.Such as:
When receiving end decodes polarization code using SCL algorithm, the polarization code generated using distinct methods is corresponding The sequence of frame error rate from small to large is successively are as follows: and the cascade polarization code that cascade polarization code < existing scheme that embodiment 2 generates generates < The cascade polarization code that embodiment 1 generates;
When receiving end decodes polarization code using OSD algorithm, the polarization code generated using distinct methods is corresponding The sequence of frame error rate from small to large is successively are as follows: the cascade polarization code that cascade polarization code < embodiment 2 that embodiment 1 generates generates < existing There is the cascade polarization code of schemes generation.
Therefore in a particular application, reasonable decoding algorithm can be selected according to the actual situation, to obtain preferable performance.
To better understand those skilled in the art and implementing the present invention, the embodiment of the invention also provides a kind of polarization The cataloged procedure of code and the schematic diagram of decoding process, as shown in Figure 4.
Referring to fig. 4, the cataloged procedure of the polarization code and decoding process may include steps of:
Transmitting terminal executes step S401~step S404 and generates cascade polarization code and send:
Step S401, the row weight based on polarization code generator matrix, determines the position of information bit and CRC bit.
In specific implementation, the position of information bit and CRC bit can be determined based on the row weight of polarization code generator matrix It sets, the position for determining information bit and CRC bit can also be combined based on the row weight and reliability of polarization code generator matrix.
Step S402 determines the information bit for participating in generating CRC bit.
In specific implementation, the information ratio for participating in generating CRC bit can be determined based on the row weight of polarization code generator matrix It is special;The information bit for determining and participating in generating CRC bit can also be combined based on the row weight and reliability of polarization code generator matrix.
Step S403 generates CRC by Polar encoder and cascades polarization code.
In specific implementation, after the position of information bit and CRC bit being placed on uncoded bit sequence, can pass through Polarization code (Polar) encoder generates CRC and cascades polarization code.
Step S404 is sent after modulating the cascade polarization code of generation.
Modulated signal receives receiving end after wireless channel transmission, and the receiving end executes step S405~step S406:
Step S405 demodulates the signal received.
Step S406 is decoded by OSD decoder to signal is received.
To better understand those skilled in the art and implementing the present invention, the embodiment of the invention also provides one kind can Realize the sending device of the coding method of above-mentioned polarization code, as shown in Figure 5.
Referring to Fig. 5, the sending device 50 includes: computing unit 51, the first determination unit 52,53 and of the first generation unit Second generation unit 54, in which:
The computing unit 51 is suitable for obtaining polarization code generator matrix, and calculates the row weight of the polarization code generator matrix;
First determination unit 52 determines CRC bit and information suitable for the row weight based on the polarization code generator matrix Corresponding position of the bit in uncoded bit sequence;
First generation unit 53, suitable for the CRC bit and the information bit are placed on the uncoded ratio Corresponding position in special sequence generates uncoded bit sequence;
Second generation unit 54 is suitable for the uncoded bit sequence input polarization code coder generating polarization The code word of code.
In specific implementation, in specific implementation, the sending device 50 can also include: that the second determination unit (is not shown Out) and third generation unit (not shown), in which:
Second determination unit is adapted to determine that the target bits for participating in generating the CRC bit in the information bit;
The third generation unit, suitable for generating the CRC based on the target bits for participating in generating the CRC bit Bit.
In an embodiment of the present invention, second determination unit is suitable for determining according to the following formula described in participation generation The index of corresponding position of the target bits of CRC bit in the uncoded bit sequence, as set C:
C={ i:Wi≤mWmin,i∈B};
Wherein: set B is the index of corresponding position of the information bit in the uncoded bit sequence, WminFor The corresponding minimum row weight of set B,N is the line number of the polarization code generator matrix, WiIt is described The row weight of i-th row in polarization code generator matrix.
In specific implementation, the computing unit 51, suitable for calculating the polarization code generator matrix i-th according to the following formula Capable row weight:
Wi=2B(i)
Wherein: WiFor the row weight of the i-th row in the polarization code generator matrix, B (i) is the corresponding binary coding of numerical value i The number of middle code word 1,1≤i≤N, N are the line number of the polarization code generator matrix.
In an embodiment of the present invention, first determination unit 52 includes: first choice subelement (not shown), first Determine that subelement (not shown) and second determines subelement (not shown), in which:
The first choice subelement is suitable in the polarization code generator matrix, selects the maximum preceding K+X row of row weight, And using the index of the K+X row as set A, wherein K is the number of the information bit, and X is the number of the CRC bit;
It is described first determine subelement, suitable for by row weight in the set A be N row index and row weigh it is the smallest before It is the rope of corresponding position of the CRC bit in uncoded bit sequence that the index of X-1 row, which is used as set D, the set D, Draw;
Described second determines subelement, suitable for regarding other indexes for removing the set D in the set A as set B, institute State the index that set B is corresponding position of the information bit in uncoded bit sequence.
In an embodiment of the present invention, first determination unit 52 includes: to generate subelement (not shown), the second selection Subelement (not shown), third select subelement (not shown), and third determines that subelement and the 4th determines subelement (not shown), Wherein:
The generation subelement is suitable for generating reliable degree series based on Gaussian approximation building method or PW building method;
The second selection subelement, is suitable in the reliable degree series, selects the highest preceding K+X position of reliability It sets, and using the index of the K+X position as set A ', wherein K is the number of the information bit, and X is the CRC bit Number;
The third selects subelement, is suitable for other indexes from set { 0,1,2 ..., N-1 } except the set A ' In, select the maximum rope for being simultaneously greater than the corresponding minimum row weight of the set A ' and the highest position of reliability of corresponding row weight Draw, and replace the corresponding index of the weight of the minimum row in the set A ', generates set A;
The third determines subelement, suitable for the index for the row that row weight in the set A is N and reliability is minimum It is corresponding position of the CRC bit in uncoded bit sequence that the index of X-1 position, which is used as set D, the set D, Index;
Described 4th determines subelement, suitable for regarding other indexes for removing the set D in the set A as set B, institute State the index that set B is corresponding position of the information bit in uncoded bit sequence.
In specific implementation, the corresponding minimum row weight of the set A ' is a line or multirow;When the set A ' is corresponding Minimum row weight when being multirow, the third selects subelement, is suitably selected for that corresponding row weight is maximum to be simultaneously greater than the set The corresponding minimum row of A ' is again and the index of the highest multiple positions of reliability, the minimum row weight replaced in the set A ' are corresponding Index generates set A.
In an embodiment of the present invention, first determination unit 52 includes: to generate subelement (not shown), the 4th selection Subelement (not shown), the 5th determine that subelement and the 6th determines subelement (not shown), in which:
The generation subelement is suitable for generating reliable degree series based on Gaussian approximation building method or PW building method;
The 4th selection subelement, is suitable in the reliable degree series, selects the highest preceding K+X position of reliability It sets, and using the index of the K+X position as set A ', wherein K is the number of the information bit, and X is the CRC bit Number;
Described 5th determines subelement, is suitable for the index for the row that row weight in the set A ' is N and reliability is minimum X-1 position index be used as set D, the set D be corresponding position of the CRC bit in uncoded bit sequence Index;
Described 6th determines subelement, is suitable for regarding other indexes for removing the set D in the set A ' as set B, The set B is the index of corresponding position of the information bit in uncoded bit sequence.
In specific implementation, the workflow of the sending device 50 and principle can be with reference to providing in above-described embodiment Description in the coding method of polarization code, details are not described herein again.
To better understand those skilled in the art and implementing the present invention, the embodiment of the invention also provides one kind can Realize the receiving device of the interpretation method of above-mentioned polarization code, as shown in Figure 6.
Referring to Fig. 6, the receiving device 60 includes: receiving unit 61 and processing unit 62, in which:
The receiving unit 61, suitable for receiving the code word of polarization code, the code word of the polarization code is using in above-described embodiment The coding method of any polarization code is generated;
The processing unit 62, suitable for handling the code word of the polarization code based on decoding algorithm.
In specific implementation, the decoding algorithm includes any of the following: OSD algorithm, SCL algorithm.
In specific implementation, the workflow and principle of the receiving device 60 can be with reference to providing in above-described embodiment Description in the coding method of polarization code, details are not described herein again.
The embodiment of the present invention provides a kind of computer readable storage medium, and computer readable storage medium is non-volatile deposits Storage media or non-transitory storage media, are stored thereon with computer instruction, and the computer instruction executes any of the above-described when running Step corresponding to the coding method of the kind polarization code, details are not described herein again.
The embodiment of the present invention provides a kind of computer readable storage medium, and computer readable storage medium is non-volatile deposits Storage media or non-transitory storage media, are stored thereon with computer instruction, and the computer instruction executes any of the above-described when running Step corresponding to the interpretation method of the kind polarization code, details are not described herein again.
The embodiment of the present invention provides a kind of sending device, including memory and processor, is stored with energy on the memory Enough computer instructions run on the processor, the processor execute any of the above-described kind when running the computer instruction Step corresponding to the coding method of the polarization code, details are not described herein again.
The embodiment of the present invention provides a kind of receiving device, including memory and processor, is stored with energy on the memory Enough computer instructions run on the processor, the processor execute any of the above-described kind when running the computer instruction Step corresponding to the interpretation method of the polarization code, details are not described herein again.
Those of ordinary skill in the art will appreciate that all or part of the steps in the various methods of above-described embodiment is can It is completed with instructing relevant hardware by program, which can be stored in a computer readable storage medium, storage Medium may include: ROM, RAM, disk or CD etc..
Although present disclosure is as above, present invention is not limited to this.Anyone skilled in the art are not departing from this It in the spirit and scope of invention, can make various changes or modifications, therefore protection scope of the present invention should be with claim institute Subject to the range of restriction.

Claims (23)

1. a kind of coding method of polarization code characterized by comprising
Polarization code generator matrix is obtained, and calculates the row weight of the polarization code generator matrix;
Row weight based on the polarization code generator matrix, determines pair of CRC bit and information bit in uncoded bit sequence Answer position;
The CRC bit and the information bit are placed on the corresponding position in the uncoded bit sequence, generation is not compiled Code bit sequence;
By the uncoded bit sequence input polarization code coder, the code word of polarization code is generated.
2. the coding method of polarization code according to claim 1, which is characterized in that placing the CRC bit and described Before information bit, further includes:
Determine the target bits for participating in generating the CRC bit in the information bit;
The CRC bit is generated based on the target bits for participating in generating the CRC bit.
3. the coding method of polarization code according to claim 2, which is characterized in that join in the determination information bit Include: with the target bits for generating the CRC bit
Correspondence of the target bits for participating in generating the CRC bit in the uncoded bit sequence is determined according to the following formula The index of position, as set C:
C={ i:Wi≤mWmin,i∈B};
Wherein: set B is the index of corresponding position of the information bit in the uncoded bit sequence, WminFor set B Corresponding minimum row weight,N is the line number of the polarization code generator matrix, WiFor the polarization The row weight of i-th row in code generator matrix.
4. the coding method of polarization code according to claim 3, which is characterized in that described to calculate the polarization code generation square Battle array row include: again
The row weight of i-th row of polarization code generator matrix is calculated according to the following formula:
Wi=2B(i)
Wherein: WiFor the row weight of the i-th row in the polarization code generator matrix, B (i) is code word in the corresponding binary coding of numerical value i 1 number, 1≤i≤N, N are the line number of the polarization code generator matrix.
5. the coding method of polarization code according to claim 4, which is characterized in that the determining CRC bit and information ratio Corresponding position of the spy in uncoded bit sequence include:
In the polarization code generator matrix, the maximum preceding K+X row of row weight is selected, using the index of the K+X row as set A, Wherein K is the number of the information bit, and X is the number of the CRC bit;
Using the index of the index for the row that row weight in the set A is N and the smallest preceding X-1 row of row weight as set D, the collection Close the index that D is corresponding position of the CRC bit in uncoded bit sequence;
Regarding other indexes that the set D is removed in the set A as set B, the set B is that the information bit is not being compiled The index of corresponding position in code bit sequence.
6. the coding method of polarization code according to claim 4, which is characterized in that the determining CRC bit and information ratio Corresponding position of the spy in uncoded bit sequence include:
Reliable degree series are generated based on Gaussian approximation building method or PW building method;
In the reliable degree series, select the highest preceding K+X position of reliability, using the index of the K+X position as Set A ', wherein K is the number of the information bit, and X is the number of the CRC bit;
From other indexes for removing the set A ' in set { 0,1,2 ..., N-1 }, corresponding row weight maximum is selected to be simultaneously greater than The corresponding minimum row weight of the set A ' and the index of the highest position of reliability, and replace the minimum row weight in the set A ' Corresponding index generates set A;
Using the index for the row that row weight in the set A is N and the index of the smallest X-1 position of reliability as set D, institute State the index that set D is corresponding position of the CRC bit in uncoded bit sequence;
Regarding other indexes that the set D is removed in the set A as set B, the set B is that the information bit is not being compiled The index of corresponding position in code bit sequence.
7. the coding method of polarization code according to claim 6, which is characterized in that
The corresponding minimum row weight of the set A ' is a line or multirow;
When the corresponding minimum row weight of the set A ' is multirow, select corresponding row weight is maximum to be simultaneously greater than the corresponding minimum of A ' Row weight and the index of the highest multiple positions of reliability replace the corresponding index of minimum row weight in the set A ', spanning set Close A.
8. the coding method of polarization code according to claim 4, which is characterized in that the determining CRC bit and information ratio Corresponding position of the spy in uncoded bit sequence include:
Reliable degree series are generated based on Gaussian approximation building method or PW building method;
In the reliable degree series, the highest preceding K+X position of reliability is selected, using the index of the position K+X as collection A ' is closed, wherein K is the number of the information bit, and X is the number of the CRC bit;
Using the index for the row that row weight in the set A ' is N and the index of the minimum X-1 position of reliability as set D, The set D is the index of corresponding position of the CRC bit in uncoded bit sequence;
Regarding other indexes that the set D is removed in the set A ' as set B, the set B is the information bit not The index of corresponding position in sequences of code bits.
9. a kind of interpretation method of polarization code characterized by comprising
The code word of polarization code is received, the code word of the polarization code uses the volume of polarization code as claimed in any one of claims 1 to 8 Code method is generated;
The code word of the polarization code is handled based on decoding algorithm.
10. the interpretation method of polarization code according to claim 9, which is characterized in that the decoding algorithm includes following It anticipates one kind: OSD algorithm, SCL algorithm.
11. a kind of sending device characterized by comprising
Computing unit is suitable for obtaining polarization code generator matrix, and calculates the row weight of the polarization code generator matrix;
First determination unit determines that CRC bit and information bit are not being compiled suitable for the row weight based on the polarization code generator matrix Corresponding position in code bit sequence;
First generation unit, suitable for the CRC bit and the information bit to be placed in the uncoded bit sequence Corresponding position generates uncoded bit sequence;
Second generation unit is suitable for the uncoded bit sequence input polarization code coder generating the code word of polarization code.
12. sending device according to claim 11, which is characterized in that further include:
Second determination unit is adapted to determine that the target bits for participating in generating the CRC bit in the information bit;
Third generation unit, suitable for generating the CRC bit based on the target bits for participating in generating the CRC bit.
13. sending device according to claim 12, which is characterized in that second determination unit is suitable for according to as follows Formula determines the index of corresponding position of the target bits for participating in generating the CRC bit in the uncoded bit sequence, As set C:
C={ i:Wi≤mWmin,i∈B};
Wherein: set B is the index of corresponding position of the information bit in the uncoded bit sequence, WminFor set B Corresponding minimum row weight,N is the line number of the polarization code generator matrix, WiFor the polarization The row weight of i-th row in code generator matrix.
14. sending device according to claim 13, which is characterized in that the computing unit is suitable for according to the following formula Calculate the row weight of i-th row of polarization code generator matrix:
Wi=2B(i)
Wherein: WiFor the row weight of the i-th row in the polarization code generator matrix, B (i) is code word in the corresponding binary coding of numerical value i 1 number, 1≤i≤N, N are the line number of the polarization code generator matrix.
15. sending device according to claim 14, which is characterized in that first determination unit includes:
First choice subelement is suitable in the polarization code generator matrix, selects the maximum preceding K+X row of row weight, and by the K The index of+X row is used as set A, and wherein K is the number of the information bit, and X is the number of the CRC bit;
First determines subelement, suitable for being the index of the row of N and the smallest preceding X-1 row of weight of going by row weight in the set A It is the index of corresponding position of the CRC bit in uncoded bit sequence that index, which is used as set D, the set D,;
Second determines subelement, suitable for regarding other indexes for removing the set D in the set A as set B, the set B For the index of corresponding position of the information bit in uncoded bit sequence.
16. sending device according to claim 14, which is characterized in that first determination unit includes:
Subelement is generated, is suitable for generating reliable degree series based on Gaussian approximation building method or PW building method;
Second selection subelement, is suitable in the reliable degree series, selects the highest preceding K+X position of reliability, and by institute The index for stating K+X position is used as set A ', and wherein K is the number of the information bit, and X is the number of the CRC bit;
Third selects subelement, is suitable for from other indexes for removing the set A ' in set { 0,1,2 ..., N-1 }, selection pair The maximum index for being simultaneously greater than the corresponding minimum row weight of the set A ' and the highest position of reliability of the row weight answered, and replace institute The corresponding index of minimum row weight in set A ' is stated, set A is generated;
Third determines subelement, suitable for the X-1 position that the index for the row that row weight in the set A is N and reliability is minimum It is the index of corresponding position of the CRC bit in uncoded bit sequence that the index set, which is used as set D, the set D,;
4th determines subelement, suitable for regarding other indexes for removing the set D in the set A as set B, the set B For the index of corresponding position of the information bit in uncoded bit sequence.
17. sending device according to claim 16, which is characterized in that
The corresponding minimum row weight of the set A ' is a line or multirow;
When the corresponding minimum row weight of the set A ' is multirow, the third selects subelement, is suitably selected for corresponding row weight The corresponding minimum row weight of the simultaneously greater than described set A ' of maximum and the index of the highest multiple positions of reliability, replace the set The corresponding index of minimum row weight in A ', generates set A.
18. sending device according to claim 14, which is characterized in that first determination unit includes:
Subelement is generated, is suitable for generating reliable degree series based on Gaussian approximation building method or PW building method;
4th selection subelement, is suitable in the reliable degree series, selects the highest preceding K+X position of reliability, and by institute The index for stating K+X position is used as set A ', and wherein K is the number of the information bit, and X is the number of the CRC bit;
5th determines subelement, is suitable for the X-1 position that the index for the row that row weight in the set A ' is N and reliability is minimum It is the index of corresponding position of the CRC bit in uncoded bit sequence that the index set, which is used as set D, the set D,;
6th determines subelement, is suitable for regarding other indexes for removing the set D in the set A ' as set B, the set B For the index of corresponding position of the information bit in uncoded bit sequence.
19. a kind of receiving device characterized by comprising
Receiving unit, suitable for receiving the code word of polarization code, the code word of the polarization code is used such as any one of claim 1 to 8 institute The coding method for the polarization code stated is generated;
Processing unit, suitable for handling the code word of the polarization code based on decoding algorithm.
20. receiving device according to claim 19, which is characterized in that the decoding algorithm includes any of the following: OSD algorithm, SCL algorithm.
21. a kind of computer readable storage medium, computer readable storage medium is non-volatile memory medium or non-transient deposits Storage media is stored thereon with computer instruction, which is characterized in that the computer instruction run when perform claim require 1 to 8 or The step of any one of person 9 to 10 the method.
22. a kind of sending device, including memory and processor, it is stored with and can runs on the processor on the memory Computer instruction, which is characterized in that perform claim requires any one of 1 to 8 when the processor runs the computer instruction The step of the method.
23. a kind of receiving device, including memory and processor, it is stored with and can runs on the processor on the memory Computer instruction, which is characterized in that perform claim requires any in 9 to 10 when the processor runs the computer instruction The step of item the method.
CN201810183937.5A 2018-03-06 2018-03-06 Method for encoding and decoding polarization code, transmitting device, receiving device, and medium Active CN110233698B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810183937.5A CN110233698B (en) 2018-03-06 2018-03-06 Method for encoding and decoding polarization code, transmitting device, receiving device, and medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810183937.5A CN110233698B (en) 2018-03-06 2018-03-06 Method for encoding and decoding polarization code, transmitting device, receiving device, and medium

Publications (2)

Publication Number Publication Date
CN110233698A true CN110233698A (en) 2019-09-13
CN110233698B CN110233698B (en) 2021-11-19

Family

ID=67862194

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810183937.5A Active CN110233698B (en) 2018-03-06 2018-03-06 Method for encoding and decoding polarization code, transmitting device, receiving device, and medium

Country Status (1)

Country Link
CN (1) CN110233698B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110808828A (en) * 2019-09-26 2020-02-18 中国电子科技集团公司第三十研究所 Multi-matrix self-adaptive decoding device and method for quantum key distribution
CN113078910A (en) * 2020-01-06 2021-07-06 大唐移动通信设备有限公司 Bit field determination method, device, medium and electronic equipment
WO2022188752A1 (en) * 2021-03-10 2022-09-15 华为技术有限公司 Encoding method and device, and decoding method and device
WO2023226690A1 (en) * 2022-05-23 2023-11-30 华为技术有限公司 Coding and decoding method and apparatus

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103684477A (en) * 2012-09-24 2014-03-26 华为技术有限公司 Generation method and generation device for mixed polar code
CN107017892A (en) * 2017-04-06 2017-08-04 华中科技大学 One kind verification cascade polarization code encoding method and system
CN107332571A (en) * 2017-06-14 2017-11-07 中国农业大学 A kind of Polar code constructing methods and device
CN107425857A (en) * 2017-06-19 2017-12-01 华为技术有限公司 One kind polarization code coding/decoding method and device

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103684477A (en) * 2012-09-24 2014-03-26 华为技术有限公司 Generation method and generation device for mixed polar code
CN106899311A (en) * 2012-09-24 2017-06-27 华为技术有限公司 Mix the generation method and generating means of polar code
CN107017892A (en) * 2017-04-06 2017-08-04 华中科技大学 One kind verification cascade polarization code encoding method and system
CN107332571A (en) * 2017-06-14 2017-11-07 中国农业大学 A kind of Polar code constructing methods and device
CN107425857A (en) * 2017-06-19 2017-12-01 华为技术有限公司 One kind polarization code coding/decoding method and device

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
SAMSUNG: "Comparison of CA Polar Codes and PC-CA Polar Codes", 《3GPP》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110808828A (en) * 2019-09-26 2020-02-18 中国电子科技集团公司第三十研究所 Multi-matrix self-adaptive decoding device and method for quantum key distribution
CN113078910A (en) * 2020-01-06 2021-07-06 大唐移动通信设备有限公司 Bit field determination method, device, medium and electronic equipment
CN113078910B (en) * 2020-01-06 2023-07-28 大唐移动通信设备有限公司 Method, device, medium and electronic equipment for determining bit field
WO2022188752A1 (en) * 2021-03-10 2022-09-15 华为技术有限公司 Encoding method and device, and decoding method and device
WO2023226690A1 (en) * 2022-05-23 2023-11-30 华为技术有限公司 Coding and decoding method and apparatus

Also Published As

Publication number Publication date
CN110233698B (en) 2021-11-19

Similar Documents

Publication Publication Date Title
KR102621627B1 (en) Apparatus and method for encoding with cyclic redundancy check and polar code
CN109361402B (en) Coding method and encoding device
CN107026656B (en) CRC-assisted medium-short code length Polar code effective decoding method based on disturbance
US10608667B2 (en) Method of low complexity SCL decoding for polar codes and apparatus thereof
CN110233698A (en) Coding and interpretation method, sending device, receiving device, the medium of polarization code
EP3364542A1 (en) Error correction coding method based on cascading of polar codes and repetition codes or multi-bit parity check codes
CN106685656A (en) Method for correcting data errors in continuously variable quantum key distribution system based on polarization code
CN107370560A (en) Coding and speed matching method, the device and equipment of a kind of polarization code
CN106571831A (en) LDPC hard decision decoding method based on depth learning and decoder
CN103929210B (en) Hard decision decoding method based on genetic algorithm and neural network
CN107231158B (en) Polarization code iterative receiver, system and polarization code iterative decoding method
CN110071779B (en) Low-complexity polarization code multilevel coding modulation method
KR102394139B1 (en) Method for generating a sequence for a polar code and medium therefor and method and apparatus for transmitting data using thereof
CN108092742B (en) A kind of communication means based on polarization code
CN109347487A (en) Freeze the polarization code SCL interpretation method of auxiliary based on bit
CN108282259A (en) A kind of coding method and device
CN103973314A (en) Signal coding and decoding method based on LDPC, receiving end and sending end
CN110061803B (en) Low-complexity polar code bit interleaving coding modulation method
CN108494527A (en) A kind of data transmission and reception method based on LoRa
CN103516465B (en) Coded modulation and demodulation and demodulation and decoding method, device and system
CN110535560A (en) A kind of polarization code combines coding and interpretation method
CN111641473A (en) Novel method for shortening polarization code, communication method and system
KR102203607B1 (en) Method for optimizing the resources of a data transmission at the level of the mac layer and device implementing the method
CN113067584A (en) Coding method for common auxiliary polarization code of CRC (Cyclic redundancy check) code and PC (personal computer) code
CN102832954B (en) Turbo code iterative decoding stopping method based on soft information average minimum value

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
CB02 Change of applicant information

Address after: 100089 18 / F, block B, Zhizhen building, No.7, Zhichun Road, Haidian District, Beijing

Applicant after: Beijing Ziguang zhanrui Communication Technology Co.,Ltd.

Address before: 100084, Room 516, building A, Tsinghua Science Park, Beijing, Haidian District

Applicant before: BEIJING SPREADTRUM HI-TECH COMMUNICATIONS TECHNOLOGY Co.,Ltd.

CB02 Change of applicant information
GR01 Patent grant
GR01 Patent grant