• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.495-502
• /
• 2005

Cryptographic algorithm testing is performed to ensure that a specific algorithm implementation is implemented correctly and functions correctly. CMVP(Cryptographic Module Validation Program) of NIST in US is the well-known testing system that validates cryptographic modules to Federal Information Processing Standards (FIPS). There is no FIPS-approved stream cipher, and CMVP doesn't involve its validation testing procedure. In this paper we provide validation systems for three currently used light-weight stream ciphers: Bluetooth encryption algorithm E0, 3GPP encryption algorithm A5/3, and RC4 used for WEP and SSL/TLS Protocols. Moreover we describe our validation tools implemented by JAVA programing.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.585-596
• /
• 2001

In this paper, a new stream cipher algorithm based on the chaos theory is proposed and is applied to a Web security system. The Web security system is composed of three parts： certificate authority (CA), Web client, and Web server. The Web client and server system include a secure proxy client (SPC) and a secure management server (SMS), respectively, for data encryption and decryption between them. The certificate is implemented based on X.509 and the RSA public key algorithm is utilized for key creation and distribution to certify both the client and server. Once a connection is established between the client and server, outgoing and incoming data are encrypted and decrypted, respectively, using one of the three cipher algorithms： chaos, SEED, and DES. The proposed chaos algorithm outperforms the other two conventional algorithms in processing time and complexity. Thus, the developed Web security system can be widely used in electronic commerce (EC) and Internet banking.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.957-965
• /
• 2002

Garbage collection in the CLDC typically employs a stop-the-world GC algorithm which is performing a complete garbage collection when needed. This technique is unsuitable for the interactive Java embedded system because this can lead to long and unpredictable delays. In this paper, We present a garbage collection algorithm which reduces the average delay time and supports the interactive environment. Our garbage collector is composed of the allocator and the collector. The allocator determines the allocation position of free-list according to object size, and the collector uses an incremental mark-sweep algorithm. The garbage collector is called periodically by the thread scheduling policy and the allocator allocates the objects of marked state during collection cycle. Also, we introduce a color toggle mechanism that changes the meaning of the bit patterns at the end of the collection cycle. We compared the performance of our implementation with stop-the-world mark-sweep GC. The experimental results show that our algorithm reduces the average delay time and that it provides uniformly low response times.

• Journal of Korean Society of Transportation
• /
• v.29 no.6
• /
• pp.107-116
• /
• 2011

In this paper, we implement an algorithm of transit signal priority control that not only maximizes service quality and efficiency of bus, but also minimizes the control delay of passenger cars using UTIS currently being deployed and operated in Seoul national capital area. For this purpose, we propose an algorithm that coordinates the strength of TSP by estimating bus demand. Typically, the higher the strength of TSP is on main street, the bigger the control delay is on the cross street. Motivated by this practical difficulty, we proposes an algorithm that coordinates TSP's strength by checking the degree of saturation of cross street. Also, we verify the possibility of field implementation via simulation analysis using CORSIM RTE based HILS (Hardware In the Loop Simulation). The result shows that travel time of bus improves about 10 percent without increasing control delay of passenger cars by TSP. We expect the result of this research to contribute to increasing the overall transit ridership in this country.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.2
• /
• pp.171-178
• /
• 2008

Galileo is the Europe's global navigation satellite system corresponding to the GPS. The GIOVE-A test experiment has been finished and the second test satellite GIOVE-B will be launched soon. The integration of GPS and Galileo lead an increase of visible satellite number. We can obtain an improved navigation performance in signal blocked area such as urban or forest. GPS and Galileo have each time-coordinate system and use the different error model to calculate the navigation solution. In this paper, we studied on GPS and Galileo channel error model and time-coordinate system. Using this result, we implement the integrated navigation algorithm. In simulation, we analyzed the navigation error caused by time and coordinate disagreement and verified performance of integrated navigation algorithm in terms of visible satellite number, DOP(Dilution of Pression) and position error.

• KIISE Transactions on Computing Practices
• /
• v.23 no.8
• /
• pp.498-503
• /
• 2017

SIMD (Single Instruction Multiple Data) is a representative parallelization architecture that processes multiple data loaded in a SIMD register with a single instruction. Quicksort is a sorting algorithm that picks an element as a pivot from the array and reorders the array such that all elements having the values less than the pivot value are located in the left side on the pivot as well as all elements having the value greater than the pivot value are located in the right side on the pivot and then the algorithm performs the same task on both sublist recursively. In this paper, we propose an efficient Quicksort algorithm applying the SIMD instructions which minimally invokes conditional branches to avoid the performance degradation incurred by branch misprediction in a pipeline architecture. In addition, we improve the performance of the Quicksort algorithm by fetching data into a SIMD register as a byte unit to apply VBP (Vertical Bit Parallel) and the early pruning technique.

• The Journal of Korea Robotics Society
• /
• v.2 no.1
• /
• pp.40-47
• /
• 2007

Recently, with the development of service robots and with the new concept of ubiquitous world, the position estimation of mobile objects has been raised to an important problem. As pre-liminary research results, some of the localization schemes are introduced, which provide the absolute location of the moving objects subjected to large errors. To implement a precise and convenient localization system, a new absolute position estimation method for a mobile robot in indoor environment is proposed in this paper. Design and implementation of the localization system comes from the usage of active beacon systems (based upon RFID technology). The active beacon system is composed of an RFID receiver and an ultra-sonic transmitter: 1. The RFID receiver gets the synchronization signal from the mobile robot and 2. The ultra-sonic transmitter sends out the traveling signal to be used for measuring the distance. Position of a mobile robot in a three dimensional space can be calculated basically from the distance information from three beacons and the absolute position information of the beacons themselves. Since it is not easy to install the beacons at a specific position precisely, there exists a large localization error and the installation time takes long. To overcome these problems, and provide a precise and convenient localization system, a new auto calibration algorithm is developed in this paper. Also the extended Kalman filter has been adopted for improving the localization accuracy during the mobile robot navigation. The localization accuracy improvement through the proposed auto calibration algorithm and the extended Kalman filter has been demonstrated by the real experiments.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.8
• /
• pp.2951-2957
• /
• 2010

In solar industry the development of tracking PV power generation devices progresses favorably because of its efficiency, comparing with fixed PV power generation devices. Tracking PV power generation device are not only preserving the amount of solar radiation per unit area but also maximizing the efficiency of solar battery. Therefore accurate and low-priced solar position tracking devices are very important to improve the economical efficiency and lower invest price. This research is concerned with solar position algorithm with uncertainties equal to 1 minute($0.016^{\circ}$) using the mathmatics and astronomg. Proposed algorithm in this paper, lowers the implementation price and improves power generation efficiency. In view of the result so far achieved, maximum error has 30 secend($0.008^{\circ}$). And the solar cell generating system applied by this algorithm showed the gain of the fixed type contrast average 23W(about 18%).

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.1
• /
• pp.8-14
• /
• 2017

Deinterlacing is a method to convert interlaced video, including two fields (even and odd), to progressive video. It can be divided into spatial and temporal methods. The deinterlacing method in the spatial domain can easily be hardware-implemented, but yields image degradation if information about the deinterlaced pixel does not exist in the same field. On the other hand, the method in the temporal domain yields a deinterlaced image with higher quality but uses more memory, and hardware implementation is more difficult. Furthermore, the deinterlacing method in the temporal domain degrades image quality when motion is not estimated properly. The proposed method is for deinterlacing in the spatial domain. It uses several deinterlacing methods according to statistical characteristics in neighboring pixel locations. In this procedure, the proposed method uses the C4.5 algorithm, a typical classification algorithm based on entropy for choosing optimal methods from among the candidates. The simulation results show that the proposed algorithm outperforms previous deinterlacing methods in terms of objective and subjective image quality.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.3
• /
• pp.405-417
• /
• 2001

In this paper, since we currently using surveillance system of analog type bring about waste of resource and efficiency deterioration problems, we describe new solution that design and implementation to the digital surveillance system of new type applying compression techniques and encoding techniques of image data using MPEG-2 international standard. Also, we proposed fast motion estimation algorithm requires much less than the convectional digital surveillance camera system. In this paper a fast motion estimation algorithm is proposed the MPEG-2 video encoding. This algorithm is based on a hybrid use of the block matching technique and gradient technique. Also, we describe a method of moving object extraction directly using MPEG-2 video data. Since proposed method is very simple and requires much less computational power than the conventional object detection methods. In this paper we don't use specific H/W and this system is possible only software encoding, decoding and transmission real-time for image data.