CN1613193A - Coding method for generating general spread spectrum sequence zero with zero correlation window - Google Patents

Abstract

The present invention provide a coding method to create general spread spectrum sequence with zero correlation window, wherein general spread spectrum sequence with zero correlation window include binary codes at least in complex field. The present invention is to solve the problems remains in prior art, including the fatal near-far effects in traditional CDMA radio communications and leads to many new codes which have a much wider range of available lengths and window widths of zero correlations. All codes constructed by the method are close to the theoretical bound.

Description

A kind of generation has the coding method of the common frequency expansion sequence of zero correlation window

Technical field

The present invention relates to field of telecommunications, and particularly a kind of generation has the coding method of the common frequency expansion sequence of zero correlation window.

Background technology

The universal growth of personal communication service, the scarcity of WiMAX resource has caused in radio communication the continuous demand of spectral efficient more in addition.Traditional multiple access control (MAC) scheme such as FDMA, TDMA is owing to their low frequency spectrum efficient can not meet the demands.Increasing people thinks that CDMA will will become the main MAC scheme of next generation wireless communication with its spectral efficient.

The difference of CDMA and other MAC schemes is: the capacity of CDMA is that a kind of soft capacity and its are to disturb rank, and for example, any technology that is used for reducing interference all will directly increase the capacity of cdma system.Yet the power system capacity of other MAC schemes is a kind of hard capacity, and it is just determined before design.

The cdma system capacity depends on the interference rank of its system now, and the interference that how to reduce system is most important for increasing the cdma system capacity.There are many technology to be used for reducing the interference of cdma system, survey (MUD), adaptive antenna array, energy control or the like as the multi-user.In fact user is received from another user's interference, and the interference between two users, has grown two faulty correlations of spreading code with respect to two users.So need find a kind of the have good autocorrelation (ACF) and the code character of cross correlation (CCF) for cdma system.

Interference in the cdma system, we wish the code character that finds one group to have desirable ACF and CCF.(Welch) boundary when but unfortunately the ACF of any code character and CCF are subject to the Wal.According to Welch circle, ACF and CCF can not be reduced simultaneously.So it is impossible finding one group of code character with desirable ACF and CCF.

But in many application, there is no need to set up such code character with desirable ACF and CCF at all time change points.In fact for a synchronous cdma system, guarantee that in the maximum delay of channel desirable ACF and desirable CCF is enough.For example, be Δ if channel expands when maximum, so ACF and CCF at [Δ, Δ] just in be desirable enough.1997, the Li Daoben professor finds that a kind of structure has the spread spectrum multiple access Methods for Coding (ZCW) of zero correlation window.And the method that he finds has been carried out pct international patent application (number of patent application PCT/CN00/00028).The code length that provides, the size of LS sign indicating number collection greater than before, it is used CDMA has very high value.

The LS sign indicating number provides one to generate tree in order to being that to generate width the uncorrelated complementary orthogonal code of N be the complementary orthogonal code with zero correlative window characteristic of 2N-1 from a pair of length.The access code family size that is in M level expansion code character is 2 ^(M+1), and be 2 in the length of M level sign indicating number ^MN.Such code character is represented as (2 ^(M+1), 2 ^MN, N), wherein 2 ^(M+1)Be the access code quantity of newly expanding code character, 2 ^MN is a code length, and N is the width of zero correlation zone one side.

One code character with zero correlation window is represented as that (W), K represents the size of the access code family of code character here for K, L, and L is the code length of mutual-complementing code C part or S part, and W is a side of zero correlation window width.According to Welch circle that revises just like lower inequality: K≤(2L+2W-2)/W.For LS sign indicating number K=2 ^(M+1), L=2 ^MN, so W=N is K=2L/W.When L＞＞during W the LS sign indicating number near the theoretical boundary.But the size of the access code family of LS sign indicating number is restricted to 2 ^(M+1)

Thus, a lot of scholars begin to seek the spreading code with zero correlation window.In 2000, Xinmin Deng and Pingzhi Fan proposed the frequency expansion sequence collection with zero correlative window characteristic that a class is derived from the complementary sets of mutually orthogonal.But Xinmin Deng the sign indicating number and the theoretical boundary in very different.Subsequently, J.S cha provides and has generated the building method that a class has the ternary frequency expansion sequence of zero correlative window characteristic.Yet this spreading code by the J.Scha proposition can not be near boundary.In calendar year 2001, Shinya Matsufuji proposes a kind of method by the expansion of HM*M orthogonal matrix, and to have code length be that the uncorrelated complementary orthogonal code of N generates the complementary quadrature ZCW of class sign indicating number from a pair of.But M and N prime number each other in its expansion process, this has limited the width of available code length scope and ZCW sign indicating number to a great extent.

Summary of the invention

The purpose of this invention is to provide the coding method that a kind of generation has the common frequency expansion sequence of zero correlation window.The present invention is that a kind of new coding method is used for generating a class has " zero correlation window " at autocorrelation performance and their cross correlation common spread spectrum multiple access sign indicating number.This new building method has produced the new sign indicating number that much has wideer effective code length and zero correlation window width.Because the foundation of described " zero correlation window ", the fatal near-far problem that exists in traditional C DMA radio communication will be overcome.All sign indicating numbers by this method structure all will be near the theoretical boundary.The invention provides the method that a kind of generation has the common frequency expansion sequence of zero correlation window, the common frequency expansion sequence that wherein has zero correlation window comprises two repeated codes in compositum.

Wherein said common frequency expansion sequence with zero correlation window comprises three repeated codes in compositum.

Wherein said common frequency expansion sequence with zero correlation window comprises multi-code in compositum.

Wherein said common frequency expansion sequence with zero correlation window comprises that in compositum any other has the sign indicating number of ZCW.

Wherein said common frequency expansion sequence with zero correlation window comprises two repeated codes in compositum, three repeated codes, multi-code and other any sign indicating numbers with ZCW.

Wherein said two repeated codes comprise:

In double territory, LS sign indicating number family size only is 2 ⁿ, wherein n is a positive integer;

There is orthogonal matrix H _12*12Thereby, construct that to have yard family size be the double ZCW sign indicating number of 12*2;

The size of the double ZCW sign indicating number family of wide region more will be provided by described method.

Wherein said three repeated codes comprise:

In double territory, there is mutual-complementing code N=2 ^a10 ^b26 ^cSo the width of the zero correlation window of two repeated codes is only 1,2,4,8 ... middle value;

But all there are triple mutual-complementing codes for positive count N, can both be configured so have triple mutual-complementing codes of any ZCW length with zero correlation window;

Further, double orthogonal matrix H _M*MHave only as M to equal 2,4,8,12 ... in time, just exist, and all has triple matrix H during for positive number arbitrarily as M simultaneously _M*M

Described method generates many new sign indicating numbers with wideer effective length and zero correlation zone width, so we can select the suitable ZCW length and the size of mutual-complementing code family by channel conditions and system requirements.

Wherein said polyphase code comprises:

In double territory, only may there be mutual-complementing code, for N=2 ^a10 ^b26 ^cSo the width of the zero correlation window of two repeated codes is only 1,2,4,8 ... middle value;

All have the multi-code of zero correlation window but exist for positive count N, can both be configured so have the multiple mutual-complementing code of any ZCW length;

Further, have only as M to equal 2,4,8,12 ... the time just have a double orthogonal matrix H _M*M, all have multiple matrix H during for positive number arbitrarily as M simultaneously _M*M

Described method generates many new sign indicating numbers with wideer effective length and zero correlation zone width, so we can select the suitable ZCW length and the size of mutual-complementing code family by channel conditions and system requirements.

Wherein said method may further comprise the steps:

Selection one has the complementary orthogonal code that code length is N, and (C1, S1), autocorrelation performance aperiodic of sign indicating number C and sign indicating number S complements each other except initial point.

Select another complementary orthogonal code (C2, S2), its with the sign indicating number (C1, S1) uncorrelated; Just sign indicating number C and the aperiodic their cross correlation of sign indicating number between the S make between two yards and in all corresponding time changes, be 0.

Can prove (C1, S1) with

Be incoherent to each other, ' ^-' represent inverse operation, ' * ' represents conjugate operation;

Select orthogonal matrix arbitrarily, H _{M * M}Have the capable M row of M, new sign indicating number constructs thus:

Wherein '  represents Kronecker product;

The autocorrelation performance of expansion code character and their cross correlation will form one around initial point and zero correlation window window size 〉=N.

Wherein said method may further comprise the steps:

If

Be that a pair of code length is the uncorrelated complementary orthogonal code of N, and triple orthogonal matrix Be used, wherein "+, " representative+1, " 0 " represent 0 and "-" represent-1; Its expansion code character is:

When N=5, a pair of uncorrelated triple complementary orthogonal codes are:

By described extended method, the code character of expansion is:

The width of zero correlation window will be N=5;

The size of expansion code character family is 6;

Also can use conversion of equal value and generate basic triple complementary ZCW code character.

Wherein said method may further comprise the steps:

Uncorrelated complementary quadrature quadruple sign indicating number is to being:

Wherein integer i represents respectively

Extended matrix is:

The expansion code character is:

Can verification the width of zero correlation window of expansion code character be 3, and the size of expansion code character family is 4;

If orthogonal matrix H _{M * M}Be defined as:

Wherein integer i representative

A ZCW code character (2M, 3M, 3) is obtained;

Referred ZCW sign indicating number is the orthogonal matrix H of the uncorrelated complementary orthogonal code generation of N by a pair of code length _M*MExpand;

New expansion code character be original uncorrelated complementary orthogonal code to the Kronecker product of quadrature spread matrix, the expansion code character can by (K, L, W)=(2M, MN, N) representative, M wherein, N is any positive integer;

Referred code character satisfies: K=2L/W, but the size of the access code family of code character is no longer by K=2 ^(M+1)Limit and code length no longer just 2 ^MN;

Described method has produced the sign indicating number that the new effective length of many kinds is wideer and zero correlation window is wideer;

Described method can construct has any even number big or small K of being of family, and the zero correlation window width is W, and code length is L and the mutual-complementing code that satisfies K=2L/W;

Described method is effective too to the generalized complementary sign indicating number, for example generates triple mutual-complementing codes and quadruple mutual-complementing code.

The conversion of equivalence can not change the characteristic of the complementary ZCW sign indicating number of mentioning.

All sign indicating numbers of mentioning in the described method can both be near the theoretical boundary.

The objective of the invention is to solve the problem that prior art is left over, be included in fatal near-far problem in the traditional C DMA radio communication.The present invention has generated the new sign indicating number of many effective lengths with wide region more and wideer zero correlation window.The sign indicating number that possessive construction goes out can both be near the theoretical boundary.

Embodiment

It provides a kind of building method of new sign indicating number and has comprised two repeated codes, the generation method of the common spread spectrum ZCW of the class sign indicating number of three repeated codes and multi-code or the like.The ZCW sign indicating number of mentioning is the H that the uncorrelated complementary orthogonal code of N is produced by a pair of code length _M*MOrthogonal matrix is expanded.The expansion code character be original uncorrelated complementary orthogonal code to the Kronecker product of quadrature spread matrix.The expansion code character can by (K, L, W)=(2M, MN, N) expression, M wherein, N is any positive integer.Referred code character satisfies: K=2L/W, but the size of code character access code family no longer is limited in K=2 ^(M+1), and code length no longer is 2 ^MN.Described method has produced the sign indicating number that the new effective length of many kinds is wideer and zero correlation window is wideer.

The present invention will be described in detail by preferred embodiment and form.

Our example that to provide a code length be triple mutual-complementing codes of N=5 at first:

C1=(++ 0--), S1=(+-0++), wherein '+' representative ' 1 ' and '-' representative ' 1 '.(C1, S1) autocorrelation performance all equals 0 to sign indicating number aperiodic except initial point, just sign indicating number C and sign indicating number S complementation mutually.

Definition now:

Autocorrelation performance aperiodic of sign indicating number C is: $R_{c1}\left(\mathrm{\τ}\right)=\underset{i=0}{\overset{N-1-\mathrm{\τ}}{\mathrm{\Σ}}}{c}_1\left(i\right){c^{*}}_1(i+\mathrm{\τ}),$ Wherein τ is time change.

Autocorrelation performance aperiodic of sign indicating number S is: $R_{s1}\left(\mathrm{\τ}\right)=\underset{i=0}{\overset{N-1-\mathrm{\τ}}{\mathrm{\Σ}}}{s}_1\left(i\right){s^{*}}_1(i+\mathrm{\τ}),$ Wherein τ is time change.

Autocorrelation performance aperiodic of sign indicating number 1 is: R ₁(τ)=R _C1(τ)+R _S1(τ)

Table 1 is an autocorrelative value 1 aperiodic of sign indicating number.

Table 1: the auto-correlation of sign indicating number 1

By the uncorrelated complementary orthogonal code building method from known code, we can draw another kind of uncorrelated complementary orthogonal code.

$(C2,S2)=(\stackrel{\‾}{{S1}^{*}},-\stackrel{\‾}{{C1}^{*}})=(++0-+,+-0--)$

We define:

Cross-correlation between sign indicating number 1 and the sign indicating number 2 is:

$R_{c_1{c}_2}\left(\mathrm{\τ}\right)=\underset{i=0}{\overset{N-1-\mathrm{\τ}}{\mathrm{\Σ}}}{c}_1\left(i\right){c^{*}}_2(i+\mathrm{\τ}),$ $R_{s_1{s}_2}\left(\mathrm{\τ}\right)=\underset{i=0}{\overset{N-1-\mathrm{\τ}}{\mathrm{\Σ}}}{s}_1\left(i\right){s^{*}}_2(i+\mathrm{\τ})$

$R_{12}\left(\mathrm{\τ}\right)=R_{c_1{c}_2}\left(\mathrm{\τ}\right)+R_{s_1{s}_2}\left(\mathrm{\τ}\right)$

Table 2 is autocorrelation value of sign indicating number 2.

Table 3 is the cross correlation values between sign indicating number 1 and the sign indicating number 2.

Table 2: the auto-correlation of sign indicating number 2

Table 3: the cross-correlation of sign indicating number 1 and sign indicating number 2

Size and each code length for the family with access code 2 are that 5 uncorrelated complementary orthogonal code has only a kind of citation form.Other form is to C1 and C2, the row mutually of S1 and S2, and exchange C and S, rotation, transpose, and optionally negate or the like.Have any to be noted, exactly when being correlated with or mate the screening operation, just sign indicating number C is to sign indicating number C, and sign indicating number S is to the operation of sign indicating number S.Sign indicating number C and sign indicating number S can not meet in operation.

Provide orthogonal matrix arbitrarily, the expansion code character that has length is to come from original uncorrelated complementary orthogonal code.Suppose that orthogonal matrix is

We can access family's size be 6 and length be 15 sign indicating number.

Table 4 is auto-correlation and their cross correlations of newly expanding code character.

Table 4: the auto-correlation and the cross-correlation of new extended code

The time change value	?-6	?-5	?-4	?-3	?-2	?-1	??0	??1	??2	??3	??4	??5	??6
														????R 1(τ)	??0	??8	??0	??0	??0	??0	??16	??0	??0	??0	??0	??8	??0
????R 2(τ)	??0	?-8	??0	??0	??0	??0	??16	??0	??0	??0	??0	?-8	??0
														????R 3(τ)	??0	??0	??0	??0	??0	??0	??8	??0	??0	??0	??0	??0	??0
????R 4(τ)	??0	??8	??0	??0	??0	??0	??16	??0	??0	??0	??0	??8	??0
														????R 5(τ)	??0	?-8	??0	??0	??0	??0	??16	??0	??0	??0	??0	?-8	??0
????R 6(τ)	??0	??0	??0	??0	??0	??0	??8	??0	??0	??0	??0	??0	??0
														????R 12(τ)	??0	?-8	??0	??0	??0	??0	??0	??0	??0	??0	??0	??8	??0
????R 13(τ)	??0	??8	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0
														????R 14(τ)	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0
????R 15(τ)	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0
														????R 16(τ)	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0
????R 23(τ)	??0	?-8	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0
														????R 24(τ)	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0
????R 25(τ)	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0
														????R 26(τ)	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0
????R 34(τ)	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0
														????R 35(τ)	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0

????R 36(τ)	??0	???0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0
														????R 45(τ)	??0	??-8	??0	??0	??0	??0	??0	??0	??0	??0	??0	??8	??0
????R 46(τ)	??0	???8	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0
														????R 56(τ)	??0	??-8	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0	??0

The width of the zero correlation window of new expansion code character is 5.And the size of new code character family is 6.Can not construct family's size in double territory and be 6 and the ZCW width be 5 mutual-complementing code.

The existence of the neutral element of triple complementary ZCW sign indicating numbers has caused the different members of cooperating with each other between the acquisition code character in different processing.If we expand to multiple complementary orthogonal code with triple complementary orthogonal codes, will do not contained the complementary quadrature ZCW sign indicating number of neutral element.As following given example:

The source code of uncorrelated complementary quadrature four phase sign indicating numbers is to being:

Wherein integer i represents respectively Extended matrix is:

The expansion code character is:

Can verification the width of zero correlation window of expansion code character be 3, and the size of the family of expansion code character is 4.

If orthogonal matrix H _{M * M}Be defined as:

Wherein integer i represents respectively

A ZCW code character (2M, 3M, 3) is obtained.

Table 5 is examples of triple uncorrelated complementary orthogonal codes of random length.

Table 6 is examples of triple orthogonal matrixes of random length.

Table 7 is examples of the multiple uncorrelated complementary orthogonal code of random length.

Table 5: triple uncorrelated complementary quadrature code tables 6: triple quadrature spread matrixes

Code length N	The original, complementary sign indicating number is right
		????1	(+，+) (+，-)
????2	(++，+-) (+-，++)
		????3	(+0+，+0-) (+0-，+0+)
????4	(+++-，+-++) (++-+，+---)
		????5	(++0+-，++0-+) (+-0++，+-0--)
????6	(++-+0+，++--0-) (-0--++，-0-+--)
		????7	(--+0-0-，--+0+(+) (+0+0+--，+0+0-++)
?……	……

Dimension M	Extended matrix H M*M
		????1	+
????2	++ +-
		????3	++0 +-0 00+
????4	+++- +-++ ++-+ +---
		????5	+++-0 +-++0 ++-+0 +---0 0000+
???……	……

Table 7: multiple uncorrelated complementary orthogonal code

Code length N	The original, complementary sign indicating number is right
		????1	?(0,0) ?(0,2)
????2	?(00,02) ?(02,00)
		????3	?(010,002) ?(200,212)
????4	?(0002,0200) ?(0020,0222)
		????5	?(01321,00013) ?(13000,10312)
?……	??……

Table 8: multiple quadrature spread matrix

Dimension M	Original orthogonal matrix H M*M
		????1	??0
????2	??0?0 ??0?1
		????3	??0?0?0 ??0?1?2 ??0?2?4
????4	??0?0?0?0 ??0?1?2?3 ??0?2?4?6 ??0?3?6?9
		????5	??0??0??0??0??0 ??0??1??2??3??4 ??0??2??4??6??8 ??0??3??6??9?12 ??0??4??8?12?16
???……	??……

Wherein integer i represents composite number

Now, we can construct any big or small K of being of family that has, and the zero correlation window width is W, and code length is L, and satisfies the mutual-complementing code of K=2L/W.

This building method also can be used for the generalized complementary sign indicating number, for example triple complementary code characters and quadruple mutual-complementing code or the like.For example 4 code lengths are that 4 the uncorrelated complementary orthogonal code of quadruple is:

Sign indicating number 1:++++ ,+-+-,--++ ,-++-

Sign indicating number 2:-+-+,----,+--+, ++--

Sign indicating number 3:--++ ,-++-, ++ ++ ,+-+-

Sign indicating number 4:+--+, ++--,-+-+,----

Their auto-correlation sums of each part except initial point are zero, and their cross-correlation sums of each part in all correlating transforms are zero.

Expand the uncorrelated complementary orthogonal code of original quadruple by an orthogonal matrix, we can access the complementary ZCW sign indicating number (4M, 4M, 4) of a broad sense.

By the research of Frank, may arrive 100 as follows for quadruple mutual-complementing code length:

Two-fold mutual-complementing code: 1,2,4,8,10,16,20,26,32,40,52,64,80,100.

Another quadruple mutual-complementing code: 3,5,6,12,13,18,24,30,36,48,50,60,72,78,96 (length is 7,9,11,15,17 do not exist).

The quadruple triplets are except 50, above whole adding: 7,9,11,14,15,17,19,21,22,25,27,33,37,39,41,42,45,49,51,53,54,57,58,61,63,65,66,73,75,81,90,97,99.

Quadruple tetrad: comprise that whole length are except 71,89.

Situation more than quadruple: whole length.

Though detailed execution mode described in the invention is a most preferred embodiment, the corresponding modify of being done according to the present invention does not break away from the present invention arbitrarily.Therefore, the present invention is defined by following claim, and comprises all equivalents.

Reference comprises:

[1]D.B.Li，“High?spectrum?efficient?multiple?access?code”，Proc.of?FutureTelecommunications?Forum(FTP’99)，Beijing，pp.44-48，7-8?December?1999。

[2]P.Z.Fan?and?M.Darnell，“Sequence?Design?for?Communications?Applications”，John?Wiley，RSP，1996。

[3]L.R.Welch，Lower?bounds?on?the?maximum?cross?correlation?of?signals，IEEETrans.Inform.Theory，vol.IT-20，pp.397-399，1974。

[4]V.M.SideInikoy，On?mutual?correlation?of?sequences，Soviet?math.Dokl.，vol.12，pp.197-201，1971。

[5]P.Z.Fan，N.Suehiro，N.Kuroyanagi?and?X.M.Deng，“A?class?of?binarysequences?with?zero?correlation?zone，”IEE?Electron.Lett.，vol.35，pp.777-779，1999。

[6]X.M.Deng?and?P.Z.Fan，Spreading?sequence?sets?with?zero?correlation?zone，IEE?Electron.Lett.，vol.36，pp.993-994。

[7]R.L.Frank，Polyphase?Complementary?Codes，IEEE?Trans.Inform.Theory，vol.IT-26，pp.641-647，1980。

[8]L.S.Cha，Class?of?ternary?spreading?sequences?with?zerocorrelation?duration，IEE?Electron.Lett.，vol.37，pp.636-637。

Claims (13)

1. a generation has the coding method of the common frequency expansion sequence of zero correlation window, and the common frequency expansion sequence that wherein has zero correlation window comprises two repeated codes at least in compositum.

2. method according to claim 1, wherein said common frequency expansion sequence with zero correlation window also comprises three repeated codes in compositum.

3. method according to claim 1, wherein said common frequency expansion sequence with zero correlation window also comprises multi-code in compositum.

4. method according to claim 1, wherein said common frequency expansion sequence with zero correlation window also comprises any other ZCW sign indicating number in compositum.

5. method according to claim 1, wherein said common frequency expansion sequence with zero correlation window comprises two repeated codes in compositum, three repeated codes, multi-code and any other ZCW sign indicating number.

6. method according to claim 1, wherein said two repeated codes comprise:

In double territory, the size of LS sign indicating number family is 2 ⁿ, wherein n is a positive integer;

There is orthogonal matrix H _12*12Thereby, construct that to have yard family size be the double ZCW sign indicating number of 12*2.

7. method according to claim 2, wherein said three repeated codes comprise:

In double territory, there is mutual-complementing code N=2 ^a10 ^b26 ^cSo the width of the zero correlation window of two repeated codes is only from 1,2,4,8 ... middle value;

All there are triple mutual-complementing codes for positive count N, can both be configured so have triple mutual-complementing codes of any ZCW length with zero correlation window;

Further, double orthogonal matrix H _M*MHave only as M to equal 2,4,8,12 ... in time, just exist, and all has triple matrix H during for positive number arbitrarily as M simultaneously _M*M

Described method generates many new sign indicating numbers with zero correlation of wideer effective length and window width, thereby selects the suitable ZCW length and the size of mutual-complementing code family by channel conditions and system requirements.

8. method according to claim 3, wherein said multi-code comprises:

In double territory, only there is mutual-complementing code N=2 ^a10 ^b26 ^cSo the width of the zero correlation window of two repeated codes is only from 1,2,4,8 ... middle value;

All there is multi-code for positive count N, can both be configured so have the multiple mutual-complementing code of any ZCW length with zero correlation window;

Further, double orthogonal matrix H _M*MHave only the M of working as to equal 2,4,8,12 ... in time, just exist, simultaneously as M multiple matrix H during for positive number arbitrarily _M*MAll exist;

Described method generates many new sign indicating numbers with zero correlation of wideer effective length and window width, thereby selects the suitable ZCW length and the size of mutual-complementing code family by channel conditions and system requirements.

9. method according to claim 1, wherein said method may further comprise the steps:

Select one have the complementary orthogonal code that code length is N (C1, S1), sign indicating number C and sign indicating number S aperiodic autocorrelation performance each all complements each other except initial point;

Select another complementary orthogonal code (C2, S2), its with the sign indicating number (C1, S1) uncorrelated; Just sign indicating number C and the aperiodic their cross correlation of sign indicating number between the S make between two yards and in all corresponding time changes, be 0;

Wherein: (C1, S1) with Be incoherent to each other, ' ^-' represent inverse operation, ' * ' represents conjugate operation;

Select orthogonal matrix habit H arbitrarily _{M * M}, be the matrix that the capable M row of M are arranged, new sign indicating number is configured out thus:

Wherein '  ' represents Kronecker product;

The autocorrelation performance of expansion code character and their cross correlation will form a zero correlation window around initial point and window size 〉=N.

10. method according to claim 2, wherein said method may further comprise the steps: if

Be that a pair of code length is the uncorrelated complementary orthogonal code of N, and triple orthogonal matrix

Be used, wherein "+" representative+1, " 0 " represent 0 and "-" represent-1; Its expansion code character is:

When N=5, a pair of uncorrelated triple complementary orthogonal codes are:

By described extended method, the code character of expansion is:

The width of zero correlation window will be N=5;

The size of a series of expansion code character family is 6;

Also can use conversion of equal value and generate basic triple complementary ZCW code character.

11. according to claim 3 or 4, wherein said method may further comprise the steps:

Uncorrelated complementary quadrature quadruple sign indicating number is:

Wherein integer i representative

Extended matrix is:

The expansion code character is:

The width that can adjust the zero correlation window of expansion code character is 3, and expansion code character family size is 4;

If orthogonal matrix H _{M * M}Be defined as:

Wherein integer i representative

A ZCW code character (2M, 3M, 3) is obtained;

Referred ZCW sign indicating number is the orthogonal matrix H of the uncorrelated complementary orthogonal code generation of N by a pair of code length _M*MExpand;

New expansion code character be original uncorrelated complementary orthogonal code to the Kronecker product of quadrature spread matrix, the expansion code character can by (K, L, W)=(2M, MN, N) representative, M wherein, N is any positive integer;

Referred code character satisfies: K=2L/W, but the size of the access code family of code character is no longer by K=2 ^(M+1)Limit and code length no longer just 2 ^MN;

Described method has produced the sign indicating number that the new effective length of many kinds is wideer and zero correlation window is wideer;

Described method can construct has any even number big or small K of being of family, and the zero correlation window width is W, and code length is L and the mutual-complementing code that satisfies K=2L/W;

Described method is effective too to the generalized complementary sign indicating number, for example generates triple mutual-complementing codes and quadruple mutual-complementing code.

12. according to claim 1 or 2 or 3 or 4 or 5 one of them described method, equivalent transformation can not change the characteristic of described complementary ZCW sign indicating number.

13. according to claim 1 or 2 or 3 or 4 or 5 wherein any described methods, all described sign indicating numbers all approach the theoretical boundary among described method.