Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

List successive cancellation decoding method and apparatus for polar codes

A technology of continuous elimination of lists and polar codes, applied in the field of wireless channel coding, can solve the problems of unavoidable sorting operation of extended path metric values, reduction of computational complexity, etc., so as to reduce the complexity of decoding and ensure the effect of detection performance.

Active Publication Date: 2016-01-27
SOUTHEAST UNIV
View PDF3 Cites 53 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The adaptive decoder reduces the average length of the decoding list, but still cannot avoid the sorting operation of the extended path metric value, and there is room for further reduction in its computational complexity

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
  • List successive cancellation decoding method and apparatus for polar codes
  • List successive cancellation decoding method and apparatus for polar codes
  • List successive cancellation decoding method and apparatus for polar codes

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

[0022] The list decoder of the adaptive continuous elimination of the existing polar code only sets the maximum linked list length l for searching each layer max , through an adaptive path selection strategy to reduce the average linked list length l of the entire decoding process avg . Therefore, the length of the list of candidate paths in the decoding process is not fixed. Aiming at this feature, the idea of ​​the present invention is to replace the direct sorting with the loose sorting of the path reliability metric values ​​in the process of selecting candidate paths, so as to reduce the computational complexity of sorting and further reduce the average list length.

[0023] According to the theorem of large numbers, we can assume that the path reliability metric follows a Gaussian distribution. When the mean value is selected as the cut-off poin...

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 list successive cancellation decoding method for polar codes, belonging to the technical field of wireless channel coding. In searching of a code tree, a candidate path list is updated as follows: each candidate path in a previous layer of candidate path list is expanded, and a reliable measurement value of each expanded path is computed; then, expanded paths, the reliable measurement values of which are less than the reliable measurement threshold of the current layer, are eliminated, it is determined whether the quantity of left expanded paths is greater than a preset maximum list length lmax, if yes, expanded paths among the left expanded paths, the reliable measurement values of which are the minimum, are eliminated, and the quantity of the last remaining expanded paths is not greater than lmax; and finally, the paths are selected adaptively. Loose ranking of the measurement values of the paths is combined with existing self-adaption polar decoder, so that the apparatus is guaranteed to have the same detection performance as conventional decoders, and decoding complexity is greatly lowered.

Description

technical field [0001] The invention relates to a polar code decoding method, in particular to a list continuous depolarization code decoding method, which belongs to the technical field of wireless channel coding. Background technique [0002] Since the 1980s, wireless communication technology has developed rapidly and has become a hot technology with the greatest development potential and the broadest market prospect in the field of communication today. Mobile communication has experienced the development of the first generation of analog communication (1G), the second generation of cellular digital communication (2G), and the third generation of CDMA broadband communication (3G), and has now entered the industrialization of the fourth generation of mobile communication (4G) application stage. Mobile communication is developing towards high speed, high capacity, high spectral efficiency and low power consumption, and continuously meets people's growing data and video need...

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 Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

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