TW569589B - Generation method of orthogonal spreading code for cellular CDMA communication system - Google Patents

Abstract

The present invention provides a generation method of orthogonal spreading code for cellular CDMA (code division multiple access) communication system, which is mainly to define the generation array by the reference sub-sequence and the password, and use the generation array as the basics to combine for generating the binary sequence. The binary sequence becomes the orthogonal spreading code with variable length after being added with the parity check bit. The reference sub-sequence can provide an array structure different from the tree structure, and provide the application layer with high-blocking complication option, convenience in expansibility and easy realization.

Description

569589 Day_Amendment D] Day 1st Day No. 9 (3131108 V. _ Invention [Technical Field] The present invention relates to an orthogonal spreading code generation method for a bee-fruit multi-access communication system, especially Refers to an orthogonal spreading code generation method that has anti-interception and expandability, and can be integrated into the third generation (3 G) communication system. [Previous technology] Physical channel of the frequency division code multiplexing access method (physical The spreading code used by channel) includes channel i code and channel scrambling code. Among them, the channelizing code is orthogonal variable spreading code. Orthogonal Variable Spreading Factor code (OVSF code). As shown in Figure 7, the code tree 8 'where' SF is the spreading factor, and the code is Each level of the tree defines SF channelization codes of length SF, where Cch, SF, and k are used to represent 'each 0 VSF code 8 1 is defined by each branch of the code tree in Figure 7, and each 0 VSF in the code tree Code 8 1 is a S y 1 vester-type Had am a rd moment with variable dimensions The sequence taken out of the system has perfect orthogonality under zero time delay, so it is suitable for DS-CDMA (Direct Sequence Code Division Multiple Access) system. As shown in Figure 8, it is the implementation of the conventional WH code. Circuit diagram, is

The reverse link (Reverse Link) of -95 CDMA system is used to realize WH code. The generation circuit of the conventional WH code is to generate a sequence of length 2 η through a timing generator 9 1, perform a division operation of η-1 times 9 2, and make the obtained η -1 sequences and the original sequence All linear combinations can get η 2 η damard matrix, and 0 VSF code can be generated through Hadamard matrix. As mentioned above, the generation method of 0 V S F code 8 1 is the tree structure method.

Page 4 569589 z: Case No. 90131108 Month A < year, / V 」ί m: Ming-(Magic heavy defect is that if one code between two codewords (Codeword) is the same as & — w Yu Ma another code The mother code word is on the same tree path, that is, it is not orthogonal. For example, if Cch, 8,0 is assigned to a user, then all the codes derived from this ^ VCCh, 16,0, ㈣, 16,1, Cch, 32, 0, ..., CCh, 32, 3, Cch, 64 'Xuan 0 2 ... Tian C6Ch, 64, 7, ..., Cch, 1 2δ, 0, ... Assigned to the lower message =: The mother codeword of the codeword (Cch, 4, 0, Cch, 2, (H ca n’t send users of, ,, and e to the car ’s Axun Xiu cattle, so it is necessary to improve it. [Purpose and effect] /, the hive t it: I ί The main purpose is to solve the above problems and provide-a kind = to take the orthogonal spread spectrum code generation method of the communication system, the security design of the system to prevent interception, * is based on The method of referring to the subsequence: Re = Array, which generates an equivalent Hadamard matrix code for a brand-new. The present invention uses the ft-effect HadamarC ^ matrix as the basis to achieve 0 VSF or WH with very few parameters, ^ * test sequence and secret, Segment users, use complex It is also lower, Ben: Ming :: Less shift registers are used, and the circuit is electrical), although Rui Tianya can use different methods to generate code words (software wireless at the application layer: ,, °) Media transmission In response, the mastery of communication security will increase the complexity of anti-interception; • Concept: should: step by step: step by step options to identify and compare with the current Kuan Ershi Baoziquanquan Women, which are always innovative technologies; this WCDMA and other phases ☆ On behalf of the mobile communication standard 1S-95 CDMA, cdma 2 0 0 0 Furthermore, it can be directly integrated into its original design. Provided closely ^ The reference subsequence of the present invention is based on the reference- Combination of train trains to form all kinds of double-valued self-phases of required length

Orthogonal layer domains with a length of more than 8 (trivial cases below 8) 569589 Repair ..., fill up. Acoustic 90131108_year, month, month, and month of amendment__V. Invention 1 GuΆ. Off function order 歹 if ( tw 〇 一 va 1 ueaut 〇c 〇rre 1 ati 〇nsequences), after adding the parity check bit (paritycheckbit), it can be WH / 〇VSF code, so the method of the present invention is expandable and can be flexibly extended to design longer codes word. [Technical content] An orthogonal spread spectrum code generation method for a honeycomb multiplexed access communication system. The generation array of the honeycomb multiplexed access communication system is described by at least one reference subsequence and several passwords. The generated row vector of the array is composed of the reference subsequences or the reference subsequences through cryptographic operations, and the cryptographic operations are based on the cryptographic parameters; and the cellular sub-code multiplexing access communication system is backtracked. The bit register is controlled by the backtracking method to generate a reference subsequence; and the Bollinger algebra forward operation circuit of the hive code division multiplexing communication system uses the Bollinger function and the temporary register of the backtrack shift register. The content of the device implements a reference subsequence; its main characteristics are. These ciphers are the initial value of the register contents of the backtracking shift register or determined by its backtracking method, and the combination of the columns of the generated array will generate A double-valued autocorrelation sequence, and then make all cyclic shifts of the double-valued autocorrelation sequence, add parity check bits, and replace each 0 element with +1, and each 1 element with -1 to form a score. Variable-length orthogonal show Multiple Access communication systems pilot codeword. The above and other objects and advantages of the present invention are not difficult to obtain from the detailed description and accompanying drawings of selected embodiments described below. Of course, the present invention allows some differences in the arrangement or arrangement of other parts, but the selected embodiment is described in detail in this specification.

569589 Sundial Jl _ complement rhyme number 90131108 month, month, month, month, day, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, month, year, month, month, month, month, month, month [Detailed description of the embodiment] Please refer to FIG. 1 to FIG. 6B, which shows the structure of the embodiment used in the present invention, which is for illustrative purposes only. Structural restrictions. The present invention is an orthogonal spread spectrum code generation method for a honeycomb sub-code multiplexed access communication system. As shown in Figures 2 A, 2 B, and 3 A, the honeycomb sub-code multiplexed access communication system includes generating Array 4 1, transposed generation array 4 2, backward shift register 6 1 and Bollinger algebra forward operation circuit 6 2. Please refer to Figs. 2A and 3A. In the figure, the generated array 4 1 and 4 2 are described by at least one reference subsequence 2 1 and 2 2 and a number of passwords 3 1 and 3 2. The size of the generated array is Is η 1 X η 2 where η 1 2 k 1 η 2 Ν 1 / nl, both of which are coprime, and satisfy N = 2η = 2k 1 k2; the two are coprime, and satisfy. Let A generate the generated arrays 41 and 42 as follows: Combining the row vector of the generated array 4 1 and the column vector of 4 2 a in2 + j = A (i, j) will generate a sequence of length 2 η — 1, The vector is expressed as aa〇aa 2 η — 2 so that the column requirement is a two-valued sequence (the sequence's autocorrelation function (aut〇c〇rre 1 ati〇η functi ο n) is a two-valued sequence, which is called a two-valued autocorrelation function sequence. (Referred to as a bi-valued sequence), then the row vector of the array 4 and the column vector of the column 4 2 are generated. Except for all zero vectors, the other vectors are equal after having a cyclic shift (cyc 1 icshift).

569589

! ^ 16 i :: J: μ ·! Modified ηττ in Lunqin No. 90131108! '-…-~ 3 :,-Description of the invention ... (· 5 |), or sub-sampling (decimati ο η) plus cyclic shift After equality relationship. Therefore, one or some row vectors are taken as the reference subsequence 2 1, one or some column vectors are taken as the reference subsequence 2 2, and the matched cyclic shift number 5 1 or the number of sub-samples 5 3 plus the cyclic shift number 5 2 is the password 3.1, 3 2, which can fully describe the generation array 4 1, 4 2. Take the array 4 1 shown in Figure 2 Α as an example. The first row is a vector of all zero rows, the second row is a reference subsequence 2 1, and the third row is a reference subsequence 2 1 generated by four downward shifts. The fourth line is the reference subsequence 2 1 generated by five downward shifts, and so on. Take the transposed generated array 4 2 shown in Figure 3A as an example. The first column is an all-zero column vector, the second column is a reference subsequence 2 2 obtained by first-order sampling, and the third column is a reference. The subsequence 2 2 is generated by eighth-order sampling, and the penultimate column is the reference subsequence 2 2 generated by eighth-order sampling plus fourteenth-order rightward shift, and the rest can be analogized. For the generation of the reference subsequences 2 1 and 2 2, the backward shift register 6 1 is generated by the backward connection method (corresponding to the sub-sampling order) plus a specific register initial value cyclic shift, or The Bollinger algebra forward operation circuit 62 is implemented by a Bollinger function. The combination of the above-mentioned cyclic shift number 5 1, or the cyclic shift number 5 2 and the sub-sampling order 5 3 is the code 31, 32 referred to in the present invention. The relationship between the rows of the generated arrays 41 and 42 and the reference subsequences 21 and 2 2 is described by these codes 3 1 and 3 2, and these codes 3 1 and 3 2 are generated by the following mechanism; among them, the number of cyclic shifts 5 1 and 5 2 are determined by the initial value of the register contents, and the sub-sampling order 5 3 can be controlled by the linear backtracking method. Refer to steps 11, 12, 13, 14, 15 in Figure 1

569589 -feLf No. 90131108 __Year Month Day Chromium —Five, —Send a clear statement m 6) ~ " ^ "-, the double-valued sequence generated by the above method can be used to construct the equivalent Hadamard matrix. Let the above-mentioned length of the table of M be a matrix formed by all cyclic shifts / columns of a bi-valued sequence, and replace every 0 element with Η and every 1 element with -1, and define a double-valued autocorrelation transformation matrix as : 7 = 1 Μ where 1 table contains 1 column vector, 1 / table contains its transposed vector, then Tf: 2nl2 η, and the matrix τ and Sylvester — type Hadamard matrix Η are permutationaliy eQuivalent. That is to say, there is an arrangement matrix P such that T = PHP-1 and PHP ^ The matrix T formed by the above sequence is equivalent to adding the parity check bits to the respective related sequences. The column vector to which it belongs can be 0VSF code or Walsh H adamard code. numbers. The specific embodiments of the OVSF codes of various lengths according to the present invention are summarized as follows: If the two generation barriers shown in FIG. 2A are generated in the array A, they are non-equivalent (inequivaUnt) length 63 double-valued sequences, which are m & GMW # Liang Xu Temple column. If the generated array A is the four generated arrays as shown in FIG. 3A, it is not a non-equivalent two-valued sequence of length 2 5 5 and four sequences of m, gmw, M255 ~ l. If the five arrays of arrays shown in Figures 4A and 4B are generated in array A, they are non-equivalent length 51 丨 bi-valued sequences, which are five sequences such as m, GMW, M511-1, 2, 3, etc. . If the array a is generated as in Section 5A,

Page 9 569589 is also a $ a Γ Xi, " A month of 90131108 _ ·% ^ X ^ ^ 孑 雨 与 号 5. The ten generating arrays shown in the description of the invention (7), respectively, are not equivalent The length of the binary sequence of 10 2 is m, GMW-1, 2, 3, 4, 5, M1023-1, 2, 3, 4 and so on. The column vector to which the matrix T formed by the above sequences belongs can be the codeword of OVSF code or Walsh Hadamard code. In summary, the present invention is a new and secure design for the CDMA communication system that is different from the tree structure and provides an anti-blocking option at the application layer. It is based on the reference subsequences 2 1, 2 2 and passwords 3 1, 3 2 Define the generation arrays 4 1 and 4 2 as a new way to generate equivalent Hadamard matrices, and then use this equivalent method to implement it through the user's machine. Although the commercial layer 5 but the Ming array is the current first class Compatible re-reference sub 2 sheng OVSF code longer code

Hadama reference, use, circuit, and available media can also list structural heterogeneity, three generations of rows, can be straight, and the sequence 2 into an array 'so the word 0 rd matrix sequence 2 parameters are extremely complex with soft body round short The line 'provides that the mobile communication is integrated into the length of 1, 2, 4 1. The present invention is based on the realization of OVSF or WH codes 1, 22 and passwords 31, 32, which can reduce the area.' The storage is also low, which is suitable for the thin and short communication mobile phone method to generate codewords (software radio) differently. = The application of 'communication security control will be placed in the application' or non-linear sequence as the reference sequence. Step-by-step options to improve anti-blocking: consistently innovative technology. The present invention is also based on: = r, MA, cdma2 °°°, w delete 8 ΐίΧ, f- jp 6 2 as a basis, U code can be combined by * invention 4 2 to form a common password 3 1, 3 Various types of WH /, special, and flexible design that can be expanded in length. The disclosure of the above-mentioned embodiment 569589 92 * '·' ^: Case No. 90131108_year month_Ifi__… V. Description of the invention (8) Restrictions In the present invention, changes in numerical values or replacement of equivalent components should still belong to the scope of the present invention. From the above detailed description, those skilled in the art can understand that the present invention can indeed achieve the aforementioned purpose, and it has indeed complied with the provisions of the Patent Law, and filed a patent application.

Page 11 569589 () r 1¾ '· *. Case No. 90131108_Year Month Day __: ... Figure 11. Single Day "Figure 1 is a schematic diagram of the OVSF code implementation method of the present invention Figure 2A The present invention generates a length 6 3 double-valued sequence array and password. Figure 2 B is the length 7 reference subsequence generator of the present invention (for the purpose of generating the array of Figure 2 A). Figure 3 A is the length 2 5 5 of the invention. Array of value sequences (transposition exhibition.) And password Figure 3 B is the length of the present invention 15 Reference sub-sequence generator (for the purpose of generating the array of Figure 3 A) Figure 4 A is the length of the present invention 5 1 1 Generating array of double-valued sequences (transposed display) and password (1) Figure 4 B is the length of the present invention 5 1 1 Transformation array of double-valued sequences and password (2) Figure 5 A is the length of the present invention 1 0 2 3 Generating Array (Transposed Display) and Password (1) of the Double-Valued Sequence Figure 5 B is the length of the present invention 1 0 2 3 Array (Transposed Display) and Password (2) of the double-valued sequence. 5 C The figure is the length 3 of the present invention. 1 Reference sub-sequence generator (1) (for the purpose of generating the arrays of Figures 5A and 5B). Figure 5D is the length 3 of the present invention. 1 Reference subsequence generator (2) (for the purpose of generating arrays in Figures 5A and 5B) Figure 6A is the length of the present invention 127 reference subsequence generator (1) Figure 6B is the length of the present invention 1 2 7 Reference Subsequence generator (2) Figure 7 is a conventional code tree diagram of the 0VSF code. Figure 8 is a circuit diagram using the Hadamard matrix.

Page 12 569589 92. 5. 1δ Case No. 90131108 Revised figure: simple explanation [illustration of figure number] (conventional part) code tree 8 timing generator 9 1 (part of the present invention) first step 1 1 third Step 1 3 Fifth step 1 5 Reference subsequence 2 1 Password 3 1, 3 2 Generate array 4 1, Number of cyclic shifts 5 1 Number of samples 5 3 Backward shift register 6 1 Bollinger algebra forward operation circuit 6 2 OVSF code 8 Divide by 2 operation, 2 2 4 2, 5 2 2 Second step Fourth step 4

Doctor of Medicine Page 13

Claims (1)

569589 5 ·: —Case No. 90131108 Amended on Month and Day—το ;: ": — '6. Application for Patent Scope 1 · An orthogonal spread spectrum code generation method for a honeycomb sub-code multiplexed access communication system, which The generated array of the honeycomb code division multiplexed access communication system is described by at least one reference subsequence and a number of ciphers, and the row vector of the generated array is composed of the reference subsequences or the reference subsequences through cryptographic operations. The cryptographic operation takes these passwords as parameters; and the backtracking shift register of the honeycomb multiplexed access communication system is controlled by the backtracking method to generate a reference subsequence; and the honeycomb multiplexed access The Bollinger algebra forward operation circuit of the communication system implements a reference subsequence by using the Bollinger function and the register contents of the backtracking shift register; its main features are: These ciphers are the initial value of the register contents of the back-shift register or determined by its resurgence method, and the combination of the column vectors of the generated array will generate a two-valued autocorrelation sequence, and then the two-valued The auto-correlation sequence is subjected to all cyclic shifts, and parity check bits are added, and each 0 element is replaced by +1, and each 1 element is replaced by -1 to form a variable-length orthogonal communication system of divided code Spread spectrum codeword. 2 · Communication based on multiplex code access of honeycomb described in item 1 of the scope of patent application The orthogonal spreading code generation method of the system, wherein the cryptographic operation is cyclic shift or subsampling plus cyclic shift on the reference subsequence, and the cyclic shift number and subsampling order are the ciphers, among which The number of shifts corresponds to the initial value of the register contents of the backtracking shift register, and the subsampling order is determined by the backtracking method. 3. The orthogonal spread spectrum code generation method of the honeycomb code division multiplexed access communication system described in item 1 of the scope of patent application, wherein the size of the generation array is large. Page 14 569589 m 5, / ue: Γ:!; -Ί :: ¾ β. Case No. 90131108 Amendment II. • 22 —-·--1 6. I would like to ask for a special scope Is η 1 X η 2 where η 1 = 2 k 1 — 1 and η 2 = N — 1 / η 1 'are both coprime and satisfy N = 2 π = 2 k 1 k 2; The row vector has a non-sequential sequence, and the pass matrix is used to obtain the phase moment. The moment is obtained from the secondary value or more. •, phase separation, after the sequence, the nest is shifted in order, the relative position of the bee, the reference method is self-referencing, and all values are available. Xiang Chengshuang has a 1-year life-to-two-level code, a range of frequencies, or a range of distances, such as vector exhibitions, #phases, intersections, backwards, m, and zero lines, which are all-zero applications. By Series 4 Page 15