Dynamic distribution sorting algorithm based on successive cancellation list polarization code decoding

A technology of distributed sorting and polar codes, which is applied in the direction of data representation error detection/correction, using linear codes for error correction/detection, and using block codes for error correction/detection, etc., which can solve unfavorable hardware implementation, large delay, Add memory units and other issues to achieve the effect of avoiding direct sorting and reducing sorting complexity

Inactive Publication Date: 2017-05-10
SOUTHEAST UNIV
View PDF4 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

If you choose a method similar to bubble sorting or selection sorting, the computational complexity is O(L 2 ); if you choose a method similar to heap sorting, its computational complexity is O(Llog2L), but it also increases the required memory unit
In addition, the delay of the two algorithms is large, which is not conducive to high-speed hardware implementation

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
  • Dynamic distribution sorting algorithm based on successive cancellation list polarization code decoding
  • Dynamic distribution sorting algorithm based on successive cancellation list polarization code decoding
  • Dynamic distribution sorting algorithm based on successive cancellation list polarization code decoding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0028] The technical solution of the present invention will be further introduced below in combination with specific embodiments.

[0029] 1. Search code tree

[0030] The SCL decoding algorithm of Polar code is essentially a breadth-first tree search algorithm. The search code tree of N-bit Polar code is as follows: figure 1 As shown, L is the number of reserved paths. figure 1 The path (survival path) with the largest path metric value (Path Metric, PM) in the Nth layer is the decoding output The number of times represents a vector, and the labels are N decoding results from 1 to N.

[0031] 2. SCL algorithm

[0032] For the parameter is Polar code, N is the code length, K is the number of information bits. Corresponding channel W N The output vector of is Indicates the number of accepted N received data, numbered from 1 to N. A is a collection of information bit distribution situations. is the value of the frozen bit, usually set to 0. The decoded path metric ...

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 dynamic distribution sorting algorithm based on successive cancellation list polarization code decoding. The algorithm comprises the following steps that two extended child nodes of each father node are set as FC and NC, wherein FC is a better node and NC is a poor node; L FC nodes are taken as L preferred optimal paths, and the final sorting is completed through dynamic replacement of individual FC and NC. The FC node has advantages in SCL decoding, so that the fewer nodes need replacement. The property is utilized, so that the sorting complexity can be reduced to a great extent.

Description

technical field [0001] The invention relates to a dynamic distribution sorting algorithm based on serial cancellation list polar code decoding. Background technique [0002] Arlkan proposed that polar codes are the first class of channel coding that can almost achieve the capacity of symmetric binary-input discrete memoryless channels (B-DMCs). Due to its low computational complexity of O(NlogN), where N is the length of the polar code; and the decoding structure in the form of Fast Fourier Transformation (FFT), serial offset decoding successive cancellation (SC) algorithm Has become one of the most effective 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 suboptimal path selection of the traditional serial offset decoder, the list serial offset decoding algorithm (list SC polar decoder) came into...

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