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

Rapid sorting network method and device for polarization codes

A technology of quick sorting and sorting methods, which is applied in digital transmission systems, electrical components, and error prevention, and can solve problems such as the characteristics of different numbers of candidate paths, large network delays, and resource consumption without consideration

Active Publication Date: 2017-10-20
SHANDONG UNIV OF SCI & TECH
View PDF6 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The above sorting networks are all designed for the SCL algorithm, and do not consider the characteristics of the number of candidate paths generated by the Fast-SSC List nodes. Direct application to the Fast-SSC List will cause large network delays and resource consumption

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
  • Rapid sorting network method and device for polarization codes
  • Rapid sorting network method and device for polarization codes
  • Rapid sorting network method and device for polarization codes

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0073] The present invention is specifically as follows according to the sorting method of different node types:

[0074] A.Rate-0 node

[0075] Since Rate-0 nodes do not expand paths, there is no need to select candidate paths, and the L paths are directly reserved to the next level.

[0076] B. REP node

[0077] Every time a REP node is encountered, two paths are expanded, and there are 2L paths after the expansion, from which L paths need to be selected. The sorting method uses Odd-even and Bitonic hybrid sorting, that is, the first half of the sorting uses two L-input Odd-even sorting networks to sort the L candidate paths respectively to obtain two monotonous L sequences, and then uses HC in Bitonic sorting The network selects L minimum values, and the sorting block diagram is as follows figure 1 . Taking L=4 as an example, the detailed sorting network is as follows image 3 As shown, the sorting network is composed of three parts: comparator I (sorter1), comparator ...

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 sorting algorithm for a polarization code decoding algorithm and a hardware architecture of the sorting algorithm, and belongs to the technical field of wireless communication. Firstly, M*L candidate paths of M paths expanded from different types of nodes are pre-sorted when search width is L in a Fast-SSC List decoding algorithm. Secondly, the pre-sorted M*L candidate paths are simplified according to the sorting algorithm, and parts of redundant candidate paths are deleted. Thirdly, residual candidate paths are inputted to an MSR (mode suppression ratio) module and sorted. Finally, minimum L candidate paths are outputted. The sorting architecture compatible with four nodes is finally designed. Compared with a non-deletion sorting method, the sorting algorithm greatly saves resource consumption.

Description

technical field [0001] The invention belongs to the technical field of wireless communication. Background technique [0002] Polar code is currently the only theoretically proven coding scheme that can reach the Shannon (Shannon) limit, and has become an error-correcting code for the control channel of 5G communication. Gabi Sarkis and Pascal Giard proposed Fast-SSC (Fast Simplified Serial Cancellation) algorithm. Compared with SC (Serial Cancellation Algorithm), multiple codewords can be decoded in one clock cycle, which improves the throughput rate. In order to reduce the bit error rate, they proposed the Fast-SSC List (Fast Simplified Serial Cancellation List) algorithm, which improves the decoding performance of Fast-SSC and reduces the BLER (the ratio between the number of blocks with errors and the total number of blocks received by the digital circuit). Compare). However, the number of candidate paths expanded by Fast-SSC List is much larger than the 2L entries of S...

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
IPC IPC(8): G06F7/24H04L1/00
CPCG06F7/24H04L1/0054
Inventor 张小军隋荣全崔建明张德学曾庆田董雁飞高健张荣才张作文陈晨李俊烟晓凤
Owner SHANDONG UNIV OF SCI & 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