• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.12
• /
• pp.83-88
• /
• 2008

The QPP interleaver has been gaining attention since it provides contention-free interleaving functionality for high speed parallel turbo decoders. In this paper we first show that the quadratic term $f_2x^2%K$ of $f(x)=(f_1x+f_2x^2)%K$, the address generating function, is periodic. We then introduce a low-power address generator which utilizes this periodic characteristic. This generator follows the conventional method to generate the interleaving addresses and also to save the quadratic term values during the first half of the first period. The saved values are then reused for generating further interleaved addresses, resulting in reduced number of logical operations. Power consumption is reduced by 27.38% in the design with fixed-K and 5.54% in the design with unfixed-K on average for various values of K, when compared with the traditional designs.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.6
• /
• pp.813-823
• /
• 1998

This paper analyzed the circularly polarized conformal microstrip patch antennal using the unsplit anisotropic perfectly matched layer(UAPML) method. Also, this paper are treated effectively the edge and corner parts on the 3 dimensional UAPML. Especially, to analyze microstrip patch antennas with the coaxial feeder line, it was applied to mixed the UAPML with Mur's first order absorbing boundary condition. Therefore this paper suggest the new the method to mix the UAPML with Mur's first order absorbing boundary condition. The results show the time responses of electromagnetics $E_z$ and $H\chi'$, input impedances of coaxial cable and radiation patterns of strip parchs on the single and the array patchs with central frequencies 1.575 GHz, 1.778 GHz and 4.8 GHz in L-band and C-band for mobile communication. The results of this paper shows that its results was compared the Mur's first order abc and mixed the second order dispersion boundary condition(SDBC) with the Mur's first order absorbing boundary condition. In accordance with, the validity of the method is confirmed.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.9
• /
• pp.1056-1064
• /
• 2010

This paper presents the approximate analysis method for the symmetric transmission line crossing the aperture in an backplane. The method of moments is used to determine the aperture impedance for the construction of the equivalent transmission line that the aperture impedance apply to the transmission line as the shunt impedance. As the results, the insertion loss increases at the specific frequency range for the impedance matching. In the case of the mismatching, we are confirmed to the insertion gain at the specific frequency. Also the horizontal length of the aperture affects to the transmission line better than vertical length. The measurement of the insertion loss is performed to verify the theoretical analysis.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.403-415
• /
• 2011

In this paper, we proposed a hardware architecture to generate digital holograms at high speed. It used the modified computer-generated hologram (CGH) algorithm and adapted the pipeline-based hardware to be able to remove memory bottleneck problem. It uses not the method which generates a hologram by accumulating intermittent holograms but the one which independently generates a pixel of a final hologram and uses the appropriate CGH algorithm for the selected method. Based on the CGH algorithm we proposed the architecture of the digital hologram generator which consists of input interface part, calculating part, and normalizing part. The hardware can decrease memory usage because it repeatedly use object light sources which is stored in the internal buffer. It is also operationally parallelized by vertically adding unit cells. It can generate 86 frames of HD digital hologram per 1 second for 1K light sources.

• Journal of KIISE
• /
• v.45 no.3
• /
• pp.224-233
• /
• 2018

Recently, there are many of studies on SWRL reasoning engine based on user-defined rules in a distributed environment using a large-scale ontology. Unlike the schema based axiom rules, efficient inference orders cannot be defined in SWRL rules. There is also a large volumet of network shuffled data produced by unnecessary iterative processes. To solve these problems, in this study, we propose a method that uses Map-Reduce algorithm and distributed in-memory framework to deduce multiple rules simultaneously and minimizes the volume data shuffling occurring between distributed machines in the cluster. For the experiment, we use WiseKB ontology composed of 200 million triples and 36 user-defined rules. We found that the proposed reasoner makes inferences in 16 minutes and is 2.7 times faster than previous reasoning systems that used LUBM benchmark dataset.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.3
• /
• pp.141-148
• /
• 2017

The current advancement of mobile devices enables users to collect a sequence of user positions by use of the positioning technology and thus the related research regarding positioning or location information are quite arising. An individual mobility model based on positioning data and time data are already established while group mobility model is not done yet. In this research, group mobility model, an extension of individual mobility model, and the process of establishment of group mobility model will be studied. Based on the previous research of group mobility model from two individual mobility model, a group mobility model with more than two individual model has been established and the transition pattern of the model is represented by Markov chain. In consideration of real application, the computing time to establish group mobility mode from huge positioning data has been drastically improved by use of GPGPU comparing to the use of traditional multicore systems.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.875-880
• /
• 2005

OWL(Web Ontology Language) is the Ontology Standard Language and the a lot of Ontologies are being constructed in OWL. But the research on the extension of OWL is also progressing because of the limit of representation power of in OWL language. The W3C suggests the SWRL(Semantic Web Rule Language) based on the combination of OWL and RuleML(Rule Markup Language), which is improved in the representation of rule. Thus, both OWL and SWRL are used for developing ontologies. However, research on inference of ontologies written in both languages is just begun. These day, for the inference of ontologies written in both languages, ontologies and divided in to two parts. The part written in OWL and written in SWRL. For the inference of the part written in OWL, Racer, a DL based inference engine, is used and for the other part Jess, a rule-based engine, is used. In this paper, we will propose three methods for integrated inference of the OWL part and the SWRL part of ontologies using Jess and some tools for ontology inference : OWLJessKB and SWRL Factory

• School Mathematics
• /
• v.11 no.3
• /
• pp.497-511
• /
• 2009

This study compared two problem solving instructional approaches, schema based sequence instruction and schema based parallel instruction on word problem solving performance of elementary school students who were in general students group. The subjects totaled 48 third grade students who were exposed to a test that consisted of 9 word problem items of three types for 4 sessions. First of all, the baseline of word problem performance level was measured without any training. During session 1, 2 and 3 participants were put into strategic training groups. The experiment was designed by two between factor(two intervention group and two within factors(two problem types, three sessions). The results of experiment were as follows. Schema based sequence instruction group performed significantly better than students in another group on word problem solving performance. The effect of strategic schema based Instruction revealed that solving word problems relied upon problem types, sessions and input orders which were of great value.

• Applied Biological Chemistry
• /
• v.24 no.3
• /
• pp.181-185
• /
• 1981

Distribution of pesticide deposit on the upper and lower halves of rice plants sprayed with various dilution and dosage of fenitrothion EC, Imidan WP, diazinon EC and phenthoate EC was studied under paddy field. Increasing dilution or dosage of the pesticides resulted in high level of deposits on the lower half of rice plants. The distribution of pesticide deposits on the upper half of Milyang 23 was higher than that of Akibare irrespective of pesticides, dilution and dosage.

• Journal of Korea Water Resources Association
• /
• v.31 no.1
• /
• pp.45-57
• /
• 1998

The purpose of this paper is to develop a neural network model in order to forecast flood inflow into the reservoir that has the nature of uncertainty and nonlinearity. The model has the features of multi-layered structure and parallel multi-connections. To develop the model. backpropagation learning algorithm was used with the Momentum and Levenberg-Marquardt techniques. The former technique uses gradient descent method and the later uses gradient descent and Gauss-Newton method respectively to solve the problems of local minima and for the speed of convergency. Used data for learning are continuous fixed real values of input as well as output to emulate the real physical aspects. after learning process. a reservoir inflows forecasting model at flood period was constructed. The data for learning were used to calibrate the developed model and the results were very satisfactory. applicability of the model to the Chungju Mlultipurpose Reservoir proved the availability of the developed model.