Non-recursive SC decoding partial sum determination method and device

A deterministic, non-recursive technology, applied in the field of channel coding, which can solve the problems of long operation time, large storage space, and many recursive function calls.

Active Publication Date: 2018-04-13
HARBIN INST OF TECH
View PDF4 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0027] The purpose of the present invention is to solve the shortcomings of the existing recursive SC decoding algorithm that calls the recursive function too many times, and the space complexity is relatively high, which leads to too long operation time and too large storage space in the communication process, and proposes A non-recursive SC decoding part sum determination method and device

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
  • Non-recursive SC decoding partial sum determination method and device
  • Non-recursive SC decoding partial sum determination method and device
  • Non-recursive SC decoding partial sum determination method and device

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach 1

[0057] Specific Embodiment 1: This embodiment provides a non-recursive SC decoding part and a determination method. Before the method transmits information, the communication parties first need to determine the desired channel transmission code rate, and then the communication parties need to select according to the channel selection method. Pick NR out of N polarized channels such that the channel W N The reliability of is as high as possible. Finally, the two parties need to agree on the bit value filled in the frozen bit;

[0058] The sender encodes the polar code to encoded as Afterwards, it is sent to the receiver N times through the channel W, and the bit string received by the receiver is assumed to be This process can also be viewed as combining channels W N The above input message is The output message is The transmission process; the receiver needs to And quadruple information (N, K, I, u Ic ),estimate value, denoted as Composite channel W N Consist...

specific Embodiment approach 2

[0071] Specific implementation mode two: the difference between this implementation mode and specific implementation mode one is:

[0072] estimate The specific method is:

[0073] when calculating , sequentially calculate f 2 , f 4 ,..., f N ;

[0074] when calculating , calculate in turn where f j Indicates that the likelihood ratio of the jth layer is calculated using the formula f The formula f is specifically:

[0075]

[0076]

[0077] g j Indicates that the likelihood ratio of the jth layer is calculated using the formula g The formula g is specifically:

[0078]

[0079] g(a,b,s)=a 1-2s b

[0080] k i to estimate The maximum recursion depth for time-likelihood ratio calculation; 2≤i≤N.

[0081] That is, there are many ways to obtain the likelihood ratio, and the likelihood ratio calculation method in this embodiment can be used. The advantage of this embodiment is that the calculation of the likelihood ratio also uses a non-recursive meth...

specific Embodiment approach 3

[0083] Specific embodiment three: the difference between this embodiment and specific embodiment one or two is:

[0084] When the calculation of M k When the left child node part of the node is summed, the left child node part sum should be stored in M k part and In the storage space, when the calculation of M k When the partial sum of the right child node, the M k The partial sum of the right child is stored in M k In the storage space of the left child node, when passing M k Left child node partial sum and M k The right child node part and the calculated M k part of and when, will Stored in the storage space of the right child node.

[0085] Specifically, in order to reduce the space complexity, we use time-division multiplex storage for likelihood ratios and partial sums in the non-recursive SC decoding algorithm. For the likelihood ratio, because only the likelihood ratio of one node is input or output each time, there will be no access conflict in the time-di...

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 relates to a non-recursive SC decoding partial sum determination method and device. The method is proposed for solving the defect that the existing recursive SC decoding algorithm is frequent in recursive function calling and high in space complexity. The non-recursive SC decoding partial sum determination method comprises the following steps: outputting partial sum of a M0 node corresponding to the formula as shown in description, wherein the M0 node represents a leaf node of a sub-tree taking the formula as shown in description as a root node, and ki is the maximum recursive depth of the likelihood ratio computation when estimating the formula as shown in description; executing the following operations for 2k-1 times so as to compute the partial sum of the node Mk: formulaas shown in description, wherein i is not less than 0 and less than 2k-1; upwardly computing along the rightmost side until the node as shown in description finally outputs the value of the formula asshown in description. The SC decoding algorithm is realized by using the non-recursive way, the calling frequency of the recursive function is reduced to zero, and the decoding rate is improved. Furthermore, the algorithm space complexity is reduced to O(N) by adopting the time-division multiplexing storage way for the likelihood ratio and the partial sum.

Description

technical field [0001] The invention relates to the field of channel coding, in particular to a method and device for non-recursive SC decoding part and determination. Background technique [0002] SC (Successive Cancellation) is the first and most widely used decoding algorithm of Polar Code. Polar codes have Shannon limit-reachable error correction performance. Compared with LDPC, it not only has better error correction performance, but also has lower encoding and decoding complexity. Polar codes are currently widely used in the field of channel coding and quantum key distribution (Quantum Key Distribution, QKD). [0003] Before transmitting a message, the two communicating parties first need to determine the expected channel transmission code rate, denoted as R. According to Shannon's theorem, R≤I(W) must be satisfied for reliable transmission. Then the communication parties need to select NR from the N polarized channels according to the channel selection method so t...

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
CPCH03M13/13H04L1/0054
Inventor 李琼韩琦刘兆庆王亚星乐丹王轩
Owner HARBIN INST OF TECH
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