Multi-address encode method for packet time, space and frequency
A block coding and multi-address code technology, which is applied in the direction of code division multiplexing system, multiplexing code distribution, multiplexing communication, etc., can solve problems such as limited effect and unsatisfactory inter-correlation characteristics of address codes, and achieve The effect of solving complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment approach
[0115] The basic coding steps of the present invention are as follows:
[0116] step one:
[0117] Selection of Basic perfect complementary orthogonal code pairs mate.
[0118] This step can be subdivided as follows:
[0119] 1) Determine the length N of the basic perfect orthogonal complementary code pair according to the required width of the "zero correlation window" and the number of codes in the code group.
[0120] 2) According to the relationship
[0121] N=N 0 ×2 l ; l = 0, 1, 2, ..
[0122] First determine the length N of a shortest basic perfect complementary code (the shortest perfect complementary code) 0 . For example, if N=12 is required, then N 0 =3, l=2.
[0123] 3) or by relation
[0124] N=N 01 ×N 02 ×2 l+1 ; l = 0, 1, 2, ...
[0125] First determine the length N of the two shortest basic perfect complementary codes 01 , N 02 . For example, if N=30 is required, then N 01 =3, N 02 =5(l=0).
[0126] 4) According to the shortest code length d...
example 1
[0134] Example 1: If Here + stands for +1; - stands for -1, possible There are many solutions, such as: +0+;-0-;+j+;+-j+;-j-;--j- and so on.
example 2
[0135] Example 2: If possible solution
[0136] etc., where a is any number not equal to +1 or -1.
[0137] Example 3: If A solution for is 1, 4, 0, 0, -1, etc.
[0138] If primary Incorrect value, then may be unsolved; sometimes despite There is a solution, but it is not convenient for engineering application. At this time, it needs to be readjusted the value of , until we have and values are satisfied.
[0139] 6) If 3), because there are two shortest lengths N 01 , N 02 , then repeat 4)5) to solve two pairs and
[0140] in
[0141]
[0142] And according to the following rules, the length is 2N 01 ×N 02 The perfect complementary code pair of in
[0143]
[0144]
[0145]
[0146]
[0147]
[0148] They are both 2N in length 01 ×N 02 .
[0149] Mathematically written as:
[0150]
[0151] in the formula Represents the Kroneckzer product; · Represents a reverse sequence; Represents a non-sequence, th...
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