초록 ▼

An orthogonal complex spreading method for a multichannel and an apparatus thereof are disclosed. The method includes the steps of complex-summing αn1WM,n1Xn1 which is obtained by multiplying an orthogonal Hadamard sequence WM,n1 by a first data Xn1 of a n-th block and αn2WM,n2Xn2 which is

An orthogonal complex spreading method for a multichannel and an apparatus thereof are disclosed. The method includes the steps of complex-summing αn1WM,n1Xn1 which is obtained by multiplying an orthogonal Hadamard sequence WM,n1 by a first data Xn1 of a n-th block and αn2WM,n2Xn2 which is obtained by multiplying an orthogonal Hadamard sequence W1,n2 by a second data Xn2 of a n-th block; complex-multiplying αn1WM,n1Xn1+jαn2WM,n2 Xn2 which is summed in the complex type and WM,n3+jPWM,n4 of the complex type using a complex multiplier and outputting as an in-phase information and quadrature phase information; and summing only in-phase information outputted from a plurality of blocks and only quadrature phase information outputted therefrom and spreading the same using a spreading code.

대표청구항 ▼

What is claimed is: 1. An orthogonal complex spreading method for multiple channels, comprising the steps of: complex-summing WM,n1Xn1, which is obtained by multiplying an orthogonal code sequence WM,n1 by first data group Xn1 of a n-th block, and WM,n2Xn2, which is obtained by multiplying an ortho

What is claimed is: 1. An orthogonal complex spreading method for multiple channels, comprising the steps of: complex-summing WM,n1Xn1, which is obtained by multiplying an orthogonal code sequence WM,n1 by first data group Xn1 of a n-th block, and WM,n2Xn2, which is obtained by multiplying an orthogonal code sequence WM,n2 by second data group Xn2 of a n-th block, M and n being positive integers; complex-multiplying the complex summed form of WM,n1Xn1+jWM,n2Xn2, by a complex form of WM,n3+jWM,n4 and outputting (WM,n1Xn1+jWM,n2Xn2)��(WM,n3 +jWM,n4) as an output signal; and summing in-phase and quadrature phase parts of the output signal outputted from a plurality of blocks as K is a predetermined integer greater than or equal to 1 to generate I channel and Q channel signal. 2. The method of claim 1 wherein a spreading code spreads the summed in-phase and quadrature-phase signals outputted from the summing step. 3. The method of claim 1 wherein said orthogonal code sequence includes a Hadamard code sequence. 4. The method of claim 1 wherein said orthogonal code sequence includes a Walsh code. 5. The method of claim 2 wherein said spreading code is one spreading code. 6. The method of claim 5 wherein said spreading code sequence includes a PN code. 7. The method of claim 5 wherein said spreading code includes a first spreading code for the in-phase signal and a second spreading code for the quadrature-phase signal. 8. The method of claim 7 wherein the first and second spreading codes are PN codes. 9. The method of claim 3 wherein WM,11=W0, WM,12=W2, and WM,13=W0, WM,14=W1, when M=4. 10. The method of claim 9 wherein M=8 and WM,12=W4. 11. The method of claim 3 wherein WM,n1=W0, WM,n2=W2p, where p represents a predetermined number in a range from 0 to (M/2)-1, and WM,n3=W2n-2, WM,n4=W2n-1. 12. The method of claim 3 wherein WM,21=W0, WM,22=W4, WM,23=W2, WM,24=W3 when M=8 in case of two channels. 13. The method of claim 12 wherein WM,12=W6, and WM,22=W6. 14. An orthogonal complex spreading apparatus, comprising: a plurality of complex multiplication blocks, each for complex-multiplexing a complex signal WM,n1Xn1+jWM,n2Xn2 by WM,n3+jWM,n4 wherein WM,n1Xn1 is obtained by multiplying an orthogonal code sequence WM,n1 by first data group Xn1 of n-th block and WM,n2Xn2 is obtained by multiplying orthogonal sequence WM,n2 by second data group Xn2 of the n-th block, wherein M and n are positive integers and WM,n1, WM,n2, WM,n3 and WM,n4 are predetermined orthogonal sequences; and a summing unit for summing in-phase and quadrature phase parts of an output signal from each block of the plurality of the complex multiplication blocks as K is a predetermined integer greater than or equal to 1. 15. The apparatus of claim 14 further comprising a spreading unit for multiplying the summed in-phase and quadrature phase signals inputted from the summing unit by spreading code. 16. The apparatus of claim 15 wherein said spreading unit multiplies the in-phase and quadrature phase part by different spreading codes. 17. The apparatus of claim 14 wherein each said complex multiplication block includes: a first multiplier for multiplying the first data group Xn1 by the orthogonal code sequence WM,n1; a second multiplier for multiplying the second data group Xn2 by the orthogonal code sequence WM,n2; third and fourth multipliers for multiplying the output signal WM,n1Xn1 from the first multiplier and the output signal WM,n2Xn2 from the second multiplier by orthogonal code sequence WM,n3; fifth and sixth multipliers for multiplying the output signal WM,n1Xn1 from the first multiplier and the output signal WM,n2Xn2 from the second multiplier by orthogonal code sequence WM,n4; a first adder for subtracting output signal from the sixth multiplier from output signal (ac) from the third multiplier and outputting an in-phase information; and a second adder for summing output signal from the fourth multiplier and output signal from the fifth multiplier and outputting quadrature phase information. 18. The apparatus of claim 17 wherein said orthogonal code sequence includes a Hadamard code sequence. 19. The apparatus of claim 17 wherein said orthogonal code sequence includes a Walsh code. 20. A permuted orthogonal complex spreading method for multiple channels allocating at least two input channels to first and second groups, comprising the steps of: multiplying a predetermined orthogonal code sequence WM,n1 by first data group Xn1; multiplying orthogonal code sequence MM,n2 by second data group Xn2; summing output signals WM,n1Xn1 and WM,n2Xn2 in the complex form of and complex-multiplying the received output signal wherein P is a predetermined sequence, and WM,I and WM,Q are orthogonal code sequences. 21. The method of claim 20 wherein id="INS-S-00002" date="20080617" a spreading code spreads the output of the step of complex-multiplying, and id="INS-S-00002" the spreading code is id="INS-S-00003" date="20080617" generated based on at least id="INS-S-00003" a PN code. 22. The method of claim 20 wherein P represents said predetermined sequence or predetermined spreading code or predetermined integer configured so that two consecutive sequences have identical values. 23. The method of claim 20 wherein said orthogonal code sequence includes a Hadamard code sequence. 24. The method of claim 20 wherein said orthogonal code sequence includes a Walsh code. 25. The method of claim 23 wherein WM,I=W0, WM,Q=W2q+1 (where q represents a predetermined number in a range from 0 to (M/2)-1). 26. The method of claim 23 further comprising the steps of: multiplying the first data group Xn1 by gain αn1; and multiplying the second data group Xn2 by gain αn2. 27. The method of claim 23 wherein WM,11=W0, WM,12=W2, and WM,I=W0, WM,Q=W1, when M=4. 28. The method of claim 27 wherein M=8 and WM,12=W4. 29. The method of claim 23 wherein WM,n1=W0, WM,n2=W2q+1, wherein q represents a predetermined number in a range from 0 to (M/2)-1 and WM,I=W0, WM,Q=W1. 30. The method of claim 20 wherein each group has at least two channels and the receiving step includes the steps of: summing output signals WM,n1Xn1 from a first sequence multiplier; and summing output signals WM,n2Xn2 from a second sequence multiplier. 31. A permuted orthogonal complex spreading apparatus for multiple channels, allocating at least two input channels to first and second groups, comprising: a first multiplier block having at least one channel contained in a first group of channels, each for outputting WM,n1Xn1 which is obtained by multiplying first data group Xn1 by orthogonal code sequence WM,n1, and M and n are positive integers; a second multiplier block having a number of channels having at least one channel contained in a second group of channels, each for outputting WM,n2Xn2 which is obtained by multiplying a first data group Xn2 by orthogonal code sequence WM,n2; a complex multiplier for receiving the output signals from the first and the second multiplier blocks in a complex form of and complex-multiplying received output signal by WM,I+jPWM,Q, wherein WM,I and WM,Q are predetermined orthogonal code sequence permuted and P is a predetermined sequence. 32. The apparatus of claim 31 wherein said orthogonal code sequence includes a Hadamard code sequence. 33. The apparatus of claim 31 wherein said orthogonal code sequence includes a Walsh code. 34. The apparatus of claim 32 wherein WM,11=W0, WM,12=W4, WM,21=W2, and WM,I=W0, WM,Q=W1, when M=8 in case of three input channels. 35. The apparatus of claim 32 wherein WM,11=W0, WM,12=W2, and WM,I=W0, WM,Q=W1 in case of three input channels. 36. The apparatus of claim 32 wherein WM,11=W0, WM,12=W4, WM,21=W2, WM,31=W6, and WM,I=W0, WM,Q=W1 in case of four input channels. 37. The apparatus of claim 32 wherein WM,11=W0, WM,12=W4, WM,31=W2, WM,I=W0, WM,Q=W1 and WM,21=W8 in case of four input channels. 38. The apparatus of claim 32 wherein WM,11=W0, WM,12=W4, WM,21=W2, WM,31=W6, WM,22=W1, and WM,I=W0, WM,Q=W1 in case of five input channels. 39. The apparatus of claim 32 wherein WM,n1=W0, WM,12=W4, WM,21=W2, WM,31=W6, WM,22=W3, and WM,I=W0, WM,Q=W1 in case of five input channels. 40. The apparatus of claim 31 wherein WM,11=W0, WM,12=W4, WM,31W2, WM,22=W6, and WM,I=W0, WM,Q=W1 and WM,21=W8 in case of five input channels. 41. The apparatus of claim 32 wherein W0X11+jW4X12, W2X21 and W6X31 are replaced by α11W0X11+jα12W4X 12, α21W2X21 and α31W6X31, and a gain αn1 and a gain αn2 are the identical gain in order to remove the phase dependency by an interference occurring in a multipath of a self signal and an interference occurring by other users. 42. The apparatus of claim 31 wherein WM,n1=W0, WM,n2=W2, and WM,I=W0, WM,Q=W1. 43. The apparatus of claim 31 wherein the first multiplier block comprises at least a third multiplier for multiplying the first data group Xn1 by gain αn1, and the second multiplier block comprises at least a fourth multiplier the second data group Xn2 by gain αn2. 44. The apparatus of claim 31 wherein WM,11=W0, WM,12=W4/1, and WM,I=W0, WM,Q=W1/4, when M=8 in case of two input channels. 45. The apparatus of claim 32 wherein WM,11=W0, WM,12=W4/1, WM,21=W2, and WM,I=W0, WM,Q=W1/4, when M=8 in case of three input channels. 46. The method of claim 32 wherein WM,11=W0, WM,12=W2/1, and WM,I=W0, WM,Q=W1/2, when M=8 in case of two input channels. 47. The apparatus of claim 32 wherein WM,11=W0, WM,12=W2/1, WM,21=W4, and WM,I=W0, WM,Q=W1/2, when M=8 in case of three input channels. 48. The apparatus of claim 31 wherein each group has at least the two input channels, further comprising: a first adder for outputting by summing output signals from the first multiplier block; and a second adder for outputting by summing output signals from the second multiplier block. 49. The apparatus of claim 31 further comprising: a spreading unit for multiplying the signal received by the complex multiplier by a spreading code. 50. The apparatus of claim 49 wherein the spreading unit respectively multiplies the in-phase and quadrature-phase parts by different spreading codes. 51. The apparatus of claim 31 wherein WM,n1, WM,n2, WM,I, and WM,Q are orthogonal Hadamard sequences. 52. The apparatus of claim 31 wherein the complex multiplier includes: fifth and sixth multipliers for multiplying said output signal from the first multiplier block and said output signal from the second sequence multiplier by orthogonal sequence WM,I; seventh and eighth multipliers for multiplying said output signal from the first multiplier block and output signal αn2WM,n2Xn2 from the second multiplier block by orthogonal sequence WM,Q; a third adder for subtracting output signal from the eighth multiplier from output signal from the fifth multiplier to output an in-phase information; and a second adder for summing output signal from the sixth multiplier and output signal from the seventh multiplier to output quadrature-phase information. 53. A permuted orthogonal complex spreading apparatus for multiple channels, allocating at least two input channels into first and second groups, comprising: first and second multiplier blocks for respectively multiplying first and second data group Xn1, and Xn2 with a set of predetermined orthogonal sequences WM,n1, and WM,n2 to output WM,n1Xn1 and WM,n2Xn2; a complex multiplier for receiving the output signals WM,n1Xn1 and WM,n2Xn2 from the first and the second multiplier blocks in the complex form of and multiplying a received signal by a predetermined sequence (WM,I+jPWM,Q)��SC, wherein WM,I, WM,Q are predetermined orthogonal sequences, P is a predetermined sequence and SC is a spreading sequence. 54. The apparatus of claim 53 wherein each group has at least two input channels, further comprising: a first adder for outputting by summing output signals from the first sequence multiplier; and a second adder for outputting by summing output signals from the second sequence multiplier. 55. The apparatus of claim 53 wherein the first sequence multiplier comprises at least one first gain multiplier for multiplying the data Xn1, of each channel of the first group by gain αn1, and the second sequence multiplier comprises at least one second gain multiplier for multiplying the data Xn2 of each channel of the second group by gain αn2. 56. The apparatus of claim 53 wherein WM,n1=W0, WM,n2W2p, and WM,I=W0, WM,Q=W1, where p represents a predetermined integer in a range from 0 to (M/2)-1. 57. The apparatus of claim 53 wherein WM,n1, WM,n2, WM,I, and WM,Q are orthogonal Hadamard sequences. id="INS-S-00004" date="20080617" 58. The method of claim 20 wherein the step of summing of output signals WM,n1Xn1 and WM,n2Xn2 includes adjusting values of the output signals WM,n1Xn1 and WM,n2Xn2 based on gains.id="INS-S-00004" id="INS-S-00005" date="20080617" 59. The method of claim 58 wherein said step of complex-multiplying by (WM,I+jPWM,O) includes multiplying by (WM,1+jPWM,O) and by a spreading sequence, wherein WM,I=W0 and WM,O=W1.id="INS-S-00005" id="INS-S-00006" date="20080617" 60. The method of claim 59 wherein, P comprises a sequence, said sequence including pairs of consecutive sequence elements, respective sequence elements of any one of the pairs having a same value.id="INS-S-00006" id="INS-S-00007" date="20080617" 61. The apparatus of claim 53 wherein the first multiplier block is configured to adjust the values of WM,n1Xn1 based on first relative gains, and the second multiplier block is configured to adjust the values of WM,n2Xn2 based on second relative gains.id="INS-S-00007" id="INS-S-00008" date="20080617" 62. The apparatus of claim 53 wherein WM,n1 and WM,n2 comprise gain adjusted sequence elements.id="INS-S-00008" id="INS-S-00009" date="20080617" 63. The method of claim 20, wherein WM,1=W0 and WM,O=W1.id="INS-S-00009" id="INS-S-00010" date="20080617" 64. The method of claim 63, further comprising: adjusting the values of WM,n1Xn1 based on first relative gains, and adjusting the values of WM,n2Xn2 based on second relative gains.id="INS-S-00010" id="INS-S-00011" date="20080617" 65. The method of claim 63, wherein WM,n1 and WM,n2 comprise gain adjusted sequence elements.id="INS-S-00011" id="INS-S-00012" date="20080617" 66. The method of claim 63, wherein P is generated based on a spreading sequence.id="INS-S-00012" id="INS-S-00013" date="20080617" 67. The method of claim 63, wherein the spreading sequence is generated based on a PN code.id="INS-S-00013" id="INS-S-00014" date="20080617" 68. The apparatus of claim 53, wherein WM,1=W0 and WM,O=W1.id="INS-S-00014" id="INS-S-00015" date="20080617" 69. The method of claim 68, wherein P is generated based on a spreading sequence.id="INS-S-00015" id="INS-S-00016" date="20080617" 70. The method of claim 69, wherein the spreading sequence is generated based on a PN code.id="INS-S-00016" id="INS-S-00017" date="20080617" 71. A spreading method, comprising: generating based on at least one or more first input signals X11, . . . , XK1, one or more first orthogonal code sequences OS11, . . . , OSK1, and one or more first gains α11, . . . , αK1, K being a positive integer; generating based on at least one or more second input signals X12, . . . , XL2, one or more second orthogonal code sequences OS12, . . . , OSL2, and one or more second gains α12, . . . , αL2, L being a positive integer; and complex-multiplying by (W0+jP��W1)��SC, wherein P is a third sequence and SC is a first sequence comprising at least a first element having a first value and a second element having a second value.id="INS-S-00017" id="INS-S-00018" date="20080617" 72. The method of claim 71 wherein, P comprises a second sequence, said second sequence including pairs of consecutive sequence elements, respective sequence elements of any one of the pairs having a same value.id="INS-S-00018" id="INS-S-00019" date="20080617" 73. The method of claim 71, wherein the first sequence is generated based on at least a PN code.id="INS-S-00019" id="INS-S-00020" date="20080617" 74. The method of claim 73 wherein, P comprises a second sequence, said second sequence including pairs of consecutive sequence elements, respective sequence elements of any one of the pairs having a same value.id="INS-S-00020" id="INS-S-00021" date="20080617" 75. The method of claim 71, wherein at least one of the one or more first orthogonal code sequences consists of a plurality of ones.id="INS-S-00021" id="INS-S-00022" date="20080617" 76. The method of claim 75, wherein SC is a PN code and at least one of the one or more first gains has a value of 1.id="INS-S-00022" id="INS-S-00023" date="20080617" 77. A spreading apparatus comprising: first multiplier mechanism for generating based on at least one or more first input signals X11, . . . , XK1, one or more first orthogonal code sequences OS11, . . . , OSK1, and one or more first gains α11, . . . , αK1, K being a positive integer; second multiplier mechanism for generating based on one or more second input signals X12, . . . , XL2, one or more second orthogonal code sequences OS12, . . . , OSL2, and one or more second gains α12, . . . , αL2, L being a positive integer; a complex multiplier for multiplying by (W0+jP��W1)��SC, wherein P is a third sequence and SC is a first sequence comprising at least a first element having a first value and a second element having a second value.id="INS-S-00023" id="INS-S-00024" date="20080617" 78. The apparatus of claim 77 wherein, P comprises a second sequence, said second sequence including pairs of consecutive sequence elements, respective sequence elements of any one of the pairs having a same value.id="INS-S-00024" id="INS-S-00025" date="20080617" 79. The apparatus of claim 77, wherein the first sequence is generated based on at least a PN code.id="INS-S-00025" id="INS-S-00026" date="20080617" 80. The apparatus of claim 79 wherein, P comprises a second sequence, said sequence including pairs of consecutive sequence elements, respective sequence elements of any one of the pairs having a same value.id="INS-S-00026" id="INS-S-00027" date="20080617" 81. The apparatus of claim 77, wherein at least one of the one or more first orthogonal code sequences consists of a plurality of ones.id="INS-S-00027" id="INS-S-00028" date="20080617" 82. The apparatus of claim 81, wherein SC is a PN code.id="INS-S-00028" id="INS-S-00029" date="20080617" 83. The apparatus of claim 81, wherein at least one of the one or more first gains has a value of 1.id="INS-S-00029" id="INS-S-00030" date="20080617" 84. A spreading apparatus, comprising: a first multiplier mechanism configured to generate based on at least one or more first input signals X11, . . . , XK1, one or more first orthogonal code sequences OS11, . . . , OSK1, and one or more first gains α11, . . . , αK1, K being a positive integer; a second multiplier mechanism configured to generate based on at least one or more second input signals X12, . . . , XL2, one or more second orthogonal code sequences OS12, . . . , OSL2, and one or more second gains α12, . . . , αL2, L being a positive integer; and a complex multiplier configured to multiply by (W0+jP��W1)��SC, wherein P is a third sequence and SC is a spreading sequence.id="INS-S-00030" id="INS-S-00031" date="20080617" 85. The apparatus of claim 84 wherein, P comprises a sequence, said sequence including pairs of consecutive sequence elements, respective sequence elements of any one of the pairs having a same value.id="INS-S-00031" id="INS-S-00032" date="20080617" 86. The apparatus of claim 84, wherein SC is generated based on at least a PN code.id="INS-S-00032" id="INS-S-00033" date="20080617" 87. The apparatus of claim 86 wherein, P comprises a sequence, said sequence including pairs of consecutive sequence elements, respective sequence elements of any one of the pairs having a same value.id="INS-S-00033" id="INS-S-00034" date="20080617" 88. The apparatus of claim 84, wherein at least one of the one or more first orthogonal code sequences consists of a plurality of ones.id="INS-S-00034" id="INS-S-00035" date="20080617" 89. The apparatus of claim 88, wherein at least one of the one or more first gains has a value of 1.id="INS-S-00035" id="INS-S-00036" date="20080617" 90. A spreading method, comprising: generating a first signal, a, based on at least a first input, a first code, and a first gain; generating a second signal, b, based on at least a second input, a second code, and a second gain; generating a third signal, d, based on at least a first sequence of sequence elements, the sequence elements in the first sequence systematically alternating between a first value and a second value, the first value being different from the second value; systematically generating SC��a-SC��b��d; and systematically generating SC��b+SC��a��d, wherein SC is a first PN code.id="INS-S-00036" id="INS-S-00037" date="20080617" 91. The method of claim 90, wherein the first sequence of sequence elements is W1.id="INS-S-00037" id="INS-S-00038" date="20080617" 92. The method of claim 90, wherein d is generated based on at least the first sequence and a second sequence.id="INS-S-00038" id="INS-S-00039" date="20080617" 93. The method of claim 92, wherein the second sequence is generated based on a second PN code.id="INS-S-00039" id="INS-S-00040" date="20080617" 94. The method of claim 92 wherein the second sequence is generated based on a spreading sequence.id="INS-S-00040" id="INS-S-00041" date="20080617" 95. The method of claim 92 wherein the second sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00041" id="INS-S-00042" date="20080617" 96. The method of claim 92 wherein d is generated by multiplying the first sequence and the second sequence.id="INS-S-00042" id="INS-S-00043" date="20080617" 97. The method of claim 90, wherein the first value is 1 and the second value is-1.id="INS-S-00043" id="INS-S-00044" date="20080617" 98. The method of claim 92, wherein the second sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00044" id="INS-S-00045" date="20080617" 99. The method of claim 98, wherein the second sequence is generated based on a second PN code.id="INS-S-00045" id="INS-S-00046" date="20080617" 100. The method of claim 90, wherein the first orthogonal code and the second orthogonal code include Walsh codes.id="INS-S-00046" id="INS-S-00047" date="20080617" 101. The method of claim 90 wherein the first code and the second code are even-numbered Walsh codes.id="INS-S-00047" id="INS-S-00048" date="20080617" 102. A spreading method, comprising: generating a first signal, a, based on at least a first input, a first Walsh code, and a first gain; generating a second signal, b, based on at least a second input, a second Walsh code, and a second gain; receiving a first sequence, SC, comprising a first element having a first value and a second element having a second value, the first value being different from the second value; generating a third signal, d, based on at least a third Walsh code, the third Walsh code being a second sequence of sequence elements and the sequence elements in the second sequence systematically alternating between the first value and the second value; systematically generating SC��a-SC��b��d; and systematically generating SC��b+SC��a��d.id="INS-S-00048" id="INS-S-00049" date="20080617" 103. The method of claim 102, wherein the third Walsh code is W1.id="INS-S-00049" id="INS-S-00050" date="20080617" 104. The method of claim 102, wherein d is generated based on at least the third Walsh code and a third sequence.id="INS-S-00050" id="INS-S-00051" date="20080617" 105. The method of claim 104, wherein the third sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00051" id="INS-S-00052" date="20080617" 106. The method of claim 105, wherein SC is a first PN code.id="INS-S-00052" id="INS-S-00053" date="20080617" 107. The method of claim 106, wherein the third sequence is generated based on a second PN code.id="INS-S-00053" id="INS-S-00054" date="20080617" 108. The method of claim 104 wherein the third sequence is generated based on a spreading sequence.id="INS-S-00054" id="INS-S-00055" date="20080617" 109. The method of claim 104 wherein the third sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00055" id="INS-S-00056" date="20080617" 110. The method of claim 104 wherein d is generated by multiplying the third sequence and the third Walsh code.id="INS-S-00056" id="INS-S-00057" date="20080617" 111. The method of claim 104, wherein SC is a first PN code.id="INS-S-00057" id="INS-S-00058" date="20080617" 112. The method of claim 111, wherein the third sequence is generated based on a second PN code.id="INS-S-00058" id="INS-S-00059" date="20080617" 113. The method of claim 102, wherein the first value is 1 and the second value is-1.id="INS-S-00059" id="INS-S-00060" date="20080617" 114. The method of claim 102, wherein SC is generated based on at least a PN code.id="INS-S-00060" id="INS-S-00061" date="20080617" 115. The method of claim 102 wherein the first sequence is a spreading sequence.id="INS-S-00061" id="INS-S-00062" date="20080617" 116. The method of claim 102 wherein the first and the second Walsh codes are even-numbered Walsh codes.id="INS-S-00062" id="INS-S-00063" date="20080617" 117. The method of claim 102, wherein SC is a first PN code.id="INS-S-00063" id="INS-S-00064" date="20080617" 118. An apparatus for wireless communications, comprising: a first multiplier mechanism configured to generate a first signal, a, the first multiplier mechanism having at least a first set of multipliers and a first adder; a second multiplier mechanism configured to generate a second signal, b, the second multiplier mechanism having at least a second set of multipliers and a second adder; an input generator configured to generate an input, d, based on at least a first sequence of sequence elements, the sequence elements in the first sequence systematically alternating between a first value and a second value, the first value being different from the second value; a third multiplier mechanism configured to receive at least the first signal, a, the second signal, b, a second sequence, SC, and the input, d, and to systematically generate SC��a-SC��b��d and SC��b+SC��a��d, the third multiplier mechanism having at least a third set of multipliers and a set of adders, wherein the second sequence comprises at least a first element having the first value and a second element having the second value.id="INS-S-00064" id="INS-S-00065" date="20080617" 119. The apparatus of claim 118, wherein the first sequence of sequence elements is W1.id="INS-S-00065" id="INS-S-00066" date="20080617" 120. The apparatus of claim 118, wherein d is generated based on at least the first sequence and a third sequence.id="INS-S-00066" id="INS-S-00067" date="20080617" 121. The apparatus of claim 120, wherein the third sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00067" id="INS-S-00068" date="20080617" 122. The apparatus of claim 121, wherein SC is a first PN code.id="INS-S-00068" id="INS-S-00069" date="20080617" 123. The apparatus of claim 122, wherein the third sequence is generated based on a second PN code.id="INS-S-00069" id="INS-S-00070" date="20080617" 124. The apparatus of claim 120 wherein the third sequence is generated based on a spreading sequence.id="INS-S-00070" id="INS-S-00071" date="20080617" 125. The apparatus of claim 118 wherein the third sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00071" id="INS-S-00072" date="20080617" 126. The method of claim 120 wherein d is generated by multiplying the third sequence and the first sequence.id="INS-S-00072" id="INS-S-00073" date="20080617" 127. The apparatus of claim 120, wherein SC is a first PN code.id="INS-S-00073" id="INS-S-00074" date="20080617" 128. The apparatus of claim 127, wherein the third sequence is generated based on a second PN code.id="INS-S-00074" id="INS-S-00075" date="20080617" 129. The apparatus of claim 118, wherein the first value is 1 and the second value is-1.id="INS-S-00075" id="INS-S-00076" date="20080617" 130. The apparatus of claim 118 wherein the second sequence is a spreading sequence.id="INS-S-00076" id="INS-S-00077" date="20080617" 131. The apparatus of claim 118 wherein the first signal and the second signal are generated based on at least even numbered Walsh codes.id="INS-S-00077" id="INS-S-00078" date="20080617" 132. The apparatus of claim 118 wherein the second sequence is generated based on at least a PN code.id="INS-S-00078" id="INS-S-00079" date="20080617" 133. The apparatus of claim 118, wherein SC is a first PN code.id="INS-S-00079" id="INS-S-00080" date="20080617" 134. A system for wireless communications, comprising: a sequence mechanism configured to provide a first sequence, SC, the first sequence comprising at least a first element having a first value and a second element having a second value; a first input generator configured to generate at least a first input, a, and a second input, b; a second input generator configured to generate at least a third input, d, based on at least a second sequence of sequence elements, the sequence elements in the second sequence systematically alternating between the first value and the second value; a multiplier mechanism configured to receive at least a, b, SC, and d and to systematically generate SC��a-SC��b��d and SC��b+SC��a��d.id="INS-S-00080" id="INS-S-00081" date="20080617" 135. The system of claim 134, wherein the second sequence of sequence elements is W1.id="INS-S-00081" id="INS-S-00082" date="20080617" 136. The system of claim 134, wherein d is generated based on at least the second sequence and a third sequence.id="INS-S-00082" id="INS-S-00083" date="20080617" 137. The system of claim 136, wherein the third sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00083" id="INS-S-00084" date="20080617" 138. The system of claim 137 wherein the first signal and the second signal are generated based on at least even numbered Walsh codes.id="INS-S-00084" id="INS-S-00085" date="20080617" 139. The system of claim 137, wherein SC is a first PN code.id="INS-S-00085" id="INS-S-00086" date="20080617" 140. The system of claim 139, wherein the third sequence is generated based on a second PN code.id="INS-S-00086" id="INS-S-00087" date="20080617" 141. The system of claim 136 wherein the third sequence is generated based on a spreading sequence.id="INS-S-00087" id="INS-S-00088" date="20080617" 142. The system of claim 136 wherein the third sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00088" id="INS-S-00089" date="20080617" 143. The system of claim 136 wherein d is generated by multiplying the third sequence and the second sequence.id="INS-S-00089" id="INS-S-00090" date="20080617" 144. The system of claim 136, wherein SC is a first PN code.id="INS-S-00090" id="INS-S-00091" date="20080617" 145. The system of claim 144, wherein the third sequence is generated based on a second PN code.id="INS-S-00091" id="INS-S-00092" date="20080617" 146. The system of claim 134, wherein the first value is 1 and the second value is-1.id="INS-S-00092" id="INS-S-00093" date="20080617" 147. The system of claim 134 wherein the first sequence is a spreading sequence.id="INS-S-00093" id="INS-S-00094" date="20080617" 148. The system of claim 134 wherein the first sequence is generated based on at least a PN code.id="INS-S-00094" id="INS-S-00095" date="20080617" 149. The system of claim 134, wherein SC is a first PN code.id="INS-S-00095" id="INS-S-00096" date="20080617" 150. An apparatus for wireless communications, comprising: means for generating a first signal, a, based on at least a first input signal, a first code, and a first relative gain; means for generating a second signal, b, based on at least a second input signal, a second code, and a second relative gain; a sequence mechanism configured to provide a first sequence, SC, the first sequence comprising at least a first element having a first value and a second element having a second value; an input generator configured to generate an input, d, based on at least a second sequence of sequence elements, the sequence elements in the second sequence systematically alternating between the first value and the second value; and means for receiving at least the first signal, a, the second signal, b, the first sequence, SC, and the input, d, and for systematically generating SC��a-SC��b��d and SC��b+SC��a��d.id="INS-S-00096" id="INS-S-00097" date="20080617" 151. The apparatus of claim 150, wherein the second sequence is W1.id="INS-S-00097" id="INS-S-00098" date="20080617" 152. The apparatus of claim 150, wherein d is generated based on at least the second sequence and a third sequence.id="INS-S-00098" id="INS-S-00099" date="20080617" 153. The apparatus of claim 152, wherein the third sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00099" id="INS-S-00100" date="20080617" 154. The apparatus of claim 153, whrein SC is a first PN code.id="INS-S-00100" id="INS-S-00101" date="20080617" 155. The apparatus of claim 154, wherein the third sequence is generated based on a second PN code.id="INS-S-00101" id="INS-S-00102" date="20080617" 156. The apparatus of claim 152 wherein the third sequence is generated based on a spreading sequence.id="INS-S-00102" id="INS-S-00103" date="20080617" 157. The apparatus of claim 152 wherein the third sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00103" id="INS-S-00104" date="20080617" 158. The apparatus of claim 153 wherein the first signal and the second signal are generated based on at least even numbered Walsh codes.id="INS-S-00104" id="INS-S-00105" date="20080617" 159. The apparatus of claim 152, whrein SC is a first PN code.id="INS-S-00105" id="INS-S-00106" date="20080617" 160. The apparatus of claim 159, wherein the third sequence is generated based on a second PN code.id="INS-S-00106" id="INS-S-00107" date="20080617" 161. The apparatus of claim 150, wherein the first value is 1 and the second value is-1.id="INS-S-00107" id="INS-S-00108" date="20080617" 162. The apparatus of claim 150, wherein the first orthogonal code and the second orthogonal code are even numbered Walsh codes.id="INS-S-00108" id="INS-S-00109" date="20080617" 163. The apparatus of claim 150, wherein SC is generated based on at least a PN code.id="INS-S-00109" id="INS-S-00110" date="20080617" 164. The apparatus of claim 150 wherein the first sequence is a spreading sequence.id="INS-S-00110" id="INS-S-00111" date="20080617" 165. The apparatus of claim 150, wherein SC is a first PN code.id="INS-S-00111" id="INS-S-00112" date="20080617" 166. A spreading method comprising: receiving a complex input signal comprising in-phase data and quadrature-phase data; receiving a first sequence of sequence elements, the sequence elements in the first sequence systematically alternating between a first value and a second value; receiving a complex code comprising an in-phase component and a quadrature-phase component, the quadrature-phase component systematically comprising the in-phase component multiplied by at least the first sequence of sequence elements; and complex multiplying the complex input signal by the complex code.id="INS-S-00112" id="INS-S-00113" date="20080617" 167. The method of claim 166, wherein the in-phase component only comprises a spreading sequence.id="INS-S-00113" id="INS-S-00114" date="20080617" 168. The method of claim 167, wherein the spreading sequence is generated based on at least a PN code.id="INS-S-00114" id="INS-S-00115" date="20080617" 169. The method of claim 167, wherein the spreading sequence is a first PN code.id="INS-S-00115" id="INS-S-00116" date="20080617" 170. The method of claim 166, wherein the quadrature-phase component comprises the in-phase component multiplied by at least the first sequence of sequence elements and a second sequence.id="INS-S-00116" id="INS-S-00117" date="20080617" 171. The method of claim 170, wherein the second sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00117" id="INS-S-00118" date="20080617" 172. The method of claim 171, wherein the second sequence is generated based on a second PN code.id="INS-S-00118" id="INS-S-00119" date="20080617" 173. The method of claim 170 wherein the second sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00119" id="INS-S-00120" date="20080617" 174. The method of claim 170, wherein the second sequence is generated based on a second PN code.id="INS-S-00120" id="INS-S-00121" date="20080617" 175. The method of claim 166, wherein the first value is 1 and the second value is-1.id="INS-S-00121" id="INS-S-00122" date="20080617" 176. The method of claim 166 wherein the first sequence of sequence elements is W1.id="INS-S-00122" id="INS-S-00123" date="20080617" 177. A spreading unit comprising: a first input unit configured to receive a complex input signal comprising in-phase data and quadrature-phase data; a second input unit configured to receive a first sequence of sequence elements, the sequence elements in the first sequence systematically alternating between a first value and a second value; a third input unit configured to receive a complex code comprising an in-phase component and a quadrature-phase component, the quadrature-phase component systematically comprising the in-phase component multiplied by at least the first sequence of sequence elements; and a complex multiplier configured to complex multiply the complex input signal by a complex code.id="INS-S-00123" id="INS-S-00124" date="20080617" 178. The unit of claim 177, wherein the in-phase component only comprises a spreading sequence.id="INS-S-00124" id="INS-S-00125" date="20080617" 179. The unit of claim 178, wherein the spreading sequence is generated based on at least a PN code.id="INS-S-00125" id="INS-S-00126" date="20080617" 180. The unit of claim 179 wherein the first sequence of sequence elements is W1.id="INS-S-00126" id="INS-S-00127" date="20080617" 181. The unit of claim 178, wherein the spreading sequence is a PN code.id="INS-S-00127" id="INS-S-00128" date="20080617" 182. The unit of claim 177, wherein the quadrature-phase component comprises the in-phase component multiplied by at least the first sequence of sequence elements and a second sequence, wherein the second sequence is generated based on a PN code.id="INS-S-00128" id="INS-S-00129" date="20080617" 183. The unit of claim 182, wherein the second sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00129" id="INS-S-00130" date="20080617" 184. The unit of claim 182 wherein the second sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00130" id="INS-S-00131" date="20080617" 185. The unit of claim 177, wherein the first value is 1 and the second value is-1.id="INS-S-00131" id="INS-S-00132" date="20080617" 186. The unit of claim 177 wherein the first sequence of sequence elements is W1.id="INS-S-00132" id="INS-S-00133" date="20080617" 187. A spreading unit comprising: a first input unit configured to receive a complex input signal comprising in-phase data and quadrature-phase data, a second input unit configured to receive a first sequence of sequence elements, the sequence elements in the first sequence systematically alternating between a first value and a second value; a third input unit configured to receive a complex code comprising an in-phase component and a quadrature-phase component, the quadrature-phase component systematically comprising the in-phase component multiplied by at least the first sequence of sequence elements; and means for complex multiplying the complex input signal by the complex code.id="INS-S-00133" id="INS-S-00134" date="20080617" 188. The unit of claim 187, wherein the in-phase component only comprises a spreading sequence.id="INS-S-00134" id="INS-S-00135" date="20080617" 189. The unit of claim 188, wherein the spreading sequence is a first PN code.id="INS-S-00135" id="INS-S-00136" date="20080617" 190. The unit of claim 188, wherein the spreading sequence is generated based on at least a PN code.id="INS-S-00136" id="INS-S-00137" date="20080617" 191. The unit of claim 187, wherein the quadrature-phase component comprises the in-phase component multiplied by at least the first sequence of sequence elements and a second sequence.id="INS-S-00137" id="INS-S-00138" date="20080617" 192. The unit of claim 191 wherein the second sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00138" id="INS-S-00139" date="20080617" 193. The unit of claim 191, wherein the second sequence is generated based on a second PN code.id="INS-S-00139" id="INS-S-00140" date="20080617" 194. The unit of claim 187, wherein the first value is 1 and the second value is-1.id="INS-S-00140" id="INS-S-00141" date="20080617" 195. The unit of claim 194, wherein the second sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00141" id="INS-S-00142" date="20080617" 196. The unit of claim 195, wherein the second sequence is generated based on a second PN code.id="INS-S-00142" id="INS-S-00143" date="20080617" 197. A spreading method comprising: generating a complex signal comprising an in-phase data signal and a quadrature-phase data signal; receiving a first sequence of sequence elements, each (2N-1)th sequence element in the first sequence having a first value and each (2N)th sequence element in the first sequence having a second value, N being a positive integer; receiving a complex code comprising an in-phase component and a quadrature-phase component, the quadrature-phase component systematically comprises the in-phase component multiplied by the first sequence of sequence elements; and complex multiplying the complex signal by the complex code.id="INS-S-00143" id="INS-S-00144" date="20080617" 198. The method of claim 197, wherein the in-phase component comprises only a spreading sequence.id="INS-S-00144" id="INS-S-00145" date="20080617" 199. The method of claim 198, wherein the spreading sequence is generated based on at least a PN code.id="INS-S-00145" id="INS-S-00146" date="20080617" 200. The method of claim 198, wherein the spreading sequence is a first PN code.id="INS-S-00146" id="INS-S-00147" date="20080617" 201. The method of claim 197, wherein the first value is 1 and the second value is-1.id="INS-S-00147" id="INS-S-00148" date="20080617" 202. The method of claim 197, wherein the quadrature-phase component comprises the in-phase component multiplied by at least the first sequence of sequence elements and a second sequence.id="INS-S-00148" id="INS-S-00149" date="20080617" 203. The method of claim 202, wherein the second sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00149" id="INS-S-00150" date="20080617" 204. The method of claim 203, wherein the second sequence is generated based on a second PN code.id="INS-S-00150" id="INS-S-00151" date="20080617" 205. The method of claim 202 wherein the second sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00151" id="INS-S-00152" date="20080617" 206. The method of claim 202, wherein the second sequence is generated based on a second PN code.id="INS-S-00152" id="INS-S-00153" date="20080617" 207. The method of claim 197 wherein the first sequence of sequence elements is W1.id="INS-S-00153" id="INS-S-00154" date="20080617" 208. A spreading unit comprising: an output unit configured to generate a complex signal comprising an in-phase data signal and a quadrature-phase data signal, the output unit including a first adder configured to add one or more first signals to generate the in-phase data signal and a second adder configured to add one or more second signals to generate the quadrature-phase data signal; a first input unit configured to receive a first sequence of sequence elements, each (2N-1)th sequence element in the first sequence systematically having a first value and each (2N)th sequence element in the first sequence systematically having a second value, wherein N is a positive integer; a second input unit configured to receive a complex code comprising an in-phase component and a quadrature-phase component, quadrature-phase component systematically comprising the in-phase component multiplied by at least the first sequence of sequence elements; and a complex multiplier configured to multiply the complex signal by the complex code.id="INS-S-00154" id="INS-S-00155" date="20080617" 209. The unit of claim 208, wherein the in-phase component comprises only a spreading sequence.id="INS-S-00155" id="INS-S-00156" date="20080617" 210. The unit of claim 209, wherein the spreading sequence is generated based on at least a PN code.id="INS-S-00156" id="INS-S-00157" date="20080617" 211. The unit of claim 209, wherein the spreading sequence is a first PN code.id="INS-S-00157" id="INS-S-00158" date="20080617" 212. The unit of claim 208, wherein the first value is 1 and the second value is-1.id="INS-S-00158" id="INS-S-00159" date="20080617" 213. The unit of claim 208, wherein the quadrature-phase component comprises the in-phase component multiplied by at least the first sequence of sequence elements and a second sequence.id="INS-S-00159" id="INS-S-00160" date="20080617" 214. The unit of claim 213, wherein the second sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00160" id="INS-S-00161" date="20080617" 215. The unit of claim 214, wherein the second sequence is generated based on a second PN code.id="INS-S-00161" id="INS-S-00162" date="20080617" 216. The unit of claim 213 wherein the second sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00162" id="INS-S-00163" date="20080617" 217. The unit of claim 213, wherein the second sequence is generated based on a second PN code.id="INS-S-00163" id="INS-S-00164" date="20080617" 218. The unit of claim 208 wherein the first sequence of sequence elements is W1.id="INS-S-00164" id="INS-S-00165" date="20080617" 219. A spreading unit comprising: means for generating a complex data signal comprising an in-phase data signal and a quadrature-phase data signal; an input unit configured to receive a first sequence of sequence elements, each (2N-1)th sequence element in the first sequence systematically having a first value and each (2N)th sequence element in the first sequence systematically having a second value, wherein N is a positive integer; means for receiving a complex code comprising an in-phase component and a quadrature-phase component, the quadrature-phase component systematically comprising the in-phase component multiplied by at least the first sequence of sequence elements; and means for complex multiplying the complex data signal by the complex code.id="INS-S-00165" id="INS-S-00166" date="20080617" 220. The unit of claim 219, wherein the in-phase component comprises only a spreading sequence.id="INS-S-00166" id="INS-S-00167" date="20080617" 221. The unit of claim 220, wherein the spreading sequence is generated based on at least a PN code.id="INS-S-00167" id="INS-S-00168" date="20080617" 222. The unit of claim 220, wherein the spreading sequence is a first PN code.id="INS-S-00168" id="INS-S-00169" date="20080617" 223. The unit of claim 219, wherein the first value is 1 and the second value is-1.id="INS-S-00169" id="INS-S-00170" date="20080617" 224. The unit of claim 219, wherein the quadrature-phase component comprises the in-phase component multiplied by at least the first sequence of sequence elements and a second sequence.id="INS-S-00170" id="INS-S-00171" date="20080617" 225. The unit of claim 224, wherein the second sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00171" id="INS-S-00172" date="20080617" 226. The method of claim 265, wherein each (2N-1)th sequence element in the second sequence has a first value and each (2N)th sequence element in the second sequence has a second value, wherein N is a positive integer.id="INS-S-00172" id="INS-S-00173" date="20080617" 227. The unit of claim 224 wherein the second sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00173" id="INS-S-00174" date="20080617" 228. The unit of claim 224, wherein the second sequence is generated based on a second PN code.id="INS-S-00174" id="INS-S-00175" date="20080617" 229. The unit of claim 219 wherein the first sequence of sequence elements is W1.id="INS-S-00175" id="INS-S-00176" date="20080617" 230. A spreading method, comprising: receiving a complex input signal comprising in-phase data and quadrature-phase data; receiving a first sequence of sequence elements, each (2N-1)th sequence element in the first sequence systematically having a first value and each (2N)th sequence element in the first sequence systematically having a second value, N being a positive integer; receiving a complex sequence comprising an in-phase component and a quadrature-phase component, the quadrature-phase component systematically comprising the in-phase component multiplied by the first sequence of sequence elements; and complex multiplying the complex input signal by the complex sequence.id="INS-S-00176" id="INS-S-00177" date="20080617" 231. The method of claim 230, wherein the first sequence of sequence elements is W1.id="INS-S-00177" id="INS-S-00178" date="20080617" 232. The method of claim 230, wherein the quadrature-phase component comprises the in-phase component multiplied by at least the first sequence of sequence elements and a second sequence.id="INS-S-00178" id="INS-S-00179" date="20080617" 233. The method of claim 232, wherein, the second sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00179" id="INS-S-00180" date="20080617" 234. The method of claim 233, wherein the second sequence is generated based on a PN code.id="INS-S-00180" id="INS-S-00181" date="20080617" 235. The method of claim 232, wherein the second sequence is generated based on a PN code.id="INS-S-00181" id="INS-S-00182" date="20080617" 236. The method of claim 232 wherein the second sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00182" id="INS-S-00183" date="20080617" 237. The method of claim 236, wherein the second sequence is generated based on a PN code.id="INS-S-00183" id="INS-S-00184" date="20080617" 238. The method of claim 230 wherein the first value is 1 and the second value is-1.id="INS-S-00184" id="INS-S-00185" date="20080617" 239. The method of claim 230, wherein the in-phase component comprises a spreading sequence.id="INS-S-00185" id="INS-S-00186" date="20080617" 240. The method of claim 239, wherein the spreading sequence is generated based on at least a PN code.id="INS-S-00186" id="INS-S-00187" date="20080617" 241. The method of claim 239, wherein the spreading sequence is a PN code.id="INS-S-00187" id="INS-S-00188" date="20080617" 242. A spreading apparatus comprising: a first input unit configured to receive a complex input signal comprising in-phase data and quadrature-phase data; a second input unit configured to receive a first sequence of sequence elements, each (2N-1)th sequence element in the first sequence symmetrically having a first value and each (2N)th sequence element in the first sequence systematically having a second value, wherein N is a positive integer and the first value is different from the second value; a third input unit configured to receive a complex sequence comprising an in-phase component and a quadrature-phase component, the quadrature-phase component systematically comprising the in-phase component multiplied by at least the first sequence of sequence elements; and a complex multiplier for complex multiplying the complex input signal by the complex sequence.id="INS-S-00188" id="INS-S-00189" date="20080617" 243. The apparatus of claim 242, wherein the first sequence of sequence elements is W1.id="INS-S-00189" id="INS-S-00190" date="20080617" 244. The apparatus of claim 242, wherein the quadrature-phase component comprises the in-phase component multiplied by at least the first sequence of sequence elements and a second sequence.id="INS-S-00190" id="INS-S-00191" date="20080617" 245. The apparatus of claim 244, wherein the second sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00191" id="INS-S-00192" date="20080617" 246. The apparatus of claim 245, wherein the second sequence is generated based on a PN code.id="INS-S-00192" id="INS-S-00193" date="20080617" 247. The apparatus of claim 244, wherein, the second sequence consists of elements, one or more of the elements having the first value and the remaining elements having the second value, wherein for each (2N-1)th element, the value of the (2N-1)th element is the same as the value of a (2N)th element, where N is a positive integer.id="INS-S-00193" id="INS-S-00194" date="20080617" 248. The apparatus of claim 247, wherein the second sequence is generated based on a PN code.id="INS-S-00194" id="INS-S-00195" date="20080617" 249. The apparatus of claim 242 wherein the first value is 1 and the second value is-1.id="INS-S-00195" id="INS-S-00196" date="20080617" 250. The apparatus of claim 242, wherein the in-phase component comprises a spreading sequence.id="INS-S-00196" id="INS-S-00197" date="20080617" 251. The apparatus of claim 250, wherein the spreading sequence is generated based on at least a PN code.id="INS-S-00197" id="INS-S-00198" date="20080617" 252. The apparatus of claim 250, wherein the spreading sequence is a PN code.id="INS-S-00198" id="INS-S-00199" date="20080617" 253. The apparatus of claim 264, wherein the first sequence of sequence elements is W1.id="INS-S-00199" id="INS-S-00200" date="20080617" 254. The apparatus of claim 264, wherein the quadrature-phase component comprises the in-phase component multiplied by at least the first sequence of sequence elements and a second sequence.id="INS-S-00200" id="INS-S-00201" date="20080617" 255. The apparatus of claim 254, wherein the second sequence is generated based on a PN code.id="INS-S-00201" id="INS-S-00202" date="20080617" 256. The apparatus of claim 254, wherein the second sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00202" id="INS-S-00203" date="20080617" 257. The apparatus of claim 256, wherein the second sequence is generated based on a PN code.id="INS-S-00203" id="INS-S-00204" date="20080617" 258. The apparatus of claim 254, wherein, the second sequence comprises a sequence consisting of sequence elements, one or more of the sequence elements having the first value and the remaining sequence elements having the second value, wherein for each (2N-1)th sequence element, the value of the (2N-1)th sequence element is the same value of a (2N)th sequence element, where N is a positive integer.id="INS-S-00204" id="INS-S-00205" date="20080617" 259. The apparatus of claim 258, wherein the second sequence is generated based on a PN code.id="INS-S-00205" id="INS-S-00206" date="20080617" 260. The apparatus of claim 264 wherein the first value is 1 and the second value is-1.id="INS-S-00206" id="INS-S-00207" date="20080617" 261. The apparatus of claim 264, wherein the in-phase component comprises a spreading sequence.id="INS-S-00207" id="INS-S-00208" date="20080617" 262. The apparatus of claim 261, wherein the spreading sequence is generated based on at least a PN code.id="INS-S-00208" id="INS-S-00209" date="20080617" 263. The apparatus of claim 261, wherein the spreading sequence is a PN code.id="INS-S-00209" id="INS-S-00210" date="20080617" 264. A spreading apparatus comprising: a first input unit configured to receive a complex input signal comprising in-phase data and quadrature-phase data; a second input unit configured to receive a first sequence of sequence elements, with each (2N-1)th sequence element in the first sequence systematically having a first value and each (2N)th sequence element in the first sequence systematically having a second value, wherein N is a positive integer and the first value is different from the second value; means for receiving a complex sequence comprising an in-phase component and a quadrature-phase component, the quadrature-phase component systematically comprising the in-phase component multiplied by at least the first sequence of sequence elements; and means for complex multiplying the complex input signal by the complex sequence.id="INS-S-00210" id="INS-S-00211" date="20080617" 265. A spreading method, comprising: generating a first output, a, based on at least one or more first inputs, one or more first orthogonal codes, and one or more first gains; generating a second output, b, based on at least one or more second inputs, one or more second orthogonal codes, and one or more second gains; receiving a first sequence, SC, comprising at least a first element having a first value and a second element having a second value, the first value being different from the second value; receiving a second sequence of sequence elements, W; receiving a third sequence, P; and complex-multiplying a+jb by (1+jP��W)��SC.id="INS-S-00211" id="INS-S-00212" date="20080617" 266. The apparatus of claim 273, wherein SC is generated based on at least a PN code.id="INS-S-00212" id="INS-S-00213" date="20080617" 267. The method of claim 226, wherein the third sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00213" id="INS-S-00214" date="20080617" 268. The method of claim 267, wherein the third sequence is generated based on a PN code.id="INS-S-00214" id="INS-S-00215" date="20080617" 269. The method of claim 226, wherein SC is a spreading sequence.id="INS-S-00215" id="INS-S-00216" date="20080617" 270. The method of claim 226, wherein SC is generated based on at least a PN code.id="INS-S-00216" id="INS-S-00217" date="20080617" 271. The method of claim 226, wherein SC is a PN code.id="INS-S-00217" id="INS-S-00218" date="20080617" 272. A spreading apparatus comprising: a first input unit configured to receive a complex input signal comprising in-phase data, a, and quadrature-phase data, b; a second input unit configured to receive a first sequence, SC, comprising at least a first element having a first value and a second element having a second value; a third input unit configured to receive a second sequence of sequence elements, W; a fourth input unit configured to receive a third sequence, P; and a complex multiplier for multiplying a+jb by (1+jP��W)��SC.id="INS-S-00218" id="INS-S-00219" date="20080617" 273. The apparatus of claim 272, wherein each (2N-1)th sequence element in the second sequence has a first value and each (2N)th sequence element in the second sequence has a second value, wherein N is a positive integer.id="INS-S-00219" id="INS-S-00220" date="20080617" 274. The apparatus of claim 273, wherein, the third sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00220" id="INS-S-00221" date="20080617" 275. The method of claim 274, wherein P is generated based on a PN code.id="INS-S-00221" id="INS-S-00222" date="20080617" 276. The apparatus of claim 273, wherein SC is a PN code.id="INS-S-00222" id="INS-S-00223" date="20080617" 277. The method of claim 276, wherein P is generated based on a PN code.id="INS-S-00223" id="INS-S-00224" date="20080617" 278. The apparatus of claim 244, wherein the second sequence is generated based on a PN code.id="INS-S-00224" id="INS-S-00225" date="20080617" 279. A spreading apparatus comprising: a first input unit configured to receive a complex input signal comprising in-phase data, a, and quadrature-phase data, b; a second input unit configured to receive a first sequence, SC, comprising at least a first element having a first value and a second element having a second value; means for receiving a second sequence of sequence elements, W; means for receiving a third sequence, P; and means for multiplying a+jb by (1+jP��W)��SC.id="INS-S-00225" id="INS-S-00226" date="20080617" 280. The apparatus of claim 279, wherein each (2N-1)th sequence element in the second sequence has a first value and each (2N)th sequence element in the second sequence has a second value, wherein N is a positive integer.id="INS-S-00226" id="INS-S-00227" date="20080617" 281. The apparatus of claim 280, wherein, the third sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having the first value or two elements both having the second value.id="INS-S-00227" id="INS-S-00228" date="20080617" 282. The apparatus of claim 281, wherein the third sequence is generated based on a PN code.id="INS-S-00228" id="INS-S-00229" date="20080617" 283. The apparatus of claim 280, wherein SC is a PN code.id="INS-S-00229" id="INS-S-00230" date="20080617" 284. The apparatus of claim 283, wherein the third sequence is generated based on a PN code.id="INS-S-00230" id="INS-S-00231" date="20080617" 285. The apparatus of claim 280, wherein SC is generated based on at least a PN code.id="INS-S-00231" id="INS-S-00232" date="20080617" 286. The apparatus of claim 152 wherein d is generated by multiplying the third sequence and the second sequence.id="INS-S-00232" id="INS-S-00233" date="20080617" 287. The unit of claim 225, wherein the second sequence is generated based on a second PN code.id="INS-S-00233"