A polar code SBP decoder based on G-Matrix verification

A decoder and decoding technology, applied in the direction of using linear codes for error correction/detection, using block codes for error correction/detection, digital transmission systems, etc., can solve problems such as insufficient performance of BP decoders

Pending Publication Date: 2019-05-31
CHINA JILIANG UNIV
View PDF0 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In order to solve the problem of insufficient performance of the BP decoder, the present invention proposes a high-performance SBP decoder that increases the initial value of the information bit R information in segments

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
  • A polar code SBP decoder based on G-Matrix verification
  • A polar code SBP decoder based on G-Matrix verification
  • A polar code SBP decoder based on G-Matrix verification

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0012] The present invention will be described in further detail below in conjunction with the accompanying drawings. The following examples are helpful to the understanding of the present invention and are better application examples, but should not be regarded as a limitation of the present invention.

[0013] Step 1: Use the method of Gaussian approximation to select information bits to calculate the N-bit sub-channel capacity C=[C 1 C 2 C 3 ,...,C N ], the vector C'=[C' can be obtained by processing C in descending order from large to small 1 C' 2 C' 3 ,...,C′ N ], while introducing a new vector Let C'=C(λ(i)).

[0014] Step 2: BP iterative decoding adopts the formula (1) G-Matrix early termination algorithm mentioned by Bo Yuan in the existing literature, where G is the generator matrix, and Represent the hard decision decoding at the left and right ends of the BP factor graph, which can be obtained according to formula (2), M=log 2 N, i∈[1,N].

[0015]

...

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 provides an efficient SBP decoder for segmentally increasing an information bit R information initial value. The efficient SBP decoder is composed of an information bit reliability sorting module, an information bit segmentation processing module and a G- Matrix verification module and the like. The invention discloses a method for selecting information bits based on Gaussian approximation, sequencing processing is carried out on the information bit reliability from large to small to obtain an index vector (shown in the specification), and then the index vector (shown in the specification) is subjected to vector alignment (shown in the specification); sequence of the number of subvectors is shown in the specification, the initial value of the information bit R information inthe vector (shown in the specification) is sequentially increased, and finally, re-decoding and utilizing the G-Matrix check to find decoding optimization. The method can be regarded as an informationbit to be converted into a frozen bit to a certain extent, namely, the effect of improving the decoding performance when the code rate is reduced without changing effective information can be achieved. The method is simple and effective, searching, changing and checking are only carried out when decoding is wrong, the error correction capability is greatly improved, the optimization effect of BPdecoding performance is obvious, and the bit error rate performance is improved by 0.25 dB when n is equal to 16.

Description

technical field [0001] The present invention relates to the technical field of electronic communication, in particular to the technical field of polar code channel decoding, specifically refers to segmentally increasing the initial value of information bit R information, and designing segmented SBP( SegmentBelief Propagation) decoder. Background technique [0002] In 2009, Arikan proposed the concept of channel polarization. By combining the same channels and then splitting the synthesized channels, part of the channel capacity after splitting tends to 0, and the other part tends to 1, forming polarization. The phenomenon. Polar codes are a new type of channel coding based on channel polarization. So far, the only channel coding method that can reach the Shannon limit is a milestone in coding theory. Polar code decoding methods are mainly divided into two types: Successive Cancellation (SC) decoding and Belief Propagation (BP) decoding. SC decoding estimates the source sig...

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/13H04L1/00
Inventor 王秀敏郑志军单良洪波肖英
Owner CHINA JILIANG 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