Successive cancellation list polarization code decoding algorithm with effective low complexity based on random binary data flows and decoding structural frame thereof

A binary data stream, low-complexity technology, applied in the field of effective decoding, can solve the problems of decreased decoding performance and loss of random sequence randomness, and achieves the effects of strong controllability, reduced complexity, and long delay.

Active Publication Date: 2016-04-20
SOUTHEAST UNIV
View PDF4 Cites 19 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, directly applying the serial offset list decoder based on the random data stream in practice will lead to a serious degradation in decoding performance due to the continuous loss of randomness of the random sequence in the operation

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
  • Successive cancellation list polarization code decoding algorithm with effective low complexity based on random binary data flows and decoding structural frame thereof
  • Successive cancellation list polarization code decoding algorithm with effective low complexity based on random binary data flows and decoding structural frame thereof
  • Successive cancellation list polarization code decoding algorithm with effective low complexity based on random binary data flows and decoding structural frame thereof

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0035] The present invention will be further described below in conjunction with the accompanying drawings.

[0036] 1. List-serial offset polar code decoding algorithm based on random binary data stream, wherein the list length L=1

[0037] 1) Traditional SC decoder algorithm

[0038] Consider a polar code (N, K, A), where N represents the code length of the polar code, K represents the number of effective information in the polar code, and A represents the set of effective information bits. Let the vector to be decoded received by the receiving end be y i =(y 1 ,...,y N ), the decoding result at the receiving end is expressed as if u i is not valid information bits, we will Zero. Otherwise the decoded bits can be expressed as:

[0039] u ^ i = 0 , i f ...

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 successive cancellation list polarization code decoding algorithm with effective low complexity based on random binary data flows and a decoding structural frame thereof. The algorithm comprises the steps of converting received vectors to be decoded into corresponding input probability values through a channel message scaling algorithm; generating corresponding random binary data flows from the computed input probability values, and respectively inputting the data flows into two basic disk-type decoding frames; obtaining the conditional probability values of decoding through computing the data flows by the mixed node of the two basic disk-type decoding frames; working out the conditional probability random data flows of four paths by a phase inverter; obtaining the final judgment of the path probabilities through allowing the four condition probabilities to pass through an AND gate; through the computation of a feedback module, integrating signals, feeding back into the basic disk-type frames, allowing the data flows to pass through the basic disk-type decoding frames for the second time, and thereby obtaining the conditional probability values; and obtaining the optimal path decoding result. According to the algorithm provided by the invention, the complexity of the system is reduced, and meanwhile the random data flow decoding performance is improved.

Description

technical field [0001] The present invention relates to the effective decoding of polar codes in encoding technology, in particular to a decoding algorithm of low complexity serial cancellation list suitable for polar codes and its decoding framework. Background technique [0002] It is proposed that polar codes are the first class of channel coding that can achieve almost the capacity of symmetric binary-input discrete memoryless channels (B-DMCs). Due to its lower computational complexity of O(NlogN), where N is the polar code length; and the decoding structure in the form of Fast Fourier Transformation (FFT), the serial cancellation decoding (SC) algorithm has become the most One of the efficient polar decoding algorithms. However, compared with the maximum likelihood (ML) decoder, the decoding performance of the serial cancellation decoder still has a large decline. In order to narrow the performance gap caused by the sub-optimal path selection of the traditional ser...

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