# US RE44,507 E1 · Orthogonal complex spreading method for multichannel and apparatus thereof

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US RE44,507 E1
- Document ID: USRE44507E1
- Status: Granted
- Kind: E1
- Application number: 11/648,915
- Filed: 2007-01-03
- Granted: 2013-09-24
- Earliest claimed: 1997-12-02
- Assignees: Electronics and Telecommunications Research Institute
- Applicants: Seung Chan Bang; Jae Ryong Shim; Ki-Chul Han; Jung-im Kim; Tae-Joong Kim
- Inventors: Seung Chan Bang; Jae Ryong Shim; Ki-Chul Han; Jung-im Kim; Tae-Joong Kim
- Web page: https://patentgrep.com/patent/USRE44507E1

## Abstract

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,n2Xn2 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.

## Claims

### Claim 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
n
=
1
⁢
(
(
W
M
,
n
⁢
⁢
1
⁢
X
n
⁢
⁢
1
+
j
⁢
⁢
W
M
,
n
⁢
⁢
2
⁢
X
n
⁢
⁢
2
)
×
(
W
M
,
n
⁢
⁢
3
+
jW
M
,
n
⁢
⁢
4
)
)
)
,
K is a predetermined integer greater than or equal to 1 to generate I channel and Q channel signal.

### Claim 2 (depends on 1)

The method of claim 1 wherein a spreading code spreads the summed in-phase and quadrature-phase signals outputted from the summing step.

### Claim 3 (depends on 1)

The method of claim 1 wherein said orthogonal code sequence includes a Hadamard code sequence.

### Claim 4 (depends on 1)

The method of claim 1 wherein said orthogonal code sequence includes a Walsh code.

### Claim 5 (depends on 2)

The method of claim 2 wherein said spreading code is one spreading code.

### Claim 6 (depends on 5)

The method of claim 5 wherein said spreading code sequence includes a PN code.

### Claim 7 (depends on 5)

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.

### Claim 8 (depends on 7)

The method of claim 7 wherein the first and second spreading codes are PN codes.

### Claim 9 (depends on 3)

The method of claim 3 wherein WM,11=W0, WM,12=W2, and WM,13=W0, WM,14=W1, when M=4.

### Claim 10 (depends on 9)

The method of claim 9 wherein M=8 and WM,12=W4.

### Claim 11 (depends on 3)

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.

### Claim 12 (depends on 3)

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.

### Claim 13 (depends on 12)

The method of claim 12 wherein WM,12=W6, and WM,22=W6.

### Claim 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
n
=
1
⁢
(
(
α
n
⁢
⁢
1
⁢
W
M
,
n
⁢
⁢
1
⁢
X
n
⁢
⁢
1
+
jα
n
⁢
⁢
2
⁢
⁢
W
M
,
n
⁢
⁢
2
⁢
X
n
⁢
⁢
2
)
×
(
W
M
,
n
⁢
⁢
3
+
jW
M
,
n
⁢
⁢
4
)
)
)
,
K is a predetermined integer greater than or equal to 1.

### Claim 15 (depends on 14)

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.

### Claim 16 (depends on 15)

The apparatus of claim 15 wherein said spreading unit multiplies the in-phase and quadrature phase part by different spreading codes.

### Claim 17 (depends on 14)

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.

### Claim 18 (depends on 17)

The apparatus of claim 17 wherein said orthogonal code sequence includes a Hadamard code sequence.

### Claim 19 (depends on 17)

The apparatus of claim 17 wherein said orthogonal code sequence includes a Walsh code.

### Claim 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 WM,n2 by second data group Xn2;
summing output signals WM,n1Xn1 and WM,n2Xn2 in the complex form of
∑
K
n
=
1
⁢
(
W
M
,
n
⁢
⁢
1
⁢
X
n
⁢
⁢
1
+
j
⁢
⁢
W
M
,
n
⁢
⁢
2
⁢
X
n
⁢
⁢
2
)
;
and
complex-multiplying the received output signal
∑
K
n
=
1
⁢
(
W
M
,
n
⁢
⁢
1
⁢
X
n
⁢
⁢
1
+
j
⁢
⁢
W
M
,
n
⁢
⁢
2
⁢
X
n
⁢
⁢
2
)
⁢
⁢
by
⁢
⁢
(
W
M
,
1
+
jPW
M
,
Q
)
wherein P is a predetermined sequence, and WM,I and WM,Q are orthogonal code sequences.

### Claim 21 (depends on 20)

The method of claim 20 wherein the spreading code is a PN code.

### Claim 22 (depends on 20)

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.

### Claim 23 (depends on 20)

The method of claim 20 wherein said orthogonal code sequence includes a Hadamard code sequence.

### Claim 24 (depends on 20)

The method of claim 20 wherein said orthogonal code sequence includes a Walsh code.

### Claim 25 (depends on 23)

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).

### Claim 26 (depends on 23)

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.

### Claim 27 (depends on 23)

The method of claim 23 wherein WM,11=W0, WM,12=W2, and WM,I=W0, WM,Q=W1, when M=4.

### Claim 28 (depends on 27)

The method of claim 27 wherein M=8 and WM,12=W4.

### Claim 29 (depends on 23)

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.

### Claim 30 (depends on 20)

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.

### Claim 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, 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
∑
K
n
=
1
⁢
(
W
M
,
n
⁢
⁢
1
⁢
X
n
⁢
⁢
1
+
j
⁢
⁢
W
M
,
n
⁢
⁢
2
⁢
X
n
⁢
⁢
2
)
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.

### Claim 32 (depends on 31)

The apparatus of claim 31 wherein said orthogonal code sequence includes a Hadamard code sequence.

### Claim 33 (depends on 31)

The apparatus of claim 31 wherein said orthogonal code sequence includes a Walsh code.

### Claim 34 (depends on 32)

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.

### Claim 35 (depends on 32)

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.

### Claim 36 (depends on 32)

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.

### Claim 37 (depends on 32)

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.

### Claim 38 (depends on 32)

The apparatus of claim 32 wherein WM,11=W0, WM,12=W4, WM,21=W2, WM,31=W6, WM,22=W1, and WM,IW0, WM,Q=W1 in case of five input channels.

### Claim 39 (depends on 32)

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 channels.

### Claim 40 (depends on 31)

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.

### Claim 41 (depends on 36)

The apparatus of claim 36 wherein W0X11+jW4X12, W2X21 and W6X31 are replaced by α11W0X11+jα12W4X12, α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.

### Claim 42 (depends on 31)

The apparatus of claim 31 wherein WM,n1=W0, WM,n2=W2, and WM,I=W0, WM,Q=W1.

### Claim 43 (depends on 31)

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.

### Claim 44 (depends on 31)

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.

### Claim 45 (depends on 32)

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.

### Claim 46 (depends on 32)

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.

### Claim 47 (depends on 32)

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.

### Claim 48 (depends on 31)

The apparatus of claim 31 wherein each group has at least the two input channels, further comprising:
a first adder for outputting
∑
K
n
=
1
⁢
(
W
M
,
n
⁢
⁢
1
⁢
X
n
⁢
⁢
1
)
by summing output signals from the first multiplier block; and
a second adder for outputting
∑
K
n
=
1
⁢
(
W
M
,
n
⁢
⁢
2
⁢
X
n
⁢
⁢
2
)
by summing output signals from the second multiplier block.

### Claim 49 (depends on 31)

The apparatus of claim 31 further comprising:
a spreading unit for multiplying the signal
∑
K
n
=
1
⁢
(
W
M
,
n
⁢
⁢
1
⁢
X
n
⁢
⁢
1
+
j
⁢
⁢
W
M
,
n
⁢
⁢
2
⁢
X
n
⁢
⁢
2
)
received by the complex multiplier by a spreading code.

### Claim 50 (depends on 49)

The apparatus of claim 49 wherein the spreading unit respectively multiplies the in-phase and quadrature-phase parts by different spreading codes.

### Claim 51 (depends on 31)

The apparatus of claim 31 wherein WM,n1, WM,n2, WM,I, and WM,Q are orthogonal Hadamard sequences.

### Claim 52 (depends on 31)

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.

### Claim 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
∑
K
n
=
1
⁢
(
W
M
,
n
⁢
⁢
1
⁢
X
n
⁢
⁢
1
+
j
⁢
⁢
W
M
,
n
⁢
⁢
2
⁢
X
n
⁢
⁢
2
)
and multiplying a received signal
∑
K
n
=
1
⁢
(
W
M
,
n
⁢
⁢
1
⁢
X
n
⁢
⁢
1
+
j
⁢
⁢
W
M
,
n
⁢
⁢
2
⁢
X
n
⁢
⁢
2
)
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.

### Claim 54 (depends on 53)

The apparatus of claim 53 wherein each group has at least two input channels, further comprising:
a first adder for outputting
∑
K
n
=
1
⁢
(
W
M
,
n
⁢
⁢
1
⁢
X
n
⁢
⁢
1
)
by summing output signals from the first sequence multiplier; and
a second adder for outputting
∑
K
n
=
1
⁢
(
W
M
,
n
⁢
⁢
2
⁢
X
n
⁢
⁢
2
)
by summing output signals from the second sequence multiplier.

### Claim 55 (depends on 53)

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.

### Claim 56 (depends on 53)

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.

### Claim 57 (depends on 53)

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

### Claim 58

A spreading method for a mobile communication device, the mobile communication device being capable of supporting a plurality of channels, the method comprising:
generating a first signal, a, based on at least one of the inputs to one of the plurality of channels, a first code, and a first gain;
generating a second signal, b, based on at least another of the inputs to another of the plurality of channels, a second code, and a second gain;
nonrandomly generating modulated data at least based on values representing e·a-e·b·d and e·b+e·a·d, wherein d is a third signal based on at least a first sequence of elements, wherein the elements in the first sequence of elements nonrandomly alternate between a first value and a second value, the first value being different from the second value, wherein e is a second sequence of elements, wherein some of the elements in the second sequence have the first value and the other elements in the second sequence have the second value.

### Claim 59 (depends on 58)

The method of claim 58 wherein the first sequence of elements is W1.

### Claim 60 (depends on 59)

The method of claim 59, wherein the first signal is generated based on at least a fourth signal generated by multiplying the one of the inputs, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the another of the inputs, the second code, and the second gain.

### Claim 61 (depends on 59)

The method of claim 59, further comprising
transmitting the modulated data through an antenna.

### Claim 62 (depends on 59)

The method of claim 59, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for the (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of the (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 63 (depends on 62)

The method of claim 62, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for the (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of the (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 64 (depends on 59)

The method of claim 59, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 65 (depends on 64)

The method of claim 64, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 66 (depends on 58)

The method of claim 58, wherein the second sequence is a first PN code.

### Claim 67 (depends on 66)

The method of claim 66, wherein the first sequence of elements is W1.

### Claim 68 (depends on 58, 66)

The method of claim 58 or claim 66, wherein the first code is orthogonal to the second code.

### Claim 69 (depends on 58, 66)

The method of claim 58 or claim 66, wherein the first code and the second code are even-numbered Walsh codes.

### Claim 70 (depends on 69)

The method of claim 69, wherein the first signal is generated based on at least a fourth signal generated by multiplying the one of the inputs, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the another of the inputs, the second code, and the second gain.

### Claim 71 (depends on 69)

The method of claim 69, further comprising
transmitting the modulated data through an antenna.

### Claim 72 (depends on 66)

The method of claim 66, wherein the third signal is further based on a third sequence of elements and the first code is orthogonal to the second code.

### Claim 73 (depends on 72, 94)

The method of claim 94 or claim 72, wherein the third sequence of elements is generated based on a second PN code.

### Claim 74 (depends on 72, 94)

The method of claim 94 or claim 72, wherein the third sequence of elements is generated based on a spreading sequence.

### Claim 75 (depends on 72, 94)

The method of claim 94 or claim 72, wherein one or more of the elements in the third sequence of elements have the first value and the remaining elements in the third sequence of elements have the second value, wherein for the (2N−1)th element in the third sequence of elements, the value of the (2N−1)th element is the same as the value of the (2N)th element in the third sequence of elements, where N is a series of sequential positive integers beginning at 1.

### Claim 76 (depends on 72, 94)

The method of claim 94 or claim 72, wherein the third signal is a multiplication of the first sequence of elements and the third sequence of elements.

### Claim 77 (depends on 72, 94)

The method of claim 94 or claim 72, wherein the third sequence of elements 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.

### Claim 78 (depends on 72, 94)

The method of claim 94 or claim 72, wherein the third signal is a multiplication of the first sequence of elements and the third sequence of elements and wherein the third sequence of elements 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.

### Claim 79 (depends on 78)

The method of claim 78, wherein the first signal is generated based on at least a fourth signal generated by multiplying the one of the inputs, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the another of the inputs, the second code, and the second gain.

### Claim 80 (depends on 79)

The method of claim 79, further comprising
transmitting the modulated data through an antenna.

### Claim 81 (depends on 80)

The method of claim 80, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for the (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of the (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 82 (depends on 81)

The method of claim 81, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for the (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of the (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 83 (depends on 80)

The method of claim 80, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 84 (depends on 83)

The method of claim 83, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 85 (depends on 79)

The method of claim 79, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for the (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of the (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 86 (depends on 85)

The method of claim 85, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for the (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of the (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 87 (depends on 79)

The method of claim 79, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 88 (depends on 87)

The method of claim 87, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 89 (depends on 78)

The method of claim 78, further comprising
transmitting the modulated data through an antenna.

### Claim 90 (depends on 78)

The method of claim 78, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for the (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of the (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 91 (depends on 90)

The method of claim 90, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for the (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of the (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 92 (depends on 78)

The method of claim 78, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 93 (depends on 92)

The method of claim 92, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 94 (depends on 58)

The method of claim 58, wherein the third signal is further based on a third sequence of elements.

### Claim 95 (depends on 94)

The method of claim 94, wherein the first signal is generated based on at least a fourth signal generated by multiplying the one of the inputs, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the another of the inputs, the second code, and the second gain.

### Claim 96 (depends on 58)

The method of claim 58, wherein the first signal is generated based on at least a fourth signal generated by multiplying the one of the inputs, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the another of the inputs, the second code, and the second gain.

### Claim 97 (depends on 96)

The method of claim 96, further comprising
transmitting the modulated data through an antenna.

### Claim 98 (depends on 58)

The method of claim 58, further comprising
transmitting the modulated data through an antenna.

### Claim 99 (depends on 58)

The method of claim 58, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for the (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of the (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 100 (depends on 99)

The method of claim 99, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for the (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of the (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 101 (depends on 58)

The method of claim 58, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 102 (depends on 101)

The method of claim 101, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 103 (depends on 58)

The method of claim 58, wherein the second sequence of elements is a spreading sequence.

### Claim 104

A mobile communications device, comprising:
a first signal generator configured to generate a first signal, a, based on at least a first input, a first code, and a first gain;
a second signal generator configured to generate a second signal, b, based on at least a second input, a second code, and a second gain, wherein the first code is orthogonal to the second code; and
an output generator configured to nonrandomly generate modulated data at least based on values representing e·a-e·b·d and e·b+e·a·d, wherein d is a third signal based on at least a first sequence of elements, wherein the elements in the first sequence of elements nonrandomly alternate between a first value and a second value, the first value being different from the second value, wherein e is a second sequence of elements, wherein some of the elements in the second sequence have the first value and the other elements in the second sequence have the second value.

### Claim 105 (depends on 104)

The apparatus of claim 104, wherein the first sequence of elements is W1.

### Claim 106 (depends on 105)

The apparatus of claim 105, wherein the first signal is generated based on at least a fourth signal generated by multiplying the first input, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the second input, the second code, and the second gain.

### Claim 107 (depends on 105)

The apparatus of claim 105, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for the (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of the (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 108 (depends on 107)

The apparatus of claim 107, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for the (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of the (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 109 (depends on 105)

The apparatus of claim 105, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 110 (depends on 109)

The apparatus of claim 109, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 111 (depends on 104)

The apparatus of claim 104, wherein the second sequence of elements is a first PN code.

### Claim 112 (depends on 111)

The apparatus of claim 111, wherein the first sequence of elements is W1.

### Claim 113 (depends on 104, 111)

The apparatus of claim 104 or claim 111, wherein the first code and the second code include Walsh codes.

### Claim 114 (depends on 104, 111)

The apparatus of claim 104 or claim 111, wherein the first code and the second code are even-numbered Walsh codes.

### Claim 115 (depends on 114)

The apparatus of claim 114, wherein the first signal is generated based on at least a fourth signal generated by multiplying the first input, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the second input, the second code, and the second gain.

### Claim 116 (depends on 111)

The apparatus of claim 111, wherein the third signal is further based on a third sequence of elements.

### Claim 117 (depends on 116, 132)

The apparatus of claim 132 or claim 116, wherein the third sequence of elements is generated based on a second PN code.

### Claim 118 (depends on 116, 132)

The apparatus of claim 132 or claim 116, wherein the third sequence of elements is generated based on a spreading sequence.

### Claim 119 (depends on 116, 132)

The apparatus of claim 132 or claim 116, wherein one or more of the elements in the third sequence of elements have the first value and the remaining elements in the third sequence of elements have the second value, wherein for the (2N−1)th element in the third sequence of elements, the value of the (2N−1)th element is the same as the value of the (2N)th element in the third sequence of elements, where N is a series of sequential positive integers beginning at 1.

### Claim 120 (depends on 116, 132)

The apparatus of claim 132 or claim 116, wherein the third signal is a multiplication of the first sequence of elements and the third sequence of elements.

### Claim 121 (depends on 116, 132)

The apparatus of claim 132 or claim 116, wherein the third sequence of elements 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.

### Claim 122 (depends on 116, 132)

The apparatus of claim 132 or claim 116, wherein the third signal is a multiplication of the first sequence of elements and the third sequence of elements and 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.

### Claim 123 (depends on 122)

The apparatus of claim 122, wherein the first signal is generated based on at least a fourth signal generated by multiplying the first input, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the second input, the second code, and the second gain.

### Claim 124 (depends on 123)

The apparatus of claim 123, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for the (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of the (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 125 (depends on 124)

The apparatus of claim 124, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for the (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of the (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 126 (depends on 123)

The apparatus of claim 123, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 127 (depends on 126)

The apparatus of claim 126, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 128 (depends on 122)

The apparatus of claim 122, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for the (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of the (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 129 (depends on 128)

The apparatus of claim 128, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for the (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of the (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 130 (depends on 122)

The apparatus of claim 122, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 131 (depends on 130)

The apparatus of claim 130, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 132 (depends on 104)

The apparatus of claim 104, wherein the third signal is further based on a third sequence of elements.

### Claim 133 (depends on 132)

The apparatus of claim 132, wherein the first signal is generated based on at least a fourth signal generated by multiplying the first input, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the second input, the second code, and the second gain.

### Claim 134 (depends on 104)

The apparatus of claim 104, wherein the first signal is generated based on at least a fourth signal generated by multiplying the first input, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the second input, the second code, and the second gain.

### Claim 135 (depends on 104)

The apparatus of claim 104, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for each (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of a (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 136 (depends on 135)

The apparatus of claim 135, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for the (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of the (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 137 (depends on 104)

The apparatus of claim 104, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 138 (depends on 137)

The apparatus of claim 137, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 139 (depends on 104)

The apparatus of claim 104, wherein the second sequence of elements is a spreading sequence.

### Claim 140

A spreading method for a mobile communication device, the mobile communication device being capable of supporting one or more first input channels and one or more second input channels, the method comprising:
generating a first output, a, based on at least one or more first inputs to the one or more first input channels, one or more first codes, and one or more first gains;
generating a second output, b, based on at least one or more second inputs to the one or more second input channels, one or more second codes, and one or more second gains, wherein each of the one or more first codes is orthogonal to each of the one or more second codes;
nonrandomly generating modulated data at least based on values representing (a+jb)·(1+jP·W)·e, wherein e is a first sequence of elements, wherein some of the elements in the first sequence have a first value and the other elements in the first sequence have a second value, the first value being different from the second value, wherein W is a second sequence of elements and wherein P is a third sequence of elements.

### Claim 141 (depends on 140)

The method of claim 140, wherein the second sequence is W1.

### Claim 142 (depends on 140, 141, 170, 174)

The method of claim 140, claim 141, claim 170 or claim 174, wherein the third sequence of elements 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.

### Claim 143 (depends on 142)

The method of claim 142, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 144 (depends on 143)

The method of claim 143, further comprising
transmitting the modulated data through an antenna.

### Claim 145 (depends on 142)

The method of claim 142, further comprising
transmitting the modulated data through an antenna.

### Claim 146 (depends on 140, 141, 170, 174)

The method of claim 140, claim 141, claim 170 or claim 174, wherein P is generated based on a PN code.

### Claim 147 (depends on 140, 141, 170, 174)

The method of claim 140, claim 141, claim 170 or claim 174, wherein e is a spreading sequence.

### Claim 148 (depends on 140, 141, 170, 174)

The method of claim 140, claim 141, claim 170 or claim 174, wherein e is a PN code.

### Claim 149 (depends on 141)

The method of claim 141, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 150 (depends on 149)

The method of claim 149, further comprising
transmitting the modulated data through an antenna.

### Claim 151 (depends on 150)

The method of claim 150, wherein:
each of the one or more first codes consists of elements,
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value, and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 152 (depends on 151)

The method of claim 151, wherein:
each of the one or more second codes consists of elements,
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value, and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 153 (depends on 150)

The method of claim 150, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 154 (depends on 153)

The method of claim 153, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 155 (depends on 149)

The method of claim 149, wherein:
each of the one or more first codes consists of elements,
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value, and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 156 (depends on 155)

The method of claim 155, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value, and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 157 (depends on 149)

The method of claim 149, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 158 (depends on 157)

The method of claim 157, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 159 (depends on 141)

The method of claim 141, further comprising
transmitting the modulated data through an antenna.

### Claim 160 (depends on 159)

The method of claim 159, wherein:
each of the one or more first codes consists of elements,
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value, and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 161 (depends on 160)

The method of claim 160, wherein:
each of the one or more second codes consists of elements,
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value, and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 162 (depends on 159)

The method of claim 159, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 163 (depends on 162)

The method of claim 162, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 164 (depends on 163, 180)

The apparatus of claim 163 or claim 180, wherein the first code and the second code are even-numbered Walsh codes.

### Claim 165 (depends on 164)

The apparatus of claim 164, wherein the first signal is generated based on at least a fourth signal generated by multiplying the first input, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the second input, the second code, and the second gain.

### Claim 166 (depends on 141)

The method of claim 141, wherein:
each of the one or more first codes consists of elements,
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value, and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)thelement is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 167 (depends on 166)

The method of claim 166, wherein:
each of the one or more second codes consists of elements,
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value, and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 168 (depends on 141)

The method of claim 141, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 169 (depends on 168)

The method of claim 168, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 170 (depends on 140)

The method of claim 140, wherein the one or more first codes and the one or more second codes are even-numbered Walsh codes.

### Claim 171 (depends on 170)

The method of claim 170, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 172 (depends on 171)

The method of claim 171, further comprising
transmitting the modulated data through an antenna.

### Claim 173 (depends on 170)

The method of claim 170, further comprising
transmitting the modulated data through an antenna.

### Claim 174 (depends on 140)

The method of claim 140, wherein the (2N−1)th element in the second sequence of elements has the first value and the (2N)th element in the second sequence of elements has the second value, wherein N is a series of sequential positive integers beginning at 1.

### Claim 175 (depends on 140)

The method of claim 140, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 176 (depends on 175)

The method of claim 175, further comprising
transmitting the modulated data through an antenna.

### Claim 177 (depends on 176)

The method of claim 176, wherein:
each of the one or more first codes consists of elements,
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value, and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 178 (depends on 177)

The method of claim 177, wherein:
each of the one or more second codes consists of elements,
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value, and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 179 (depends on 176)

The method of claim 176, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 180 (depends on 179)

The method of claim 179, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 181 (depends on 175)

The method of claim 175, wherein:
each of the one or more first codes consists of elements,
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value, and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 182 (depends on 181)

The method of claim 181, wherein:
each of the one or more second codes consists of elements,
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value, and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 183 (depends on 175)

The method of claim 175, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 184 (depends on 183)

The method of claim 183, wherein the second output consists of a sequence ofpairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 185 (depends on 140)

The method of claim 140, further comprising
transmitting the modulated data through an antenna.

### Claim 186 (depends on 185)

The method of claim 185, wherein:
each of the one or more first codes consists of elements,
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value, and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 187 (depends on 186)

The method of claim 186, wherein:
each of the one or more second codes consists of elements,
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value, and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 188 (depends on 185)

The method of claim 185, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 189 (depends on 188)

The method of claim 188, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 190 (depends on 140)

The method of claim 140, wherein:
each of the one or more first codes consists of elements, wherein
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 191 (depends on 190)

The method of claim 190, wherein:
each of the one or more second codes consists of elements,
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value, and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 192 (depends on 140)

The method of claim 140, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 193 (depends on 192)

The method of claim 192, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 194

A mobile communications device, comprising:
a first output generator configured to generate a first output, a, based on at least one or more first inputs, one or more first codes, and one or more first gains;
a second output generator configured to generate a second output, b, based on at least one or more second inputs, one or more second codes, and one or more second gains, wherein each of the one or more first codes is orthogonal to each of the one or more second codes; and
an output generator configured to nonrandomly generate modulated data at least based on values representing (a+jb)·(1+jP·W)·e, wherein e is a first sequence of elements, wherein some of the elements in the first sequence have a first value and the other elements in the first sequence have a second value, the first value being different from the second value, wherein W is a second sequence of elements and wherein P is a third sequence of elements.

### Claim 195 (depends on 194)

The apparatus of claim 194, wherein the second sequence of elements is W1.

### Claim 196 (depends on 194, 195, 209, 211)

The apparatus of claim 194, claim 195, claim 209, or claim 211, wherein the third sequence of elements 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.

### Claim 197 (depends on 194, 195, 209, 211)

The apparatus of claims 194, claim 195, claim 209, or claim 211, wherein P is generated based on a PN code.

### Claim 198 (depends on 194, 195, 209, 211)

The apparatus of claim 194, claim 195, claim 209, or claim 211, wherein e is a spreading sequence.

### Claim 199 (depends on 194, 195, 209, 211)

The apparatus of claim 194, claim 195, claim 209, or claim 211, wherein e is a PN code.

### Claim 200 (depends on 195)

The apparatus of claim 195, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 201 (depends on 200)

The apparatus of claim 200, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 202 (depends on 201)

The apparatus of claim 201, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 203 (depends on 200)

The apparatus of claim 200, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 204 (depends on 203)

The apparatus of claim 203, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 205 (depends on 195)

The apparatus of claim 195, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 206 (depends on 205)

The apparatus of claim 205, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 207 (depends on 195)

The apparatus of claim 195, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 208 (depends on 207)

The apparatus of claim 207, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 209 (depends on 194)

The apparatus of claim 194, wherein the one or more first codes and the one or more second codes are even-numbered Walsh codes.

### Claim 210 (depends on 209)

The apparatus of claim 209, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 211 (depends on 194)

The apparatus of claim 194, wherein the (2N−1)th element in the second sequence of elements has the first value and the (2N)th element in the second sequence of elements has the second value, wherein N is a series of sequential positive integers beginning at 1.

### Claim 212 (depends on 211)

The apparatus of claim 211, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 213 (depends on 211)

The apparatus of claim 211, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 214 (depends on 213)

The apparatus of claim 213, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 215 (depends on 211)

The apparatus of claim 211, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 216 (depends on 215)

The apparatus of claim 215, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 217 (depends on 194)

The apparatus of claim 194, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 218 (depends on 217)

The apparatus of claim 217, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 219 (depends on 218)

The apparatus of claim 218, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 220 (depends on 217)

The apparatus of claim 217, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 221 (depends on 220)

The apparatus of claim 220, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 222 (depends on 194)

The apparatus of claim 194, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 223 (depends on 222)

The apparatus of claim 222, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 224 (depends on 194)

The apparatus of claim 194, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 225 (depends on 224)

The apparatus of claim 224, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 226

A spreading method for a mobile communication device, the mobile communication device being capable of spreading one or more first inputs and one or more second inputs to a plurality of channels, the method comprising:
generating a first output, a, based on at least the one or more first inputs, one or more first codes, and one or more first gains;
generating a second output, b, based on at least the one or more second inputs, one or more second codes, and one or more second gains, wherein each of the one or more first codes is orthogonal to each of the one or more second codes;
receiving a first sequence of elements, W;
receiving a second sequence of elements, P; and
nonrandomly outputting (a+jb)·(1+jP·W).

### Claim 227 (depends on 226)

The method of claim 226, wherein the first sequence of elements is W1.

### Claim 228 (depends on 226, 227, 252)

The method of claim 226, claim 227, or claim 252, wherein the second sequence of elements consists of a sequence of groups, wherein each of the groups consists of either two elements both having a first value or two elements both having a second value and wherein the first value is different from the second value.

### Claim 229 (depends on 228)

The method of claim 228, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 230 (depends on 229)

The method of claim 229, further comprising:
generating a modulated signal using the outputted (a+jb)·(1+jP·W); and
transmitting the modulated signal through an antenna.

### Claim 231 (depends on 230)

The method of claim 230, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 232 (depends on 231)

The method of claim 231, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 233 (depends on 230)

The method of claim 230, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 234 (depends on 233)

The method of claim 233, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 235 (depends on 228)

The method of claim 228, further comprising:
generating a modulated signal using the outputted (a+jb)·(1+jP·W); and
transmitting the modulated signal through an antenna.

### Claim 236 (depends on 226, 227, 252, 256)

The method of claim 226, claim 227, claim 252 or claim 256, wherein P is generated based on a PN code.

### Claim 237 (depends on 238)

The method of claim 238, further comprising:
generating a modulated signal using the outputted (a+jb)·(1+jP·W); and
transmitting the modulated signal through an antenna.

### Claim 238 (depends on 227)

The method of claim 227, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 239 (depends on 238)

The method of claim 238, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 240 (depends on 239)

The method of claim 239, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 241 (depends on 238)

The method of claim 238, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 242 (depends on 241)

The method of claim 241, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 243 (depends on 227)

The method of claim 227, further comprising:
generating a modulated signal using the outputted (a+jb)·(1+jP·W); and
transmitting the modulated signal through an antenna.

### Claim 244 (depends on 243)

The method of claim 243, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 245 (depends on 244)

The method of claim 244, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 246 (depends on 243)

The method of claim 243, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 247 (depends on 246)

The method of claim 246, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 248 (depends on 227)

The method of claim 227, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 249 (depends on 248)

The method of claim 248, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 250 (depends on 227)

The method of claim 227, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 251 (depends on 250)

The method of claim 250, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 252 (depends on 226)

The method of claim 226, wherein the one or more first codes and the one or more second codes are even-numbered Walsh codes.

### Claim 253 (depends on 252)

The method of claim 252, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 254 (depends on 253)

The method of claim 253, further comprising:
generating a modulated signal using the outputted (a+jb)·(1+jP·W); and
transmitting the modulated signal through an antenna.

### Claim 255 (depends on 252)

The method of claim 252, further comprising:
generating a modulated signal using the outputted (a+jb)·(1+jP·W); and
transmitting the modulated signal through an antenna.

### Claim 256 (depends on 226)

The method of claim 226, wherein the (2N-1)th element in the first sequence of elements has a first value and the (2N)th element in the first sequence of elements has a second value, wherein the first value is different from the second value and wherein N is a series of sequential positive integers beginning at 1.

### Claim 257 (depends on 226)

The method of claim 226, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 258 (depends on 257)

The method of claim 257, further comprising:
generating a modulated signal using the outputted (a+jb)·(1+jP·W); and
transmitting the modulated signal through an antenna.

### Claim 259 (depends on 258)

The method of claim 258, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 260 (depends on 259)

The method of claim 259, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 261 (depends on 258)

The method of claim 258, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 262 (depends on 261)

The method of claim 261, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 263 (depends on 257)

The method of claim 257, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 264 (depends on 263)

The method of claim 263, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 265 (depends on 257)

The method of claim 257, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 266 (depends on 265)

The method of claim 265, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 267 (depends on 226)

The method of claim 226, further comprising:
generating a modulated signal using the outputted (a+jb)·(1+jP·W); and
transmitting the modulated signal through an antenna.

### Claim 268 (depends on 267)

The method of claim 267, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 269 (depends on 268)

The method of claim 268, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 270 (depends on 267)

The method of claim 267, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 271 (depends on 270)

The method of claim 270, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 272 (depends on 226)

The method of claim 226, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 273 (depends on 272)

The method of claim 272, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 274 (depends on 226)

The method of claim 226, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 275 (depends on 274)

The method of claim 274, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 276

A spreading apparatus, comprising:
a first output generator configured to generate a first output, a, based on at least one or more first inputs, one or more first codes, and one or more first gains;
a second output generator configured to generate a second output, b, based on at least one or more second inputs, one or more second codes, and one or more second gains, wherein each one of the one or more first codes are orthogonal to each one of the one or more second codes;
a first sequence receiving unit configured to receive a first sequence of elements, W;
a second sequence receiving unit configured to receive a second sequence of elements, P; and
an output unit configured to nonrandomly output (a+jb)·(1+jP·W).

### Claim 277 (depends on 276)

The apparatus of claim 276, wherein the first sequence of elements is W1.

### Claim 278 (depends on 276, 277, 290)

The apparatus of claim 276, claim 277, or claim 290, wherein the second sequence consists of a sequence of groups, wherein each of the groups consists of either two elements both having a first value or two elements both having a second value and wherein the first value is different from the second value.

### Claim 279 (depends on 278)

The apparatus of claim 278, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 280 (depends on 279)

The apparatus of claim 279, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 281 (depends on 280)

The apparatus of claim 280, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 282 (depends on 279)

The apparatus of claim 279, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 283 (depends on 282)

The apparatus of claim 282, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 284 (depends on 276, 277, 290, 292)

The apparatus of claim 276, claim 277, claim 290 or claim 292, wherein P is generated based on a PN code.

### Claim 285 (depends on 277)

The apparatus of claim 277, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 286 (depends on 277)

The apparatus of claim 277, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 287 (depends on 286)

The apparatus of claim 286, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 288 (depends on 277)

The apparatus of claim 277, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 289 (depends on 288)

The apparatus of claim 288, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 290 (depends on 276)

The apparatus of claim 276, wherein the one or more first codes and the one or more second codes are even-numbered Walsh codes.

### Claim 291 (depends on 290)

The apparatus of claim 290, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 292 (depends on 276)

The apparatus of claim 276, wherein the (2N−1)th element in the first sequence of elements has a first value and the (2N)th element in the first sequence of elements has a second value, wherein the first value is different from the second value and wherein N is a series of sequential positive integers beginning at 1.

### Claim 293 (depends on 292)

The apparatus of claim 292, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 294 (depends on 293)

The apparatus of claim 293, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 295 (depends on 292)

The apparatus of claim 292, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 296 (depends on 295)

The apparatus of claim 295, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 297 (depends on 276)

The apparatus of claim 276, wherein:
the first output is generated based on summing one or more first multiplications, each first multiplication generated by multiplying one of the one or more first inputs, one of the one or more first codes, and one of the one or more first gains; and
the second output is generated based on summing one or more second multiplications, each second multiplication generated by multiplying one of the one or more second inputs, one of the one or more second codes, and one of the one or more second gains.

### Claim 298 (depends on 297)

The apparatus of claim 297, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 299 (depends on 298)

The apparatus of claim 298, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 300 (depends on 297)

The apparatus of claim 297, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 301 (depends on 300)

The apparatus of claim 300, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 302 (depends on 276)

The apparatus of claim 276, wherein:
each of the one or more first codes consists of elements;
for each of the one or more first codes, one or more of the elements in the respective first code have the first value and the remaining elements have the second value; and
for the (2M−1)th element of each of the one or more first codes, the value of the (2M−1)th element is the same as the value of the (2M)th element, where M is a series of sequential positive integers beginning at 1.

### Claim 303 (depends on 302)

The apparatus of claim 302, wherein:
each of the one or more second codes consists of elements;
for each of the one or more second codes, one or more of the elements in the respective second code have the first value and the remaining elements have the second value; and
for the (2K−1)th element of each of the one or more second codes, the value of the (2K−1)th element is the same as the value of the (2K)th element, where K is a series of sequential positive integers beginning at 1.

### Claim 304 (depends on 276)

The apparatus of claim 276, wherein the first output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 305 (depends on 304)

The apparatus of claim 304, wherein the second output consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 306

An apparatus for wireless communications, comprising:
means for generating a first signal, a, based on at least a first input, a first code, and a first gain;
means for generating a second signal, b, based on at least a second input, a second code, and a second gain; and
means for nonrandomly generating modulated data at least based on values representing e·a-e·b·d and e·b+e·a·d, wherein d is a third signal based on at least a first sequence of elements, wherein the elements in the first sequence of elements nonrandomly alternate between a first value and a second value, the first value being different from the second value, wherein e is a second sequence of elements, wherein some of the elements in the second sequence have the first value and the other elements in the second sequence have the second value.

### Claim 307 (depends on 306)

The apparatus of claim 306, wherein the first sequence of elements is W1.

### Claim 308 (depends on 307)

The apparatus of claim 307, wherein the first signal is generated based on at least a fourth signal generated by multiplying the first input, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the second input, the second code, and the second gain.

### Claim 309 (depends on 307)

The apparatus of claim 307, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for each (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of a (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 310 (depends on 309)

The apparatus of claim 309, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for each (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of a (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 311 (depends on 307)

The apparatus of claim 307, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 312 (depends on 311)

The apparatus of claim 311, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 313 (depends on 306)

The apparatus of claim 306, wherein the second sequence is a first PN code.

### Claim 314 (depends on 313)

The apparatus of claim 313, wherein the first sequence of elements is W1.

### Claim 315 (depends on 306, 313)

The apparatus of claim 306 or claim 313, wherein the first code and the second code include Walsh codes.

### Claim 316 (depends on 313)

The apparatus of claim 313, wherein the third signal is further based on a third sequence and the first code is orthogonal to the second code.

### Claim 317 (depends on 316, 332)

The apparatus of claim 332 or claim 316, wherein the third sequence is generated based on a second PN code.

### Claim 318 (depends on 316, 332)

The apparatus of claim 332 or claim 316, wherein the third sequence is generated based on a spreading sequence.

### Claim 319 (depends on 316, 332)

The apparatus of claim 332 or claim 316, 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 the (2N−1)th element in the third sequence, the value of the (2N−1)th element is the same as the value of the (2N)th element, where N is a series of sequential positive integers beginning at 1.

### Claim 320 (depends on 316, 332)

The apparatus of claim 332 or claim 316, wherein the third signal is a multiplication of the first sequence and the third sequence.

### Claim 321 (depends on 316, 332)

The apparatus of claim 332 or claim 316, 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.

### Claim 322 (depends on 316, 332)

The apparatus of claim 332 or claim 316, wherein the third signal is a multiplication of the first sequence and the third sequence and 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.

### Claim 323 (depends on 322)

The apparatus of claim 322, wherein the first signal is generated based on at least a fourth signal generated by multiplying the first input, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the second input, the second code, and the second gain.

### Claim 324 (depends on 323)

The apparatus of claim 323, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for each (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of a (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 325 (depends on 324)

The apparatus of claim 324, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for each (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of a (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 326 (depends on 323)

The apparatus of claim 323, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 327 (depends on 326)

The apparatus of claim 326, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 328 (depends on 322)

The apparatus of claim 322, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for each (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of a (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 329 (depends on 328)

The apparatus of claim 328, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for each (2K−1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of a (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 330 (depends on 322)

The apparatus of claim 322, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 331 (depends on 330)

The apparatus of claim 330, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 332 (depends on 306)

The apparatus of claim 306, wherein the third signal is further based on a third sequence and the first code is orthogonal to the second code.

### Claim 333 (depends on 332)

The apparatus of claim 332, wherein the first signal is generated based on at least a fourth signal generated by multiplying the first input, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the second input, the second code, and the second gain.

### Claim 334 (depends on 306)

The apparatus of claim 306, wherein the first signal is generated based on at least a fourth signal generated by multiplying the first input, the first code, and the first gain, and the second signal is generated based on at least a fifth signal generated by multiplying the second input, the second code, and the second gain.

### Claim 335 (depends on 306)

The apparatus of claim 306, wherein the first code consists of elements, one or more of the elements of the first code having the first value and the remaining elements of the first code having the second value, wherein for each (2M−1)th element of the first code, the value of the (2M−1)th element of the first code is the same as the value of a (2M)th element of the first code, where M is a series of sequential positive integers beginning at 1.

### Claim 336 (depends on 335)

The apparatus of claim 335, wherein the second code consists of elements, one or more of the elements of the second code having the first value and the remaining elements of the second code having the second value, wherein for each (2K·1)th element of the second code, the value of the (2K−1)th element of the second code is the same as the value of a (2K)th element of the second code, where K is a series of sequential positive integers beginning at 1.

### Claim 337 (depends on 306)

The apparatus of claim 306, wherein the first signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 338 (depends on 337)

The apparatus of claim 337, wherein the second signal consists of a sequence of pairs of elements, wherein each pair of elements consists of two elements both having a same value.

### Claim 339 (depends on 306)

The apparatus of claim 306, wherein the second sequence of elements is a spreading sequence.