CN107707333A - A kind of polarization code earlier iterations method of shutting down and device based on code word estimate - Google Patents
A kind of polarization code earlier iterations method of shutting down and device based on code word estimate Download PDFInfo
- Publication number
- CN107707333A CN107707333A CN201710827228.1A CN201710827228A CN107707333A CN 107707333 A CN107707333 A CN 107707333A CN 201710827228 A CN201710827228 A CN 201710827228A CN 107707333 A CN107707333 A CN 107707333A
- Authority
- CN
- China
- Prior art keywords
- iteration
- code word
- estimate
- code
- polarization
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
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/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- 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
- H04L1/005—Iterative decoding, including iteration between signal detection and decoding operation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses a kind of polarization code earlier iterations method of shutting down and device based on code word estimate, comprise the following steps:S1 the maximum iteration of BP decodings) is preset;S2 row decoding) is entered to Polarization Coding information using BP decoding algorithms;S3) in iterative process each time, to the code word estimate obtained by current iterationRate of change judged;If in continuous several times iterative processDo not change, then stop iteration and export the decoding result obtained by current iteration, otherwise, continue iteration, until reaching default maximum iteration.Polarization code earlier iterations method of shutting down and device provided by the invention based on code word estimate, in iterative process each time, to the code word estimate obtained by current iterationRate of change judged with realize earlier iterations stop mechanism, so as to substantially reduce the computation complexity of decoding and decoding delay, effectively reduce hardware resource consumption.
Description
Technical field
The present invention relates to a kind of polarization code processing method and processing device, more particularly to a kind of polarization code based on code word estimate
Earlier iterations method of shutting down and device.
Background technology
Discussed in international information in ISIT meetings within 2008, Arikan proposes the concept of channel-polarization first, based on the reason
By, he give the mankind it is known the first can be reached the channel coding method of channel capacity by Strict Proof, and be named as
Polarization code (Polar Code).Polarization code is designed based on channel-polarization.By a special recurrence cataloged procedure to foot
After more than enough individual channel carries out channel conversion, i.e., when N is sufficiently large, it may appear that the capacity of a part of polarisation channel tends to 1, remaining pole
Changing channel capacity tends to 0 phenomenon.The subchannel for tending to 1 using channel capacity transmits useful information, is tended to using channel capacity
0 subchannel transmission determines information.
It is serial to offset (Successive Cancelation, SC) algorithm and confidence level in the actual decoding of polarization code
It is two kinds of common algorithms to propagate (Belief Propagation, BP) algorithm.The computation complexity of SC algorithms is smaller.Pass through
List decoding strategy or storehouse decoding policy, improved SC algorithms can be realized than original SC and the more preferable decoding of BP algorithm
Energy.But due to serial decoding structure, cause its influence by high decoding latency O (L), wherein L is code length.High decoding latency
The extensive use of polarization code is hindered, especially for High-speed Circumstance.
Different from SC decodings, BP decodings are a kind of iterative algorithms, are parallel.The computation complexity of BP algorithm is O
(IaveN log N), wherein IaveFor mean iterative number of time.It follows that for BP decoders, its decoding latency disappears with energy
Consumption linear increase with the increase of iterations.Default maximum iterations I be present in traditional BP decodersmax.Up to
To before maximum iteration, BP decodings will not terminate.This termination scheme lacks flexibility, and is introduced into huge meter
Calculate complexity.In order to reduce unnecessary iteration as far as possible, related scholar has been presented for right based on G matrix (G-Matrix), minimum
Number likelihood ratio (Minimum magnitude LLR, minLLR), log-likelihood ratio amplitude auxiliary (LLR magnitude
Aided, LMA) etc. a variety of earlier iterations stopping criterions, but computation complexity to be still present higher etc. for these earlier iterations standards
Problem.
The content of the invention
The technical problems to be solved by the invention are to provide a kind of polarization code earlier iterations based on code word estimate and stopped
Method and device, can substantially reduce the computation complexity and decoding delay of decoding, while be easy to hardware to realize.
The present invention is to provide a kind of pole based on code word estimate to solve the technical scheme that above-mentioned technical problem uses
Change code earlier iterations method of shutting down, comprise the following steps:S1 the maximum iteration of BP decodings) is preset;S2) decoded using BP
Algorithm enters row decoding to Polarization Coding information;S3) in iterative process each time, the code word x obtained by current iteration is estimated
EvaluationRate of change judged;If in continuous several times iterative processDo not change, then stop iteration and defeated
The decoding result gone out obtained by current iteration, otherwise, continues iteration, until reaching default maximum iteration.
The above-mentioned polarization code earlier iterations method of shutting down based on code word estimate, wherein, the step S3) use code
The rate of change of word estimate is as criterion, if judging, code word estimate does not occur in continuous several times iterative process
Change, then stop iteration and export the decoding result obtained by current iteration.
The above-mentioned polarization code earlier iterations method of shutting down based on code word estimate, wherein, the step S3) in use
Code word estimate be calculated as follows:For the polarization code that parameter is (N, K), its corresponding factor graph is by n=log2N ranks calculate
Unit and n+1 row node are formed, and are made up of per rank N/2 processing unit, in the 1st row node of the factor graph high order end
Soft Inform ation carry out hard decision and can obtain information bit sequence u estimateTo the soft letter in the (n+1)th row node of low order end
Breath carries out the estimate that hard decision can obtain code word x(i, j) is represented from the i-th row from left to right, the node of jth row;Each node from
The Soft Inform ation that the right side passes through node (i, j) to a left side is designated as Li,j, the Soft Inform ation for from left to right passing through node (i, j) is designated as
Ri,j;The step S2) L in more new node is first propagated to the lefti,j, start to propagate to the right in more new node after reaching the leftmost side
Ri,j;After iteration ends, if not information bit, then the position is decoded as 0, otherwise the log-likelihood ratio L according to high order endi,1's
Symbol decision information bit is 0 or 1.
The above-mentioned polarization code earlier iterations method of shutting down based on code word estimate, wherein, the step S3) pass through group
Close and realize that earlier iterations stop mechanism using hard decision, equal detector and threshold comparator;The factor is arrived in renewal in each iteration
Figure the (n+1)th row node, i.e., obtain R from the PE of BP decodersi,n+1, to Ri,n+1Carry out hard decision and obtain code word in current iteration
EstimateThe equal detector obtains the code word estimate of t-1 iteration from memoryFrom hard decision module
ObtainThe equal detector comparesWithIt is whether identical, C=1 is exported when identical, otherwise exports C=0;The threshold
Value comparator is made up of adder, register and comparator, and consecutive identical number is stored in register, 1, C=is added if C=1
0 clearing;Comparator compares the consecutive identical number and parameter preset X stored in memory size, and D is exported if equal
=1, otherwise export D=0;Then BP decoders stop iteration output decoding result to D=1, and then BP decoders continuation iteration is straight by D=0
Reach default maximum iteration.
The above-mentioned polarization code earlier iterations method of shutting down based on code word estimate, wherein, the parameter preset X be 1~
10, the maximum iteration is preset as 15~80.
The present invention also provides a kind of polarization code earlier iterations stopping based on code word estimate to solve above-mentioned technical problem
Device, including:BP decoders, row decoding, and default maximum iteration are entered to Polarization Coding information using iterative manner;Firmly
Judgment device:The Soft Inform ation sign bit after each iteration is taken out, obtains the estimate of code word in current iterationEqual detection
Device:The code word estimate of last iteration is obtained from memoryCompareWithIt is whether identical, C=is exported when identical
1, otherwise export C=0;Threshold comparator:It is made up of adder, register and comparator, continuous phase homogeneous is stored in register
Number, adds 1, C=0 then to reset if C=1;Comparator compares the consecutive identical number stored in memory with parameter preset X's
Size, D=1 is exported if equal, otherwise exports D=0;Then BP decoders stop iteration output decoding result to D=1, and D=0 is then
BP decoders continue iteration until reaching default maximum iteration.
The above-mentioned polarization code earlier iterations arresting stop based on code word estimate, wherein, the parameter preset X be 1~
10, the maximum iteration is preset as 15~80.
Present invention contrast prior art has following beneficial effect:Polarization provided by the invention based on code word estimate
Code earlier iterations method of shutting down and device, in iterative process each time, to the code word estimate obtained by current iteration
Rate of change carry out judgement realize earlier iterations stop mechanism.Test result is shown, the tradition of 40 times is fixed as with iterations
BP decoders are compared, and when signal to noise ratio is 3.5dB, iterations can reduce 84.35%, be answered so as to substantially reduce the calculating of decoding
Miscellaneous degree and decoding delay.Synthesis result shows that logical resource consumes compared with existing three kinds common earlier iterations stop mechanism
63.25%~96.88% can be reduced, effectively reduces hardware resource consumption.Existing earlier iterations stopping criterion all relies on Li,1
OrExtra decoding latency can be caused, the present invention relies onExtra delay will not be caused.
Brief description of the drawings
Fig. 1 is the polarization code factor graph that parameter of the present invention is (8,4);
Fig. 2 is the elementary cell schematic diagram of polarization code factor graph of the present invention;
The hardware structure that Fig. 3 is the present invention realizes schematic diagram;
Fig. 4 is equal detector hardware structure;
Fig. 5 is threshold comparator hardware configuration;
Fig. 6 positions earlier iterations proposed by the present invention stop calculation process;
Fig. 7 is the polarization code that parameter of the present invention is (1024,512), the BP interpretation methods that maximum iteration is 40 and original
The decoding performance comparison schematic diagram of beginning BP decoder;
Fig. 8 is the polarization code that parameter of the present invention is (1024,512), the BP interpretation methods that maximum iteration is 40 and original
Mean iterative number of time comparison schematic diagram of the beginning BP decoder under different signal to noise ratio channels.
Embodiment
The invention will be further described with reference to the accompanying drawings and examples.
In practice, iterative decoder can often be restrained or will not restrain in the early stage of iterative process.Also
It is to say, reaches I in iterationsmaxBefore, decoding may succeed.Earlier iterations stop algorithm and referred in decoding iteration mistake
Adaptively detect whether to have obtained reliable decoding output in journey, if condition meets to terminate to decode at once.In early days
Iteration stopping algorithm can linearly reduce decoding complexity and decoding delay.
Polarization code earlier iterations method of shutting down provided by the invention based on code word estimate, comprises the following steps:
S1 the maximum iteration of BP decodings) is preset;
S2 row decoding) is entered to Polarization Coding information using BP decoding algorithms;
S3) in iterative process each time, the rate of change of the code word estimate obtained by current iteration is sentenced
It is disconnected;If the code word estimate in continuous several times iterative process does not change, stop iteration and export current iteration institute
Obtained decoding result, otherwise, continues iteration, until reaching default maximum iteration.
The present invention based on code word estimatePolarization code earlier iterations method of shutting down, using BP decoding algorithms to polarization
Coding information enters row decoding, and information updating formula is as follows:
f(x,y)≈α*sign(x)sign(y)min(|x|,|y|) (2)
Use the estimate of code wordRate of change as standard, if in continuous X iterative processDo not become
Change, then it is believed that output now is reliable enough, referred to as x auxiliary (x-aided) earlier iterations stopping criterions.Specific formula is such as
Under:
Iteration can be stopped when meeting above formula.If being unsatisfactory for formula (3), continue iteration, until reaching pre-
If maximum iteration.Scheme compared with prior art, the present invention can be in the case where not causing decoding performance to lose significantly
Reduce decoding iteration number, especially effect becomes apparent in high s/n ratio channel;And this method is highly reliable, hardware is real
It is now simple.
Parameter is used to carry out implementation test for the Polar codes of (1024,512) below, code length N=1024, K=512,
Code check is 0.5.Using Gaussian approximation method, in the case where signal to noise ratio is 1.5dB, simulation result is used as positional information, modulation system two
System phase shift keying (Binary Phase Shift Keying, BPSK), channel is additive white Gaussian noise channel
(Additive White Gaussian Noise, AWGN).Code wordIt is 1024 by lengthWith generator matrix G phases
It is multiplied to arrive.Generator matrixRepresenting matrixLog21024=10 Kronecker product.Channel
Reception value Y1 NRepresented using log-likelihood ratio (Log-likelihood ratio, LLR) form.1 bit sign is used in this implementation
Position, 4 integer-bits, 7 quantization schemes of 2 decimal places, is easy to hardware to realize.
Parameter is the factor graph of the polarization code of (1024,512) by log21024=10 rank processing units (Processing
Element, PE) and 11 row nodes composition (factor graph that code length is 8 is as shown in Figure 1), wherein per rank by N/2=512 PE structure
Into (Fig. 2 is single processing unit schematic diagram).Soft Inform ation in 1st row node of factor graph high order end is made decisions and can obtained
To information bit sequenceEstimateSoft Inform ation in 11st row node of low order end is made decisions available
Code wordEstimate(i, j) is represented from the i-th row from left to right, the node of jth row.Each node has two kinds of information,
The information for passing through node (i, j) from right to left is designated as L by the present inventioni,j, will from left to right pass through node (i, j)
Information is designated as Ri,j, these information mutually transmit renewal in the form of LLR.
During decoding, it is 40 times to preset iteration maximum iteration, first to Ri,1And Li,11Initialized.Li,11Just
Beginning turns to channel acceptance value Yi, Ri,1It is initialized as the maximum that 0 and 7 quantization scheme can represent respectively according to positional information
15.75.Specific formula is as follows:
Li,11=Yi (5)
A in formula refers to the set of information bit.Then the L in more new node is first propagated to the left according to formula (1)i,j,
Start to propagate the R in more new node to the right after reaching the leftmost sidei,j.α in formula (2) is arranged to 0.9, specific such as formula:
f(x,y)≈0.9*sign(x)sign(y)min(|x|,|y|) (6)
Code word estimate can be obtained in each iterative process according to following two formula
To reduce the computation complexity and decoding delay of decoding, while it is easy to hardware to realize, thinking of the invention is to utilize
The estimate of code wordChange be turned to standard, parameter X is arranged to 1, if in continuous 1 iterative processDo not become
Change, then it is believed that the now output of BP decoders is reliable enough.Specific formula is as follows:
If meeting equation (9), decoding output can now is considered reliable decoding output, iteration ends.Such as
Fruit is unsatisfactory for condition, judges to decode whether number reaches 40 times, if reaching greatest iteration just terminates iteration;If it is not, after
Continuous fresh information, carries out next iteration.
After iteration ends, if not information bit, then the position is decoded as 0, otherwise the log-likelihood ratio L according to high order endi,1
The symbol decision information bit of (subscript 1 represents a row node of first row node, i.e. the factor graph leftmost side, and i represents i-th bit) is 0
Or 1, the formula of basis for estimation is as follows:
The hardware structure that Fig. 3 is the present invention realizes schematic diagram, is mainly made up of equal detector with threshold comparator.Often
Renewal can obtain R to the row node of factor graph the 11st from the PE of BP decoders in secondary iterationi,11, to Ri,11Hard decision is carried out to obtain
The estimate of code word into current iterationEqual detector obtains the code word estimate of t-1 iteration from memory
Obtained from hard decision moduleEqual detector comparesWithIt is whether identical, C=1 is exported when identical, otherwise exports C=
0.Threshold comparator is made up of adder, register and comparator, and consecutive identical number is stored in register, is added if C=1
1, C=0 then resets;Comparator compares the consecutive identical number and parameter preset X=1 stored in memory size, if equal
D=1 is then exported, otherwise exports D=0.D=1 then BP decoders stop iteration output decoding result, D=0 then BP decoders after
Continuous iteration is until reaching default maximum iteration.Fig. 4 is the detailed hardware structure of equal detector in Fig. 3, and Fig. 5 is then
The detailed construction of threshold comparator.
Fig. 6 is calculation process of the present invention during the decoding of (N, K) polarization code.Existing earlier iterations stopping criterion
Extra delay can be caused, can not obtainedNext iteration is judged whether to before, because these standards all rely onIt is or rightObtained after progress hard decisionAs shown in fig. 6, by right after nth clock in t iterationEnter
Row judgement can obtainThen the present invention only needs two clocks to complete earlier iterations arrest of judgement, if meeting the present invention
Earlier iterations stopping criterion then calculateIt is rightDecoding result is obtained after carrying out hard decision, then stops iteration;It is if discontented
The earlier iterations stopping criterion of the foot present invention then carries out next iteration.
Fig. 7 shows that a variety of earlier iterations stopping criterions are believed with conventional polar code BP decoders in Gauss additive white noise
Test result in road.Abscissa Eb/N0 is signal to noise ratio in figure, and FER is FER in figure, and BER is bit error rate in figure,
Constant iterations represent that iterations is constant, and x-aided represents to have used BP early stages proposed by the present invention to change
In generation, stops interpretation method.According to Fig. 7 can be seen that the present invention can in the case where iterations is considerably less than traditional BP decoder,
Reach the decoding performance same with traditional BP decoder.
Fig. 8 shows a variety of earlier iterations stopping criterions from conventional polar code BP decoders in different signal to noise ratio channels
Mean iterative number of time.Eb/N0 is signal to noise ratio in figure, and Average number of iterations represent Average Iteration
Number, x-aided represent to have used BP earlier iterations proposed by the present invention to stop interpretation method.When maximum iteration be 40 and
During Eb/N0=3.5dB, the mean iterative number of time of the present invention subtracts compared with the original BP decoders that iterations is fixed as 40 times
Lack 84.35%.
Following table stops mechanism in Stratix for the x-aided mechanism of this implementation with the other three kinds earlier iterations having pointed out
Comprehensive result in V 5SGXEA7N2F455C2, wherein Q is LLR quantization digits.
By can be seen that in table, in terms of hardware resource consumption, compared with G-Matrix mechanism, Logic utilization
Consumption with Registers reduces by 63.25% and 99.9% respectively.Compared with minLLR and LMA, Logic utilization
Consumption reduce by 72.44% and 96.88% respectively.
Although the present invention is disclosed as above with preferred embodiment, so it is not limited to the present invention, any this area skill
Art personnel, without departing from the spirit and scope of the present invention, when a little modification and perfect, therefore the protection of the present invention can be made
Scope is worked as to be defined by what claims were defined.
Claims (7)
1. a kind of polarization code earlier iterations method of shutting down based on code word estimate, it is characterised in that comprise the following steps:
S1 the maximum iteration of BP decodings) is preset;
S2 row decoding) is entered to Polarization Coding information using BP decoding algorithms;
S3) in iterative process each time, to the code word estimate obtained by current iterationRate of change judged;Such as
In fruit continuous several times iterative processDo not change, then stop iteration and export the decoding result obtained by current iteration,
Otherwise, iteration is continued, until reaching default maximum iteration.
2. the polarization code earlier iterations method of shutting down based on code word estimate as claimed in claim 1, it is characterised in that described
Step S3) rate of change of code word estimate is used as criterion, if judging, code word is estimated in continuous several times iterative process
Evaluation does not change, then stops iteration and export the decoding result obtained by current iteration.
3. the polarization code earlier iterations method of shutting down based on code word estimate as claimed in claim 2, it is characterised in that described
Step S3) in the code word estimate that uses be calculated as follows:For the polarization code that parameter is (N, K), its corresponding factor graph is by n=
log2N ranks computing unit and n+1 row node are formed, and are made up of per rank N/2 processing unit, and 1 row of factor graph high order end are saved
Soft Inform ation in point carries out the estimate that hard decision can obtain information bit sequence uTo in the (n+1)th row node of low order end
Soft Inform ation carries out the estimate that hard decision can obtain code word x(i, j) is represented from the i-th row from left to right, the node of jth row;Each section
The Soft Inform ation that point passes through node (i, j) from right to left is designated as Li,j, from left to right pass through the Soft Inform ation of node (i, j)
It is designated as Ri,j;The step S2) L in more new node is first propagated to the lefti,j, start to propagate more new node to the right after reaching the leftmost side
In Ri,j;After iteration ends, if not information bit, then the position is decoded as 0, otherwise the log-likelihood ratio L according to high order endi,1
Symbol decision information bit be 0 or 1.
4. the polarization code earlier iterations method of shutting down based on code word estimate as claimed in claim 3, it is characterised in that described
Step S3) by be applied in combination hard decision, equal detector and threshold comparator realize earlier iterations stop mechanism;Each iteration
Factor graph the (n+1)th row node is arrived in middle renewal, you can obtains R by the processing unit of BP decodersi,n+1, to Ri,n+1Carry out hard decision
Obtain the estimate of code word in current iterationThe equal detector obtains the code word estimation of t-1 iteration from memory
ValueObtained from hard decision moduleThe equal detector comparesWithIt is whether identical, C=1 is exported when identical, it is no
Then export C=0;The threshold comparator is made up of adder, register and comparator, and continuous phase homogeneous is stored in register
Number, adds 1, C=0 then to reset if C=1;Comparator compares the big of the consecutive identical number that is stored in memory and parameter preset X
It is small, D=1 is exported if equal, otherwise exports D=0;Then BP decoders stop iteration output decoding result, D=0 then BP to D=1
Decoder continues iteration until reaching default maximum iteration.
5. the polarization code earlier iterations method of shutting down based on code word estimate as claimed in claim 4, it is characterised in that described
Parameter preset X is 1~10, and the maximum iteration is preset as 15~80.
A kind of 6. polarization code earlier iterations arresting stop based on code word estimate, it is characterised in that including:
BP decoders, row decoding, and default maximum iteration are entered to Polarization Coding information using iterative manner;
Hard decision device:The information symbol position after each iteration is taken out, obtains the estimate of code word in current iteration
Equal detector:The code word estimate of last iteration is obtained from memoryCompareWithIt is whether identical, phase
C=1 is exported simultaneously, otherwise exports C=0;
Threshold comparator:It is made up of adder, register and comparator, consecutive identical number is stored in register, if C=1
1, C=0 is added then to reset;Comparator compares the consecutive identical number and parameter preset X stored in memory size, if equal
D=1 is exported, otherwise exports D=0;Then BP decoders stop iteration output decoding result to D=1, and then BP decoders continue to change D=0
In generation, is until reaching default maximum iteration.
7. the polarization code earlier iterations arresting stop based on code word estimate as claimed in claim 6, it is characterised in that described
Parameter preset X is 1~10, and the maximum iteration is preset as 15~80.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710827228.1A CN107707333B (en) | 2017-09-14 | 2017-09-14 | Method and device for stopping early iteration of polarization code based on code word estimated value |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710827228.1A CN107707333B (en) | 2017-09-14 | 2017-09-14 | Method and device for stopping early iteration of polarization code based on code word estimated value |
Publications (2)
Publication Number | Publication Date |
---|---|
CN107707333A true CN107707333A (en) | 2018-02-16 |
CN107707333B CN107707333B (en) | 2020-06-09 |
Family
ID=61172465
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710827228.1A Active CN107707333B (en) | 2017-09-14 | 2017-09-14 | Method and device for stopping early iteration of polarization code based on code word estimated value |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN107707333B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109495116A (en) * | 2018-10-19 | 2019-03-19 | 东南大学 | The SC-BP hybrid decoding method of polarization code and its adjustable hardware structure |
CN109547035A (en) * | 2018-12-30 | 2019-03-29 | 山东科技大学 | The method for building up and decoder hardware framework of flowing water BP polarization decoder hardware framework |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150333775A1 (en) * | 2014-05-15 | 2015-11-19 | Broadcom Corporation | Frozen-Bit Selection for a Polar Code Decoder |
CN105187073A (en) * | 2015-10-13 | 2015-12-23 | 东南大学 | BP decoding method and device for polarization code |
-
2017
- 2017-09-14 CN CN201710827228.1A patent/CN107707333B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150333775A1 (en) * | 2014-05-15 | 2015-11-19 | Broadcom Corporation | Frozen-Bit Selection for a Polar Code Decoder |
CN105187073A (en) * | 2015-10-13 | 2015-12-23 | 东南大学 | BP decoding method and device for polarization code |
Non-Patent Citations (2)
Title |
---|
YUAN, B: "《IEEE》", 15 December 2014 * |
刘军旗: "《极化码的改进BP译码算法研究》", 《中国优秀硕士学位论文全文库》 * |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109495116A (en) * | 2018-10-19 | 2019-03-19 | 东南大学 | The SC-BP hybrid decoding method of polarization code and its adjustable hardware structure |
CN109495116B (en) * | 2018-10-19 | 2022-07-12 | 东南大学 | SC-BP mixed decoding method of polarization code and adjustable hardware architecture thereof |
CN109547035A (en) * | 2018-12-30 | 2019-03-29 | 山东科技大学 | The method for building up and decoder hardware framework of flowing water BP polarization decoder hardware framework |
CN109547035B (en) * | 2018-12-30 | 2023-02-10 | 山东科技大学 | Method for establishing hardware architecture of pipelined BP polarized decoder and hardware architecture of decoder |
Also Published As
Publication number | Publication date |
---|---|
CN107707333B (en) | 2020-06-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105187073B (en) | A kind of the BP interpretation methods and device of polarization code | |
CN107026656B (en) | CRC-assisted medium-short code length Polar code effective decoding method based on disturbance | |
CN107612560A (en) | Polarization code earlier iterations method of shutting down based on partial information bit log likelihood ratio | |
CN108039891B (en) | Polarization code BP decoding method and device based on multistage updating process | |
CN106571831A (en) | LDPC hard decision decoding method based on depth learning and decoder | |
Chen et al. | An efficient design of bit-interleaved polar coded modulation | |
CN105515590A (en) | Successive cancellation list polarization code decoding algorithm with effective low complexity based on random binary data flows and decoding structural frame thereof | |
CN106888026A (en) | Segmentation polarization code coding/decoding method and system based on LSC CRC decodings | |
CN104767537A (en) | Turbo decoding method for OFDM power line communication system | |
CN109981226A (en) | A kind of combined dispatching decoding algorithm of joint source-channel coding system | |
CN107453807A (en) | A kind of polarization method, device and the electronic equipment of atmospheric optical communication channel model | |
CN110138390A (en) | A kind of polarization code SSCL algorithm decoder based on deep learning | |
CN107707333A (en) | A kind of polarization code earlier iterations method of shutting down and device based on code word estimate | |
Hu et al. | A comparative study of polar code decoding algorithms | |
CN111726202A (en) | Early termination iteration method for polarization code belief propagation decoding | |
He et al. | An efficient 4-D 8PSK TCM decoder architecture | |
CN109194338A (en) | A kind of polarization code coding method of the more bit process of mixed node | |
CN102832954B (en) | Turbo code iterative decoding stopping method based on soft information average minimum value | |
CN103220007B (en) | The TPC iterative decoding algorithm of the unreliable figure place of a kind of self-adaptative adjustment subcode | |
US6690752B2 (en) | Sequential decoder for decoding of convolutional codes | |
CN110739975B (en) | Variable node multiplexing method of semi-random decoder | |
CN103701475B (en) | Decoding method for Turbo codes with word length of eight bits in mobile communication system | |
CN107682122B (en) | Iterative demodulation decoding method of wireless optical communication multilevel coding modulation system | |
Jiang et al. | A Fano Decoding for Polar Codes Based on Node Acceleration | |
Yang et al. | Belief propagation list bit-flip decoder for polar codes |
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 | ||
GR01 | Patent grant | ||
GR01 | Patent grant |