• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.27-40
• /
• 2004

The OSGi service platform has several characteristics as in the followings. First, the service is deployed in the form of self-installable component called service bundle. Second, the service is dynamic according to its life-cycle and has interactions with other services. Third, the system resources of a home gateway are restricted. Due to these characteristics of a home gateway, there are a lot of rooms for malicious services can be Installed, and further, the nature of service can be changed. It is possible for those service bundles to influence badly on service gateways and users. However, there is no service bundle authentication mechanism considering those characteristics for the home gateway In this paper, we propose a service bundle authentication mechanism considering those characteristics for the home gateway environment. We design the mechanism for sharing a key which transports a service bundle safely in bootstrapping step that recognize and initialize equipments. And we propose the service bundle authentication mechanism based on MAC that use a shared secret created in bootstrapping step. Also we verify the safety of key sharing mechanism and service bundle authentication mechanism using a BAN Logic. This service bundle authentication mechanism Is more efficient than PKI-based service bundle authentication mechanism or RSH protocol in the service platform which has restricted resources such as storage spaces and operations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11A
• /
• pp.1263-1270
• /
• 2004

A low-power 64-point FFT/IFFT processor core is designed, which is an essential block in OFDM-based wireless LAM modems. The radix-2/418 DIF (Decimation-ln-Frequency) FFT algorithm is implemented using R2SDF (Radix-2 Single-path Delay Feedback) structure. Some design techniques for low-power implementation are considered from algorithm level to circuit level. Based on the analysis on infernal data flow, some unnecessary switching activities have been eliminated to minimize power dissipation. In circuit level, constant multipliers and complex-number multiplier in data-path are designed using truncation structure to reduce gate counts and power dissipation. The 64-point FFT/IFFT core designed in Verilog-HDL has about 28,100 gates, and timing simulation results using gate-level netlist with extracted SDF data show that it can safely operate up to 50-MHz＠2.5-V, resulting that a 64-point FFT/IFFT can be computed every 1.3-${\mu}\textrm{s}$. The functionality of the core was fully verified by FPGA implementation using various test vectors. The average SQNR of over 50-dB is achieved, and the average power consumption is about 69.3-mW with 50-MHz＠2.5-V.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.2 s.332
• /
• pp.61-74
• /
• 2005

Digital Multimedia Broadcasting(DMB) is a reliable multi-service system for reception by mobile and portable receivers. DMB system allows interference-free reception under the conditions of multipath propagation and transmission errors using COFDM modulation scheme, simultaneously, needs powerful channel error's correction ability. Viterbi Decoder for DMB receiver uses punctured convolutional code and needs lots of computations for real-time operation. So, it is desired to design a high speed and low-power hardware scheme for Viterbi decoder. This paper proposes a combined add-compare-select(ACS) and path metric normalization(PMN) unit for computation power. The proposed PMN architecture reduces the problem of the critical path by applying fixed value for selection algorithm due to the comparison tree which has a weak point from structure with the high-speed operation. The proposed ACS uses the decomposition and the pre-computation technique for reducing the complicated degree of the adder, the comparator and multiplexer. According to a simulation result, reduction of area $3.78\%$, power consumption $12.22\%$, maximum gate delay $23.80\%$ occurred from punctured viterbi decoder for DMB system.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.1-10
• /
• 2010

This present paper's goal is to show a virtual human agent's movement-data loci based on realistically limited perception data is human-like. To determine human-likeness of the movement-data loci, we consider interactions between two parameters: Realistically Limited Perception (RLP) data and Incremental Movement-Path data Generation (IMPG). That is to consider how the former (i.e., RLP), one of the simulated parameters of human thought or its elements dictates the latter (i.e., IMPG), one of the simulated parameters of human movement behavior. Mapping DB is a prerequisite for navigation in an agent system because it functions as an interface between perception and movement behavior. Although Hill et al. studied mapping DB methodology based on RLP, their research dealt only with a rendering camera's view point data. The agent system in this present paper was integrated with the Hill's mapping DB module and then the two parameters' interaction was considered on a military reconnaissance mission with unexpected enemy emergence. Movement loci that were generated by the agent and subjects were compared with each other. The agent system in this present research verifies that it can be a functional test bed for producing human-like movement-data loci although the human-likeness of agent is the result of a pilot test, determined by two parameters (RLP and IMPG) and only 30 subjects.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.3
• /
• pp.62-70
• /
• 2011

Nowadays image sensor is an essential component in many multimedia devices, and it is covered by a color filter array to filter out specific color components at each pixel. We need a certain algorithm to combine those color components reconstructed a full color image from incomplete color samples output from an image sensor, which is called a demosaicking process. Most existing demosaicking algorithms are developed for ideal image sensors, but they do not work well for the practical cases because of dissimilar characteristics of each sensor. In this paper, we propose a new demosaicking algorithm in which the color filter characteristics are fully utilized to generate a good image. To demonstrate significance of our algorithm, we used a commerically available sensor, CBN385B, which is a sort of Honeycomb-style CFA(Color Filter Array) CCD image sensor. As a performance metric of the algorithm, PSNR(Peak Signal to Noise Ratio) and RGB distribution of the output image are used. We first implemented our algorithm in C-language for simulation on various input images. As a result, we could obtain much enhanced images whose PSNR was improved by 4~8 dB compared to the commonly idealized approaches, and we also could remove the inclined red property which was an unique characteristics of the image sensor(CBN385B).Then we implemented it in hardware to overcome its problem of computational complexity which made it operate slow in software. The hardware was verified on Spartan-3E FPGA(Field Programable Gate Array) to give almost the same performance as software, but in much faster execution time. The total logic gate count is 45K, and it handles 25 image frmaes per second.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.3
• /
• pp.50-61
• /
• 2011

The Infrared touch method is generally used for a mid and large-size touch screen. But this method has several problems, such as difficulty with installation of a touch-object recognition device, limited application and coordinate error in multi-point touch system. Since we can take advantages of both color and local information when we use general cameras for a touch screen, a touch screen using general camera is more efficient than infrared one. It also has an advantage of easy installation of a touch-object device. However, it did not much appeal in a market because of several problems, such as color sensitivity, illumination and reflected light. In this paper, we study a method for a touch screen using a general camera and image processing method to recognize touch objects and coordinate calculation method to single and multi-point touch screen. It has the same recognition performance as an infrared touch screen for single-point method. And it does not have ghost point problem by using distance information of touch object and camera in multi-point touch system. But recognition performances of multi-point touch screen are less than single-point. If we improve execution time, this method can replace an infrared method for a single point touch screen, according to result of experience.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.101-109
• /
• 2014

It is an essential element for the establishment of image processing related systems to find the exact contour from the image of an arbitrary object. In particular, if a vision system is established to inspect the products in the automated production process, it is very important to detect the contours for standardized shapes such lines and curves. In this paper, we propose a prototype adaptive dynamic contour model, p-Snake with improved contour extraction algorithms by adding the prototype energy. The proposed method is to find the initial contour by applying the existing Snake algorithm after Sobel operation is performed for prototype analysis. Next, the final contour of the object is detected by analyzing prototypes such as lines and circles, defining prototype energy and using it as an additional energy item in the existing Snake function on the basis of information on initial contour. We performed experiments on 340 images obtained by using an environment that duplicated the background of an industrial site. It was found that even if objects are not clearly distinguished from the background due to noise and lighting or the edges being insufficiently visible in the images, the contour can be extracted. In addition, in the case of similarity which is the measure representing how much it matches the prototype, the prototype similarity of contour extracted from the proposed p-ACM is superior to that of ACM by 9.85%.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.35-43
• /
• 2014

In this paper, we propose a performance enhancement method of the target tracking system for communication signal using the monopulse and the ${\alpha}{\beta}$ filter to keep the connection of the communication system between the airplane and the ground. We suggest the minimum distance measurement method for tracking error angle of the monopulse signal instead of the generally used method of MR(Monopulse Ratio) curve, and the ${\alpha}{\beta}$ filter with variable gain for enhancement of the tracking accuracy and the probability of re-tracking the monopulse signal under the disconnection of link. We show the performance enhancement of the proposed method of monopulse system using the measured MR Curve results of the prototype system. And also, the comparison of simulation results between the ${\alpha}{\beta}$ filter with variable gain and the ${\alpha}{\beta}$ filter with fixed gain shows the performance enhancement of the proposed ${\alpha}{\beta}$ filter. Using the proposed methods, we expect the enhanced performance of the existing target tracking system for communication signal only by changing the algorithm without hardware changes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.2
• /
• pp.149-162
• /
• 2005

This paper suggest a way to detect a specific wanted figure in public places such as subway stations and banks by comparing color face images extracted from the real time CCTV with the face images of designated specific figures. Assuming that the characteristic of the surveillance camera allows the face information in screens to change arbitrarily and to contain information on numerous faces, the accurate detection of the face area was focused. To solve this problem, the normalization work using subsampling with $20{\times}20$ pixels on arbitrary face images, which is based on the Perceptron Neural Network model suggested by R. Rosenblatt, created the effect of recogning the whole face. The optimal linear filter and the histogram shaper technique were employed to minimize the outside interference such as lightings and light. The addition operation of the egg-shaped masks was added to the pre-treatment process to minimize unnecessary work. The images finished with the pre-treatment process were divided into three reception fields and the information on the specific location of eyes, nose, and mouths was determined through the neural network. Furthermore, the precision of results was improved by constructing the three single-set network system with different initial values in a row.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.2
• /
• pp.40-46
• /
• 2010

Multi-user MIMO (Multiple-Input Multiple-Output) systems require collaborative PF schedulers to improve the performance of the log sum of average transmission rates. While the performance of single cell based conventional PF schedulers has been evaluated over various channel conditions, scheduling algorithms by multiple base stations which select multiple users over a given time frame and their performance require further investigations. In this paper, we apply a collaborative PF scheduler to the distributed multi-user MIMO system, which assigns radio resources to multiple users by exchanging user channel information from base stations located in three adjacent sectors. We further evaluate its performance in terms of the log sum of average transmission rates. The performance is compared to that of the full-search collaborative PF scheduler which searches over all possible combinations of user groups, and that of a parallel PF scheduler that determines users without channel information exchange among base stations. We show the log sum of average transmission rates of the collaborative PF scheduler outperforms that of the parallel PF scheduler in low percentile region. In addition, the collaborative PF scheduler exhibits a negligible performance degradation when compared to the full-search collaborative PF scheduler while a significant reduction of the computational complexity is achievable at the same time.