bp decoding method based on tanner graph edge scheduling strategy
A scheduling strategy and decoding technology, applied in the field of communication, can solve the problems of high implementation complexity and loss of bit error performance, and achieve the effects of accelerating iteration speed, improving bit error performance, and excellent bit error performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0041] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in combination with specific examples and with reference to the accompanying drawings.
[0042] The BP decoding method based on the Tanner graph edge scheduling strategy includes the following steps:
[0043]Step 1. Initialize the decoding parameters, that is, initialize the initialization message m passed from the variable node to the check node v→c =2y / σ 2 , y is the received sequence, σ 2 is the noise variance; the initialization information m passed from the check node to the variable node c→v =0; the number of edges k=0 for initializing information transfer, in the present invention, the number of edges k for transferring information is the number of edges that the variable node needs to update to the check node, and is also the number of edges that the check node passes to the variable node The number o...
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