CN1702991A - Communicating method and apparatus of multi-rate multi-carrier CDMA system - Google Patents

Abstract

In codes multiple address and speed rate communication system, the base bench sends the index marks to several user terminals. The index marks length is relative to the permitted transmission speed and together with index marks to form one code tree, wherein mother nodes and children node block each other with nodes crossed in the same step. The user terminal generates index mark matrix according to index marks and then finds the marked matrix by use of the matrix in all user terminals and to generate frequency expansion relative to different wave.

Description

The communication means and the device of many speed overloading Baudot code division of labor system

[technical field]

The invention relates to a kind of exhibition communication means frequently, and especially in regard to a kind of exhibition frequency communication means that produces spreading codes.

[background technology]

Mobile phone has promoted advancing by leaps and bounds of wireless communication technology in the application of all parts of the world and the fast development in market.The success of the present widely used second generation (2G) mobile communication system has not only influenced modern's life, has also quickened the development of third generation mobile communication system (3G).In the at present flourish third generation radio communication, more important person comprise with code division multiple access (Code Division Multiple Access, CDMA) technology be the basis CDMA2000, with the Wideband-CDMA (W-CDMA) of existing 2.5 generation GSM networking compatibilities and China's Mainland TD-SCDMA technology etc. is proposed.

Yet, people do not satisfy so-called 3G technology, along with the demand for radio communication science and technology grows with each passing day, in order to provide better service with the technology of upgrading, had the big factory in many worlds to begin the more advanced technical research of input ratio 3G, these research and development are commonly referred to as back third generation mobile communication (Beyond 3G) technology.These technology will be strengthened the 3G weak point, for example improve frequency spectrum service efficiency, increase transmission frequency range, improve transmission rate, time division duplex (Time Division Duplex, TDD), global roaming service and high service quality or the like.

For example, in the 3G system, the characteristic of two-forty and many speed rates is that 2G institute is inaccessiable.Yet for higher bit transfer capability is arranged, the mode of multicarrier modulation is suggested, and this is because multi-transceiver technology has anti-multipath attenuation and suppresses narrowband interference or the like advantage.The multicarrier modulation tech being received in the technology of CDMA, is an important ring of back third generation mobile communication.

The problem that must face is when the technology of multicarrier modulation combines with CDMA technology, how to integrate one of important key that can third generation mobile communication successful after will becoming effectively with original CDMA technology.

For instance, in base station (Base Station) is used frequently to the exhibition of a plurality of user sides (Mobile Station), in order to use a plurality of carrier waves to open up the audio data transmission simultaneously, a user need use a plurality of spreading codes with compiling and interpret data in a plurality of carrier waves.At this moment, in order to reach the transmission demand of many speed, base station will dispose the spreading codes of different length to the user of different transmission speed demands or for a plurality of spreading codes of same user's dispensing.Spreading codes for fear of these different lengths disturbs to each other, and desirable method is that all users use to each other the spreading codes at each carrier wave quadrature.Yet how configuration and spreading codes is transferred to each user effectively determines the cost of whole communication system construction.

Because the communication frequency range is of great rarity, therefore just the sizable spreading codes of data volume directly being transferred to user side at communication process will not be a cost-effective thing.Relatively,, for example store a whole code tree, then will cause the cost of integral device to promote, can't popularize effectively and be used on the market if directly store all available spreading codes forms at user side.

In sum, how to find out a kind of generation and transmission method of spreading codes, be used in the code division multiple access system of the many speed of multicarrier, just become a job that has very much value.

[summary of the invention]

Therefore, one of the object of the invention ties up in a kind of communication means that can be used in many speed, multicarrier is provided, and spreading codes can be transmitted with between the user side at base station effectively.

According to one of the present invention preferred embodiment, this kind communication means is to be used for a multi-speed CDMA communication system, and comprises the following steps at least.

At first, transmit an index tab and give user side, the length of this index tab determines a transmission rate.User side is according to this index tab construction one index tab matrix.User side then produces matrix to produce a spreading codes matrix according to this index tab matrix and, makes each row of index tab matrix correspond to one of this spreading codes matrix respective column, and each row of spreading codes matrix then correspond to a carrier wave individually.And, be the maintenance quadrature between each row of spreading codes matrix, signal interferes with each other between user side to avoid.Then, user side uses these row of spreading codes matrix, is carried on one of a plurality of carrier waves exhibition audio data respectively with decipher.

These index tabs can make code tree so that gray code sequence is real, and in other words, base station is given user side as long as transmit a Gray code, and user side just can produce corresponding index tab matrix according to this Gray code then.In the code tree construction example of Gray code, all user sides all store identical generation matrix.For the index tab matrix of different sizes, use the submatrix that produces matrix to get final product, because producing matrix, these all overlap in the same matrix.

Therefore, the present invention has following advantage at least.At first, base station can transmit spreading codes fast and give user side, and at the same time, user side also only need be deposited one and produce matrix.Secondly, via the present invention's the device that method provided, its circuit is simple, but also can support simultaneously the demand of the code division multiple address communication system of many speed, multicarrier.In addition, by the position of index tab, can judge between the index tab whether be to disturb, so base station also can distribute spreading codes effectively with effective circuit each other in code tree.

[description of drawings]

Fig. 1 is illustration one a communication system schematic diagram;

Fig. 2 is an illustration multicarrier exhibition system schematic frequently;

Fig. 3 is illustration one code tree structure;

Fig. 4 is another code tree structure of illustration;

Fig. 5 is another code tree structure of illustration;

Fig. 6 system is illustrated in the node that interferes with each other in the code tree;

Fig. 7 is the flow chart of illustration according to embodiment;

Fig. 8 is one group of gray code sequence of illustration;

Fig. 9 is the code tree of illustration with the gray code sequence construction;

Figure 10 is illustration one code tree structure;

Figure 11 is an illustration monomer circuit diagram;

Figure 12 is an illustration monomer circuit logic schematic diagram;

Figure 13 is the exemplary circuit schematic diagram;

Figure 14 is the exemplary circuit logical schematic;

Figure 15 is an illustration user end apparatus schematic diagram;

Figure 16 is an illustration base station schematic diagram; And

Figure 17 is another code tree schematic diagram of illustration.

[embodiment]

Preferred embodiment

To be example below, feature of the present invention will be described thus with the cdma communication system of many speed multicarrier.

Fig. 1 system is shown in the zone, by a plurality of user sides 102 of a base station 100 services.In Tong Xin the application, user side 102 moves in different zones sometimes in action, and therefore same base station 100 may not all be connected to identical user side 102 always.In addition, 102 of these user sides pass through exhibition technology frequently, and each user side uses different spreading codes, with the identical a plurality of carrier waves of overlapping use.

For instance, to hold 102 bit to be passed be a (value is+1 or-1) if will send the party A-subscriber to, the party A-subscriber hold 102 first carrier wave exhibition frequently the spreading codes of usefulness be (+1 ,-1); Sending the party B-subscriber to, to hold 102 bit to be passed be b (value is+1 or-1), the party B-subscriber hold 102 first carrier wave exhibition frequently the spreading codes of usefulness be (+1 ,+1).Exhibition in this example factor number frequently is 2, the back at the sheet sign indicating number (chip code) that first carrier wave transmits is a through opening up frequently (+a ,-a), the back at the sheet sign indicating number that first carrier wave transmits is b through opening up frequently (+b ,+b).Become when the sheet sign indicating number of a and b adds the General Logistics Department (a+b ,-a+b), the base station 100 exhibition audio data propagating out with wireless mode by first carrier wave just.

Then, when the party A-subscriber holds 102 to receive this exhibition audio data at first carrier wave, and it is multiplied by the party A-subscriber holds 102 exclusive spreading codes (+1 ,-1), will obtain the a+b+a-b value of 2a just.Relatively, the party B-subscriber holds 102 after first carrier wave is received this exhibition audio data and be multiplied by the party B-subscriber to hold 102 exclusive spreading codes (+1 ,+1), will obtain the a+b-a+b value of 2b just.Therefore, even propagation aloft is to mix the data that will pass to different user end 102 are arranged, as long as each user side 102 has corresponding spreading codes, can be with its needed data retrieval.

The rest may be inferred, if four spreading codes that coefficient correlation is low are arranged, can hold four user sides 102 simultaneously and use identical frequency range to transmit data a, b, c, d and can not interfering with each other.As crossing these four spreading codes is again quadrature, will obtain 4a, 4b, 4c, 4d respectively after the receiving terminal decoding.Yet, if other the third party, will be because of the shortcoming spreading codes, the data that solve will interfere with each other at four dimensions, and can't be near 4a, 4b, 4c, the degree of 4d will obtain the result of similar random logarithmic data on the contrary.In other words, selected via suitable spreading codes, a plurality of users can shared frequency range transmit data simultaneously, as long as receiving terminal has corresponding spreading codes, just reduction of data can be returned.

Fig. 2 illustration uses four carrier waves to send the exhibition frequency method schematic diagram of a certain user side 102 to.Need exhibition data 202,204,206,208 frequently to be multiplied by the spreading codes 212,214,216,218 of corresponding four carrier waves respectively, be sent to four carrier waves 222,224,226,228 more respectively.These four carrier waves are to overlap but the mode of quadrature is cut apart original wave band, and to increase the transmission capacity of data, this is the technology of multiband modulation like this, and for example OFDM is superfluous at this.

According to Fig. 2, use four carrier waves to open up frequently, need four groups of spreading codes 212,214,216,218, just one has the four spreading codes matrixes that are listed as, and each classifies the spreading codes that corresponds to a carrier wave as.Identical reason will use 16 carrier waves to open up frequently, then needs 16 groups of spreading codes, that is classifies 16 spreading codes matrix as, and each classifies the spreading codes that corresponds to a carrier wave as.

Signal for fear of 102 at different user end interferes with each other, and under ideal state, the spreading codes of shared same carrier wave is mutually orthogonal to each other.In addition, the factor is more little frequently when exhibition, and just the length of spreading codes is got in short-term, and it can be used for supporting transfer rate faster, for example multi-medium video-signal.Otherwise the factor is big more frequently when exhibition, and when just the length of spreading codes was long more, it can be used for supporting lower transfer rate, for example literal news in brief.

In order to support the transmission of many speed, the spreading codes of the user side 102 given different lengths of different transmission rates.Because the distribution of different length spreading codes is quite complicated, therefore, use code tree to put the spreading codes of different length in order in order to make the improved efficiency of specifying spreading codes.How construction code tree below is described.

Producing matrix size is that N * N and radix are the variable spreading codes A of two-dimensional quadrature of N _{N * N} ⁽ⁱ⁾(i ∈ 1,2 ..., N)) and will be from two orthogonal matrix A _{2 * 2} ⁽¹⁾And A _{2 * 2} ⁽²⁾Beginning:

$A_{2\×2}^{\left(1\right)}=\left[\begin{array}{cc}+& +\\ +& -\end{array}\right]---\left(A01\right)$

$A_{2\×2}^{\left(2\right)}=\left[\begin{array}{cc}+& -\\ +& +\end{array}\right]---\left(A02\right)$

Wherein, N=2 ^k, k is a positive integer, "+" expression "+1 " and "-" expression " 1 ".Yet desire produces N=2 ²The step of the two-dimensional quadrature sign indicating number of (k=2 just) can be expressed as follows:

$A_{4\&times;4}^{\left(1\right)}=[{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(1\right)}\&CircleTimes;{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(1\right)}]=\left[\begin{array}{cccc}+& +& +& +\\ +& -& +& -\\ +& +& -& -\\ +& -& -& +\end{array}\right]---\left(A03\right)$

$A_{4\&times;4}^{\left(2\right)}=[{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(2\right)}\&CircleTimes;{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(1\right)}]=\left[\begin{array}{cccc}+& +& -& -\\ +& -& -& +\\ +& +& +& +\\ +& -& +& -\end{array}\right]---\left(A04\right)$

$A_{4\&times;4}^{\left(3\right)}=[{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(1\right)}\&CircleTimes;{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(2\right)}]=\left[\begin{array}{cccc}+& -& +& -\\ +& +& +& +\\ +& -& -& +\\ +& +& -& -\end{array}\right]---\left(A05\right)$

$A_{4\&times;4}^{\left(4\right)}=[{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(2\right)}\&CircleTimes;{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(2\right)}]=\left[\begin{array}{cccc}+& -& -& +\\ +& +& -& -\\ +& -& +& -\\ +& +& +& +\end{array}\right]---\left(A06\right)$

Wherein,  represents two matrix B ^{M2 * N2} A ^{M1 * N1}The Kronecker product be defined as

(A07)

Therefore, produce code length is N=2 ^kThe two-dimensional quadrature spreading codes can be write as following general formula:

$A_{2^{k+1}\&times;2^{k+1}}^{(2i-1)}=[{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(1\right)}\&CircleTimes;A_{2^k\&times;2^k}^{\left(i\right)}]=\left[\begin{array}{cc}{A}_{2^k\&times;2^k}^{\left(i\right)}& -A_{2^k\&times;2^k}^{\left(i\right)}\\ A_{2^k\&times;2^k}^{\left(i\right)}& A_{2^k\&times;2^k}^{\left(i\right)}\end{array}\right]---\left(A08\right)$

$A_{2^{k+1}\&times;2^{k+1}}^{\left(2i\right)}=[{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(2\right)}\&CircleTimes;A_{2^k\&times;2^k}^{\left(i\right)}]=\left[\begin{array}{cc}{A}_{2^k\&times;2^k}^{\left(i\right)}& A_{2^k\&times;2^k}^{\left(i\right)}\\ A_{2^k\&times;2^k}^{\left(i\right)}& -A_{2^k\&times;2^k}^{\left(i\right)}\end{array}\right]---\left(A09\right)$

It must be noted that, use above-mentioned A herein _{2 * 2} ⁽¹⁾And A _{2 * 2} ⁽²⁾Be as illustrative purposes.Be familiar with that the person skilled in art should be understood that if with A _{2 * 2} ⁽¹⁾And A _{2 * 2} ⁽²⁾Ranks exchange or provide other conversion, as long as met the above-mentioned producing method of pulling over, still can keep above-mentioned character.For instance, with A _{2 * 2} ⁽¹⁾And A _{2 * 2} ⁽²⁾"+" make into "-", " " making into "+".And, the also alternative computing of Kronecker product with other, providing pulls over produces the ability of above-mentioned matrix.

Figure 3 shows that M=N=2 ^kThe variable spreading codes of two-dimensional quadrature use tree to be produced code tree (code tree) figure repeatedly up to the 3rd layer (k=3), and the root of its tree (root) is A _{2 * 2} ⁽¹⁾And A _{2 * 2} ⁽²⁾In addition, the auto-correlation lobe of arbitrary two-dimensional quadrature sign indicating number is zero, also be about to same row and move (shift) quadrature to each other, and the cross-correlation of any two different two-dimensional quadrature spreading codes also is zero.

Above-mentioned spreading codes matrix column number is represented its employed carrier number, and line number is then represented the exhibition factor frequently.Exhibition frequently the factor also not necessity be equal to carrier number, below explanation is not equal to the situation of N, how construction code tree as M.

Producing matrix size is that M * N and radix are the two-dimensional quadrature spreading codes A of N _{M * N} ⁽ⁱ⁾(i ∈ 1,2 ..., M}) also can be from (A01) and (A02) two orthogonal matrix A _{2 * 2} ⁽¹⁾And A _{2 * 2} ⁽²⁾Beginning:

$A_{2\&times;4}^{\left(1\right)}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(1\right)}& {\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(2\right)}\end{array}\right]=\left[\begin{array}{cccc}+& +& +& -\\ +& -& +& +\end{array}\right]---\left(A10\right)$

$A_{2\&times;4}^{\left(2\right)}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(1\right)}& -{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2}^{\left(2\right)}\end{array}\right]=\left[\begin{array}{cccc}+& +& -& +\\ +& -& -& -\end{array}\right]---\left(A11\right)$

Wherein, M=2 ^k, N=2 ^{K+ α}, k and α are positive integer.

With M=2 and N=2 ^{1+ α}(α 〉=1) can produce the root (k=1) of the code tree of two-dimensional quadrature sign indicating number according to following formula (A12) and the rule of pulling over (A13):

$A_{2\&times;2^{1+\mathrm{\&alpha;}}}^{\left(1\right)}=\left[\begin{array}{cc}{A}_{2\&times;2^{\mathrm{\&alpha;}}}^{\left(1\right)}& A_{2\&times;2^{\mathrm{\&alpha;}}}^{\left(2\right)}\end{array}\right]---\left(A12\right)$

$A_{2\&times;2^{1+\mathrm{\&alpha;}}}^{\left(2\right)}=\left[\begin{array}{cc}{A}_{2\&times;2^{\mathrm{\&alpha;}}}^{\left(1\right)}& {-\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">A</figure-callout>}}_{2\&times;2^{\mathrm{\&alpha;}}}^{\left(2\right)}\end{array}\right]---\left(A13\right)$

If 2 ^K+1* 2 ^K+1Replace to 2 ^K+1* 2 ^{K+1+ α}, this step of pulling over is similar to (A08) and (A09) very much.Usually, A _{2k+1 * 2k+1+ α} ^(2i-1)And A _{2k+1 * 2k+1+ α} ⁽²ⁱ⁾Be from A _{2k * 2k+ α} ⁽ⁱ⁾Produce, just at (A08) with can be (A09) with A _{2k * 2k} ⁽ⁱ⁾Replace to A _{2k * 2k+ α} ⁽ⁱ⁾Remove construction two-dimensional quadrature sign indicating number.

Certainly, above-mentioned A _{2 * 2} ⁽¹⁾And A _{2 * 2} ⁽²⁾As illustrative purposes only, the matrix that also can seek quadrature substitutes A _{2 * 2} ⁽¹⁾And A _{2 * 2} ⁽²⁾But, by the code tree of the also construction effect same of mode of pulling over.

Figure 3 shows that M=2 ^k, N=2 ^{K+ α}The variable spreading codes use of the two-dimensional quadrature of (α=1) tree is produced the code tree figure up to the 3rd layer (k=3) repeatedly, and the root of its tree is A _{2 * 4} ⁽¹⁾And A _{2 * 4} ⁽²⁾In addition, the auto-correlation lobe of arbitrary two-dimensional quadrature sign indicating number is zero, and the cross-correlation of any two different two-dimensional quadrature spreading codes also is zero.M and N are any power of 2, so the two-dimensional quadrature sign indicating number can be constructed as complete tree, as shown in Figure 4.

(M＜N) has illustrated and has kept quadrature each other between different sign indicating number sequences in the code tree of two-dimensional quadrature sign indicating number for Fig. 3 (M=N) and Fig. 5.And two-dimensional quadrature sign indicating number A _{2k * 2k+ α} ⁽ⁱ⁾, subscript i represents the number of two-dimension code in the k layer, 1≤i≤M.The code length of each layer is the same.And the two-dimension code of k+1 layer is to produce from the k layer.Therefore, the two-dimensional quadrature spreading codes can use tree to be produced repeatedly.Any two two-dimension codes with one deck are quadratures, unless and identical α but two two-dimension codes of different layers are the relation of female sign indicating number (mother code) or subcode (child code) each other, not so also be quadrature.If any two two-dimension codes in code tree have identical root, the sign indicating number that then is positioned at the upper strata claims female sign indicating number, and the sign indicating number that is positioned at lower floor is called subcode.For example shown in Figure 6, A _{2 * 2} ⁽¹⁾, A _{4 * 4} ⁽¹⁾, A _{8 * 8} ⁽²⁾And A _{16 * 16} ⁽³⁾All be A _{32 * 32} ⁽⁵⁾Female sign indicating number, and A _{4 * 4} ⁽¹⁾, A _{8 * 8} ⁽²⁾, A _{16 * 16} ⁽³⁾And A _{32 * 32} ⁽⁵⁾All be A _{2 * 2} ⁽¹⁾Subcode.So, A _{2 * 2} ⁽¹⁾, A _{4 * 4} ⁽¹⁾, A _{8 * 8} ⁽²⁾, A _{16 * 16} ⁽³⁾And A _{32 * 32} ⁽⁵⁾It not quadrature.

In other words, these two-dimension codes can not be used simultaneously at same passage.When a two-dimension code was assigned with, it can not be the female sign indicating number or the subcode of this two-dimension code of this two-dimension code that other two-dimension code is assigned with, yet just can keep the orthogonality between the sign indicating number.Therefore, if exhibition that optionally will be bigger when factor sign indicating number is assigned to the user who needs low rate frequently, then may cause obstruction to the less exhibition distribution of factor sign indicating number frequently.Suppose A _{8 * 8} ⁽²⁾Be assigned to a user, by A _{8 * 8} ⁽²⁾Subcode { the A that is produced _{16 * 16} ⁽³⁾, A _{16 * 16} ⁽⁴⁾, A _{32 * 32} ⁽⁵⁾..., A _{32 * 32} ⁽⁸⁾Just all can not be assigned to other need be than the user of low rate.In addition, A _{8 * 8} ⁽²⁾Female sign indicating number { A _{2 * 2} ⁽¹⁾, A _{4 * 4} ⁽¹⁾Also can not be assigned to the user that other need higher rate.In other words, the sign indicating number that can not only be wanted in the apparent code tree to be assigned with by the number of the sign indicating number of other user's uses and decide, and will decide on the relation of the mother of these sign indicating numbers that are assigned with yard and subcode.

Above-mentioned code tree is no problem in construction, and the demand of the code division multiple address communication system spreading codes construction of many speed, multicarrier also is provided really.Yet,, will cause the cost problem on the circuit production of user side 102 if there is user side 102 in whole code tree.Relatively, if all required spreading codes is directly passed to user side 102 at every turn, then also waste valuable frequency range.

Following method only needs to deposit the generation matrix at user side 102, and need not deposit whole code tree, can reach the work of specifying spreading codes by index tab being passed to user side 102.

Fig. 7 illustration is used the method for index tab skill, with in the code division multiple address communication system of many speed, multicarrier, and the spreading codes that designated user end 102 is required.

At first, index tab is passed to user side 102 (step 702), the length of this index tab system to should user side 102 required transmission rates.Then, this user side 102 is according to this index tab construction index tab matrix (step 704).Then, this user side is according to this index tab matrix and be stored in one of inside generation matrix to produce a spreading codes matrix (step 706), make each row of this index tab matrix correspond to one of this spreading codes matrix respective column, each row of this spreading codes matrix then correspond to a carrier wave individually, and are the maintenance quadrature between each row of this spreading codes matrix.After finishing above-mentioned step, this user side uses these row of this spreading codes matrix, is carried on the exhibition of one of a plurality of carrier waves respectively with decipher and adds code data (step 708) frequently.

In other words, by above-mentioned method, what user side 102 will be deposited is to produce matrix, and base station 100 is when the spreading codes of designated user end 102, also need not whole spreading codes matrix is passed to user side 102, is to be by transmitting an index tab, finishing the appointment of spreading codes with effective method.

By following skill, index tab can be corresponded to whole code tree, and further make 102 need of all user sides deposit the generation matrix of a maximum, because the required generation matrix of other stratum of code tree is the submatrix of this generation matrix of depositing.

One of method of construction index tab is to use Gray code (Gray code) sequence.Gray code is two bit sequence, and adjacent two numbers of this sequence only have a bit difference.Basically, one group of Gray code can be imagined as a Chinese John Milton path (Hamilton Path) of a super square (Cube).Therefore, Gray code is not to refer to one group of fixing sequence, the example of a Gray code of Fig. 8 illustration.

How Fig. 9 illustration is embedded into an aforesaid code tree with the index tab of gray code sequence.A Chinese John Milton path in the ground floor (LV=1) of code tree is 0-〉1.A Chinese John Milton path in the second layer (LV=2) is 00-〉 01-〉 11-〉 10.Deduct the leftmost bit of each yard, remaining bit order is just gone to the right for last layer (LV=1) by the left side, walk back from the right again the left side order (0-〉1=1-0).In like manner, a Chinese John Milton path in the 3rd layer (LV=3) is (composing) 000-〉 001-〉 011-〉 010=〉 110-〉 111-〉 101-〉 100, also by behind the leftmost bit of deduction, remaining bit sequence be in the last layer (LV=2) by the left side go to the right walks back the left side again from the right order (00-〉01-〉11-10=10-11-01-00).In like manner, also can be disposed for the 4th layer of later code tree according to this kind mode.

Under Fig. 9 and collocation method described above, this code tree has a very special character, and whether need only exactly and just can pick out two sign indicating numbers from the beginning of index tab is the relation of parent node and child node.For instance, 00 two child nodes are 000 and 001.Certainly, if the length of two sign indicating numbers is the same, represent that then it is in the same stratum of code tree.

Next how explanation corresponds to last spreading codes matrix to the index tab of code tree.

At its root of code tree is the two-dimensional quadrature spreading codes of M=N, and just, the China of two dimension is permitted sign indicating number (Walsh code) and can be expressed as follows:

${\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}\left(0\right)=\left[\begin{array}{cc}0& 0\\ 0& 1\end{array}\right]---\left(A14\right)$

${\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}\left(1\right)=\left[\begin{array}{cc}0& 1\\ 0& 0\end{array}\right]---\left(A15\right)$

Wherein, be designated as the size of matrix down, (0) and (1) represents the numbering of two sign indicating numbers in the ground floor respectively, (A14) then represents (A01) and (A02) "+" and "-" respectively with (A15) " 0 " and " 1 ".

So by by above-mentioned corresponded manner, first classifying 00 as can be marked as the auspicious sign indicating number of lattice be 0, the second to classify 01 as to be marked as the auspicious sign indicating number of lattice be 1 (A14).In like manner, first classifying 01 as can be marked as the auspicious sign indicating number of lattice be 1, the second to classify 00 as to be marked as the auspicious sign indicating number of lattice be 0 (A15).Therefore, index tab matrix (A14) and (A15) can be expressed as follows:

${T_1}^{\left(0\right)}=\left[\begin{array}{c}0\\ 1\end{array}\right]---\left(A16\right)$

${T_1}^{\left(1\right)}=\left[\begin{array}{c}1\\ 0\end{array}\right]---\left(A17\right)$

, wherein, being designated as ground floor down, subscript (0) and (1) are represented the numbering of two sign indicating numbers in the ground floor respectively.

So in the code tree of two-dimensional quadrature spreading codes, can put on the pairing index tab matrix of all two-dimensional quadrature sign indicating numbers, and also can put on the auspicious sign indicating number of the lattice label of one dimension, whether be the relation of female sign indicating number or subcode so that differentiate between two sign indicating numbers, as shown in figure 10.Among the figure, Be the auspicious sign indicating number of lattice label, its purposes is to judge whether the auspicious sign indicating number of the lattice label of some sign indicating numbers is the prefix of the auspicious sign indicating number of the lattice label of another yard.

Figure 10 illustration one code tree with and index tab, index tab matrix and spreading codes.For example, the auspicious sign indicating number of lattice label is

Be With Prefix, so can know two-dimensional quadrature spreading codes D _{4 * 4}(1) is D _{8 * 8}(2) and D _{8 * 8}(3) female sign indicating number.In addition, can find that by Figure 10 another produces the method for index tab matrix.At first, can find in arbitrarily adjacent two-layer (k 〉=1) that the index code label is that the relational expression between the index tab matrix of 0 two-dimensional quadrature spreading codes can be expressed as follows entirely by figure:

(A18)

Wherein, T _k ⁽⁰⁾And T _K+1 ⁽⁰⁾Represent that respectively the auspicious sign indicating number of k layer and k+1 layer lattice label is the auspicious index matrix of lattice of 0 two-dimensional quadrature spreading codes entirely, and 0 _2k-1With 1 _2k-1Then represent 2 respectively ^K-1Individually be 0 entirely and be 1 vector entirely.Therefore, can obtain each layer index label by (A18) is 0 index tab matrix entirely.Yet utilize the one dimension index tab just can obtain the index tab matrix of all two-dimensional quadrature spreading codes of this layer respectively again.

For example, desire to ask the auspicious sign indicating number of the second layer (k=2) lattice label to be With

The auspicious index matrix of lattice of two-dimensional quadrature spreading codes.At first, by T ₁ ⁽⁰⁾Try to achieve T ₂ ⁽⁰⁾Yet,

(A19)

D as can be known _{4 * 4}(0) and D _{4 * 4}(1) the auspicious sign indicating number of lattice label is respectively

With

And these two labels have a bit difference, are second bit, so can be with T ₂ ⁽⁰⁾Second the row sequence do two bit complement (complement) computings, its gained result is D _{4 * 4}(1) the auspicious index matrix of lattice.

${T_2}^{\left(1\right)}=\left[\begin{array}{cc}0& 1\\ 1& 0\\ 0& 0\\ 1& 1\end{array}\right]---\left(A20\right)$ )

D as can be known again _{4 * 4}(2) index tab is

With D _{4 * 4}(0) index tab

Two bit differences are arranged, so can be with T ₂ ⁽⁰⁾Do the complement computing, its gained result is D _{4 * 4}(2) index tab matrix.

${T_2}^{\left(2\right)}=\stackrel{\&OverBar;}{{T_2}^{\left(0\right)}}=\left[\begin{array}{cc}1& 1\\ 0& 0\\ 1& 0\\ 0& 1\end{array}\right]---\left(A21\right)$

In each layer, the index tab matrix is different and different according to each index tab.In the example that disclose in this place, as long as decision or deposit first index tab matrix of the left of each layer, other index tab matrixes of this layer can be added to index tab respectively each row of first index tab matrix and obtain.That is to say that each index tab has the index tab matrix of oneself.In addition, each corresponding spreading codes that is used for certain carrier wave of row system of index tab matrix.

After the index tab matrix has been arranged, in order to obtain spreading codes fast, can deposit one and produce matrix, make the index tab matrix after being multiplied by this production matrix, can draw spreading codes.In this example, the relational expression of the generation matrix between adjacent two layers (k 〉=1) can be expressed as follows arbitrarily:

(A22)

Wherein, G _kAnd G _K+1Be respectively the generation matrix of k layer and k+1 layer, G _kBe G _kTwo bit complements, $0_{2^k}=(\mathrm{0,0},\&CenterDot;\&CenterDot;\&CenterDot;,0)$ With $1_{2^k}=(\mathrm{1,1},\&CenterDot;\&CenterDot;\&CenterDot;,1)$ Then represent 2 respectively ^kIndividually be 0 entirely and be 1 vector entirely.

The generation matrix of each layer is to produce repeatedly by (A22).That is to say the generation matrix G of the second layer ₂Can be from the generation matrix G of ground floor ₁Obtain, and the 3rd layer generation matrix G ₃Can be by the generation matrix G of the second layer ₂Obtain, by that analogy.

G ₁＝[0 1] (A23)

(A24)

(A25)

Illustrate so far how to produce index tab, index tab matrix, and produce matrix to explain.Then, will illustrate how to finish above-mentioned notion with real circuit.

Suppose that (N, it is 2 that section sign indicating number K) (block code) is represented one group of number ^KAnd length is the code word (code word) of N.It is any that (N, linear code K) (linear code) can produce with the generation matrix G of a K * N.Be arranged in an orthogonal dimension spreading codes, 2 in the k layer ^kIndividual sign indicating number is one group (2 ^k, linear code k) produces.Can utilize this idea with orthogonal dimension spreading codes expansion two-dimensional quadrature spreading codes.Therefore, j the two-dimensional quadrature spreading codes that is arranged in the k layer can utilize following relational expression to produce:

$D_{2^k\&times;2^k}\left(j\right)={T_k}^{\left(j\right)}\&CenterDot;G_k---\left(A26\right)$ )

Just,

Wherein, 0≤j≤2 ^k-1,0≤m≤2 ^k-1 and 0≤n≤2 ^k-1.

As, desire produces the auspicious sign indicating number of the second layer (k=2) lattice label and is Two dimension China permitted a sign indicating number D _{4 * 4}(0).At first, according to (A24) from D _{2 * 2}(0) the auspicious index matrix T of lattice ₁ ⁽⁰⁾Obtain D _{4 * 4}(0) the auspicious index matrix T of lattice ₂ ⁽⁰⁾Yet,

(A28)

(A24) is the generation matrix of the second layer (k=2) again, just can obtain required two dimension China sign indicating number perhaps so the auspicious index matrix of the lattice of this sign indicating number is multiplied by the generation matrix of this layer.

${\mathrm{<figure-callout\; id="4"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{4\&times;4}\left(0\right)={T_2}^{\left(0\right)}\&CenterDot;{\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">G</figure-callout>}}_2=\left[\begin{array}{cc}0& 0\\ 1& 1\\ 0& 1\\ 1& 0\end{array}\right]\&CenterDot;\left[\begin{array}{cccc}0& 1& 1& 0\\ 0& 0& 1& 1\end{array}\right]=\left[\begin{array}{cccc}0& 0& 0& 0\\ 0& 1& 0& 1\\ 0& 0& 1& 1\\ 0& 1& 1& 0\end{array}\right]---\left(A29\right)$

Figure 11 is listed as the encoder schematic diagram and the circuit diagram of n row element with Figure 12 shows that the m that produces j the variable spreading codes of two-dimensional quadrature of k layer according to (A26) or relational expression (A27).Wherein, 0≤j≤2 ^k-1,0≤l≤k-1,0≤m≤2 ^k-1 and 0≤n≤2 ^k-1.In this schematic diagram, if g _{K, l, n}=1, then on behalf of circuit, " → zero → " connection is arranged, opposite, if g _{K, l, n}=0, then representative does not connect, and " " then represents the adder (modulo-2adder) of a modulus 2.Figure 12 shows that the circuit diagram of realizing the element of two-dimensional quadrature spreading codes with the combinational circuit of logic lock.Figure 13 and Figure 14 shows that is created in that index tab is in the second layer The complete encoder schematic diagram and the circuit diagram of two-dimensional quadrature spreading codes.

The exhibition of Figure 15 illustration user side is communication receiving device 15 frequently, mobile phone for example, circuit diagram.This exhibition communication receiving device 15 frequently is to be used for one of many speed code division multiple address communication system, and has memory circuit 151, receiving circuit 153, counting circuit 155, and decoding circuit 157.Memory circuit 151 is for depositing above-mentioned generation matrix, and receiving circuit 153 then receives an exhibition audio data and an above-mentioned index tab, and this exhibition audio data system is carried on a plurality of carrier waves.Counting circuit 155 is a calculation of parameter index tab matrix with this index tab, and this index tab matrix and this generation matrix are carried out a computing to produce the spreading codes matrix, respectively corresponding this carrier wave of each row of this spreading codes matrix.In addition, 155 of decoding circuits utilize this exhibition of decipher respectively that respectively is listed as of this spreading codes matrix to add code data frequently respectively.

The device schematic diagram of the base station that Figure 16 illustration is relative with user side.This base station 16 is to be used for a code division multiple address communication system, with a plurality of receiving systems of correspondence, and has the circuit 162 of generation, allocation circuitry 164 and transfer circuit 166 at least.An index tab more than 162 records of generation circuit can be used, node on the corresponding code tree of each index tab, the corresponding index matrix of each index tab, to carry out a computing to obtain a spreading codes matrix behind this index matrix reference one generation matrix, this spreading codes matrix each row then on a carrier wave, open up keep pouring in defeated, and the parent node of this code tree is with between child node and between the node of the same stratum of this code tree, and these spreading codes matrixes of correspondence are orthogonal at each carrier wave.Allocation circuitry 164 is given these receiving systems that need different transmission rates respectively with this index tab biography of different length.As for 166 these spreading codes matrixes of transfer circuit, transmit data with the code division multiple access method with a plurality of carrier waves according to this index tab correspondence that these receiving systems used.

In addition, when carrier number less than the exhibition factor frequently, when just M is not equal to N, can produce the tab indexes matrix of the variable spreading codes of two-dimensional quadrature of all M ≠ N in order to make encoder, then must change the root in the code tree (α=0).And the root that is changed can be by (A12) and (A13) obtains root in the code tree (α ≠ 0), yet utilizes above-mentioned construction mode still can produce two-dimensional quadrature spreading codes all in this code tree again.Two-dimensional quadrature spreading codes based on this kind method is produced as long as in synchronous system, still can correctly use.

For example, in the code tree of α=0, root originally (A14) and (A15) can change into (A30) and two-dimensional quadrature spreading codes (A31) and be used as new root in this code tree.Yet according to (A12) and (A13) can obtain the root (A32) and (A33) in the code tree (α=1).

${\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}\left(0\right)=\left[\begin{array}{cc}0& 0\\ 0& 0\end{array}\right]---\left(A30\right)$

${\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}\left(0\right)=\left[\begin{array}{cc}0& 0\\ 1& 1\end{array}\right]---\left(A31\right)$

${\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;4}\left(0\right)=\left[\begin{array}{cccc}0& 0& 0& 0\\ 0& 0& 1& 1\end{array}\right]---\left(A32\right)$

${\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;4}\left(1\right)=\left[\begin{array}{cccc}0& 0& 1& 1\\ 0& 0& 0& 0\end{array}\right]---\left(A33\right)$

In addition, as above-mentioned construction mode, can be with (A32) and (A33) make the two-dimensional quadrature spreading codes that the Kronecker product produces the second layer 4 * 8 with (A14), (A15) respectively, its calculating process is as follows:

${\mathrm{<figure-callout\; id="4"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{4\&times;8}\left(0\right)=[{\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}\left(0\right)\&CircleTimes;{\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;4}\left(0\right)]=\left[\begin{array}{cccccccc}0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 1& 1& 0& 0& 1& 1\\ 0& 0& 0& 0& 1& 1& 1& 1\\ 0& 0& 1& 1& 1& 1& 0& 0\end{array}\right]---\left(A34\right)$

${\mathrm{<figure-callout\; id="4"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{4\&times;8}\left(1\right)=[{\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}\left(1\right)\&CircleTimes;{\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;4}\left(0\right)]=\left[\begin{array}{cccccccc}0& 0& 0& 0& 1& 1& 1& 1\\ 0& 0& 1& 1& 1& 1& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 1& 1& 0& 0& 1& 1\end{array}\right]---\left(A35\right)$

${\mathrm{<figure-callout\; id="4"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{4\&times;8}\left(2\right)=[{\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}\left(0\right)\&CircleTimes;{\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;4}\left(1\right)]=\left[\begin{array}{cccccccc}0& 0& 1& 1& 0& 0& 1& 1\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 1& 1& 1& 1& 0& 0\\ 0& 0& 0& 0& 1& 1& 1& 1\end{array}\right]---\left(A36\right)$

${\mathrm{<figure-callout\; id="4"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{4\&times;8}\left(3\right)=[{\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}\left(1\right)\&CircleTimes;{\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;4}\left(1\right)]=\left[\begin{array}{cccccccc}0& 0& 1& 1& 1& 1& 0& 0\\ 0& 0& 0& 0& 1& 1& 1& 1\\ 0& 0& 1& 1& 0& 0& 1& 1\\ 0& 0& 0& 0& 0& 0& 0& 0\end{array}\right]---\left(A37\right)$

So utilize the mode of this construction can produce repeatedly the 3rd layer 8 * 16, the 4th layers 16 * 32 ... or the like all two-dimensional quadrature spreading codes.Therefore, the index tab matrix of the two-dimensional quadrature spreading codes of above-mentioned generation M ≠ N all can be produced by encoder.

Desire is used the two-dimensional quadrature spreading codes of encoder generation M ≠ N, as 2 * 4,2 * 8,4 * 8,4 * 16 ... or the like, must know the pairing generation matrix of the pairing index tab matrix of each yard and each layer earlier.The index tab matrix that the two dimension China of narration before its index tab matrix can utilize is permitted sign indicating number gets it, that is to say, want to obtain the index tab matrix of the two-dimensional quadrature spreading codes of M ≠ N, can be permitted the sequence of the index tab matrix taking-up odd column of sign indicating number from the two dimension China of M=N, yet formed matrix is the index tab matrix of pairing two-dimensional quadrature spreading codes.For example, in the code tree of α=1, the index tab matrix that the index tab matrix of 2 * 4 two-dimensional quadrature spreading codes can be permitted sign indicating number from two dimension China of 4 * 4 is got the index tab matrix that first row and the formed matrix of tertial sequence promptly are 2 * 4 two-dimensional quadrature spreading codes; The index tab matrix that the index tab matrix of 4 * 8 two-dimensional quadrature spreading codes then can be permitted sign indicating number from two dimension China of 8 * 8 be got the index tab matrix that first row, the 3rd row, the 5th row and the 7th formed matrix of sequence that is listed as promptly are 4 * 8 two-dimensional quadrature spreading codes, then can obtain the index tab matrix of all yards correspondence in this code tree by that analogy.In like manner, in the code tree of α=2, get that first of index tab matrix that two dimension China of 8 * 8 permitted sign indicating number is listed as and the 5th row sequence can obtain the index tab matrix of 2 * 8 two-dimensional quadrature spreading codes; 4 * 16,8 * 32 ... or the like the index tab matrix of two-dimensional quadrature spreading codes also can be in a like fashion it.In addition, also can utilize root (to be 2 * 2 ^{1+ α}The two-dimensional quadrature spreading codes) the index tab matrix with (A38) or relational expression (A39), then can produce index tab matrixes all in the code tree.

(A38)

(A39)

Wherein, j is the numbering of two-dimensional quadrature spreading codes, 0≤j≤2 ^k-1.

Then must select the identical matrix of code length of the two-dimensional quadrature spreading codes of line number and desire generation as for producing matrix.For example, produce 4 * 8 two-dimensional quadrature spreading codes, then will select (A25) matrix size is 3 * 8 generation matrix.

Figure 17 shows that the code tree figure of the two-dimensional quadrature spreading codes of α=1.The generation matrix of ground floor (k=1) is (A24), can produce the generation matrix of each layer by (A22) repeatedly.Yet desire produces the second layer (k=2) index tab

Two-dimensional quadrature spreading codes D _{4 * 8}(0), the generation matrix that the index tab matrix of this sign indicating number can be multiplied by the second layer can obtain.Its index tab matrix is

$T_2^{\left(0\right)}=\left[\begin{array}{ccc}0& 0& 0\\ 0& 1& 1\\ 0& 1& 1\\ 0& 1& 0\end{array}\right]---\left(A40\right)$

The generation matrix of this layer is

${\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">G</figure-callout>}}_2=\left[\begin{array}{cccccccc}0& 1& 1& 0& 1& 0& 0& 1\\ 0& 0& 1& 1& 1& 1& 0& 0\\ 0& 0& 0& 0& 1& 1& 1& 1\end{array}\right]---\left(A41\right)$

So this two-dimensional quadrature spreading codes is

${\mathrm{<figure-callout\; id="4"\; label="D"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">D</figure-callout>}}_{4\&times;8}\left(0\right)={T_2}^{\left(0\right)}\&CenterDot;{\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="A200410028607.700251.png,A200410028607.700261.png"\; state="\{\{state\}\}">G</figure-callout>}}_2=\left[\begin{array}{cccccccc}0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 1& 1& 0& 0& 1& 1\\ 0& 0& 0& 0& 1& 1& 1& 1\\ 0& 0& 1& 1& 1& 1& 0& 0\end{array}\right]---\left(A42\right)$

Though the present invention discloses as above with a preferred embodiment; right its is not in order to limit the present invention; anyly be familiar with the person skilled in art; without departing from the spirit and scope of the present invention; when can being used for a variety of modifications and variations, so the present invention's protection range should define according to the scope of claims and is as the criterion.

Claims (10)

1. a communication means is used for a multi-speed CDMA communication system, and this method comprises:

Transmit an index tab and give a user side, the length of this index tab determines a transmission rate;

This user side is according to this index tab construction one index tab matrix;

This user side produces matrix to produce a spreading codes matrix according to this index tab matrix and, make each row of this index tab matrix correspond to one of this spreading codes matrix respective column, each row of this spreading codes matrix then correspond to a carrier wave individually, and are the maintenance quadrature between each row of this spreading codes matrix; And

This user side uses these row of this spreading codes matrix, is carried on one of a plurality of carrier waves spreading codes data respectively with decipher.

2. method according to claim 1, it is characterized in that, this index tab is a node of a code tree, and the different stratum of this code tree represent different transmission rates, and pairing a plurality of these spreading codes matrixes of the same stratum of this code tree keep quadrature to each other at the row that correspond to same carrier wave.

3. method according to claim 2 is characterized in that, the pairing spreading codes matrix of the same stratum of this code tree keeps quadrature to each other at the row that correspond to same carrier wave.

4. method according to claim 3 is characterized in that, further comprises the user mode according to a required transmission rate and present this code tree, distributes this index tab of which node to carry out transfer of data with decision.

5. method according to claim 4 is characterized in that, further comprises by the sign indicating number of this index tab to differentiate whether two these index tabs are the relation of parent node and child node to each other.

6. method according to claim 5 is characterized in that, this index tab is by forming according to a gray code sequence construction.

7. method according to claim 6 is characterized in that, a plurality of these user sides of this code tree supply receive data simultaneously in a communication zone, and these a plurality of these user sides are deposited this identical generation matrix.

8. method according to claim 7 is characterized in that, this user side is that this index tab matrix is multiplied by this generation matrix to obtain this spreading codes matrix.

9. method according to claim 6 is characterized in that, this of the parent node correspondence of this code tree produces a submatrix of this generation matrix of matrix system child node correspondence.

10. method according to claim 1 is characterized in that, this user side is an action communicator, is used for back third generation mobile communication.

Images