-
公开(公告)号：KR1020100085326A
公开(公告)日：2010-07-29
申请号：KR1020090004541
申请日：2009-01-20
Applicant: 인하대학교 산학협력단
CPC classification number: H04L25/03242 , H04B7/0413 , H04L2025/03414 , H04L2025/03426
Abstract: PURPOSE: A signal detecting method for a multiple antenna system of a spatial multiplexing mode is provided to detect a signal by using QRD-M algorithm in which the upper limit and lower limit of complexity are limited. CONSTITUTION: If an accumulated matrix of saved branches is not higher than BabaiDist(S125), it is checked whether i=Ns or not(S130). If i=Ns and the number of residual branch is 1(S135), a Babai point is recognized as the best year(S140). If the accumulated matrix of saved branches is higher than BabaiDist, branches with higher matrix are removed. The residual branch is arranged on the basis of the accumulation matrix(S160). The best branch is saved as a solution of the ULBC (Upper-Lower Bounded-Complexity) QRD-M algorithm.
Abstract translation: 目的：提供一种空间复用模式多天线系统的信号检测方法，通过使用复杂度上限和下限有限的QRD-M算法来检测信号。 构成：如果保存的分支的累积矩阵不高于BabaiDist（S125），则检查是否i = Ns（S130）。 如果i = Ns，剩余分支数为1（S135），则将Babai点识别为最佳年（S140）。 如果保存的分支的累积矩阵高于BabaiDist，则删除具有较高矩阵的分支。 剩余分支基于累积矩阵排列（S160）。 最佳分支被保存为ULBC（上下界复杂度）QRD-M算法的解决方案。
-
公开(公告)号：KR101020301B1
公开(公告)日：2011-03-07
申请号：KR1020090004541
申请日：2009-01-20
Applicant: 인하대학교 산학협력단
CPC classification number: H04L25/03242 , H04B7/0413 , H04L2025/03414 , H04L2025/03426
Abstract: 본 발명은 공간 다중화 방식의 다중 안테나 시스템을 위한 신호 검출 방법에 관한 것으로서, 보다 구체적으로는 신호를 수신하는 단계, QRD-M(QR-decomposition with M) 알고리즘에 대한 복잡도의 상한 및 하한을 제한하는 단계, 복잡도의 상한 및 하한이 제한된 상기 QRD-M 알고리즘을 이용하여, 상기 수신된 신호를 검출하는 단계를 포함하는 것을 그 구성상의 특징으로 한다.
본 발명에서 제안하고 있는 다중 안테나 시스템의 검출 방법에 따르면, 복잡도의 상한 및 하한이 제한된 QRD-M 알고리즘을 사용함으로써 신호 검출시 발생하는 연산량을 효과적으로 감소시킬 수 있는 공간 다중화 방식의 다중 안테나 시스템을 위한 신호 검출 방법을 제공할 수 있다.
MIMO, QRD-M, OFDM-
公开(公告)号：KR101036960B1
公开(公告)日：2011-05-25
申请号：KR1020100038657
申请日：2010-04-26
Applicant: 인하대학교 산학협력단
IPC: H04B7/04
CPC classification number: H04B7/0452 , H04B7/0626 , H04W72/082
Abstract: PURPOSE: A data stream allocating method and apparatus thereof in a multiple user MIMO(Multiple-Input Multiple-Output) system are provided to adoptively allocate the number of data streams in consideration of transmitted channel information. CONSTITUTION: A calculating unit(110) calculates a norm on each row in a channel by using channel state information. A selecting unit(120) selects a column of maximum norm. A reselecting unit(130) reselects a column of maximum norm. A deciding unit(140) decides the number of data streams corresponding to a plurality of terminals based on the re-selected column.
Abstract translation: 目的：提供多用户MIMO（多输入多输出）系统中的数据流分配方法和装置，以便考虑发送的信道信息来过渡地分配数据流的数量。 构成：计算单元（110）通过使用信道状态信息来计算信道中每一行的范数。 选择单元（120）选择最大范数的列。 重新选择单元（130）重新选择最大范数的列。 决定单元（140）基于重新选择的列来决定与多个终端对应的数据流的数量。
-
公开(公告)号：KR101019291B1
公开(公告)日：2011-03-07
申请号：KR1020090106479
申请日：2009-11-05
Applicant: 인하대학교 산학협력단
IPC: H04B7/04
CPC classification number: H04B7/0452 , H03M7/405
Abstract: PURPOSE: A sphere encoding method having fixing complexity in a MU-MIMO(Multi User-Multi Input Multi Output) is provided to determine a valid branch through a parallel research structure. CONSTITUTION: All branches to a plurality of parent nodes which is connectable for a root node is searched. The searched branch is determined as a valid branch. The parent nodes which are connectable to a plurality of child node respectively are searched in each plurality of parent nodes. One among the plurality of searched branch is determined as a valid branch of each parent nodes by using a distribution technique.
Abstract translation: 目的：提供一种在MU-MIMO（多用户多输入多输出）中具有固定复杂度的球体编码方法，以通过并行研究结构确定有效分支。 构成：搜索可连接到根节点的多个父节点的所有分支。 搜索到的分支被确定为有效分支。 可以分别在多个父节点中搜索可连接到多个子节点的父节点。 通过使用分发技术，将多个搜索到的分支中的一个确定为每个父节点的有效分支。
-
-
-
Search Results
4
records
(took 0.019 seconds)
