A Deep Learning Channel Decoding Method Based on Alternating Direction Multiplier Method
A technology of alternating direction multipliers and channel decoding, applied in the field of deep learning channel decoding, can solve problems such as low error correction performance and high computational complexity, and achieve the effect of easy training
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0076] Consider the transmission signal on the additive Gaussian channel, the considered code pattern is [96,48]MacKay96.33.964 LDPC code and [128,64]CCSDS LDPC code A deep learning channel decoding method based on the alternating direction multiplier method proposed for this system includes the following steps:
[0077] 1) Construct the maximum likelihood optimization problem based on channel decoding. Each codeword of the considered LDPC code is specified by an M×N parity-check matrix H. and Represent the variable node and check node of the codeword respectively, d j Indicates the degree corresponding to the jth check node. is the transmitted codeword, and y is the received signal. The maximum likelihood decoding problem is expressed in the following form:
[0078]
[0079] in,[·] 2 Indicates modulo 2 operation, For the log-likelihood ratio, each element of v is defined as:
[0080]
[0081] Among them, Pr(·) represents the conditional probability.
[0...
Embodiment 2
[0132] Consider the transmission signal on the additive Gaussian channel, the considered code pattern is [96,48]MacKay96.33.964 LDPC code and [128,64]CCSDS LDPC code A deep learning channel decoding method based on the alternating direction multiplier method proposed for this system includes the following steps:
[0133] 1) Construct the maximum likelihood optimization problem based on channel decoding. Each codeword of the considered LDPC code is specified by an M×N parity-check matrix H. and Represent the variable node and check node of the codeword respectively, d j Indicates the degree corresponding to the jth check node. is the transmitted codeword, and y is the received signal. The maximum likelihood decoding problem is expressed in the following form:
[0134]
[0135] in,[·] 2 Indicates modulo 2 operation, For the log-likelihood ratio, each element of v is defined as:
[0136]
[0137] Among them, Pr(·) represents the conditional probability.
[0...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


