• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1124-1131
• /
• 2008

In this paper, we propose a timing synchronization scheme and its hardware architecture of the next generation IEEE 802.11n wireless LAN standard which is based on MIMO-OFDM technique. Proposed timing synchronization method takes two steps which consist of two modified auto-correlators. For coarse timing synchronization, a sliding window differentiator is used after a conventional auto-correlation in order to avoid plateau problem. The conjugate symmetry property of L-LTS is utilized for the simplification of fine timing synchronization. Since cross-correlation based methods are not required, the computational complexity and the number of multipliers can be reduced. In order to reduce the hardware complexity, we have used sign multipliers. Based on simulation results, the proposed method outperforms a conventional method. The proposed scheme can be applied to IEEE 802.11n systems and can easily be expanded to frequency synchronization scheme.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.19 no.2 s.72
• /
• pp.161-169
• /
• 2006

The study proposes component models in developing an efficient platform for internet-based structural analysis. Since a structural analysis requires an operation of complicated algorithms, a client-side computation using X-Internet is preferred to a server-side computation to provide a flexible service for multi-users. To compete with the user-friendly interfaces of available commercial analysis programs, a window-based interface using Smart Client was applied. Also, component-based programming was performed with the considerations on reusability and expandability so that active Preparation for future change or modification could be feasible. The components describe the whole system by subdivision and simplification. In the relationship between upper-and lower-level components and also in the relationship between components and objects, a unified interface was used to clearly classify the connection between the libraries. By performing data communication between different types of platforms using XML WebService, a conner-stone of data transfer is proposed for the future integrated CAE. The efficiency of the developed platform has been examined through a sample structural analysis and design on planar truss structures.

• Journal of Digital Convergence
• /
• v.14 no.8
• /
• pp.261-267
• /
• 2016

In this paper, we studied the range-free localization algorithm between sensor nodes based on the Radical Line for sensor networks. Routing in wireless sensor networks should reduce the overall energy consumption of the sensor network, or induce equivalent energy consumption of all the sensor nodes. In particular, when the amount of data to send more data, the energy consumption becomes worse. New methods have been proposed to address this. So as to allow evenly control the overall energy consumption. For this, the paper covers designing a localization algorithm that can obtain the location information of the peripheral nodes with fewer operations. For the operation of the algorithm is applicable Radical Line. The experimental environment is windows 7, the Visual C ++ 2010, MSSQL 2008. The experimental results could be localized to perform an error rate of 0.1837.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.6
• /
• pp.125-134
• /
• 2004

When cryptosystem designers implement devices that computing power or memory is limited such as smart cards, PDAs and so on, not only he/she has to be careful side channel attacks(SCA) but also the cryptographic algorithms within the device has to be efficient using small memory. For this purpose, countermeasures such as Moiler's method, Okeya-Takagi's one and overlapping window method, based on window method to prevent SCA were proposed. However, Moiler's method and Okeya-Talngi's one require additional cost to prevent other SCA such as DPA, Second-Order DPA, Address-DPA, and so on since they are immune to only SPA. Also, overlapping window method has a drawback that requires big memory. In this paper, we analyze existing countermeasures and propose an efficient and secure countermeasure that is immune to all existing SCA using advantages of each countermeasure. Moreover, the proposed countermeasure can enhance the efficiency using mixed coordinate systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.118-123
• /
• 2006

DNA 시퀀스 데이터베이스 규모의 급격한 증가 추세를 고려할 때, DNA 시퀀스 검색 연산을 보다 효과적으로 지원할 수 있는 인덱싱 및 질의 처리 기술이 요구 된다. 접미어 트리는 DNA 시퀀스 검색을 위한 좋은 인덱스 구조로 알려져 왔다. 그러나 접미어 트리는 그 구조적 특성으로 인하여 저장공간, 검색 성능, DBMS와의 통합 등의 문제점을 갖는다. 본 논문에서는 이와 같은 접미어 트리의 문제점들을 해결하는 DNA 시퀀스 검색을 위한 새로운 인덱스 구조를 제안하고, 이를 기반으로 하는 효율적인 질의 처리 방식을 제안한다. 제안된 인덱스 기법은 이진 트라이를 기본 구조로 채택하며 DNA 시퀀스의 윈도우 서브 시퀀스를 인덱싱 대상으로 한다. 유사 서브 시퀀스 검색을 위한 질의 처리 알고리즘은 기본적으로 다이나믹 프로그래밍 기법에 근거하여 이진 트라이를 루트로부터 너비 우선(breadth-first) 방식으로 운행하며, 경로 상에 존재하는 모든 유사 서브 시퀀스를 검색해 낸다. 제안된 기법의 우수성을 검증하기 위하여, 기존의 접미어 트리와의 비교 실험을 통한 성능 평가를 수행하였다. 실험 결과에 의하면, 제안된 인덱스 기법은 접미어 트리에 비하여 약 30%의 작은 저장 공간을 가지고도 수배에서 수십배의 검색 성능의 개선 효과를 나타낸다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1155-1171
• /
• 1996

In this paper, we have analized the characteristics of pseudomedian filter based on the preceding study. The proposed pseudomedian filter methods consist of two types, that are H-shaped and Asterisk-shaped window types. At first, the definition of pseudomedian filter and its algorithm for de-interlacing scan conversion have been descibed, especially its charateristics, this, is the edge preserving characteristics and the required computation have been compared with the conventional algorithms. And PSNR has been introduced to evaluate the pseudomedian filter methods and the conventional algorithms. Finally, it has been discussed on the features and trade off of the pseudomedian filter methods. And the merit and application fields of the pseudomedian filter methods have been discussed.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.10
• /
• pp.1252-1262
• /
• 1988

This paper describes a functional-level design and simulation of Graphics Processor(GP) which can be used in various graphics systems. GP is divided into two parts: One is CPU, and the other is the interface to I/O peripherals. In order to achieve fast execution of graphics instructions, the CPU has special ALU, barrel shifter and window comparator and a FIFO for instruction prefetch. I/O part controls the DRAM and VRAM which constitute the GP's local memory, generates the signals to drive monitor, and communicates with the host processor. The functional simulation of CPU was done on Daisy workstation while the I/O part was designed using GENESIL, a silicon compiler.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.347-354
• /
• 2011

This paper presents a time-domain based asynchronous IR-UWB ranging system. This system accomplishes the ranging by detecting peaks from the outputs of a correlator implemented by a FIR filter. To discriminate the peaks due to a signal component, we use windowing for the correlated data within which the data are sorted in amplitude-ascending order and the noise level is calculated. Comparing with the recently presented frequency-domain based ranging system, we show the system structure and explain how it operates for ranging. Moreover, through the simulations, the proposed system is compared with the frequency-domain based system in terms of performance.

• Journal of IKEEE
• /
• v.27 no.4
• /
• pp.531-536
• /
• 2023

This paper proposes a sliding window method with frame feature insertion for immediate attack detection on in-vehicle networks. This method guarantees real-time attack detection by labeling based on the attack status of the current frame. Experiments show that the proposed method improves detection performance by giving more weight to the current frame in CNN computation. The proposed model was designed based on a lightweight LeNet-5 architecture and it achieves 100% detection for DoS attacks. Additionally, by comparing the complexity with conventional models, the proposed model has been proven to be more suitable for resource-constrained devices like ECUs.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.119-132
• /
• 2007

In molecular biology, approximate subsequence search is one of the most important operations. In this paper, we propose an accurate and efficient method for approximate subsequence search in large DNA databases. The proposed method basically adopts a binary trie as its primary structure and stores all the window subsequences extracted from a DNA sequence. For approximate subsequence search, it traverses the binary trie in a breadth-first fashion and retrieves all the matched subsequences from the traversed path within the trie by a dynamic programming technique. However, the proposed method stores only window subsequences of the pre-determined length, and thus suffers from large post-processing time in case of long query sequences. To overcome this problem, we divide a query sequence into shorter pieces, perform searching for those subsequences, and then merge their results. To verify the superiority of the proposed method, we conducted performance evaluation via a series of experiments. The results reveal that the proposed method, which requires smaller storage space, achieves 4 to 17 times improvement in performance over the suffix tree based method. Even when the length of a query sequence is large, our method is more than an order of magnitude faster than the suffix tree based method and the Smith-Waterman algorithm.