CN106656212A - Self-adaptive continuous erasure decoding method and architecture based on polarization code - Google Patents
Self-adaptive continuous erasure decoding method and architecture based on polarization code Download PDFInfo
- Publication number
- CN106656212A CN106656212A CN201611102678.6A CN201611102678A CN106656212A CN 106656212 A CN106656212 A CN 106656212A CN 201611102678 A CN201611102678 A CN 201611102678A CN 106656212 A CN106656212 A CN 106656212A
- Authority
- CN
- China
- Prior art keywords
- decoding
- scl
- adaptive
- decoder
- decoders
- 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.)
- Pending
Links
Classifications
-
- 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
-
- 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/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses a self-adaptive continuous erasure decoding method and architecture based on a polarization code. The method comprises the following steps: selecting a SCA-SCL decoder when a signal to noise ratio (SNR) is less than a specific threshold value, or selecting an adaptive SCL decoder; and performing the decoder conversion by use of a switching mechanism when a list length is greater than the specific threshold value. By use of the method disclosed by the invention, the optimal condition of two decoder working modes is selected, and the existing combined logic circuit architecture is not greatly changed, so that the architecture is universal and general, popular and easy to understand; not only is the performance of the decoder improved, but also is the complexity of the decoder lowered.
Description
Technical field
The present invention relates to wireless communication technology, more particularly to the self adaptation successive elimination interpretation method based on polarization code and
Framework.
Background technology
In order to improve the reliability of communications system transmission, channel coding is arisen at the historic moment.It is used for overcoming in channel as a kind of
Interference and noise, the technology for realizing high efficient and reliable communication, coding theory was founded in 1948.Channel coding theorem is to illustrate to make biography
It is the theorem for existing that letter rate approaches the coding of channel capacity.The theorem is pointed out, if channel capacity is C, information rate to be passed is R,
Compiling method is not there are if R is more than C can realize above-mentioned biography letter.With first generation mobile communication technology further development and
Need, the most urgent problem for facing at present is how to select a new channel coding schemes, is increasingly increased to meet
Spectrum efficiency requirement.In 60 coming year that Shannon's theorems is proposed, to reach shannon limit, new coded system is being created always
Make.
Since the 1950's, the linear block codes such as BCH code and RS codes and convolutional code are the research emphasis of early stage, afterwards
It is network code and Algorithms of Algebraic Geometric Codes.After nineteen ninety, the development speed of channel coding obtains lifting largely,
Turbo code and LDPC code become mainstream research direction, are widely used in communication system.Although but Turbo code and LDPC are close to
But shannon limit is unable to reach, while with higher coding, decoding complexity.But 2008, Arikan was according to channel pole
Change proposes polarization code, is the coding that first theoretical proof can be issued to channel capacity in a discrete memoryless channel(DMC), and
With relatively low computation complexity, therefore polarization code is the important breakthrough of wireless communication field, and tool has great prospects for development.
Channel-polarization is referred to and obtains channel by iteration from N number of independent binary system discrete memoryless channel(DMC) (B-DMC)
{WN (i)}.For channel coding, through the channel { W for polarizingN (i)It is preferable, and as N tends to infinitely great, channel capacity meeting
Tend to polarising, a part is intended to " 1 ", and its data transmission rate can be considered 1；Another part is then intended to " 0 ", then be set to 0.Letter
Road combination need to experience channel and combine and two operations of channel division, and first multiple single channels are combined, then the channel to combining
Enter line splitting, by channel link rule, power system capacity does not change during combination, the cut-off frequency of whole system is thus
Can be enhanced.Here it is the basic structure of channel-polarization.
Channel decoding serves conclusive effect to the quality of wireless communication system, and at present conventional decoding algorithm has company
It is continuous to delete (successive cancellation, SC) decoding, maximum likelihood ratio (maximum likelihood, ML) decoding
And continuous delete list (successive cancellation list, the SCL) decoding decoded based on SC etc..It is wherein traditional
SC decodes the maximum code bit of a select probability, and SCL decodings retain every time the path of L bars possible " survival ", finally selects optimal
Path.But it is found that mostly SCL decoding algorithms are in the case of CRC detection failures that list length is double, such discomforts
For the high-speed applications of low complex degree, it is similarly hardware configuration and causes difficulty.In the face of this situation, decoded based on SCL
Adaptive SCL decoding algorithms are proposed by Chuan Zhang.Initial list length is the maximum length of regulation, in the mistake of decoding
Cheng Zhong, when the logarithm ratio of the L/2 article and the maximum transfer probability of L/2+1 paths exceedes threshold value, list length halves.This
Algorithm effect is significant in the case of high s/n ratio, but be not suitable for the low situation of signal to noise ratio.
CRC check can be as a kind of criterion to realize early interruption, and Kai Niu propose CRC-Aided SCL (CA-
SCL) algorithm, CRC is used for finally to check path correctness, but this algorithm can produce extra complexity.Segmented
By code segmentation to add CRC check, compared with CA-SCL, this algorithm can be considered in a morning CRC-Aided SCL algorithms
Off line system.In the case of low signal-to-noise ratio, decoder will terminate before maximum code length is reached, it is possible to achieve the drop of complexity
It is low, but effect is not obvious in the case of low signal-to-noise ratio.
The content of the invention
Goal of the invention：It is an object of the invention to provide it is a kind of can solve the problem that defect present in prior art based on polarization
The self adaptation successive elimination interpretation method and framework of code.
Technical scheme：To reach this purpose, the present invention is employed the following technical solutions：
Self adaptation successive elimination interpretation method based on polarization code of the present invention, when signal to noise ratio is less than specific threshold
When, from SCA-SCL decoders, otherwise from adaptive SCL decoders；When list length is more than specific threshold, carry out
Decoder is converted, and is comprised the following steps that：
S1：Initialization：Initial path list is set to into 0, all storage matrix are set to 0；
S2：Expansion：In the i-stage of information code binary tree, if i is to freeze position, decoding path is set to 0；If i is information
Position, then decoding matrixFilled with 0 or 1 according to formula (1)：
In formula (2),Represent channel transition probability,For receiving matrix,For previous channel
Input,For earlier channel input decoding matrix,Channel transition probability when representing that input is 0,Channel transition probability when representing that input is 1；
S3：Judge：If Eb/N0<T1, select SCA-SCL decoders, i.e. fmode=1；Otherwise, adaptive SCL are selected
Decoder, i.e. fmode=0；Wherein, Eb/N0Represent signal to noise ratio, T1E when representing conversion decoderb/N0The threshold value that should be reached, fmode
The sequence number of presentation code device；
S4：Switching：Work as L>T2When, switch to another kind of decoder, will adaptive SCL decoders be changed into SCA-SCL
Decoder, or SCA-SCL decoders are changed into into adaptive SCL decoders, fmode=1-fmode；Wherein, L represents that list is long
Degree, T2The threshold value that L should reach when representing conversion decoder.
Further, the T1=T2=1.5,0<Eb/N0<4。
Self adaptation successive elimination decoding framework based on polarization code of the present invention, including initialization module, extension module
Block, judge module, handover module, SCA-SCL decoders and adaptive SCL decoders；Wherein：
Initialization module：For initial path list and all storage matrix zero setting；
Expansion module：Determine decoding path and candidate route information, wherein decoding path for information code binary tree information
Assignment determined by formula (3)：
Judge module：For selecting decoder according to signal to noise ratio and snr threshold, when signal to noise ratio is less than snr threshold
When select adaptive decoders, otherwise select SCA-SCL decoders；
Handover module：For determining switching decoder according to list length and list length threshold value, when list length exceedes
Another kind of decoder is selected during list length threshold value；
SCA-SCL decoders：Enter row decoding for performing SCA-SCL algorithms, whole segment information is divided into during decoding
Four sections of addition CRC checks, are continued if by verification decoding, and otherwise report an error stopping；
Adaptive SCL decoders：For performing the decoding of adaptive SCL algorithm performs, two paths are translated during decoding
Code is carried out simultaneously, compares the log-likelihood ratio of two decoding path present nodes, if both differences exceed the difference of log-likelihood ratio
Threshold value then select the larger decoding path of likelihood ratio, otherwise retain two paths.
Beneficial effect：Compared with prior art, the invention has the advantages that：
(1) main computing unit of the invention is adder and multiplier, is especially suitable for hardware realization, is ensureing performance
In the case of, greatly reduce computation complexity and hardware costs.
(2) present invention achieves the combination of two kinds of high-performance decoders, reaches more excellent effect, it is adaptable to various signal to noise ratios
In the case of decoding.
(3) present invention takes different lists length can reach different performance indications, can meet communication system different
Configuration requirement, with abundant flexibility ratio, and takes different lists length and need not change hardware configuration, does not spend extra hardware
Cost.
(4) present invention proposes another kind of evaluation criterion of coding efficiency.
(5) present invention can be suitably used for various polarization code decoding systems, and its compatibility is good.
Description of the drawings
Fig. 1 is the decoding framework block diagram of the specific embodiment of the invention；
Fig. 2 is the decoding framework of the specific embodiment of the invention and the decoding performance ratio of two kinds of decoders of the prior art
Relatively scheme；
Fig. 3 is the decoding framework of the specific embodiment of the invention and the list length ratio of two kinds of decoders of the prior art
Relatively scheme；
Fig. 4 is list length comparison diagram of the decoding framework of the specific embodiment of the invention under different code length.
Specific embodiment
Technical scheme is further introduced with reference to the accompanying drawings and detailed description.
This specific embodiment discloses a kind of self adaptation successive elimination interpretation method based on polarization code, when signal to noise ratio it is little
When specific threshold, from SCA-SCL decoders, otherwise from adaptive SCL decoders；When list length is more than specific
During threshold value, enter line decoder conversion, comprise the following steps that：
S1：Initialization：Initial path list is set to into 0, all storage matrix are set to 0；
S2：Expansion：In the i-stage of information code binary tree, if i is to freeze position, decoding path is set to 0；If i is information
Position, then decoding matrixFilled with 0 or 1 according to formula (1)：
In formula (2),Represent channel transition probability,For receiving matrix,For previous channel
Input,For earlier channel input decoding matrix,Channel transition probability when representing that input is 0,Channel transition probability when representing that input is 1；
S3：Judge：If Eb/N0<T1, select SCA-SCL decoders, i.e. fmode=1；Otherwise, adaptive SCL are selected
Decoder, i.e. fmode=0；Wherein, Eb/N0Represent signal to noise ratio, T1E when representing conversion decoderb/N0The threshold value that should be reached, fmode
The sequence number of presentation code device；
S4：Switching：Work as L>T2When, switch to another kind of decoder, will adaptive SCL decoders be changed into SCA-SCL
Decoder, or SCA-SCL decoders are changed into into adaptive SCL decoders, fmode=1-fmode；Wherein, L represents that list is long
Degree, T2The threshold value that L should reach when representing conversion decoder.
The algorithm of handover mechanism is as follows：
The method focuses on T1And T2Selection, according to the imitative of SCA-SCL decoders and adaptive SCL decoders
True result understands, when list length L=2, T1And T2Optimum value is 1.5.
Through experimental demonstration, when decode under length in different noises, when L=2 is given tacit consent to, T1, T2Optimal value is
1.5, the coding guideline can be considered to select two kinds of decoder performance The cream of the crops.
This specific embodiment also discloses a kind of self adaptation successive elimination decoding framework based on polarization code, such as Fig. 1 institutes
Show, including initialization module, expansion module, judge module, handover module, SCA-SCL decoders and adaptive SCL decodings
Device；Wherein：
Initialization module：For initial path list and all storage matrix zero setting；
Expansion module：Determine decoding path and candidate route information, wherein decoding path for information code binary tree information
Assignment determined by formula (3)：
Judge module：For selecting decoder according to signal to noise ratio and snr threshold, when signal to noise ratio is less than snr threshold
When select adaptive decoders, otherwise select SCA-SCL decoders；
Handover module：For determining switching decoder according to list length and list length threshold value, when list length exceedes
Another kind of decoder is selected during list length threshold value；
SCA-SCL decoders：Enter row decoding for performing SCA-SCL algorithms, whole segment information is divided into during decoding
Four sections of addition CRC checks, are continued if by verification decoding, and otherwise report an error stopping；
Adaptive SCL decoders：For performing the decoding of adaptive SCL algorithm performs, two paths are translated during decoding
Code is carried out simultaneously, compares the log-likelihood ratio of two decoding path present nodes, if both differences exceed the difference of log-likelihood ratio
Threshold value then select the larger decoding path of likelihood ratio, otherwise retain two paths.
Define fpeakAs the amount for weighing decoder combination property, in Eb/N0When=0～4.0,
Wherein, LpeakAs the peak value of the list length in signal to noise ratio interval range, LavgRepresent following in different signal to noise ratios
The mean value of table length, fpeakIt is more low then to represent that the scope of application of decoder is wider, it is anticipated that Eb/N0Gradually increase from 0
When, average list length will first increase and reduce again, but remain flat.This prediction will be proved below.
Fig. 2 shows the Performance comparision of this specific embodiment and SCA-SCL decoders, as seen from the figure, is originally embodied as
The performance of mode does not decline compared with previous decoder.
Fig. 3 shows this specific embodiment and adaptive SCL decoders and the list length of SCA-SCL decoders,
Computation complexity and list length positive correlation due to SCL polarization code decoders, as seen from the figure, in the situation of extreme signal to noise ratio
Under, the performance of this specific embodiment is good, and complexity is substantially reduced.This specific embodiment and adaptive SCL decoders
It is 0dB in SNR and list length numerical value of the SCA-SCL decoders when signal to noise ratio is 0-2.5 is as shown in table 1, is computed obtaining
When, the complexity of this specific embodiment have dropped 43.02% compared with traditional SCL decoding algorithms, it follows that this is concrete
Embodiment can significantly reduce the computation complexity of algorithm while performance is kept.
List length of the table 1 under different signal to noise ratios compares
| Eb/N0(dB) | 0 | 0.5 | 1.0 | 1.5 | 2.0 | 2.5 |
| Adaptive SCL list lengths | 1.7760 | 1.6875 | 1.5500 | 1.3912 | 1.2869 | 1.2177 |
| SCA-SCL list lengths | 1.0220 | 1.1600 | 1.2450 | 1.4700 | 1.6300 | 1.7800 |
| This specific embodiment list length | 1.0120 | 1.1800 | 1.2300 | 1.4312 | 1.2779 | 1.2034 |
Fig. 4 shows list length of this specific embodiment under different code length, illustrates decoding performance with code length
Relation, as seen from the figure, with the increase of code length N, the reduction of complexity is notable all the more.
fpeakThe planarization of curve can be reflected, decoding should meet various while list length reduction is pursued
Performance difference under signal to noise ratio is little, therefore fpeakShould be little as far as possible, this specific embodiment selects 20% as suitable
Standard.Can be calculated by formula (4), this specific embodiment in code length N=64, fpeakWhen=9.77%, N=128, fpeak=
When 8.96%, N=256, fpeakWhen=19.28%, N=1024, fpeak=18.31%, it is satisfied by requiring.
In sum, this specific embodiment presents their advantage in complexity and performance, also show for
The great potential of practical application.
Claims (3)
1. the self adaptation successive elimination interpretation method of polarization code is based on, it is characterised in that：When signal to noise ratio is less than specific threshold, choosing
SCA-SCL decoders are used, otherwise from adaptive SCL decoders；When list length is more than specific threshold, enter row decoding
Device is converted, and is comprised the following steps that：
S1：Initialization：Initial path list is set to into 0, all storage matrix are set to 0；
S2：Expansion：In the i-stage of information code binary tree, if i is to freeze position, decoding path is set to 0；If i is information bit,
Then decoding matrixFilled with 0 or 1 according to formula (1)：
In formula (2),Represent channel transition probability,For receiving matrix,It is defeated for previous channel
Enter,For earlier channel input decoding matrix,Channel transition probability when representing that input is 0,Channel transition probability when representing that input is 1；
S3：Judge：If Eb/N0<T1, select SCA-SCL decoders, i.e. fmode=1；Otherwise, adaptive SCL decodings are selected
Device, i.e. fmode=0；Wherein, Eb/N0Represent signal to noise ratio, T1E when representing conversion decoderb/N0The threshold value that should be reached, fmodeRepresent
The sequence number of encoder；
S4：Switching：Work as L>T2When, switch to another kind of decoder, will adaptive SCL decoders be changed into SCA-SCL decoding
Device, or SCA-SCL decoders are changed into into adaptive SCL decoders, fmode=1-fmode；Wherein, L represents list length, T2
The threshold value that L should reach when representing conversion decoder.
2. the self adaptation successive elimination interpretation method based on polarization code according to claim 1, it is characterised in that：The L
When=2, T1=T2=1.5,0<Eb/N0<4。
3. the self adaptation successive elimination decoding framework of polarization code is based on, it is characterised in that：Including initialization module, expansion module,
Judge module, handover module, SCA-SCL decoders and adaptive SCL decoders；Wherein：
Initialization module：For initial path list and all storage matrix zero setting；
Expansion module：Determine decoding path and candidate route information, the wherein tax of decoding path for information code binary tree information
Value is determined by formula (3)：
Judge module：For selecting decoder according to signal to noise ratio and snr threshold, select when signal to noise ratio is less than snr threshold
Adaptive decoders are selected, SCA-SCL decoders are otherwise selected；
Handover module：For determining switching decoder according to list length and list length threshold value, when list length exceedes list
Another kind of decoder is selected during length threshold；
SCA-SCL decoders：Enter row decoding for performing SCA-SCL algorithms, four sections are divided into whole segment information during decoding
Addition CRC check, is continued if by verification decoding, and otherwise report an error stopping；
Adaptive SCL decoders：For performing the decoding of adaptive SCL algorithm performs, the decoding of two paths is same during decoding
Shi Jinhang, compares the log-likelihood ratio of two decoding path present nodes, if both differences exceed the threshold of the difference of log-likelihood ratio
Value then selects the larger decoding path of likelihood ratio, otherwise retains two paths.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611102678.6A CN106656212A (en) | 2016-12-05 | 2016-12-05 | Self-adaptive continuous erasure decoding method and architecture based on polarization code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611102678.6A CN106656212A (en) | 2016-12-05 | 2016-12-05 | Self-adaptive continuous erasure decoding method and architecture based on polarization code |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106656212A true CN106656212A (en) | 2017-05-10 |
Family
ID=58818417
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611102678.6A Pending CN106656212A (en) | 2016-12-05 | 2016-12-05 | Self-adaptive continuous erasure decoding method and architecture based on polarization code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106656212A (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107196664A (en) * | 2017-05-23 | 2017-09-22 | 浙江师范大学 | A kind of low complex degree of higher-dimension nuclear matrix polarization code continuously eliminates interpretation method |
| CN107659318A (en) * | 2017-11-07 | 2018-02-02 | 东南大学 | A kind of adaptive polarization code coding method |
| CN108063623A (en) * | 2018-01-05 | 2018-05-22 | 重庆邮电大学 | A kind of the serial of Polar codes for reducing complexity eliminates interpretation method |
| CN108282264A (en) * | 2018-01-05 | 2018-07-13 | 西安电子科技大学 | The polarization code coding method of list algorithm is serially eliminated based on bit reversal |
| CN108777584A (en) * | 2018-07-06 | 2018-11-09 | 中国石油大学(华东) | A kind of fast Optimization of polarization code decoding parameter |
| WO2018219031A1 (en) * | 2017-05-31 | 2018-12-06 | 华为技术有限公司 | Polar code processing method, decoder and terminal |
| CN108964671A (en) * | 2017-05-27 | 2018-12-07 | 华为技术有限公司 | A kind of interpretation method and decoder |
| CN109347600A (en) * | 2018-09-26 | 2019-02-15 | 河南科技大学 | A kind of polarization code coding method |
| WO2019037782A1 (en) * | 2017-08-25 | 2019-02-28 | 华为技术有限公司 | Decoding method and decoder for polar code |
| CN109450456A (en) * | 2018-10-30 | 2019-03-08 | 南京大学 | A kind of adaptive storehouse interpretation method and system based on polarization code |
| CN109921804A (en) * | 2019-03-22 | 2019-06-21 | 中国传媒大学 | A kind of adaptive fusion is serial to offset list polarization code coding method and system |
| CN109936377A (en) * | 2019-03-06 | 2019-06-25 | 西安电子科技大学 | A kind of the polarization code coding and interpretation method of segmentation CRC auxiliary |
| WO2019128763A1 (en) * | 2017-12-29 | 2019-07-04 | 华为技术有限公司 | Polar code decoder and decoding method |
| CN110022188A (en) * | 2019-04-09 | 2019-07-16 | 合肥工业大学 | Interpretation method and circuit are serially offset based on the polarization code encoding method and polarization code for freezing bit pair |
| CN112187290A (en) * | 2020-10-13 | 2021-01-05 | 中山大学 | Multi-element code coding and decoding method and system based on Polar coding and decoding tree |
| CN112583521A (en) * | 2019-09-27 | 2021-03-30 | 华为技术有限公司 | Decoding method and device, decoding equipment, terminal equipment and network equipment |
| CN114915376A (en) * | 2022-04-29 | 2022-08-16 | 京信网络***股份有限公司 | Decoding method, encoding method, device, equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105281785A (en) * | 2015-10-22 | 2016-01-27 | 东南大学 | List successive cancellation decoding method and apparatus for polar codes |
| CN106301387A (en) * | 2016-08-15 | 2017-01-04 | 东南大学 | A kind of distributed sort method and the method using the method composition CRC auxiliary polarization code successive elimination list decoding device |
| CN107113009A (en) * | 2015-01-09 | 2017-08-29 | 高通股份有限公司 | Use the adaptive channel encoding of polarization |
-
2016
- 2016-12-05 CN CN201611102678.6A patent/CN106656212A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107113009A (en) * | 2015-01-09 | 2017-08-29 | 高通股份有限公司 | Use the adaptive channel encoding of polarization |
| CN105281785A (en) * | 2015-10-22 | 2016-01-27 | 东南大学 | List successive cancellation decoding method and apparatus for polar codes |
| CN106301387A (en) * | 2016-08-15 | 2017-01-04 | 东南大学 | A kind of distributed sort method and the method using the method composition CRC auxiliary polarization code successive elimination list decoding device |
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107196664A (en) * | 2017-05-23 | 2017-09-22 | 浙江师范大学 | A kind of low complex degree of higher-dimension nuclear matrix polarization code continuously eliminates interpretation method |
| CN108964671B (en) * | 2017-05-27 | 2020-12-15 | 华为技术有限公司 | Decoding method and decoder |
| CN108964671A (en) * | 2017-05-27 | 2018-12-07 | 华为技术有限公司 | A kind of interpretation method and decoder |
| WO2018219031A1 (en) * | 2017-05-31 | 2018-12-06 | 华为技术有限公司 | Polar code processing method, decoder and terminal |
| CN108988873A (en) * | 2017-05-31 | 2018-12-11 | 华为技术有限公司 | A kind of Polar code processing method, decoder and terminal |
| WO2019037782A1 (en) * | 2017-08-25 | 2019-02-28 | 华为技术有限公司 | Decoding method and decoder for polar code |
| CN107659318A (en) * | 2017-11-07 | 2018-02-02 | 东南大学 | A kind of adaptive polarization code coding method |
| CN107659318B (en) * | 2017-11-07 | 2021-05-18 | 东南大学 | Self-adaptive polar code decoding method |
| CN109995382A (en) * | 2017-12-29 | 2019-07-09 | 华为技术有限公司 | A kind of polarization code decoder |
| WO2019128763A1 (en) * | 2017-12-29 | 2019-07-04 | 华为技术有限公司 | Polar code decoder and decoding method |
| CN109995382B (en) * | 2017-12-29 | 2021-01-05 | 华为技术有限公司 | Polar code decoder |
| CN108063623B (en) * | 2018-01-05 | 2021-09-10 | 重庆邮电大学 | Serial elimination decoding method of Polar code for reducing complexity |
| CN108282264B (en) * | 2018-01-05 | 2020-01-31 | 西安电子科技大学 | Polar code decoding method based on bit flipping serial elimination list algorithm |
| CN108063623A (en) * | 2018-01-05 | 2018-05-22 | 重庆邮电大学 | A kind of the serial of Polar codes for reducing complexity eliminates interpretation method |
| CN108282264A (en) * | 2018-01-05 | 2018-07-13 | 西安电子科技大学 | The polarization code coding method of list algorithm is serially eliminated based on bit reversal |
| CN108777584A (en) * | 2018-07-06 | 2018-11-09 | 中国石油大学(华东) | A kind of fast Optimization of polarization code decoding parameter |
| CN109347600B (en) * | 2018-09-26 | 2021-01-05 | 河南科技大学 | Polar code decoding method |
| CN109347600A (en) * | 2018-09-26 | 2019-02-15 | 河南科技大学 | A kind of polarization code coding method |
| CN109450456B (en) * | 2018-10-30 | 2021-09-28 | 南京大学 | Self-adaptive stack decoding method and system based on polarization code |
| CN109450456A (en) * | 2018-10-30 | 2019-03-08 | 南京大学 | A kind of adaptive storehouse interpretation method and system based on polarization code |
| CN109936377A (en) * | 2019-03-06 | 2019-06-25 | 西安电子科技大学 | A kind of the polarization code coding and interpretation method of segmentation CRC auxiliary |
| CN109936377B (en) * | 2019-03-06 | 2021-06-25 | 西安电子科技大学 | Segmented CRC (cyclic redundancy check) assisted polarization code encoding and decoding method |
| CN109921804A (en) * | 2019-03-22 | 2019-06-21 | 中国传媒大学 | A kind of adaptive fusion is serial to offset list polarization code coding method and system |
| CN109921804B (en) * | 2019-03-22 | 2023-01-31 | 中国传媒大学 | Self-adaptive fusion serial offset list polarization code decoding method and system |
| CN110022188A (en) * | 2019-04-09 | 2019-07-16 | 合肥工业大学 | Interpretation method and circuit are serially offset based on the polarization code encoding method and polarization code for freezing bit pair |
| CN110022188B (en) * | 2019-04-09 | 2021-09-14 | 合肥工业大学 | Polarization code encoding method based on frozen bit pair and polarization code serial offset decoding method and circuit |
| CN112583521A (en) * | 2019-09-27 | 2021-03-30 | 华为技术有限公司 | Decoding method and device, decoding equipment, terminal equipment and network equipment |
| CN112187290A (en) * | 2020-10-13 | 2021-01-05 | 中山大学 | Multi-element code coding and decoding method and system based on Polar coding and decoding tree |
| CN112187290B (en) * | 2020-10-13 | 2023-02-17 | 中山大学 | Multi-element code coding and decoding method and system based on Polar coding and decoding tree |
| CN114915376A (en) * | 2022-04-29 | 2022-08-16 | 京信网络***股份有限公司 | Decoding method, encoding method, device, equipment and storage medium |
| CN114915376B (en) * | 2022-04-29 | 2023-09-26 | 京信网络***股份有限公司 | Decoding method, encoding method, apparatus, device, and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106656212A (en) | Self-adaptive continuous erasure decoding method and architecture based on polarization code | |
| US9628113B2 (en) | Encoding method and apparatus using CRC code and polar code | |
| US7249304B2 (en) | Apparatus and method for error correction in a CDMA mobile communication system | |
| JP4227481B2 (en) | Decoding device and decoding method | |
| Yue et al. | Efficient decoders for short block length codes in 6G URLLC | |
| CN102404011B (en) | Method and device for achieving Viterbi decoding | |
| CN107659318B (en) | Self-adaptive polar code decoding method | |
| US8843811B2 (en) | Apparatus and method for decoding in communication system | |
| CN110661533A (en) | Method for optimizing decoding performance of decoder for storing polarization code | |
| GB2434066A (en) | Blind transport format detection wherein, for each state, the difference between different likelihood information is calculated and compared with a threshold | |
| CN103078716B (en) | Based on the relay transmission method of distributed 3-D Turbo code | |
| Miao et al. | A low complexity multiuser detection scheme with dynamic factor graph for uplink SCMA systems | |
| US8429509B2 (en) | Apparatus and method for determining reliability of decoded data in communication system | |
| US8918695B2 (en) | Methods and apparatus for early stop algorithm of turbo decoding | |
| CN103124181A (en) | Turbo code decoding iteration cease method based on cosine similarity | |
| Deng et al. | Comparing decoding performance of LDPC codes and convolutional codes for short packet transmission | |
| US7272771B2 (en) | Noise and quality detector for use with turbo coded signals | |
| Pathak et al. | Performance analysis of polar codes for next generation 5G technology | |
| CN107276596B (en) | Polarization code decoding method based on segmented Hash sequence | |
| KR101923701B1 (en) | Apparatus and method for iterative detection and decoding in wireless communication system | |
| Yazdani et al. | Divide and Code: Efficient and Real-time Data Recovery from Corrupted LoRa Frames | |
| CN114598334A (en) | Segmented CRC (cyclic redundancy check) assisted convolutional polarization code coding and decoding scheme | |
| Jiang et al. | A Fano Decoding for Polar Codes Based on Node Acceleration | |
| US20070136649A1 (en) | Apparatus and method for computing LLR | |
| Krishna et al. | Rate adaptive polar codes for 5G and beyond |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170510 |
|
| RJ01 | Rejection of invention patent application after publication |