Source: http://www.google.com/patents/US6377539?dq=7,103,380
Timestamp: 2014-07-26 07:45:50
Document Index: 350305254

Matched Legal Cases: ['art 819', 'art 819', 'art 819', 'art 819', 'art 819', 'art 819', 'art 819', 'art 819', 'art 819', 'art 819', 'art 819', 'art 819', 'art 819', 'art 819', 'art 819']

Patent US6377539 - Method for generating quasi-orthogonal code and spreader using the same in ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign in<nobr>Advanced Patent Search</nobr>PatentsA device for generating quasi-orthogonal codes which allow the minimum interference with orthogonal codes in a mobile communication system using the orthogonal codes. The device includes a first spreader for spreading at least one input signal with quasi-orthogonal codes, a second spreader for spreading...http://www.google.com/patents/US6377539?utm_source=gb-gplus-sharePatent US6377539 - Method for generating quasi-orthogonal code and spreader using the same in mobile communication systemAdvanced Patent SearchPublication numberUS6377539 B1Publication typeGrantApplication numberUS 09/149,924Publication dateApr 23, 2002Filing dateSep 9, 1998Priority dateSep 9, 1997Fee statusPaidAlso published asCA2298690A1, CA2298690C, CN1160878C, CN1272266A, DE69833382D1, DE69833382T2, EP1013009A1, EP1013009B1, WO1999013599A1Publication number09149924, 149924, US 6377539 B1, US 6377539B1, US-B1-6377539, US6377539 B1, US6377539B1InventorsHee-Woon Kang, Jae-Yoel Kim, Jae-Min Ahn, Young-Ky Kim, Jong-Seon No, Ha-Bong Chung, Kyeong-Cheol YangOriginal AssigneeSamsung Electronics Co., Ltd.Export CitationBiBTeX, EndNote, RefManPatent Citations (9), Referenced by (49), Classifications (16), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetMethod for generating quasi-orthogonal code and spreader using the same in mobile communication systemUS 6377539 B1Abstract A device for generating quasi-orthogonal codes which allow the minimum interference with orthogonal codes in a mobile communication system using the orthogonal codes. The device includes a first spreader for spreading at least one input signal with quasi-orthogonal codes, a second spreader for spreading another input signal with Walsh codes, and a PN (Pseudo-Noise) spreader for complex-spreading output signals of the first and second spreaders with PN sequences. The quasi-orthogonal codes are characterized in that a partial correlation value with the Walsh codes does not exceed a lowest partial correlation limit value.
What is claimed is: 1. A method for generating quasi-orthogonal codes of length 22m in a mobile communication system using Walsh codes and said quasi-orthogonal codes, comprising the steps of:
generating an m-sequence of length 22m where length 22m is determined for a variable m selected from the group of numbers (1, 2, 3, . . . ) and selecting sub-sequences having a period of 2m−1 by selecting elements at intervals of 2m+1; generating a sequence of length 22m by adding �0� at the first position of the sequence of length 22m−1; generating 2m−1 sequences by connecting said sub-sequences, and column-permuting said generated sequences by a column permutation function; adding said Walsh codes to said column-permuted sequences to generate quasi-orthogonal candidate sequences having a full correlation value between said Walsh codes and other quasi-orthogonal codes that is smaller than a lowest full correlation value threshold; and selecting, from said quasi-orthogonal candidate sequences, quasi-orthogonal codes having a partial correlation value with said Walsh codes that satisfies said partial correlation value at a variable data rate. 2. A channel transmission device for a CDMA (Code Division Multiple Access) mobile communication system, comprising:
a first spreader for spreading an input channel signal with a quasi-orthogonal code; a second spreader for spreading another input channel signal with a Walsh code; and a PN (Pseudo-Noise) spreader for complex-spreading signals output from said first and second spreaders with a PN sequence wherein the quasi-orthogonal code is characterized in that a partial correlation between the quasi-orthogonal code and the Walsh code satisfies a first condition represented as  ∑ t = 1 + ( N M   l ) N M  ( l + 1 )  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N M   min where l=0,1,2, . . . , M−1, Si(t) represents the quasi-orthogonal code, Wk(t) represents the Walsh Code, N equals a length of the Walsh code, M is a variable depending on a change of a data rate, and θ N M   min represents a lowest partial correlation value threshold. 3. The channel transmission device as claimed in claim 2, wherein said lowest partial correlation value threshold is 4 when the N=256 and the M=16.
4. The channel transmission device as claimed in claim 2, wherein said lowest partial correlation value threshold is 4 when the N=256 and the M=32.
5. The channel transmission device as claimed in claim 2, wherein the quasi-orthogonal code is characterized in that a full correlation value with said Walsh code satisfies a second condition represented by:  ∑ t = 1 N  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N   min and a full correlation value with an other quasi-orthogonal codes satisfies a third condition represented by:  ∑ t = 1 N  ( - 1 ) S i  ( t ) + S i ′  ( t )  ≤ θ N   min where Si(t) represents the quasi-orthogonal codes, Wk(t) represents the Walsh Code, N equals a length of the Walsh codes, θNmim represents the lowest full correlation value threshold, and S′i(t) represents said other quasi-orthogonal codes.
6. The channel transmission device as claimed in claim 5, wherein the lowest full correlation value threshold is 16 when the N=256.
7. The base station system as claimed in claim 2, wherein a specified part of the quasi-orthogonal code is used when a data rate of the input channel signal is varied.
8. A channel transmission method for a CDMA mobile communication system, comprising the steps of:
spreading an input channel signal with quasi-orthogonal code; spreading another input channel signal with Walsh code; and complex-spreading said spread signals with a PN (Pseudo-Noise) sequence wherein the quasi-orthogonal code is characterized in that a partial correlation value with said Walsh code does not exceed a lowest partial correlation value threshold and the partial correlation value between the quasi-orthogonal code and the Walsh code satisfies a first condition represented as:  ∑ t = 1 + ( N M   l ) N M  ( l + 1 )  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N M   min where 1≦i≦N, 1≦k≦N, 1≦t≦N, l=0,1,2, . . . , M−1, Si(t) represents the quasi-orthogonal code, Wi(t) represents the Walsh Code, N equals a length of the Walsh codes, M is a variable depending on a change of a data rate, and θ N M   min represents said lowest partial correlation value threshold. 9. The channel transmission device as claimed in claim 8, wherein said lowest partial correlation value threshold is 4 when the N=256 and the M=16.
10. The channel transmission device as claimed in claim 8, wherein said lowest partial correlation value threshold is 4 when the N=256 and the M=32.
11. The channel transmission method as claimed in claim 8, wherein the quasi-orthogonal code is characterized in that a full correlation value with said Walsh code satisfies a second condition represented by;  ∑ t = 1 N  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N   min and a full correlation value with other quasi-orthogonal codes satisfies a third condition represented by;  ∑ t = 1 N  ( - 1 ) S i  ( t ) + S i ′  ( t )  ≤ θ N   min where Si(t) represents the quasi-orthogonal code, Wk(t) represents the Walsh Code, N equals a length of the Walsh code, θNmim represents the lowest full correlation value threshold, and S′i(t) represents said other quasi-orthogonal codes.
12. The channel transmission device as claimed in claim 11, wherein the lowest full correlation value threshold is 16 when the N=256.
13. The channel transmission method as claimed in claim 8, wherein a specified part of the quasi-orthogonal code is used when a data rate of the input channel signal is varied.
14. A method for generating quasi-orthogonal codes of length 22m in a mobile communication system using Walsh codes and said quasi-orthogonal codes, comprising the steps of:
generating an m-sequence of length 22m−1 where length 22m−1 is determined for variable m selected from the group of numbers (1, 2, 3 . . . ) and making sub-sequences having a period of 2m−1 by selecting elements out of the m-sequence elements at intervals of 2m+1; generating a sequence of length 22m−1 by connecting said sub-sequences; generating a sequence of length 22m by adding 0 at the first position of the sequence of length 22m−1; column-permuting said sequence of length 22m by applying a column permutation function which makes a sequence of length 22m generated by adding 0 at the first position of the m-sequence to a Walsh code; adding the column-permuted sequence to each of the length 22m Walsh codes to generate quasi-orthogonal candidate sequences of which full correlation value between the Walsh codes and the quasi-orthogonal candidate sequences is smaller than a lowest full correlation value threshold; and selecting, from said quasi-orthogonal candidate sequences, quasi-orthogonal codes whose partial correlation value with said Walsh codes does not exceed a lowest partial correlation value threshold. 15. The method as claimed in claim 14, further comprising the step of twice repeating said quasi-orthogonal codes to generate quasi-orthogonal codes having a length 22m+1.
16. A method for generating quasi-orthogonal codes of length N in a mobile communication system using Walsh codes and said quasi-orthogonal codes comprising the steps of:
providing a plurality of conditions; and generating said quasi-orthogonal codes in accordance with said conditions; said conditions being that a full correlation between a k-th Walsh code Wk(t) (1≦k≦N, 1≦t≦N) and an i-th quasi-orthogonal code Si(t) (1≦i≦N, 1≦t≦N) does not exceed θNmin as shown in Equation (5), that a full correlation between an i-th line and an i′-th line of the quasi-orthogonal codes does not exceed θNmin as shown in Equation (6), and that when using the quasi-orthogonal codes of length N and the Walsh codes of length N/M, a partial correlation between the respective codes of length N/M does not exceed θ N M   min as shown in Equation (7):  ∑ t = 1 N  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N   min ( 5 )  ∑ t = 1 N  ( - 1 ) S i  ( t ) + S i ′  ( t )  ≤ θ N   min ( 6 )  ∑ t = 1 + ( N M   l ) N M  ( l + 1 )  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N M   min ( 7 ) where, l=0,1,2, . . . , M−1, Wk(t) represents a k-th orthogonal code of length N (1≦k≦N), S′i(t) represents other quasi-orthogonal codes, and Si(t) represents a quasi-orthogonal code of length N (1≦i≦X), where X is a quasi-orthogonal code number selected so that Si(t) satisfies Equations (5) to (7).
17. A base station system for a CDMA (Code Division Multiple Access) mobile communication system, comprising:
a first spreader for spreading an input channel signal with a quasi-orthogonal code; a second spreader for spreading another input channel signal with a Walsh code; a PN (Pseudo-Noise) spreader for complex-spreading signals output from said first and second spreaders with a PN sequence; a baseband filter for filtering the complex spread signal; and a frequency shifter for shifting the filtered signal to a RF (Radio Frequency) signal; wherein the quasi-orthogonal code is characterized in that a partial correlation between the quasi-orthogonal code and the Walsh code satisfies a first condition represented as:  ∑ t = 1 + ( N M   l ) N M  ( l + 1 )  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N M   min a full correlation value between said Walsh codes and said quasi-orthogonal code satisfies a second condition represented by:  ∑ t = 1 N  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N   min and a full correlation value with an other quasi-orthogonal codes satisfies a third condition represented by:  ∑ t = 1 N  ( - 1 ) S i  ( t ) + S i ′  ( t )  ≤ θ N   min where l=0,1,2, . . . , M−1, 1≦i≦N, 1≦k≦N, Si(t) represents the quasi-orthogonal code, Wk(t) represents the Walsh Code, N equals a length of the Walsh code, M is a variable depending on a change of a data rate, θ N M   min represents a lowest partial correlation value threshold, θNmin represents a lowest full correlation value threshold, and S′i(t) represents said other quasi-orthogonal codes. 18. The base station system as claimed in claim 17, wherein said quasi-orthogonal code is characterized in that a partial correlation value between said Walsh code and said quasi-orthogonal code does not exceed a lowest partial correlation value threshold 4 when the length of Walsh code is 16 and the length of quasi-orthogonal code is 256.
19. The base station system as claimed in claim 17, wherein said lowest partial correlation value threshold is 4 when the N=256 and the M=32.
20. The base station system as claimed in claim 17, wherein said quasi-orthogonal codes are characterized in that a full correlation value between said Walsh codes and the quasi-orthogonal codes does not exceed a lowest full correlation value threshold 16 when a code length of the Walsh codes and he quasi-orthogonal codes is 256.
21. A channel signal transmission method for a CDMA mobile communication system, comprising the steps of:
spreading an input signal with a quasi-orthogonal code; spreading another input signal with a Walsh code; complex spreading said spread signals with a PN (Pseudo Noise) sequence; filtering the complex-spread signal; and shifting the filtered signal to a RF (Radio Frequency) frequency; wherein, the quasi-orthogonal code is characterized in that a partial correlation between the quasi-orthogonal code and the Walsh code satisfies a first condition represented as:  ∑ t = 1 + ( N M   l ) N M  ( l + 1 )  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N M   min a full correlation value between said Walsh codes and said quasi-orthogonal code satisfies a second condition represented by:  ∑ t = 1 N  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N   min and a full correlation value with an other quasi-orthogonal codes satisfies a third condition represented by:  ∑ t = 1 N  ( - 1 ) S i  ( t ) + S i ′  ( t )  ≤ θ N   min where l=0,1,2, . . . , M−1, 1≦i≦N, 1≦k≦N, Si(t) represents the quasi-orthogonal code, Wk(t) represents the Walsh Code, N equals a length of the Walsh code, M is a variable depending on a change of a data rate, θ N M   min represents the lowest partial correlation value threshold, θNmin represents the lowest full correlation value threshold, and S′i(t) represents said other quasi-orthogonal codes. 22. The channel signal transmission method as claimed in claim 21, wherein said quasi-orthogonal code is characterized in that a partial correlation value between said Walsh code and said quasi-orthogonal code does not exceed a lowest partial correlation value threshold 4 when the length of Walsh code is 16 and the length of quasi-orthogonal code is 256.
23. The channel signal transmission method as claimed in claim 21, wherein the lowest partial correlation value threshold θ N M   min is determined by (N/M)1/2. 24. The channel signal transmission method as claimed in claim 23, wherein said lowest partial correlation value threshold is 4 when the N=256 and the M=16.
25. The channel signal transmission method as claimed in claim 23, wherein said quasi-orthogonal codes are characterized in that a full correlation value between said Walsh codes and said quasi-orthogonal codes does not exceed a lowest full correlation value threshold and a full correlation value between said quasi-orthogonal codes does not exceed the lowest full correlation value threshold 16 when the length of the Walsh codes and the quasi-orthogonal code is 256.
The present invention relates generally to a mobile communication system and, in particular, to a method for generating quasi-orthogonal codes and spreader using the same in a mobile communication system.
In general, a CDMA (Code Division Multiple Access) system separates the channels by using orthogonal codes in order to increase channel capacity. For example, a forward link specified by the IS-95/IS-95A standard separates the channels by using the orthogonal codes. This channel separation method can also be applied to an IS-95/IS-95A reverse link through time alignment.
FIG. 1 illustrates the IS-95/IS-95A forward link in which the channels are separated by orthogonal codes. Referring to FIG. 1, the channels are separated by allocated orthogonal codes Wi (where i=0-63), respectively, which typically are Walsh codes. The IS-95/IS-95A forward link uses convolutional codes with a code rate R=1/2, employs a BPSK (Bi-Phase Shift Keying) modulation, and has a bandwidth of 1.2288 MHz. Accordingly, the number of available channels is 1.2288 MHz/(9.6 KHz*2)=64 (i.e., the IS-95/IS-95A forward link can separate 64 channels by using the orthogonal codes).
By selecting a modulation method and detecting the minimum data rate, the number of available orthogonal codes can be determined. However, designers of CDMA system(s) continuously strive to provide an increase in the number of the channels in order to improve the capability. However, even when a CDMA system uses the increased number of channels, the number of the available orthogonal codes are limited. In particular, increasing the channel capacity is restricted due to the limited number of the available orthogonal codes. In a mobile communication system using a variable data rate, the length of the Walsh codes depends upon the variable data rate. Thus, it is desirable to generate quasi-orthogonal codes allowing the minimum interference with the length of the Walsh codes.
SUMMARY OF THE INVENTION It is therefore an object of the present invention to provide a device and method for generating quasi-orthogonal codes in a mobile communication system using orthogonal codes so as to increase the channel capacity, and provide minimum interference with the orthogonal codes.
It is another object of the present invention to provide a device and method for spreading a signal by using Walsh codes and quasi-orthogonal codes in a CDMA mobile communication system.
It is a further object of the present invention to provide a device and method for generating quasi-orthogonal codes which allow the minimum interference with Walsh codes of varied lengths due to the variable data rate in a mobile communication system using both the Walsh codes and the quasi-orthogonal codes.
According to one aspect of the present invention, a channel transmission device for a CDMA mobile communication system includes a first spreader for spreading at least one input signal with quasi-orthogonal codes, a second spreader for spreading another input signal with Walsh codes, and a PN (Pseudo-Noise) spreader for complex-spreading output signals of the first and second spreaders with PN sequences. The quasi-orthogonal codes are characterized in that a partial correlation value with the Walsh codes does not exceed a lowest partial correlation limit value.
According to another aspect of the present invention, a method for generating quasi-orthogonal codes of length 22m in a mobile communication system using Walsh codes and the quasi-orthogonal codes includes the steps of generating an m-sequence of length 22m and selecting sub-sequences having a period of 22m−1 by selecting elements at intervals of 2m+1; generating non-zero sub-sequences out of the selected sub-sequences; generating 2m−1 sequences by connecting the sub-sequences, and column-permuting the generated sequences by a column permutation function; adding Walsh codes to the column-permuted sequences to generate quasi-orthogonal candidate sequences having a full correlation value between the Walsh codes and other quasi-orthogonal codes that is smaller than a lowest full correlation limit value; and selecting, from the quasi-orthogonal candidate sequences, quasi-orthogonal codes having a partial correlation value with the Walsh codes that satisfies a minimum partial correlation value at a variable data rate.
FIG. 1 is a diagram which illustrates channel separation by using orthogonal codes;
FIG. 2 is a diagram which illustrates a partial correlation between a Walsh as code and a quasi-orthogonal code;
FIG. 3 is a diagram showing a structure of a matrix Q according to a first is embodiment of the present invention;
FIG. 4 is a diagram showing a structure of a matrix Q′ according to a second embodiment of the present invention;
FIG. 5 is a flowchart which illustrates a method for generating quasi-orthogonal codes in accordance with one aspect of the present invention;
FIG. 6 is a flowchart which illustrates a method for generating quasi-orthogonal codes in accordance with another aspect of the present invention;
FIG. 7 is a diagram which illustrates channel expansion by using the quasi-orthogonal codes according to the present invention;
FIG. 8 is a block diagram of a mobile communication system using the quasi-orthogonal codes and the Walsh codes in accordance with one embodiment of the present invention;
FIG. 9 is a block diagram of an orthogonal code spreading and PN masking unit of FIG. 8 using the quasi-orthogonal codes for the pilot and control channels and the Walsh codes for the traffic channels in accordance with one embodiment of the present invention; and
FIG. 10 is a block diagram of an orthogonal code spreading and PN masking unit using the Walsh codes for the pilot and control channels and the quasi-orthogonal codes for the traffic channels in accordance with one embodiment of the present invention.
DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS The present invention is directed to a method for generating quasi-orthogonal codes which allow the minimum interference with the orthogonal codes in a CDMA system using the orthogonal codes, so as to increase the channel capacity of the system and the capacity of a single cell.
The quasi-orthogonal codes of the present invention should satisfy the following conditions expressed by Equations (1) to (3).  ∑ t = 1 N  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N   min   〈 Condition   1 〉 ( 1 )  ∑ t = 1 N  ( - 1 ) S i  ( t ) + S i ′  ( t )  ≤ θ N   min   〈 Condition   2 〉 ( 2 )  ∑ t = 1 + ( N M   l ) N M  ( l + 1 )  ( - 1 ) S i  ( t ) + W k  ( t )  ≤ θ N M   min   〈 Condition   3 〉 ( 3 ) where,
l=0,1,2, . . . , M−1;
Wk(t) represents a k-th orthogonal code of length N (1≦k≦N); and
Si(t) represents a quasi-orthogonal code of length N (1≦i≦X) where X is a quasi-orthogonal code number satisfying the conditions provided by Equations (1) to (3).
The first condition of Equation (1) provides that a full correlation between an i-th orthogonal code Wk(t) (1≦k≦N, 1≦t≦N) and an i-th quasi-orthogonal code Si(t) (1≦k≦X, 1≦t≦N) should not exceed θNmin. Specifically, when taking the correlation between the Walsh codes of length N and the quasi-orthogonal codes of length N, the full correlation therebetween should be smaller than the lowest fall correlation limit θNmim. The second condition of Equation (2) provides that the full correlation between an i-th line and an i′-th line of the quasi-orthogonal code should not exceed θNmin. Specifically, when taking the correlation between different Walsh codes of length N, the full correlation therebetween should be smaller than the lowest full correlation limit value θNmim. The third condition of Equation (3) provides that when using the quasi-orthogonal codes of length N and the Walsh codes of length N/M, the partial correlation between the respective codes of length N/M should not exceed θ N M   min . M is a value obtained by dividing the full length of the Walsh codes by the length of the Walsh codes whose length is changed by the variable data rate. For example, when using the Walsh codes of N=64 at a data rate of 9.6 Kbps, if the data rate is changed to 19.2 Kbps, the length of the Walsh codes becomes N/M=32. In this case, M is 2. When the data rate is changed as above, if the length N of the Walsh codes is changed and the length of the quasi-orthogonal codes is maintained, the partial correlation value between the Walsh codes having the changed length and the quasi-orthogonal codes having the constant length should be smaller than the lowest partial correlation limit value θ N M   min . This is to use a part of the sequence length of the quasi-orthogonal codes for correlation, when Walsh code length is varied. In this case, the quasi-orthogonal codes should have a lower correlation with the Walsh codes having the varied length.
The above Equation (1) shows the full correlation property between the orthogonal codes and the quasi-orthogonal codes, and θNmim is a value satisfying a covering radius of a first Reed-Muller code of length N and represents a value having the minimum correlation property theoretically. Further, Equation (2) shows the condition of the full correlation property between the quasi-orthogonal codes. In addition, Equation (3) shows the partial correlation property between the orthogonal codes and the quasi-orthogonal codes. The partial correlation property of Equation (3) is shown in FIG. 2, wherein M=2a(0≦a≦log2N). The partial correlation satisfies a condition that if the data rate is increased during the data service, the input signal is spread with Walsh codes of length N/M and then transmitted. Equation (3) shows a condition satisfying this correlation property. For example, when N=256, the values θ N M   min are shown in the following Table 1.
M = 1 θ N M  min = 16 N = 256
M = 2 θ N M  min = 16 N = 256
M = 4 θ N M  min = 8 N = 256
M = 8 θ N M  min = 8 N = 256
θ N M  min = 4 N = 256
θ N M  min = 2 The results of Table 1 can be expanded in general. For example, when N=1024 and a=2 (M=4), for the partial correlation between an orthogonal code of length 1024 and an orthogonal code of length 256, a full correlation bound θNmim between an orthogonal code of length 256 and a sequence other than the orthogonal code should be considered. Table 2 below shows the relationship between the length N and the lowest correlation limit value θNmim.
θNmim = 64
θNmim = 32
θNmim = 16
θNmim = 8
Research has shown that Kasami sequences can be utilized to satisfy the above conditions (1) and (2). In particular, a kasami sequence family exhibits a good cross correlation property between the Kasami sequences in a specified Kasami sequence group and the full correlation property of the Kasami sequence family is well known in the art. In contrast, research has not heretofore been conducted to provide a sequence satisfying the above condition (3). However, it is very important for the IS-95B standard or the future CDMA system supporting the variable data rate to satisfy condition (3).
First, among the sequences of length 22m, there exists 2m Kasami sequences satisfying conditions (1) and (2), including an m-sequence itself. A Kasami sequence set K is represented by the following Equation (4).
K=[S O(t),S 1(t), . . . ,S 2 m −1(t)] (4)
where t=0, . . . ,22m−2, and S0(t) is the m-sequence.
Referring now to FIG. 3, matrix Q can be constructed by cyclically shifting the sequences of the Kasami sequence set K of Equation (4). The matrix Q has 2m*22m rows and 22m columns. Here, it is known that Walsh codes can be made from a first 22m row by the column permutation. In this manner, orthogonal codes of length 22m and (2m−1)*22m sequences satisfying conditions (1) and (2) above can be obtained.
Next, the sequences satisfying condition (3) are selected from (2m−1)*22m sequences. It is necessary to group the orthogonal sequences out of the selected sequences. Although the original matrix Q is grouped in this way, it is ungrouped after the column permutation. As illustrated in FIG. 4, however, it is possible to obtain a matrix Q′ formed by regrouping the orthogonal codes. As shown, the matrix Q′ includes 2m orthogonal groups.
Referring now to FIG. 5, a flowchart illustrates a method for generating quasi-orthogonal candidate sequences of length 22m. Initially, an m-sequence m(t) of length 22m−1 (where t=0,1, . . . ,22m−2) is chosen (step 511). Next, sub-sequences having a period of 2m−1 are generated (step 512) by extracting (fixing) elements from the m-sequence m(t) (chosen in step 511) at intervals of (2m+1). Next, a determination is made as to whether the sum of the sub-sequences (fixed in step 512) is zero or not [ ∑ t = 0 2 m - 1   m sub  ( t ) = 0 ] (step 513). If the sum of the sub-sequences is zero (affirmative result at step 513), the non-zero sub-sequences [msub(t)=m((2m+1)t+1)] are generated (step 514).
When the sum of the sub-sequences is determined to be non-zero (negative result at step 513), a function for column-permuting the column-shifted Kasami sequence is defined (step 515). Specifically, a mapping σ from {0,1, . . . ,22m−2} to { 1 , 2 , �  , 2 2  m - 1 }  σ  ( t ) = ∑ t = 0 2 m - 1   m  ( t + i )  2 2  m - 1 - i is defined.
Thereafter, the sub-sequences (generated in the step 512) are column-shifted to make 22m−1 sequences (step 516), which means generation of the full sequences by connecting the sub-sequences. As a result, as shown in FIG. 5, the sequences are defined as:
[d i(t)|t=1, . . . , 22m , i=2, . . . 2m] d i  ( t ) = [ 0 , if   t = 1 m sub  ( t + i - 4 ) , if   t = 2 , 3 , �   2 2  m ] The sequences (defined in step 516) are column-permuted (step 517) by the permutation function (defined in step 515), so as to construct new sequences. Here, the amount of new sequences that can be constructed is as many as the number of the sub-sequences. That is, the new sequences (in step 517) are represented as follows;
[e i(t)|t=1, . . . ,22m , i=2, . . . ,2m] e i  ( t ) = [ d i  ( 1 ) , if   t = 1 d i  ( σ - 1  ( t - 1 ) + 2 ) , if   t = 2 , 3 , �   2 2  m ] Next, the quasi-orthogonal codes are enumerated (step 518) as shown in FIG. 4 by using the ei(t)'s defined above. That is, the quasi-orthogonal candidate sequences are generated by adding the column-permuted values to the Walsh codes, and the above quasi-orthogonal candidate sequences satisfy the conditions of Equations (1) and (2). The operation of step 518 can be expressed by;
[W j(t)|t=1,2, . . . 22m , j=0,1, . . . ,22m−1] [S ij(t)|t=1,2, . . . 22m] S ij  ( t ) = [ W j  ( t ) , if   i = 1 , j = 0 , 1 , �   2 2  m - 1 e i  ( t ) + W j  ( t ) , if   i = 2 , �   2 m , j = 0 , 1 , �  , 2 2  m - 1 ] After generation of the quasi-orthogonal candidate sequences satisfying Equations (1) and (2), the procedure is ready to select the quasi-orthogonal codes satisfying the condition of the above Equation (3) (step 519). Accordingly, the quasi-orthogonal codes satisfying the condition of Equation (3) are selected from the quasi-orthogonal candidate sequences through experiments. Here, the ei(t) selected in accordance with the method described above for FIG. 5 is called a mask.
The quasi-orthogonal codes generated by the above procedure are shown below in Tables 3A and 3B. Table 3A shows the quasi-orthogonal codes of length 128 and Table 3B shows the quasi-orthogonal codes of length 256. In the following to tables 3A and 3B, g(x) represents coefficients of a characteristic polynomial used for generating m-sequence.
g(x) = 1100111
f1 = 17dbbd71e8db427117dbbd71e8db4271
f2 = 72824ebebeb17d7272824ebebeb17d72
f3 = 2dee87bb8744d2ee2dee87bb8744d2ee
g(x) = 101001101
f1 = 77b4b477774bb48887bb447878bbbb7877b44b88774b4b77784444788744bb78
f2 = 7e4ddbe817244d7ed41871bd428e18d4d4e77142bd8ee7d47eb2db17e824b27e
f3 = 417214d87db1281beb274172d7e47db1b17de4d78dbed8141b28b17d27eb8dbe
f4 = 144ee441b114bee44eebbee4144e1bbe8d287d27d78dd87dd78d278272d77d27
f5 = 488b78471dded1edb88474b7edd1de1d122ede1d477b74b71dde2e12488b84b8
f6 = 1db78bded17b47121d488b212e7bb8122e7b472d1d4874ded17bb8ed1db77421
Referring now to FIG. 6, a flowchart illustrates a method for generating a quasi-orthogonal candidate sequence of length 22m+1. In FIG. 6, steps 611 to 616 are similar to steps 511 to 516 discussed above for FIG. 5. After step 616, the newly generated sequences ei(t)'s are repeated twice (step 617), thereby constructing the new sequences as follows.
[e i(t)|t=1, . . . , 22m , i=2, . . . ,2m] e i′(t)=e i(t) e i′(t+22m)=e i(t) After being repeated twice, the sequences ei(t) have the form as shown in Table 4 below, wherein the sequence e′i(t) has 2m−1 rows and 22m−1 columns.
ei(t)
Thereafter, the quasi-orthogonal codes are generated (step 618) by using the sequences ei(t)'s generated in step 617, where the Walsh codes being the orthogonal codes are expressed by the following:
[W j(t)|t=1,2, . . . ,22m+1 , j=0,1, . . . 22m+1−1] [S ij(t)|t=1,2, . . . ,22m+1] S ij  ( t ) = [ W j  ( t ) , if   i = 1 , j = 0 , 1 , �  , 2 2  m + 1 - 1 e i ′  ( t ) + W j  ( t ) , if   i = 2 , �  , 2 m , j = 0 , 1 , �  , 2 2  m + 1 - 1 ] Either all or none of the sequences of the quasi-orthogonal codes generated in accordance with the methods illustrated in FIGS. 5 and 6 have the orthogonal properties. Further, the number of the selected groups depends upon the selected m-sequence. Table 5 below shows the states mentioned above, and the selected sequences are what has been referred to herein as quasi-orthogonal codes.
# of Quasi Orthogonal Sequences
6*256 ***
6*256
Here, e′i(t) represents the sequence of length 22m+1 and ei(t) represents the sequence of length 22m. Of course, e′i(t) can be made from a combination of multiple e′i(t)'s. Although number of the possible combinations is (2m−1)*(2m−1), the number of e′i(t)'s is (2m−1) under all circumstances. For example, for length 512, the number of the quasi-orthogonal code sets is 6*512 when using a first m-sequence of 2m=8, as represented by *** in Table 5.
As described above, it is possible to increase the channel capacity by using quasi-orthogonal codes described herein when further orthogonal codes are needed in situations where Walsh codes are used. In such a case, a minimum interference with the Walsh codes occurs, thus providing a fixed correlation value. For example, when N=64, a correlation value between the quasi-orthogonal code and the Walsh code is 8 or −8. In addition, the partial correlation value between the quasi-orthogonal codes of length N=256 and the Walsh codes of length N=64 is also 8 or −8. This means that it is possible to determine an amount of the interference.
These quasi-orthogonal codes can be used in every CDMA system using Walsh codes. When a CDMA system utilizes the quasi-orthogonal codes together with the Walsh codes, the following three options can be taken into consideration:
In a system providing service at a variable data rate by using the Walsh codes, it is possible to freely use the Walsh codes without restriction of the length, as well as use all the quasi-orthogonal code sequences as a total length.
It is possible to construct two orthogonal sets by selecting one of a Walsh code group and a quasi-orthogonal code group, and enable the two groups to support the variable data rate.
It is possible to use the Walsh code group and the quasi-orthogonal group as one group and enable the two groups to support the variable data rate. In this case, there may occur a random code property between the quasi-orthogonal code groups.
It is preferable to use the quasi-orthogonal codes according to the applications to be used, taking into consideration the three options mentioned above. That is, when using the Walsh codes only, a modulating side interchanges a pre-engaged orthogonal code number with a demodulating side. However, when using the orthogonal codes and the quasi-orthogonal codes, it is necessary that the modulating side interchanges the pre-engaged orthogonal code number and the group number (an index i of Q′ matrix ei(t) of FIG. 4) with the demodulating side. In such a case, the orthogonal code group is called a group 0, and in this manner, the succeeding group numbers are defined again up to 2m−1.
Reference will now be made to a method for using the quasi-orthogonal code group for a system having the variable data rate such as the orthogonal code group. The elements of the quasi-orthogonal code group are represented by the sum of the Walsh code corresponding to a specific Walsh code number and a quasi-mask corresponding to a quasi-orthogonal group number. In this case, the quasi-orthogonal code group number represents which ei(t) is selected. A method for supporting the variable data rate in the quasi-orthogonal code group is to use the allocated orthogonal code number as the Walsh code group and then add the allocated ei(t) at intervals of length N.
FIG. 7 shows a case where the channels are expanded by using the Walsh codes and the quasi-orthogonal codes in the IS-95/IS-95A forward link according to an embodiment of the present invention. In particular, the Walsh codes are represented by Wi (where i=0-63) and the channels are separated by the allocated orthogonal codes, respectively. The quasi-orthogonal codes are represented by Si (where i=0-191), and allocated to the traffic channels. As illustrated, the IS-95/IS-95A forward link can conduct the channel separation for 64 subscribers by using the Walsh codes, and additionally for 192 subscribers by using the quasi-orthogonal codes. Accordingly, it is to be appreciated the number of channels can be increased by a factor of 3 by using the Walsh codes together with the quasi-orthogonal codes.
FIG. 8 shows a block diagram of a mobile communication system having a spreader using the Walsh codes and the quasi-orthogonal codes according to an embodiment of the present invention. In the mobile communication system of FIG. 8, the channel transmitters include the pilot channel, the control channel and the traffic channel. The channel signals are independently separated by using the Walsh codes and the quasi-orthogonal codes.
Referring to FIG. 8, a first signal converter (or signal mapper) 811 converts input pilot and control channel data bit streams. Specifically, the first signal converter 811 converts an input bit stream 0 to a signal +1 and an input bit stream 1 to a signal −1, and then outputs the converted signals to an orthogonal code spreading and PN (Pseudo-Noise) masking part 819. A second signal converter 813 converts an input traffic channel data bit stream. Specifically, the second signal converter 813 converts an input bit stream 0 to a signal +1 and an input bit stream 1 to a signal −1, and then outputs the converted signals to the orthogonal code spreading and PN masking part 819. Here, when the communication device uses QPSK modulation, the first and second signal converters 811 and 813 demultiplex odd and even data, respectively.
A Walsh code generator 814 generates Walsh codes Wi in accordance with code indexes of the corresponding channels and outputs the generated Walsh codes Wi to the orthogonal code spreading and PN masking part 819. A quasi-orthogonal code generator 815, having the quasi-orthogonal codes, selects the quasi-orthogonal codes Si corresponding to the code index of the corresponding channel, and provides the selected quasi-orthogonal codes to the orthogonal code spreading and PN masking part 819. In other way, the quasi-orthogonal code generator 815. generates the quasi-orthogonal code mask, generates the quasi-orthogonal codes by adding the mask to the corresponding Walsh codes, and provides the generated quasi-orthogonal codes to the orthogonal code spreading and PN masking part 819. A PN code generator 817 generates a real PN code PNi and an imaginary PN code PNq, and applies the generated PN codes to the orthogonal code spreading and PN masking part 819. The orthogonal code spreading and PN masking part 819 spreads the signals output from the first and second signal converters 811 and 813 by first multiplying the output signals by the Walsh codes Wi and the quasi-orthogonal codes Si, and then PN-masking the spread signals by multiplying the spread signals so by the real and imaginary PN codes PNi and PNq, thereby generating output signals Xi and Xq. A baseband filter 821 baseband-filters the spread signals Xi and Xq output from the orthogonal code spreading and PN masking part 819. A frequency shifter 823 shifts the signals output from the baseband filter 821 to an RF (Radio Frequency) signal.
Assume that the pilot and control channels (which are reference channels) and the traffic channel are occupied by one user terminal of FIG. 8, in order to obtain a sync demodulation gain. In this situation, the user terminal transmits data bits of 1 or 0 through the traffic channel, and transmits reference data of 1 or 0 for sync-demodulating the traffic channel through the pilot and control channels. The data bits of 1 and 0 on the pilot and control channels and the traffic channel are converted respectively to the signals −1 and +1 by the first and second signal converters 811 and 813, and applied to the orthogonal code spreading and PN masking part 819. Then, the orthogonal code spreading and PN masking part 819 generates a complex spread signal in the baseband by multiplying the input signals by the corresponding Walsh or quasi-orthogonal codes, multiplies the orthogonally spread signals by the PN codes, and outputs the generated complex signals to the baseband filter 821. The complex spread signal is composed of the real component Xi and the imaginary component Xq. The baseband filter 821 then modulates and filters the complex signal by OQPSK (Offset Quadrature Phase Shift Keying) modulation, and the frequency shifter 823 shifts the output signal of the baseband filter 821 to the spread RF signal. The orthogonal code spreading and PN masking part 819 is a spreading part for enhancing the correlation property against the multipath delay, and can be realized in various structures.
FIG. 9 illustrates one embodiment of the structure of the orthogonal code spreading and PN masking part 819 which utilize the quasi-orthogonal codes Si for the pilot and control channels and the Walsh codes Wi for the traffic channel, and employs the complex PN-masking. A first spreader 911 multiplies the pilot and control channel signals by the quasi-orthogonal codes Si and outputs an orthogonally spread signal d1. A second spreader converter 913 multiplies the traffic channel signal by the Walsh codes Wi and outputs an orthogonally spread signal d2. A repeater 917 repeats the PN codes PNi and PNq output from a PN code generator 817, a predetermined number of times. A complex multiplier 919 multiplies the spread signals d1 and d2 output from the first and second spreaders 911 and 913, respectively, by the PN codes PNi and PNq output from the repeater 917, and generates PN-masked signals Xi and Xq (Xi=d1*(PNi+PNq), Xq=d2*(PNi*PNq)). As show in FIG. 9, the complex multiplier 919 performs complex PN masking through the complex operation.
In FIG. 9, the quasi-orthogonal codes Si allocated to the pilot and control channels and the Walsh codes Wi allocated to the traffic channel are sub-codes constituting the orthogonal codes and should be different from each other. Therefore, when the orthogonal code spreading and PN masking part 819 is constructed as shown in FIG. 9, it is possible to achieve the complete time synchronization between the pilot/control channels and the traffic channel, thereby reducing the mutual interference.
FIG. 10 illustrates one embodiment of the orthogonal code spreading and PN masking part 819 which uses the Walsh codes Wi for the pilot and control channels and the quasi-orthogonal codes Si for the traffic channel, and which does not employ the complex PN masking. A first spreader 1011 multiplies pilot and control channel input signals by the Walsh codes Wi and outputs a spread signal d1. A second spreader 1013 multiplies the input traffic channel signal by the quasi-orthogonal codes Si and outputs a spread signal d2. An adder 1015 adds the spread signal d1 output from the first spreader 1011 to the spread signal d2 output from the second spreader 1013 to generate a signal d1+d2. An adder 1017 adds the spread signal d2 output from the second spreader 1013 to the spread signal d1 output from the first spreader 1011 to generate a signal d2+d1. A repeater 1021 repeats the real and imaginary PN codes PNi and PNq output from a PN code generator 817, a predetermined number of times. A multiplier 1023 multiplies the spread signal d1+d2 output from the adder 1015 by the PN code PNi output from the repeater 1021 and, generates a PN-masked signal Xi. A multiplier 1025 multiplies the spread signal d2+d1 output from the adder 1017 by the PN code PNq output from the repeater 1021 to generate a PN-masked signal Xq.
In FIG. 10, the Walsh codes allocated to the pilot and control channels should be different from the quasi-orthogonal codes Si allocated to the traffic channel. The orthogonal code spreading and PN masking part 819 constructed in this way can achieve complete time synchronization between the pilot/control channels and the traffic channel, thus reducing the mutual interference.
In summary, it is possible to expand channel capacity by using the Walsh codes together with the quasi-orthogonal codes as described above. As described above, the spreader illustrated in FIG. 9 uses the quasi-orthogonal codes for the pilot and control channels and the Walsh codes for the traffic channel. On the contrary, the spreader illustrated in FIG. 10 uses the Walsh codes for the pilot and control channels and the quasi-orthogonal codes for the traffic channel. Furthermore, it is possible to separately use Walsh codes for the pilot channel and quasi-orthogonal codes for the control channel, and vice versa. It is also possible to selectively use either of the Walsh codes and the quasi-orthogonal codes for the control channel, the pilot channel and the traffic channel.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS3715508 *Sep 15, 1967Feb 6, 1973IbmSwitching circuits employing orthogonal and quasi-orthogonal pseudo-random code sequencesUS5088111 *Feb 28, 1989Feb 11, 1992First Pacific NetworksModulation and demodulation system employing AM-PSK and FSK for communication system using digital signalsUS5546423 *Jun 8, 1994Aug 13, 1996Alcatel TelspaceSpread spectrum digital transmission system using low-frequency pseudorandom encoding of the wanted information and spectrum spreading and compression method used in a system of this kindUS5583851 *Jul 8, 1994Dec 10, 1996Matsushita Electric Industrial Co., Ltd.Mobile communication apparatus having multi-codes allocating functionUS5623487 *May 19, 1995Apr 22, 1997Stanford Telecommunications, Inc.Doubly orthogonal code and frequency division multiple access communication systemUS5799010 *Jun 27, 1996Aug 25, 1998Interdigital Technology CorporationCode division multiple access (CDMA) communication systemUS5864548 *Jan 6, 1997Jan 26, 1999Cwill Telecommunications, Inc.Method and apparatus for fast modulation in synchronous CDMA communicationsUS5987014 *Jul 14, 1994Nov 16, 1999Stanford Telecommunications, Inc.Multipath resistant, orthogonal code-division multiple access systemUS6144694 *Oct 7, 1997Nov 7, 2000Hitachi, Ltd.Transmitting apparatus for code division multiplexed signals* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS6459693 *Jul 7, 1999Oct 1, 2002Samsung Electronics, Co., Ltd.Device and method for cancelling code interference in a CDMA communication systemUS6504832 *Oct 19, 1999Jan 7, 2003Samsung Electronics, Co., Ltd.Channel assigning device and method using quasi-orthogonal code in a CDMA communication systemUS6512753 *Dec 29, 1999Jan 28, 2003Samsung Electronics, Co., Ltd.Device and method for spreading channels in mobile communication systemUS6643280 *Oct 27, 1999Nov 4, 2003Lucent Technologies Inc.Method and apparatus for generation of CDMA long codesUS6671251 *Jan 11, 2000Dec 30, 2003Samsung Electronics Co., Ltd.Method for generating complex quasi-orthogonal code and apparatus and method for spreading channel data using the quasi-orthogonal code in CDMA communication systemUS6674712 *Sep 8, 1999Jan 6, 2004Samsung Electronics Co., Ltd.Device and method for generating quaternary complex quasi-orthogonal code and spreading transmission signal using quasi-orthogonal code in CDMA communication systemUS6885691 *Aug 1, 2000Apr 26, 2005Lg Information & Communications, Ltd.Scrambling codes and channelization codes for multiple chip rate signals in CDMA cellular mobile radio communication systemUS6999500 *Nov 2, 2001Feb 14, 2006Qualcomm Inc.System for direct sequence spreadingUS7031370 *Feb 29, 2000Apr 18, 2006Sharp Kabushika KaishaSpread-spectrum communication deviceUS7315531 *Jun 1, 2004Jan 1, 2008Qualcomm IncorporatedMethod and apparatus for transmitting and receiving variable rate dataUS7372891 *Aug 3, 2000May 13, 2008British Telecommunications Public Limited CompanySignal generator and decoderUS7551582 *Oct 12, 2004Jun 23, 2009Nextel Communications Inc.System and method for optimizing walsh code assignmentsUS7580400 *Nov 18, 2004Aug 25, 2009Samsung Electronics Co., LtdApparatus and method for generating preamble signal for cell identification in an orthogonal frequency division multiplexing systemUS7623442Jul 20, 2005Nov 24, 2009Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS7697413 *Apr 28, 2003Apr 13, 2010Alcatel-Lucent Usa Inc.Method for generating a code mask for coding transmission over a traffic channelUS7916624Apr 13, 2010Mar 29, 2011Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS7916694 *Mar 6, 2006Mar 29, 2011Broadcom CorporationMethod and system reducing peak to average power ratio (PAPR) in a communication networkUS7924699Apr 13, 2010Apr 12, 2011Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS7961592Nov 15, 2007Jun 14, 2011Qualcomm IncorporatedMethod and apparatus for transmitting and receiving variable rate dataUS7990843Apr 13, 2010Aug 2, 2011Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS7990844Apr 13, 2010Aug 2, 2011Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS8009721 *Jun 13, 2008Aug 30, 2011Panasonic CorporationWireless communication apparatus and response signal spreading methodUS8014271Jul 10, 2008Sep 6, 2011Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS8045512Oct 27, 2005Oct 25, 2011Qualcomm IncorporatedScalable frequency band operation in wireless communication systemsUS8098568Apr 24, 2009Jan 17, 2012Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS8098569Apr 24, 2009Jan 17, 2012Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS8098592 *Apr 5, 2004Jan 17, 2012Alcatel LucentCellular data transmission time period estimationUS8179947Jun 21, 2011May 15, 2012Panasonic CorporationRadio communication apparatus and reference signal generating methodUS8199634Jun 10, 2011Jun 12, 2012Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS8199792Oct 24, 2011Jun 12, 2012Panasonic CorporationRadio communication apparatus and response signal spreading methodUS8218425Jun 10, 2011Jul 10, 2012Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS8223627Jun 10, 2011Jul 17, 2012Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS8228784 *Sep 25, 2006Jul 24, 2012Kabushiki Kaisha ToshibaConfigurable block CDMA schemeUS8295154Jun 10, 2011Oct 23, 2012Qualcomm IncorporatedSignaling method in an OFDM multiple access systemUS8311079Nov 21, 2011Nov 13, 2012Panasonic CorporationBase station apparatus and radio communication methodUS8446892May 13, 2005May 21, 2013Qualcomm IncorporatedChannel structures for a quasi-orthogonal multiple-access communication systemUS8462859May 31, 2006Jun 11, 2013Qualcomm IncorporatedSphere decoding apparatusUS8477684Nov 20, 2007Jul 2, 2013Qualcomm IncorporatedAcknowledgement of control messages in a wireless communication systemUS8547951Jun 1, 2010Oct 1, 2013Qualcomm IncorporatedChannel structures for a quasi-orthogonal multiple-access communication systemUS8565194Oct 27, 2005Oct 22, 2013Qualcomm IncorporatedPuncturing signaling channel for a wireless communication systemUS8582509Oct 27, 2005Nov 12, 2013Qualcomm IncorporatedScalable frequency band operation in wireless communication systemsUS8582548Jan 4, 2006Nov 12, 2013Qualcomm IncorporatedFrequency division multiple access schemes for wireless communicationUS8599945Jun 9, 2006Dec 3, 2013Qualcomm IncorporatedRobust rank prediction for a MIMO systemUS8611284Mar 7, 2006Dec 17, 2013Qualcomm IncorporatedUse of supplemental assignments to decrement resourcesUS8644292Oct 27, 2005Feb 4, 2014Qualcomm IncorporatedVaried transmission time intervals for wireless communication systemUS8681764Nov 22, 2010Mar 25, 2014Qualcomm IncorporatedFrequency division multiple access schemes for wireless communicationUS8693405Oct 27, 2005Apr 8, 2014Qualcomm IncorporatedSDMA resource managementUS20070098050 *Aug 28, 2006May 3, 2007Aamod KhandekarPilot symbol transmission in wireless communication systemsEP1013009A1 *Sep 9, 1998Jun 28, 2000Samsung Electronics Co., Ltd.Method for generating quasi-orthogonal code and spreader using the same in mobile communication system* Cited by examinerClassifications U.S. Classification370/209, 370/203, 375/130International ClassificationH04J11/00, H04B7/24, H04B7/26, H04B1/707, H04J13/04, H04Q7/38, H04J13/00Cooperative ClassificationH04J13/0022, H04J13/10, H04J13/004European ClassificationH04J13/10, H04J13/00B5, H04J13/00B7Legal EventsDateCodeEventDescriptionOct 22, 2013FPAYFee paymentYear of fee payment: 12Sep 23, 2009FPAYFee paymentYear of fee payment: 8Sep 30, 2005FPAYFee paymentYear of fee payment: 4Jan 8, 1999ASAssignmentOwner name: SAMSUNG ELECTRONICS CO., LTD., KOREA, REPUBLIC OFFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KANG, HEE-WON;KIM, JAE-YOEL;AHN, JAE-MIN;AND OTHERS;REEL/FRAME:009679/0576Effective date: 19981229RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google