CN1592179A - Method for generating 2D ovsf codes - Google Patents

Abstract

A code tree which is used for the two-dimensional orthogonal frequency spreading code (2D-OVSF) of the multicarrier direct-sequence code-division multiple-access (MC-DS/CDMA) communications system is obtained by the Kronecker product of a group of known M1*N1 orthogonal matrixes which is used as a seed matrix with the other group of known M2N2 corresponding matrix. The seed matrix can be represented with A<<M#-<1*N1>>><i>, wherein i = (1, 2, ..., k1), the corresponding matrix is represented with B<<M#-<2*N2>>><j>, wherein j=(1, 2, ..., k2). M1 represents the carrier number which can be provided in the MC-DS/CDMA system, N1 represents the frequency spreading code factor namely the length of the frequency spreading code. The first layer of submatrix which is generated when the seed matrix and the corresponding matrix are applied will be a group of M1M2*N1N2 orthogonal matrix with number K1K2 degree and is defined as follows: C<M1M2*N1N2> << (i-1)K2+1>> = B<M2*N2> <1>*A<M1N1> <i> C<M1M2*N1N2> <<(i-1)K2+2>> = B<M2*N2> <2>*A<M1N1> <i> ...C<M1M2*N1N2> << (i-1)K2+K2>> = B<M2*N2> <K2>* A<M1N1> <i>, wherein, Kronecker product is represented, at the same time i=1, 2, 3, 4, ..., K1.

Description

Produce the variable exhibition of the two-dimensional quadrature method of coefficient sign indicating number frequently

Technical field

The invention provides a kind of code division multiple access communication system (CDMA Communication system), be meant a kind of especially at variable wave number direct sequence code division multiple access (multicarrier direct-sequencecode-division multiple-access, MC-DS/CDMA) produce the variable exhibition of two-dimensional quadrature coefficient (two-dimensional orthogonal variable spreading factor, 2D-OVSF) method of sign indicating number and convertible different rates MC-DS/CDMA communication system frequently in the communication system.

Background technology

Second generation communication system market flourish, with and the continuous extension of correlation function, promoted the performance of its transmission and reception apace, make it come data transmission with very high transmission rate.Being showing improvement or progress day by day of communication system then impelled the development of the third generation (3G) Mobile Communications systems, advocated by Inter Action communication group (IMT-2000) as wide band code division multiple access communication system (the Wideband Code-Division Multiple-Access) service of 2Mbps.Be used to the code division multiple access communication science service system in the third generation Mobile Communications system, it provides the wideband service in a kind of extremely resilient mode.The code division multiple access communication system can provide reusable frequency spectrum (Spectrum), opposing multipath to disturb the advantage of (multipath resistance), frequency diversity (frequency diversity) and interference eliminated (interference rejection) through after opening up frequently.

For purpose high-speed and multiple data transmission service can be provided simultaneously, there are two kinds of technology to be used in the IMT2000 wideband CDMA communication system, that is: variable-length exhibition frequency (Variable-lengthspreading) technology and many yards technology (Multicode techniques).Wherein variable-length exhibition frequency CDMA communication system system uses the quadrature spreading codes of different length to realize the multiple data transmission.Many yards technology have then been assigned a plurality of spreading codes and have been reached high data quantity transmission service for a user.This two exhibition frequently technology is used in the CDMA communication system of wideband being provided at the mutually orthogonal property of user in the same cell lattice (Cell), and has also kept the mutual randomness of user under the different cell lattice simultaneously.This two exhibition technology frequently includes two partly, and first partly is channelization (channelization), and it is converted to default chip (Chip) number with each data mark (Data symbol).The pairing number of chips of each data mark is called as exhibition coefficient sign indicating number frequently.The variable exhibition frequency of two-dimensional quadrature coefficient sign indicating number is brought is used as channelization code to guarantee the orthogonality of different download channels.Second partly is scramble (scrambling).In the same cell lattice each is with using same scrambling code per family, to provide and to keep user's randomness in the different cell lattice.Yet the variable exhibition of two-dimensional quadrature coefficient sign indicating number frequently can not be kept the user in the mutual randomness of uploading on the channel.Therefore, the user in same cell lattice is uploading in the channel the different scrambling code of use and is keeping its orthogonality and randomness.

Yet for bigger data transmission capabilities is arranged, so proposed variable wave number direct sequence code division multiple access (MC-DS/CDMA) communication system.And the advantage of using the MC-DS/CDMA communication system of quadrature spreading codes be its multiple access can be disturbed reduce to minimum (multiple-access interference, MAI).This multiple access disturbs and is a topmost interference source in the CDMA communication system.By the interference that reduces multiple access, the possibility of accelerating its transmission rate then improves greatly.Each user in multiple access disturbs is assigned a two-dimentional spreading codes sequence as authentification of user sequence (signature sequence) (spreading code sequence).The number of row is its employed exhibition coefficient frequently in the matrix, and the number of row then is the number of MC-DS/CDMA communication system medium frequency wave number.Each matrix column is sent out via different frequency.It is possible setting up one group of two-dimentional spreading codes matrix that shows zero circulation auto-correlation lobe (Cyclic autocorrelation Sidelobes) and zero circulation intercorrelation (Cyclic Cross-Correlation) characteristic for the MC-DS/CDMA communication system.Since multiple access disturb to be what the mutual auto-correlation function of main non-zero for user in ought transmitting was simultaneously produced, when then using such spreading codes matrix, the multiple access in the MC-DS/CDMA communication system disturbs and can be alleviated widely.Please refer to Figure 1A and Figure 1B.Figure 1A is the simple block diagram of existing MC-DS/CDMA communication system 10, and Figure 1B one is used in the M * N spreading codes matrix 14a of existing communication system 10.Input data 12a is transfused to a multiplier 14, and this multiplier 14 is done exhibition frequently via the appointment of a M * N spreading codes matrix 14a, through exhibition again and again the data after the spectrum 15 can be input to a variable wave number modulation unit 16 and be sent out.At receiving terminal, after anti-modulation unit 17 of variable wave number has received the message that is transmitted, through anti-modulation and produce 18, one multipliers 19 of anti-modulation data and data 18 is multiplied each other with identical M * N spreading codes matrix 14a and produce output data 12b.In general, these all users' M * N spreading codes matrix is consistent, and output data 12b must follow input data 12a unanimity in the ideal.

Up to the present, the spreading codes matrix of MC-DS/CDMA communication system is limited in form, that is to say M, and the relation between the N has following restriction:

1) M=N=2 ^k, k 〉=1, or

2)M＝2 ^k，N＝M ²，k≥1。

Above condition has constituted suitable restriction in the MC-DS/CDMA communication system, and this restriction can reduce the elasticity of these systems on data transmission parameters greatly.

Summary of the invention

Therefore, main purpose of the present invention is to provide a variable wave number direct sequence code division multiple access (Multicarrier direct-sequence code-division multiple-access, MC-DS/CDMA) communication system, cooperate the variable exhibition frequency coefficient sign indicating number of existing two-dimensional quadrature (two-dimensional orthogonalvariable spreading factor code, 2D-OVSF codes) to make its two-dimensional quadrature spreading codes that expands of having the ability to produce and use.The two-dimensional quadrature spreading codes that expands is M * N matrix form, and this M * N matrix passes through M ₁* N ₁And M ₂* N ₂Matrix produces, wherein M=M ₁* M ₂, N=N ₁* N ₂In addition, work as M ₁* N ₁Matrix has k ₁Individual, M ₂* N ₂Matrix has k ₂Individual, can produce (k ₁* k ₂) individual M * N matrix.

The present invention has disclosed the method for wireless telecommunications, refers to a method that produces the two-dimensional quadrature spreading codes in the MC-DS/CDMA communication system especially.And a branch code tree in response to the two-dimensional quadrature spreading codes of this communication system proposed.The two-dimensional quadrature spreading codes that produces all can be applicable to the MC-DS/CDMA communication system in these minutes code trees.On behalf of a two-dimensional quadrature spreading codes, the node of each branch code tree can treat as mark sequence (signaturesequence).

Originally, one group of already present M ₁* N ₁The two-dimensional quadrature spreading codes, A ⁽ⁱ⁾ _{(M1 * N1)}, be considered as kind of a submatrix.This i={1 wherein, 2 ..., K ₁, M ₁Then represent present given frequency wave number (frequency carriers), and N ₁Represent an exhibition code length and the supposition K of the factor frequently ₁Be 2.The kind submatrix of each branch code tree is specified in corresponding parent node.This parent node is used as the first generation child node of branch code tree, also is the root architecture (root structure) of branch code tree.All continuities are the offspring of these parent nodes for child node.

Another organizes already present two-dimensional quadrature spreading codes matrix M ₂* N ₂Matrix B _{2 (M2 * N2)} ⁽ⁱ⁾Be corresponding matrix, this i={1 wherein, 2 ..., K ₂, and K ₂Be 2.Plant submatrix $\{{A^{\left(1\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)},{A^{\left(2\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)},...,{A^{\left(K_1\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)}\}$ And corresponding matrix $\{B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(1\right)},B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(2\right)},...,B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(K_2\right)}\}$ Be used for producing the child node in the branch code tree.Second layer child node is (M ₁M ₂* N ₁N ₂) matrix and number K is arranged ₁K ₂Individual, this second layer child node is to define by repeating the following relationship formula:

${C^{((i-1){\mathrm{<figure-callout\; id="2"\; label="K"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">K</figure-callout>}}_2+1)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)}=B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(1\right)}\&CircleTimes;{A^{\left(i\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)}$

${C^{((i-1){\mathrm{<figure-callout\; id="2"\; label="K"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">K</figure-callout>}}_2+2)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)}=B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(2\right)}\&CircleTimes;{A^{\left(i\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)}$

...

${C^{((i-1){\mathrm{<figure-callout\; id="2"\; label="K"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">K</figure-callout>}}_2+K_2)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)}=B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(K_2\right)}\&CircleTimes;{A^{\left(i\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)}$

This  be expressed as the Crow Buddhist nun restrain long-pending, and i=1,2,3,4 ..., K ₁By above-mentioned formula, can obtain all at two-dimensional quadrature spreading codes with one deck.

Therefore the invention has the advantages that a new-type two-dimensional quadrature spreading codes is provided, and its ranks number can have very big flexible variation, also allow the MC-DS/CDMA communication system, can frequency wave keep count of and employed exhibition frequency coefficient sign indicating number on have very big elastic space.Tree like one dimension orthogonal variable exhibition frequency coefficient sign indicating number produces via recurrence, and similarly, this new-type two-dimensional quadrature spreading codes also is to produce via recurrence.Therefore when this sign indicating number was used in the MC-DS/CDMA communication system, the multiple data transmission rate also can be reached by variable-length exhibition frequency and many yards technology.

The present invention also has another advantage, and two-dimensional quadrature exhibition of the present invention has the characteristic of zero circulation auto-correlation and zero circulation intercorrelation frequently, therefore can keep orthogonality between different channel, so do not need two-layer exhibition technology (two-layered) frequently.

Description of drawings

Preferred good embodiment of the present invention will be aided with following accompanying drawing and do more detailed elaboration, wherein:

Figure 1A is the simple block diagram of existing MC-DS/CDMA communication system.

Figure 1B is the schematic diagram of the M * N spreading codes matrix of the 2D-OVSF sign indicating number of existing MC-DS/CDMA communication system.

Fig. 2 is used for the part schematic diagram of branch code tree of the 2D-OVSF sign indicating number of MC-DS/CDMA communication system for the embodiment of the invention.

Fig. 3 is the 2D-OVSF sign indicating number schematic diagram that is applied to the regular length of first method in the embodiment of the invention.

Fig. 4 is for reaching the schematic diagram that different rates transmits to separate wave number method in the embodiment of the invention.

Fig. 5 is for reaching the schematic diagram of different rates transmission with variable wave number method in the embodiment of the invention.

Embodiment

In order to allow above and other objects of the present invention, feature and the advantage can be more apparent, the preferred embodiment of the present invention cited below particularly, and conjunction with figs. elaborates.

Pass through M ₁* N ₁Matrix (number K ₁) and M ₂* N ₂Matrix (number K ₂) two groups of variable exhibitions of two-dimensional quadrature coefficient sign indicating number (2D-OVSF) frequently, but construction goes out (K ₁K ₂) individual (M ₁M ₂) * (N ₁N ₂) two-dimensional quadrature spreading codes, wherein M ₁, N ₁, M ₂, N ₂, K ₁And K ₂Be positive integer.The two-dimensional quadrature spreading codes that is produced in these minutes code trees is applied to the MC-DS/CDMA communication system.The node of each branch code tree all has a corresponding matrix and represents this spreading codes sequence.

Originally, one group of already present M ₁* N ₁Two-dimensional quadrature spreading codes A ⁽ⁱ⁾ _{(M1 * N1)}Be considered as kind of a submatrix.I={1 wherein, 2 ..., K ₁, M ₁Then represent present given frequency wave number, N ₁Represent an exhibition code length and the K of the factor frequently ₁Be 2.And the kind submatrix of each branch code tree is assigned to corresponding parent node.This parent node is used as the first generation child node in the branch code tree, therefore also for dividing the root architecture of code tree.All continuities are the offspring of these parent nodes and cooperate their corresponding two-dimensional quadrature matrix for child node.

Another organizes already present two-dimensional quadrature spreading codes M ₂* N ₂Matrix B _{2 (M2 * N2)} ⁽ⁱ⁾Be a corresponding matrix, i={1 wherein, 2 ..., K ₂, and K ₂Be 2.Plant submatrix $\{{A^{\left(1\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)},{A^{\left(2\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)},...,{A^{\left(K_1\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)}\}$ And corresponding matrix $\{B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(1\right)},B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(2\right)},...,B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(K_2\right)}\}$ Be used for producing the child node in the branch code tree.Second layer child node is (K ₁K ₂) individual (M ₁M ₂* N ₁N ₂) matrix, this second layer child node defines by repeating the following relationship formula:

${C^{((i-1){\mathrm{<figure-callout\; id="2"\; label="K"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">K</figure-callout>}}_2+1)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)}=B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(1\right)}\&CircleTimes;{A^{\left(i\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)}$

${C^{((i-1){\mathrm{<figure-callout\; id="2"\; label="K"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">K</figure-callout>}}_2+2)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)}=B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(2\right)}\&CircleTimes;{A^{\left(i\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)}$

...

${C^{((i-1){\mathrm{<figure-callout\; id="2"\; label="K"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">K</figure-callout>}}_2+K_2)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)}=B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(K_2\right)}\&CircleTimes;{A^{\left(i\right)}}_{({\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1\&times;N_1)}$

This  be expressed as the Kroc Buddhist nun restrain long-pending, and i=1,2,3,4 ..., K ₁By above-mentioned formula, can obtain all at two-dimensional quadrature spreading codes with one deck.

For instance, if when finding out the node that descends one deck again, the primordial seed matrix is the submatrix by the second layer $\{{C^{\left(1\right)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)},{C^{\left(2\right)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)},...,{C^{\left(K_1{K}_2\right)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)}\}$ Replace, the submatrix of this layer has number K ₁K ₂Another group two-dimensional quadrature spreading codes is as corresponding matrix $\{B_{3({\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_3)}^{\left(1\right)},B_{3({\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_3)}^{\left(2\right)},...,B_{3({\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_3)}^{\left(K_3\right)}\}$ Has number K ₃, wherein suppose K ₃Be 2.In the second layer, the two-dimensional quadrature matrix is to form by repeating the definition of following relationship formula:

${C^{((i-1){\mathrm{<figure-callout\; id="3"\; label="K"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">K</figure-callout>}}_3+1)}}_{(M_1{M}_2{\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_1{N}_2{N}_3)}=B_{3({\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_3)}^{\left(1\right)}\&CircleTimes;{C^{\left(i\right)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)}$

${C^{((i-1){\mathrm{<figure-callout\; id="3"\; label="K"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">K</figure-callout>}}_3+2)}}_{(M_1{M}_2{\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_1{N}_2{N}_3)}=B_{3({\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_3)}^{\left(2\right)}\&CircleTimes;{C^{\left(i\right)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)}$

...

${C^{((i-1){\mathrm{<figure-callout\; id="3"\; label="K"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">K</figure-callout>}}_3+K_3)}}_{(M_1{M}_2{\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_1{N}_2{N}_3)}=B_{3({\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_3)}^{\left(K_3\right)}\&CircleTimes;{C^{\left(i\right)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_1{N}_2)}$

This  be expressed as the Kroc Buddhist nun restrain long-pending, and i=1,2,3,4 ..., K ₁K ₂

Hence one can see that, by repeating said method and optionally use various corresponding matrix in each layer $\{B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(1\right)},B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(2\right)},...,B_{2({\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2\&times;N_2)}^{\left(K_2\right)}\},$ $\{B_{3({\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_3)}^{\left(1\right)},B_{3({\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_3)}^{\left(2\right)},...,B_{3({\mathrm{<figure-callout\; id="3"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_3\&times;N_3)}^{\left(K_3\right)}\},...,$ $\{B_{p(M_p\&times;N_p)}^{\left(1\right)},B_{p(M_p\&times;N_p)}^{\left(2\right)},...,B_{p(M_p\&times;N_p)}^{\left(K_p\right)}\},$ Can try to achieve p _ThThe two-dimensional quadrature matrix of child node in the layer $\{{C^{\left(1\right)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2...M_p\&times;N_1{\mathrm{<figure-callout\; id="2"\; label="N"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">N</figure-callout>}}_2...N_p)},{C^{\left(2\right)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2...M_p\&times;N_1{\mathrm{<figure-callout\; id="2"\; label="N"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">N</figure-callout>}}_2...N_p)},...,{C^{(K_1{\mathrm{<figure-callout\; id="2"\; label="K"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">K</figure-callout>}}_2...K_p)}}_{(M_1{\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2...M_p\&times;N_1{\mathrm{<figure-callout\; id="2"\; label="N"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">N</figure-callout>}}_2...N_p)}\}.$

It should be noted that the selection and the unrestriction of corresponding matrix, as long as corresponding matrix is one group of two-dimensional quadrature spreading codes-in other words be the tool orthogonality.And and the initial seed matrix of parent node tool relevance also do not have that it is restricted, only limit to the two-dimensional quadrature matrix.Yet if will keep the framework of whole minute code tree, planting submatrix can be restricted.For instance, the 3rd layer node must be by the node of last layer as obtaining in the above-mentioned formula of kind of submatrix and substitution, simultaneously, the 3rd layer node is the kind submatrix of the 4th node layer just.What deserves to be mentioned is the corresponding matrix of all groups, all can be identical and equal initial kind submatrix.For instance, if with M ₁=M ₂=...=M _p=2, N ₁=N ₂=...=N _p=2, K ₁=K ₂=...=K _p=2, and ${A^{\left(1\right)}}_{(2\&times;2)},{A^{\left(2\right)}}_{(2\&times;2)}\}=\{{B^{\left(1\right)}}_{(2\&times;2)},{B^{\left(2\right)}}_{(2\&times;2)}\}=\{\left[\begin{array}{cc}+& +\\ +& -\end{array}\right],\left[\begin{array}{cc}+& -\\ +& +\end{array}\right]\}.$ Be reference conditions."+" representative+1 "-" then represents-1 in embodiments of the present invention.Repeating said method can obtain and one group of M * N two-dimensional quadrature spreading codes.This M=2 wherein ^k, N=2 ^l, k＞0 and 1＞0.This group spreading codes wherein one group of special case of the invention process at last.

See also Fig. 2.Fig. 2 is the part schematic diagram of the branch code tree 20 of the two-dimensional quadrature spreading codes that is used for the MC-DS/CDMA communication system in the embodiment of the invention.It is that 44 * 3 two-dimensional quadrature spreading codes are as the seed matrix A that one group of number at first is provided ⁽ⁱ⁾ _{(4 * 3)}, wherein the scope of " i " from 1 to 4.More specifically, matrix A ⁽ⁱ⁾ _{(4 * 3)}For:

${A^{\left(1\right)}}_{(4\&times;3)}=\left[\begin{array}{ccc}+& -& +\\ +& +& -\\ +& +& +\\ +& +& -\end{array}\right],$ ${A^{\left(2\right)}}_{(4\&times;3)}=\left[\begin{array}{ccc}-& +& +\\ -& -& -\\ -& +& +\\ -& +& -\end{array}\right],$ ${A^{\left(3\right)}}_{(4\&times;3)}=\left[\begin{array}{ccc}-& +& +\\ -& +& -\\ +& -& -\\ +& +& +\end{array}\right],$ ${A^{\left(4\right)}}_{(4\&times;3)}=\left[\begin{array}{ccc}+& +& +\\ +& +& -\\ -& +& -\\ -& -& +\end{array}\right]$

Each submatrix A ⁽ⁱ⁾ _{(4 * 3)}All corresponding parent node 22a-22d tool relevance with it.Next another group number is provided is 2 two-dimensional quadrature matrix, B ^(j) _{(2 * 2)}, as corresponding matrix.Wherein the scope of " j " is 1 to 2, and shows as follows:

${B^{\left(1\right)}}_{(2\&times;2)}=\left[\begin{array}{cc}+& +\\ +& -\end{array}\right],$ ${B^{\left(2\right)}}_{(2\&times;2)}=\left[\begin{array}{cc}+& -\\ +& +\end{array}\right]$

By the seed matrix A ⁽ⁱ⁾ _{(4 * 3)}And corresponding matrix B ^(j) _{(2 * 2)}, can try to achieve p _ThM * N two-dimensional quadrature spreading codes in the layer, wherein M=4 (2) ^K-1, N=3 (2) ^K-1In this example, the corresponding matrix that produces each straton node is identical, but not all example all needs identical corresponding matrix.Each node 20 in the branch code tree all can be supported two child nodes.In order to produce the second layer (k=2) of each the child node 24a-24h relevant, need to use above-mentioned replicated relation formula in the hope of this second layer with parent node 22a-22d.For instance, in order to obtain corresponding child node 24aC respectively _{1 (8 * 6)} ⁽¹⁾And 24bC _{1 (8 * 6)} ⁽²⁾, parent node 22a matrix is regarded as kind of a submatrix.The kind submatrix of this child node 24a and 24b is A ⁽¹⁾ _{(4 * 3)}, and its corresponding child node 24a, 24b matrix try to achieve by the following relationship formula:

$C_{1(8\&times;6)}^{\left(1\right)}={B^{\left(1\right)}}_{(2\&times;2)}{{\&CircleTimes;A}^{\left(1\right)}}_{(4\&times;3)}$

$C_{1(8\&times;6)}^{\left(2\right)}={B^{\left(2\right)}}_{(2\&times;2)}{{\&CircleTimes;A}^{\left(1\right)}}_{(4\&times;3)}$

In the same manner, just and A ⁽²⁾ _{(4 * 3)}The inferior parent node 22b of tool relevance, the C of its corresponding child node 24c, 24d _{1 (8 * 6)} ⁽³⁾And C _{1 (8 * 6)} ⁽⁴⁾Matrix is to try to achieve by the following relationship formula:

$C_{1(8\&times;6)}^{\left(3\right)}={B^{\left(1\right)}}_{(2\&times;2)}{{\&CircleTimes;A}^{\left(2\right)}}_{(4\&times;3)}$

$C_{1(8\&times;6)}^{\left(4\right)}={B^{\left(2\right)}}_{(2\&times;2)}{{\&CircleTimes;A}^{\left(2\right)}}_{(4\&times;3)}$

All second layer matrixes relevant with child node 24a-24h all can be by repeating among Fig. 2 that the above-mentioned stage obtained and be showed in the embodiment of the invention.So submatrix C _{1 (8 * 6)} ⁽ⁱ⁾The general equation formula can try to achieve and disclose as follows by repeating aforesaid equation:

$C_{1((4\&times;2)\&times;(3\&times;2))}^{((i-1)2+j)}={B^{\left(j\right)}}_{(2\&times;2)}{{\&CircleTimes;A}^{\left(i\right)}}_{(4\&times;3)}$ (formula 1)

In formula (1), " i " is from 1 to 4 and parent node 22a-22d also is considered simultaneously.For each " i " value, " j " is from 1 to 2, and the specific child node matrix of parent node is defined by " i ".

Can try to achieve the 3rd layer matrix by repeating above-mentioned formula (1), this moment with second layer node as kind of a submatrix, and corresponding matrix B ^(j) _{(2 * 2)}With identical in the formula (1).For the 3rd layer, as follows about the general equation formula of the matrix of descendants's node 26:

$C_{2((8\&times;2)\&times;(6\&times;2))}^{((i-1)2+j)}={B^{\left(j\right)}}_{(2\&times;2)}\&CircleTimes;C_{1(8\&times;6)}^{\left(i\right)}$ (formula 2)

In formula (2), " i " is from 1 to 8, and parent node 22a-22h also is considered simultaneously.For each " i " value, " j " is from 1 to 2, and the specific child node matrix of this parent node is defined by " i ".

Comprehensive above-mentioned seemingly binary (binary-like) the branch code tree that can try to achieve the two-dimensional quadrature spreading codes.Though disclosed 2 * 2 the most basic corresponding matrixes, yet any general M * N two-dimensional quadrature matrix all can be produced the branch code tree as corresponding matrix.In addition, this new-type two-dimensional quadrature spreading codes is not limited to diadactic structure, and each node can have three or more Zhi Gan.In addition, because corresponding matrix can be different and different with level, so each branch code tree has identical child node number for wanting with continuity (subsequent) generation or previous (previous) generation.Yet the orthogonality of embodiment must possess " even number " (even) and " radix " circulation auto-correlation lobe (Cyclic autocorrelation Sidelobes) speciality of zero (odd).Above-mentioned " even number " or " radix " are defined according to two continuous data position transmission modes.On behalf of one "+1 ", the former " even number " be accompanied by another "+1 " (perhaps, one " 1 " is accompanied by another " 1 "), and on behalf of one "+1 ", latter's " radix " then be accompanied by another " 1 " or fully opposite.

When the frequency wave number in the communication system (Frequency carriers) increases and code length must remain unchanged the time, corresponding on the two-dimensional quadrature matrix just must increase its line number.The embodiment of the invention provides two kinds of methods, with the two-dimensional quadrature spreading codes that is fixed length (Fixed-length) and details are as follows.Yet the notion of matrix module function " " (matrix modulus function) must be explained in advance.The definition of modularity function " " is that roll or the operation principle that rolls left (" roll right " or " roll left " operation) on a similar binary right side, and direction is rotated along the matrix line number from right to left.

For instance, matrix A ⁽¹⁾ _{(2 * 4)}:

${A^{\left(1\right)}}_{(2\&times;4)}=\left[\begin{array}{cccc}+& +& +& -\\ +& -& +& +\end{array}\right]=\left[\begin{array}{cccc}V1& V2& V3& \mathrm{<figure-callout\; id="4"\; label="V"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">V</figure-callout>}4\end{array}\right]$

Wherein be somebody's turn to do " v1 ", " v2 ", " v3 " and " v4 " is A ⁽¹⁾ _{(2 * 4)}Line number vector (column vectors).Work as A ⁽¹⁾ _{(2 * 4) 1}During=[v4 v1 v2 v3], all line number vectors move to right 1, and line number vector " v4 " is then put from right lateral numerical digit and is rolled into leftmost position.Work as A ⁽¹⁾ _{(2 * 4) (1)}=[v2 v3 v4 v1], all line number vectors move to left 1, cooperate line number vector " v1 " to put from left lateral numerical digit and are rolled into the least significant.Certainly, must cooperate absolute value to come Executive Module operation (modulus operator) and A greater than 1 ⁽¹⁾ _{(2 * 4) 3}=[v2 v3 v4 v1] and A ⁽¹⁾ _{(2 * 4) (1)}Identical.

First production method of the two-dimensional quadrature spreading codes of regular length (being called method A) is by original two-dimensional orthogonal matrix A ⁽¹⁾ _{(2 * N)}With A ⁽²⁾ _{(2 * N)}And produce.These matrixes all are regarded as and the relevant matrix of branch code tree parent node.Next one group of specific 2 * 2 matrix D is provided.This specific matrix D _j∈ D is as follows:

$D_j=\left[\begin{array}{cc}{d}_{j1}& d_{j3}\\ d_{j2}& {\mathrm{<figure-callout\; id="4"\; label="d\; j"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">d</figure-callout>}}_j\end{array}\right]$

Each d _jValue (d _J1, d _J2, d _J3And d _J4) be not+1 be exactly-1.In addition, d _jValue must be observed the following relationship formula:

d _j1d _j3+d _j2d _j4＝0

Therefore, the number of this group matrix D is limited.As long as and meet above-mentioned condition, d _jCan arrange in any form and form.

If the method A of utilization obtains the two-dimensional quadrature matrix branch code tree of a regular length, the two-dimensional quadrature spreading codes of this regular length can obtain by repeating the following relationship formula:

${C^{(2i-1)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{j1}{A^{\left(i\right)}}_{(M\&times;N)}\\ d_{j2}{A^{\left(i\right)}}_{(M\&times;N){\&CirclePlus;\mathrm{\&mu;}}_i}\end{array}\right],$ (formula 3A)

${C^{\left(2i\right)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{j3}{A^{\left(i\right)}}_{(M\&times;N)}\\ d_{j4}{A^{\left(i\right)}}_{(M\&times;N){\&CirclePlus;\mathrm{\&mu;}}_1}\end{array}\right],$ (formula 3B)

Wherein this i ∈ 1,2,3 ..., M}, and divide the μ in all levels in the code tree _iMust be odd number or even number (μ entirely all _i∈ 0,2,4..., (N-2) } or μ _i∈ 1,3,5..., (N-1) }).D during above-mentioned formula (3A) reaches (3B) _J1, d _J2, d _J3And d _J4Arbitrary matrix D for this group matrix of D _jAs above routine described, C ^(2i-1) _{(2M * N)}With C ^(2i-1) _{(2M * N)}Representative reaches two child nodes that (3B) produce by formula (3A) in a certain layer of minute code tree.The parent node of its matrix is A ⁽ⁱ⁾ _{(M * N)}

If with following start node matrix (that is be in the branch code tree with the matrix of the 1st node layer) is an example:

${A^{\left(1\right)}}_{(2\&times;4)}=\left[\begin{array}{cccc}+& +& +& -\\ +& -& +& +\end{array}\right],$ And

${A^{\left(2\right)}}_{(2\&times;4)}=\left[\begin{array}{cccc}+& +& -& +\\ +& -& -& -\end{array}\right]$

Routine at this point:

${A^{\left(1\right)}}_{(2\&times;4)\&CirclePlus;3}=\left[\begin{array}{cccc}+& +& -& +\\ -& +& +& +\end{array}\right],$ And

${A^{\left(1\right)}}_{(2\&times;4)\&CirclePlus;1}=\left[\begin{array}{cccc}-& +& +& +\\ +& +& -& +\end{array}\right].$

See also Fig. 3.Fig. 3 is a regular length two-dimensional quadrature matrix branch code tree 30.With minute code tree 30 is example, μ ₁=3, μ ₂=1, and D ₁, D ₂Matrix then is selected from D; As follows:

${\mathrm{<figure-callout\; id="1"\; label="D"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">D</figure-callout>}}_1={\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">D</figure-callout>}}_2=\left[\begin{array}{cc}+& +\\ +& -\end{array}\right]$

Parent node 32a, 32b are the two-dimensional quadrature matrix A ⁽¹⁾ _{(2 * 4)}, A ⁽²⁾ _{(2 * 4)}In addition, for the corresponding child node 34a and the 34b of the two-dimensional quadrature spreading codes of trying to achieve regular length, need by parent node 32a A ⁽¹⁾ _{(2 * 4)}Substitution formula (3A) reaches (3B), can obtain after calculating:

$C_{1(4\&times;4)}^{\left(1\right)}=\left[\begin{array}{c}(+){A^{\left(1\right)}}_{(2\&times;4)}\\ (+){A^{\left(1\right)}}_{(2\&times;4)\&CirclePlus;3}\end{array}\right]=\begin{array}{c}\left[\begin{array}{cccc}+& +& +& -\\ +& -& +& +\\ +& +& -& +\\ -& +& +& +\end{array}\right],\end{array}$ And

$C_{1(4\&times;4)}^{\left(2\right)}=\left[\begin{array}{c}(+){A^{\left(1\right)}}_{(2\&times;4)}\\ (-){A^{\left(1\right)}}_{(2\&times;4)\&CirclePlus;3}\end{array}\right]=\begin{array}{c}\left[\begin{array}{cccc}+& +& +& -\\ +& -& +& +\\ -& -& +& -\\ +& -& -& -\end{array}\right]\end{array}.$

In like manner, child node 34c and 34d are as follows:

$C_{1(4\&times;4)}^{\left(3\right)}=\left[\begin{array}{c}(+){A^{\left(2\right)}}_{(2\&times;4)}\\ (+){A^{\left(2\right)}}_{(2\&times;4)\&CirclePlus;1}\end{array}\right]=\begin{array}{c}\left[\begin{array}{cccc}+& +& -& +\\ +& -& -& -\\ +& +& +& -\\ -& +& -& -\end{array}\right],\end{array}$ And

$C_{1(4\&times;4)}^{\left(4\right)}=\left[\begin{array}{c}(+){A^{\left(2\right)}}_{(2\&times;4)}\\ (+){A^{\left(2\right)}}_{(2\&times;4)\&CirclePlus;1}\end{array}\right]=\begin{array}{c}\left[\begin{array}{cccc}+& +& -& +\\ +& -& -& -\\ -& -& -& +\\ +& -& +& +\end{array}\right].\end{array}$

In sum, can obtain by above-mentioned method A according to whole group of regular length 2D orthogonal code in the embodiment of the invention.Fig. 3 can express the general equation formula of the matrix of child node 36 in the 3rd layer simultaneously.Formula 3A and 3B are applied to single node 34a-34d in the hope of the 3rd layer matrix.

The embodiment of the invention also provides the another one method, can produce the two-dimensional quadrature matrix of regular length equally; Be called method B.As method A, method B at first provides one group of initial 2 * N orthogonal matrix { A ⁽¹⁾ _{(2 * N)}, A ⁽²⁾ _{(2 * N)}.By repeating the following relationship formula to obtain a regular length 2D orthogonal code.

${A^{(4i-3)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{j1}{A^{(2i-1)}}_{(M\&times;N)}\\ d_{j2}{A^{\left(2i\right)}}_{(M\&times;N){\&CirclePlus;\mathrm{\&mu;}}_1}\end{array}\right]$ (formula 4A),

${A^{(4i-2)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{j3}{A^{(2i-1)}}_{(M\&times;N)}\\ d_{j4}{A^{\left(2i\right)}}_{(M\&times;N)\&CirclePlus;{\mathrm{\&mu;}}_1}\end{array}\right]$ (formula 4B),

${A^{(4i-1)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{k1}{A^{\left(2i\right)}}_{(M\&times;N)}\\ d_{k2}{A^{(2i-1)}}_{(M\&times;N){\&CirclePlus;\mathrm{\&mu;}}_2}\end{array}\right]$ (formula 4C), and

${A^{\left(4i\right)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{k3}{A^{\left(2i\right)}}_{(M\&times;N)}\\ d_{k4}{A^{(2i-1)}}_{(M\&times;N)\&CirclePlus;{\mathrm{\&mu;}}_2}\end{array}\right]$ (formula 4D).

Above-mentioned i value is the positive integer between 1 to M/2; Be i ∈ 1,2 ..., M/2}.With the μ in one deck _iMust be even number (comprising zero) or odd number.At last, d _J1, d _J2, d _J3And d _J4Arbitrary matrix D for particular matrix D _jIn like manner, d _K1, d _K2, d _K3And d _K4Arbitrary matrix D for particular matrix D _kThat is to say D _j, D _k∈ D.Form 1 has been showed an example that produces the two-dimensional quadrature spreading codes with method B.

Form 1

Can learn that by above-mentioned discussion form 1 is to be that function extends to higher stratum with M, M=16 just, M=32, or the like.

For instance:

$D_k=D_j=\left[\begin{array}{cc}+& +\\ +& -\end{array}\right]$

M=4 is example and hypothesis μ ₁=μ ₂=0, can be with above-mentioned formula (4A), (4B), (4C) and (4D) change and ask and obtain following formula:

$C_{1(4\&times;4)}^{\left(1\right)}=\begin{array}{}\end{array}\left[\begin{array}{c}(+){A^{\left(1\right)}}_{(2\&times;4)}\\ (+){A^{\left(2\right)}}_{(2\&times;4)}\end{array}\right],$

$C_{1(4\&times;4)}^{\left(2\right)}=\begin{array}{}\end{array}\left[\begin{array}{c}(+){A^{\left(1\right)}}_{(2\&times;4)}\\ (-){A^{\left(2\right)}}_{(2\&times;4)}\end{array}\right],$

$C_{1(4\&times;4)}^{\left(3\right)}=\begin{array}{}\end{array}\left[\begin{array}{c}(+){A^{\left(2\right)}}_{(2\&times;4)}\\ (+){A^{\left(1\right)}}_{(2\&times;4)}\end{array}\right],$ And

$C_{1(4\&times;4)}^{\left(4\right)}=\begin{array}{}\end{array}\left[\begin{array}{c}(+)A_{.(2\&times;4)}^{\left(2\right)}\\ (-){A^{\left(1\right)}}_{(2\&times;4)}\end{array}\right].$

In similar branch, reaching (4D) via above-mentioned (4A), (4B), (4C), the formula definable goes out Matrix C _{2 (8 * 4)} ⁽ⁱ⁾, as follows:

$C_{2(8\&times;4)}^{\left(1\right)}=\left[\begin{array}{c}(+)C_{1(4\&times;4)}^{\left(1\right)}\\ (+)C_{1(4\&times;4)}^{\left(2\right)}\end{array}\right],$

$C_{2(8\&times;4)}^{\left(2\right)}=\left[\begin{array}{c}(+)C_{1(4\&times;4)}^{\left(1\right)}\\ (-)C_{1(4\&times;4)}^{\left(2\right)}\end{array}\right],$

$C_{2(8\&times;4)}^{\left(3\right)}=\left[\begin{array}{c}(+)C_{1(4\&times;4)}^{\left(2\right)}\\ (+)C_{1(4\&times;4)}^{\left(1\right)}\end{array}\right],$

$C_{2(8\&times;4)}^{\left(4\right)}=\left[\begin{array}{c}(+)C_{1(4\&times;4)}^{\left(2\right)}\\ (-)C_{1(4\&times;4)}^{\left(1\right)}\end{array}\right],$

$C_{2(8\&times;4)}^{\left(5\right)}=\left[\begin{array}{c}(+)C_{1(4\&times;4)}^{\left(3\right)}\\ (+)C_{1(4\&times;4)}^{\left(4\right)}\end{array}\right],$

$C_{2(8\&times;4)}^{\left(6\right)}=\left[\begin{array}{c}(+)C_{1(4\&times;4)}^{\left(3\right)}\\ (-)C_{1(4\&times;4)}^{\left(4\right)}\end{array}\right],$

$C_{2(8\&times;4)}^{\left(7\right)}=\left[\begin{array}{c}(+)C_{1(4\&times;4)}^{\left(4\right)}\\ (+)C_{1(4\&times;4)}^{\left(3\right)}\end{array}\right],$ And

$C_{2(8\&times;4)}^{\left(8\right)}=\left[\begin{array}{c}(+)C_{1(4\&times;4)}^{\left(4\right)}\\ (-)C_{1(4\&times;4)}^{\left(3\right)}\end{array}\right].$

Two-dimensional quadrature spreading codes according to whole group of regular length of the embodiment of the invention also can obtain by said method B.Yet when obtaining the two-dimensional quadrature spreading codes with method B, the two-dimensional quadrature matrix that is positioned at different levels is not kept its orthogonality completely, therefore can not both use simultaneously.

Yet, by the regular length spreading codes that method B produces, keep its orthogonality at the spreading codes of identical level, can be assigned to different users simultaneously.

In third generation communication system, have two kinds of methods to reach the purpose of variable velocity transmission: one for many yards technology (multicode scheme) the opposing party's rule be variable-length method (Variable length scheme).Many yards technology are meant that a base station arranges one or more spreading codes to a certain user, to quicken its data transmission bauds.When a user uses two quadrature spreading codes simultaneously, can double its transmission rate.The new-type two-dimensional quadrature spreading codes that the embodiment of the invention produced can be kept with the orthogonality in one deck, therefore is applicable to this kind technology.

On the other hand, the variable-length method is also used on third generation communication system, uses an orthogonal dimension spreading codes to realize at present.This kind method can be required according to the user different message transmission rates, arranged to give the spreading codes of each user different length by base station.When the user obtained short spreading codes, this user obtained a higher data transmission rate.Yet each user once can only use a spreading codes.If need to use the spreading codes of different length, the two-dimensional quadrature square matrix code that only has the branch code tree structure among the present invention can be used.

The embodiment of the invention provides a variable multiple transmission rate method, and this method is disclosed in the Fig. 4 in the embodiment of the invention; Also be called separate carrier technology (Separated-carrier scheme).The 2nd grade 2M * N 2D matrix A ⁽ⁱ⁾ _{(2M * N)}Be to be separated into to have equal length but two less matrix A of carrier number ^(i_a) _{(M * N)}, A ^(i_b) _{(M * N)}, or the matrix of overloading wave number more.For instance, one 4 * 8 two-dimensional quadrature matrixes can be separated into two 2 * 8 two-dimensional quadrature matrixes.By using two spreading codes A simultaneously ^(i_a) _{(M * N)}And A ^(i_b) _{(M * N)}, the user can obtain the twice message transmission rate.A two-dimensional quadrature matrix A ⁽ⁱ⁾ _{(2M * N)}Be separated into A ^(i_a) _{(M * N)}And A ^(i_b) _{(M * N)}Matrix: A ^(i_a) _{(M * N)}Has M row, 1 * N spreading codes vector and be numbered a ₀-a _m-1, A ^(i_b) _{(M * N)}Matrix also has M row, 1 * N spreading codes vector a _m-a _2m-1.A ^(i_a) _{(M * N)}And A ^(i_b) _{(M * N)}Matrix application is at sequence-parallel change-over circuit 42 (serial-to-parallel conversion circuit), and it is the sequence transmission of transmission user data bits 44, and produces two parallel output information streams 46 and 48.Wherein, 46 and 48 is with first M * N matrix A ^(i_a) _{(M * N)}With second M * N matrix A ^(i_b) _{(M * N)}Carry out digital coding and modularization.

Compared to initial 2M * N matrix A ⁽ⁱ⁾ _{(2M * N)}, Fig. 3 provides an example.Matrix A ⁽¹⁾ _{(2 * 4)}Be C _{1 (4 * 4)} ⁽¹⁾, C _{1 (4 * 4)} ⁽²⁾, C _{2 (8 * 4)} ⁽¹⁾, C _{2 (8 * 4)} ⁽²⁾, C _{2 (8 * 4)} ⁽³⁾And C _{2 (8 * 4)} ⁽⁴⁾Father and mother's sign indicating number.When using matrix A ⁽¹⁾ _{(2 * 4)}The time, so its subcode can not be assigned to the different users with father and mother's sign indicating number simultaneously because of not keeping its orthogonality.Yet the sign indicating number of same level (brothers or sisters's sign indicating number (sibling codes)) all can use simultaneously only otherwise use this father and mother's sign indicating number; The C of the second layer for example _{1 (4 * 4)} ⁽¹⁾, C _{1 (4 * 4)} ⁽²⁾Above-mentioned brothers or sisters's sign indicating number discloses in prior art; Sign indicating number with above-mentioned same level is an example:

${A^{\left(1\right)}}_{(2\&times;4)}=\left[\begin{array}{cccc}+& +& +& -\\ +& -& +& +\end{array}\right],$ And

${A^{\left(2\right)}}_{(2\&times;4)}=\left[\begin{array}{cccc}+& +& -& +\\ +& -& -& -\end{array}\right].$

Therefore, can obtain down the column matrix result:

$C_{1(4\&times;4)}^{\left(1\right)}=\left[\begin{array}{c}(+){A^{\left(1\right)}}_{(2\&times;4)}\\ (+){A^{\left(1\right)}}_{(2\&times;4)\&CirclePlus;3}\end{array}\right]=\left[\begin{array}{cccc}+& +& +& -\\ +& -& +& +\\ +& +& -& +\\ -& +& +& +\end{array}\right]=\left[\begin{array}{c}{A^{\left(1a\right)}}_{(2\&times;4)}\\ {A^{\left(1b\right)}}_{(2\&times;4)}\end{array}\right]$

C _{1 (4 * 4)} ⁽¹⁾Matrix is separated into two separate codes, and a component sign indicating number (A is provided ^(1a) _{(2 * 4)}, A ^(1b) _{(2 * 4)}):

${A^{\left(1a\right)}}_{(2\&times;4)}=\left[\begin{array}{cccc}+& +& +& -\\ +& -& +& +\end{array}\right],$ And

${A^{\left(1b\right)}}_{(2\&times;4)}=\left[\begin{array}{cccc}+& +& -& +\\ -& +& +& +\end{array}\right].$

Above-mentioned demal A ^(1a) _{(2 * 4)}And A ^(1b) _{(2 * 4)}Equal tool orthogonalities and be considered as identification sequences can be with above-mentioned demal A ^(1a) _{(2 * 4)}And A ^(1b) _{(2 * 4)}Be assigned to MS-DC/CDMA activation device, so that this activation device transmission rate faster to be provided.Demal (A in addition ^(1a) _{(2 * 4)}, A ^(1b) _{(2 * 4)}) group is different from the demal A of prior art ⁽¹⁾ _{(2 * 4)}And A ⁽²⁾ _{(2 * 4)}When using demal A ⁽¹⁾ _{(2 * 4)}And A ⁽²⁾ _{(2 * 4)}The time, then sub-demal C _{1 (4 * 4)} ⁽¹⁾, C _{1 (4 * 4)} ⁽²⁾, C _{1 (4 * 4)} ⁽³⁾And C _{1 (4 * 4)} ⁽⁴⁾Can not use simultaneously.Yet, divide code character (A if use ^(1a) _{(2 * 4)}, A ^(1b) _{(2 * 4)}), then still can allow other user use Matrix C _{1 (4 * 4)} ⁽³⁾, i.e. C _{1 (4 * 4)} ⁽⁴⁾In sum, when the demal that is provided be when being used simultaneously by other user then user's transmission rate can increase thereupon.Further, in one fen code tree, L ₁The matrix A of layer _{(M1 * N)}Can be divided into 2 ^(m1-m2)Individual L ₂The matrix A of layer _{(M2 * N)}, wherein this minute code tree the initial seed matrix be M _s* N matrix, $M_s=p{\&times;2}^{m_s},$ P is a prime number, ms 〉=0; ${\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_1=p\&times;2^{m_s}\&times;2^{{\mathrm{<figure-callout\; id="1"\; label="m"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">m</figure-callout>}}_1};$ ${\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">M</figure-callout>}}_2=p{\&times;2}^{m_s}\&times;2^{{\mathrm{<figure-callout\; id="2"\; label="m"\; filenames="A20041000780900251.png"\; state="\{\{state\}\}">m</figure-callout>}}_2}.$ From the above mentioned, by the separate carrier technology, can reach than reset condition fast 2 ^M1Message transmission rate doubly.In addition, the separation wave number method (Separated-carrier scheme) of M * N two-dimensional quadrature spreading codes is kept its demal orthogonality and is possessed zero circulation auto-correlation lobe (Cyclic autocorrelation Sidelobes) and the characteristic of zero circulation intercorrelation (CyclicCross-Correlation).So the demal of such MC-DS/CDMA communication system is to keep its orthogonality, even at asynchronous channel (asynchronous channels).

If A ^(j) _{(2M * N)}Parent node be not equal to A ⁽ⁱ⁾ _{(2M * N)}Parent node, from A ⁽ⁱ⁾ _{(2M * N)}The sign indicating number of after separating, A ^(i_a) _{(M * N)}And A ^(i_b) _{(M * N)}All be orthogonal to A ^(j) _{(2M * N)}For instance, suppose the two-dimensional quadrature matrix A ⁽¹⁾ _{(8 * 8)}Be to be separated into matrix A ^(1a) _{(4 * 8)}And A ^(1b) _{(4 * 8)}Matrix A then ^(1a) _{(4 * 8)}And A ^(1b) _{(4 * 8)}, all be orthogonal to general A ^(j) _{(8 * 8)}J={3 ..., 8} is but with A ⁽²⁾ _{(8 * 8)}Non-orthogonal, because A ⁽¹⁾ _{(8 * 8)}With A ⁽²⁾ _{(8 * 8)}Identical father and mother's matrix is arranged.Certainly, matrix A ^(1a) _{(4 * 8)}And A ^(1b) _{(4 * 8)}Be not orthogonal to original unsegregated matrix A ⁽¹⁾ _{(8 * 8)}Work as matrix A ^(1a) _{(4 * 8)}With A ^(1b) _{(4 * 8)}Be assigned to same user when obtaining the twice message transmission rate, matrix A ⁽¹⁾ _{(8 * 8)}And A ⁽²⁾ _{(8 * 8)}Neitherly other user can be assigned to.In the embodiment of the invention, can realize variable multiple speed rates with the separate carrier method by the two-dimensional quadrature spreading codes that recurrence framework or method A are produced.

The embodiment of the invention provides a kind of method in addition, and " variable wave number " makes the use of two-dimensional quadrature spreading codes more flexible.As mentioned above, be resultant by the resulting regular length two-dimensional quadrature of method A spreading codes with tree-shaped method construction.Similar with the framework of an orthogonal dimension spreading codes, as long as being positioned at different levels, the two-dimensional quadrature spreading codes that this method produces then keeps its orthogonality, but father and mother's matrix exception.Because the regular length two-dimensional quadrature matrix of different wave numbers is all kept its orthogonality, therefore can be assigned to different users simultaneously.

See also embodiment of the invention Fig. 5, Fig. 5 has disclosed the figure of a variable wave number method.Can obtain the branch code tree of a regular length two-dimensional quadrature spreading codes via method A.Based on the different hardware design, different type mobile phone is then supported the wave number of varying number.With regard to mobile phone user's position, base station must provide identical wireless communication services (Wireless service) at the different hardware design.Suppose that first user's mobile phone 52 supports M wave number second users then to support M/2 wave number and two from the selected matrix of regular length two-dimensional quadrature spreading codes branch code tree.This two matrix is respectively matrix A ⁽ⁱ⁾ _{(M * N)}53 and matrix B ^(j) _{((M/2) * N}54, matrix A wherein ⁽ⁱ⁾ _{(M * N)}53 offer first user's mobile phone 51 and matrix B ^(j) _{((M/2) * N)}54 offer second user's mobile phone 52.

The coding and regulating device 58 of first user's mobile phone 51 is to pass through matrix A ⁽ⁱ⁾ _{(M * N)}53 come the reception data to flow 56 with the coding and the transmission means of frequency modulation.The coding and regulating device 59 of second user's mobile phone 52 is to pass through matrix B ^(j) _{((M/2) * N)}54 come the reception data to flow 57 with the coding and the transmission means of frequency modulation.Characteristic in the embodiment of the invention is the number that can change its wave number along with different systems.

When using an orthogonal dimension spreading codes, have the situation that so-called spreading codes blocks (code blocking).Spreading codes blocks and to be meant after arbitrary quadrature spreading codes is assigned with, all therewith relevant father and mother and the submatrix of matrix all can't use, also just can't arrange to give other user mobile phone.This situation is the restriction by its tree, since the two-dimensional quadrature spreading codes that is produced by method A also has tree, this sign indicating number also has the situation that spreading codes blocks.In addition, variable wave number method is not supported variable rate transmission, because have identical minute code length and during the two-dimensional quadrature spreading codes of different wave numbers, message transmission rate still is identical when the user has been assigned with.

At last, have zero circulation auto-correlation lobe (zeroautocorrelation) and zero circulation intercorrelation (zero cross-correlation) speciality via the demal matrix that minute code tree produced.These two-dimensional quadrature spreading codes branch code trees are all kept its orthogonality in single channel, therefore do not need two levels exhibition technology frequently.The embodiment of the invention can be applicable on any wireless communication apparatus (Wireless device), as mobile phone, base station and computing platform etc., and is to handle by the processor in the wireless communication apparatus or through the computer program of design in general.And the two-dimensional quadrature spreading codes of obtaining by the formula recurrence in advance is installation and uses on wireless communication apparatus.

Though the present invention illustrates in its relevant preferred good embodiment; yet it is not in order to limit the present invention; should be appreciated that; any those of ordinary skill in the art is not in breaking away from design of the present invention and scope; should do various modifications and change, and protection scope of the present invention should be as the criterion with the appended scope that claim was defined.

Claims (28)

1, a kind of method that in the CDMA communication system, produces the two-dimensional quadrature spreading codes, this method comprises:

Produce one fen code tree of two-dimensional quadrature spreading codes, each node in this minute code tree all comprises a corresponding matrix;

Node from this minute code tree is selected one M * N matrix; Wherein

M represents the available frequency carrier number of system, and N represents spreading codes length;

Utilize this M * N matrix to provide to one the one CDMA activation device as an identification sequences.

2, the method for generation two-dimensional quadrature spreading codes as claimed in claim 1 is characterized in that, this minute the method that produces of code tree include:

Some kinds of submatrixs are provided, and this kind submatrix is assigned to some parent nodes of this minute code tree respectively;

Some corresponding matrixes are provided; And

Produce the plurality of sub node from parent node in minute code tree, the matrix of this child node is done a Crow Buddhist nun and is restrained long-pending (Kronecker Product) and can get by planting submatrix and corresponding matrix.

3, the method for generation two-dimensional quadrature spreading codes as claimed in claim 2 is characterized in that: this seed defined matrix is Should (i) between 1 and K ₁Between.

4, the method for generation two-dimensional quadrature spreading codes as claimed in claim 2 is characterized in that: this correspondence defined matrix is

Should (j) between 1 and K ₂Between.

5, the method for generation two-dimensional quadrature spreading codes as claimed in claim 2, it is characterized in that: the matrix size of this child node is defined as M ₁M ₂* N ₁N ₂

6, the method for generation two-dimensional quadrature spreading codes as claimed in claim 2 is characterized in that: this kind submatrix is resultant by repeating the following relationship formula:

${C^{((i-1)K_2+j)}}_{(M_2{M}_1\&times;N_2{N}_1)}={B^{\left(j\right)}}_{(M_2\&times;N_2)}\&CircleTimes;{A^{\left(i\right)}}_{(M_1\&times;N_1)},$

Wherein,  restrains long-pending for the Crow Buddhist nun.

7, the method for generation two-dimensional quadrature spreading codes as claimed in claim 2 is characterized in that: in minute code tree, mutually orthogonal with the pairing matrix of any two nodes of one deck.

8, the method for generation two-dimensional quadrature spreading codes as claimed in claim 2 is characterized in that: in minute code tree, any two joints of different one decks as long as one of them be not another continuity for child node, then its pairing matrix is mutually orthogonal.

9, a kind of method that in the CDMA communication system, produces regular length two-dimensional quadrature spreading codes, this method comprises:

Produce one fen code tree of regular length two-dimensional quadrature spreading codes, each node in this minute code tree all comprises a corresponding matrix;

Node from this minute code tree is selected one M * N matrix; Wherein

M represents the available frequency carrier number of system, and N represents spreading codes length;

Utilize this M * N matrix to provide to one the one CDMA activation device as an identification sequences.

10, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 9 is characterized in that, this minute the method that produces of code tree include:

Some kinds of submatrixs are provided, and this kind submatrix is assigned to some parent nodes of this minute code tree respectively;

Some 2 * 2 corresponding matrixes are provided; And

In minute code tree, produce the plurality of sub node from parent node, the matrix of this child node by its seed matrix multiple should the correspondence matrix element-specific can get.

11, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 10, it is characterized in that: this seed defined matrix is

Should (i) between 1 and K ₁Between.

12, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 10, it is characterized in that: this correspondence defined matrix is D _j:

D _jBe defined as And this d _J1, d _J2, d _J3And d _J4Be+1 or-1.

13, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 10 is characterized in that: it is resultant that the matrix of this child node repeats the following relationship formula:

${C^{(2i-1)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{j1}{A^{\left(i\right)}}_{(M\&times;N)}\\ d_{j2}{A^{\left(i\right)}}_{(M\&times;N)\&CirclePlus;{\mathrm{\&mu;}}_i}\end{array}\right];$ And

${C^{\left(2i\right)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{j3}{A^{\left(i\right)}}_{(M\&times;N)}\\ d_{j4}{A^{\left(i\right)}}_{(M\&times;N)\&CirclePlus;{\mathrm{\&mu;}}_i}\end{array}\right].$

14, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 10, it is characterized in that: the matrix size of this child node is defined as 2M * N.

15, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 9 is characterized in that: in minute code tree, mutually orthogonal with the pairing matrix of any two nodes of one deck.

16, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 9 is characterized in that: in minute code tree, any two joints of different one decks as long as one of them be not another continuity for child node, then its pairing matrix is mutually orthogonal.

17, a kind of method that in the CDMA communication system, produces regular length two-dimensional quadrature spreading codes, this method comprises:

A heredity that produces two-dimensional quadrature exhibition frequency division sign indicating number divides code structure;

Among this genetic code structure, select one M * N matrix; Wherein

M represents the available frequency carrier number of system, and N represents spreading codes length;

Utilize this M * N matrix to provide to one the one CDMA activation device as an identification sequences.

18, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 17 is characterized in that, the method that this genetic code structure produces includes:

Some kinds of submatrixs and some 2 * 2 corresponding matrixes are provided;

From some kinds of submatrixs, choose any two and be a pair of father and mother's matrix;

Produce four son continuity demals, the matrix of this child node can get by the multiply each other element-specific of this correspondence matrix of his father's mother matrix.

19, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 18 is characterized in that: these four son continuity codes are defined as C respectively ^(4i-3) _{(2M * N)}, C ^(4i-2) _{(2M * N)}, C ^(4i-1) _{(2M * N)}And C ⁽⁴ⁱ⁾ _{(2M * N)}

20, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 18 is characterized in that: these two father and mother plant submatrix and are defined as A respectively ⁽²ⁱ⁾ _{(M * N)}And A ^(2i-1) _{(M * N)}, and be somebody's turn to do (2i) between 2 and M between.

21, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 18 is characterized in that, this correspondence defined matrix is D _j:

D _jBe defined as

And this d _J1, d _J2, d _J3And d _J4Be+1 or-1

And this d _J1d _J3+ d _J2d _J4=0.

22, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 18 is characterized in that, four pairing matrixes of son continuity demal obtain by repeating the following relationship formula:

${C^{(4i-3)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{k1}{A^{(2i-1)}}_{(M\&times;N)}\\ d_{k2}{A^{\left(2i\right)}}_{(M\&times;N)\&CirclePlus;{\mathrm{\&mu;}}_i}\end{array}\right];$

${C^{(4i-2)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{k3}{A^{(2i-1)}}_{(M\&times;N)}\\ d_{k4}{A^{\left(2i\right)}}_{(M\&times;N)\&CirclePlus;{\mathrm{\&mu;}}_i}\end{array}\right];$

${C^{(4i-1)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{k1}{A^{\left(2i\right)}}_{(M\&times;N)}\\ d_{k2}{A^{(2i-1)}}_{(M\&times;N)\&CirclePlus;{\mathrm{\&mu;}}_i}\end{array}\right];$ And

${C^{\left(4i\right)}}_{(2M\&times;N)}=\left[\begin{array}{c}{d}_{k3}{A^{\left(2i\right)}}_{(M\&times;N)}\\ d_{k4}{A^{(2i-1)}}_{(M\&times;N)\&CirclePlus;{\mathrm{\&mu;}}_i}\end{array}\right];$ This i=1 wherein, 2 ..., (M/2).

23, the method for generation regular length two-dimensional quadrature spreading codes as claimed in claim 17 is characterized in that: in minute code tree, mutually orthogonal with the pairing matrix of any two nodes of one deck.

24, a kind of separate carrier method that in the CDMA communication system, produces a variable multiple transmission rate, this method comprises:

Produce one fen code tree of a separable two-dimensional quadrature spreading codes, each node in this minute code tree all comprises a corresponding matrix;

Node from this minute code tree is selected one M * N first matrix;

Separate this first matrix to form (M/2) * N second matrix and (M/2) * N the 3rd matrix;

Utilize this second matrix and the 3rd matrix, to provide an identification sequences to a CDMA activation device respectively.

25, the separate carrier method of generation one variable multiple transmission rate as claimed in claim 24 is characterized in that: the corresponding matrix of one fen code tree of this separable two-dimensional quadrature spreading codes is defined as 2 * 2 matrixes.

26, the separate carrier method of generation one variable multiple transmission rate as claimed in claim 24 is characterized in that, this minute the method that produces of code tree include:

Some kinds of submatrixs are provided, and this kind submatrix is assigned to some parent nodes of this minute code tree respectively;

Some 2 * 2 corresponding matrixes are provided; And

In minute code tree, produce the plurality of sub node from parent node, the matrix of this child node by its seed matrix multiple should the correspondence matrix element-specific can get.

27, the separate carrier method of generation one variable multiple transmission rate as claimed in claim 24 is characterized in that: second matrix and the 3rd matrix and mutually orthogonal with the matrix of the mother matrix quadrature of first matrix.

28, the separate carrier method of generation one variable multiple transmission rate as claimed in claim 24 is characterized in that: this minute the initial seed matrix of code tree be M _s* N matrix, $M_s=p\&times;2^{m_s},$ When $M=p\&times;2^{m_s}\&times;2^m$ The time, two dimension exhibition frequency division sign indicating number A _{(M * N)}Can be divided into 2 at most ^mIndividual A _{(Ms * N)}Matrix.

Images