Supercharge Your Innovation With Domain-Expert AI Agents!

Implementation method of low-complexity polar code folding hardware architecture based on k-segment decomposition

An implementation method and low-complexity technology, which is applied to coding components, using block codes for error correction/detection, coding, etc., to achieve the effects of improving node resource utilization, reducing hardware complexity, and reducing hardware resource consumption.

Active Publication Date: 2019-10-11
SOUTHEAST UNIV
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When our hardware platform resources are limited, the traditional SC decoding hardware design has become a fatal factor restricting the code length of polar codes

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
  • Implementation method of low-complexity polar code folding hardware architecture based on k-segment decomposition
  • Implementation method of low-complexity polar code folding hardware architecture based on k-segment decomposition
  • Implementation method of low-complexity polar code folding hardware architecture based on k-segment decomposition

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

[0031] First introduce the traditional SC decoding algorithm.

[0032] 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:

[0033]

[0034] in, The channel transmission probability is defined. The decoding operation uses LLR (log-likelihood ratio) to calculate, and the definition of LLR is as follows:

[0035]

[0036] The algorithm of LLR satisfies the following recurrence relation:

[0037]

[0038] The traditional SC decoder con...

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 an implementation method for a low-complexity polarization code folding hardware framework based on k-segment decomposition. The method comprises the following steps of S1.decomposing an n-stage SC decoding algorithm into k segments, wherein k is a factor of n and meets a relation that n is equal to kp, p is an integer, the code length of a polarization code is N and N is equal to 2n; S2.configuring (k-1) secondary decoders for the decomposed k-segment SC decoding algorithm and computing a folding set of each segment, wherein the number of decoding stages of each decoder is p stage; and S3.constructing the polarization code folding hardware framework according to the folding set of each segment, which is obtained in the step S2. According to the method, the hardware complexity is greatly reduced, the hardware resource consumption is reduced and the node resource utilization rate is increased.

Description

technical field [0001] The invention relates to a method for realizing a polar code folding hardware framework, in particular to a method for realizing a low-complexity polar code folding hardware framework based on k-segment decomposition. Background technique [0002] Ar1kan 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. Most polar code decoding schemes have been decoded based on SC. [0003] However, the basic decoding principle followed by the SC decoding algorithm is to use the decoded bit information as the feedback information to decode bit by bit in sequenc...

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 Patents(China)
IPC IPC(8): H03M13/13H03M13/00
Inventor 张川梁霄杨俊梅尤肖虎
Owner SOUTHEAST UNIV
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com