TWI268051B - Method for generating 2D OVSF codes in multicarrier DS-CDMA systems - Google Patents

Abstract

A multicarrier direct-sequence code-division multiple-access (MC-DS/CDMA) communications system is provided. A code tree of two-dimensional orthogonal variable spreading factor (2D-OVSF) codes is then generated for the system. To generate the code tree, a set of existing M1xN1 2D-OVSF matrices, in the form of A(i)(M1xN1) for i={1, 2, ..., K1} is selected as seed matrices. M1 represents the number of available frequency carriers in the MC-DS/CDMA system, and N1 represents a spreading factor code length. Another set of existing M2xN2 2D-OVSF matrices, in the form of B2(i)(M2xN2) for i={1, 2, ..., K2} is then selected as mapping matrices. The mapping matrices are used to generate corresponding children matrices. These second layer child matrices are M1M2xN1N2 matrices with cardinality K1K2, which are defined by reiterating the relationship, where circle over (x) indicates a Kronecker product, and i=1, 2, 3, 4, ..., K1.

Description

1268051 Cutting, invention description (invention description should be stated: the technical field, prior art, content, implementation and schematic description of the invention) This application is a US continuous application, the application number is 10/063,771, The application period is May 11 2003. [Technical Field] The present invention provides a CDMA Communication system, in particular, a multicarrier direct-sequence code-division multiple -access, MC-DS/CDMA) A method for generating a two-dimensional orthogonal variable spreading factor (2D_OVSF) code and a convertible different rate MC-DS/CDMA communication system in a communication system. [Prior Art] The booming market of the first generation of communication systems and the continuous extension of its related functions have rapidly improved the performance of its transmission and reception, enabling it to transmit data at a high transmission rate. The ever-increasing communication lines have led to the development of third-generation (3G) mobile communication systems, such as the 2Mbps Wideband Code-Division 曰 (Aecess) service, which has become an international mobile communication group. (ΐΜτ_2_) However, it is used for the code division multiple access service in the first-generation mobile communication system. Its fine-grained way to provide wide-band code-code multiple access it depends on the spread spectrum, can provide the spectrum used by repeating 1268051, resisting multipath interference (muitipath resistance), frequency diversity (frequency diversity) And the advantages of interference rejection. In order to provide high-speed and multiple data transmission services at the same time, there are two technologies that can be applied to the IMT2000 broadband CDMA communication system, which can also be used for variable length spreadable (Variable_length spreading) technology.

Multicode techniques. Among them, the variable length spread spectrum CDMA communication system uses orthogonal spreading codes of different lengths to realize multiple data transmission. Multi-code technology assigns multiple spreading codes to a single user to achieve high data volume transmission services. The two spread spectrum techniques are used in broadband CDMA to provide user inter-orthogonality within the same cell (cell) while maintaining the randomness of users in different cell compartments. The two spread spectrum techniques consist of two parts. The first part is channelization, which converts each data symbol (Data symb〇1) into a preset number of chips. The number of chips corresponding to each data mark is called a spread spectrum coefficient code. A two-dimensional orthogonal variable spreading coefficient code is used as a channelization code to ensure orthogonality of different download channels. The second part is scrambling. Each user within the same cell uses the same scrambling code to provide and maintain user randomness in different cell compartments. However, the two-dimensional orthogonal variable spreading coefficient code cannot maintain the mutual randomness of the user on the uploaded channel. Therefore, users within the same cell grid use different scrambling codes in the upload channel to maintain their orthogonality and randomness. However, in order to have a larger data transmission capability, a multi-carrier direct sequence code division multiple access (MC-DS/CDMA) communication system was proposed. The advantage of the MC-DS/CDMA communication system using the 1268051 orthogonal spreading code is that it can reduce multiple access interference (MAI). This multiple access interference is the most important source of interference in CDMA communication systems. It is much more likely to reduce the interference of multiple accesses and speed up its transmission rate. Each user in the multiple access interference is assigned a two-dimensional spreading code sequence as a user signature sequence. The number of rows in the matrix is the spreading factor used by it, and the number of columns is the number of frequency waves in the MC-DS/CDMA communication system. The columns of each matrix are transmitted via different frequencies. It is possible to create a set of two-dimensional spread-frequency stone-horse matrices for the MC-DS/CDMA communication system that exhibit Cyclic autocorrelation Sidelobes and Cyclic Cross-Correlation. Since the multiple access interference is generated by the user's main non-zero interactive autocorrelation function in simultaneous transmission, the multiple access interference in the MC-DS/CDMA communication system can be greatly improved when such a spreading code matrix is used. The ground is lightened. Please refer to the first A picture and the first B picture. The first to fourth drawings are a simplified block diagram of a conventional MC-DS/CDMA communication system 10. The first B is a ΜχΝ-spreading stone matrix 14a for use in the conventional communication system 10. The input data 12a is input to a multiplier 14 which is spread by an assignment of an MxN spreading code matrix 14a, and the data after the spread spectrum 15 is input to a multi-carrier modulation unit to be transmitted. Go out. At the receiving end, a multi-carrier inverse modulation unit 17 receives the transmitted message, undergoes inverse modulation and generates inverse modulation data 18 'a multiplier 19 sets the data 18 with the same MxN spreading code matrix 1680051 14a is multiplied and produces an output data 12b. In general, the MxN spreading code matrix of all users is consistent, and ideally the output data 12b must coincide with the input data 12a. So far, the spread spectrum code matrix of the MC-DS/CDMA communication system is formally restricted, that is, the relationship between M and N has the following restrictions: 1) M=N=2k,k > 1, or 2) M = 2k, N = M2, k > 1 〇 The above conditions constitute a considerable limitation in the MC-DS/CDMA communication system. This limitation will greatly reduce the data transmission parameters of these systems. Flexibility. BRIEF DESCRIPTION OF THE DRAWINGS In order to make the above and other objects, features, and advantages of the present invention more comprehensible, the preferred embodiments of the present invention are described in detail below with reference to the accompanying drawings. Therefore, the main object of the present invention is to provide a multi-carrier direct-sequence code-division multiple-access (MC-DS/CDMA) communication system, which cooperates with an existing two-dimensional orthogonal variable spreading coefficient code. Two-dimensional orthogonal variable spreading factor codes (2D-OVSF codes) make it possible to generate and use an extended two-dimensional orthogonal spreading code. The extended two-dimensional orthogonal spreading code system is in the form of an MxN matrix, which is generated by Me1 and M2xN2 matrices, where N = NixN2. In addition, when the ΜρΝ! matrix has 1268051 h and the ΜβΝ2 matrix has 13⁄4, (k/k2) MxN matrices can be generated. The present invention discloses a method of wireless communication, especially a method for generating a two-dimensional orthogonal spreading code in an MC-DS/CDMA communication system. A code division tree corresponding to the two-dimensional orthogonal spreading code of the communication system is proposed. The two-dimensional orthogonal spreading codes generated in these code division trees can be applied to the MC-DS/CDMA communication system. The node of each code tree represents a two-dimensional orthogonal spreading code which can be regarded as a signature sequence ° , i ... 丄 ¥ 正 履 履 , , , , 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为 视为Where Λ f A {l, 2".., KG, Μ! represents the known frequency carriers, and Νι stands for the code length of the spreading factor and assumes that the heart is 2. Every = seed (four) It is specified in the corresponding parent node (:= the first generation subsection 'point, also the second of the code tree; point generation. Μ all (four) generation child nodes are these mother nodes i^ixN2) The matrix, 2, ···, κ〕} and fC {MxxNx) } and the corresponding moment _ node. The first - is used to generate the children in the code tree - the layer is (JVh 1U V XT K !K2, the first - s; - 2 ΝιΝ2) matrix and has a number definition: The following relationship is repeated: 2. Seed matrix { 1268051 C{{lx)K^x\MxMiXNiN2) =B^{M2xN2 ® ®(((((( ( ( ( ( ( ( ( ( ( ( {2Ki){M2xNi)® A{i\mxxnx) The ® is expressed as a Kronik product, and 1=1, 2, 3, 4, ..., 1 (4. Through the above formula, all can be found The two-dimensional orthogonal spreading code 0 in the same layer has the advantage of providing a new two-dimensional orthogonal spreading code, and the number of rows and columns can be greatly changed. This allows the MC-DS/CDMA communication system to have a large elastic space in the number of frequency waves and the spread spectrum coefficient code used. A tree structure like a one-dimensional orthogonal variable spreading coefficient code is recursively However, this new two-dimensional orthogonal spreading code is also generated via recursion. Therefore, when such a code is used in an MC-DS/CDMA communication system, the multiple data transmission rate can also be made by variable length spread spectrum. The invention also has an advantage. The two-dimensional orthogonal spread spectrum of the present invention has the characteristics of zero-cycle autocorrelation and zero-cycle cross-correlation, so that orthogonality can be maintained between different channels, so two Embodiments of the present invention are described in detail below with reference to the accompanying drawings. By ΜγΝι matrix (number ΚΟ and M2xN2 matrix (number Κ 2) two groups Two-dimensional orthogonal variable spreading coefficient code (2D-OVSF), can be built 1268051 = (κιΚ2) (Ml M2) x (NiN2): dimensional orthogonal spread frequency Ma, and Νι, M2, N2, 1 and K2 Is a positive integer. The two-dimensional orthogonal exhibition generated in these branches The code system is applied to the -/CDMA communication system. Each node of the code tree has a mesh corresponding matrix and represents the spread code sequence. The V-knife" group already exists in the MlXNl two-dimensional orthogonal spread spectrum code system. Seed matrix. Where 丨={1, 2,·..,M,吣, the frequency wave number is known, Νι stands for – spread factor 2 and 1 is 2〇 and the seed matrix of each knife tree is assigned to the corresponding mother (4) . The parent node # is the first point in the code tree: because it is also the root structure of the code tree. All continuation sub-sections:: j is the descendant of some parent nodes and cooperates with their corresponding orthogonal matrices. (7) Another-group of existing two-dimensional orthogonal spread-frequency stone horses and) (Μ2χΑ^ is a corresponding matrix, where 丨={ 1 达达. 八1, ,···, K2} and κ2 is 2. The seed matrix {八娜,α拟"土ί/?(1) _ 4 and the corresponding matrix 2 2 (^,..., furnace) are used to generate the child nodes in the code-coding tree. The second-level child nodes are (Κικ2)%% ¥ Array' The second layer of subnodes is determined by repeating the following relationship. ^ (Μ2χΝ2) ^ ^ (^ιχ^ι) Factory ((ί.-1Κ2+2) ... I { MyM^NxN2) = ^ (Μ2χΝ2) ^ ^ (Μ'χΝγ) Q{{i-\)K2+K2) (ΜιΜ2χΝίΝ2) = 2 (Μ2χΝ2) ® Α(<1\μ1χνχ) 1268051 Frequency code;;° In order to 'out all the two-dimensional orthogonal exhibitions in the same layer, the five brothers, if you want to find the next layer (five) node, the original two matrix is through the second layer of the submatrix { , κ =Λ ),,·., replaced by 'the submatrix of this layer has a number; Κ 2. Another / group of two-dimensional orthogonal spreading code as the corresponding matrix {碓_~, 3 (w'···' Α 3 ( _)} 'has a number &, where % is assumed to be 2 in the first layer, and the one-dimensional orthogonal matrix is repeated by the following relationship义成: ^Βΐ2\Μ^)®^ί){ΜλΜιΧΝχΝ2) The 14 is expressed as the Croknonic product, and i:=l, 2, 3, 4,.,. It can be seen that by repeating the above Method and selectively use various different corresponding matrices in each layer {5(1) b{2) t 2 (M2xN2) 5 ΰ 2 {Μ2χΝ2) ?· · *, 2\μ2χΝ2) { ^3 (Μ3χΝ3) 50,000 3( )(M3x#3) '···,β3(Α:3)(Λ/ 诸)},· { 5〇) ρ (Ά), #(μΛ),···,, can be obtained The two-dimensional positive parent matrix of the /^ layer neutron node { C(\m'M2』.,N2』.,,02)(¥2. .#„,···, C(K'K2~Kp) } 〇{MWyMpxN小2 ...Np) It is worth noting that the choice of the corresponding matrix is not restrictive, only 12 1268051 to correspond to the matrix is χ _ group of two-dimensional orthogonal spread code ~ white and ^ _ orthogonality. However, the parent node is defended, and the 呪 呪 呪 呪 U U U U U U U U U U U U U U U U U U , , , , , , , , , , , , , , , , , , , The architecture, the seed moment, the right to maintain % -. The array will be limited. Lifting the roots of the moment #日& by the nodes of the layer as a species:; matrix and substituting into the above formula, at the same time, the =, that is, the seed matrix of the fourth layer node is the pair of all groups The library barrier, the seed of the Fei Shi value of a ^ "is the same and equal to the initial sub-matrix. Huang Cangyi ice heat. # For example Kr

Nl,2'· A ^2)^(2)(2x2)} = {B(1\2x2)9B(2\2,2)} = { If Μ!: and _ η {++, Η— + — + + — — is the reference condition. In the present invention, in the example, +', which stands for +1" means that - repeating the above-mentioned square two can obtain the -group MXN: dimensional orthogonal spreading code, where the N-2, k>〇 and 1 > 0. This set of spread spectrum codes is one of the special examples of the implementation of the present invention. Referring to the second figure, the second figure is a two-dimensional orthogonality of the MC-DS/CDMA communication system in the embodiment of the present invention. A partial schematic diagram of the code division tree 20 of the spread spectrum code. First, a set of 2 m two-dimensional orthogonal spread code is provided as the seed material a(1)(4χ3)', and the range of 1 is from 1 to 4. More specifically Say, the matrix Α( \4χ3) is: 13 1268051 Η---f- -+ + A (1)(4x3)= ++— +++ , A (2)(4x3)= -+ + _++—1 — A(3)m , , a +—eight (4x3)=: Η--- >++ ,Α(4)(4χ3)== + + ^ A sub-moment of the mother Chen A(1) 1/ , Ding Xiang I Early A (4x3) is related to its phase 22a:2d. #下下给其他; is: point two-dimensional orthogonal matrix, B(1)(2χ2), as the corresponding matrix.: the range of 2 is 1 to 2, And shown as follows: , '''J,, Β(1) (2x2) Β(2) (2x2) by seed matrix A(i)(4><3) and corresponding matrixΒ Dijon, the two-dimensional orthogonal spread spectrum (2χ2) in the layer can be given a word, in this case 'generate each layer|two'_ no, not all examples need the same corresponding matrix» Each node 2〇 will support two child nodes. ', s, 22a-22d^^#_^ff, 24a.24h^ ? P',,, a Cl (8x6) and 24bc! (2) (4) The parent node 2仏 matrix system is regarded as the seed moment 2. The child node 24a and the torn seed matrix are A(1)(4), and the corresponding sub-points 24a and the matrix are obtained by the following relationship. Get:

Ci〇)(8x6)= β( )(2χ2)®Α(1)(4χ3)

Ci(2)(8x6)= Β( )(2χ2)®Α(1)(4χ3) 1268051 is the same as the second parent node 2 2 b associated with A(2)(4><3) The c卩>(4) and (4) matrices of the corresponding sub-nodes 24c, 24d are obtained by the following relation: ci3)(8x6)= Β(1)(2χ2)®Α(2)(4χ3) ci4 (8x6)-B(2)(2x2)(8)A(2)(4X3) All of the second layer matrices associated with the sub-nodes 24a-24h can be obtained by repeating the above stages and shown in the practice of the present invention. In the second picture of the example. Therefore, the general equation of the submatrix cf)(8x6) can be obtained by repeating the above equation and revealing the following: ^((/-1)2+7) ((4x2)x(3x2)) BU) ® A(0 ( 2x2) (4x3) (Formula 1) In Equation (1), 1 is from 1 to 4 and the parent node 22a_22< parent node's specific child node matrix is defined by "丨,". By repeating the above formula (1) The moment of the third layer can be obtained, and the second layer node is used as the seed matrix'; the matrix is the same. For the third layer, the general equation for the matrix of the descendants is as follows: 丨ί · , ((8x2)x(6x2)) = BJ (2χ2) ® C/0 (Equation 2)

CfM)2+y) (8x6) 2, 15 1268051 and the specific sub-node matrix of the parent node is defined by 'i'. Combine the above to obtain the binary of the two-dimensional orthogonal spreading code ( Binary_like) The code tree. Although the most basic 2x2 corresponding matrix has been revealed, any one of the ship X n -hetery X ^ , and the MXN one-dimensional orthogonal matrix can be used to generate a code tree. Moreover, the new two-dimensional orthogonal spreading code is not limited to a binary structure, and each _ node may have one or more branches. In addition, since the corresponding matrix may vary from layer to layer, Each code tree generation does not necessarily have to count the number of points in the t) generation or the previous (previ〇us) generation. However, the orthogonality of the embodiment must have, even (even) and countable (〇dd) zero cyclic autocorrelation lobe

Aut〇correlation Sidel〇bes)4| f. The above, even, or, odd, is defined according to the two consecutive data bit transfer modes. The former, the even "represents one" +1 is accompanied by another, +1, (or, one, M is accompanied by another, M), the latter, the cardinality, then represents one, and +1 is accompanied by another A "-1" or the exact opposite. When the frequency of FreqUenCy carriers increases and the code length must remain unchanged, the number of rows must be increased corresponding to the two-dimensional orthogonal matrix. Two methods are provided to obtain a fixed-length two-dimensional orthogonal spreading code and are described below. However, the concept of the matrix module function "matrix modulus function" must be explained first. The module function "Ten," is similar to a binary right- or left-rolling principle ("r〇11 right," or "r〇11 left" operation), from right to left along the matrix line The number turns. 16 l268〇5i For example, the matrix a(1)(2x4): A(1), (2x4)" [vl ν2 ν3 ν4] .(CO un, vectors) 〇t AW[v4 vl v2 v3]a ,, =1, and the Wei vector "V4" position is the rightmost digit of the slave to the leftmost position. ΐ ((4) Ten (9) phase V3 v4 vl], all the number of rows is shifted to the left by i, and the number of rows is matched from the leftmost row to the most. #然,_ _ cooperate with the value of the button to execute = module operator ( Mo she s operat〇祖A(1)_中2 v3 is the same as Α(2χ4)十(_ι). The first method of generating the two-dimensional orthogonal spreading code of the fixed length (called ^ ^ ^ p+ A (1U # a(2)^ This 1 matrix is considered to be the matrix associated with the coded tree parent node. Next, a group-specific 2x2 matrix D is provided. This particular matrix qeD is as follows: dj\ dd η d

Each 4 value (heart 2, heart and heart) is not +1 or -1. In addition, the value of ... must follow the following relationship: djxdj3 ^dj2dj4 = 〇 Therefore, the number of matrixes D is limited. As long as the above conditions are met, 4 can be arranged in any form. 17 !268〇5l A fixed-length two-dimensional orthogonal two-dimensional orthogonal spreading code can be obtained by repeating the following relation if the method A is used to obtain a matrix coded tree. 2i λ\2ΜχΝ) , (Equation 3A) C(2')(2A/xA〇\uxJV) dμ , (Equation 3B) Eight. Hai 1 ed 2, 3, ···,Μ}, and all the levels in the code tree _ must be all odd or even (called e like 4···, (Ν_冰 or e {1 , 3,5···,(Ν_1)}). j JJ and ·~ in the above formulas (3Α) and (3Β) are any matrix Dj of the matrix of D. As described above, c (2%) _ and c (2, (4) represent one of the sub-nodes generated by equations (3A) and (3B) in a layer of the code-coding tree. The parent node of the matrix is Α(〇_). If the following initial node matrix is used ( That is, the matrix of the coded tree and the node of the work layer is an example: A(1) (2x4) = A(2) (2x4)= + + - + , and for this example: 18 1268051 A(1) ( 2x4)Thirty 3= + - + + + + and 〇A(1)(2x4)ei- ;: + :

Please refer to the third picture. The third figure is a fixed length two-dimensional orthogonal matrix code tree 30. Take the code tree 30 as an example ', μ2=1' and the Di, D matrix is selected from D; as shown below: D corpse D2 = π + - The parent nodes 32a, 32b are two-dimensional orthogonal matrix A (1) (2x4), A(2) (2x4). Furthermore, in order to find the corresponding sub-nodes 34a and 34b of the fixed length two-dimensional orthogonal spreading code, it is necessary to use the parent node 32a, A(1) (2x4). Substituting the formulas (3 A) and (3B), after calculation, you can get: c(1) (4x4) r(2) = (4x4) (+)^〇)(2x4) (+)^4(1) (2χ4)Θ3 (10) (—M (1)(2x4)10 3 + + + -+ - + + + +- + - + + + and

+ + + -+ — + + +--- Similarly, child nodes 34c and 34d are as follows: 19 1268051 ^(3) = (4x4) + Η---h (+M (7)(2x4) Η ---- (+)^4(2)(2x4)10 1 + + Η—1--- and /^(4) = (4x4) + + — +_ (+)Α(2\2χ4) Η----(7)(2x4)十 1 ----h Η---h + As described above, the entire set of fixed length 2D orthogonal codes in accordance with an embodiment of the present invention can be obtained by the above method a The third graph can also represent the general equation of the matrix of the sub-nodes 36 in the third layer. The formulas 3A and 3B are applied to the single node 34&_34 to obtain the matrix of the third layer. Providing another method can also produce a two-dimensional orthogonal matrix of fixed length; called method B. As with method A, = method B first provides a set of initial 2χΝ orthogonal matrices {A (2xN), A (2xN)} ° By repeating the following relationship to obtain a fixed length 2D orthogonal code.

A (4i-3) (2ΜχΝ)= djxA{2i^) dnA^ (MxN) (ΜχΝ)®μι (Equation 4A),

A (4i-2) (2MxN)= a(4M) (2MxN)= dJ3A{2i^) dj^i) (MxN) {ΜχΝ)@μλ dkl4(2i) (MxN) L Λ2 Z (ΜχΝ)Φμ2 ( Formula 4B), (Formula 4C), and 20 1268051 a(4i> (2MxN)= (Formula 4D) dk4A (2i_\M Township The above i value is positive 2 of K1AM/2, ..., Μ/2} The number in the same layer is ton, number. Finally, dd η Ά 7 is an even number (including zero) or odd, 〇 γ, ~ and ~ are the specific matrix D - matrix Dj. Same as D A: The second is a special office ^ "Exhibition 4 members 珥 / : Can not be exhibited - an example of using a method to generate two-dimensional positive and exhibition must be 5 horses. Table 1

21 1268051

The higher level, that is, M=16, M=32, and so on. For example: 22 1268051 =Di Η—for example and assuming that μι=μ yields 0, the above formulas (4A), (4B), (4C) and (4D) can be converted and the following formula can be obtained: r〇) = 1 (4x4) (-(2) = 1 (4x4) (+) 乂(1)(2x4) (+) j(2)(2x4) (+) 乂(1)(2x4) (1) Z(2)(2x4) c( 3) 1 (4x4) ί(2). (2x4) (+)^4(1)(2χ4) and

c(4) 1 (4x4) (+M(2)(2x4) (a) j(1)(2x4) In a similar branch, the matrix C&4 can be defined by the above formulas (4A), (4B), (4C) and (4D) ), as shown below: — (8x4) — Ρ(2) —. (8x4) — (+)ciW,

Wide (3) 2 (8x4) Ρ(4) 2 (8x4) r^5) (8x4) (+)ς(2> (4x4) (4x4) (+)ς(2) (4x4) (4x4) ( +)ς(3) (+)ς(4) (4x4) (4x4) 23 1268051

(6) (4) (4x4) 8x4) '(+)cr(4x4) ) (4x4) The entire set of fixed length two-dimensional orthogonal according to an embodiment of the present invention: the frequency code can also be obtained by the above method B. However, when the two-dimensional orthogonal spreading code is obtained by the square > 2, the two-dimensional matrix of the different levels does not completely maintain its orthogonality, so it cannot be used at the same time. However, by using the fixed length spread spectrum code generated by method B, the orthogonality is maintained in the spread spectrum code of the same person, and can be assigned to different users at the same time. In the second generation communication system, there are two ways to achieve the purpose of variable speed and transmission. One is multi-code technology (cut (3) and the other method is Variable length scheme. The code technology refers to one. The base station arranges one or more exhibitions to a user to speed up the data transmission speed. When a user simultaneously uses two orthogonal spreading codes, the transmission rate is doubled. The new type. The Orthogonal Exhibition Horse can maintain the orthogonality in the same layer, so it is suitable for this technology. In addition, the 'variable length method is also used in the third generation communication system 24 1268051 AJ. :上'目Just use one-dimensional orthogonal spread spectrum code to achieve. This kind of square ^ I according to the different data transmission rate required by the user, the base station female platoon gives each user a different length of the spread spectrum code. When a short spread code is obtained, the user obtains a higher feed rate. However, each user can only use one spread code at a time. If it is necessary to use a spread code of different length, the present invention Only with a coded tree knot The two-dimensional orthogonal matrix code can be used. The embodiment of the present invention provides a variable multiple transmission rate method, which is disclosed in the fourth figure of the embodiment of the present invention; also known as a separate carrier technology (Separated-carrier scheme) 2nd level 2MxN 2D matrix eight (1) (2 cores are separated into two matrices of the same length but with fewer carriers, A〇-, or a matrix of more carriers. For example, one The 4χ8 two-dimensional orthogonal matrix can be separated into two 2x8 two-dimensional orthogonal matrices. By using two spreading codes and ^qing at the same time, the user can get twice the data transmission =: A two-dimensional orthogonal matrix Α% χΝ) is separated into Α(4)(4). (MxN) matrix: A(1—a)(MxN) has a Μ row, 1 χΝ spreading code vector and numbered, Α(1—%<the state matrix also has a Μ, i颂 颂 向 。 。. a (four) (ΜχΝ) and serial number, parallel conversion circuit 42 (serial_t "arallel c〇nversi〇n

ClrCUlt), which is transmitted by a sequence of :# level bits 44, and produces two parallel code modulators 46 and 48. Among them, 46 and 48 use the first unitary matrix A (four) (ΜχΝ) and the second unitary matrix 8 25 1268051 A (1_b) (MxN) to perform data encoding and modularization. Compared to the initial 2MXN_ a%xn), -^ H 〇^ A〇)(2x4)#^c〇U , ς(2)(4χ4) ^ 〇2〇) ^ c(2) ^ ^ ^ and c2( Parental code for V4). When using the matrix A(1) (2 times), the basin:, q (3U can maintain its orthogonality, so it cannot be divided with the parental horse at the same time = with the user 1 and as long as the parental code is not used, the same as St. Brother or sister ^ ' ς (4x4 > c, (d) The above brother or sister code system has been exposed in the conventional technology; take the same level of code as an example:

A(1W a(2) (2x4f + + + -+ a + + + +- + Η---- and, therefore, the following matrix results are obtained, (1) =1 Ί (4x4) + + + — V+M ( 2x4) + - + + m: A(la)(2x4)1 _(^")^4^\2χ4)Θ3 + + - + - + + + -0) (4x4) The matrix is separated into two separates Code, providing a component code (eight (called A(1 b)(2x4)): A(10) (2x4), (2x4) + - and 26 1268051 A(lb)(2x4)= + + will be on j77 = (Μ ) '" I) are orthogonal. 1' is regarded as the authentication sequence. It can be used to send the MS-DC/CDMA enabled device to the MS-DC/CDMA enabled device. The probability of passing the test. The group is different from the conventional technique ^ (2χ4)Λ (2χ4)) Sub-segment = Α (1) then 1 (four), 1 (four), Cl - and cr) (4x4) cannot be used at the same time. However, if a knife code group (A (2,8 (2X4)) is used, then other users can still use the matrix π(4χ4) ie towel (4). In summary, when the code system is provided At the same time, when used by other users, the transmission rate of the user will increase accordingly. Further, the step-by-step line, ##分码α(Μχν) can be divided into calving (2ΧΝ} 2D-OVSF (4). By repeating the above method, the data transmission rate is 2m4 times faster than the original state. In addition, the Separated-carrier scheme of the two-dimensional orthogonal spreading code maintains its code division orthogonality and has zero. The characteristics of Cyclic autocorrelation Sidelobes and Cyclic Cross_Correlation. Therefore, the code division of such MC-DS/CDMA communication systems can maintain its orthogonality even in non-synchronized channels. (asynchronous channels) 〇 If the parent node is not equal to the parent node of Αω(2ΜχΝ), the code after 分离(1)(2ΜχΝ) is separated, eight (four) orders and eight (four) (10) are orthogonal to Αϋ) (2ΜχΝ; For example, suppose two-dimensional positive The matrix Α(1)(8χ8) is separated into a matrix Α%Χ8) and A(lb)(4x8); then the matrix Α(14χ8) and 27 l268〇5l sentences are orthogonal to the general Αω(8χ8); ·Η3, ···, 8}, but not orthogonal to A(2)(8x8), because a%x8) has the same parent matrix as A(2)(8x8). Of course, the matrices A(a)_ and A(lb)(4x8) are not orthogonal to the original unseparated matrix eight (1) order illusion. If you are assigned the same user to obtain twice the data transfer rate, the matrixes of eight (1)...8) and A(2)(8XS) cannot be used. For other users. In the embodiment of the present invention, the two-dimensional orthogonal spreading code generated by the recursive architecture or the decision A can be implemented by the split carrier method to implement variable weight rate transmission. The embodiment of the present invention further provides a method, "multi-carrier," to make the use of the two-parent spreading code more flexible. As described above, the fixed-length two-dimensional orthogonal spreading code system obtained by the method A is in a tree shape. The structure is similar to that of the frequency-orthogonal spreading code. The two-dimensional orthogonal exhibition of this method is only at different levels. Because of the different wavenumbers: J: 疋 and mother matrix Example: This can be assigned to different users at the same time. The second figure of the fifth embodiment of the present invention is shown in Fig. 3. Through the method A # 夕戟政%之八麟t can be obtained - the length of the two-dimensional positive The spread frequency is the same as that of the disc, and the different types of mobile phones support the wave number of not less than $. In terms of the mobile phone system, the base station must be able to design for different hardware designs. k for the same wireless communication service (Wireless: bee assumes that the first user mobile phone 52 supports m wave number and the second user loses M/2 wave number and _ (four) fixed length two-dimensional orthogonal spread spectrum code The selected matrix. The _*m~matrix is matrix A(1)(mxn) 53 and Array B 54 where _ aW(10),) g is provided to the first user 28 1268051 mobile phone 51 and the moment b (1) the first user hand is provided to the second user mobile phone 52. A%XN) 53 to encode and adjust the ancient The code adjuster 58 is configured to receive the data stream by means of the matrix phone 52. The second frequency is transmitted by the matrix B%2 (four) to encode and adjust different systems to change the wave 4^. 7 Numbers In the embodiment of the present invention - the characteristics are related to all parents and sub-moments related to the same; no two == ΓΑΓ / mobile phone. This situation is limited by its tree structure. Since the square = seal = two-dimensional orthogonal display also has a generalization, Wei Tao will have a spread code blockade. Furthermore, the multi-carrier method does not support variable rate transmission because the data transmission rate is still the same when the user is assigned a two-dimensional orthogonal spreading code having the same code length and different wave numbers. Finally, the code division matrix generated by the code tree has zero-zero autocorrelation and zero-cycle cross-correlation (zer〇 cr〇ss_correlation) traits. These two-dimensional orthogonal spread spectrum code division trees maintain their orthogonality in a uniform channel, and thus do not require a two-level spread spectrum technique. The embodiments of the present invention can be applied to any wireless communication device, such as a mobile phone, a base station, a computing platform, etc., and are used by a processor in a wireless communication device or a designed computer. Process it. The two-dimensional orthogonal spreading code obtained by recursing the formula in advance = installed and used on the wireless communication device. The present invention has been described in the context of the related preferred embodiments of the invention, and is not intended to limit the scope of the invention. Various modifications and changes may be made without departing from the spirit and scope of the invention as claimed. The scope of the invention is defined by the scope of the appended claims. BRIEF DESCRIPTION OF THE DRAWINGS A preferred embodiment of the present invention has been described in more detail in the foregoing description with the following figures, wherein: Figure 1A is a simple block of a conventional MC-DS/CDMA communication system. Figure. The first B diagram is a schematic diagram of the MxN spreading code matrix of the 2D-OVSF code of the conventional MC-DS/CDMA communication system. The second figure is a partial schematic diagram of a code division tree for a 2D-OVSF code of an MC-DS/CDMA communication system according to an embodiment of the present invention. The third figure is a schematic diagram of a fixed length 2D-OVSF code applied to the first method in the embodiment of the present invention. The fourth figure is a schematic diagram of the transmission at different rates by the separation wave number method in the embodiment of the present invention. The fifth figure is a schematic diagram of the transmission to different rates by the multi-carrier method in the embodiment of the present invention. [Symbol description of the diagram] 30 1268051 Conventional MC-DS/CDMA communication system 10 Input data 12a Output data 12b MxN Spreading code matrix 14a Multiplier 14 Spread spectrum data 15 Modulation unit 16 Anti-modulation unit 17 Reverse modulation Data 18 Multiplier data 19 Fragmentation tree 20 Parent node 22a - 22d Child node 24a-24h Sun node 26 Fixed length 2D-OVSF code tree 30 Parent node 32a > 32b Child node 34a_34d, 36 Sequence-parallel conversion circuit 42 User Transmission data bit 44 Output data stream 46, 48 1st user handset 51 2nd user handset 52 Matrix A(1)(MxN) 53 Matrix Β〇((Μ/2)χν) 54 1st user data stream 56 2nd User data stream 57 code modulators 58, 59

Claims (1)

1268051 Picking up, applying for patent scope 1. A method for generating in a CDMA communication system includes: a method of spreading a frequency code, generating a code division tree of a two-dimensional orthogonal spreading code, including a corresponding matrix; Each node in the tool code tree is selected from the nodes in the code tree. _ΜχΝ matrix·1 Μ indicates the number of frequency carriers that the system can provide, and one uses the ΜχΝ matrix as the -recognition positive sequence. Length; set.歹 歹 至 至 至 至 至 至 CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA CDMA a seed matrix, the sub-matrix is respectively assigned to a plurality of parent nodes of the code division tree; providing a complex corresponding matrix; and generating a plurality of child nodes from the parent node in the knife code tree, the matrix of the child nodes by using the seed matrix and The corresponding matrix is available as a Kr〇necker pr〇duct. 3. The method for generating a two-dimensional orthogonal spread spectrum code as described in claim 2 of the scope of the patent application, wherein the seed matrix is defined as (6), and the (1) is between 1 and Κι 〇 32 1268051 4. The method for generating a two-dimensional orthogonal spreading code according to item 2, wherein the corresponding matrix is defined as B(J\m2xN2) ' The (1) system is between 1 and Κ2 〇5. A method for generating a two-dimensional orthogonal spreading code, wherein the matrix size of the child node is defined as a job 2 X Ν 2 . 6. The method for generating a two-dimensional orthogonal spreading code as described in claim 2, wherein the sub-matrix is obtained by repeating the following relationship: C((i Χ)Κι+]\μ2ΜχχΝ2Νχ)~ Β^\μ2χΝ2)® A(<1){MxxN1) 5 where® is the Kronic product. 7. In the method of generating a two-dimensional orthogonal spreading code as described in claim 2, in the code division tree, the matrices corresponding to any two nodes of the same layer are orthogonal to each other. 8. The method for generating a two-dimensional orthogonal spreading code as described in claim 2, wherein in the code tree, if any one of the two layers of the different layer is not a continuation sub-node of the other, then The corresponding matrices are orthogonal to each other. 9. A method of generating a fixed length two-dimensional orthogonal spreading code in a CDMA communication system, the method comprising: 33!268〇51 generating a fixed length two-dimensional orthogonal spreading frequency one-code tree, the code-coding tree Each node in the node includes a corresponding matrix; a vt matrix is selected from the nodes in the code division tree; wherein M represents the number of frequency carriers that the system can provide, and N represents the length of the spread spectrum code; The authentication sequence is to a first CDMA enabled device. 10. The method for generating a fixed length two-dimensional orthogonal residence code according to claim 9 of the patent application scope, wherein the method for generating the code division tree comprises: a complex seed matrix, wherein the matrix system respectively refers to ___« a complex 2x2 correspondence matrix; and a complex subnode generated from the parent node in the code division tree, ^ seed matrix 峨 嫩 嫩 响 嫩 矩阵 矩阵 矩阵 矩阵 猎 嫩 嫩 嫩 嫩 嫩 猎 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如Method, 1########################################################################################## The system is defined as either or one. Dn ldn dj4 ', μ corresponding matrix is defined as Dj ·· and "Hai 4, '7 3 and A is +1 34 1268051 13. As stated: ri: 2 C^-i) (2ΜχΝ) d A {i\ uj\^ {MxN) d A{i\ u (^χΝ)®μ. and C(2)) (2ΜχΝ)= d Α{ΐ), Wy3^ (MxN) d A^r uj4^ (^χ^ The matrix size of the ® μί point is defined as the method of generating a fixed-length two-dimensional orthogonal spreading code as described in Item 1G, where the sub-section 21V[xN 任 corresponds to any two nodes of the same layer) A method for generating a fixed-length two-dimensional orthogonal spreading code as described in Item 9 of the syllabus of Shili, in which the matrices are orthogonal to each other. The method for generating a fixed-length two-dimensional orthogonal spread spectrum code as described in Item 9 of the Philippine ^ 干 围 , , , , , 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民 公民Nodes, the corresponding matrices are orthogonal to each other. 17. Two-dimensional length two-dimensional orthogonal spread spectrum to generate two-dimensional orthogonal spread-spectrum--genetic code-separating structure; 35 1268051 Select from the genetic code structure - MxN matrix; where M is not provided by the system The number of frequency carriers, N represents the length of the spread spectrum code; using the MXN matrix as an authentication sequence to a first CDMA enabled device. 18. The method for generating a fixed length two-dimensional orthogonal spreading code as described in claim 17, wherein the method for generating the genetic code structure comprises: providing a complex seed matrix and a complex 2x2 corresponding matrix; Any two of the seed matrices are selected as a pair of parent matrices; four sub-continuation codes are generated, and the matrix of the child nodes is obtained by multiplying the parent matrix by a specific element of the corresponding matrix. 19. The method of generating a fixed length two-dimensional orthogonal spreading code as described in claim 18, wherein the four sub-continuation codes are respectively defined as C (2MxN) ' C(4l2)(2MxN), C( 41 UpMxN) and c()卩M,. 2. A method for generating a fixed length two-dimensional orthogonal spreading code as described in claim 18, wherein the two parent seed matrix systems are defined as Α(2ι)(Μχν) and eight(2)-1), respectively. %, and the (2i) is between 2 and Μ. 21. The method for generating a fixed length two-dimensional orthogonal spreading code as described in claim 18, wherein the corresponding matrix is defined as Dj: Dj is defined as [5·1 heart 3], and the “~ And ~ is +1 ldj2 djA\ 1268051 or -1 and the "+ heart = 0. 22. The method for generating a two-dimensional orthogonal spreading code as described in claim 18, wherein the matrix corresponding to the four sub-continuation codes is obtained by repeating the following relationship: C(4, -3) (2MxN) dk2A (10) (ΜχΝ) (ΜχΑ〇10约C(4,-2) (2MxN) dk3A^21 1\mxN) (ΜχΝ)®μ{ 1) (2MxN) c(4〇dk2A^ (MxN) (ΜχΑ〇Θ//,·(2MxN) dk3A^2l\MxN) dk4A^ (M 乂23. A method for generating a fixed-length two-dimensional orthogonal spreading code as described in claim 17 of the patent application, in the code division In the tree, the matrices corresponding to any two nodes of the same layer are orthogonal to each other. 24. A method for generating a variable multiple transmission rate separated carrier in a CDMA communication system, the method comprising: generating a separable two-dimensional positive a code division tree of the spread frequency code, each node in the code division tree includes a corresponding matrix; a first matrix is selected from nodes in the code division tree; 37 1268051: first from D Hai a matrix to form a (M/2)xN second matrix and a (Μ/2)χΝ third matrix; using the second matrix and the third matrix to provide an authentication separately Sequence to a first CDMA enabling device. 2 5 \\j A method for generating a variable multiple transmission rate 2 separated carrier method as described in claim 24 of the patent scope, wherein the separable two-dimensional orthogonal spreading code The one/knife code tree corresponding matrix is defined as a 2x2 matrix. 26· The method for generating a variable multiple transmission rate #= according to claim 24, wherein the method for generating the code tree comprises: a complex seed matrix 'the moment _ is assigned to a plurality of parent nodes of the code division tree; providing a complex 2x2 correspondence matrix; and generating a plurality of child nodes from the parent node in the code division tree, the matrix of the child nodes being seeded by the seed The matrix is multiplied by a specific element of the corresponding matrix. 27· The method for generating a variable multiple transmission rate separated carrier according to claim 24, wherein the second matrix and the third matrix and the first matrix of the disk The parent matrix is orthogonal to each other. 28) The method of generating a variable multiple transmission rate separated carrier method as described in claim 24, wherein the initial seed matrix of the code division tree is MsX Ν matrix, Ms =px2ms, when M = px2msx2l^, two-dimensional spread spectrum code 38 3868051 A (mxn) can be divided into two A (MsXN) matrices. 1268051 M2xN2 2D-OVSF matrices, in the form of pairs) (M ...) for i = { 1,2,···,: K2} is then selected as mapping matrices. The mapping matrices are used to generate corresponding children matrices. These second layer child matrices are MiM2xNiN2 matrices with cardinality K!K2? which are defined by reiterating the relationship : C{{1~X)Ki+X\mxM^NxN2) = ^2(1)(Μ2χΛ^2) ® A{1\mxxNx) C^1-x)K2+2\MiM2xNiN2) =B^2 \M2xN2) ®A{i\m^nx) C{(1~1)K2+K2\m1M2xN1N2) =B2K2\m2xN2) ®^ω(ΜιΧ^) where 3 indicates a Kronecker product,and i = 1,2 , 3, 4,···, Kq. 柒, (1), the designated representative figure of this case is: the first _ figure (2), the representative symbol of the representative figure is a simple description: