公开(公告)号：KR100420555B1

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

申请号：KR1020020021504

申请日：2002-04-19

Applicant: 한국전자통신연구원

Inventor： 이상한 ,  고행석 ,  장태주 ,  김영수 ,  양상운 ,  박상현 ,  구본석

IPC: H04L9/06

Abstract: PURPOSE: A block coding apparatus capable of changing a high-speed session and a method for driving the same are provided to reduce a delay time due to a session change by performing a series of operations for a session change at high speed using hardware of the block coding apparatus. CONSTITUTION: A host matching unit(200) performs a standard matching function of a host. A local bus arbitrator(201) transmits instruction data and coding/decoding processing data inputted from the host and transfers coding/decoding result data and response data to the host. An instruction interpreter(207) analyzes the instruction data from the host. If the instruction data is coding/decoding processing instruction, the instruction interpreter(207) generates response data to transmit it to the host matching unit(200), and otherwise, it transmits variables required to the instruction data and a coding/decoding processing to instruct the start of a coding/decoding processing operation. A CPU(Central Processing Unit) generates response data corresponding to the instruction performance result. A code chip receives the variables from the instruction interpreter(207) to realize a block code algorithm and to perform a block coding or decoding operation. A session data memory stores data of a session key, an initialization vector, an operation mode, a condition of a session. Input/output buffer memories temporarily stores the coding/decoding processing data from the host and the coding/decoding processing result data of the code chip.

Abstract translation: 目的：提供一种能够改变高速会话的块编码装置及其驱动方法，以通过使用硬件的高速执行用于高速会话改变的一系列操作来减少由于会话改变而引起的延迟时间 块编码设备。 构成：主机匹配单元（200）执行主机的标准匹配功能。 本地总线仲裁器（201）发送从主机输入的指令数据和编码/解码处理数据，并将编码/解码结果数据和响应数据传送给主机。 指令解释器（207）分析来自主机的指令数据。 如果指令数据是编码/解码处理指令，则指令解释器（207）产生响应数据以将其发送到主机匹配单元（200），否则，它将指令数据所需的变量和编码/解码处理发送到 指示开始编码/解码处理操作。 CPU（中央处理单元）产生对应于指令执行结果的响应数据。 代码芯片接收来自指令解释器（207）的变量以实现分组码算法并执行分组编码或解码操作。 会话数据存储器存储会话密钥的数据，初始化向量，操作模式，会话的条件。 输入/输出缓冲存储器临时存储来自主机的编码/解码处理数据和码片的编码/解码处理结果数据。

公开(公告)号：KR1020030083100A

公开(公告)日：2003-10-30

申请号：KR1020020021504

申请日：2002-04-19

Applicant: 한국전자통신연구원

Inventor： 이상한 ,  고행석 ,  장태주 ,  김영수 ,  양상운 ,  박상현 ,  구본석

IPC: H04L9/06

CPC classification number: H04L9/0618 ,  H04L2209/122

Abstract: PURPOSE: A block coding apparatus capable of changing a high-speed session and a method for driving the same are provided to reduce a delay time due to a session change by performing a series of operations for a session change at high speed using hardware of the block coding apparatus. CONSTITUTION: A host matching unit(200) performs a standard matching function of a host. A local bus arbitrator(201) transmits instruction data and coding/decoding processing data inputted from the host and transfers coding/decoding result data and response data to the host. An instruction interpreter(207) analyzes the instruction data from the host. If the instruction data is coding/decoding processing instruction, the instruction interpreter(207) generates response data to transmit it to the host matching unit(200), and otherwise, it transmits variables required to the instruction data and a coding/decoding processing to instruct the start of a coding/decoding processing operation. A CPU(Central Processing Unit) generates response data corresponding to the instruction performance result. A code chip receives the variables from the instruction interpreter(207) to realize a block code algorithm and to perform a block coding or decoding operation. A session data memory stores data of a session key, an initialization vector, an operation mode, a condition of a session. Input/output buffer memories temporarily stores the coding/decoding processing data from the host and the coding/decoding processing result data of the code chip.

Abstract translation: 目的：提供能够改变高速会话的块编码装置及其驱动方法，以通过使用硬件进行高速会话改变的一系列操作来减少由于会话改变引起的延迟时间 块编码装置。 构成：主机匹配单元（200）执行主机的标准匹配功能。 本地总线仲裁器（201）发送从主机输入的指令数据和编码/解码处理数据，并将结果数据和响应数据传送到主机。 指令解释器（207）分析来自主机的指令数据。 如果指令数据是编码/解码处理指令，则指令解释器（207）生成响应数据以将其发送到主机匹配单元（200），否则，将指令数据所需的变量和编码/解码处理 指示开始编码/解码处理操作。 CPU（中央处理单元）产生与指令性能结果相对应的响应数据。 代码芯片从指令解释器（207）接收变量以实现块代码算法并执行块编码或解码操作。 会话数据存储器存储会话密钥的数据，初始化向量，操作模式，会话的条件。 输入/输出缓冲存储器临时存储来自主机的编码/解码处理数据和代码芯片的编码/解码处理结果数据。

公开(公告)号：KR1020030032499A

公开(公告)日：2003-04-26

申请号：KR1020010064303

申请日：2001-10-18

Applicant: 한국전자통신연구원 ,  주식회사 케이티

Inventor： 한미경 ,  최완 ,  김상욱 ,  박상현 ,  조준서

IPC: G06F17/30

Abstract: PURPOSE: A sub sequence matching method is provided to construct a multidimensional index by splitting up all the possible sliding windows from sequences, and to process a sub sequence matching operation by using the index of the sliding window unit and prefixes of the query sequences. CONSTITUTION: The minimum and maximum length of a query sequence, which can be matched with a sub sequence stored within an index, is determined(S301). A loop index is set with the minimum length of the query sequence(S302). It is checked whether the loop index is under the maximum length of the query sequence(S303). If the loop index is over the maximum length of the query sequence, the matching process is stopped, and otherwise, four features are extracted from a prefix of the query sequence(S304). Then an R-tree search operation is performed by using one point formed by the four feature values in a four dimensional space, a feature distance function and a reference value(S305). A new candidate sub sequence, returned via the R-tree search operation, is accessed(S306), and in a case that there is no more new candidate sub sequence, the loop index is increased by one(S307, S308), the steps S303-S307 are repeated. But in a case that there is a new candidate sub sequence, it is checked whether the time warping distance of the query sequence and the sub sequence is under a reference value(S309). Real time warping distances are measured, the sub sequences under a reference value are searched and returned as a post process result(S310).

Abstract translation: 目的：提供一种子序列匹配方法，通过从序列中分解所有可能的滑动窗口来构建多维索引，并通过使用滑动窗口单元的索引和查询序列的前缀来处理子序列匹配操作。 构成：确定可以与索引中存储的子序列匹配的查询序列的最小和最大长度（S301）。 以查询序列的最小长度设置循环索引（S302）。 检查循环索引是否在查询序列的最大长度以下（S303）。 如果循环索引超过查询序列的最大长度，则停止匹配处理，否则从查询序列的前缀中提取四个特征（S304）。 然后，通过使用由四维空间，特征距离函数和参考值中的四个特征值形成的一个点来执行R树搜索操作（S305）。 通过R-tree搜索操作返回的新的候选子序列被访问（S306），并且在不存在新的候选子序列的情况下，循环索引增加1（S307，S308），步骤 重复S303-S307。 但是在存在新候选子序列的情况下，检查查询序列和子序列的时间扭曲距离是否在参考值之下（S309）。 测量实时扭曲距离，作为后处理结果搜索并返回参考值下的子序列（S310）。