Orthotope sphere decoding method and apparatus for signal reconstruction in multi-input multi-output antenna system
View Patent ↗An orthotope sphere decoding method of a multiple antenna system is disclosed. The method includes performing tree search using a depth-first method by performing an OC-test on the nodes on which the tree search of orthotope sphere decoding will be performed and performing an SC-test on nodes passing the OC-test; and selecting a transmission symbol having a smallest PED value as a final signal as a result of the search.
1. An orthotope sphere decoding method of a multiple antenna system, the method comprising:
performing tree search using a depth-first method by performing an OC-test on nodes on which the tree search of orthotope sphere decoding will be performed and performing an SC-test on nodes passing the OC-test; and
selecting a transmission symbol having a smallest Partial Euclidean Distance (PED) value as a final signal as a result of the search,
wherein
the OC-test checks whether
Δ
(
s
k
)
≤
C
·
δ
k
for
k
=
1
,
…
,
N
,
where S k is a k-th component of vector S of a node, and C is a constant, and
wherein
the SC-test checks whether
d
k
=
∑
i
=
k
N
q
1
2
≤
C
,
where d k is a square root of the PED at the k-th level (1≦k≦N), q i is the i-th component of q=R(x−s), and R is an upper triangular matrix in QR decomposition of a matrix H.
2. The orthotope sphere decoding method according to claim 1 , wherein, in performing tree search, a group having a smaller O-metric value is first searched among the nodes on which the tree search will be performed and a node having a smaller PED value is first searched among the nodes in the group having a smaller O-metric value, and
wherein a O-metric value (Δ(s k )) is obtained by
Δ
(
s
k
)
=
max
{
-
❘
,
-
}
,
where X i is a pertinent orthotope square, is real number part of S k is imaginary number part of S k , is real number part of X k , and is imaginary number part of X k .
3. The orthotope sphere decoding method according to claim 2 , wherein the performing tree search comprises:
calculating an O-metric value of each child node of a node determined as a target of the tree search and grouping the child nodes according to the O-metric value;
calculating a PED value of each child node belonging to a group having a smallest O-metric value and searching each node in order of increasing PED value; and
continuing the tree search for a group of next priority in the depth-first method by repeating the grouping according to the O-metric value, calculating a PED value and performing the tree search.
4. The orthotope sphere decoding method according to claim 3 , wherein the OC-test is a test to determine whether a certain node is inside an orthotope sphere.
5. The orthotope sphere decoding method according to claim 1 , wherein a constrained width of an orthotope sphere and a constrained radius of a hyper-sphere for performing the OC-test and the SC-test are maintained until the tree search arrives at a leaf node from a root node, and are updated with new values whenever the tree search arrives at the leaf node.
6. An orthotope sphere decoding apparatus of a multiple antenna system, the apparatus comprising:
a tree search unit configured to perform tree search using a depth-first method by performing an OC-test on nodes on which the tree search of orthotope sphere decoding will be performed and performing an SC-test on nodes passing the OC-test; and
a selection unit configured to select a transmission symbol having a smallest Partial Euclidean Distance (PED value as a final signal as a result of the search,
wherein
the OC-test is configured to check whether
Δ
(
s
k
)
≤
C
·
δ
k
for
k
=
1
,
…
,
N
,
where S k is a k-th component of vector S of a node, and C is a constant, and
wherein
the SC-test is configured to check whether
d
k
=
∑
i
=
k
N
q
1
2
≤
C
,
where d k is a square root of the PED at the k-th level (1≦k≦N), q i is the i-th component of q=R(x−s), and R is an upper triangular matrix in QR decomposition of a matrix H.
7. The orthotope sphere decoding apparatus according to claim 6 , wherein the tree search unit is configured to search a group having a smaller O-metric value first among the nodes on which the tree search will be performed, and search a node having a smaller PED value first among the nodes in the group having a smaller O-metric value, and
wherein a O-metric value (Δ(s k )) is obtained by
Δ
(
s
k
)
=
max
{
-
❘
,
-
}
,
where X k is a pertinent orthotope square, is real number part of S k , is imaginary number part of S k , is real number part of X k , and is imaginary number part of X k .
8. The orthotope sphere decoding apparatus according to claim 6 , wherein the tree search unit includes:
a grouping unit configured to group child nodes according to an O-metric value of each child node of a node determined as a target of the tree search;
an OC-test execution unit configured to calculate the O-metric value;
an SC-test execution unit configured to calculate a PED value; and
a control unit configured to perform the tree search using the depth-first method, by
controlling the grouping unit, the OC-test execution unit and the SC-test execution unit to calculate a PED value of each child node belonging to a group having a smallest O-metric value, search each node in order of increasing PED value and repeat the grouping according to the O-metric value,
calculating a PED value, and
performing the tree search for a group of next priority.
9. The orthotope sphere decoding apparatus according to claim 6 , wherein the OC-test is a test to determine whether a certain node is inside an orthotope sphere.
10. The orthotope sphere decoding apparatus according to claim 6 , wherein a constrained width of an orthotope sphere and a constrained radius of a hyper-sphere for performing the OC-test and the SC-test are maintained until the tree search arrives at a leaf node from a root node, and are updated with new values whenever the tree search arrives at the leaf node.