Continuous elimination list decoding method of software polarization code

Abstract

The invention discloses a continuous elimination list decoding method of a software polarization code. Through establishment of a reference matrix and combination with the position of a current decoding bit, an upper bound and a lower bound of a phase needing to be copied are positioned; and the upper bound and the lower bound are mapped to a memory, only values between the two bounds are copied, and thus the quantity of copy operation is reduced. Compared to a conventional decoding technology, the method has the following advantages: under the condition that the decoding performance is not affected, the same data is prevented from being copied when a path is updated, the path updating time delay is substantially reduced, and the decoding throughput is improved; after the current bit is decoded, the reference matrix is updated; and the decoding method provided by the invention has universality and can be applied to different polarization code lengths, code rates and path numbers.

Description

technical field [0001] The invention belongs to the technical field of wireless communication, and in particular relates to a continuous elimination list decoding method of a software polar code, which is mainly applied to channel error correction coding. Background technique [0002] Since the 1980s, wireless communication technology has developed rapidly and has become a hot technology with the greatest development potential and the broadest market prospect in the field of communication today. Mobile communication has experienced the development of the first generation of analog communication (1G), the second generation of cellular digital communication (2G), and the third generation of CDMA broadband communication (3G), and has now entered the industrialization of the fourth generation of mobile communication (4G) application stage. Mobile communication is developing towards high speed, high capacity, high spectral efficiency and low power consumption, and continuously m...

AI Technical Summary

Problems solved by technology

However, the complexity of path metric (PM) comparison and path update increases dramatically as L increases

In the existing software polar code decoder, although the lazy copy is used, the complexity of path update is greatly reduced

However, when copying data, the data of all stages are copied and updated. For stages with the same value, it causes a waste of time and greatly affects the decoding speed.

Images