Low-complexity IMP PN code capturing method based on sum-product algorithm
A code capture and algorithm technology, applied in the field of PN code capture, can solve problems such as lack of theoretical basis and high complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0043]Take the polynomial as g(D)=1+D+D 15 Taking the PN code as an example, the length of the received data is M=512, and the number of iterations of the sum-product decoding is I=100. Then r=15, according to figure 2 The given process can complete the capture of the PN code. The following is an example to analyze the capture performance and complexity of the method proposed in this paper.
[0044] In order to facilitate the comparison of the superiority of this method, the original IMP pseudo-code capture algorithm is first given the method of selecting the initial state and related verification. That is: count the frequency of each column element in A in this column, select the element with the highest frequency in all columns and record its frequency, and then select the element with the highest frequency as the initial state of the m sequence, and record its column Coordinates (representing the position of this initial state in the m-sequence). According to the ini...
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