Method for generating Gold sequence and chip
A sequence and chip technology, applied in the field of communication network, can solve the problem of low computing efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0050] An embodiment of the present invention provides a method for generating a Gold sequence, the execution subject of the method may be a Gold sequence generator, such as figure 1 As shown, the method includes:
[0051] Step 101, respectively initializing the first shift register and the second shift register, and determining the tap positions of the first shift register and the second shift register;
[0052] Optionally, according to a preset generator polynomial, respectively determine tap positions of the first shift register and the second shift register;
[0053] Wherein, the tap position refers to the position where the bit sequence is extracted in the first shift register and the second shift register. The preset generator polynomial is a vector generator polynomial converted from a scalar Gold generator polynomial. Here, the scalar Gold generator polynomial is the polynomial used by the generator polynomial in the prior art.
[0054] Step 102, extracting the firs...
Embodiment 2
[0089]An embodiment of the present invention provides a method for generating a Gold sequence, such as image 3 As shown, the method includes:
[0090] Step 301, respectively initializing the first shift register X1 of L bits and the second shift register X2 of L bits;
[0091] Wherein, L is the constraint length of the generator polynomial, and in this embodiment, L may be 31.
[0092] In this step, the shift registers can be initialized with their respective initial phases:
[0093] The initial value of the first shift register X1 is a constant, that is, according to x 1 (0)=1,x 1 (n)=0, wherein, n=1, 2, 3, ..., 30, initialize the first shift register X1;
[0094] The initial value of the second shift register X2 is according to get where, c init Indicates the initial value, i=0, 1, 2, L 30, initializes the second shift register X2.
[0095] Step 302, determining the tap positions of the first shift register X1 and the second shift register X2;
[0096] In this step...
Embodiment 3
[0170] An embodiment of the present invention provides a chip for generating a Gold sequence, which can be used in a mobile terminal, such as Figure 7 As shown, the chip includes: a first shift register 701, a second shift register 702, a processor 703, a temporary register 704, a vector exclusive OR 705, a temporary register 706, a vector exclusive OR 707, a temporary register 708, vector exclusive OR device 709, temporary register 710, gating switch 711;
[0171] The first shift register 701 and the second shift register 702 are respectively used to store L bit sequences, where L is the constraint length of the generator polynomial, and in this embodiment, L may be 31. Initially, the processor 703 can use respective initial values to initialize the shift register:
[0172] The initial value of the first shift register X1 is a constant, that is, according to x1 (0)=1,x 1 (n)=0, wherein, n=1, 2, 3, ..., 30, initialize the first shift register X1;
[0173] The initial val...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com
