SC-BP hybrid decoding method for polar code and adjustable hardware architecture thereof

Abstract

The invention discloses an SC-BP hybrid decoding method for a polar code and an adjustable hardware architecture thereof, comprising the following steps of: processing the channel log-likelihood ratioof an input through a k-order SC decoder to obtain the input log-likelihood ratio of a BP decoder; iterating the input to obtain an output of the BP decoder, wherein the k is a decomposition factor of a hybrid decoder; encoding and returning the output to the SC decoder as a returned value of the SC decoder; and performing the next decoding operation according to the returned value by the SC decoder. The SC-BP hybrid decoding method for a polar code integrates the SC decoder algorithm and the BP decoder algorithm into an SC-BP hybrid decoding unit and adds the pre-computing technology, so that under the effects of an SC encoding feedback architecture and an hybrid decoding systolic architecture, the time delay and the performance of the decoding can be rounded between the effects of the SC and the BP algorithms, the decoder can adapt to multiple communication requirements, and the market application prospect is excellent.

Description

technical field [0001] The invention belongs to the technical field of wireless communication, and in particular relates to a polar code SC-BP hybrid decoding method and an adjustable hardware architecture design structure thereof. Background technique [0002] Polar code E. Arikan proposed a channel coding scheme based on the idea of ​​channel polarization in 2009, and theoretically proved that under the binary discrete memoryless channel (B-DMC), its code rate can reach Shannon The proposed channel capacity [1]. In the discussion on the 5G short code scheme at the 3GPP meeting in 2016, the polar code scheme became the coding scheme of the control channel in the 5G eMBB scenario. Therefore, there are significant theoretical and practical researches on the polar code encoding and decoding algorithm and its implementation. value. [0003] In the decoding scheme of polar codes, there are two mainstream schemes, one is the continuous elimination (SC) decoding algorithm, and t...

AI Technical Summary

Problems solved by technology

[0003] In the decoding scheme of polar codes, there are two mainstream schemes, one is the continuous elimination (SC) decoding algorithm, and the other is the belief propagation (BP) decoding algorithm. For these two algorithms, SC decoding often has better decoding performance, but due to the serial characteristics of SC decoding itself, there is a high decoding delay. For polar codes with code length N, the decoding of traditional SC decoders The delay is 2N-1, and the delay of the SC decoder using the pre-computation node is N-1, which still has a high delay

Due to its parallelism, the BP algorithm has a low delay. The delay of the BP algorithm using the systolic architecture is 2(itr-1)+log 2 N, where, itr is the number of iterations used by the BP decoding algorithm, but the performance is slightly inferior to the SC algorithm

Images