.png){kind=icon}
.png){kind=icon}
Return
Gradient Flow Decoding
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2025.3592296.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents the Gradient Flow (GF) decoding for LDPC codes. GF decoding, a continuous-time methodology based on gradient flow, employs a potential energy function associated with bipolar codewords of LDPC codes. The decoding process of the GF decoding is concisely defined by an ordinary differential equation and thus it is well suited to an analog circuit implementation. We experimentally demonstrate that the decoding performance of the GF decoding for AWGN channels is comparable to that of the multi-bit mode gradient descent bit flipping algorithm. We further introduce the negative log-likelihood function of the channel for generalizing the GF decoding. The proposed method is shown to be tensor-computable, which means that the gradient of the objective function can be evaluated with the combination of basic tensor computations. This characteristic is well-suited to emerging AI accelerators, potentially applicable in wireless signal processing. The paper assesses the decoding performance of the generalized GF decoding in LDPC-coded MIMO channels. For LDPC-coded MIMO channels, our method achieves approximately 1.6 dB performance gain over MMSE + BP. Furthermore, an exploration of score-based channel learning for capturing statistical properties is also provided.
Keywords:
LDPC codes
ordinary differential equations
gradient descent
tensor computation
MIMO channel
MIMO detection