公开(公告)号：KR100486414B1

公开(公告)日：2005-04-29

申请号：KR1020020083087

申请日：2002-12-24

Applicant: 한국전자통신연구원

Inventor： 송재수 ,  김경수 ,  장성철 ,  김경식 ,  박지수 ,  박순기 ,  김주희

IPC: H04B7/26

Abstract: 본 발명은 이동통신시스템에서 핸드-오버시 데이터 전송에 관한 것으로, 특히 주파수간 핸드-오버(Inter frequency Hand over)와 같은 하드 핸드-오버(Hard Hand Over)에서 기존 링크에서 새로운 링크로 통신경로를 바꾸는 과정에서 기존링크에 있던 전송되지 않은 데이터가 유실을 막고 신뢰성 있는 하드핸드-오버를 지원하기 위한 시스템 및 방법에 관한 것이다. 본 발명은 기지국과 제어국 사이에 새로운 신호를 정의하여 제어국에서는 핸드-오버가 발생한 시점을 기존 기지국에 알려주고 기존 기지국에서는 버퍼에 저장된 데이터가 모두 이동단말로 전송된 시점을 제어국에 알려주어서 기존 통신경로에 남아있던 데이터가 모두 이동단말에 전달되는 것을 보장할 수 있도록 한다. 또한 제어국에 핸드-오버용 버퍼를 두어서 새로운 통신경로를 구축하는 동안 수신되는 데이터를 저장하였다가 이동단말까지 새로운 통신경로가 완성되면 이 버퍼로부터 이동단말로 데이터를 전송함으로써, 이동통신망에서 하드 핸드-오버시 데이터의 유실을 막고 신뢰성 있는 핸드-오버를 지원할 수 있다.

公开(公告)号：KR100463559B1

公开(公告)日：2004-12-29

申请号：KR1020020069567

申请日：2002-11-11

Applicant: 한국전자통신연구원

Inventor： 변경진 ,  정희범 ,  김경수 ,  김종대

IPC: G10L19/12 ,  G10L19/107

CPC classification number: G10L19/107 ,  G10L2019/0013

Abstract: The present invention reduces complexity of computation as about 40% comparing to the conventional depth first tree search method. A method for searching an algebraic codebook in algebraic code excited linear prediction (ACELP) vocoding using a depth first tree method, includes the steps of: a) searching branches of predetermined levels to predict a branch in which optimum pulse is located; b) choosing a predetermined number of branches according to the search result of the step a) and removing residual branches; and c) searching the chosen branches and choosing optimum algebraic code.

Abstract translation: 与传统的深度优先搜索方法相比，本发明将计算复杂度降低了大约40％。 一种使用深度优先树方法在代数码激励线性预测（ACELP）声码中搜索代数码本的方法，包括步骤：a）搜索预定电平的分支以预测最佳脉冲所在的分支; b）根据步骤a）的搜索结果选择预定数量的分支并去除残留分支; 和c）搜索选择的分支并选择最佳的代数码。

公开(公告)号：KR1020040056979A

公开(公告)日：2004-07-01

申请号：KR1020020083730

申请日：2002-12-24

Applicant: 한국전자통신연구원

Inventor： 박순기 ,  김경수 ,  장성철 ,  김경식 ,  박지수 ,  송재수 ,  김주희

IPC: H04B7/26

CPC classification number: H04W4/16 ,  H04B7/26 ,  H04W36/20 ,  H04W72/10

Abstract: PURPOSE: A method for controlling call admission in mobile communication and a recording medium storing a program to realize the same are provided to efficiently use system resources and to execute discriminatory processing according to the traffic characteristics of mobile users in the case of system congestion. CONSTITUTION: If the service speed of an arrived call is fixed in case that the arrived call is a new call(S12,S13), a base station judges whether the call meets the first condition in which (Ipresent + ΔIi) is less than (Itotal - IGMreserved, new call)(S14). If the call satisfies the first condition, the base station approves the call request at a service speed of Ri(S15). However, in case that the call does not meet the first condition, the base station rejects the call(S16). Meanwhile, if the arrived call is a new call and the service speed is variable(S21), the base station judges whether the call meets the second condition in which (Ipresent + ΔImaxi) is less than (Itotal - IGMreserved, new call)(S22). In case that the call meets the second condition, the base station approves the call request at a service speed of Rmaxi(S23).

Abstract translation: 目的：提供一种用于控制移动通信中的呼叫准入的方法和存储实现其的程序的记录介质，以在系统拥塞的情况下根据移动用户的业务特性来有效地使用系统资源和执行鉴别处理。 构成：如果到达呼叫是新呼叫（S12，S13），则到达呼叫的服务速度是固定的，则基站判断呼叫是否满足（Ipresent +ΔIi）小于（Ipresent +ΔIi）的第一条件 Itotal - IGMreserved，新电话）（S14）。 如果呼叫满足第一条件，则基站以Ri的服务速度（S15）批准呼叫请求。 然而，在呼叫不符合第一条件的情况下，基站拒绝该呼叫（S16）。 同时，如果到达的呼叫是新呼叫并且服务速度是可变的（S21），则基站判断呼叫是否满足（Ipresent +ΔImaxi）小于（Itotal-IGMreserved，新呼叫）的第二条件 S22）。 在呼叫满足第二条件的情况下，基站以Rmaxi的服务速度来批准呼叫请求（S23）。

公开(公告)号：KR1020040056584A

公开(公告)日：2004-07-01

申请号：KR1020020083087

申请日：2002-12-24

Applicant: 한국전자통신연구원

Inventor： 송재수 ,  김경수 ,  장성철 ,  김경식 ,  박지수 ,  박순기 ,  김주희

IPC: H04B7/26

CPC classification number: H04W36/02 ,  H04B7/26 ,  H04W36/08 ,  H04W72/06

Abstract: PURPOSE: A hard handover method and system free from data loss is provided to increase service quality by preventing data loss in a hard hand-over and to efficiently operate a new hard handover method. CONSTITUTION: A base station controller(300) consists of an RRC(Radio Resource Control) layer(310) and an RLC(Radio Link Control) layer(320). The RRC layer(310) comprises a call control part(311). The RLC layer(320) comprises a buffer control part(321) and a handover buffer(322). The call control part(311) controls the buffer control part(321) with call setup and release. If a mobile terminal moves from the coverage of the first base station(100) to the coverage of the second base station(200), it is reported to the base station controller(300) through a measurement report message. Receiving the measurement report message, the base station controller(300) generates a handover. If a handover is generated, the call control part(311) stops the transmission of downlink data to the first base station(100) and directs the buffer control part(321) to store the data incoming from a core network(400) in the handover buffer(322). At the same time, the call control part(311) transmits a handover generation message to inform the first base station(100) that a hand-over has been generated.

Abstract translation: 目的：提供硬切换方法和无数据丢失的系统，通过防止硬切换中的数据丢失并有效地操作新的硬切换方法来提高服务质量。 构成：基站控制器（300）由RRC（无线资源控制）层310和RLC（无线链路控制）层320组成。 RRC层（310）包括呼叫控制部（311）。 RLC层（320）包括缓冲器控制部分（321）和切换缓冲器（322）。 呼叫控制部（311）通过呼叫建立和释放来控制缓冲器控制部（321）。 如果移动终端从第一基站（100）的覆盖区移动到第二基站（200）的覆盖范围，则通过测量报告消息向基站控制器（300）报告。 接收到测量报告消息，基站控制器（300）产生切换。 如果生成切换，则呼叫控制部（311）停止向第一基站（100）发送下行链路数据，并指示缓冲器控制部（321）将来自核心网（400）的数据存储在 切换缓冲器（322）。 同时，呼叫控制部分（311）发送切换生成消息以通知第一基站（100）已经生成切换。

公开(公告)号：KR100437646B1

公开(公告)日：2004-06-25

申请号：KR1020010085663

申请日：2001-12-27

Applicant: 한국전자통신연구원 ,  유티스타콤코리아 유한회사

Inventor： 김성경 ,  김주희 ,  김경수

IPC: H04J13/20

Abstract: PURPOSE: A method for managing spreading codes through dual state management of a plane tree structure and a method for allocating and releasing the spreading codes by using the same are provided to adopt the plane tree structure storing an OVSF(Orthogonal Variable Spreading Factor) code tree in a one-dimensional array, and to perform the dual state management of OVSF codes, thereby eliminating the effort to search states of related codes upon allocation and release. CONSTITUTION: A state of each spreading code is divided into two fields, in order to meet an allocation rule of spreading codes. The first state field(5a) indicates a state(IDLE) of available spreading codes, a state(BUSY) of currently used spreading codes, and a state(QUASI-BUSY) showing that lower spreading codes connected to the same branch are unavailable due to use of upper spreading codes. The second state field(5b) indicates information on the number of spreading codes(#BUSY-CHILD) in a 'BUSY' state among lower spreading codes of corresponding spreading codes. Resources of a spreading code tree are managed in a plane tree structure with a one dimensional array. Accordingly, direct access into an array index is possible without passing a step of searching additional link information, when accessing the lower spreading codes and upper spreading codes.

Abstract translation: 目的：提供一种通过对平面树结构进行双状态管理来管理扩频码的方法，以及使用该方法分配和释放扩频码的方法，以采用存储OVSF（正交可变扩频因子）码树的平面树结构 并且执行OVSF代码的双状态管理，从而消除了在分配和释放时搜索相关代码的状态的努力。 组成：每个扩展码的状态被分成两个字段，以满足扩频码的分配规则。 第一状态字段（5a）表示可用扩展码的状态（IDLE），当前使用的扩展码的状态（BUSY）和表示连接到同一分支的较低扩展码不可用的状态（QUASI-BUSY） 使用较高的扩展码。 第二状态字段（5b）指示相应扩展码的较低扩展码中处于“忙”状态的扩展码（＃BUSY-CHILD）的数目的信息。 扩展码树的资源在具有一维数组的平面树结构中进行管理。 因此，当访问较低扩展码和较高扩展码时，可以直接访问数组索引，而不需要经过搜索附加链路信息的步骤。

公开(公告)号：KR1020040053435A

公开(公告)日：2004-06-24

申请号：KR1020020079989

申请日：2002-12-14

Applicant: 한국전자통신연구원

Inventor： 김혁 ,  전인산 ,  정희범 ,  김경수 ,  김종대

IPC: H04B7/06

Abstract: PURPOSE: A V-BLAST(Vertical-Bell Laboratories Layered Space-Time) system having a simple inverse matrix operation structure is provided to operate a necessary cofactor by using three multiplying steps, and to multiply a minimal value by a receiving symbol to divide with a determinant, thereby reducing hardware for V-BLAST algorithm. CONSTITUTION: The first and second switches(202,204) input a matrix and a receiving symbol, and transmit the matrix and the receiving symbol. A pseudo inverse matrix calculator(206) inputs the matrix to operate a cofactor matrix and a determinant, and outputs the cofactor matrix and the determinant. A size and minimal value calculator(208) operates a minimal index value for the cofactor matrix. A matrix reducer calculator(212) inputs a new matrix to the first switch(202). A weighting vector selector(210) operates a row vector and a transposed matrix of the row vector. The first multiplier(214) multiplies the transposed matrix by the receiving symbol. A divider(215) inputs the determinant, and divides an output of the first multiplier(214) with the determinant. An inverse mapper(218) inputs an output from the divider(215), and outputs an estimated information value. The second multiplier(220) multiplies a column corresponding to a row that generates the minimal index value, outputs results. A subtractor(216) subtracts an output of the second multiplier(220) from the receiving symbol, and outputs a new receiving symbol.

Abstract translation: 目的：提供具有简单逆矩阵运算结构的V-BLAST（Vertical-Bell实验室分层时空）系统，以通过使用三个乘法步骤来操作必要的辅因子，并将最小值乘以接收符号与 一个决定因素，从而减少V-BLAST算法的硬件。 构成：第一和第二开关（202,204）输入矩阵和接收符号，并发送矩阵和接收符号。 伪逆矩阵计算器（206）输入矩阵以操作辅因子矩阵和行列式，并输出辅因子矩阵和行列式。 尺寸和最小值计算器（208）操作辅助因子矩阵的最小索引值。 矩阵减法器计算器（212）将新矩阵输入到第一开关（202）。 加权向量选择器（210）操作行向量的行向量和转置矩阵。 第一乘法器（214）将转置矩阵乘以接收符号。 分频器（215）输入行列式，并且将第一乘法器（214）的输出与行列式相除。 逆映射器（218）输入来自分频器（215）的输出，并输出估计的信息值。 第二乘法器（220）将与生成最小索引值的行相对应的列相乘，输出结果。 减法器（216）从接收符号中减去第二乘法器（220）的输出，并输出新的接收符号。

公开(公告)号：KR100436434B1

公开(公告)日：2004-06-16

申请号：KR1020010071757

申请日：2001-11-19

Applicant: 한국전자통신연구원

Inventor： 전인산 ,  김혁 ,  양우석 ,  김경수 ,  김환우 ,  조한진

IPC: H03M13/37

CPC classification number: H03M13/3922 ,  H03M13/2957 ,  H03M13/6502 ,  H03M13/6505

Abstract: The present invention relates to a turbo decoder having a state metric, a calculating method using the turbo decoder and a computer-readable recoding medium for executing a calculation method implemented to the turbo decoder. The turbo decoder includes branch metric calculation unit, state metric calculation unit and log likelihood ratio calculation unit. The present invention may reduce calculation steps by simplifying a conventional turbo decode algorithm, reducing a size of a hardware, which the turbo decoder can be implemented in as an application specific integrated circuit (ASIC) or a field programmable gate array (FPGA). The present invention can be implemented in an error correction in wireless communication system and satellite communication system.

Abstract translation: 本发明涉及具有状态度量的turbo解码器，使用turbo解码器的计算方法和用于执行对turbo解码器实现的计算方法的计算机可读记录介质。 turbo解码器包括分支度量计算单元，状态度量计算单元和对数似然比计算单元。 本发明可以通过简化传统的turbo解码算法，减小硬件的大小来减少计算步骤，turbo解码器可以作为专用集成电路（ASIC）或现场可编程门阵列（FPGA）实现。 本发明可以用无线通信系统和卫星通信系统中的纠错来实现。

公开(公告)号：KR100431083B1

公开(公告)日：2004-05-12

申请号：KR1020020004435

申请日：2002-01-25

Applicant: 한국전자통신연구원

Inventor： 어익수 ,  김영훈 ,  정희범 ,  김경수

IPC: H04B1/7093

CPC classification number: H04B1/7077 ,  H04B1/70755

Abstract: A region searcher, a method of driving the same, and a code searcher using the same are disclosed. When a predetermined region is iteratively searched, the energy value corresponding to the same hypothesis location value is stored by using a searcher having divided two buffers, thereby the implementation complexity thereof can be remarkably reduced, without using a simple memory.

Abstract translation: 公开了区域搜索器，其驱动方法以及使用其的代码搜索器。 当迭代地搜索预定区域时，通过使用具有分开的两个缓冲器的搜索器来存储对应于相同假设位置值的能量值，从而可以显着降低其实现复杂度，而不使用简单的存储器。

公开(公告)号：KR100416569B1

公开(公告)日：2004-02-05

申请号：KR1020020002500

申请日：2002-01-16

Applicant: 한국전자통신연구원

Inventor： 김혁 ,  전인산 ,  정희범 ,  김경수

IPC: H03M13/37

Abstract: PURPOSE: A turbo permutator and a turbo decoder using the same are provided to form the turbo permutator suitable for the turbo decoder by using a sliding window method. CONSTITUTION: A turbo permutator includes a deinterleaving address generator(100), an interleaving row/column address generator(101,102), an address mapper(103), multiplexers(104,106), and a permutator memory(107). The deinterleaving address generator is used for generating a deinterleaving address value according to a predetermined bit number. The interleaving row/column address generators are used for outputting interleaving row/column address values according to the bit number and a row/column number. The multiplexers is used for selecting one of the deinterleaving address value and an output value of the address mapper. The permutator memory is used for outputting the output values corresponding to the input data.

Abstract translation: 目的：通过使用滑动窗口方法提供涡轮置换器和使用其的涡轮解码器以形成适用于turbo解码器的turbo置换器。 组成：涡轮置换器包括去交错地址发生器（100），交错行/列地址发生器（101,102），地址映射器（103），多路复用器（104,106）和置换器存储器（107）。 解交织地址生成器用于根据预定的位数生成解交织地址值。 交织行/列地址发生器用于根据位号和行/列号输出交织的行/列地址值。 多路复用器用于选择解交织地址值和地址映射器的输出值中的一个。 置换器存储器用于输出对应于输入数据的输出值。

公开(公告)号：KR100411887B1

公开(公告)日：2003-12-24

申请号：KR1020010085660

申请日：2001-12-27

Applicant: 한국전자통신연구원 ,  삼성전자주식회사

Inventor： 박순기 ,  김경수

IPC: H04B7/26

Abstract: PURPOSE: A method for synchronizing time in a mobile communication system is provided to supply a function of adjusting a TOD(Time Of Day) to self time in a main processor when the TOD is supplied, thereby simply performing time synchronization without using a GPS receiver. CONSTITUTION: When a synchronization program starts, a synchronization program reads shape information from firmware(300), and sets a software interrupt initial value(302). The synchronization program sets a virtual clock interrupt initial value for synchronization(304), and sets a virtual clock initial value for correction(306). The synchronization program decides whether the program is mounted on a main processor from the read shape information(308). If so, the synchronization program converts into a main processor execution mode(310). If the program is mounted on a sub processor, the synchronization program converts into a sub processor execution mode(312).

Abstract translation: 目的：提供一种用于在移动通信系统中同步时间的方法，以在提供TOD时提供在主处理器中将TOD（时刻）调整为自身时间的功能，由此简单地执行时间同步而不使用GPS接收器 。 构成：当同步程序启动时，同步程序从固件（300）读取形状信息，并设置软件中断初始值（302）。 同步程序设定用于同步的虚拟时钟中断初始值（304），并设定用于校正的虚拟时钟初始值（306）。 同步程序根据读取的形状信息决定程序是否安装在主处理器上（308）。 如果是，则同步程序转换成主处理器执行模式（310）。 如果程序安装在子处理器上，则同步程序转换成子处理器执行模式（312）。