Finite geometric code decoding method and system based on generalized check matrix

By constructing a generalized parity-check matrix for multi-step large number logic iterative decoding, the problem of short-loop effects in iterative decoding of finite geometric codes is solved, thus improving decoding performance, especially showing significant decoding gain in the high signal-to-noise ratio region.

CN120880462APending Publication Date: 2025-10-31THE 20TH RESEARCH INSTITUTE OF CHINA ELECTRONICS TECHNOLOGY GROUP CORP
0 Cites 2 Cited by

Patent Information

Application Number
CN202510793326.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-06-13
Publication Date
2025-10-31

AI Technical Summary

Technical Problem

Existing finite geometric codes exhibit poor performance during iterative decoding due to the influence of short loops, especially in the high signal-to-noise ratio region where the error rate curve slope changes abruptly, leading to a decline in decoding performance.

Method used

A generalized parity-check matrix based on an algebraic structure is constructed. By calculating the log-likelihood ratio information at the receiver, multi-step large number logic iterative decoding is performed to reduce the impact of short loops and improve decoding performance.

Benefits of technology

It significantly improves the iterative decoding performance of multi-step large number logic translatable finite geometric codes, especially showing a decoding performance gain of 0.2-0.5dB in the high signal-to-noise ratio region.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The invention discloses a finite geometric code decoding method and system based on a generalized check matrix, and relates to the communication technology, and the method comprises the following steps: constructing a corresponding generalized check matrix according to an algebraic structure of a multi-step large number logic decodable finite geometric code; sending a finite geometric code sequence, transmitting the sequence after coding and BPSK modulation, and receiving a posterior probability log-likelihood ratio sequence by a receiving end; and carrying out iterative decoding on the finite geometric code received by the receiving end based on the constructed generalized check matrix. According to the invention, a new generalized check matrix is constructed according to the algebraic structure of the finite geometric code, and multi-step large-number logic iterative decoding is carried out on the finite geometric code based on the matrix, so that the iterative decoding performance of the multi-step large-number logic decodable finite geometric code is improved.
Need to check novelty before this filing date? Find Prior Art