Approximate calculation-based polarization code belief propagation decoding method and decoder

A technology of approximate calculation and belief propagation, applied in the field of computer decoding, can solve the problem of high computational complexity and achieve the effect of reducing hardware consumption

Active Publication Date: 2018-08-24
SOUTHEAST UNIV
View PDF6 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Purpose of the invention: Aiming at the problem of high computational complexity of the polar code belief propagation decoder in the prior art, the purpose of the present invention is to provide a polar code belief propagation decoding method and decoder based on approximate calculation. The computational method optimizes two kinds of nodes in the traditional belief propagation decoder

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Approximate calculation-based polarization code belief propagation decoding method and decoder
  • Approximate calculation-based polarization code belief propagation decoding method and decoder
  • Approximate calculation-based polarization code belief propagation decoding method and decoder

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] The present invention will be further described below in conjunction with the accompanying drawings and specific embodiments.

[0031] Factor graph of polar code belief propagation decoding algorithm figure 1 As shown, i is the row index in the factor graph; j is the column index in the factor graph; R i.j Indicates the information transmitted from left to right by the node located at (i,j) in the factor graph during the iterative process, that is, the right information; L i.j Indicates the information transmitted from right to left by the node located at (i, j) in the factor graph during the iterative process, that is, the left information; the decoding algorithm updates the left information L and right information R of each node according to the following formula:

[0032]

[0033] in,

[0034]

[0035] In the decoder, the nodes that realize the g operation function are called the first type nodes, and the nodes that realize the f operation function are calle...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an approximate calculation-based polarization code belief propagation decoding method and decoder. Approximate optimization treatment is executed for two types of decoding nodes in the conventional polarization code belief propagation decoder, thus, for the first type of node which realizes absolute value comparison operation of input data, when comparing input data absolute value size, only front section bits of the input data are compared, and bits of the back is ignored; and for the second type of node which realizes additive operation for the input data, a full adder and a full subtractor simultaneously perform operation for the absolute value of the input data, and a control number is generated according to an absolute value comparison result for performing screening, and a plus one unit in the operation only acts on the bits of the back part of the input data. According to the method and the decoder provided by the invention, key path delay and hardware consumption of the whole decoder are reduced by means of the approximate calculation. A simulation result shows that the method and the decoder provided by the invention can effectively reduce hardwareconsumption of the decoder and improve decoding efficiency.

Description

technical field [0001] The invention relates to a polar code belief propagation decoding method based on approximate calculation and a corresponding decoder, belonging to the technical field of computer decoding. Background technique [0002] Polar codes have attracted attention in recent years due to their ability to reach the Shannon limit with low encoding / decoding complexity. Belief Propagation Decoding Algorithm, as a parallel decoding algorithm, has attracted a lot of attention when applied to Polar. However, the traditional belief propagation decoding algorithm needs to calculate a large amount of data when decoding, which has high computational complexity. With the continuous increase of the amount of data and the improvement of people's requirements for data processing speed, the complexity of the decoder is also increasing rapidly. [0003] In order to balance the hardware complexity and decoding performance of the decoder, decoder designers have also made variou...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H03M13/13
CPCH03M13/13
Inventor 张川徐孟晖尤肖虎
Owner SOUTHEAST UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap