Bang, Seung-chan (Daejeon, KR)
Shim, Jae-ryong (Daejeon, KR)
Han, Ki-chul (Daejeon, KR)
Kim, Jung-im (Daejeon, KR)
Kim, Tae-joong (Daejeon, KR)

Plaque It! Sponsored by: Flash of Genius

10/932227

06/17/2008

09/02/2004

Images are available in PDF form when logged in. To view PDFs, Login  or  Create Account (Free!)

View patents that cite this patent

Click for automatic bibliography generation

Electronics and Telecom Research Institute (Daejeon, KR)

375/141

375/298, 375/146

H04B1/707

375/130, 375/141, 375/295, 375/259, 375/140, 375/298, 375/261, 375/146

5309474	System and method for generating signal waveforms in a CDMA cellular telephone system	May, 1994	Gilhousen et al.
5337338	Pulse density modulation circuit (parallel to serial) comparing in a nonsequential bit order	August, 1994	Sutton
5416797	System and method for generating signal waveforms in a CDMA cellular telephone system	May, 1995	Gilhousen et al.
5511073	Method and apparatus for the formatting of data for transmission	April, 1996	Padovani et al.
5566164	Practical means for digital generation and combination of a multiplicity of CDMA/FDMA signals	October, 1996	Ohlson
5602833	Method and apparatus for using Walsh shift keying in a spread spectrum communication system	February, 1997	Zehavi
5619526	CDMA base station modulator for digital cellular mobile communication systems	April, 1997	Kim et al.	370/335
5712869	Data transmitter and receiver of a spread spectrum communication system using a pilot channel	January, 1998	Lee et al.
5818867	QPSK/QBL-MSK waveform enhancement	October, 1998	Rasmussen et al.
5870378	Method and apparatus of a multi-code code division multiple access receiver having a shared accumulator circuits	February, 1999	Huang et al.
5903761	Method of reducing the number of instructions in a program code sequence	May, 1999	Tyma	717/148
5920551	Channel structure with burst pilot in reverse link	July, 1999	Na et al.
5930230	High data rate CDMA wireless communication system	July, 1999	Odenwalder et al.	370/208
5940434	Walsh-QPSK chip modulation apparatus for generating signal waveform in a direct sequence spread spectrum communication system	August, 1999	Lee
5960029	Coherent dual-channel QPSK modulator/demodulator for CDMA systems, and modulating/demodulating methods therefor	September, 1999	Kim et al.
5991284	Subchannel control loop	November, 1999	Willenegger et al.
6028888	Single-channel and multi-channel coherent demodulation devices with no pilot signal, and corresponding receiving system using a plurality of diversity paths	February, 2000	Roux
6052404	Radio communication system employing a spread-spectrum technique	April, 2000	Tiepermann
6097712	Multi-carrier CDMA communications systems	August, 2000	Secord et al.	370/335
6108369	Channelization code allocation for radio communication systems	August, 2000	Ovesjo et al.	375/146
6144691	Method and apparatus for synchronizing to a direct sequence spread spectrum signal	November, 2000	Kenney	375/130
6222873	Orthogonal complex spreading method for multichannel and apparatus thereof	April, 2001	Bang et al.	375/146
6246697	Method and system for generating a complex pseudonoise sequence for processing a code division multiple access signal	June, 2001	Whinnett et al.
6246976	Apparatus, method and storage medium for identifying a combination of a language and its character code system	June, 2001	Mukaigawa et al.
6269088	CDMA mobile communication system and communication method	July, 2001	Masui et al.	370/335
6381229	Random access in a mobile telecommunications system	April, 2002	Narvinger et al.
6519278	Transmitting/receiving apparatus using a plurality of spreading codes	February, 2003	Hiramatsu
6560194	Method of allocating orthogonal codes in a code division multiple access mobile radio system using codes of variable length	May, 2003	Gourgue et al.
20030147655	Unified multi-carrier framework for multiple-access technologies	August, 2003	Shattil

EP0783210	July, 1997			Spread spectrum communications system
EP0814581	December, 1997			CDMA communication method and group spreading modulator
JP07038962	February, 1995			AUTOMOBILE-PORTABLE TELEPHONE SYSTEM
KR1997-0031399	June, 1997
KR0155510	July, 1998
KR10-0298340	May, 2001
WO/1992/017011	October, 1992			METHOD AND APPARATUS FOR PROVIDING HIGH DATA RATE TRAFFIC CHANNELS IN A SPREAD SPECTRUM COMMUNICATION SYSTEM
WO/1995/003652	February, 1995			WALSH SEQUENCE GENERATION FOR VARIABLE DATA RATES
WO/1995/012937	May, 1995			QUADRATURE MULTIPLEXING OF TWO DATA SIGNALS SPREAD BY DIFFERENT PN-SEQUENCES
WO-9733400	September, 1997
WO-9745970	December, 1997
WO/1997/047098	December, 1997			SUBSCRIBER UNIT FOR A CDMA WIRELESS COMMUNICATION SYSTEM

CSEM/Pro Telecom, et al., “FMA-FRAMES Multiple Access A Harmonized Concept for UMTS/IMT-2000; FMA2-Wideband CDMA”, Homepage: http://www.de.infowin.org/ACTS/RUS/PROJECTS/FRAMES, pp. 1-14.
Birgenheier, Raymond A.; “Overview of Code-Domain Power, Timing, and Phase Measurements”; Hewlett-Packard Journal; vol. 47, No. 1, pp. 73-93; (Feb. 1996).
Jae Ryong Shim and Seung Chan Bang; Spectrally efficient modulation and spreading scheme for CDMA systems; Electronics Letters; Nov. 12, 1998, vol. 34, No. 23; pp. 2210-2211.
Edited by Matsushita: UTRA Physical Layer Description, TDD parts for public operation; Layer 1 Expert Group meeting, Bocholt May 18-20; Nov. 13, 1998; pp. 1-27.
Yang, G., Vos, G., Cho, H., I/Q Modulator Image Rejection Through Modulation Pre-distortion, IEEE, May 1996, 1317-1320.
Dekorsky, Armin and Kammeyer, Karl-Dirk, M-ary Orthogonal Modulation For MC-CDMA Systems in Indoor Wireless Radio Networks, Multi-Carrier Spread-Spectrum 69-76, 1997 (Kluwer Academic Publishers, Netherlands).
Barbarossa, S. and Scaglione, A., Polynomial Minimum Shift Keying Modulation: Simplified Decoding of CPM Signals, 1997 IEEE, 145-148.

Burd, Kevin

Hunton & Williams LLP

Notice: More than one reissue application has been filed for the reissue of U.S. Pat. No. 6,449,306. The reissue applications are application Ser. Nos. 10/932,227 (this application), which was filed on Sep. 2, 2004 and 11/648,915, a continuation reissue application of 10/932,227, which was filed on Jan. 3, 2007 and is still pending.

This application is a continuation of application Ser. No. 09/162,764, now U.S. Pat. No. 6,222,873.

What is claimed is:

1. An orthogonal complex spreading method for multiple channels, comprising the steps of: complex-summing W_M,n1X_n1, which is obtained by multiplying an orthogonal code sequence W_M,n1 by first data group X_n1 of a n-th block, and W_M,n2X_n2, which is obtained by multiplying an orthogonal code sequence W_M,n2 by second data group X_n2 of a n-th block, M and n being positive integers; complex-multiplying the complex summed form of W_M,n1X_n1+jW_M,n2X_n2, by a complex form of W_M,n3+jW_M,n4 and outputting (W_M,n1X_n1+jW_M,n2X_n2)×(W_M,n3+jW_M,n4) as an output signal; and summing in-phase and quadrature phase parts of the output signal outputted from a plurality of blocks as $\left(\sum _{n=1}^K\left(\left(W_{M,\mathrm{n1}}{X}_{\mathrm{n1}}+{\mathrm{jW}}_{M,\mathrm{n2}}{X}_{\mathrm{n2}}\right)\times \left(W_{M,\mathrm{n3}}+j{W}_{M,\mathrm{n4}}\right)\right)\right),$ 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 W_M,11=W₀, W_M,12=W₂, and W_M,13=W₀, W_M,14=W₁, when M=4.

10. The method of claim 9 wherein M=8 and W_M,12=W₄.

11. The method of claim 3 wherein W_M,n1=W₀, W_M,n2=W_2p, where p represents a predetermined number in a range from 0 to (M/2)−1, and W_M,n3=W_2n−2, W_M,n4=W_2n−1.

12. The method of claim 3 wherein W_M,21=W₀, W_M,22=W₄, W_M,23=W₂, W_M,24=W₃ when M=8 in case of two channels.

13. The method of claim 12 wherein W_M,12=W₆, and W_M,22=W₆.

14. An orthogonal complex spreading apparatus, comprising: a plurality of complex multiplication blocks, each for complex-multiplexing a complex signal W_M,n1X_n1+jW_M,n2X_n2 by W_M,n3+jW_M,n4 wherein W_M,n1X_n1 is obtained by multiplying an orthogonal code sequence W_M,n1 by first data group X_n1 of n-th block and W_M,n2X_n2 is obtained by multiplying orthogonal sequence W_M,n2 by second data group X_n2 of the n-th block, wherein M and n are positive integers and W_M,n1, W_M,n2, W_M,n3 and W_M,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 $\left(\sum _{n=1}^K\left(\left({\alpha }_{\mathrm{n1}}{W}_{M,\mathrm{n1}}{X}_{\mathrm{n1}}+{\mathrm{j\alpha }}_{\mathrm{n2}}{W}_{M,\mathrm{n2}}{X}_{\mathrm{n2}}\right)\times \left(W_{M,\mathrm{n3}}+j{W}_{M,\mathrm{n4}}\right)\right)\right),$ 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 X_n1 by the orthogonal code sequence W_M,n1; a second multiplier for multiplying the second data group X_n2 by the orthogonal code sequence W_M,n2; third and fourth multipliers for multiplying the output signal W_M,n1X_n1 from the first multiplier and the output signal W_M,n2X_n2 from the second multiplier by orthogonal code sequence W_M,n3; fifth and sixth multipliers for multiplying the output signal W_M,n1X_n1 from the first multiplier and the output signal W_M,n2X_n2 from the second multiplier by orthogonal code sequence W_M,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 W_M,n1 by first data group X_n1; multiplying orthogonal code sequence M_M,n2 by second data group X_n2; summing output signals W_M,n1X_n1 and W_M,n2X_n2 in the complex form of $\sum _{n=1}^K\left(W_{M,\mathrm{n1}}{X}_{\mathrm{n1}}+{\mathrm{jW}}_{M,\mathrm{n2}}{X}_{\mathrm{n2}}\right);$ and complex-multiplying the received output signal $\sum _{n=1}^K\left(W_{M,\mathrm{n1}}{X}_{\mathrm{n1}}+{\mathrm{jW}}_{M,\mathrm{n2}}{X}_{\mathrm{n2}}\right)\mathrm{by}{W}_{M,1}+j{\mathrm{PW}}_{M,Q}$ wherein P is a predetermined sequence, and W_M,I and W_M,Q are orthogonal code sequences.

21. The method of claim 20 wherein a spreading code spreads the output of the step of complex-multiplying, and the spreading code is generated based on at least 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 W_M,I=W₀, W_M,Q=W_2q+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 X_n1 by gain α_n1; and multiplying the second data group X_n2 by gain α_n2.

27. The method of claim 23 wherein W_M,11=W₀, W_M,12=W₂, and W_M,I=W₀, W_M,Q=W₁, when M=4.

28. The method of claim 27 wherein M=8 and W_M,12=W₄.

29. The method of claim 23 wherein W_M,n1=W₀, W_M,n2=W_2q+1, wherein q represents a predetermined number in a range from 0 to (M/2)−1 and W_M,I=W₀, W_M,Q=W₁.

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 W_M,n1X_n1 from a first sequence multiplier; and summing output signals W_M,n2X_n2 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 W_M,n1X_n1 which is obtained by multiplying first data group X_n1 by orthogonal code sequence W_M,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 W_M,n2X_n2 which is obtained by multiplying a first data group X_n2 by orthogonal code sequence W_M,n2; a complex multiplier for receiving the output signals from the first and the second multiplier blocks in a complex form of $\sum _{n=1}^K\left(W_{M,\mathrm{n1}}{X}_{\mathrm{n1}}+{\mathrm{jW}}_{M,\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ and complex-multiplying received output signal by W_M,I+jPW_M,Q, wherein W_M,I and W_M,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 W_M,11=W₀, W_M,12=W₄, W_M,21=W₂, and W_M,I=W₀, W_M,Q=W₁, when M=8 in case of three input channels.

35. The apparatus of claim 32 wherein W_M,11=W₀, W_M,12=W₂, and W_M,I=W₀, W_M,Q=W₁ in case of three input channels.

36. The apparatus of claim 32 wherein W_M,11=W₀, W_M,12=W₄, W_M,21=W₂, W_M,31=W₆, and W_M,I=W₀, W_M,Q=W₁ in case of four input channels.

37. The apparatus of claim 32 wherein W_M,11=W₀, W_M,12=W₄, W_M,31=W₂, W_M,I=W₀, W_M,Q=W₁ and W_M,21=W₈ in case of four input channels.

38. The apparatus of claim 32 wherein W_M,11=W₀, W_M,12=W₄, W_M,21=W₂, W_M,31=W₆, W_M,22=W₁, and W_M,I=W₀, W_M,Q=W₁ in case of five input channels.

39. The apparatus of claim 32 wherein W_M,n1=W₀, W_M,12=W₄, W_M,21=W₂, W_M,31=W₆, W_M,22=W₃, and W_M,I=W₀, W_M,Q=W₁ in case of five input channels.

40. The apparatus of claim 31 wherein W_M,11=W₀, W_M,12=W₄, W_M,31W₂, W_M,22=W₆, and W_M,I=W₀, W_M,Q=W₁ and W_M,21=W₈ in case of five input channels.

41. The apparatus of claim 32 wherein W₀X₁₁+jW₄X₁₂, W₂X₂₁ and W₆X₃₁ are replaced by α₁₁W₀X₁₁+jα₁₂W₄X₁₂, α₂₁W₂X₂₁ and α₃₁W₆X₃₁, 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 W_M,n1=W₀, W_M,n2=W₂, and W_M,I=W₀, W_M,Q=W₁.

43. The apparatus of claim 31 wherein the first multiplier block comprises at least a third multiplier for multiplying the first data group X_n1 by gain α_n1, and the second multiplier block comprises at least a fourth multiplier the second data group X_n2 by gain α_n2.

44. The apparatus of claim 31 wherein W_M,11=W₀, W_M,12=W_4/1, and W_M,I=W₀, W_M,Q=W_1/4, when M=8 in case of two input channels.

45. The apparatus of claim 32 wherein W_M,11=W₀, W_M,12=W_4/1, W_M,21=W₂, and W_M,I=W₀, W_M,Q=W_1/4, when M=8 in case of three input channels.

46. The method of claim 32 wherein W_M,11=W₀, W_M,12=W_2/1, and W_M,I=W₀, W_M,Q=W_1/2, when M=8 in case of two input channels.

47. The apparatus of claim 32 wherein W_M,11=W₀, W_M,12=W_2/1, W_M,21=W₄, and W_M,I=W₀, W_M,Q=W_1/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 $\sum _{n=1}^K\left(W_{M,\mathrm{n1}}{X}_{\mathrm{n1}}\right)$ by summing output signals from the first multiplier block; and a second adder for outputting $\sum _{n=1}^K\left(W_{M,\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ by summing output signals from the second multiplier block.

49. The apparatus of claim 31 further comprising: a spreading unit for multiplying the signal $\sum _{n=1}^K\left(W_{M,\mathrm{n1}}{X}_{\mathrm{n1}}+{\mathrm{jW}}_{M,\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ 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 W_M,n1, W_M,n2, W_M,I, and W_M,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 W_M,I; seventh and eighth multipliers for multiplying said output signal from the first multiplier block and output signal α_n2W_M,n2X_n2 from the second multiplier block by orthogonal sequence W_M,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 X_n1, and X_n2 with a set of predetermined orthogonal sequences W_M,n1, and W_M,n2 to output W_M,n1X_n1 and W_M,n2X_n2; a complex multiplier for receiving the output signals W_M,n1X_n1 and W_M,n2X_n2 from the first and the second multiplier blocks in the complex form of $\sum _{n=1}^K\left(W_{M,\mathrm{n1}}{X}_{\mathrm{n1}}+{\mathrm{jW}}_{M,\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ and multiplying a received signal $\sum _{n=1}^K\left(W_{M,\mathrm{n1}}{X}_{\mathrm{n1}}+{\mathrm{jW}}_{M,\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ by a predetermined sequence (W_M,I+jPW_M,Q)×SC, wherein W_M,I, W_M,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 $\sum _{n=1}^K\left(W_{M,\mathrm{n1}}{X}_{\mathrm{n1}}\right)$ by summing output signals from the first sequence multiplier; and a second adder for outputting $\sum _{n=1}^K\left(W_{M,\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ 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 X_n1, 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 X_n2 of each channel of the second group by gain α_n2.

56. The apparatus of claim 53 wherein W_M,n1=W₀, W_M,n2W_2p, and W_M,I=W₀, W_M,Q=W₁, where p represents a predetermined integer in a range from 0 to (M/2)−1.

57. The apparatus of claim 53 wherein W_M,n1, W_M,n2, W_M,I, and W_M,Q are orthogonal Hadamard sequences.

58. The method of claim 20 wherein the step of summing of output signals W_M,n1X_n1 and W_M,n2X_n2 includes adjusting values of the output signals W_M,n1X_n1 and W_M,n2X_n2 based on gains.

59. The method of claim 58 wherein said step of complex-multiplying $\sum _{n=1}^K\left(W_{\mathrm{n1}}{X}_{\mathrm{n1}}+{jW}_{\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ by (W_M,I+jPW_M,O) includes multiplying $\sum _{n=1}^K\left(W_{\mathrm{n1}}{X}_{\mathrm{n1}}+{jW}_{\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ by (W_M,1+jPW_M,O) and by a spreading sequence, wherein W_M,I=W₀ and W_M,O=W₁.

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.

61. The apparatus of claim 53 wherein the first multiplier block is configured to adjust the values of W_M,n1X_n1 based on first relative gains, and the second multiplier block is configured to adjust the values of W_M,n2X_n2 based on second relative gains.

62. The apparatus of claim 53 wherein W_M,n1 and W_M,n2 comprise gain adjusted sequence elements.

63. The method of claim 20, wherein W_M,1=W₀ and W_M,O=W₁.

64. The method of claim 63, further comprising: adjusting the values of W_M,n1X_n1 based on first relative gains, and adjusting the values of W_M,n2X_n2 based on second relative gains.

65. The method of claim 63, wherein W_M,n1 and W_M,n2 comprise gain adjusted sequence elements.

66. The method of claim 63, wherein P is generated based on a spreading sequence.

67. The method of claim 63, wherein the spreading sequence is generated based on a PN code.

68. The apparatus of claim 53, wherein W_M,1=W₀ and W_M,O=W₁.

69. The method of claim 68, wherein P is generated based on a spreading sequence.

70. The method of claim 69, wherein the spreading sequence is generated based on a PN code.

71. A spreading method, comprising: generating $\sum _{n=1}^K\left({\alpha }_{\mathrm{n1}}{\mathrm{OS}}_{\mathrm{n1}}{X}_{\mathrm{n1}}\right)$ based on at least one or more first input signals X₁₁, . . . , X_K1, one or more first orthogonal code sequences OS₁₁, . . . , OS_K1, and one or more first gains α₁₁, . . . , α_K1, K being a positive integer; generating $\sum _{n=1}^L\left({\alpha }_{\mathrm{n2}}{\mathrm{OS}}_{\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ based on at least one or more second input signals X₁₂, . . . , X_L2, one or more second orthogonal code sequences OS₁₂, . . . , OS_L2, and one or more second gains α₁₂, . . . , α_L2, L being a positive integer; and complex-multiplying $\sum _{n=1}^K\left({\alpha }_{\mathrm{n1}}{\mathrm{OS}}_{\mathrm{n1}}{X}_{\mathrm{n1}}\right)+j\sum _{n=1}^L\left({\alpha }_{\mathrm{n2}}{\mathrm{OS}}_{\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ by (W₀+jP·W₁)×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.

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.

73. The method of claim 71, wherein the first sequence is generated based on at least a PN code.

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.

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.

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.

77. A spreading apparatus comprising: first multiplier mechanism for generating $\sum _{n=1}^K\left({\alpha }_{\mathrm{n1}}{\mathrm{OS}}_{\mathrm{n1}}{X}_{\mathrm{n1}}\right)$ based on at least one or more first input signals X₁₁, . . . , X_K1, one or more first orthogonal code sequences OS₁₁, . . . , OS_K1, and one or more first gains α₁₁, . . . , α_K1, K being a positive integer; second multiplier mechanism for generating $\sum _{n=1}^L\left({\alpha }_{\mathrm{n2}}{\mathrm{OS}}_{\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ based on one or more second input signals X₁₂, . . . , X_L2, one or more second orthogonal code sequences OS₁₂, . . . , OS_L2, and one or more second gains α₁₂, . . . , α_L2, L being a positive integer; a complex multiplier for multiplying $\sum _{n=1}^K\left({\alpha }_{\mathrm{n1}}{\mathrm{OS}}_{\mathrm{n1}}{X}_{\mathrm{n1}}\right)+j\sum _{n=1}^L\left({\alpha }_{\mathrm{n2}}{\mathrm{OS}}_{\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ by (W₀+jP·W₁)×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.

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.

79. The apparatus of claim 77, wherein the first sequence is generated based on at least a PN code.

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.

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.

82. The apparatus of claim 81, wherein SC is a PN code.

83. The apparatus of claim 81, wherein at least one of the one or more first gains has a value of 1.

84. A spreading apparatus, comprising: a first multiplier mechanism configured to generate $\sum _{n=1}^K\left({\alpha }_{\mathrm{n1}}{\mathrm{OS}}_{\mathrm{n1}}{X}_{\mathrm{n1}}\right)$ based on at least one or more first input signals X₁₁, . . . , X_K1, one or more first orthogonal code sequences OS₁₁, . . . , OS_K1, and one or more first gains α₁₁, . . . , α_K1, K being a positive integer; a second multiplier mechanism configured to generate $\sum _{n=1}^L\left({\alpha }_{\mathrm{n2}}{\mathrm{OS}}_{\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ based on at least one or more second input signals X₁₂, . . . , X_L2, one or more second orthogonal code sequences OS₁₂, . . . , OS_L2, and one or more second gains α₁₂, . . . , α_L2, L being a positive integer; and a complex multiplier configured to multiply $\sum _{n=1}^K\left({\alpha }_{\mathrm{n1}}{\mathrm{OS}}_{\mathrm{n1}}{X}_{\mathrm{n1}}\right)+j\sum _{n=1}^L\left({\alpha }_{\mathrm{n2}}{\mathrm{OS}}_{\mathrm{n2}}{X}_{\mathrm{n2}}\right)$ by (W₀+jP·W₁)×SC, wherein P is a third sequence and SC is a spreading sequence.

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.

86. The apparatus of claim 84, wherein SC is generated based on at least a PN code.

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.

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.

89. The apparatus of claim 88, wherein at least one of the one or more first gains has a value of 1.

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.

91. The method of claim 90, wherein the first sequence of sequence elements is W₁.

92. The method of claim 90, wherein d is generated based on at least the first sequence and a second sequence.

93. The method of claim 92, wherein the second sequence is generated based on a second PN code.

94. The method of claim 92 wherein the second sequence is generated based on a spreading sequence.

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.

96. The method of claim 92 wherein d is generated by multiplying the first sequence and the second sequence.

97. The method of claim 90, wherein the first value is 1 and the second value is −1.

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.

99. The method of claim 98, wherein the second sequence is generated based on a second PN code.

100. The method of claim 90, wherein the first orthogonal code and the second orthogonal code include Walsh codes.

101. The method of claim 90 wherein the first code and the second code are even-numbered Walsh codes.

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.

103. The method of claim 102, wherein the third Walsh code is W₁.

104. The method of claim 102, wherein d is generated based on at least the third Walsh code and a third sequence.

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.

106. The method of claim 105, wherein SC is a first PN code.

107. The method of claim 106, wherein the third sequence is generated based on a second PN code.

108. The method of claim 104 wherein the third sequence is generated based on a spreading sequence.

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.

110. The method of claim 104 wherein d is generated by multiplying the third sequence and the third Walsh code.

111. The method of claim 104, wherein SC is a first PN code.

112. The method of claim 111, wherein the third sequence is generated based on a second PN code.

113. The method of claim 102, wherein the first value is 1 and the second value is −1.

114. The method of claim 102, wherein SC is generated based on at least a PN code.

115. The method of claim 102 wherein the first sequence is a spreading sequence.

116. The method of claim 102 wherein the first and the second Walsh codes are even-numbered Walsh codes.

117. The method of claim 102, wherein SC is a first PN code.

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.

119. The apparatus of claim 118, wherein the first sequence of sequence elements is W₁.

120. The apparatus of claim 118, wherein d is generated based on at least the first sequence and a third sequence.

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.

122. The apparatus of claim 121, wherein SC is a first PN code.

123. The apparatus of claim 122, wherein the third sequence is generated based on a second PN code.

124. The apparatus of claim 120 wherein the third sequence is generated based on a spreading sequence.

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.

126. The method of claim 120 wherein d is generated by multiplying the third sequence and the first sequence.

127. The apparatus of claim 120, wherein SC is a first PN code.

128. The apparatus of claim 127, wherein the third sequence is generated based on a second PN code.

129. The apparatus of claim 118, wherein the first value is 1 and the second value is −1.

130. The apparatus of claim 118 wherein the second sequence is a spreading sequence.

131. The apparatus of claim 118 wherein the first signal and the second signal are generated based on at least even numbered Walsh codes.

132. The apparatus of claim 118 wherein the second sequence is generated based on at least a PN code.

133. The apparatus of claim 118, wherein SC is a first PN code.

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.

135. The system of claim 134, wherein the second sequence of sequence elements is W₁.

136. The system of claim 134, wherein d is generated based on at least the second sequence and a third sequence.

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.

138. The system of claim 137 wherein the first signal and the second signal are generated based on at least even numbered Walsh codes.

139. The system of claim 137, wherein SC is a first PN code.

140. The system of claim 139, wherein the third sequence is generated based on a second PN code.

141. The system of claim 136 wherein the third sequence is generated based on a spreading sequence.

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.

143. The system of claim 136 wherein d is generated by multiplying the third sequence and the second sequence.

144. The system of claim 136, wherein SC is a first PN code.

145. The system of claim 144, wherein the third sequence is generated based on a second PN code.

146. The system of claim 134, wherein the first value is 1 and the second value is −1.

147. The system of claim 134 wherein the first sequence is a spreading sequence.

148. The system of claim 134 wherein the first sequence is generated based on at least a PN code.

149. The system of claim 134, wherein SC is a first PN code.

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.

151. The apparatus of claim 150, wherein the second sequence is W₁.

152. The apparatus of claim 150, wherein d is generated based on at least the second sequence and a third sequence.

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.

154. The apparatus of claim 153, whrein SC is a first PN code.

155. The apparatus of claim 154, wherein the third sequence is generated based on a second PN code.

156. The apparatus of claim 152 wherein the third sequence is generated based on a spreading sequence.

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.

158. The apparatus of claim 153 wherein the first signal and the second signal are generated based on at least even numbered Walsh codes.

159. The apparatus of claim 152, whrein SC is a first PN code.

160. The apparatus of claim 159, wherein the third sequence is generated based on a second PN code.

161. The apparatus of claim 150, wherein the first value is 1 and the second value is −1.

162. The apparatus of claim 150, wherein the first orthogonal code and the second orthogonal code are even numbered Walsh codes.

163. The apparatus of claim 150, wherein SC is generated based on at least a PN code.

164. The apparatus of claim 150 wherein the first sequence is a spreading sequence.

165. The apparatus of claim 150, wherein SC is a first PN code.

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.

167. The method of claim 166, wherein the in-phase component only comprises a spreading sequence.

168. The method of claim 167, wherein the spreading sequence is generated based on at least a PN code.

169. The method of claim 167, wherein the spreading sequence is a first PN code.

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.

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.

172. The method of claim 171, wherein the second sequence is generated based on a second PN code.

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.

174. The method of claim 170, wherein the second sequence is generated based on a second PN code.

175. The method of claim 166, wherein the first value is 1 and the second value is −1.

176. The method of claim 166 wherein the first sequence of sequence elements is W₁.

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.

178. The unit of claim 177, wherein the in-phase component only comprises a spreading sequence.

179. The unit of claim 178, wherein the spreading sequence is generated based on at least a PN code.

180. The unit of claim 179 wherein the first sequence of sequence elements is W₁.

181. The unit of claim 178, wherein the spreading sequence is a PN code.

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.

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.

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.

185. The unit of claim 177, wherein the first value is 1 and the second value is −1.

186. The unit of claim 177 wherein the first sequence of sequence elements is W₁.

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.

188. The unit of claim 187, wherein the in-phase component only comprises a spreading sequence.

189. The unit of claim 188, wherein the spreading sequence is a first PN code.

190. The unit of claim 188, wherein the spreading sequence is generated based on at least a PN code.

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.

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.

193. The unit of claim 191, wherein the second sequence is generated based on a second PN code.

194. The unit of claim 187, wherein the first value is 1 and the second value is −1.

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.

196. The unit of claim 195, wherein the second sequence is generated based on a second PN code.

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.

198. The method of claim 197, wherein the in-phase component comprises only a spreading sequence.

199. The method of claim 198, wherein the spreading sequence is generated based on at least a PN code.

200. The method of claim 198, wherein the spreading sequence is a first PN code.

201. The method of claim 197, wherein the first value is 1 and the second value is −1.

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.

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.

204. The method of claim 203, wherein the second sequence is generated based on a second PN code.

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.

206. The method of claim 202, wherein the second sequence is generated based on a second PN code.

207. The method of claim 197 wherein the first sequence of sequence elements is W₁.

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.

209. The unit of claim 208, wherein the in-phase component comprises only a spreading sequence.

210. The unit of claim 209, wherein the spreading sequence is generated based on at least a PN code.

211. The unit of claim 209, wherein the spreading sequence is a first PN code.

212. The unit of claim 208, wherein the first value is 1 and the second value is −1.

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.

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.

215. The unit of claim 214, wherein the second sequence is generated based on a second PN code.

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.

217. The unit of claim 213, wherein the second sequence is generated based on a second PN code.

218. The unit of claim 208 wherein the first sequence of sequence elements is W₁.

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.

220. The unit of claim 219, wherein the in-phase component comprises only a spreading sequence.

221. The unit of claim 220, wherein the spreading sequence is generated based on at least a PN code.

222. The unit of claim 220, wherein the spreading sequence is a first PN code.

223. The unit of claim 219, wherein the first value is 1 and the second value is −1.

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.

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.

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.

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.

228. The unit of claim 224, wherein the second sequence is generated based on a second PN code.

229. The unit of claim 219 wherein the first sequence of sequence elements is W₁.

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.

231. The method of claim 230, wherein the first sequence of sequence elements is W₁.

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.

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.

234. The method of claim 233, wherein the second sequence is generated based on a PN code.

235. The method of claim 232, wherein the second sequence is generated based on a PN code.

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.

237. The method of claim 236, wherein the second sequence is generated based on a PN code.

238. The method of claim 230 wherein the first value is 1 and the second value is −1.

239. The method of claim 230, wherein the in-phase component comprises a spreading sequence.

240. The method of claim 239, wherein the spreading sequence is generated based on at least a PN code.

241. The method of claim 239, wherein the spreading sequence is a PN code.

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.

243. The apparatus of claim 242, wherein the first sequence of sequence elements is W₁.

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.

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.

246. The apparatus of claim 245, wherein the second sequence is generated based on a PN code.

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.

248. The apparatus of claim 247, wherein the second sequence is generated based on a PN code.

249. The apparatus of claim 242 wherein the first value is 1 and the second value is −1.

250. The apparatus of claim 242, wherein the in-phase component comprises a spreading sequence.

251. The apparatus of claim 250, wherein the spreading sequence is generated based on at least a PN code.

252. The apparatus of claim 250, wherein the spreading sequence is a PN code.

253. The apparatus of claim 264, wherein the first sequence of sequence elements is W₁.

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.

255. The apparatus of claim 254, wherein the second sequence is generated based on a PN code.

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.

257. The apparatus of claim 256, wherein the second sequence is generated based on a PN code.

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.

259. The apparatus of claim 258, wherein the second sequence is generated based on a PN code.

260. The apparatus of claim 264 wherein the first value is 1 and the second value is −1.

261. The apparatus of claim 264, wherein the in-phase component comprises a spreading sequence.

262. The apparatus of claim 261, wherein the spreading sequence is generated based on at least a PN code.

263. The apparatus of claim 261, wherein the spreading sequence is a PN code.

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.

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.

266. The apparatus of claim 273, wherein SC is generated based on at least a PN code.

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.

268. The method of claim 267, wherein the third sequence is generated based on a PN code.

269. The method of claim 226, wherein SC is a spreading sequence.

270. The method of claim 226, wherein SC is generated based on at least a PN code.

271. The method of claim 226, wherein SC is a PN code.

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.

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.

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.

275. The method of claim 274, wherein P is generated based on a PN code.

276. The apparatus of claim 273, wherein SC is a PN code.

277. The method of claim 276, wherein P is generated based on a PN code.

278. The apparatus of claim 244, wherein the second sequence is generated based on a PN code.

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 sequ