CN104124979B - The interpretation method and code translator of polar code - Google Patents
The interpretation method and code translator of polar code Download PDFInfo
- Publication number
- CN104124979B CN104124979B CN201310152544.5A CN201310152544A CN104124979B CN 104124979 B CN104124979 B CN 104124979B CN 201310152544 A CN201310152544 A CN 201310152544A CN 104124979 B CN104124979 B CN 104124979B
- Authority
- CN
- China
- Prior art keywords
- path
- polar codes
- length
- bit
- merging
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error 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/13—Linear 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)
- Error Detection And Correction (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The embodiment of the present invention provides a kind of interpretation method and code translator of Polar codes.This method includes：It is s the 2nd Polar codes by the first Polar code divisions that length is N, wherein the length of each 2nd Polar codes is the integer power that N/s, N and s are 2 and N>s；The path that s the 2nd Polar codes concurrently are carried out with List decodings divides, and the path of the division after the division of path to s the 2nd Polar codes merges, so as to obtain a plurality of merging path that length is N；Length is selected to merge path for first in a plurality of merging path of N-bit, first to merge path be the path of path metric value maximum or be by the path of cyclic redundancy check (CRC) in a plurality of merging path that length is N-bit in a plurality of merging path that length is N-bit；Merge path according to first, obtain the decoding result of the first Polar codes.The decoding handling capacity of Polar codes can be so improved, reduces decoding latency.
Description
Technical field
The present embodiments relate to codec domain, and more particularly, to Polar codes（Polar code）Interpretation method
And code translator.
Background technology
Communication system generally use channel coding improves the reliability of data transfer, ensures the quality of communication.Polar codes are
Shannon capacity and the coding mode with low encoding and decoding complexity can be obtained.Polar codes are a kind of linear block codes.It generates square
Battle array is GN., its cataloged procedure isHereCode length N=2n, n >=0.
HereBNIt is transposed matrix, such as bit reversal（bit reversal）Matrix.
It is the Kronecker power of F（Kronecker power）, it is defined asPolar code cosets
Code can be expressed asIts cataloged procedure is：Here A is information
（information）The set of bit index, GN.(A) it is GN.In the submatrix that is obtained by the corresponding row of index in set A,
GN.(AC) it is GN.In by set ACIn the obtained submatrix of the corresponding row of index.It is to freeze（frozen）Bit, its quantity
It is known bits for (N-K).In order to simple, these, which freeze bit, can be set to 0.
The decoding of Polar codes can use SC（Successive-cancellation, successive elimination）Decoding, its process is such as
Under：
Consider a kind of Polar codes, its parameter is
In SC decodings, following conditional likelihood is calculated successively：
WhereinIt is received signal vector (y1,y2,…,yN),It is bit vectors (u1,u2,…,ui-1).W is that transfer is general
Rate, L represent log-likelihood ratio.
IfAdjudicate as follows：
IfSimply make u
In above-mentioned formula (2) and (3),Represent bit uiDecision value.
The complexity of SC decodings is O (Nlog2N).The performance that SC decodings can have been obtained in the case where code length N is very long,
Approach shannon limit.
It is by bit sequential decoding in SC decodings, is translated after being to be sentenced firmly after having translated each bit to subsequent bits
Code uses.Error propagation is so there may exist, causes decoding performance to decline.List（List）Decoding retains a plurality of path candidate
The decoding performance for approaching maximum likelihood can be obtained.SC is decoded and List decodings combine and just obtain SC-List decodings.
The process of the SC-List decodings of Polar codes is summarized as follows：
Path divides：If every timeIt is information bit（information bit）, then current decoding path is divided
Into two paths：One pathsAnd a pathsWhen total number of path beyond predefined thresholding Lmax when
Wait, abandon least reliable path, only keep the most reliable path of Lmax bars（Referred to as survivor path）；And update all paths
On probable value.Lmax is positive integer, can be described as survivor path number.
No path division：IfTo freeze bit, then all decoding paths do not divide, ifKeep path
Number probable value that is constant and updating all paths.
But SC-List decoding can only equally carry out by bit sequential decoding, decoding latency is larger, decoding handling capacity compared with
It is low.
The content of the invention
The embodiment of the present invention provides a kind of interpretation method and decoder of Polar codes, it is possible to increase the decoding of Polar codes gulps down
The amount of spitting.
First aspect, there is provided a kind of interpretation method of Polar codes, including：It is s by the first Polar code divisions that length is N
A 2nd Polar codes, wherein the length of each 2nd Polar codes is the integer power that N/s, N and s are 2 and N>s；Concurrently to s
The path division that 2nd Polar codes are decoded into row-column list List, and the division after the division of path to s the 2nd Polar codes
Path merges, so as to obtain a plurality of merging path that length is N；Length is selected as in a plurality of merging path of N-bit
First merges path, and the first merging path is the road of path metric value maximum in a plurality of merging path that the length is N-bit
Footpath is by the path of cyclic redundancy check (CRC) in a plurality of merging path that length is N-bit；Merge road according to first
Footpath, obtains the decoding result of the first Polar codes.
With reference to first aspect, in the first implementation of first aspect, concurrently to the s the 2nd Polar codes
Path division is carried out, and the path of the division after the division of path to the s the 2nd Polar codes merges, so as to obtain
Length is a plurality of merging path of N, including：Path division concurrently is carried out to the kth bit of each 2nd Polar codes, is obtained
The corresponding 2L articles of splitpath of each 2nd Polar codes, k, L for positive integer and 1≤k≤N/s, k=1 when L=1, k>L is pair when 1
Kth bit carries out the survivor path number before the division of path；According in the first Polar codes with the s the 2nd Polar codes
The property of the corresponding bit of kth bit, merges the s corresponding s × 2L articles of splitpaths altogether of the 2nd Polar codes, obtains length
Merge path for the P bars of k × s, P is positive integer and P≤s × 2L；After merging path progress according to the P bars that the length is k × s
Continuous path division and merging treatment, to obtain a plurality of merging path of the length as N.
With reference to first aspect and its above-mentioned implementation, in second of implementation of first aspect, according to the length
The P bars spent for k × s merge path and carry out subsequent path division and merging treatment, to obtain a plurality of merging path of the length as N,
Including：Work as k<During N/s, if P≤Lmax, it is s merging path that the P bars that the length is k × s are merged path decomposing
Group, each group of paths that merges merge path component comprising the P bars merging path that length is k as survivor path, and by s
Yong Yu not be in the path division of the bit of kth+1 of s the 2nd Polar codes and merging treatment；If P>Lmax, then be from length
The P bars of k × s, which merge, selects the Lmax bars of path metric value maximum to merge path in path, selected Lmax bars are merged road
Footpath is decomposed into s merging group of paths, it is each merge group of paths and include the Lmax bars that length is k merge path as survivor path,
And s merging group of paths is respectively used to in the path division of the bit of kth+1 of s the 2nd Polar codes and merging treatment；When
During k=N/s, P bars that length is k × s are merged into a plurality of merging path that path is N as length, wherein Lmax be it is predetermined most
Big number of path.
With reference to first aspect and its above-mentioned implementation, in the third implementation of first aspect, according to first
The property of bit corresponding with the kth bit of s the 2nd Polar codes, it is corresponding total to merge s the 2nd Polar codes in Polar codes
Common s × 2L bars splitpath, obtains the P bars that length is k × s and merges path, including：When in the first Polar codes with s second
The corresponding bit of kth bit of Polar codes is when freezing bit, selects the splitpath that kth bit is equal to particular value to carry out
Merge to obtain length to merge path among the P bars of k × s, path will be merged among P bars as P bars merging path, wherein P=
L, particular value are the value for freezing bit.
With reference to first aspect and its above-mentioned implementation, in the 4th kind of implementation of first aspect, according to first
The property of bit corresponding with the kth bit of s the 2nd Polar codes, it is corresponding total to merge s the 2nd Polar codes in Polar codes
Common s × 2L bars splitpath, obtains the P bars that length is k × s and merges path, including：When in the first Polar codes with s second
When freezing bit there are w information bit and s-w in the corresponding bit of kth bit of Polar codes, wherein w for integer and 0≤
W≤s, deletes and corresponds to the splitpath that the kth bit for freezing bit is not equal to particular value, merge remaining splitpath, obtain
Merge path among to the P bars that length is k × s, merge path, wherein P=2 as P bars using path is merged among P barsw× L, it is special
Definite value is to freeze the value of bit.
With reference to first aspect and its above-mentioned implementation, it is N's by length in the 5th kind of implementation of first aspect
First Polar code divisions are s the 2nd Polar codes to intercouple, including：By the received signal vector order of the first Polar codes
Ground is divided into s sections of received signal vectors, every section of received signal vector as a 2nd Polar code received signal vector with true
Determine s the 2nd Polar codes.
Second aspect, there is provided a kind of code translator of Polar codes, including：Segmenting unit, for by length is N the
One Polar code divisions are s the 2nd Polar codes, wherein the length of each 2nd Polar codes is the integer power that N/s, N and s are 2 and N
>s；Split degree unit, the path for concurrently s the 2nd Polar codes to be carried out with List decodings divides, and divides in path
The path of the division to s the 2nd Polar codes merges afterwards, so as to obtain a plurality of merging path that length is N；Selection is single
Member, for selecting length to merge path for first in a plurality of merging path of N-bit, the first merging path is that length is N ratios
The path of path metric value maximum or be by following in a plurality of merging path that length is N-bit in special a plurality of merging path
The path of ring redundancy check CRC；Determination unit, for merging path according to first, obtains the decoding result of the first Polar codes.
With reference to second aspect, in the first implementation of second aspect, split degree unit, including：S length is
The decoder of N/s, for concurrently carrying out path division to the kth bit of each 2nd Polar codes, obtains each second
The corresponding 2L bars splitpath of Polar codes, k, L for positive integer and 1≤k≤N/s, k=1 when L=1, k>When 1 L be to kth bit into
Survivor path number before the division of walking along the street footpath；Combiner, for according to the kth ratio in the first Polar codes with s the 2nd Polar codes
The property of special corresponding bit, merges the s corresponding s × 2L articles of splitpaths altogether of the 2nd Polar codes, it is k × s to obtain length
P bars merge path, P be positive integer and P≤s × 2L, and the P bars that length is k × s, which merge path and are used for subsequent path, to be divided and conjunction
And handle.
With reference to second aspect and its above-mentioned implementation, in second of implementation of second aspect, split degree list
Member, further includes decomposer, works as k<During N/s, if P≤Lmax, decomposer is used to the P bars that length is k × s merging path point
Solve and merge group of paths for s, each group of paths that merges includes P bar merging path of the length for k as survivor path, and decomposes
Device is additionally operable to export s merging group of paths to s decoder respectively, so that s decoder concurrently carries out s second
The path division of the bit of kth+1 of Polar codes；If P>Lmax, then decomposer from the P bars that length is k × s for merging path
The Lmax bars of middle selection path metric value maximum merge path, and selected Lmax bars are merged path decomposing for s merging
Group of paths, each group of paths that merges includes Lmax bar merging path of the length for k as survivor path, and decomposer is additionally operable to
S merging group of paths is exported to s decoder respectively, so that s decoder concurrently carries out the kth of s the 2nd Polar codes
The path division of+1 bit；Wherein Lmax is predetermined maximum path number.
With reference to second aspect and its above-mentioned implementation, in the third implementation of second aspect, as k=N/s,
Combiner is additionally operable to the P bars that length is k × s merging a plurality of merging path that path is N as length.
With reference to second aspect and its above-mentioned implementation, in the 4th kind of implementation of second aspect, merge implement body
For when bit corresponding with the kth bit of s the 2nd Polar codes is to freeze bit in the first Polar codes, selecting kth
The splitpath that bit is equal to particular value is merged to obtain length to merge path among the P bars of k × s, will be closed among P bars
And path merges path as P bars, wherein P=L, particular value is the value for freezing bit.
With reference to second aspect and its above-mentioned implementation, in the 5th kind of implementation of second aspect, merge implement body
For when there are w information bit and s-w in bit corresponding with the kth bit of s the 2nd Polar codes in the first Polar codes
A wherein w is integer and 0≤w≤s when freezing bit, deletes and corresponds to point of the kth bit for freezing bit not equal to particular value
Path is split, merges remaining splitpath, obtains merging path among the P bars that length is k × s, makees path is merged among P bars
Merge path, wherein P=2 for P barsw× L, particular value are the value for freezing bit.
With reference to second aspect and its above-mentioned implementation, in the 6th kind of implementation of second aspect, decoder is also used
In the path metric value for calculating every splitpath.
With reference to second aspect and its above-mentioned implementation, in the 7th kind of implementation of second aspect, segmenting unit tool
Body is used to the received signal vector of the first Polar codes being sequentially divided into s sections of received signal vectors, every section of received signal vector
Received signal vector as a 2nd Polar code is with definite s the 2nd Polar codes.
The Polar code divisions that length is N are multistage Polar codes by the embodiment of the present invention, to the Polar codes after segmentation independently
Path divides, and then the path of obtained division merges processing, finally obtains the merging path of path metric value maximum,
So as to obtaining the decoding result of original Polar codes, it is not necessary to sequentially to N number of bit into row decoding, it is possible to increase Polar codes
Decoding handling capacity, reduce decoding latency.
Brief description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be in embodiment or description of the prior art
Required attached drawing is briefly described, it should be apparent that, drawings in the following description are only some realities of the present invention
Example is applied, for those of ordinary skill in the art, without creative efforts, can also be according to these attached drawings
Obtain other attached drawings.
Fig. 1 is the flow chart of the interpretation method of the Polar codes of one embodiment of the invention.
Fig. 2 be s=2 in the case of decoding process schematic diagram.
Fig. 3 be s=4 in the case of decoding process schematic diagram.
Fig. 4 is the block diagram of the code translator of one embodiment of the invention Polar codes.
Fig. 5 is the schematic block diagram of the device of another embodiment of the present invention.
Embodiment
Below in conjunction with the attached drawing in the embodiment of the present invention, the technical solution in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is part of the embodiment of the present invention, instead of all the embodiments.Based on this hair
Embodiment in bright, the every other implementation that those of ordinary skill in the art are obtained without creative efforts
Example, belongs to the scope of protection of the invention.
The embodiment of the present invention can be applied to various communication systems, and therefore, description below is not restricted to particular communications system.
Global system for mobile telecommunications（Global System of Mobile communication, referred to as " GSM "）System, CDMA
（Code Division Multiple Access, referred to as " CDMA "）System, wideband code division multiple access（Wideband Code
Division Multiple Access, referred to as " WCDMA "）System, General Packet Radio Service（General Packet
Radio Service, referred to as " GPRS "）, Long Term Evolution（Long Term Evolution, referred to as " LTE "）System, LTE frequency divisions
Duplex（Frequency Division Duplex, referred to as " FDD "）System, LTE time division duplexs（Time Division
Duplex, referred to as " TDD "）, Universal Mobile Communication System（Universal Mobile Telecommunication System,
Referred to as " UMTS "）Deng.Base station or terminal in above-mentioned system use traditional Turbo code, the letter of LDPC code coded treatment
Breath or data can use the Polar codes in the present embodiment to encode.
Fig. 1 is the flow chart of the interpretation method of the Polar codes of one embodiment of the invention.The method of Fig. 1 can be by Polar
The code translator of code performs.The code translator can be located in the receiving device of Polar codes, such as by the processing in receiving device
Device is realized, or is realized by the special Polar decoders in receiving device.
101, it is s the 2nd Polar codes by the first Polar code divisions that length is N, wherein the length of each 2nd Polar codes
Spend the integer power and N for N/s, N and s are 2>s.
Wherein, s the 2nd Polar codes intercouple, i.e. the information bit of s the 2nd Polar codes is relevant.Polar codes
Length refer to the bit number that Polar codes are included.First Polar codes refer to the original Polar codes that needs decode, its input is
Received signal vector。
Polar codes have inherent recursive structure, can be divided into the shorter multiple Polar codes of the length to intercouple.Can
The received signal vector of first Polar codes, as one embodiment, can be sequentially divided into s sections, every section receives letter by selection of land
Number received signal vector of the vector as a 2nd Polar code.
In case of s=2, as it was previously stated,
Therefore, the cataloged procedure of Polar codes can be expressed as：
Here：
Therefore length is that the Polar codes of N can be expressed as form：
Wherein
Thus, it is possible to by the Polar codes that the Polar code divisions that length is N are two N/2 long to intercouple, i.e., above-mentioned
Two Polar codes.In other words, 2 the 2nd Polar codes that length is respectively N/2 can be obtained：
In the case, in a step 101, it is by the received signal vector of the first Polar codesIt is divided into 2 second
The received signal vector of Polar codes 。
Similarly, in case of s=4, length is that the Polar codes of N can be expressed as：
Order
Therefore 4 the 2nd Polar codes can be obtained is：
In the case, in a step 101, it is by the received signal vector of the first Polar codesIt is divided into 4 second
The received signal vector of Polar codes With。
Similarly, in case of s=8, length is that the Polar codes of N can be expressed as：
Order
Then
Therefore 8 the 2nd Polar codes can be obtained is：
In the case, in a step 101, it is by the received signal vector of the first Polar codesIt is divided into 8 second
The received signal vector of Polar codes ……、。
For other s values, s the 2nd Polar codes can be similarly obtained, details are not described herein.In addition, the present invention is implemented
Example is not restricted the segmented mode of Polar codes, can also be segmented according to the other modes in addition to order decile, as long as
Ensure the intercoupling property between the Polar codes after segmentation.
102, the path that concurrently s the 2nd Polar codes are carried out with List decodings divides, and to s after the division of path
The path of the division of 2nd Polar codes merges, so as to obtain a plurality of merging path that length is N.
Path division refers to branch into two according to current decoding bit for 0 and 1 on the basis of pervious decoding path
Splitpath.Meanwhile the path metric value of each bar splitpath can be settled accounts.Path metric value is bigger, represents corresponding path
Reliability it is higher.One example of path metric value is the logarithm of path probability value, but the embodiment of the present invention is to path metric
The concrete form of value is not restricted.
103, select the length to merge path for first in a plurality of merging path of N, the first merging path is
The path of path metric value maximum or be a plurality of merging road that the length is N in a plurality of merging path that the length is N
Pass through CRC in footpath（Cyclic Redundancy Check, cyclic redundancy check）Path.
It is the highest path of reliability that first so obtained, which merges path, therefore can be used for obtaining final decoding knot
Fruit.
104, merge path according to first, obtain the decoding result of the first Polar codes.
Can be according to the correspondence between the 2nd Polar codes and each bit of the first Polar codes, from the 2nd Polar
The decoding result of code obtains the decoding result of the first Polar codes.It will be described more fully and obtain in conjunction with specific embodiments further below
Take the instantiation procedure of the decoding result of the first Polar codes.
The Polar code divisions that length is N are multistage Polar codes by the embodiment of the present invention, to the Polar codes after segmentation independently
Path divides, and the path of obtained division then is merged processing, finally obtains the merging road of path metric value maximum
Footpath, so as to obtain the decoding result of original Polar codes, it is not necessary to sequentially to N number of bit into row decoding, it is possible to increase
The decoding handling capacity of Polar codes, reduces decoding latency.
In addition, the embodiment of the present invention only needs the decoder that length is N/s, the resource occupied by single decoder can be reduced
And computation complexity, it can so flexibly be adapted to resource-constrained scene.
It should be noted that the decoder in the embodiment of the present invention can be realized completely by specialized hardware, such as dedicated chip,
Integrated circuit or other firmwares；Can also by general processor and its instruction realize, the instruction can be stored in processor or
Person is stored in independent memory.These forms are each fallen within the range of the embodiment of the present invention.
Alternatively, in a step 102, can be concurrently to the kth ratio of each 2nd Polar codes as one embodiment
Spy carries out path division, obtains the corresponding 2L articles of splitpath of each 2nd Polar codes, k, L are positive integer and 1≤k≤N/s, k
L=1 when=1, k>L is that the survivor path number before the path division is carried out to the kth bit when 1.In other words, s can be used
The decoder that a length is N/s carries out path division to s the 2nd Polar codes at the same time, and calculates the path of each bar splitpath
Metric.So path division serially need not be carried out by bit, improve decoding handling capacity, reduce decoding latency.
Then, can be according to the property of bit corresponding with the kth bit of s the 2nd Polar codes in the first Polar codes（I.e.
The corresponding bit is to freeze bit or information bit）, merge the corresponding s × 2L articles of division road altogether of s the 2nd Polar codes
Footpath, obtains the P bars that length is k × s and merges path.P is positive integer and P≤s × 2L.In this way, can be according to the P that length is k × s
Bar merges path and carries out subsequent path division and merging treatment, to obtain a plurality of merging path of the length as N.
Corresponding bit refers to the kth bits of the 2nd Polar codes originally position in the first Polar codes.To input ratio
Illustrated specially for example, it is assumed that the input bit of the first Polar codes is expressed as（ …、）.Example
Such as, in the case of above-mentioned s=2, the input bit of the first Polar codes is expressed as2 the 2nd Polar codes
Input bit be respectivelyWithThen akCorresponding bit is v in the first Polar codesk, bkIn the first Polar codes
Corresponding bit is vk+N/2.The corresponding bit is likely to be information bit or freezes bit.
Alternatively, as another embodiment, subsequent path point is carried out merging path according to the P bars that the length is k × s
Split and merging treatment, during obtaining a plurality of merging path of the length as N, different places can be carried out according to the current value of k
Reason.
For example, work as k<During N/s, if P≤Lmax, it is s merging road that the P bars that length is k × s are merged path decomposing
Footpath group, each group of paths that merges merge group of paths difference comprising the P bars merging path that length is k as survivor path, and by s
Path division and merging treatment for the bit of kth+1 of s the 2nd Polar codes.On the other hand, if P>Lmax, then from length
The P bars spent for k × s, which merge, selects the Lmax bars of path metric value maximum to merge path in path, selected Lmax bars are closed
And path decomposing is s merging group of paths, each group of paths that merges merges path as survival road comprising the Lmax bars that length is k
Footpath, and the path for the bit of kth+1 that s merging group of paths is respectively used to s the 2nd Polar codes divides and merging treatment.
Lmax is predetermined maximum path number.Can be excessive to avoid algorithm complex using threshold value Lmax.
As k=N/s, the P bars that length is k × s can be merged a plurality of merging path that path is N as length.
Alternatively, as another embodiment, according to the kth bit pair in the first Polar codes with s the 2nd Polar codes
The property for the bit answered, merges the s corresponding s × 2L articles of splitpaths altogether of the 2nd Polar codes, obtains the P that length is k × s
When bar merges path, when bit corresponding with the kth bit of s the 2nd Polar codes is to freeze bit in the first Polar codes
When, select the splitpath that kth bit is equal to particular value to merge to obtain length to merge path among the P bars of k × s,
P=the L so obtained.Above-mentioned particular value is the value for freezing bit, such as ' 0 '.
Alternatively, as another embodiment, according to the kth bit pair in the first Polar codes with s the 2nd Polar codes
The property for the bit answered, merges the s corresponding s × 2L articles of splitpaths altogether of the 2nd Polar codes, obtains the P that length is k × s
When bar merges path, when there are w information in bit corresponding with the kth bit of s the 2nd Polar codes in the first Polar codes
Bit and s-w when freezing bit, wherein w be integer and 0≤w≤s, deletes and is not equal to corresponding to the kth bit for freezing bit
The splitpath of particular value, merges remaining splitpath, obtains merging path among the P bars that length is k × s, so obtains
P=2w×L.Above-mentioned particular value is the value for freezing bit, such as ' 0 '.
Alternatively, in a step 101, can be by the received signal vector order of the first Polar codes as another embodiment
Ground is divided into s sections of received signal vectors, every section of received signal vector as a 2nd Polar code received signal vector with true
Determine s the 2nd Polar codes.
With reference to specific example, the decoding process of the more detailed description embodiment of the present invention.Fig. 2 is the situation of s=2
Under decoding process schematic diagram.
Be Polar codes that two length are N/2 first by the Polar code divisions that length is N, i.e., preceding half of received signal vectorWith rear half of received signal vector.Corresponding input bit meets：
In other words,
SC-List the decoder A and B that two length are N/2 can be used, the Polar codes of two N/2 long are carried out respectively
Parallel route divides.Before path division is carried out to kth bit, it is assumed that L current survivor path be：Here (1≤m≤L).Wherein pathFor
Decoder A, pathFor decoder B.
The process of the parallel SC-List decodings of two-way is as follows：
Decoder A first and decoder B produces 2L new path respectively, and wherein decoder A produces 2L new paths
For (1≤m≤L);Decoder B produces 2L new paths (1≤m≤L)。
If vkAnd vk+N/2All it is to freeze bit, i.e. vk=0 and vk+N/2=0, then Obtain L merging path：L new path(1≤m≤L) is used for L new path of decoder A(1≤m≤L) is used for decoder B.
If vkIt is FROZEN bits (vk=0) vk+N/2It is information bit, then Obtain 2L merging path：
Specifically, this 2L merging path is:With1≤m≤L.The metric for merging path is the sum of 2 path metrics:
M(Pm(vk+N/2))=M ({ Am,vk+N/2})+M({Bm,vk+N/2), 1≤m≤L.Here, path metric value is path probability value
Logarithm, M ({ Am,vk+N/2) it is pathPath metric value;M({Bm,vk+N/2) it is pathPath metric value.
In addition, if 2L>Lmax, Lmax is the number of maximum path set in advance here, then from 2L path
Lmax path of path selection metric maximum, then from the Lmax merging path chosenDecomposite
Lmax pathFor decoder A and Lmax pathFor decoder B.
If vkAnd vk+N/2All it is information bit, then Obtain 4L merging road
Footpath：Here 1≤m≤L, vk,vk+N/2
∈{0,1}.Specifically, this 4L path is: With1≤m≤L.The metric for merging path is two path degree
The sum of amount:HereIt is pathPath metric value;
It is pathPath metric value.
In addition, if 4L>Lmax, then the Lmax path of path selection metric maximum from 4L path, then
From the Lmax path chosenDecomposite Lmax pathFor decoder A andFor translating
Code device B.
All decoding is completed when decoder to calculate, i.e., as k=N/2, all merging paths are obtained according to above method
（At this moment all merging path lengths are all N）, outgoing route metric maximum（Corresponding probable value）A maximum merging road
Footpath, then passes through：WithObtainWith.FinallyRearrange to obtain original
The input bit of beginning。
The embodiment of Fig. 2 is concurrently to 2 the 2nd Polar codes into row decoding, in such manner, it is possible to improve decoding handling capacity and drop
Low time delay.
Fig. 3 be s=4 in the case of decoding process schematic diagram.
Be Polar codes that 4 length are N/4 first by the Polar code divisions that length is N, i.e. four received signal vectors With.Corresponding input bit meets：
It can obtain：
SC-List decoders A, B, C and D that 4 length are N/4 can be used.4 decoders are used respectively WithAs input.Before path division is carried out to kth bit, it is assumed that L current path is：
Here (1
≤m≤L).Wherein path:For decoder A, pathFor
Decoder B, pathFor decoder C, pathFor decoding
Device D.
The process of the parallel SC-List decodings in 4 tunnels is as follows：
Decoder A/B/C/D first produces 2L new path：Wherein decoder A produces 2L new pathDecoder B produces 2L new pathDecoder C produces 2L new path 1≤m≤L;Decoder D produces 2L new path,1≤m≤L。
The path for merging path is the combination in 4 paths：
Here
Travel through the various combination (v of all variablesk,vk+N/4,vk+N/2,vk+3N/4), we obtain all merging path, pay attention to：
Since FROZEN bits are " 0 ", it is assumed that all number of combinations are J=2W, w is (v herek,vk+N/4,vk+N/2,vk+3N/4) in information ratio
Special number, the number for merging path is JL.It can be seen that w={ 0,1,2,3,4 }, thus J={ 1,2,4,8,16 }.Merge road
The metric in footpath is the sum of corresponding path metric value from 4 decoders.That is：
In addition, if JL>Lmax, then the Lmax paths of Lmax path metric value maximums are chosen from JL path,
Then from the Lmax path chosenIn decomposite 5Lmax pathFor
Decoder A, Lmax pathDecoder B, Lmax pathFor decoder C, Lmax pathTranslate
Code device D.
3）All decoding is completed when decoder to calculate, i.e., as k=N/4, all merging paths are obtained according to above method
（At this moment all merging path lengths are all N）, outgoing route metric maximum（Corresponding probable value）A maximum merging road
Footpath, then passes through：
Obtain.FinallyRearrange to obtain original input bit。
The embodiment of Fig. 3 is concurrently to 4 the 2nd Polar codes into row decoding, in such manner, it is possible to improve decoding handling capacity and drop
Low time delay.
For other s values, can similarly it be segmented and independent interpretation, details are not described herein.
Fig. 4 is the block diagram of the code translator of one embodiment of the invention Polar codes.The code translator 40 of Fig. 4 includes segmentation
Unit 41, split degree unit 42, selecting unit 43 and determination unit 44.
Segmenting unit 41, for being s the 2nd Polar codes to intercouple by the first Polar code divisions that length is N, its
In each 2nd Polar codes length be N/s, N and s be 2 integer power and N>s；
Split degree unit 42, the path for concurrently s the 2nd Polar codes to be carried out with List decodings divide, and
The splitpath of s the 2nd Polar codes is merged after the division of path, so as to obtain a plurality of merging path that length is N；
Selecting unit 43, for selecting length to merge path for first in a plurality of merging path of N, first merges path
The path of path metric value maximum or be a plurality of merging path that length is N in a plurality of merging path for being N for the length
In pass through the path of cyclic redundancy check (CRC)；
Determination unit 44, for merging path according to first, obtains the decoding result of the first Polar codes.
The Polar code divisions that length is N are multistage Polar codes by the embodiment of the present invention, to the Polar codes after segmentation independently
Path divides, and then the path of obtained division merges processing, finally obtains the merging path of path metric value maximum,
So as to obtaining the decoding result of original Polar codes, it is not necessary to sequentially to N number of bit into row decoding, it is possible to increase Polar codes
Decoding handling capacity, reduce decoding latency.
In addition, the embodiment of the present invention only needs the decoder that length is N/s, the resource occupied by single decoder can be reduced
And computation complexity, it can so flexibly be adapted to resource-constrained scene.
It should be noted that the decoder in the embodiment of the present invention can be realized completely by specialized hardware, such as dedicated chip,
Integrated circuit or other firmwares；Can also by general processor and its instruction realize, the instruction can be stored in processor or
Person is stored in independent memory.These forms are each fallen within the range of the embodiment of the present invention.
Alternatively, include as one embodiment, split degree unit 42：The decoder 421 that s length is N/s, is used for
Path division concurrently is carried out to the kth bit of each 2nd Polar codes, it is 2L articles point corresponding to obtain each 2nd Polar codes
Split path, k, L for positive integer and 1≤k≤N/s, k=1 when L=1, k>L is that the survival before the division of path is carried out to kth bit when 1
Number of path；Combiner 422, for the property according to bit corresponding with the kth bit of s the 2nd Polar codes in the first Polar codes
Matter, merges the s corresponding s × 2L articles of splitpaths altogether of the 2nd Polar codes, obtains the P bars that length is k × s and merges path, P
For positive integer and P≤s × 2L, the P bars that length is k × s merge path and are used for subsequent path division and merging treatment.
Alternatively, decomposer 423 can also be included as another embodiment, split degree unit 42.Work as k<During N/s, such as
Fruit P≤Lmax, then it is s merging group of paths that decomposer, which is used to the P bars that length is k × s merging path decomposing, each merges road
Footpath group includes the P bars that length is k and merges path as survivor path, and decomposer is additionally operable to merge group of paths difference by s
Output is to s decoder, so that s decoder concurrently carries out the path division of the bit of kth+1 of s the 2nd Polar codes.Such as
Fruit P>Lmax, then decomposer, which is used to merge in path from the P bars that length is k × s, selects the Lmax bars of path metric value maximum to close
And path, and selected Lmax bars are merged into path decomposing for s merging group of paths, each group of paths that merges is comprising length
The Lmax bars of k merge path as survivor path, and decomposer is additionally operable to export s merging group of paths to s respectively and translates
Code device, so that s decoder concurrently carries out the path division of the bit of kth+1 of s the 2nd Polar codes.Wherein, Lmax is pre-
Fixed maximum path number.
Alternatively, as another embodiment, as k=N/s, combiner 422 is additionally operable to merge the P bars that length is k × s
Path is as a plurality of merging path that length is N.
Alternatively, as another embodiment, combiner 422 is specifically used for working as in the first Polar codes and s the 2nd Polar
The corresponding bit of kth bit of code be when freezing bit select kth bit be equal to particular value splitpath merge with
Obtain merging path among the P bars that length is k × s, merge path as P bars using path is merged among P bars, wherein P=L is specific
It is worth to freeze the value of bit.
Alternatively, as another embodiment, combiner 422 is specifically used for working as in the first Polar codes and s the 2nd Polar
In the corresponding bit of kth bit of code there are w information bit and s-w are a freeze bit when, wherein w is integer and 0≤w≤s,
Delete and correspond to the splitpath that the kth bit for freezing bit is not equal to particular value, merge remaining splitpath, obtain length
To merge path among the P bars of k × s, merge path, wherein P=2 as P bars using path is merged among P barsw× L, particular value are
Freeze the value of bit.
Alternatively, as another embodiment, decoder 421 is additionally operable to calculate the path metric value of every splitpath.
Alternatively, as another embodiment, segmenting unit 41 be specifically used for by the reception signal of the first Polar codes to
Amount is sequentially divided into s sections of received signal vectors, reception letter of the every section of received signal vector as a 2nd Polar code
Number vector is to determine s the 2nd Polar codes.
Fig. 5 is the schematic block diagram of the device of another embodiment of the present invention.The device 50 of Fig. 5 can be used for realizing above method reality
Apply each step and method in example.Device 50 can be applied to base station or terminal in various communication systems.In the embodiment of Fig. 5,
Device 50 includes radiating circuit 502, receiving circuit 503, decoding processor 504, processing unit 505, memory 506 and antenna
501.The operation of 505 control device 50 of processing unit, and can be used for handling signal.Processing unit 505 can also be known as CPU
（Central Processing Unit, central processing unit）.Memory 506 can include read-only storage and arbitrary access
Memory, and provide instruction and data to processing unit 505.The a part of of memory 506 can also be random including non-volatile row
Access memory（NVRAM）.In specific application, device 50 can be embedded in or itself can be exactly such as mobile phone etc
Wireless telecom equipment, the carrier for accommodating radiating circuit 502 and receiving circuit 503 can also be included, to allow device 50 and remote
Data transmitting and reception are carried out between journey position.Radiating circuit 502 and receiving circuit 503 may be coupled to antenna 501.Device 50
Various components be coupled by bus system 509, wherein bus system 509 further includes in addition to including data/address bus
Power bus, controlling bus and status signal bus in addition.But for the sake of clear explanation, various buses are all designated as always in figure
Linear system system 509.
The method that the embodiments of the present invention disclose can be applied in decoding processor 504, or by decoding processor
504 realize.Decoding processor 504 is probably a kind of IC chip, has the disposal ability of signal.During realization,
Each step of the above method can pass through the integrated logic circuit of the hardware in decoding processor 504 or the instruction of software form
Complete.These instructions can be realized and controlled to coordinate by processing unit 505.For performing the side of announcement of the embodiment of the present invention
Method, above-mentioned decoding processor can be general processor, digital signal processor（DSP）, application-specific integrated circuit（ASIC）, it is existing
Into programmable gate array（FPGA）Either other programmable logic device, discrete gate or transistor logic, discrete hardware
Component.It can realize or perform disclosed each method, step and the logic diagram in the embodiment of the present invention.General processor can
To be microprocessor or the processor can also be any conventional processor, decoder etc..With reference to institute of the embodiment of the present invention
The step of disclosed method, can be embodied directly in hardware decoding processor and perform completion, or with the hardware in decoding processor
And software module combination performs completion.Software module can be located at random access memory, and flash memory, read-only storage, may be programmed read-only
In the storage medium of this area such as memory or electrically erasable programmable memory, register maturation.The storage medium is located at
The step of memory 506, decoding processor 504 reads the information in memory 506, the above method is completed with reference to its hardware.
Specifically, memory 506 can be stored so that decoding processor 504 or processing unit 505 perform the finger of procedure below
Order：
It is s the 2nd Polar codes by the first Polar code divisions that length is N, wherein the length of each 2nd Polar codes is
N/s, N and s are 2 integer power and N>s；Concurrently s the 2nd Polar codes are divided into the path that row-column list List is decoded, and
The splitpath of s the 2nd Polar codes is merged after dividing in path, so as to obtain a plurality of merging path that length is N；
Length is selected to merge path for first in a plurality of merging path of N, the first merging path is a plurality of merging path that length is N
The path of middle path metric value maximum is by the path of cyclic redundancy check (CRC) in a plurality of merging path that length is N；
Merge path according to first, obtain the decoding result of the first Polar codes.
The Polar code divisions that length is N are multistage Polar codes by the embodiment of the present invention, to the Polar codes after segmentation independently
Path divides, and then the path of obtained division merges processing, finally obtains the merging path of path metric value maximum,
So as to obtaining the decoding result of original Polar codes, it is not necessary to sequentially to N number of bit into row decoding, it is possible to increase Polar codes
Decoding handling capacity, reduce decoding latency.
Alternatively, as one embodiment, memory 506 also stores so that decoding processor 504 or processing unit 505 are held
The instruction of row procedure below：Path division concurrently is carried out to the kth bit of each 2nd Polar codes, obtains each second
The corresponding 2L bars splitpath of Polar codes, k, L for positive integer and 1≤k≤N/s, k=1 when L=1, k>When 1 L be to kth bit into
Survivor path number before the division of walking along the street footpath；According to bit corresponding with the kth bit of s the 2nd Polar codes in the first Polar codes
Property, merge the corresponding s × 2L articles of splitpaths altogether of s the 2nd Polar codes, obtain the P bars merging road that length is k × s
Footpath, P are positive integer and P≤s × 2L；Path is merged according to the P bars that length is k × s and carries out subsequent path division and merging treatment,
To obtain a plurality of merging path of the length as N.
Alternatively, as another embodiment, memory 506 also stores so that decoding processor 504 or processing unit 505 are held
The instruction of row procedure below：Work as k<During N/s, if P≤Lmax, it is s conjunction that the P bars that length is k × s are merged path decomposing
And group of paths, each group of paths that merges merge group of paths comprising the P bars merging path that length is k as survivor path, and by s
It is respectively used to path division and the merging treatment of the bit of kth+1 of s the 2nd Polar codes；If P>Lmax, then be k from length
The P bars of × s, which merge, selects the Lmax bars of path metric value maximum to merge path in path, selected Lmax bars are merged path
S merging group of paths is decomposed into, each group of paths that merges merges path as survivor path comprising the Lmax bars that length is k, and
S merging group of paths is respectively used to path division and the merging treatment of the bit of kth+1 of s the 2nd Polar codes；As k=N/s
When, the P bars that length is k × s are merged into a plurality of merging path that path is N as length, wherein Lmax is predetermined most main road
Footpath number.
Alternatively, as another embodiment, memory 506 also stores so that decoding processor 504 or processing unit 505 are held
The instruction of row procedure below：When bit corresponding with the kth bit of s the 2nd Polar codes is to freeze to compare in the first Polar codes
When special, the splitpath that kth bit is equal to particular value is selected to merge to obtain length to merge road among the P bars of k × s
Footpath, merges path, wherein P=L, particular value is the value for freezing bit using path is merged among P bars as P bars.
Alternatively, as another embodiment, memory 506 also stores so that decoding processor 504 or processing unit 505 are held
The instruction of row procedure below：When there are w in bit corresponding with the kth bit of s the 2nd Polar codes in the first Polar codes
Information bit and s-w wherein w be integer and 0≤w≤s when freezing bit, is deleted corresponding to freezing the kth bit of bit not
Equal to the splitpath of particular value, merge remaining splitpath, obtain merging path among the P bars that length is k × s, by P bars
Centre merges path and merges path, wherein P=2 as P barsw× L, particular value are the value for freezing bit.
Alternatively, as another embodiment, memory 506 also stores so that decoding processor 504 or processing unit 505 are held
The instruction of row procedure below：The received signal vector of first Polar codes is sequentially divided into s sections of received signal vectors, every section
Received signal vector is as the received signal vector of a 2nd Polar code to determine s the 2nd Polar codes.
Those of ordinary skill in the art may realize that each exemplary list described with reference to the embodiments described herein
Member and algorithm steps, can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually
Performed with hardware or software mode, application-specific and design constraint depending on technical solution.Professional technician
Described function can be realized using distinct methods to each specific application, but this realization is it is not considered that exceed
The scope of the present invention.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and unit, may be referred to the corresponding process in preceding method embodiment, details are not described herein.
In several embodiments provided herein, it should be understood that disclosed systems, devices and methods, can be with
Realize by another way.For example, device embodiment described above is only schematical, for example, the unit
Division, is only a kind of division of logic function, can there is other dividing mode, such as multiple units or component when actually realizing
Another system can be combined or be desirably integrated into, or some features can be ignored, or do not perform.It is another, it is shown or
The mutual coupling, direct-coupling or communication connection discussed can be the indirect coupling by some interfaces, device or unit
Close or communicate to connect, can be electrical, machinery or other forms.
The unit illustrated as separating component may or may not be physically separate, be shown as unit
The component shown may or may not be physical location, you can with positioned at a place, or can also be distributed to multiple
In network unit.Some or all of unit therein can be selected to realize the mesh of this embodiment scheme according to the actual needs
's.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, can also
That unit is individually physically present, can also two or more units integrate in a unit.
If the function is realized in the form of SFU software functional unit and is used as independent production marketing or in use, can be with
It is stored in a computer read/write memory medium.Based on such understanding, technical scheme is substantially in other words
The part to contribute to the prior art or the part of the technical solution can be embodied in the form of software product, the meter
Calculation machine software product is stored in a storage medium, including some instructions are used so that a computer equipment（Can be
People's computer, server, or network equipment etc.）Perform all or part of step of each embodiment the method for the present invention.
And foregoing storage medium includes：USB flash disk, mobile hard disk, read-only storage（ROM, Read-Only Memory）, arbitrary access deposits
Reservoir（RAM, Random Access Memory）, magnetic disc or CD etc. are various can be with the medium of store program codes.
The above description is merely a specific embodiment, but protection scope of the present invention is not limited thereto, any
Those familiar with the art the invention discloses technical scope in, change or replacement can be readily occurred in, should all be contained
Cover within protection scope of the present invention.Therefore, protection scope of the present invention answers the scope of the claims of being subject to.
Claims (14)
- A kind of 1. interpretation method of polarity Polar codes, it is characterised in that including：It is s the 2nd Polar codes by the first Polar code divisions that length is N, wherein, s the 2nd Polar codes intercouple, each The length of 2nd Polar codes is the integer power that N/s, N and s are 2 and N>s；Concurrently the s the 2nd Polar codes are divided into the path that row-column list List is decoded, and to described after the division of path The path of the division of s the 2nd Polar codes merges, so as to obtain a plurality of merging path that length is N；The length is selected to merge path for first in a plurality of merging path of N, the first merging path is the length For path metric value maximum in a plurality of merging path of N path or be to pass through in a plurality of merging path that the length is N The path of cyclic redundancy check (CRC)；Merge path according to described first, obtain the decoding result of the first Polar codes.
- 2. interpretation method as claimed in claim 1, it is characterised in that described that concurrently the s the 2nd Polar codes are carried out Path divides, and the path of the division after the division of path to the s the 2nd Polar codes merges, so as to obtain length For a plurality of merging path of N, including：Path division concurrently is carried out to the kth bit of each 2nd Polar codes, obtains the corresponding 2L of each 2nd Polar codes Bar splitpath, L=1, k when k, L are positive integer and 1≤k≤N/s, k=1>L is to carry out the road to the kth bit when 1 Survivor path number before the division of footpath；According to the property of bit corresponding with the kth bit of the s the 2nd Polar codes in the first Polar codes, merge institute The s corresponding s × 2L articles of splitpaths altogether of the 2nd Polar codes are stated, the P bars that length is k × s is obtained and merges path, P is just whole Number and P≤s × 2L；Path is merged according to the P bars that the length is k × s and carries out subsequent path division and merging treatment, to obtain the length For a plurality of merging path of N.
- 3. interpretation method as claimed in claim 2, it is characterised in that described that road is merged according to the P bars that the length is k × s Footpath carries out subsequent path division and merging treatment, to obtain a plurality of merging path of the length as N, including：Work as k<During N/s, if P≤Lmax, it is s merging group of paths that the P bars that the length is k × s are merged path decomposing, Each group of paths that merges merges group of paths comprising the P bars merging path that length is k as survivor path, and by described s It is respectively used to in the path division of the bit of kth+1 of s the 2nd Polar codes and merging treatment；If P>Lmax, then from described The P bars that length is k × s, which merge, selects the Lmax bars of path metric value maximum to merge path in path, by selected Lmax bars Merge path decomposing for s merging group of paths, each merging group of paths includes the Lmax bars that length is k and merges path conduct Survivor path, and by described s merging group of paths be respectively used to path division to the bit of kth+1 of s the 2nd Polar codes with In merging treatment；As k=N/s, the P bars that the length is k × s are merged into a plurality of merging path that path is N as the length,Wherein Lmax is predetermined maximum path number.
- 4. interpretation method as claimed in claim 2, it is characterised in that described according to a with the s in the first Polar codes The property of the corresponding bit of kth bit of 2nd Polar codes, it is s × 2L articles altogether corresponding to merge the s the 2nd Polar codes Splitpath, obtains the P bars that length is k × s and merges path, including：When bit corresponding with the kth bit of the s the 2nd Polar codes is to freeze bit in the first Polar codes, The splitpath that selection kth bit is equal to particular value is merged to obtain length to merge path among the P bars of k × s, by institute State merging path among P bars and merge path, wherein P=L as the P bars, the particular value is the value for freezing bit.
- 5. interpretation method as claimed in claim 2, it is characterised in that described according to a with the s in the first Polar codes The property of the corresponding bit of kth bit of 2nd Polar codes, it is s × 2L articles altogether corresponding to merge the s the 2nd Polar codes Splitpath, obtains the P bars that length is k × s and merges path, including：When there are w information ratio in bit corresponding with the kth bit of the s the 2nd Polar codes in the first Polar codes When spy freezes bit with s-w, wherein w is integer and 0≤w≤s, and deletion is not equal to special corresponding to the kth bit for freezing bit The splitpath of definite value, merges remaining splitpath, obtains merging path among the P bars that length is k × s, by the P bars Between merge path as the P bars merge path, wherein P=2w× L, the particular value are the value for freezing bit.
- 6. such as claim 1-5 any one of them interpretation methods, it is characterised in that the first Polar codes by length for N It is divided into s the 2nd Polar codes, including：The received signal vector of the first Polar codes is sequentially divided into s sections of received signal vectors, every section receive signal to The received signal vector as a 2nd Polar code is measured to determine the s the 2nd Polar codes.
- A kind of 7. code translator of polarity Polar codes, it is characterised in that including：Segmenting unit, for being s the 2nd Polar codes by the first Polar code divisions that length is N, wherein, s the 2nd Polar codes Intercouple, the length of each 2nd Polar codes is integer power and N that N/s, N and s are 2>s；Split degree unit, the path for concurrently the s the 2nd Polar codes to be carried out with List decodings divide, and on road The path of division after the division of footpath to the s the 2nd Polar codes merges, so as to obtain a plurality of merging road that length is N Footpath；Selecting unit, for selecting the length to merge path for first in a plurality of merging path of N, described first merges road Footpath is the path of path metric value maximum or be a plurality of conjunction that the length is N in a plurality of merging path that the length is N And pass through the path of cyclic redundancy check (CRC) in path；Determination unit, for merging path according to described first, obtains the decoding result of the first Polar codes.
- 8. code translator as claimed in claim 7, it is characterised in that the split degree unit, including：The decoder that s length is N/s, for concurrently carrying out path division to the kth bit of each 2nd Polar codes, obtains To the corresponding 2L articles of splitpath of each 2nd Polar codes, L=1, k when k, L are positive integer and 1≤k≤N/s, k=1>L when 1 To carry out the survivor path number before the path division to the kth bit；Combiner, for according to bit corresponding with the kth bit of the s the 2nd Polar codes in the first Polar codes Property, merges the s corresponding s × 2L articles of splitpaths altogether of the 2nd Polar codes, obtains the P bars that length is k × s and merges path, P is positive integer and P≤s × 2L, and the P bars that the length is k × s merge path and are used for subsequent path division and merging treatment.
- 9. code translator as claimed in claim 8, it is characterised in that the split degree unit, further includes decomposer, work as k< During N/s,If P≤Lmax, it is s merging road that the decomposer, which is used to the P bars that the length is k × s merging path decomposing, Footpath group, each group of paths that merges includes P bar merging path of the length for k as survivor path, and the decomposer is also For exporting respectively described s merging group of paths to the s decoder, so that the s decoder concurrently carries out s The path division of the bit of kth+1 of 2nd Polar codes；If P>Lmax, then the decomposer, which is used to merge in path from the P bars that the length is k × s, selects path metric value Maximum Lmax bars merge path, and selected Lmax bars are merged path decomposing for s merging group of paths, each conjunction And group of paths includes the Lmax bars that length is k and merges path as survivor path, and the decomposer is additionally operable to the s Merge group of paths to export respectively to the s decoder, so that the s decoder concurrently carries out a 2nd Polar codes of s The path division of the bit of kth+1；Wherein Lmax is predetermined maximum path number.
- 10. code translator as claimed in claim 8, it is characterised in that as k=N/s, the combiner is additionally operable to will be described The P bars that length is k × s merge a plurality of merging path that path is N as the length.
- 11. code translator as claimed in claim 8, it is characterised in that the combiner is specifically used for working as the first Polar Bit corresponding with the kth bit of the s the 2nd Polar codes is when freezing bit in code, selects kth bit to be equal to specific The splitpath of value is merged to obtain length to merge path among the P bars of k × s, is made path is merged among the P bars Merge path, wherein P=L for the P bars, the particular value is the value for freezing bit.
- 12. code translator as claimed in claim 8, it is characterised in that the combiner is specifically used for working as the first Polar There are w information bit and s-w in bit corresponding with the kth bit of the s the 2nd Polar codes in code to freeze bit When, wherein w is integer and 0≤w≤s, deletes and corresponds to the splitpath that the kth bit for freezing bit is not equal to particular value, closes And remaining splitpath, obtain merging path among the P bars that length is k × s, path will be merged among the P bars as institute State P bars and merge path, wherein P=2w× L, the particular value are the value for freezing bit.
- 13. code translator as claimed in claim 8, it is characterised in that the decoder is additionally operable to calculate every splitpath Path metric value.
- 14. such as claim 7-13 any one of them code translators, it is characterised in that the segmenting unit is specifically used for institute The received signal vector for stating the first Polar codes is sequentially divided into s sections of received signal vectors, and every section of received signal vector is as one The received signal vector of a 2nd Polar codes is with the definite s the 2nd Polar codes.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310152544.5A CN104124979B (en) | 2013-04-27 | 2013-04-27 | The interpretation method and code translator of polar code |
| PCT/CN2013/088492 WO2014173133A1 (en) | 2013-04-27 | 2013-12-04 | Decoding method and decoding apparatus for polar code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310152544.5A CN104124979B (en) | 2013-04-27 | 2013-04-27 | The interpretation method and code translator of polar code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104124979A CN104124979A (en) | 2014-10-29 |
| CN104124979B true CN104124979B (en) | 2018-04-17 |
Family
ID=51770259
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310152544.5A Active CN104124979B (en) | 2013-04-27 | 2013-04-27 | The interpretation method and code translator of polar code |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN104124979B (en) |
| WO (1) | WO2014173133A1 (en) |
Families Citing this family (42)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104038234B (en) | 2013-03-07 | 2017-09-29 | 华为技术有限公司 | The interpretation method and decoder of polar code |
| RU2649957C2 (en) | 2013-12-24 | 2018-04-05 | Хуавей Текнолоджиз Ко., Лтд. | Polar code decoding method and decoding device |
| WO2016172934A1 (en) * | 2015-04-30 | 2016-11-03 | 华为技术有限公司 | Decoder and decoding method for polar codes |
| WO2016172940A1 (en) * | 2015-04-30 | 2016-11-03 | 华为技术有限公司 | Decoding method and decoding device for polar code |
| WO2016191996A1 (en) * | 2015-05-31 | 2016-12-08 | 华为技术有限公司 | Path merging method and device for polar code, and decoding device |
| KR102433645B1 (en) * | 2015-11-09 | 2022-08-18 | 삼성전자주식회사 | Method and apparatus for decoding in a wireless communication system |
| US10581462B2 (en) | 2015-12-01 | 2020-03-03 | Huawei Technologies Co., Ltd. | Signature-enabled polar encoder and decoder |
| CN105515590B (en) * | 2015-12-09 | 2019-01-25 | 东南大学 | A kind of effective low complex degree serially offsets list polarization code coding method |
| CN105553892B (en) * | 2015-12-23 | 2018-08-14 | 北京航空航天大学 | A kind of channel estimation methods based on polar codes |
| US10312947B2 (en) * | 2016-01-21 | 2019-06-04 | Huawei Technologies Co., Ltd. | Concatenated and sliding-window polar coding |
| CN107124188B (en) * | 2016-02-24 | 2020-08-07 | 华为技术有限公司 | Encoding method, decoding method, encoding device and decoding device for polarization code |
| JP6781270B2 (en) | 2016-04-29 | 2020-11-04 | ホアウェイ・テクノロジーズ・カンパニー・リミテッド | Polar A method and device for encoding and decoding using a Polar code. |
| CN107342842B (en) | 2016-08-11 | 2022-04-05 | 华为技术有限公司 | Method, device and equipment for polarization coding |
| US10447435B2 (en) | 2016-08-19 | 2019-10-15 | Huawei Technologies Co., Ltd. | Reduced-stage polar decoding |
| US10153787B2 (en) * | 2016-09-20 | 2018-12-11 | Samsung Electronics Co., Ltd | Apparatus and method for parallelized successive cancellation decoding and successive cancellation list decoding of polar codes |
| CN108631789B (en) * | 2016-10-25 | 2019-07-09 | 华为技术有限公司 | Coding, interpretation method and equipment |
| EP3539237B1 (en) * | 2016-11-11 | 2022-08-03 | Telefonaktiebolaget LM Ericsson (publ) | Error detection in communication systems using polar coded data transmission |
| CN106788453B (en) * | 2016-11-11 | 2020-06-19 | 山东科技大学 | Parallel polar code decoding method and device |
| CN106506079B (en) * | 2016-11-29 | 2018-09-21 | 东南大学 | Polarization code optimum design method in four color visible light communication systems |
| WO2018098669A1 (en) | 2016-11-30 | 2018-06-07 | Qualcomm Incorporated | Techniques for redundancy generation of polar codes during wireless communications |
| WO2018107430A1 (en) | 2016-12-15 | 2018-06-21 | Qualcomm Incorporated | Crc bits for joint decoding and verification of control information using polar codes |
| US10348328B2 (en) | 2017-01-06 | 2019-07-09 | At&T Intellectual Property I, L.P. | Reducing control channel overhead using polar codes |
| US10277252B2 (en) | 2017-01-09 | 2019-04-30 | At&T Intellectual Property I, L.P. | Encoding data with polar codes for control channels |
| CN108390739B (en) * | 2017-02-03 | 2021-01-29 | 华为技术有限公司 | Data processing method and device |
| CN108429599B (en) * | 2017-02-13 | 2022-03-01 | 上海诺基亚贝尔软件有限公司 | Method and apparatus for data processing in a communication system |
| WO2018148866A1 (en) * | 2017-02-14 | 2018-08-23 | Qualcomm Incorporated | False alarm rate suppression for polar codes |
| CN108540259B (en) | 2017-03-01 | 2020-07-10 | 电信科学技术研究院 | Method and device for encoding and decoding polarization code |
| CN109412608B (en) * | 2017-03-24 | 2019-11-05 | 华为技术有限公司 | Polar coding method and code device, interpretation method and code translator |
| CN109004939A (en) * | 2017-06-06 | 2018-12-14 | 华为技术有限公司 | Polarize decoder and method |
| CN109327280B (en) * | 2017-08-01 | 2021-01-15 | 华为技术有限公司 | Segmented coding method and device |
| US10340950B2 (en) | 2017-08-21 | 2019-07-02 | Qualcomm Incorporated | Reducing the search space of maximum-likelihood decoding for polar codes |
| CN109428608A (en) * | 2017-08-25 | 2019-03-05 | 华为技术有限公司 | The interpretation method and decoder of polarization code |
| CN109428607B (en) * | 2017-08-29 | 2020-09-18 | 华为技术有限公司 | Decoding method, decoder and decoding equipment of polarization code |
| CN109756299B (en) * | 2017-11-04 | 2021-01-26 | 上海朗帛通信技术有限公司 | Method and device in user equipment and base station for wireless communication |
| CN108282264B (en) * | 2018-01-05 | 2020-01-31 | 西安电子科技大学 | Polar code decoding method based on bit flipping serial elimination list algorithm |
| US10608669B2 (en) | 2018-02-16 | 2020-03-31 | At&T Intellectual Property I, L.P. | Performance of data channel using polar codes for a wireless communication system |
| CN108390677A (en) * | 2018-03-20 | 2018-08-10 | 山东大学 | A kind of coding and decoding method of polarization code optimization |
| CN110858792B (en) * | 2018-08-23 | 2020-12-25 | 华为技术有限公司 | Method and device for deleting decoding path |
| EP3840260A4 (en) * | 2018-08-30 | 2021-08-04 | Huawei Technologies Co., Ltd. | Scl parallel decoding method, apparatus, and device |
| CN109274460B (en) * | 2018-09-14 | 2021-01-08 | 北京邮电大学 | Multi-bit parallel structure serial offset decoding method and device |
| CN111200439B (en) | 2018-11-16 | 2022-05-06 | 华为技术有限公司 | Decoding method, device and equipment |
| CN111865487B (en) | 2019-04-29 | 2022-07-29 | 华为技术有限公司 | Coding method and communication equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102122966A (en) * | 2011-04-15 | 2011-07-13 | 北京邮电大学 | Channel-polarization-based encoder for staggered structure duplication code, and encoding and decoding methods thereof |
| CN102694625A (en) * | 2012-06-15 | 2012-09-26 | 北京邮电大学 | Polarization code decoding method for cyclic redundancy check assistance |
| KR20130001494A (en) * | 2011-06-27 | 2013-01-04 | 전북대학교산학협력단 | Decoding method using polar code sequence |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7383484B2 (en) * | 2004-03-12 | 2008-06-03 | Seagate Technology Llc | Cyclic redundancy check based message passing in turbo product code decoding |
| US8116242B2 (en) * | 2006-07-18 | 2012-02-14 | Motorola Mobility, Inc. | Receiver having multi-antenna log likelihood ratio generation with channel estimation error |
| CN101373978B (en) * | 2007-08-20 | 2011-06-15 | 华为技术有限公司 | Method and apparatus for decoding Turbo code |
| CN101951266B (en) * | 2010-08-24 | 2013-04-24 | 中国科学院计算技术研究所 | Turbo parallel decoding method and decoder |
| CN102104444A (en) * | 2010-12-29 | 2011-06-22 | 重庆邮电大学 | Rapid encoding and decoding method for channel quality indication in LTE (Long Term Evolution) system |
-
2013
- 2013-04-27 CN CN201310152544.5A patent/CN104124979B/en active Active
- 2013-12-04 WO PCT/CN2013/088492 patent/WO2014173133A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102122966A (en) * | 2011-04-15 | 2011-07-13 | 北京邮电大学 | Channel-polarization-based encoder for staggered structure duplication code, and encoding and decoding methods thereof |
| KR20130001494A (en) * | 2011-06-27 | 2013-01-04 | 전북대학교산학협력단 | Decoding method using polar code sequence |
| CN102694625A (en) * | 2012-06-15 | 2012-09-26 | 北京邮电大学 | Polarization code decoding method for cyclic redundancy check assistance |
Non-Patent Citations (2)
| Title |
|---|
| An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check;Bin Li 等;《IEEE COMMUNICATIONS LETTERS》;20121231;第6卷(第12期);2045页第III节 * |
| An FPGA Implementation Architecture for Decoding of Polar Codes;Alptekin Pamuk;《2011 8th International Symposium on Wireless Communication Systems》;20111109;438-440页第II节-第III节，图1-4 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104124979A (en) | 2014-10-29 |
| WO2014173133A1 (en) | 2014-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104124979B (en) | The interpretation method and code translator of polar code | |
| CN104038234B (en) | The interpretation method and decoder of polar code | |
| US10886950B2 (en) | Method and apparatus for generating a code word | |
| US9319070B2 (en) | Method and device for decoding polar codes | |
| CN110061745B (en) | Method and device for rate matching and rate de-matching | |
| JP6817452B2 (en) | Rate matching method, encoding device, and communication device | |
| EP3381128B1 (en) | Memory management and path sorting in a polar code successive cancellation list decoder | |
| CN107342845B (en) | Method and device for rate matching | |
| RU2595542C2 (en) | Device and method for transmitting and receiving data in communication/broadcasting system | |
| US6603412B2 (en) | Interleaved coder and method | |
| CN109547034B (en) | Decoding method and device, decoder | |
| CN108574561A (en) | The method and apparatus of polarization code coding | |
| US10892848B2 (en) | Devices and methods implementing polar codes | |
| EP1324502A2 (en) | Cascade Map Decoder and Method | |
| CN109327280B (en) | Segmented coding method and device | |
| CN109004939A (en) | Polarize decoder and method | |
| CN107431559B (en) | method and device for data transmission by using multi-polarization code | |
| CN114079530A (en) | Encoding method and device | |
| CN1129257C (en) | Maximum-likelihood decode method f serial backtracking and decoder using said method | |
| CN109245852A (en) | The speed matching method and device of Polar code | |
| CN101494464B (en) | Decoding method, device and electronic equipment | |
| CN101777925B (en) | Data processing device and method thereof | |
| Hu et al. | Flexible and simplified multi-bit successive-cancellation list decoding for polar codes | |
| EP3869695B1 (en) | Successive cancellation list decoding of polar codes | |
| Oliveira et al. | Polarization-driven puncturing for polar codes in 5g systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |