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

Self-adaptive code length low-complexity BPL decoder

A low-complexity, decoder technology, applied in the field of adaptive code length and low-complexity BPL decoders, can solve the problems of high decoding complexity and slow response speed, so as to improve the decoding speed and reduce the decoding speed. The effect of complexity

Pending Publication Date: 2022-04-05
YANGZHOU UNIV
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

As a current research hotspot, the fifth-generation mobile communication system (5G) focuses on solving the problems of ultra-high-speed, ultra-reliable, and low-latency data transmission. These issues pose more difficult requirements for channel coding, the core module of the wireless communication physical layer. needs
In November 2016, 3GPP decided to set the short code standard of the control channel in the eMBB scenario as Polar code, but the existing decoder has high decoding complexity and slow response speed

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
  • Self-adaptive code length low-complexity BPL decoder
  • Self-adaptive code length low-complexity BPL decoder
  • Self-adaptive code length low-complexity BPL decoder

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0055] refer to Figure 1 to Figure 6 , for the first embodiment of the present invention, this embodiment provides a kind of adaptive code length low complexity BPL decoder, comprises the following steps:

[0056] S1: Input code length N, list size L and maximum number of iterations;

[0057] S2: Select the number of permutation factor graphs according to the size of the list;

[0058] S3: Decode on the factor graph after each permutation and save the decoding result. The decoding process is,

[0059] (S301) When decoding each permuted factor graph, open the storage of two matrices, L N×n+1 and R N×n+1 The initial values ​​of the elements in the matrix are all 0;

[0060] (S302) The received log likelihood ratio LLR is used as the input data on the far right in the factor graph, and is filled into the n+1th column of L, and the prior LLR of the source bits is used as the leftmost column in the factor graph Enter the data, fill in the first column of R, specifically

[0...

Embodiment 2

[0087] In order to verify and explain the technical effect adopted in this method, this embodiment simulates the code length N, K=1024,512, which is widely used in 5G, and the code rate is 0.5. The transmission channel is BPSK-AWGN channel, and iterative The number of times is 60. The simulation results in this case are as follows Figure 7 shown. It can be seen from the figure that the proposed method of the present invention has similar performance compared with the existing BP decoder.

[0088] In terms of complexity, the complexity of the proposed decoder of the present invention is much lower than that of the traditional BP decoder. Table 1 shows the lengths of four component codes and common BP decoding components in an iterative process. The complexity comparison when it is 8.

[0089] Table 1

[0090]

[0091] It is easy to see from Table 1 that and The complexity of the composition code is nearly 86% lower than that of ordinary BP decoding, and The comp...

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 self-adaptive code length low-complexity BPL decoder, which comprises the following steps of: inputting a code length N, a list size L and a maximum number of iterations; selecting the number of permutation factor graphs according to the list size; decoding is carried out on each factor graph after replacement, and a decoding result is stored; a final decoding result is determined by searching the minimum Euclidean distance; according to the invention, a proper decoder structure can be selected according to the code length, and the decoding complexity is reduced to a great extent while the BP decoding performance is improved.

Description

technical field [0001] The invention relates to the technical field of decoding of 5G polar codes, in particular to an adaptive code length low-complexity BPL decoder. Background technique [0002] Internet technology has made great progress in recent years, and the massive amount of information and data emerging has put forward higher requirements for existing communication systems. As a current research hotspot, the fifth-generation mobile communication system (5G) focuses on solving the problems of ultra-high-speed, ultra-reliable, and low-latency data transmission. These issues pose more difficult requirements for channel coding, the core module of the physical layer of wireless communication demand. The Polar code proposed in recent years originates from the channel polarization phenomenon, and is currently the only channel coding method that can reach the Shannon limit transmission. Through the joint efforts of academia and industry, the research on Polar codes has a...

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
Inventor 周玲霞张梅香
Owner YANGZHOU 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