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

Low-complexity polarization code decryption SCL algorithm based on segmented verification assistance

A low-complexity, polar code technology, applied in the field of digital information transmission, can solve problems such as time extension and high space complexity, and achieve the effects of avoiding error propagation, low space complexity, and good performance

Inactive Publication Date: 2016-09-07
SOUTH CHINA UNIV OF TECH
View PDF3 Cites 46 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] In recent years, an improved algorithm based on the SCL algorithm has been proposed. It uses the cyclic redundancy check element (CRC) check element contained in the information bit sequence to select the optimal path among the last L paths. This algorithm has obtained more Excellent performance, the most used is CRC-24 in LTE, but the more possible paths this algorithm retains, the longer the delay and the higher the space 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
  • Low-complexity polarization code decryption SCL algorithm based on segmented verification assistance
  • Low-complexity polarization code decryption SCL algorithm based on segmented verification assistance
  • Low-complexity polarization code decryption SCL algorithm based on segmented verification assistance

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0044] The present invention will be further described in detail below in conjunction with the embodiments and the accompanying drawings, but the embodiments of the present invention are not limited thereto.

[0045] The embodiments of the present invention are directed to specific implementations of (L, K) Polar codes, where L represents the code word length, and K represents the information bit length. This example provides three implementations with different code lengths, which are (256, 128), (512, 256), (1024, 512), and the code rates of the three codes are all 1 / 2, in order to check with CRC-24 For comparison, we select a total of 24 parity elements. Firstly, the distribution of free bits and fixed bits of the polarized channel is obtained through the channel polarization scheme (the fixed bit is represented by 0, and the free bit is represented by 1), and then the 24-bit parity elements are evenly distributed among the free bits. According to the distribution of free ...

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 low-complexity polarization code decryption SCL algorithm based on segmented verification assistance, and the algorithm selects a parity check code, repeatedly uses the parity check code in a decryption process, and achieves the performances of SCL-CRC24. Moreover, compared with a conventional scheme, the algorithm is better in low signal to noise ratio anti-noise performance and error rate. In addition, the spatial complexity of the algorithm is lower than that of the SCL-CRC24, the time complexity is greatly reduced, and the decoding speed is greatly improved. Compared with a CRC-24 verification algorithm sacrificing multiple information bits, the algorithm employs a parity check method, enables verification elements to be distributed in the information bits, is repeatedly used in the decoding process, and is lower in time complexity than the prior art.

Description

technical field [0001] The invention relates to the field of digital information transmission, in particular to a low-complexity polar code decoding SCL algorithm based on subsection verification assistance. Background technique [0002] With the rapid development of economy and society, the demand for personal communication is getting higher and higher, which requires communication to have better stability, higher timeliness, and better adaptability in complex environments. Channel coding technology The performance of the communication system can be improved, the gain of coding can be obtained, and the capacity of the communication system can be improved. After Shannon's theorem was proposed, people have been working hard to find a code that can achieve channel capacity, and successively proposed Turbo codes and low-density parity-check codes (LDPC codes). They all reached the Shannon limit in theory and have been applied in practice It brings a lot of convenience to moder...

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/13H03M13/09
CPCH03M13/13H03M13/09
Inventor 王一歌李首贤
Owner SOUTH CHINA UNIV OF TECH
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