The device and method of manufacture quaternary complex quasiorthogonal code and expansion of the transmission signal using quasiorthogonal code in the communication system mdcr

 

(57) Abstract:

The invention relates to a device and method of coding for mobile communications and more particularly to a device and method for producing the Quaternary complex quasiorthogonal codes and further use of these developed Quaternary complex quasiorthogonal codes to generate signals channel expansion. Technical result: ensuring masks quasiorthogonal codes for the production of the Quaternary complex quasiorthogonal codes and ensuring quasiorthogonal codes for channel separation using masks quasiorthogonal code and extension channel signals. The method comprises the steps, which produce an M-sequence and then develop a specific sequence with good characteristics of full correlation with the M-sequence, produce the function permutation of columns to convert the M-sequence code in Walsh, produce masks candidates using shift columns specific sequences using permutations of the columns produce representatives quasiorthogonal codes through and produce quasiorthogonal code satisfying partial correlation with the Walsh codes, developed from representatives quasiorthogonal codes, and choose the mask related to the development of selected quasiorthogonal code. 7 C. and 14 C.p. f-crystals, 10 ill., 49 table.

1. The technical field to which the invention relates

The present invention relates primarily to a device and method of coding for mobile communications and more particularly to a device and method for producing the Quaternary complex quasiorthogonal codes and further use of these developed the Quaternary complex quasiorthogonal codes to generate signals channel expansion.

2. Art

In order to increase channel capacity, in the mobile communication system mdcr (multiple access code division) typically perform the separation channel using orthogonal codes. For example, in a straight line defined by the standard IS-95/IS-95A, channel separation is performed using orthogonal codes. This method of separation channels can also be used in return line connection with the use of timing.

In Fig. 1 shows a straight line of light the channels separated by the associated orthogonal code Wi (where i=0-63), respectively, which are typically Walsh codes. In a straight line IS-95/IS-95A used convolutional codes with transmission rate of the code R=1/2, is applied modulation FMD (binary phase shift keying), and it has a bandwidth 1,2288 MHz. The number of available channels, respectively, as well 1,2288 MHz/ (9,6 kHz)=64. That is, a direct link IS-95/IS-95A allows the separation channels using 64 Walsh codes.

As stated above, the number of available orthogonal codes depends on the used modulation method and minimal data transfer rate. However, in order to improve in the near future performance of mobile communication systems with mdcr, it is necessary to increase the number of channels assigned to the users. With this purpose in future mobile communication systems mdcr need to increase bandwidth for traffic channels, pilot channels and control channels.

Currently, however, the number of orthogonal codes that can be used in the improved system, is limited. Therefore, any increase in bandwidth will be limited by the number of available orthogonal codes. To solve the problem, n is regonalnye codes and would have a variable data rate.

The invention

The aim of the present invention is to provide a device and method of making masks quasiorthogonal codes to generate the Quaternary complex quasiorthogonal codes that have the lowest reciprocal influence on the orthogonal codes used in the communication system mdcr.

Another objective of the present invention is to provide a device and method of manufacture quasiorthogonal codes for channel separation using masks quasiorthogonal codes and orthogonal Walsh codes in a communication system mdcr with CBM (Quaternary basic manipulation).

Another objective of the present invention is to provide a device and method expansion channel signals using the Quaternary complex quasiorthogonal codes in the communication system mdcr.

Another objective of the present invention is to provide a device and method of making masks quasiorthogonal codes to generate the Quaternary complex quasiorthogonal codes, select one of the masks quasiorthogonal codes to develop quasiorthogonal codes and extensions of the channel signals that will be transmitted from ispalette, the way we produce the Quaternary complex quasiorthogonal code in the communication system mdcr contains stages, whereby to produce an M-sequence and a specific sequence having the same length and have good properties full correlation with the M-sequence, produce masks candidates by permutation of the columns (using the same technique that the permutation of the columns, which provide conversion of the M-sequence code Walsh) specific sequences produce representatives quasiorthogonal codes by work operations on masks candidates and Walsh codes, which have the same length as the mask candidate and choose quasiorthogonal code satisfying the partial correlation with the Walsh codes, developed from representatives quasiorthogonal codes, and choose the mask related to the development of selected quasiorthogonal code.

In another embodiment of the present invention, channel transmitter for a communication system mdcr contains a Converter integrated signal to convert the channel encoded signal into a complex signal generator comprising moonling code by work operations on the mask Quaternary complex quasiorthogonal code code Walsh, channel expander for generating channel enhanced signal by the work operations on the converted complex signal and the Quaternary complex quasiorthogonal code, and part PSH-dropout (PSH - pseudotumour) to generate PN-masked channel signal by work operations on channel advanced integrated signal and the complex PN sequence.

List of figures

The invention is disclosed with reference to the accompanying drawings, in which:

Fig. 1 - scheme of the separation channels using orthogonal codes in a communication system mdcr;

Fig.2 is a schematic partial correlation between the Walsh code and quasiorthogonal code;

Fig. 3 - scheme of the matrix Q for masks candidate quasiorthogonal code, which are used in making the Quaternary complex quasiorthogonal codes, according to a variant implementation of the present invention;

Fig.4 - scheme of the matrix Q' for candidates Quaternary complex quasiorthogonal code generated by the work operations on masks candidates for quasiorthogonal codes and orthogonal Walsh codes according to a variant implementation navalnogo code according to a variant implementation of the present invention;

Fig. 6 is a diagram of the separation channel using orthogonal Walsh codes and quasiorthogonal codes in the communication system mdcr, according to a variant implementation of the present invention;

Fig. 7 is a structural diagram of the device of the extension channel, which uses the Quaternary complex quasiorthogonal codes, in the communication system mdcr, according to a variant implementation of the present invention;

Fig.8 is a structural diagram parts (719) expansion and PSH-masking (Fig. 7) for the Quaternary complex quasiorthogonal codes;

Fig. 9 - comparison circuit complex expressions for the Quaternary numbers and complex expression for signal transmission in the system on the complex plane;

Fig. 10 is a structural diagram of the alternator (715) Quaternary complex quasiorthogonal codes (Fig. 7), which generates a mask quasiorthogonal codes in the quadruple digits, shown in the table. 9; and

Fig.11 is a structural diagram of the alternator (715) Quaternary complex quasiorthogonal codes (Fig.7), which generates a mask quasiorthogonal codes when the values of I and Q, shown in the table. 43.

The preferred option osushestvleniya drawings. Well-known functions or constructions are not described in detail in the description below, as they complicate the description of the invention insignificant details.

The aim of the invention is to develop quasiorthogonal codes that have the lowest reciprocal influence on the orthogonal codes in order to increase channel capacity or to maximize throughput single cell in the communication system mdcr by increasing networking code.

Quasiorthogonal sequence can be produced from Kasami sequences, sequences, gold sequences and Kerdock. These sequences have a common feature which is that the sequence can be expressed as the sum of sequences with good (or high) the property of correlation between PN-sequences and sequences. For this reason, the above sequence can be used when developing quasiorthogonal codes. Walsh codes can be obtained by performing a permutation of columns for PN-sequences. If the sequence, which consists of the sum of certain posledovatelnosti columns for specific sequences, the sequence with interchanged columns will support good property correlation with the Walsh code. That is, since the two sequences having good property correlation, equally were subjected to permutation of columns, then a good property correlation may remain constant along the length of the sequences. The sequence remaining after exclusion of PN sequences of the two sequences can be represented as a collection of masks candidate for quasiorthogonal code, which will be described below. When this sequence is presented in the form of a family of masks candidate for quasiorthogonal code, the full correlation property is satisfactory.

Below is a detailed description of procedures for integrated quasiorthogonal codes using the Kerdock sequences (i.e. sequences of the family A), of the sequences with the above feature.

Comprehensive quasiorthogonal codes must satisfy the following conditions corresponding to the expressions (1) to(3).

< / BR>
< / BR>
< / BR>
In addition, it is preferable that the complex orthogona the M-1 and

In expressions (1) to(4) Wk(t) denotes the k-th sequence of orthogonal Walsh code of length N (1kN) and Si(t) denotes the i-th complex quasiorthogonal code of length N (1iN), where X denotes the number quasiorthogonal codes satisfying the conditions 1-3 and partially satisfying the condition 4. Condition 1 corresponding to the expression (1), means that the full correlation between the k-th orthogonal code Wk(t) (1kN, 1tN) and i-m quasiorthogonal code Si(t) (1iN, 1tN) must not exceedmin(N). Condition 2, corresponding to the expression (2), means that the full correlation between the i-th row and i-th row quasiorthogonal code must not exceedmin(N). Condition 3, corresponding to the expression (3) means that the partial correlation should not exceed

< / BR>
when a partial correlation is the appropriate parts

< / BR>
obtained by dividing by M the length N of the k-th row of the orthogonal code and the i-th row quasiorthogonal code, where M=2m, M=0, 1, ..., log2N

In this case, condition 1 in the expression (1) represents the ability of the full correlation of orthogonal Walsh code and the Quaternary complex quasiorthogonal code and means the minimum value is absolutego correlation values with orthogonal Walsh code, where N is the length of the code.

Condition 2 in the expression (2) represents the condition for the full correlation between the Quaternary complex quasiorthogonal codes. Condition 3 in the expression (3) is the partial correlation between the orthogonal Walsh code and the Quaternary complex quasiorthogonal code. Condition (4) expression (4) represents the ability of the partial correlation between the Quaternary complex quasiorthogonal codes.

In Fig.2 presents a diagram which explains a method for finding the partial correlation between the Quaternary complex quasiorthogonal code and orthogonal Walsh code for M=2a(0log2N). If in the course of servicing the data transfer speed increases, the transmitted part of N/M orthogonal code. At this point in time, the partial correlation satisfies the property correlation, for example, in table. 1 shows the values of the

< / BR>
when N= 256. Condition 4 is a partial correlation between quasiorthogonal codes, and values

< / BR>
properties of correlation are identical to the values that satisfy the condition 3.

In General, the results table.1 can be the m code and quasiorthogonal code is calculated as half of the full length, called length 512, and the boundary of the partial correlation from it equal to the bordermin(N) the full correlation with length 512. In table.2 shows the relationship between length N and minimum value of min(N) correlation.

Sequence satisfying the conditions 1 and 2, include a Kasami sequence, a sequence Golda and sequence Kerdock. That is, all these families of sequences have good cross-correlation property. The property of complete correlation for the above families of sequences is well known.

However, studies related to obtaining a sequence satisfying the condition 3 was not performed. Standard IS-95/IS-95B or promising system mdcr is very important to support variable data rates, satisfying the condition 3.

Full correlation of the above sequences is equal tom+1for length L=22m+1(i.e., length equal to the number 2, which is an odd number). So the sequence does not have the best correlation for length L=22m+1. In this case, L represents the length of the sequence.

The present invention provides the correlation becomes equal to length L=22m+1and run the above conditions. In the variant example of implementation, the Kerdock sequences used to generate the Quaternary complex quasiorthogonal codes.

In Fig.5 shows the process for establishing the Quaternary complex quasiorthogonal codes that are used in the expansion unit for a communication system mdcr, according to a variant implementation of the present invention. In this case, the Walsh code can be obtained from the M-sequence. That is, the orthogonal Walsh code generated by permutation of the columns of the M-sequence.

As shown in Fig.5, in step 511 to generate quasiorthogonal code form an M-sequence and a specific sequence, with a good full correlation property. In the embodiment of the present invention, the collection And that is a set of Kerdock codes produced from the Kerdock codes, expressed in Quaternary numbers used to generate complex sequences for the above-mentioned sequences.

At this stage there is a homomorphism H: corresponding to the set of complex numbers to perform the operation "modulo 4" (here is the idea of complex numbers. Therefore, after forming the Quaternary sequences generated Quaternary sequence will be subjected to the conversion in accordance with the homomorphism.

Using the tracking function, a binary M-sequence S(t) can be expressed in the form

S(t) = tr(A....) (5)

-primary polynomial of GF(2m), and is the primary element that is the root of the function f(x). (See "Introduction to finite fields and their applications", Rudolf Lidl and Harald, Niederreiter ("Introduction to Finite Fields and Their Applications", Rudolf Lidi & Harald Niederreiter))

Functional significance of the above binary formulas are 0 and 1, and similarly to produce the Quaternary sequence using the tracking function.

First, at step 511 (Fig.5) choose a primary binary polynomial f(x) of degree m to obtain sequence quasiorthogonal codes of length 2m. The characteristic polynomial g(x) with the Quaternary coefficients, generated using the "lifting" of Hensel to primary binary polynomial f(x), as shown in the expression (6). (See B. R. McDonald, "Finite rings with identity" ("Finite Rings with Identity", B. R. MacDonald)).

g(x2)=(-1)mf(x)f (x) mod 4.... (6)
the GDS is the root of g(x), = mod 2. Setting the element and the ring GR(4m) Galois can be expressed in the form a = +2, , l. The monitoring function that is a linear function in the Galois ring is expressed in the form of a Look So Helices and P. C. Kumar, Sequences with low correlation" ("Sequences with Low Correlation", T. Helleseth and P. V. Kumar)).

To obtain the Quaternary sequence S(t) with length N=2m-1the above formula is expressed as the following expression (7), which is the General formula Kerdock code, using and expression tracking.

< / BR>
where 2T(t) is equal to the value obtained by doubling a binary M-sequence and the further implementation of the above operations mod 4. In the embodiment, this part of the sequence will be treated as a quadruple M-sequence. The Quaternary M-sequence can be calculated by substituting 0 or i(0i22m-2instead and insert a 0 in the first column. Therefore, at step 511, the sequence Si(t) = T(t+i) with length 2m-1, where t=0,1,...,2m-2 and Quaternary M-sequence 2T(t) that dual binary M-sequences are generated for each i(0i22m-2). This is the process of designing codes Cardiozone M-sequence code in Walsh. Function permutation of the columns of the M-sequence is applied to a specific sequence to produce a mask to produce quasiorthogonal code. That is, at step 513, if = mod 2 and =m(t) = tr(a(t+)and function permutation of columns is defined as follows (the definition of a permutation of columns for Kerdock code:

:{0,1,2,..., 2m-2}{1,2,..., 2m-1}

< / BR>
You can develop (2m-1) the Quaternary complex sequences of length 2mthat satisfy the conditions 1 and 2, by inserting "0" into the first element of the sequence T(tof length 2m-1 the expression (7) and substitutioni(0i22m-2) instead . Therefore, when =ithe sequence for T(t) will be presented below in the form of Si(t) in the expression (8). In this case, Si(t) becomes a function of the specific sequence and can be expressed as

< / BR>
where t=*, 0,1,2,...,2m-2 and Si(*)=0.

Then, at step 515 receives the matrix Q (Fig.3) using sequences of the completed set To the expression (8). The matrix has (2m-1)*2mrows and 2mcolumns. That is, at step 515, using (2m-1) posledice first element of the sequence Si(t)):

[di(t)|t = 1,2,..., 2m, i = 1,2,..., 2m-1]

< / BR>
in this case, you can get (2m-1) sequences of length 2mthat satisfy conditions 1 and 2, using a permutation of the columns in the matrix Q using the same technique as with the permutation of the columns of the M-sequence to obtain a Walsh code. Therefore, at step 517, Si(t) in the expression (7) is subjected to a permutation of the columns using the same technique that was used in step 513. That is, at step 517 sequence generated at step 515, represent the columns prestavlenye in accordance with the function permutation of columns computed in step 513. Then, at step 517, produces a new sequence in the following form (the process of permutation of columns):

[ei(t)|t = 1,2,..., 2m, i = 1,2,..., 2m-1]

< / BR>
Sequence ei(t), which is produced at step 517, called the sequence of masks quasiorthogonal candidate.

Next, at step 519, a different pattern masks quasiorthogonal candidate satisfying the conditions 1 and 2, is produced by the modulo 4 of the above sequence mask quasiorthogonal candidate and code Waynem sequences produced at step 517, as follows (generation of candidate quasiorthogonal code):

[Sij(t)|t = 1,2,..., 2m]

Sij(t)=ei(t)+2Wj(t)(mod 4), i=0,1,2,...,2m-2, j=0,1,...,2m-1.

In this case, it is assumed that [Wj(t)|t = 1,2,..., 2m, j = 0,1,..., 2m-1] means the Walsh sequence that is orthogonal code and expressed in symbols "0" and "1". In the above formula ei(t) is a T(tfrom expression (7), which is the column rearranged in accordance with the formula permutation of the columns that you specified in step 513. Therefore, we can obtain (2m-l)*2mcandidates quasiorthogonal codes by step 519.

Then, at step 521, the sequence satisfying the condition 3, is chosen from (2m-1)*2mcandidates in the orthogonal codes and then used a mask candidate for quasiorthogonal code is chosen as the mask for quasiorthogonal code. That is, after the process is completed (step 519), finally calculated representatives of Sij(t) quasiorthogonal codes choose the codes that satisfy the condition 3. To select sequences, the first if condition 3, and the mask candidate is chosen as the mask when the partial correlation is performed for each Walsh code.

For example, when the length of the orthogonal code is equal to 128, first calculate the partial correlation between the orthogonal codes and the candidate quasiorthogonal code for each Walsh code having a partial length of 64, and then checks whether the partial correlation value is 8. If the partial correlation does not exceed 8, used a mask candidate, which is used to generate candidate quasiorthogonal code, do not choose as a mask. On the other hand, if the condition is true, then again calculate the partial correlation for the partial length 32 with this in mind, candidate quasiorthogonal code. Then determine whether the partial correlation partial correlation does not exceed the mask candidate not elected as a mask. On the other hand, if the condition is met, make the same operation for the next length. After performing the above steps for the partial lengths up to 4, mask-candidates who have satisfied the above conditions are chosen as masks candidate quasiorthogonal codes, deletevaluekey candidates Quaternary quasiorthogonal codes.

In this case, it is assumed that f(x)=x3+x+1 is used for the primary binary polynomial. When primary binary polynomial subject to "rise" of Hensel in accordance with the expression (6), the characteristic polynomial having the Quaternary coefficients takes the form g(x2)=(-13)(x3+x+1)(-x3-x+1) (mod 4). It can be rewritten in the form g(x)=x3+22+x+3.

Accordingly, at step 511, it is assumed that the root of g(x) will be equal in order to determine the specific sequence. That is, For convenience ,2,3,4,5,6and7will be determined first as follows:

=

2=2< / BR>
3= 22+3+1

4= 23+32+ = 2(22+3+1)+32+ = 32+3+2

5= 33+32+2 = 3(22+3+1)+32+2 =2+3+3

6=3+32+3 = (22+3+1)+32+3 = 2+2+1

7=3+22+ = (22+3+1)+22+ = 1

When == 1, T(t) = T(t) will be determined as follows.

< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
< / BR>
In addition, when =1= , T(t) = T(t) will be determined as follows. Then, T()=T (1) for t=7) = T(1) for t= 6, which is equivalent to the shift on one of the sequences defined when

A similar method can be used to determine the Quaternary sequence 3221211 and its consistency with the shift. The sequence shifted i times will be treated as Si. In addition, you can define 1001011 as the associated M-sequence.

At step 513 is possible to calculate the function permutation of columns to convert the M-sequence code in Walsh in accordance with the formula.

< / BR>
using M-sequence 1001011. In this case, formula (t) is equivalent to grouping the M-sequence three (3) consecutive members and convert them into decimal numbers. That is, the first three members 100 are converted into a decimal number 4, the second three member 001 converted to decimal 1, three third member 010 converted to the decimal number 2, the fourth three members 101 are converted to the decimal number 5, the fifth three members 011 converted to a decimal number 3, three sixth member 111 is converted to a decimal number 7, and the seventh three members 110 are converted into a decimal number 6. The following results can be obtained with use is shown in table.3A.

At step 515, "0" add the first element of each Quaternary sequence determined at step 511. When considering the expression di(t) in accordance with Si(t) if i=0, d0(t) is the Quaternary sequence S0(t), the first element which is added to "0", which is determined at the step 511 to =0= 1. That is, when S0(0)=3, S0(1)=2, S0(2)=2, S0(3)=1, S0(4)= 2, S0(5)=1 and S0(6)=6, as determined at step 511, d0(t) is defined so that d0(0), representing the first bit is always "0" and d0(1) - d0(7) are given in table.3V.

In addition, when i= l, d1(t) is the Quaternary sequence S1(t), the first element of which added "0", which is determined at the step 511 to =1= . That is, when S1(0)=2, S1(1)=2, S1(2)=1, S1(3)=2, S1(4)= 1, S1(5)= 1 and S1(6)=3, as determined at step 511, d1(t) is defined so that d1(0), representing the first bit is always "0" and1(1)-d1(7) shown in the table.3C.

At step 517, the Quaternary sequence with the joined columns are the column interchanged with the above functions permutations>denotes the i-th column. For example, C1denotes the first column and C2the second column. If the column pristanovlena with regard to the functions of the permutation of the columns identified in step 513, the Quaternary sequence (table.3D) takes the following form.

Therefore, sequences with length 8, shown in the table.3F, are produced by adding a "0" in the first element of each sequence is determined using a permutation on the columns of Quaternary sequences with the joined columns with regard to the functions of the permutation of the columns. Generated sequences become candidates masks quasiorthogonal codes with a length of 8.

The sequence of the Quaternary quasiorthogonal codes that are generated in the process (Fig.5), are defined using the function ei(t) mask. That is, when quasiorthogonal codes generated as a function of ei(t) mask satisfies conditions 1-3, you can get (2m-1) the Quaternary complex orthogonal codes. Therefore, if there are k masks, satisfying conditions 1-3, you can get kx2mthe Quaternary complex quasiorthogonal codes. In table.4 shows a number of the Quaternary complex quasiorthogonal complex quasiorthogonal codes defined for m=6. In tables 6-8 shows the function ei(t) mask for the Quaternary complex quasiorthogonal codes defined for m=7, m=8 and m=9, respectively. In this case, 0 means 1, 1 denotes a j, 2 denotes -1 and 3 denotes a-j.

As described above, when the system lacks orthogonal codes, it is possible to increase the bandwidth by using quasiorthogonal codes, which are produced according to the present invention. In this case, there is a minimum mutual influence on orthogonal Walsh codes, which provides a fixed value of the correlation. For example, for N=64 the correlation value between quasiorthogonal code and orthogonal Walsh code is 8 or -8. In addition, for N=256 the value of the partial correlation also is 8 or -8 (with length N=64). This means that you can accurately predict the mutual influence, while providing excellent performance.

Therefore, as follows from the description of the previous process, in order to get a comprehensive quasiorthogonal code length 2mfirst choose the characteristic polynomial f(X)m. Thus, in order to get a comprehensive quasiorthogonal is to obtain a sequence with a length of 128, the characteristic polynomial must be a primary polynomial (Solomon U. Golomb Sequence for shift register (Shift Register Sequence", Solomon W. Golomb)), and in total there are 18 primary polynomial 7th degree. In table.9-26 lists the functions of masks for each complex quasiorthogonal sequence with a length of 128, satisfying conditions 1-3 for 18 primary polynomial 7th degree, respectively. In addition, in table.9-26 presents the results for the condition 4. In this case, e1+e2" is treated as a partial correlation between the first mask and the second mask, and the numbers on the right side represent the lengths of the parts, where the first and second masks to satisfy conditions 4. For example, table 9 "e1+e2: 64, 128" means that the partial correlation between quasiorthogonal codes, which are produced taking into account1and e2masks, respectively, satisfies the condition 4 only for partial lengths of 64 and 128. Similarly, "e1+f3: 32, 64, 128" means that the partial correlation between quasiorthogonal codes, which are produced, respectively, with regard to e1and e3masks, satises 4 only for partial lengths of 32, 64 and 128. So obvious I had ovulatory condition of partial correlation, increase in number. In addition, it should be noted from the following tables that the partial correlation between quasiorthogonal sequences depends on the characteristic polynomial. Therefore, it is preferable to use the characteristic polynomials that produce quasiorthogonal codes with good partial correlation between quasiorthogonal sequences.

When using masks for integrated quasiorthogonal sequences of length 128, as shown in table 9-26, you can use the ei+Wkas masks comprehensive quasiorthogonal sequences, instead of the above-mentioned functions of eithe masks. Comprehensive quasiorthogonal sequences, which are produced with the help of ei+Wkequal to the complex quasiorthogonal sequences, which are produced with the help of ei. Therefore, the number of masks that can actually use, is 128128128128= 1284the corresponding characteristic polynomials.

In this method, there are 16 primary polynomials 8th grade. In table. 27-42 presents the feature masks for each complex quasiorthogonal the placenta is responsible. In addition, when using masks for integrated quasiorthogonal sequences of length 256, you can use the ei+Wkas masks comprehensive quasiorthogonal sequences, instead of the above functions eithe masks. At this stage, a comprehensive quasiorthogonal sequence, generated with the help of ei+Wkequal to the complex quasiorthogonal sequences, generated with the help of ei. Therefore, the number of masks that can actually use, is 256256256256=2564for the corresponding characteristic polynomials.

Mask values are given in table.27-42, expressed in Quaternary numbers. In addition, the values of the Quaternary masks, are presented in table.27-42, can be expressed in the form of complex numbers, in which "0" is "1", "1" represents "j", "2" is "-1" and "3" represents "-j". Therefore, it should be noted that complex numbers can be expressed using 1, j, -1 and-j. However, in the communication system IS-95 mdcr complex numbers are expressed is indeed using "1+j", "-1+1", "-1-j" and "1-j".

In Fig. 9 presents the comparison of complex expressions for the Quaternary numbers in the left part and the complex expression is to mask values in complex expressions, used in the real system "1+j" is passed to "0", "-1+j" to "1", "-1-j" for "2" and "1-j" to "3". This ratio is equivalent to turning the Quaternary complex expressions with values 1, j, -1 and-j 45oand can be obtained by multiplying the Quaternary complex expression "1+j". Using the above ratio, the values of the Quaternary masks can be converted into a complex expression "1+j", "-1+1", "-1-j", "1-j", and they can be divided into a real part I and imaginary part q of the Table.43 and 44 Express the value of the masks (tables 38 and 23) in hexadecimal values divided by the real part I and imaginary part q. In particular, table. 38 and 23 show a good property of partial correlation conditions for 4 full lengths of 256 and 128, respectively.

The above-mentioned Quaternary complex orthogonal codes can be used for each line in the system mdcr using orthogonal Walsh codes. When the Quaternary complex quasiorthogonal codes are used in conjunction with orthogonal codes may be considered the following three options.

Option 1

In a system using orthogonal Walsh codes and providing service at a variable speed, Perea length. In addition, you can use every sequence of the Quaternary complex quasiorthogonal codes at full length.

Option 2

One of the groups of orthogonal Walsh codes and groups of the Quaternary complex quasiorthogonal codes choose to create two orthogonal sets and two groups at the same time can provide service with a variable data rate.

Option 3

You can use the group of orthogonal Walsh codes and each group of the Quaternary complex quasiorthogonal codes as a group, allowing you to keep each group of codes variable data rate. In this case, you may experience arbitrary code characteristics between groups of the Quaternary complex quasiorthogonal codes.

It is preferable to use Quaternary complex quasiorthogonal codes for the types of application addressing the above three options. In General, when only uses Walsh codes, modulating party makes an exchange of a predetermined number of orthogonal codes with demobilise party. Therefore, when using the orthogonal code is tion of the number of orthogonal codes and the number of groups (i.e., the index i Q' matrix ei(t) (Fig.4)). In this case, the group of orthogonal codes is defined as group 0, and then the number of groups re-define up to 2m-1.

Below is a description of the application group, the Quaternary complex quasiorthogonal codes in the system for maintaining a variable speed transmission of data, like the group of orthogonal codes. Group member Quaternary complex quasiorthogonal code consists of the number of Walsh, corresponding to the number of orthogonal code and mask the Quaternary complex quasiorthogonal codes corresponding to the number of groups. The number of groups indicatesi(t) is selected in Fig.4. For maintenance variable speed data transmission using the Quaternary complex quasiorthogonal codes, pre-allocated number of orthogonal codes is used as the number of orthogonal Walsh codes and then allocated ei(t) add to it each length N. At this stage, when the signals are expressed by "0" and "1", perform the addition, and when the signal is expressed by a "1" and "-1" is multiplied.

In Fig. 6 shows how the separation channel using orthogonal Walsh codes and the Quaternary compoglass variant implementation of the present invention. In Fig. 6 presents an implementation option, in which the channels that can be assigned orthogonal Walsh codes are used by the same method as in the is-95, and the Quaternary complex quasiorthogonal codes are used to increase bandwidth. However, you can also assign orthogonal Walsh codes shared channels and assign the remaining orthogonal Walsh codes and the Quaternary complex quasiorthogonal codes channels of traffic. In this case, the traffic channels are considered as dedicated channels. In addition, although Fig.6 shows an implementation option, which uses the Quaternary complex quasiorthogonal codes of length 256, if necessary, the Quaternary complex quasiorthogonal codes can be changed in length.

In Fig.6 orthogonal Walsh codes represented by Wi(where i=0,1,. . . ,63), and the corresponding channels are separated by a previously allocated a unique orthogonal codes. In addition, in Fig.6 Quaternary complex quasiorthogonal codes represented by Sj (where j=0,1,...,255) and the assigned traffic channels. As shown in the drawing, a straight line IS-95/IS-95A can be divided into 64 channels using orthogonal to the ranks complex quasiorthogonal codes. Therefore, it is possible to expand the channels five times through the use of orthogonal Walsh codes and the Quaternary complex quasiorthogonal codes.

In Fig.7 shows a transmitter for a mobile communication system, which includes the extender, which uses orthogonal Walsh codes and the Quaternary complex quasiorthogonal codes, according to a variant implementation of the present invention. Unlike system IS-95, the mobile communication system (Fig. 7) includes a channel transmitter, which uses the Quaternary complex quasiorthogonal codes codes for channel expansion.

As shown in Fig.7, the transmitter 710 integrated signals converts the input stream of data bits into complex signals and divides the complex signal is a valid signal Xiand imaginary signal Xq. The first and second signal converters (or signal Converter) 711 and 713 transform streamsiand Xqbit complex data, which are output from the transducer 710 integrated signals, respectively. More specifically, the first inverter 711 converts signals input stream Xibit by converting the bit "0" to "+1" is x codes. The second inverter 713 converts signals input streamqbit by converting the bit "0" to "+1" and bit "1" to "-1", and demultiplexers converted signal in part 719 extension isopropyl alcohol masking orthogonal codes.

Generator 715 Quaternary complex quasiorthogonal codes indices Quaternary complex quasiorthogonal codes and indexes orthogonal Walsh codes and produces a comprehensive quasiorthogonal codes QOFi and QOFq. Generator 715 Quaternary complex quasiorthogonal codes saves masks quasiorthogonal codes that are produced and selected in the process (Fig. 5), and selects the mask corresponding to the index of the Quaternary complex quasiorthogonal code. In addition, the generator 715 Quaternary complex quasiorthogonal codes includes generator orthogonal Walsh codes for the generation of orthogonal Walsh code corresponding to the index of the orthogonal Walsh codes. After that, the generator 715 Quaternary complex quasiorthogonal code uses the selected mask quasiorthogonal codes and orthogonal Walsh code to generate integrated quasiorthogonal codes QOFi and QOFq.

Generatedon in part 719 of expansion and PSH-masking orthogonal codes. Part 719 expansion and PSH-masking orthogonal codes produces the expansion of the signals received from inverters 711 and 713 of the first and second signals, by multiplying the output signals on the Quaternary complex quasiorthogonal codes QOFi and QOFq and then produces PSH-advanced masking of signals by multiplying the extended signal on the real and imaginary PN codes PNi and PNq, thus producing output signals Yi and Yq. Filter 721 baseband filters on the main strip extended signals Yi and Yq, which are derived from part 719 expansion and PSH-masking orthogonal codes. Block 732 shift in frequency converts the signal, which is output from the filter 721 main band of frequencies in the RF (radio frequency) signal.

In Fig. 8 shows part 719 expansion and PSH-masking of the channel (Fig. 7), which performs the expansion of channels using the Quaternary complex quasiorthogonal codes QOFi and QOFq and performs PSH-masking using complex PN codes PNi and PNq.

As shown in Fig.8, the expander 811 performs the complex multiplication of the channel signals Xi and Xq in the Quaternary complex quasiorthogonal codes QOFi and QOFq, nootkatone were expanded using the Quaternary complex quasiorthogonal codes as a result we have (Xi+jXq)*(QOFi+jQOFq). The multiplier 813 complex numbers produces a multiplication of the extended signals di and dq, which come from the extender 811, PN codes PNi and PNq to obtain PN-masked signals Yi and Yq. The output signals of the multiplier 813 complex numbers take the form Yi+jYq= (di+jdq)*(PNi+jPNq). The multiplier 813 performs complex numbers complex PSH-masking.

In Fig.10 and 11 presents the generator 715 Quaternary complex quasiorthogonal codes (Fig.7), according to other variants of implementation of the present invention. Generator 715 Quaternary complex quasiorthogonal codes can be performed in various ways depending on the structure of the mask. That is, the generator 715 Quaternary complex quasiorthogonal codes are different images to construct, depending on whether the generated output mask with the Quaternary values i and q components or with components of the sign and direction. In Fig.10 presents the generator 715 Quaternary complex quasiorthogonal codes, which produces a mask quasiorthogonal codes when the Quaternary values (table. 9), and Fig.11 presents the generator 715 Quaternary complex quasiorthogonal codna Fig.10, after taking the index of the Quaternary quasiorthogonal code generator 1000 Quaternary quasiorthogonal masks produces Quaternary quasiorthogonal mask with the index of the Quaternary quasiorthogonal code. Generator 1000 Quaternary quasiorthogonal masks can also directly generate the mask using the index of the Quaternary quasiorthogonal code. In addition, the generator 1000 Quaternary quasiorthogonal masks can store mask Quaternary quasiorthogonal codes and selectively output the mask corresponding to the accepted index of Quaternary quasiorthogonal code. After receiving the index of the orthogonal Walsh code generator 1010 orthogonal Walsh codes produces orthogonal Walsh code with the index of the orthogonal Walsh code. At this stage of the orthogonal Walsh code is displayed with the values "0" and "1". The multiplier 1031 then performs the multiplication of the orthogonal Walsh code, which is derived from the generator 1010 orthogonal Walsh codes to "2" in order to Express the orthogonal Walsh code in the form of Quaternary numbers and to provide its output to the adder 1033. The adder 1033 then performs the addition of the mask Quaternary quasiorthogonal code, which is raised from the multiplier 1031. At this point, the adder 1033 performs the Quaternary addition to the two input signals, since these two input signal are Quaternary signals. Converter 1020 signals, receive signals, which are output from the adder 1033, converts the Quaternary quasiorthogonal code in the Quaternary complex quasiorthogonal code by converting a "0" to "1+j", "1" "-1+j", "2" "- 1-j" and "3" to "1-j", and then take the real part as I signal QOFi and imaginary part in the form of a Q signal QOFq.

As shown in Fig.11, after receiving the index of the Quaternary quasiorthogonal code generator 1100 mask of the I-component and the generator 1105 mask Q-sostavlyal produce masks with I - and Q-components, which are expressed using "0" and "1" correspond to the index of the Quaternary quasiorthogonal code, respectively. Masks with I - and Q-components, which are derived from the generator 1100 and 1105 masks, served in the adders 1133 and 1135, respectively. In addition, after receiving the index of the orthogonal Walsh code generator 1110 orthogonal Walsh codes produces orthogonal Walsh code corresponding to the index of the orthogonal Walsh code, and supply the generated orthogonal Walsh code in the amount of what I produce quasiorthogonal code with the I-component, and the adder 1135 performs the addition of the mask Q-component and the orthogonal Walsh code to generate quasiorthogonal code with Q-component.

As described above, a variant of implementation of the present invention allows to produce the Quaternary complex quasiorthogonal codes for the least mutual influence on orthogonal codes. In addition, you can expand the capacity of the channel without limiting the number of orthogonal codes through the use of the Quaternary complex quasiorthogonal codes in a mobile communication system, which performs the separation channel using orthogonal codes.

1. The way we produce the Quaternary complex quasiorthogonal code in the communication system, multiple access, code division (mdcr) containing phases, which generates an M-sequence and produce a specific sequence, with the square root of the full length as the boundary of the full correlation with the M-sequence, produce masks candidates by permutation of the columns of specific sequences in the same way as when the permutation of the columns, which converts the M-sequence code Wally Walsh codes, which have the same length as the mask-candidates choose quasiorthogonal code satisfying the partial correlation with the Walsh codes, developed from representatives quasiorthogonal codes, and choose the mask related to the development of selected quasiorthogonal code.

2. The method according to p. 1, in which the specific sequence is a sequence of Kerdock, for producing masks the Quaternary complex quasiorthogonal code.

3. The method according to p. 2, in which the stage of generating the mask candidate contains stages, which produce a shift in a specific sequence to generate at least two different specific sequences, and perform a permutation of columns for a specific sequence and shifted specific sequences using permutation of columns for the production of masks candidates.

4. The method according to p. 3, in which the phase shift specific sequence contains a step at which generate insert 0 in the initial element of two different specific sequences.

5. The method according to p. 2, according to which the function permutation of columns is: { 0,1,2, . . . , 2m-2} --> what Deedat Quaternary quasiorthogonal code is chosen as the mask Quaternary complex quasiorthogonal code in case when the correlation value for the respective parts with a length of N/M, where N is the total length of the candidate Quaternary complex quasiorthogonal code and orthogonal Walsh code, does not exceed

< / BR>
where M= 2m, m= 0,1, . . . log2N

7. The method according to p. 6, in which the step of selecting the mask further comprises the step at which retain the mask to generate candidate Quaternary quasiorthogonal code as a mask, the Quaternary complex quasiorthogonal code in the case where the correlation value for the respective parts with a length of N/M, where N is the total length of the candidate Quaternary complex quasiorthogonal code generated with the selected mask, and other Quaternary complex quasiorthogonal code, does not exceed

< / BR>
where M= 2m, m= 0,1, . . . log2N

8. Channel transmitting device for communication systems mdcr containing Converter integrated signal to convert the channel encoded signal into a complex signal generator Quaternary complex quasiorthogonal code to generate the Quaternary complex quasiorthogonal code by processing the mask Quaternary complex quasioptimality converted complex signal in the Quaternary complex quasiorthogonal code and part of PSH (pseudotumour) masking to generate PN-masked channel signals through the expansion channel advanced integrated signal and the complex PN sequence, respectively.

9. Channel transmitting device under item 8, in which the generator of the Quaternary complex quasiorthogonal contains codes generator Quaternary quasiorthogonal code for generating mask Quaternary quasiorthogonal code assigned index code generator orthogonal Walsh code to generate Walsh code assigned to the index of the orthogonal Walsh code, and an adder for producing the Quaternary quasiorthogonal code by adding masks Quaternary quasiorthogonal this code and orthogonal Walsh code.

10. Channel transmitting device under item 9, further containing an adder for converting the orthogonal Walsh code in the Quaternary number by connecting to the generator output orthogonal Walsh code.

11. Channel transmitting device under item 9, in which the generator Quaternary quasiorthogonal code contains a table of masks Quaternary quasiorthogonal by p. 11, in which the generator Quaternary quasiorthogonal code provides the output mask Quaternary quasiorthogonal code corresponding to the code index in the table of masks presented in the following form (see graphic part).

13. Channel transmitting device according to p. 11 or 12, in which the signal Converter converts the signal "0" to "1+j", the signal "1" to "-1+J", the signal "2" "- 1-j" and the signal "3" "1-j".

14. Channel transmitting device under item 8, in which the generator of the Quaternary complex quasiorthogonal contains codes generator mask 1-component, corresponding to the assigned index code generator mask Q-component for the respective sampling mask Quaternary quasiorthogonal code with Q-component of the corresponding assigned index code generator orthogonal Walsh code to generate orthogonal Walsh code assigned to the index of the orthogonal Walsh code, and an adder for respective generation Quaternary quasiorthogonal codes with 1 - and Q-components through appropriate execution of operations on masks Quaternary quasiorthogonal codes with 1 - and Q-components and orthogonal Walsh code.

15. Kahn and Quaternary quasiorthogonal codes with 1 - and Q-components, as shown in the following table and correspond to the index code, and selects the mask Quaternary quasiorthogonal codes with 1 - and Q-components, which correspond to the assigned index code (see graphic part).

16. Channel transmitting device according to p. 14, in which the generator Quaternary quasiorthogonal code contains masks for the Quaternary quasiorthogonal codes with 1 - and Q-components, which are listed in the following table and correspond to the index code, and selects the mask Quaternary quasiorthogonal code with 1 - and Q-components, which correspond to the assigned index code (see graphic part).

17. The device for producing the Quaternary complex quasiorthogonal code, designed to channel transmitting device in the communication system mdcr that extends channel signal, using the Quaternary complex quasiorthogonal code containing the mask generator Quaternary quasiorthogonal code for generating mask Quaternary quasiorthogonal code corresponding to the index assigned code generator orthogonal Walsh code to generate orthogonal Walsh code corresponding to the index assigned orthogonal to the Finance over the mask Quaternary quasiorthogonal code and orthogonal Walsh code.

18. The device for producing the Quaternary complex quasiorthogonal code, designed to channel transmitting device in the communication system mdcr that extends channel signal, using the Quaternary complex quasiorthogonal code containing the mask generator 1-component for generating mask Quaternary quasiorthogonal code with 1-component corresponding to the index assigned code generator mask Q-component for generating mask Quaternary quasiorthogonal code with Q-component of the corresponding index assigned code generator orthogonal Walsh code to generate orthogonal Walsh code corresponding to the index assigned orthogonal Walsh code, and an adder for respective generation Quaternary quasiorthogonal codes with 1 - and Q-components by adding masks Quaternary quasiorthogonal codes with 1 - and Q-components and orthogonal Walsh code.

19. Way channel of transmission for the communication system mdcr containing phases, which produce a mask Quaternary quasiorthogonal code corresponding to the index assigned to code, develop the Quaternary complex quasiorthogonal code is live channel extended signal by extending the converted complex signal in the Quaternary complex quasiorthogonal codes and produce PN-masked channel signals using the extended channel complex signals and complex PN sequence.

20. The way we produce the Quaternary complex quasiorthogonal codes for channel transmitting device in the communication system mdcr that extends channel signal using the Quaternary complex quasiorthogonal code containing phases, which produce a mask Quaternary quasiorthogonal code corresponding to the index assigned to code, develop a Walsh code corresponding to the index assigned orthogonal Walsh code, and produce the Quaternary quasiorthogonal code by summing mask Quaternary quasiorthogonal code and orthogonal Walsh code.

21. The way we produce the Quaternary complex quasiorthogonal codes for channel transmitting device in the communication system mdcr that extends channel signal using the Quaternary complex quasiorthogonal code containing phases, which produce masks Quaternary quasiorthogonal codes with 1 - and Q-components corresponding to the index assigned to code, develop a Walsh code corresponding to the leaves by summing masks Quaternary quasiorthogonal codes with 1 - and Q-components and orthogonal Walsh code.

Priority points:

08.09.1998 on PP. 1-8, 19 and 20;

09.12.1998 on PP. 9, 18 and 24

 

Same patents:

The invention relates to digital communication systems in which data is variable speed transmitted without the indication of speed transmission data and received in a coherent receiver, in which the transfer rate of data transferred is determined for use in data processing

The invention relates to the field of generation scramblers codes in mobile communication system

The invention relates to communication systems, multiple access, code-division multiplexing, and more particularly to a device and method for communication control in selected time intervals

The invention relates to telecommunication systems

The invention relates to a device and method channel expansion for communication systems, multiple access, code-division multiplexing (mdcr) having different coefficients of expansion of the spectrum

The invention relates to the field of communications, in particular to an improved communication system in which the subscriber transmits data with variable speed on a dedicated channel traffic

FIELD: radio engineering.

SUBSTANCE: suggested algorithm for quasi-coherent receipt of multi-beam signal with continuous pilot signal is based on algorithm, adaptive to freeze frequencies, for estimation of complex skirting curve, which uses both pilot and information signal. Use of information symbols for estimation of complex skirting curve allows, with weak pilot signal, to substantially increase precision of estimation of said curve and, as a result, significantly decrease possible error of information parameters estimation.

EFFECT: higher interference resistance.

2 cl, 10 dwg

FIELD: communication systems.

SUBSTANCE: device has block for synchronizing clock speeds, input displacement register, commutator, intermediate storage register, memory block, comparison block, threshold block, record control block, count displacement register, reading control block, synchronization signals forming block, commutator, interference level measuring device, additional memory block, channels counter, communication channel.

EFFECT: higher interference resistance.

1 dwg

FIELD: radio engineering.

SUBSTANCE: implementation of soft decisions generating method in case of receiving multi-beam signal allows substantial decrease of complication level of receiver, because it contains lesser amount of one-beam receivers, than a prototype.

EFFECT: increased interference resistance and increased capacity of communications system during receiving of multiple-beam signal due to efficient periodic procedure of renewal of multiple-beam signal components when receiving estimates of components search, also considering mutual influence of signal components.

6 cl, 13 dwg

FIELD: transmission of information, applicable in cellular and satellite communication systems.

SUBSTANCE: the receiver has two frequency converters, two quadrature correlators, phase error filter, controlled oscillator, two control elements, error delay filter, controlled clock oscillator, reference signal generator, two multipliers, two analog-to-digital converter, delay line, demodulator, decoder, two matched filters, phase shifter.

EFFECT: enhanced power efficiency of the communication system.

2 cl, 3 dwg

FIELD: mobile telecommunication systems.

SUBSTANCE: base station receives information, pointing out presence on mobile station of information for transfer. Then, base station transmits information about state of use of physical channels and information about maximal allowed possible data transfer speed. Mobile station receives aforementioned data and transmits access header to base station to request given physical channel, determined on basis of aforementioned data.

EFFECT: higher stability, decreased number of errors during assignment of channel.

3 cl, 52 dwg, 8 tbl

FIELD: data channels in wireless communications system.

SUBSTANCE: for realization of method, base station sends request of booting protocol (BOOTP) to operation and service center, and base station receives IP-address assigned to it from response, dispatched by operation and service center, as a result of which between base station and controller of base stations, operation and service channel is set up. Problem of automatic launch of base station is also solved by this, preventing conflicts of IP-addresses and making it possible to realize parallel launch of base stations.

EFFECT: setting up of Internet-based channel for protocol over asynchronous transfer mode between base station and controller of base stations with default configuration of base station.

6 cl, 7 dwg

FIELD: radio communications; wireless-access, fixed, land mobile and satellite communication systems.

SUBSTANCE: newly introduced in prior-art code-division transmitter (IS-95 standard) are following components: orthogonal M-code generator, two (n + k) modulators, and n + k + j + 1 signal spectrum shaper in transmitter circuit; divider, second coder, multiplier, and second character compactor in each data channel; divider, second coder, and multiplier in each call channel; relevant interconnections to organize new signal-code structure and channel code multiplexing type which has made it possible to enhance spectral efficiency of communication system by more than three times.

EFFECT: enhanced data-transfer spectral efficiency of promising communication systems.

1 cl, 1 dwg

FIELD: radio communications.

SUBSTANCE: in known transmitter with code division of channels (IS-95 standard), new elements are additionally introduced, namely: transmitter circuit additionally features P orthogonal code generators, (N+K+J+1) signal spectrum generator, P channel signal adders, channel group signal adder, and each information channels features a divider, second encoder, interlacing device and second symbol compressor, each call channel features divider, second coder and interlacing device and appropriate connections between them for creation of new signal code structure and of a form of code compression of channels.

EFFECT: more than 3 times increased spectral efficiency of communication system.

5 dwg

FIELD: methods for assigning Walsh space.

SUBSTANCE: in base station and mobile stations a list of Walsh functions is contained. Walsh space pointer is transferred to point at which exactly Walsh functions from the list are used for realizing communication. Walsh space pointer is corrected according to available dynamically changing transmission power, or according to usage of Walsh functions in base station.

EFFECT: assignment of Walsh space for efficient distribution of Walsh space among different users, while minimizing usage of system resources for its distribution.

10 cl, 12 dwg, 5 tbl

FIELD: wireless mobile communication system, in particular, methods and systems for transmitting complex symbols with usage of transmission code matrix.

SUBSTANCE: in accordance to the invention, transmission code matrix is generated with usage of transformed orthogonal codes in such a way, that the code is resistant to static channel characteristics and operates efficiently both in Rician channels and in (correlated) Rayleigh channels. Also, invention provides for high speed transmission of symbols with usage of several transmitting antennas and one or more receiving antennas.

EFFECT: invention simultaneously ensures high order of diversion and high speed of symbol or data transmission.

6 cl, 3 dwg

Up!