CN108234058B - A kind of building method of stringent related constraint light orthogonal code - Google Patents
A kind of building method of stringent related constraint light orthogonal code Download PDFInfo
- Publication number
- CN108234058B CN108234058B CN201711465941.2A CN201711465941A CN108234058B CN 108234058 B CN108234058 B CN 108234058B CN 201711465941 A CN201711465941 A CN 201711465941A CN 108234058 B CN108234058 B CN 108234058B
- Authority
- CN
- China
- Prior art keywords
- numbers
- code
- ordered series
- light orthogonal
- battle array
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J14/00—Optical multiplex systems
- H04J14/005—Optical Code Multiplex
- H04J14/007—Orthogonal Optical Code Multiplex
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/10—Code generation
- H04J13/12—Generation of orthogonal codes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Optical Communication System (AREA)
Abstract
The invention discloses a kind of building methods of stringent related constraint light orthogonal code, comprising the following steps: number of codewords n and code weight w construction the integer ordered series of numbers M constructed as needed；It is fetched from the integer ordered series of numbers M according to predetermined access rule, constructs the mark gap of stringent related constraint light orthogonal code code word from triangle battle array D；The integer ordered series of numbers M according to the mark gap from triangle battle array D and completion of having fetched optimizes code length F according to the predetermined principle of optimality；, from the mapping relations that triangle battle array D is constituted, stringent related constraint light orthogonal code code word is constructed according to by the mark gap.Stringent related constraint light orthogonal code code word is constructed by construction mark gap from triangle battle array and according to mapping relations, the stringent related constraint light orthogonal code number of codewords that can effectively construct is more, code tuple value is big；Any code weight, any number of stringent related constraint light orthogonal code code word can be constructed；Optimize code length by the predetermined principle of optimality, code efficiency is high.
Description
Technical field
The present invention relates to field of communication technology more particularly to a kind of building methods of stringent related constraint light orthogonal code.
Background technique
21 century is one using network as the epoch of core, and demand of the people to information is growing day by day.Except generic telecommunication industry
Business is outer, and the broadband services such as high-definition television, video on demand also have very big demand.The above business require a kind of broadband,
In real time, multiple services network can be supported.Optical code division multiple access technique has asynchronous access, can make full use of bandwidth of an optical fiber, agreement
Simply, support a large number of users using different rates and can guarantee service quality (Quality of Service, QoS), no matter
Backbone network still in the access net for being referred to as " first kilometer ", all has broad application prospects, and has stronger competitiveness.
The key technology of optical code division multiple access first is that address code construct.It is to realize multiuser asynchronous access, support difference
Business, offer different QoS reduce multi-user interference, raising network efficiency and reliability, increase safety and realize synchronization
Important technology.In incoherent light CDMA address code, light orthogonal code (the Optical Orthogonal of stringent related constraint
Codes, OOC) it is considered as the optimal address code of characteristic.At present the main bottleneck of optical code division multiple access technique first is that any ginseng
The big address code construction of number, cardinality.
For the building method research of stringent related constraint light orthogonal code, although domestic and foreign scholars propose some good think ofs
Think, but all without solving above-mentioned bottleneck problem.Li Qi is based on present invention applicant 2004 in the opinion delivered on " Chinese laser "
Text proposes a kind of stringent best (F, W, 1) OOC building method based on O-plus matrix.O-plus square used by author
The constituted integer set in interval between one-dimensional OOC mark and its adjacent adduction is substantially expressed as matrix form by battle array；Specially with this
It is to be provided with initial value in place of the paper different from that sharp applicant is delivered, realizing yard weight is that 3, code length is respectively
19, the coding of 25,31,37 best OOC.Jiang, Jing have studied the best OOC that yard weight is 4 and construct, complete based on (g, 4,1)
Standby difference race constructs ((g+1) v, 4,1), ((g+2) v, 4,1), ((g+7) v, 4,1 best OOC.Author presents detailed mathematics
Derivation process, but corresponding simulation result is not provided, i.e., no corresponding codeword set proves the feasibility of this method.
Momihara, Koji have studied the construction of (n, 4,2,1) best OOC, and code length is less than 100 prime number and a specific integer
It is multiplied.Author proves its existence, but does not provide the codeword set and number of codewords compiled out equally.
Nasaruddin, T.Tsujioka have studied the building method for becoming weight light orthogonal code, and the light orthogonal code code length constructed is maximum
The 2 of mark interval extraordinarily 1, for the utilization rate of chip, code efficiency is not high.
From the studies above work it can be found that current OOC is studied, there is following common problems: 1, the research of scholar is main
Concentrate on the construction algorithm research of best OOC, it is intended to obtain more number of codewords on best from realizing.But in fact, not being
All there is optimum optical orthogonal code in any parameter；2, building method locality can only be constructed, no for certain yard heavy of OOC
The light orthogonal code for constructing any code weight, number of codewords can be expanded to.These construction algorithms are generally all in view of the complexity of light orthogonal code
Property and feasibility mathematically and parameter is limited to some special numbers, as code weight is in the majority with 3,4,5.Since code weight is inclined
It is small, cause the number of codewords of construction less, method does not have practicability；3, research excessively theorizes, and is only limited to theoretical and mathematics
The exploration of aspect cannot provide practical, feasible code construction method；Code word set based on proposed algorithm construction is not provided
It closes, can not prove convergence, validity and practical feasibility；4, code efficiency is not high.
Summary of the invention
The technical problem to be solved in the present invention is that the technology for relative configurations light orthogonal code cannot expand to construction times
One yard of weight and the light orthogonal code of number of codewords, building method do not have practicability and the low problem of code efficiency, provide a kind of tight
The building method of lattice related constraint light orthogonal code.
The present invention is that technical solution used by solving its technical problem is: providing a kind of stringent related constraint light orthogonal code
Building method, comprising the following steps:
S1. number of codewords n and code weight w construction the integer ordered series of numbers M constructed as needed；
S2. it is fetched from the integer ordered series of numbers M according to predetermined access rule, constructs stringent related constraint light orthogonal code code word
Mark gap from triangle battle array D；
S3. the integer ordered series of numbers M according to the mark gap from triangle battle array D and completion of having fetched, according to predetermined optimization
Rule optimization code length F；
S4., from the mapping relations that triangle battle array D is constituted, stringent related constraint light orthogonal code is constructed according to by the mark gap
Code word.
Preferably, in the building method of stringent related constraint light orthogonal code of the present invention, the step S1 is into one
Step includes:
The integer ordered series of numbers M is constructed according to formula F >=nw (w-1)+1, M is the integer that nw (w-1)+1 is incremented to since 1
Ordered series of numbers, F are code length, and n is the number of codewords for needing to construct, and w is the code weight for needing the code word constructed.
Preferably, in the building method of stringent related constraint light orthogonal code of the present invention, the step S2 is into one
Step includes:
S2-1. the number of codewords n constructed as needed, n mark gaps of building are from triangle battle array D1,D2,…,Dn；
S2-2. it fetches from the integer ordered series of numbers M by sequence from small to large, is followed successively by the mark gap from triangle battle array
D1,D2,…,DnFirst element number completion of the first row often takes a number away in the integer ordered series of numbers M, in the integer ordered series of numbers
The filling mark gap can no longer be used from triangle battle array D in corresponding position filling 0 in M, the number being removed1,D2,…,Dn
In；
S2-3. it fetches from the integer ordered series of numbers M by sequence from small to large, is followed successively by the mark gap from triangle battle array
D1,D2,…,DnSecond element number completion of the first row, often fills out a number, calculates the sum of the first two number, and from the integer ordered series of numbers
Take the corresponding position that the number fills out triangle battle array next line in M away, the number scale taken away is 0, and so on, until the mark gap
From triangle battle array D1,D2,…,DnIn all elements be filled number.
Preferably, in the building method of stringent related constraint light orthogonal code of the present invention, the step S2 is also wrapped
It includes:
If S2-4. fetching the filling mark gap from the integer ordered series of numbers M from triangle battle array by sequence from small to large
D1,D2,…,DnDuring, the number for occurring inserting it is adjacent plus after data number completion word is identical with front element, then change described in
Next the smallest number filling in integer ordered series of numbers M, until different from the number that front element is inserted.
Preferably, in the building method of stringent related constraint light orthogonal code of the present invention, the step S3 is into one
Step includes:
S3-1.. d is enabledmaxIt indicates maximum value of the mark gap from element in triangle battle array D, enables lmaxMost for element in all D
Big value, just determines code length F1=2lmax+1；
S3-2. the integer ordered series of numbers M that length is nw (w-1)+1 after the step S2 length is punctured into be equal to
lmaxInteger ordered series of numbers N, access column N opposite sequence obtain ordered series of numbers S.
Preferably, in the building method of stringent related constraint light orthogonal code of the present invention, the step S3 is also wrapped
It includes:
S3-3. by first of the ordered series of numbers S and max { first non-zero position digital, the nw (w-1) of the ordered series of numbers N
+1-lmaxThe non-zero aligned in position that starts of position, start to have checked whether the collision of " 0 " mark, by the ordered series of numbers N to Forward if having
It is dynamic, allow max { first non-zero position digital, nw (w-1)+1-l of the ordered series of numbers S and the ordered series of numbers NmaxBehind position recently
Non-zero flag position alignment, checked whether again " 0 " mark collision, and so on, until do not have " 0 " mark collision, at this time
The position number of the corresponding ordered series of numbers N of the ordered series of numbers S first is denoted as p, then the code length F=l after optimizingmax+p。
Preferably, in the building method of stringent related constraint light orthogonal code of the present invention, the step S3 is also wrapped
It includes:
Code efficiency before and after calculation optimization, the code efficiency after optimization areBefore optimization
Code efficiency be
Preferably, in the building method of stringent related constraint light orthogonal code of the present invention, the step S4 is into one
Step includes:
According to X={ p0, p1..., pw-1}={ 0, t1,t2+t2,…,t1+t2+…+ti,…,t1+t2+…+ti…+tw-1Reflect
Relationship is penetrated, stringent related constraint light orthogonal code code word is constructed, wherein { p0,p1,…,pw-1It is code word, first pulse is fixed on
0th position of the code word, { 0, t1,t1+t2,…,t1+t2+…+ti,…,t1+t2+…+ti…+tw-1In in addition to O
Other elements are element of the mark gap from first row in triangle battle array D, indicate other pulsion phases to p0Position.
Preferably, in the building method of stringent related constraint light orthogonal code of the present invention, the formula F >=nw
(w-1)+1 is by formulaIt derives.
Preferably, described just to determine code length F in the building method of stringent related constraint light orthogonal code of the present invention1
=2lmax+ 1 is by formulaAnd formulaIt derives.
Stringent related constraint light orthogonal code code word is constructed by construction mark gap from triangle battle array and according to mapping relations, it can
It is more with the stringent related constraint light orthogonal code number of codewords effectively constructed, code tuple value is big；It is heavy, any that any code can be constructed
The stringent related constraint light orthogonal code code word of quantity；Optimize code length by the predetermined principle of optimality, code efficiency is high；The building method
Desin speed is fast, and the stringent related constraint light orthogonal code that such as 500 code weights of construction are 10, build time only needs a few tens of milliseconds, and
And it is simple, practical, feasible；Parameter is not constrained, qualified relation.The present invention solves optical code division multiple access address code for a long time
Difficult problem is constructed, the stringent related constraint light orthogonal code constructed can be used as the address of light code division multiple access communicating system
Code is applied in optical access network, passive optical network, light code labeling exchange network, light detection network, fiber optic sensor network, light
Core router, light edge router and radio optical communication system and network etc..
Detailed description of the invention
Present invention will be further explained below with reference to the attached drawings and examples, in attached drawing:
Fig. 1 is the flow chart of the building method of the stringent related constraint light orthogonal code of the present invention.
Specific embodiment
For a clearer understanding of the technical characteristics, objects and effects of the present invention, now control attached drawing is described in detail
A specific embodiment of the invention.
Fig. 1 is the flow chart of the building method of the stringent related constraint light orthogonal code of the present invention, as shown in Figure 1:
The building method of the stringent related constraint light orthogonal code of the present invention, comprising the following steps:
S1. number of codewords n and code weight w construction the integer ordered series of numbers M constructed as needed；
S2. it is fetched from integer ordered series of numbers M according to predetermined access rule, constructs the biography of stringent related constraint light orthogonal code code word
Number gap is from triangle battle array D；
S3. the integer ordered series of numbers M according to mark gap from triangle battle array D and completion of having fetched optimizes according to the predetermined principle of optimality
Code length F；
S4., from the mapping relations that triangle battle array D is constituted, stringent related constraint light orthogonal code code is constructed according to by mark gap
Word.
In the building method of the stringent related constraint light orthogonal code of the present invention, step S1 further comprises:
Integer ordered series of numbers M is constructed according to formula F >=nw (w-1)+1, M is the integer number that nw (w-1)+1 is incremented to since 1
Column, F are code length, and n is the number of codewords for needing to construct, and w is the code weight for needing the code word constructed.
Specifically, in step sl, enabling n is number of codewords, and F is the code length of light orthogonal code, and w is code weight, λaFor auto-correlation
Constraint, λcFor interrelational constraint, light orthogonal code is expressed as (F, w, λa,λc), the λ of stringent related constraint light orthogonal codea=λc=1,
It is expressed as (F, w, 1) light orthogonal code.M is the integer ordered series of numbers that nw (w-1)+1 is incremented to since 1, according to formula F >=nw (w-1)+
1 can construct integer ordered series of numbers M be 1,2 ..., i ..., nw (w-1)+1.
In the building method of the stringent related constraint light orthogonal code of the present invention, step S2 further comprises:
S2-1. the number of codewords n constructed as needed constructs n mark gap from triangle battle array D1,D2,…,Dn；
S2-2. it fetches from integer ordered series of numbers M by sequence from small to large, is followed successively by mark gap from triangle battle array D1,D2,…,
DnFirst element number completion of the first row, often takes a number away in integer ordered series of numbers M, and the corresponding position in integer ordered series of numbers M is filled out
Enter 0, filling mark gap can no longer be used from triangle battle array D in the number being removed1,D2,…,DnIn；
S2-3. it fetches from integer ordered series of numbers M by sequence from small to large, is followed successively by mark gap from triangle battle array D1,D2,…,
DnSecond element number completion of the first row often fills out a number, calculates the sum of the first two number, and takes the number away from integer ordered series of numbers M
The corresponding position for filling out triangle battle array next line, the number scale taken away are 0, and so on, until mark gap is from triangle battle array D1,
D2,…,DnIn all elements be filled number.
In the building method of the stringent related constraint light orthogonal code of the present invention, step S2 further include:
If S2-4. fetching the filling mark gap from integer ordered series of numbers M from triangle battle array D by sequence from small to large1,
D2,…,DnDuring, the number for occurring inserting it is adjacent plus after data number completion word is identical with front element, then change integer ordered series of numbers
Next the smallest number filling in M, until different from the number that front element is inserted.
Specifically, in step s 2, X={ x is enabled0x1…xn-1Be (F, w, 1) stringent related constraint light orthogonal code expression
Mode, mark position representation are X={ p0,p1,…,pw-1}.Enable dx=[t1,t2,…,ti,…,tw-1] it is light orthogonal code
The adjacent non-zero pulses gap of code word from representation, i.e., mark gap is from form, ti(i ∈ [1, w-1]) indicates two neighboring
The distance of marker pulse.Enable the mark gap that D is stringent related constraint light orthogonal code from triangle battle array, all elements in D are not
It is identical.
1, the number of codewords n for needing to construct, code weight w are first determined, then constructs a mark gap from triangle battle array D1,D2,…,
Dn；
2, it fetches from integer ordered series of numbers M by sequence from small to large, is followed successively by mark gap from triangle battle array D1,D2,…,Dn
First element number completion of the first row, often takes a number away in integer ordered series of numbers M, the corresponding position filling in integer ordered series of numbers M
0, filling mark gap can no longer be used from triangle battle array D in the number being removed1,D2,…,DnIn, the number of all filling will
Difference to guarantee that auto-correlation constrains and interrelational constraint is all 1, and then constructs stringent related constraint light orthogonal code code word；
3, it fetches from integer ordered series of numbers M by sequence from small to large, is followed successively by mark gap from triangle battle array D1,DF,…,Dn
Second element number completion of the first row often fills out a number, calculates the sum of the first two number, and takes the number away from integer ordered series of numbers M and fill out
To the corresponding position of triangle battle array next line, the number scale taken away is 0, and so on, until mark gap is from triangle battle array D1,D2,…,
DnIn all elements be filled number；
If 4, fetching the filling mark gap from integer ordered series of numbers M from triangle battle array D by sequence from small to large1,D2,…,
DnDuring, the number for occurring inserting it is adjacent plus after number number completion word is identical with front element, then under changing in integer ordered series of numbers M
One the smallest number filling, until different from the number that front element is inserted.
In the building method of the stringent related constraint light orthogonal code of the present invention, step S3 further comprises:
S3-1. d is enabledmaxIt indicates maximum value of the mark gap from element in triangle battle array D, enables lmaxMost for element in all D
Big value, just determines code length F1=2lmax+1；
S3-2. the integer ordered series of numbers M that length is nw (w-1)+1 after step S2 is punctured into length equal to lnaxInteger
The opposite sequence of ordered series of numbers N, access column N obtain ordered series of numbers S.
In the building method of the stringent related constraint light orthogonal code of the present invention, step S3 further include:
S3-3. by first of ordered series of numbers S and max { first non-zero position digital, nw (w-1)+1-l of ordered series of numbers Nmax}
The non-zero aligned in position that position starts starts to have checked whether the collision of " 0 " mark, moves forward ordered series of numbers N if having, and allows ordered series of numbers S
Max { first non-zero position digital, nw (w-1)+1-l of ordered series of numbers NmaxNon-zero flag position alignment nearest behind position, again
Check whether the collision of " 0 " mark, and so on, it is collided until there is no " 0 " to indicate, at this time ordered series of numbers S first corresponding ordered series of numbers N
Position number be denoted as p, then optimize after code length F=lmax+p。
In the building method of the stringent related constraint light orthogonal code of the present invention, step S3 further include:
Code efficiency before and after calculation optimization, the code efficiency after optimization areBefore optimization
Code efficiency be
In the building method of the stringent related constraint light orthogonal code of the present invention, formula F >=nw (w-1)+1 is by formulaIt derives.
In the building method of the stringent related constraint light orthogonal code of the present invention, code length F is just determined1=2lmax+ 1 is by formulaAnd formulaIt derives.
Specifically, d is enabledmax=max { t1,t2,…,ti,…,tw-1,t1+t2,…,t,1+t2+…+tw-1Indicate mark gap
Maximum value from element in triangle battle array D, enables lmaxFor D1,D2,…,DnThe maximum value of middle all elements, enabling initial code length is F1=
2lmax+ 1, enabling N is that ordered series of numbers M is punctured into length equal to lmaxWhen ordered series of numbers, enable ordered series of numbers S be ordered series of numbers N inversion sequence, enable ordered series of numbers S with
When ordered series of numbers N identifies collision without any " 0 ", the minimum position serial number of ordered series of numbers S first corresponding ordered series of numbers N is denoted as p, enablesFor code efficiency.
1, selection mark gap is from triangle battle array D1,D2,…,DnIn maximum element be lmax, just determining code length is F1=2lmax+
1.The first derivation process for determining code length formula are as follows: by formulaF >=nw (w-1)+1, and each mark gap
It is shared from triangle battle array DA element, thereforeIt is shared from triangle battle array D for n mark gapA element, thereforeIn order to compile out n code word, and the auto-correlation in order to guarantee each code word
Constraint and interrelational constraint are strictly all 1, element of the mark gap from triangle battle array D of all code words and remaining other elements F-
D cannot be identical, therefore takes and just determine code length F1=2lmax+1；
2, the integer ordered series of numbers M that length is nw (w-1)+1 after step S2 is punctured into length equal to lmaxInteger ordered series of numbers
N takes the opposite sequence of N to obtain sequence S；
3, by first of S ordered series of numbers and max { first non-zero position digital, nw (w-1)+1-l of ordered series of numbers NmaxPosition opens
The nonzero digit of beginning is aligned, and is started to have checked whether the collision of " 0 " mark, is moved forward ordered series of numbers N if having, and allows the first of ordered series of numbers S
Max { first non-zero position digital, nw (w-1)+1-l of position and ordered series of numbers NmaxNon-zero flag position alignment nearest behind position,
The collision of " 0 " mark has been checked whether again, and so on, it is collided until there is no " 0 " to indicate, at this time first corresponding N of S ordered series of numbers
The position number of ordered series of numbers is denoted as, then the code length F=l after optimizingmax+p。
4, the code efficiency before and after calculation optimization, the code efficiency after optimization areOptimization
Preceding code efficiency isCalculation code efficiency raising amount.
In the building method of the stringent related constraint light orthogonal code of the present invention, step S4 further comprises:
According to X={ p0,p1,…,pw-1}={ 0, t1,t1+t2,…,t1+t2+…+ti,…,t1+t2+…+ti…+tw-1Reflect
Relationship is penetrated, stringent related constraint light orthogonal code code word is constructed, wherein { p0,p1,…,pw-1It is code word, first pulse is fixed on
0th position of code word, { 0, t1,t1+t2,…,t1+t2+…+ti,…,t1+t2+…+ti…+tw-1In other in addition to O
Element is element of the mark gap from first row in triangle battle array D, indicates other pulsion phases to p0Position.
In a specific embodiment of the invention, specific configuration is as follows:
Construct respectively stringent related constraint light orthogonal code code word and the 5 code weights that 5 code weights are 5 be 4 it is stringent it is related about
The light orthogonal code of beam light orthogonal code code word, two kinds of different code weights can be constructed once.
In step sl, when constructing the stringent related constraint light orthogonal code code word that 5 code weights are 5, according to formula F >=nw
(w-1)+1 generation nw (w-1)+1=5*5 (5-1)+1=101 is incremented to 101 integer since 1, constitutes ordered series of numbers M；Construction 5
When the stringent related constraint light orthogonal code code word that a yard of weight is 4, generation 61 is incremented to 61 integer since 1, constitutes ordered series of numbers
M, ordered series of numbers M are expressed as follows:
In step s 2,5 mark gaps are constructed from triangle battle array D1,D2,D3,D4,D5；
1, it fetches from integer ordered series of numbers M according to sequence from small to large, is followed successively by mark gap from triangle battle array D1, D2, D3,
D4, D5First element number completion of the first row, often takes a number away in integer ordered series of numbers M, the corresponding position in integer ordered series of numbers M
Filling mark gap can no longer be used from triangle battle array D in filling 0, the number being removed, and the number of all filling will be different,
To guarantee that auto-correlation constrains and interrelational constraint is all 1, and then construct stringent related constraint light orthogonal code code word；
Ordered series of numbers M are as follows:
2, it fetches from integer ordered series of numbers M by sequence from small to large, is followed successively by mark gap from triangle battle array D1,D2,D3,D4,
D5Second element number completion of the first row often fills out a number, calculates the sum of the first two number, and takes the number away from integer ordered series of numbers M
The corresponding position for filling out triangle battle array next line, the number scale taken away are 0；
Ordered series of numbers M are as follows:
3, it repeats the above process, completes the number that selects of triangle battle array, complete the stringent related constraint light orthogonal code mark that code weight is 4
Construction of the gap from triangle battle array；
Ordered series of numbers M are as follows:
4, it repeats the above process, completes stringent structure of the related constraint light orthogonal code mark gap from triangle battle array that code weight is 5
It makes；
Ordered series of numbers M are as follows:
In step s3:
One, the light orthogonal code for being 4 for code weight
1, in step S2 step 3, each mark gap is from triangle battle array D1,D2,D3,D4,D5In maximum element dmaxRespectively
Be 21,26,31,37,35, select in maximum element 37 as lmax, just determine code length F1=2lmax+ 1=2*37+1=75；
2, the integer ordered series of numbers M that length in step S2 step 3 is 101 is punctured into length equal to lmax=37 ordered series of numbers N, takes N
Inversion sequence obtain ordered series of numbers S are as follows:
3, selection ordered series of numbers N starts the initial position of optimization.Ordered series of numbers N starts initial position serial number B=max { the ordered series of numbers N of optimization
First non-zero home position serial number 23, nw (w-1)+1-lmax=61-37=24 } start first non-zero home position serial number
=25.
4, check that " 0 " of ordered series of numbers S and ordered series of numbers N indicates collision situation:
(1) ordered series of numbers S is placed on a upper row, ordered series of numbers N is placed on to the lower section of ordered series of numbers S, the starting of ordered series of numbers S first and ordered series of numbers N
Optimize position 25 to be aligned:
S:0 36 0 34 0 32 0 0 29 0 27 0 25 0 23 0 … …
N:25 0 27 0 29 0 0 32 0 34 0 36 0
(2) whether have " 0 " mark collide, if not having, write down number if two numbers being checked to be listed on corresponding position up and down
The position number for arranging S first corresponding N ordered series of numbers, is denoted as p；If there is the collision of " 0 " mark, ordered series of numbers N is moved forward, allows ordered series of numbers S's
First originates first non-" 0 " mark position behind optimization position with ordered series of numbers N and is aligned, and continues checking " 0 " mark collision situation.
And so on, until two numbers, which are listed in up and down, does not have the collision of " 0 " mark on corresponding position, write down ordered series of numbers S first it is right
The position number of the ordered series of numbers N answered, is denoted as p.
Two sequences can see from (1), " 0 " mark occurs with ordered series of numbers S on the position number 31 of ordered series of numbers N and touches
It hits, ordered series of numbers N is moved forward, allow first non-" 0 " mark position 27 behind first origin identification position with ordered series of numbers N of ordered series of numbers S
Alignment continues checking " 0 " mark collision situation, and so on, when no any " 0 " mark collides, ordered series of numbers S and ordered series of numbers N are indicated such as
Under:
S:0 36 0 34 0 32 0 0 29 0 27 0 25 0 23 0 … …
N:32 0 34 0 36 0
From sequence as it can be seen that when 32 position number of ordered series of numbers S first corresponding ordered series of numbers N, two sequences are touched without 0 " mark
It hits, therefore p=32.
5, the code length F=l after optimizingmax+ p=37+32=69 and F1Reduce 6 compared to code length；
6, the code efficiency of optimization front and back are as follows:
Code efficiency after optimization is
Code efficiency before optimization is
Code efficiency improves 7.1% after optimization.
Two, the light orthogonal code for being 5 for code weight
1, in step S2 step 4, each mark gap is from triangle battle array D1,D2,D3,D4,D5In maximum element dmaxRespectively
Be 46,53,60,69,73, select in maximum element 73 as lmax, just determine code length F1=2lmax+ 1=2*73+1=147；
2, the integer ordered series of numbers M that length in step S2 step 4 is 101 is punctured into length equal to lmax=73 ordered series of numbers N, takes N
Inversion sequence obtain ordered series of numbers S are as follows:
3, selection ordered series of numbers N starts the initial position of optimization.Ordered series of numbers N starts initial position serial number B=max { the ordered series of numbers N of optimization
First non-zero home position serial number 23, nw (w-1)+1-lmax=101-73=28 } start first non-zero home position serial number
=34.
4,0 " the mark collision situation of detection ordered series of numbers S and ordered series of numbers N:
(1) ordered series of numbers S is placed on first row, ordered series of numbers N is placed on to the lower section of ordered series of numbers S, the starting of ordered series of numbers S first and ordered series of numbers N
Position 34 is aligned:
S:0 72 71 70 0 0 67 66 0 64 63 62 61 0 59 58 0 56 …
N:34 0 36 0 0 … …
(2) whether have " 0 " mark collide, if not having, write down number if two numbers being checked to be listed on corresponding position up and down
The position number for arranging S first corresponding N ordered series of numbers, is denoted as p；If there is the collision of " 0 " mark, ordered series of numbers N is moved forward, allows ordered series of numbers S's
First originates first non-" 0 " mark position behind optimization position with ordered series of numbers N and is aligned, and continues checking " 0 " mark collision situation.
And so on, until two numbers, which are listed in up and down, does not have the collision of " 0 " mark on corresponding position, write down ordered series of numbers S first it is right
The position number of the ordered series of numbers N answered, is denoted as p.
Two sequences can see from (1), occur 0 " mark collision with ordered series of numbers S on the position number 38 of ordered series of numbers N,
Ordered series of numbers N is moved forward, makes first non-" 0 " mark position 36 behind first origin identification position with ordered series of numbers N of ordered series of numbers S right
Together, " 0 " mark collision situation is continued checking, and so on, when no any " 0 " mark collides, ordered series of numbers S is expressed as follows with ordered series of numbers N:
S:0 72 71 70 0 0 67 66 0 64 63 62 61 0 59 58 0 56 …
N:58 59 0 61 62 63 64 0 66 67 0 0 70 71 72 0
From sequence as it can be seen that when 58 position number of ordered series of numbers S first corresponding ordered series of numbers N, two sequences are touched without 0 " mark
It hits, therefore p=58.
5, the code length F=l after optimizingmax+ p=73+58=131 and F1Reduce 16 compared to code length；
6, the code efficiency of optimization front and back are as follows:
Code efficiency after optimization is
Code efficiency before optimization is
Code efficiency improves 10.2% after optimization.
With the increase of code word, the increase of code weight, improving after optimization with the code efficiency before optimization can be bigger.
In step s 4, according to X={ p0,p1,…,pw-1}={ 0, t1,t1+t2,…,t1+t2+…+ti,…,t1+t2+…
+ti…+tw-1Mapping relations, construct stringent related constraint light orthogonal code code word.
5 stringent related constraint light orthogonal code code words that code weight is 4 are as follows:
X1={ 0,1,7,21 }, X2={ 0,2,10,26 }, X3={ 0,3,12,31 }, X4={ 0,4,15,37 }, X5=0,
5,18,35 }, they meet auto-correlation constraint automatically and interrelational constraint is all 1.
5 stringent related constraint light orthogonal code code words that code weight is 5 are as follows:
X1={ 0,1,7,21,46 }, X2={ 0,2,10,26,53 }, X3={ 0,3,12,31,60 }, X4=0,4,15,
37,69 }, X5={ 0,5,18,35,73 }, they meet auto-correlation constraint automatically and interrelational constraint is all 1.
Stringent related constraint light orthogonal code code word is constructed by construction mark gap from triangle battle array and according to mapping relations, it can
It is more with the stringent related constraint light orthogonal code number of codewords effectively constructed, code tuple value is big；It is heavy, any that any code can be constructed
The stringent related constraint light orthogonal code code word of quantity；Optimize code length by the predetermined principle of optimality, code efficiency is high；The building method
Desin speed is fast, and the stringent related constraint light orthogonal code that such as 500 code weights of construction are 10, build time only needs a few tens of milliseconds, and
And it is simple, practical, feasible；Parameter is not constrained, qualified relation.The present invention solves optical code division multiple access address code for a long time
Difficult problem is constructed, the stringent related constraint light orthogonal code constructed can be used as the address of light code division multiple access communicating system
Code is applied in optical access network, passive optical network, light code labeling exchange network, light detection network, fiber optic sensor network, light
Core router, light edge router and radio optical communication system and network etc..
The present invention be illustrated by specific embodiment, it will be appreciated by those skilled in the art that, do not departing from this hair
In the case where bright range, various transformation and equivalent substitute can also be carried out to the present invention.In addition, being directed to particular condition or specific feelings
Condition can do various modifications to the present invention, without departing from the scope of the present invention.Therefore, the present invention is not limited to disclosed tool
Body embodiment, and should include the whole embodiments fallen within the scope of the appended claims.
Claims (10)
1. a kind of building method of stringent related constraint light orthogonal code, which comprises the following steps:
S1. number of codewords n and code weight w construction the integer ordered series of numbers M constructed as needed；
S2. it is fetched from the integer ordered series of numbers M according to predetermined access rule, constructs the biography of stringent related constraint light orthogonal code code word
Number gap is from triangle battle array D；Wherein, the expression formula of the mark gap from triangle battle array D are as follows:
ti(i ∈ [1, w-1]) indicates the distance of two neighboring marker pulse；
S3. the integer ordered series of numbers M according to the mark gap from triangle battle array D and completion of having fetched, according to the predetermined principle of optimality
Optimize code length F；
S4., from the mapping relations that triangle battle array D is constituted, stringent related constraint light orthogonal code code is constructed according to by the mark gap
Word.
2. the building method of stringent related constraint light orthogonal code according to claim 1, which is characterized in that the step S1
Further comprise:
The integer ordered series of numbers M is constructed according to formula F >=nw (w-1)+1, M is the integer number that nw (w-1)+1 is incremented to since 1
Column, F are code length, and n is the number of codewords for needing to construct, and w is the code weight for needing the code word constructed.
3. the building method of stringent related constraint light orthogonal code according to claim 2, which is characterized in that the step S2
Further comprise:
S2-1. the number of codewords n constructed as needed, n mark gaps of building are from triangle battle array D1,D2,…,Dn；
S2-2. it fetches from the integer ordered series of numbers M by sequence from small to large, is followed successively by the mark gap from triangle battle array D1,
D2,…,DnFirst element number completion of the first row often takes a number away in the integer ordered series of numbers M, in the integer ordered series of numbers M
Corresponding position filling 0, the filling mark gap can no longer be used from triangle battle array D in the number being removed1,D2,…,DnIn；
S2-3. it fetches from the integer ordered series of numbers M by sequence from small to large, is followed successively by the mark gap from triangle battle array D1,
D2,…,DnSecond element number completion of the first row often fills out a number, calculates the sum of the first two number, and from the integer ordered series of numbers M
Take the corresponding position that the number fills out triangle battle array next line away, the number scale taken away is 0, and so on, until the mark gap from
Triangle battle array D1,D2,…,DnIn all elements be filled number.
4. the building method of stringent related constraint light orthogonal code according to claim 3, which is characterized in that the step S2
Further include:
If S2-4. fetching the filling mark gap from the integer ordered series of numbers M from triangle battle array D by sequence from small to large1,
D2,…,DnDuring, the number for occurring inserting it is adjacent plus after data number completion word is identical with front element, then change the integer
Next the smallest number filling in ordered series of numbers M, until different from the number that front element is inserted.
5. the building method of stringent related constraint light orthogonal code according to claim 4, which is characterized in that the step S3
Further comprise:
S3-1. d is enabledmaxIt indicates maximum value of the mark gap from element in triangle battle array D, enables lmaxFor the maximum value of element in all D,
Just determine code length F1=2lmax+1；
S3-2. the integer ordered series of numbers M that length is nw (w-1)+1 after the step S2 is punctured into length equal to lmax's
The opposite sequence of integer ordered series of numbers N, access column N obtain ordered series of numbers S.
6. the building method of stringent related constraint light orthogonal code according to claim 5, which is characterized in that the step S3
Further include:
S3-3. by first of the ordered series of numbers S and max { first non-zero position digital, nw (w-1)+1- of the ordered series of numbers N
lmaxThe non-zero aligned in position that starts of position, start to have checked whether the collision of " 0 " mark, move forward the ordered series of numbers N if having,
Allow max { first non-zero position digital, nw (w-1)+1-l of the ordered series of numbers S and the ordered series of numbers NmaxNearest non-behind position
The alignment of zero flag position has checked whether the collision of " 0 " mark again, and so on, it is described at this time until there is no the collision of " 0 " mark
The position number of the ordered series of numbers S first corresponding ordered series of numbers N is denoted as p, then the code length F=l after optimizingmax+p。
7. the building method of stringent related constraint light orthogonal code according to claim 6, which is characterized in that the step S3
Further include:
Code efficiency before and after calculation optimization, the code efficiency after optimization areVolume before optimization
Code efficiency is
8. the building method of stringent related constraint light orthogonal code according to claim 6 or 7, which is characterized in that the step
Rapid S4 further comprises:
According to X={ p0,p1,…,pw-1}={ 0, t1,t1+t2,…,t1+t2+…+ti,…,t1+t2+…+ti…+tw-1Mapping pass
System, constructs stringent related constraint light orthogonal code code word, wherein { p0,p1,…,pw-1It is code word, first pulse is fixed on described
0th position of code word, { 0, t1,t1+t2,…,t1+t2+…+ti,…,t1+t2+…+ti…+tw-1In except zero other
Element is element of the mark gap from first row in triangle battle array D, indicates other pulsion phases to p0Position.
9. the building method of stringent related constraint light orthogonal code according to claim 8, which is characterized in that the formula F
>=nw (w-1)+1 is by formulaIt derives.
10. the building method of stringent related constraint light orthogonal code according to claim 9, which is characterized in that described just fixed
Code length F1=2lmax+ 1 is by formulaAnd formula It derives.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711465941.2A CN108234058B (en) | 2017-12-28 | 2017-12-28 | A kind of building method of stringent related constraint light orthogonal code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711465941.2A CN108234058B (en) | 2017-12-28 | 2017-12-28 | A kind of building method of stringent related constraint light orthogonal code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108234058A CN108234058A (en) | 2018-06-29 |
| CN108234058B true CN108234058B (en) | 2019-05-17 |
Family
ID=62645682
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711465941.2A Active CN108234058B (en) | 2017-12-28 | 2017-12-28 | A kind of building method of stringent related constraint light orthogonal code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108234058B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1501596A (en) * | 2002-11-19 | 2004-06-02 | 电子科技大学 | A method for composing optimum optical orthogonal code |
| CN101005330A (en) * | 2006-12-30 | 2007-07-25 | 电子科技大学 | Light grouping exchange method based on serial arrangement light orthogonal code label |
| CN102752067A (en) * | 2012-06-08 | 2012-10-24 | 深圳大学 | Method and device for forming two-dimensional optical orthogonal code with zero correlation window |
| CN104333432A (en) * | 2014-10-30 | 2015-02-04 | 福州大学 | Method for constructing optimal optical orthogonal codes with unlimited class Hamming code weights 5 and 7 |
| CN106911384A (en) * | 2017-01-23 | 2017-06-30 | 西安电子科技大学 | Suitable for the building method of the two-dimentional light address code of visible ray OCDMA communications |
-
2017
- 2017-12-28 CN CN201711465941.2A patent/CN108234058B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1501596A (en) * | 2002-11-19 | 2004-06-02 | 电子科技大学 | A method for composing optimum optical orthogonal code |
| CN101005330A (en) * | 2006-12-30 | 2007-07-25 | 电子科技大学 | Light grouping exchange method based on serial arrangement light orthogonal code label |
| CN102752067A (en) * | 2012-06-08 | 2012-10-24 | 深圳大学 | Method and device for forming two-dimensional optical orthogonal code with zero correlation window |
| CN104333432A (en) * | 2014-10-30 | 2015-02-04 | 福州大学 | Method for constructing optimal optical orthogonal codes with unlimited class Hamming code weights 5 and 7 |
| CN106911384A (en) * | 2017-01-23 | 2017-06-30 | 西安电子科技大学 | Suitable for the building method of the two-dimentional light address code of visible ray OCDMA communications |
Non-Patent Citations (2)
| Title |
|---|
| 一种严格最佳(ν,k,1)光正交码的设计方法;安晓强;《应用光学》;20030525;全文 |
| 最佳(F,K,1)光正交码的构造算法研究;李晓滨;《中国激光》;20030525;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108234058A (en) | 2018-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ozfatura et al. | Speeding up distributed gradient descent by utilizing non-persistent stragglers | |
| Sagan | Shifted tableaux, Schur Q-functions, and a conjecture of R. Stanley | |
| CN106253913B (en) | The block encoder of polarization code and its coding method | |
| Fickus et al. | Constructing all self-adjoint matrices with prescribed spectrum and diagonal | |
| CN101207456A (en) | Optical line terminal and optical network terminal | |
| EP3053311B1 (en) | Systems and methods for distance approximation in graphs | |
| CN103384354A (en) | Optimum design method of optical distribution network of passive optical network | |
| CN108234058B (en) | A kind of building method of stringent related constraint light orthogonal code | |
| Ma et al. | Constructions of optimal optical orthogonal codes with weight five | |
| US6920588B1 (en) | Transmitting data in a communication network | |
| CN102226947A (en) | Controllable test vector generator based on linear feedback shift register | |
| Kwong et al. | Double-weight signature pattern codes for multicore-fiber code-division multiple-access networks | |
| CN106649790A (en) | Multilayer link separated skiplist construction method and system | |
| CN101695015B (en) | RS decoder and decoding method for EPON system | |
| CN108259117B (en) | A kind of auto-correlation is constrained to the building method of 2 light orthogonal code | |
| CN108259115A (en) | A kind of auto-correlation and the building method of light orthogonal code that interrelational constraint is 2 | |
| CN105634648A (en) | Generating method of visible light communication complementing code and visible light communication method based on complementing code | |
| CN108712262A (en) | Auto-correlation is constrained to the building method for the light orthogonal signature graphic code that 1, interrelational constraint is 2 | |
| CN101496291A (en) | LFSR emulation | |
| CN110011755A (en) | A kind of method, apparatus that LDPC is encoded and the method, apparatus that data are sent | |
| CN109992700A (en) | The method and apparatus for obtaining the insertion vector of relational network figure interior joint | |
| CN108242966B (en) | The building method of the multiple-length light orthogonal code of orthogonal Latin matrix based on extension | |
| CN109450460A (en) | A kind of parameter identification method of RS code and the concatenated code of convolutional code | |
| CN106354581B (en) | A kind of cyclic redundancy check method and multi-core processor | |
| CN108377175A (en) | A kind of building method for the light orthogonal code that interrelational constraint is 2 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |