Low-delay and high-reliability polar code fast decoding method and decoder

A fast decoding and polar code technology, which is applied in the field of communication, can solve the problems of reduced decoding delay and large decoding delay, and achieve the effect of reducing decoding delay

Active Publication Date: 2020-06-02
BEIHANG UNIV
View PDF11 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] However, the SCL decoding algorithm is a bit-by-bit serial output algorithm, so the decoding delay is relatively large. In order to reduce the time complexity of the algorithm, some scholars have made further improvements and proposed a simplified multi-bit continuous list deletion ( Simplified Multi-bit Successive Cancellation List (SMSCL)) algorithm [Han J., Liu R, Wang R. Simplified multi-bit SC list decoding for polar codes [C]. IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2016, 996 –1000.], but for a higher code rate, when there are more continuous information bits, the degree of decoding delay reduction will be greatly reduced

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-delay and high-reliability polar code fast decoding method and decoder
  • Low-delay and high-reliability polar code fast decoding method and decoder
  • Low-delay and high-reliability polar code fast decoding method and decoder

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0047] Embodiment 1: First, taking a polar code with code length N=16 and information bit length K=10 as an example, the implementation method of the improved core code word grouping of the fast multi-node SCL algorithm is described. When M=2, such as Figure 9a , 9b As shown, white circles represent frozen bits, and black circles represent information bits. Figure 9a Represents the codeword grouping result of the original multi-node SCL algorithm, Figure 9b Indicates the code word grouping result of a low-delay and high-reliability polar code fast decoding method proposed by the present invention. According to our previous explanation of the Rate-1 node, Figure 9b S in 6 That is, a Rate-1 node with a length of 4.

[0048] Down Figure 10a , 10b The comparison of polar code frame error and bit error performance under different code rates and different list numbers is given respectively. Taking 1024 code length as an example, 1 / 2( Figure 10a ), 2 / 3( Figure 10b ) tw...

Embodiment 2

[0049] Example 2: figure 2 The overall architecture diagram of the decoder is given, which mainly consists of storage unit (including channel buffer, channel LLR memory, internal LLR memory, frozen set information storage, path information storage unit), node computing unit, routing unit, Rate-1 node A processing unit, a path extension and metric calculation unit, a path pruning unit, a part and network, and a pointer storage unit are formed. The log-likelihood ratio information (LLR) received through the channel is first stored in the channel buffer (Channel Buffer), and then stored in the channel LLR memory according to the designed storage address. The routing unit (RouteUnit) is used to select from which The read data in the LLR memory is sent to the calculation module. After the node calculation is completed, the node type is judged according to the frozen set information, and then enters the path expansion and measurement value calculation module, and the path is delete...

Embodiment 3

[0057] For scenarios with low resource consumption and high performance requirements, the present invention designs another batch processing optimization architecture based on SC network serial-parallel combination, which is a polar code fast decoder based on SC network serial-parallel combination, such as Figure 6a , the architecture includes SC computing network, sorting network (to complete the expansion and pruning of paths), parts and computing units; as Figure 6b , wherein the SC computing network includes an LLR information storage module, a node computing unit, and a routing unit; further, the LLR information storage module includes a channel LLR memory and an internal LLR memory. The logarithmic likelihood ratio information (LLR) received by the decoder from the channel is first stored in the channel LLR memory, the node calculation unit completes the LLR calculation of the internal node, and the result is stored in the internal LLR memory, and the routing unit is us...

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-delay and high-reliability polar code fast decoding method and a decoder. The method comprises the following steps: step 1, regarding a node meeting a condition as a Rate-1 node according to polarization code information bit and frozen bit distribution; step 2, updating log-likelihood ratio information layer by layer according to the calculation sequence of f and g nodes of a traditional SC decoding butterfly graph; step 3, for a code block with the length of m , calculating f and g nodes to an mi layer, judging the type of the code block; if the code block is a Rate-1 node, executing step 4; otherwise, carrying out step 5; step 4, selecting a bit at a relatively unreliable position in the node to carry out path extension; step 5, performing path extension on all information bits in the code block; step 6, sorting the path metric values from small to large, and selecting L corresponding paths with the minimum path metric values for reservation; step 7, performing updating and calculating operation; and step 8, returning to step 2 until all bits are decoded. According to the methhd disclosed in the invention, decoding time delay is reduced, and a hardware platform with low logic resource consumption is proposed.

Description

technical field [0001] The invention belongs to the communication field, and in particular relates to a polar code fast decoding method and a decoder with low delay and high reliability. Background technique [0002] In 2009, E. Arikan proposed a new channel coding method - polar code, that is, polar code. Polar codes are currently the only channel coding that has been proven to achieve channel capacity. Compared with traditional LDPC codes, polar codes have lower coding and decoding complexity and better coding and decoding performance. Therefore, polar codes have great research value and practical value, and in the 3GPP meeting, polar codes have been determined as the control channel coding scheme for eMBB (enhanced mobile broadband) scenarios in 5G. It can be seen that the application prospect of polar codes is very broad and has the potential for further research. [0003] Since the polar code was proposed in 2009, many scholars at home and abroad have carried out rese...

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): H03M13/25
CPCH03M13/25
Inventor刘荣科董心洁
OwnerBEIHANG UNIV