CN105846833B - A kind of weighted messages transmitting interpretation method based on becate distribution - Google Patents
A kind of weighted messages transmitting interpretation method based on becate distribution Download PDFInfo
- Publication number
- CN105846833B CN105846833B CN201610227308.9A CN201610227308A CN105846833B CN 105846833 B CN105846833 B CN 105846833B CN 201610227308 A CN201610227308 A CN 201610227308A CN 105846833 B CN105846833 B CN 105846833B
- Authority
- CN
- China
- Prior art keywords
- ring
- becate
- tanner
- node
- check
- 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
- 238000000034 method Methods 0.000 title claims abstract description 32
- 239000011159 matrix material Substances 0.000 claims abstract description 12
- 108020004705 Codon Proteins 0.000 claims abstract description 4
- 230000005540 biological transmission Effects 0.000 claims description 11
- 238000004891 communication Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000002716 delivery method Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
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/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
- H03M13/255—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] with Low Density Parity Check [LDPC] codes
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 kind of weighted messages based on becate distribution to transmit interpretation method, includes the following steps: step 1, initialization；Step 2, the number for calculating the ring of a length of g of ring of every side participation in the corresponding Tanner figure of check matrix H, g is that the ring of most becate in the corresponding Tanner figure of H is long；Step 3, the weight parameter w for calculating each edge in the corresponding Tanner figure of check matrix Hnm, wnmIndicate variable node vnWith check-node cmBetween side EnmWeight；Step 4 calculates the message value that check-node is transmitted to variable node；Step 5 calculates the weighted messages value that variable node is transmitted to check-node；Step 6 calculates correction subvectorIf step 7, correction subvectorIt is equal to the maximum cycle of setting for null vector or current cycle time, then turns to step 8；Otherwise step 4 is turned to, while cycle-index adds 1；Step 8, output codons.Fully consider the difference of LDPC code internal structure to promote decoding performance.
Description
Technical field
The present invention relates to a kind of weighted messages based on becate distribution to transmit interpretation method.
Background technique
Information will receive the interference of various noises in communication channel in transmission process, in order to guarantee the accurate biography of information
It is defeated, it needs that channel coding is added in a communications system.A kind of channel coding optimal as current decoding performance, LDPC code (Low
Density Parity Check Code: low density parity check code) also have the low advantage of decoding complexity simultaneously,
When being iterated decoding using message transmission (Message Passing, MP) interpretation method, complexity can be down to and be proportional to code
Long, message delivery method is also referred to as BP method.Since there are becates on the corresponding Tanner figure of check matrix, so using
BP can generate the higher message of correlation when decoding, to influence decoding performance.
In order to reduce the influence of becate, Wymeersch et al. [H.Wymeersch, " Uniformly reweighted
belief propagation for estimation and detection in wireless networks,”IEEE
Transactions on Wireless Communications, vol.11, no.4, pp.1587-1595,2012.] it constructs
A kind of uniformly weighting belief propagation method (Uniformly Reweighted Belief Propagation, URW-BP): disappearing
Weight of each message one less than 1 is assigned during breath transmitting, the weight code fixed for one is unique.The party
The advantages of method, is relatively applicable in when LDPC code is by Algebraic Construction, the disadvantage is that not considering the partial structurtes difference of LDPC code, is fitted
It is smaller with range.
Summary of the invention
In view of the above-mentioned problems, the present invention provides a kind of weighted messages transmitting interpretation method (Cycle- based on becate distribution
Based Weighted BP, CW-BP), according to each edge participate in becate quantity come determine corresponding weight (0 < weight <
1), fully consider the difference of LDPC code internal structure to promote decoding performance.
To realize above-mentioned technical purpose and the technique effect, the invention is realized by the following technical scheme:
A kind of weighted messages transmitting interpretation method based on becate distribution, which comprises the steps of:
Step 1, initialization, comprising:
A, transmission pattern is modulated using Gaussian channel BPSK, symbol 0 is mapped as 1 transmission, symbol 1 is mapped as -1 transmission；
B, maximum cycle is set and sets initial cycle number as 0；
C, the channel probability of acceptance is calculated；
Step 2, the number for calculating the ring of a length of g of ring of every side participation in the corresponding Tanner figure of check matrix H, g is H pairs
The ring of most becate is long in the Tanner figure answered；
Step 3, the weight parameter w for calculating each edge in the corresponding Tanner figure of check matrix Hnm, wnmIndicate variable node
vnWith check-node cmBetween side EnmWeight；
Step 4 calculates the message value that check-node is transmitted to variable node；
Step 5 calculates the weighted messages value that variable node is transmitted to check-node；
Step 6 calculates correction subvector
If step 7, correction subvectorIt is equal to the maximum cycle of setting for null vector or current cycle time, then
Turn to step 8；Otherwise step 4 is turned to, while cycle-index adds 1；
Step 8, output codons.
It is preferred that in step 3 in the corresponding Tanner figure of check matrix H each edge weight parameter wnmCalculating it is as follows:
Enable E={ EnmBe Tanner figure in side set, 0 < wnm≤ 1, it finds out by side EnmMost becate number, enable
NgIt (nm) is side EnmThe number of the ring of a length of g of the ring of participation, then:
wnm=δ (1-Ng(nm)/Ng_max)+1- δ, wherein g is that the ring of most becate in the corresponding Tanner figure of H is long, Ng_max
The number maximum value of the ring of a length of g of ring, 0 < δ < 1 are participated in for a line in Tanner figure.
The beneficial effects of the present invention are:
The number for the most becate that decoder is participated according to each edge assigns the different weight in every side (0 < weight < 1), for
A line in Tanner figure, the correlation transmitted between message is related with the number of most becate that it is participated in, and the number the more, weigh
It is again lower；The number the few, influence it is fewer, to be assigned to higher weighted value.During information updating, the present invention is to mark
The message transmitted in quasi- BP method is weighted amendment, completes decoding, and the present invention is obviously improved decoding performance compared with BP method.
Detailed description of the invention
Fig. 1 is a kind of flow chart of the weighted messages transmitting interpretation method based on becate distribution of the present invention；
Fig. 2 is the distribution of PEG504 code most becate；
Fig. 3 is decoding curve of the PEG504 code under different signal-to-noise ratio；
Fig. 4 is the decoding curve of PEG504 code difference maximum number of iterations when signal-to-noise ratio is 4.3dB.
Specific embodiment
Technical solution of the present invention is described in further detail with specific embodiment with reference to the accompanying drawing, so that ability
The technical staff in domain can better understand the present invention and can be practiced, but illustrated embodiment is not as to limit of the invention
It is fixed.
A kind of weighted messages transmitting interpretation method based on becate distribution, as shown in Figure 1, including the following steps:
Step 1, initialization, comprising:
A, transmission pattern is modulated using the Gaussian channel BPSK of standard, symbol 0 is mapped as 1 transmission, symbol 1 is mapped as -1
It sends；
B, maximum cycle is set and sets initial cycle number as 0；
C, the channel probability of acceptance is calculated.
Step 2, the number for calculating the ring of a length of g of ring of every side participation in the corresponding Tanner figure of check matrix H, g is H pairs
The ring of most becate is long in the Tanner figure answered.
Specific calculation method can use method [the HALFORD T R, " An algorithm for of HALFORD
counting short cycles in bipartite graphs,”IEEE Transactions on Information
Theory,2006,vol.52,no.1,pp.287-292.]。
Step 3, the weight parameter w for calculating each edge in the corresponding Tanner figure of check matrix Hnm, wnmIndicate variable node
vnWith check-node cmBetween side EnmWeight；
Step 4 calculates the message value that check-node is transmitted to variable node；
Step 5 calculates the weighted messages value that variable node is transmitted to check-node；
Step 6 calculates correction subvector
If step 7, correction subvectorIt is equal to the maximum cycle of setting for null vector or current cycle time, then
Turn to step 8；Otherwise step 4 is turned to, while cycle-index adds 1；
Step 8, output codons.
It is preferred that in step 3 in the corresponding Tanner figure of check matrix H each edge weight parameter wnmCalculating it is as follows:
Enable E={ EnmBe Tanner figure in side set, 0 < wnm≤ 1, it finds out by side EnmMost becate number, enable
NgIt (nm) is side EnmThe number of the ring of a length of g of the ring of participation, then:
wnm=δ (1-Ng(nm)/Ng_max)+1- δ, wherein g is that the ring of most becate in the corresponding Tanner figure of H is long, Ng_max
The number maximum value of the ring of a length of g of ring is participated in for a line in Tanner figure, 0 < δ < 1, the optimal value of δ is compared by simulation result
It obtains.
It describes in detail below with reference to specific embodiment.
Emulation is modulated using BPSK, and Gaussian white noise channel is decoded in method provided by the invention.It is calculated for PEG
The code length of method construction is 504, the code (being expressed as PEG504) that code rate is 1/2, and emulation packet count is 108.For PEG504 code, root
According to step 2, as shown in Fig. 2, the most becate number that every side participates at least is 3, up to 44.It is searched for through emulation, δ value is set as
0.29。
Fig. 3 gives the decoding of standard BP, URW-BP and CW-BP provided by the invention under awgn channel difference signal-to-noise ratio
Curve.As shown in figure 3, being 10 in FER-5When, method ratio BP provided by the invention and URW-BP method respectively improve 0.2dB and
0.1dB.When signal-to-noise ratio is equal to 4.3dB, the frame error rate ratio BP and URW-BP method of method provided by the invention are reduced respectively
90% and 60%.
Fig. 4 gives standard BP, and URW-BP and CW-BP the method provided by the invention signal-to-noise ratio under awgn channel are
The curve that FER when 4.3dB changes with maximum number of iterations.As shown in figure 4, being 10 in FER-5When, method provided by the invention
Than the maximum number of iterations that BP and URW-BP method reduces 75% and 30% respectively.When maximum number of iterations is 15, this hair
The CW-BP method of bright offer has been even more than decoding performance of the standard BP method at greatest iteration 100 times.
Compared with prior art, the beneficial effects of the present invention are:
1. the present invention has fully considered the partial structurtes feature of Tanner figure, the number of the most becate participated according to every side is assigned
Give the different weight in every side.
2. the weighted messages transmission method decoding performance provided by the present invention based on becate distribution is than traditional BP method
It has a distinct increment.
3, compared with paper, this invention simplifies the number of parameters that needs are arranged, and reduce complexity.
The above is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all to utilize this hair
Equivalent structure made by bright specification and accompanying drawing content perhaps equivalent process transformation or be directly or indirectly used in other correlation
Technical field, be included within the scope of the present invention.
Claims (1)
1. a kind of weighted messages based on becate distribution transmit interpretation method, which comprises the steps of:
Step 1, initialization, comprising:
A, transmission pattern is modulated using Gaussian channel BPSK, symbol 0 is mapped as 1 transmission, symbol 1 is mapped as -1 transmission；
B, maximum cycle is set and sets initial cycle number as 0；
C, the channel probability of acceptance is calculated；
Step 2, the number for calculating the ring of a length of g of ring of every side participation in the corresponding Tanner figure of check matrix H, g is that H is corresponding
The ring of most becate is long in Tanner figure；
Step 3, the weight parameter w for calculating each edge in the corresponding Tanner figure of check matrix Hnm, wnmIndicate variable node vnWith
Check-node cmBetween side EnmWeight；
Step 4 calculates the message value that check-node is transmitted to variable node；
Step 5 calculates the weighted messages value that variable node is transmitted to check-node；
Step 6 calculates correction subvector
If step 7, correction subvectorIt is equal to the maximum cycle of setting for null vector or current cycle time, then turns to step
Rapid 8；Otherwise step 4 is turned to, while cycle-index adds 1；
Step 8, output codons；
In step 3 in the corresponding Tanner figure of check matrix H each edge weight parameter wnmCalculating it is as follows: enable E={ EnmBe
The set on side in Tanner figure, 0 < wnm≤ 1, it finds out by side EnmMost becate number, enable NgIt (nm) is side EnmIt participates in
The number of the ring of a length of g of ring, then:
wnm=δ (1-Ng(nm)/Ng_max)+1- δ, wherein g is that the ring of most becate in the corresponding Tanner figure of H is long, Ng_maxFor
A line participates in the number maximum value of the ring of a length of g of ring, 0 < δ < 1 in Tanner figure.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610227308.9A CN105846833B (en) | 2016-04-13 | 2016-04-13 | A kind of weighted messages transmitting interpretation method based on becate distribution |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610227308.9A CN105846833B (en) | 2016-04-13 | 2016-04-13 | A kind of weighted messages transmitting interpretation method based on becate distribution |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105846833A CN105846833A (en) | 2016-08-10 |
| CN105846833B true CN105846833B (en) | 2019-06-25 |
Family
ID=56597441
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610227308.9A Active CN105846833B (en) | 2016-04-13 | 2016-04-13 | A kind of weighted messages transmitting interpretation method based on becate distribution |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105846833B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101064591A (en) * | 2006-04-24 | 2007-10-31 | 中兴通讯股份有限公司 | Decoding method for low density parity check code and its check node refreshing circuit |
| CN104052501A (en) * | 2014-06-26 | 2014-09-17 | 北京航空航天大学 | Multi-system LDPC decoding method low in complexity |
| US8880985B2 (en) * | 2011-10-05 | 2014-11-04 | Nec Laboratories America, Inc. | High-speed long codeword QC-LDPC soft decision decoder |
-
2016
- 2016-04-13 CN CN201610227308.9A patent/CN105846833B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101064591A (en) * | 2006-04-24 | 2007-10-31 | 中兴通讯股份有限公司 | Decoding method for low density parity check code and its check node refreshing circuit |
| US8880985B2 (en) * | 2011-10-05 | 2014-11-04 | Nec Laboratories America, Inc. | High-speed long codeword QC-LDPC soft decision decoder |
| CN104052501A (en) * | 2014-06-26 | 2014-09-17 | 北京航空航天大学 | Multi-system LDPC decoding method low in complexity |
Non-Patent Citations (2)
| Title |
|---|
| Iterative Detection and Decoding for MIMO Systems with knowledge-Aided Belief Propagation Algorithms;Jingjing Liu;《2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)》;20121107;全文 |
| Iterative Detection and Decoding for MIMO Systems with knowledge-Aided Belief Propagation Algorithms;Jingjing Liu;《2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)》;20121107;第1252页第2栏Table1 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105846833A (en) | 2016-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11522564B2 (en) | Neural networks for forward error correction decoding | |
| CN107026656A (en) | A kind of long Polar codes efficient coding method of short code in CRC auxiliary based on disturbance | |
| CN101707485A (en) | LDPC decoding method combining bit flipping (BF) and majority logic (MLG) | |
| CN106130687B (en) | Polar code puncturing method based on decoding bit reliability under fading channel | |
| CN108768409A (en) | A kind of LDPC interpretation methods based on normalization minimum value of optimization | |
| CN110535475B (en) | Hierarchical adaptive normalized minimum sum decoding algorithm | |
| CN103199874B (en) | Low density parity check code decoding method | |
| CN103259545A (en) | Quasi-cyclic low density odd-even check code belief propagation decoding method based on oscillation | |
| CN108809518B (en) | Method for constructing cascade Spinal code for reducing error performance | |
| CN102811065B (en) | Mini-sum decoding correcting method based on linear minimum mean error estimation | |
| CN109565287A (en) | The polarization that degrades decoding | |
| CN107864029A (en) | A kind of method for reducing Multiuser Detection complexity | |
| CN105281835A (en) | Visible light communication method based on LDPC code | |
| CN106209305B (en) | A kind of fountain code coding method under access channel | |
| He et al. | Model-driven DNN decoder for turbo codes: Design, simulation, and experimental results | |
| CN107968657A (en) | A kind of hybrid decoding method suitable for low density parity check code | |
| CN111342935A (en) | High-performance soft-decision decoding method based on QC-LDPC code | |
| CN108199805A (en) | A kind of method for reducing Sparse Code multi-address system decoding complexity | |
| CN107919875B (en) | Evaluation method of LDPC code Tanner graph ring structure and two optimization methods applied by evaluation method | |
| CN105846833B (en) | A kind of weighted messages transmitting interpretation method based on becate distribution | |
| CN108023679A (en) | Iterative decoding zoom factor optimization method based on parallel cascade system polarization code | |
| CN101697492B (en) | Double-binary convolutional Turbo code decoding method and device | |
| CN107181567A (en) | A kind of low complex degree MPA algorithms based on thresholding | |
| CN111726310A (en) | Joint channel estimation and decoding method and device based on message propagation algorithm | |
| CN107612557A (en) | A kind of modified Shuffled BP algorithms |
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 | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 100031 Xicheng District West Chang'an Avenue, No. 86, Beijing Co-patentee after: NARI TECHNOLOGY Co.,Ltd. Patentee after: State Grid Corporation of China Co-patentee after: STATE GRID HEBEI ELECTRIC POWER Co. Co-patentee after: STATE GRID JIBEI ELECTRIC POWER Co.,Ltd. Co-patentee after: NARI Group Corp. Address before: 100031 Xicheng District West Chang'an Avenue, No. 86, Beijing Co-patentee before: NARI TECHNOLOGY Co.,Ltd. Patentee before: State Grid Corporation of China Co-patentee before: STATE GRID HEBEI ELECTRIC POWER Co. Co-patentee before: STATE GRID JIBEI ELECTRIC POWER Co.,Ltd. Co-patentee before: NARI Group CORPORATION STATE GRID ELECTRIC POWER INSTITUTE |