Unlock instant, AI-driven research and patent intelligence for your innovation.

Low-complexity progressive bit-flipping SC decoding method for polarization codes

A bit-flipping, low-complexity technology, applied in the field of channel coding and decoding, can solve problems such as computational complexity and decoding delay shortcomings, and achieve the effect of reducing the number of decoding attempts, computational complexity and decoding delay

Active Publication Date: 2019-01-29
SHANDONG UNIV OF SCI & TECH
View PDF8 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The decoding effect of progressive bit flipping SC algorithm is comparable to the algorithm with the best decoding effect in SCList series, and its hardware complexity is only equivalent to that of SC algorithm, but it needs The SC algorithm is called multiple times for repeated decoding, so it has shortcomings in terms of computational complexity and decoding delay

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
  • Low-complexity progressive bit-flipping SC decoding method for polarization codes
  • Low-complexity progressive bit-flipping SC decoding method for polarization codes
  • Low-complexity progressive bit-flipping SC decoding method for polarization codes

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0035] The technical scheme of the present invention is described in detail below in conjunction with accompanying drawing:

[0036] The decoding tree structure of SC decoding algorithm of polar code is as follows: figure 1 (Taking a polar code with a code length of 16 as an example), the bottom leaf node of the decoding tree corresponds to the position information of the polar code, figure 1 The leaf nodes with numbers from 0 to 15 represent polar codes with a code length of 16, where white circles represent fixed bit nodes, and black nodes represent information bit nodes. When decoding starts, the received sequence to be decoded will be transmitted through the channel The log-likelihood ratio sequence of Passed to the root node of the decoding tree. figure 2is the basic decoding unit of the SC decoding tree, where node Vp represents the parent node of node V, and nodes Vl and Vr represent the left and right child nodes of node V respectively. When node V is activated,...

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 a low-complexity progressive bit-flipping SC decoding method for polarization codes, which decodes polarization coded information by using a progressive bit-flipping SC decoding algorithm, wherein the polarization coded information is obtained by firstly carrying out CRC coding and then carrying out polarization code coding on original information. According to the invention, the polarization code coding information is decoded for the first time by using the SC algorithm, CRC (Cyclic Redundancy Check) is performed on the decoding result, the decoding result is outputtedif the decoding result passes the check, otherwise, an error bit set is constructed by using an error bit positioning strategy, and then error bits in the set are flipped for an SC decoding try so asto correct error bits in the first SC decoding result. The method adopts an error bit combination deletion strategy to reduce the number of SC repeated decoding times in the decoding process withoutcausing loss in decoding effect; and compared with the traditional progressive bit-flipping SC algorithm, the method can effectively reduce the computation complexity and decoding delay of the decoding.

Description

technical field [0001] The invention relates to a polar code decoding method, in particular to a low-complexity polar code progressive bit-flip SC decoding method, which belongs to the technical field of channel coding and decoding. Background technique [0002] Polar codes were first proposed by Arikan at the International Information Theory ISIT Conference in 2008, and are the only coding methods that have been strictly proven to achieve channel capacity. At present, the error correction performance that polar codes can achieve exceeds the widely used Turbo codes and LDPC codes. On November 18, 2016, at the 3GPP RAN1#87 meeting held in Reno, Nevada, USA, after several rounds of technical discussions among representatives of participating companies, the International Organization for Mobile Communications Standardization 3GPP finally determined the 5G eMBB (Enhanced Mobile Broadband) scenario. The channel coding scheme, wherein polar code is selected as the coding scheme o...

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
IPC IPC(8): H03M13/13H03M13/09
CPCH03M13/09H03M13/13
Inventor 张小军张作文崔建明曾庆田宋戈陈赓张德学王道岩烟晓凤李娜
Owner SHANDONG UNIV OF SCI & TECH
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More