Minimum sum decoding method of selective annealing of low density parity check code
A low-density parity, selective annealing technology, applied in the decoding field of channel error correction coding, which can solve the problems of robust channel estimation parameters, poor performance, and high complexity of the sum-product algorithm
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0049] The selective annealing minimum-sum decoding method of the present invention uses the variable node to merge the external information flowing into the check node and the information from the channel as the judgment soft information of this iteration, to test whether the judgment sequence satisfies the check equation, write down or update the check If the serial number set of the unsuccessful check node is empty, the decoding ends; if the serial number set of the unsuccessful check node is not empty, the check node sends the variable The node updates the output information, and multiplies the output information of the verification node whose verification is unsuccessful by a factor less than 1 for annealing processing, and transfers to the next iterative decoding.
[0050] The specific steps are as follows:
[0051] Step 1: Initialize the symbol variable s of the check node m = 1, sign k (c m )=1, the minimum min k (c m )=100 and sub-min k (c m )=100.
[0052] St...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com