Orthogonal complex spreading method for multichannel and apparatus thereof
Abstract
An orthogonal complex spreading method for a multichannel and an apparatus thereof are disclosed. The method includes the steps of complex-summing α n1 W M,n1 X n1 which is obtained by multiplying an orthogonal Hadamard sequence W M,n1 by a first data X n1 of a n-th block and α n2 W M,n2 X n2 which is obtained by multiplying an orthogonal Hadamard sequence W 1,n2 by a second data X n2 of a n-th block; complex-multiplying α n1 W M,n1 X n1 +jα n2 W M,n2 X n2 which is summed in the complex type and W M,n3 +jPW M,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
exact text as granted — not AI-modifiedWhat is claimed is:
1 . An orthogonal complex spreading method for multiple channels, comprising the steps of: complex-summing W M,n1 X n1 , which is obtained by multiplying an orthogonal code sequence W M,n1 by first data group X n1 of a n-th block, and W M,n2 X n2 , which is obtained by multiplying an orthogonal code sequence W M,n2 by second data group X n2 of a n-th block, M and n being positive integers; complex-multiplying the complex summed form of W M,n1 X n1+ j W M,n2 X n2 , complex form of W M,n3 +jW M,n4 and outputting (W M,n1 X n1 +j W M,n2 X n2 )×(W M,n3 +jW M,n4 ) as an output signal; and summing in-phase and quadrature phase parts of the output signal outputted from a plurality of blocks as
(
∑
n
=
1
K
(
(
W
M
,
n
1
X
n
1
+
j
W
M
,
n
2
)
×
(
W
M
,
n
3
+
j
W
M
,
,
n
4
)
)
)
,
K is a predetermined integer greater than or equal to 1 to generate I channel and Q channel signal.
2 . The method of claim 1 wherein a spreading code spreads the summed in-phase and quadrature-phase signals outputted from the summing step.
3 . The method of claim 1 wherein said orthogonal code sequence includes a Hadamard code sequence.
4 . The method of claim 1 wherein said orthogonal code sequence includes a Walsh code.
5 . The method of claim 2 wherein said spreading code is one spreading code.
6 . The method of claim 5 wherein said spreading code sequence includes a PN code.
7 . The method of claim 5 wherein said spreading code includes a first spreading code for the in-phase signal and a second spreading code for the quadrature-phase signal.
8 . The method of claim 7 wherein the first and second spreading codes are PN codes.
9 . The method of claim 3 wherein W M,11 =W 0 , W M,12 =W 2 , and W M,13 =W 0 , W M,14 =W 1 , when M=4.
10 . The method of claim 9 wherein M=8 and W M,12 =W 4 .
11 . The method of claim 3 wherein W M,n1 =W 0 , W M,n2 =W 2p , where p represents a predetermined number in a range from 0 to (M/2)−1, and W M,n3 =W 2n-2 , W M,n4 =W 2n-1 .
12 . The method of claim 3 wherein W M,21 =W O , W M,22 =W 4 , W M,23 =W 2 , W M,24 =W 3 when M=8 in case of two channels.
13 . The method of claim 12 wherein W M,12 =W 6 , and W M,22 =W 6 .
14 . An orthogonal complex spreading apparatus, comprising:
a plurality of complex multiplication blocks, each for complex-multiplexing a complex signal W M,n1 X n1 +jW M,n2 X n2 by W M,n3 +jW M,n4 wherein W M,n1 X n1 is obtained by multiplying an orthogonal code sequence W M,n1 by first data group X n1 of n-th block and W M,n2 X n2 obtained by multiplying orthogonal sequence W M,n2 by second data group X n2 of the n-th block, wherein M and n are positive integers and W M,n1 , W M,n2 , W M,n3 and W M,n4 are predetermined orthogonal sequences; and a summing unit for summing in-phase and quadrature phase parts of an output signal from each block of the plurality of the complex multiplication blocks as
(
∑
n
=
1
K
(
(
a
n
1
W
M
,
n
1
X
n
1
+
j
α
n
2
W
M
,
n
2
X
n
2
)
×
(
W
M
,
n
3
+
j
W
M
,
,
n
4
)
)
)
,
K is a predetermined integer greater than or equal to 1.
15 . The apparatus of claim 14 further comprising a spreading unit for multiplying the summed in-phase and quadrature phase signals inputted from the summing unit by spreading code.
16 . The apparatus of claim 15 wherein said spreading unit multiplies the in-phase and quadrature phase part by different spreading codes.
17 . The apparatus of claim 14 wherein each said complex multiplication block includes:
a first multiplier for multiplying the first data group X n1 by the orthogonal code sequence W M,n1 ;
a second multiplier for multiplying the second data group X n2 by the orthogonal code sequence W M,n2 ;
third and fourth multipliers for multiplying the output signal W M,n1 X n1 from the first multiplier and the output signal W M,n2 X n2 from the second multiplier by orthogonal code sequence W M,n3 ;
fifth and sixth multipliers for multiplying the output signal W M,n1 X n1 from the first multiplier and the Output signal W M,n2 X n2 from the second multiplier by orthogonal code sequence W M,n4 ;
a first adder for subtracting output signal from the sixth multiplier from output signal (ac) from the third multiplier and outputting an in-phase information; and
a second adder for summing output signal from the fourth multiplier and output signal from the fifth multiplier 20 and outputting quadrature phase information.
18 . The apparatus of claim 17 wherein said orthogonal code sequence includes a Hadamard code sequence.
19 . The apparatus of claim 17 wherein said orthogonal code sequence includes a Walsh code.
20 . A permuted orthogonal complex spreading method for multiple channels allocating at least two input channels to first and second groups, comprising the steps of:
multiplying a predetermined orthogonal code sequence W M,n1 by first data group X n1 ; multiplying orthogonal code sequence W M,n2 by second data group X n2 ; summing output signals W M,n1 X n1 , and W M,n2 X n2 in the complex form of
∑
n
=
1
K
(
W
M
,
n
1
X
n
1
+
j
W
M
,
n
2
X
n
2
)
;
and
complex-multiplying the received output signal
∑
n
=
1
K
(
W
M
,
n
1
X
n
1
+
j
W
M
,
n
2
X
n
2
)
by
(
W
M
,
1
+
j
PW
M
,
Q
)
wherein P is a predetermined sequence, and W M,1 and W M,Q are orthogonal code sequences.
21 . The method of claim 20 wherein the spreading code is a PN code.
22 . The method of claim 20 wherein P represents said predetermined sequence or predetermined spreading code or predetermined integer configured so that two consecutive 55 sequences have identical values.
23 . The method of claim 20 wherein said orthogonal code sequence includes a Hadamard code sequence.
24 . The method of claim 20 wherein said orthogonal code sequence includes a Walsh code.
25 . The method of claim 23 wherein W M,1 =W 0 , W M,Q =W 2q+1 (where q represents a predetermined number in a range from 0 to (M/2)−1).
26 . The method of claim 23 further comprising the steps of:
multiplying the first data group X n1 by gain a n1 ; and
multiplying the second data group X n2 by gain a n2 .
27 . The method of claim 23 wherein W M,11 =W 0 , W M,12 =W 2 , and W M,1 =W 0 , W M,Q =W 1 , when M=4.
28 . The method of claim 27 wherein M=8 and W M,12 =W 4 .
29 . The method of claim 23 wherein W M,n1 =W 0 , W M,n2 =W 2q=1 , wherein q represents a predetermined number in a range from 0 to (M/2)−1 and W M,1 =W 0 , W M,Q =W 1 .
30 . The method of claim 20 wherein each group has at least two channels and the receiving step includes the steps of:
summing output signals W M,n1 X n1 from a first sequence multiplier; and
summing output signals W M,n2 X n2 from a second sequence multiplier.
31 . A permuted orthogonal complex spreading apparatus for multiple channels, allocating at least two input channels to first and second groups, comprising:
a first multiplier block having at least one channel contained in a first group of channels, each for outputting W M,n1 X n1 which is obtained by multiplying first data group X n1 by orthogonal code sequence W M,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 W M,n2 X n1 which is obtained by multiplying a first data group X n2 by orthogonal code sequence W M,n2 ; a complex multiplier for receiving the output signals from the first and the second multiplier blocks in a complex form of
∑
n
=
1
K
(
W
M
,
n
1
X
n
1
+
j
W
M
,
n
2
X
n
2
)
and complex-multiplying received output signal by W M,1 +jPW M,Q , wherein W M,1 and W M,Q are predetermined orthogonal code sequence permuted and P is a predetermined sequence.
32 . The apparatus of claim 31 wherein said orthogonal code sequence includes a Hadamard code sequence.
33 . The apparatus of claim 31 wherein said orthogonal code sequence includes a Walsh code.
34 . The apparatus of claim 32 wherein W M,11 =W 0 , W M,12 =W 4 , W M,21 =W 2 , and W M,1 =W 0 , W M,Q =W 1 , when M=8 in case of three input channels.
35 . The apparatus of claim 32 wherein W M,11 =W 0 , W M,12 =W 2 , and W M,1 =W 0 , W M,Q =W 1 in case of three input channels.
36 . The apparatus of claim 32 wherein W M,11 =W 0 , W M,12 =W 4 , W M,21 =W 2 , W M,31 =W 6 , and W M,1 =W 0 , W M,Q =W 1 in case of four input channels.
37 . The apparatus of claim 32 wherein W M,11 =W 0 , W M,12 =W 4 , W M,31 =W 2 , W M,1 =W O , W M,Q =W 1 , and W M,21 =W 8 in case of four input channels.
38 . The apparatus of claim 32 wherein W M,11 =W 0 , W M,12 =W 4 , W M,21 =W 2 , W M,31 =W 6 , W M,22 =W 1 , and W M,1 W 0 , W M,Q =W 1 in case of five input channels.
39 . The apparatus of claim 32 wherein W M,n1 =W 0 , W M,12 =W 4 , W M,21 =W 2 , W M,31 =W 6 , W M,22 =W 3 , and W M,1 =W 0 , W M,Q =W 1 in case of five channels.
40 . The apparatus of claim 31 wherein W M,11 =W 0 , W M,12 =W 4 , W M,31 W 2 , W M,22 =W 6 , and W M,1 =W 0 , W M,Q =W 1 and W M,21 =W 8 in case of five input channels.
41 . The apparatus of claim 36 wherein W 0 X 11 +jW 4 X 12 , W 2 X 21 and W 6 X 31 are replaced by a 11 W 0 X 11 +ja 12 W 4 X 12 , a 21 W 2 X 21 and a 31 W 6 X 31 , and a gain a n1 and a gain a n2 are the identical gain in order to remove the phase dependency by an interference occurring in a multipath of a self signal and an interference occurring by other users.
42 . The apparatus of claim 31 wherein W M,n1 =W 0 , W M,n2 =W 2 , and W M,1 =W 0 , W M,Q =W 1 .
43 . The apparatus of claim 31 wherein the first multiplier block comprises at least a third multiplier for multiplying the first data group X n1 by gain a n1 , and the second multiplier block comprises at least a fourth multiplier the second data group X n2 by gain a n2 .
44 . The apparatus of claim 31 wherein W M,11 =W 0 , W M,12 =W 4/1 , and W M,1 =W 0 , W M,Q =W 1/4 , when M=8 in case of two input channels.
45 . The apparatus of claim 32 wherein W M,11 =W 0 , W M,12 =W 4/1 , W M,21 =W 2 , and W M,1 =W 0 , W M,Q =W 1/4 , when M=8 in case of three input channels.
46 . The method of claim 32 wherein W M,11 =W 0 , W M,12 =W 2/1 , and W M,1 =W 0 , W M,Q =W 1/2 when M=8 in case of two input channels.
47 . The apparatus of claim 32 wherein W M,11 =W 0 , W M,12 =W 2/1 , W M,21 =W 4 , and W M,1 =W 0 , W M,Q =W 1/2 , when M=8 in case of three input channels.
48 . The apparatus of claim 31 wherein each group has at least the two input channels, further comprising;
a first adder for outputting
∑
n
=
1
K
(
W
M
,
n
1
X
n
1
)
by summing output signals form the first multiplier block; and
a second adder for outputting
∑
n
=
1
K
(
W
M
,
n
2
X
n
2
)
by summing output signals form the second multiplier block.
49 . The apparatus of claim 31 further comprising: a spreading unit for multiplying the signal
∑
n
=
1
K
(
W
M
,
n
1
X
n
1
+
j
W
M
,
n
2
X
n
2
)
Received by the complex multiplier by a spreading code.
50 . The apparatus of claim 49 wherein the spreading unit respectively multiplies the in-phase and quadrature-phase parts by different spreading codes.
51 . The apparatus of claim 31 wherein W M,n1 , W M,n2 , W M,1 , and W M,Q are orthogonal Hadamard sequences.
52 . The apparatus of claim 31 wherein the complex multiplier includes:
fifth and sixth multipliers for multiplying said output signal from the first multiplier block and said output signal from the second sequence multiplier by orthogonal sequence W M,1 ;
seventh and eighth multipliers for multiplying said output signal from the first multiplier block and output signal a n2 W M,n2 X n2 from the second multiplier block by orthogonal sequence W M,Q ;
a third adder for subtracting output signal from the eighth multiplier from output signal from the fifth multiplier to output an in-phase information; and
a second adder for summing output signal from the sixth multiplier and output signal from the seventh multiplier to output quadrature-phase information.
53 . A permuted orthogonal complex spreading apparatus for multiple channels, allocating at least two input channels into first and second groups, comprising:
first and second multiplier blocks for respectively multiplying first and second data group X n1 , and X n2 with a set of predetermined orthogonal sequences W M,n1 , and W M,n2 to output W M,n1 X n1 and W M,n2 X n2 ; a complex multiplier for receiving the output signals W M,n1 X n1 and W M,n2 X n2 from the first and the second multiplier blocks in the complex form of
∑
n
=
1
K
(
W
M
,
n
1
X
n
1
+
j
W
M
,
n
2
X
n
2
)
and multiplying a received signal
∑
n
=
1
K
(
W
M
,
n
1
X
n
1
+
j
W
M
,
n
2
X
n
2
)
by a predetermined sequence (W M,1 +jPW M,Q )×SC, wherein W M,1 , W M,Q are predetermined orthogonal sequences, P is a predetermined sequence and SC is a spreading sequence.
54 . The apparatus of claim 53 wherein each group has at least two input channels, further comprising:
a first adder for outputting
∑
n
=
1
K
(
W
M
,
n
1
X
n
1
)
by summing output signals from the first sequence multiplier; and
a second adder for outputting
∑
n
=
1
K
(
W
M
,
n
2
X
n
2
)
by summing output signals form the second sequence multiplier.
55 . The apparatus of claim 53 wherein the first sequence multiplier comprises at least one first gain multiplier for multiplying the data X n,1; of each channel of the first group by gain a n1 , and the second sequence multiplier comprises at least one second gain multiplier for multiplying the data X n2 of each channel of the second group by gain a n2 .
56 . The apparatus of claim 53 wherein W M,n1 =W 0 , W M,n2 W 2p , and W M,1, =W 0 , W M,Q =W 1 , where p represents a predetermined integer in a range from 0 to (M/2)−1.
57 . The apparatus of claim 53 wherein W M,n1 , W M,n2 , W M,1, and W M,Q are orthogonal Hadamard sequences.Join the waitlist — get patent alerts
Track US2014126611A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.