• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.1
• /
• pp.59-66
• /
• 1998

In this paper, the high-speed decoder for RS(Reed-Solomon) code, one of the most popular error correcting code, is implemented using VHDL. This RS decoder is designed in transform domain instead of most time domain. Because of the simplicity in structure, transform decoder can be easily realized VLSI chip. Additionally the pipeline architecture, which is similar to a systolic array is applied for all design. Therefore, This transform RS decoder is suitable for high-rate data transfer. After synthesis with FPGA technology, the decoding rate is more 43 Mbytes/s and the area is 1853 LCs(Logic Cells). To compare with other product with pipeline architecture, this result is admirable. Error correcting ability and pipeline performance is certified by computer simulation.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.11
• /
• pp.126-134
• /
• 1990

In order to implement high-speed data acquistion system in CMOS VLSI technology, means must be found to overcome the relatively low transconductance and large device mismatch characteristic of MOS device. Because of these device limitations, circuit design approaches tradition-ally used in high-speed bipolar analog-to-digital converter(ADC) are suited to CMOS implementation. Also the design of VLSI CMOS comparator wherein voltage comparision is accomplished by means of a pipelined cascade RSA (Regenerative Sense Amplifier). So, in this paper we designed the A/D converter incorporates the pipelined CMOS comparator.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.1
• /
• pp.43-51
• /
• 1995

In this paper, we propose a neural network with fuzzy preprocessor not only for improving the classifi¬cation accuracy but also for being able to classify objects whose attribute values do not have clear bound¬aries. The fuzzy input signal representation scheme is included as a preprocessing module. It transforms imprecise input in linguistic form and precisely stated numerical input into multidimensional numerical values. 'The transformed input is processed in the postprocessing module. The experimental results indi-cate the superiority of fuzzy input signal representation scheme in comparison to binary input signal rep¬resentation scheme and decimal input signal representation scheme.

• Journal of the Korea Computer Graphics Society
• /
• v.5 no.2
• /
• pp.33-41
• /
• 1999

This paper presents a new algorithm about motion adjustment for dynamic balance. It adjusts an unbalanced motion to an balanced motion while preserving the nuance of original motion. We solve dynamic balancing problem using the zero moment point (ZMP) which is often used for controlling the balance of biped robot. Our algorithm is consists of four steps. First, it fits joint angle data to spline curves for reducing noise. Second, the algorithm analyzes the ZMP trajectory so that it can detects the dynamically-unbalanced duration. Third, the algorithm project the ZMP trajectory into the supporting area if the trajectory deviates from the area. Finally, the algorithm produces the balanced motion that satisfies the new ZMP trajectory. In this step, the constrained optimization method is used so that the new motion keeps the original motion characteristics as much as possible. We make several experiments in order to prove that our algorithm is useful to add physical realism to a kinematically edited motion.

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

Estimation of development cost, effort and time is difficult and a key problem of software engineering in the early stage of software development. These are estimated by using the function point which is measured from a requirement specification. However, it is often a serious Question of the staffing level required for the software development. The purpose of this paper is to show us the model which can be used to estimate a size of development team. Three hundred one software projects have been analyzed and studied for the model. First, an analysis was conducted for statistical algorithmic model. After various data transformation and regression analysis, it was concluded that no good model was available. Therefore, non-algorithmic model was suggested for analysis, which has random distribution of residuals and makes good performance using RBF (Radial Basis Function) network. Since the model provides a standard to determine the required size of development team, it ran be used as management information.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.307-318
• /
• 2008

One of the primary issues confronting XML message brokers is the difficulty associated with processing a large set of continuous XPath queries over incoming XML seams. This paper proposes a novel system designed to present an effective solution to this problem. The proposed system transforms multiple XPath queries before their run-time into a new region-based data structure, called an XP-table, by sharing their common constraints. An XP-table is matched with a stream relation (SR) transformed from a target XML stream by a SAX parser. This arrangement is intended to minimize the runtime workload of continuous query processing. Also, system performance is estimated and verified through a variety of experiments, including comparisons with previous approaches such as YFilter and LazyDFA. The proposed system is practically linear- scalable and stable for evaluating a set of XPath queries in a continuous and timely fashion.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.593-602
• /
• 2005

Need for machine-understandable web (Semantic web) is increasing in order for users to exactly understand Web information resources and currently there are two main approaches to solve the problem. One is the Topic map developed by the ISO/IEC JTC 1 and the other is the RDF (Resource Description Framework), one of W3C standards. Semantic web supports all of the metadata of the Web information resources, thus the necessity of interoperability between the Topic map and the RDF is required. To address this issue, several conversion methods have been proposed. However, these methods have some problems such as loss of meanings, complicated structure, unnecessary nodes, etc. In this paper, a new method is proposed to resolve some parts of those problems. The method proposed is called NOWL (NO structural Warp and semantics Loss). NOWL method gives several contributions such as maintenance of the original a Topic map instance structure and elimination of the unnecessary nodes compared with the previous researches.

• KSCI Review
• /
• v.2 no.1
• /
• pp.55-67
• /
• 1995

Recently, it is possible to high speed transmission of the non-voiced data, including voice, data, moving image instead of voice only in the past by changing the communication method to digital form from analog owing to the development of semiconductor and computer technology which for information transmission of the remote point. By doing so, we can get the improvement of the noise effect and low cost but the loss of transmission bandwidth. It is necessary to take some method in oreder to reducing the fading which is propotional to transmission bandwidth during the transmission of radio communication channel, especially. When we design the digital communication system, we must considered to the fading effect in order to determination of the transmitting power, modulation /demodulation method, transmission speed, bit error rate. This paper mainly concerns to the method to the channel simulator which descrives the fading effect during the transmission by computer model and digital filter modeling of the radio fading channel by unsing the transmitting and received signal. By taking the inverse of the characteristic of the modeled filter, it is possible to improvement of the communication system by reducing the distortion and inter-symbol interference which occurs in the channel.

• Database Research
• /
• v.34 no.3
• /
• pp.69-85
• /
• 2018

Many researches proposed federated query engines to perform query on several homogeneous or heterogeneous datasets simultaneously that significantly improve the quality of query results. The existing techniques allow querying only over a few heterogeneous datasets considering the static binding using the non-standard query. However, we observe that a simultaneous system considering the integration of heterogeneous metadata standards can offer better opportunity to generalize the query over any homogeneous and heterogeneous datasets. In this paper, we propose a transparent federated engine (DRAZ) to query over multiple data sources using SPARQL. In our system, we first develop the ontology for a non-RDF metadata standard based on the metadata kernel dictionary elements, which are standardized by the metadata provider. For a given SPARQL query, we translate any triple pattern into an API call to access the dataset of corresponding non-RDF metadata standard. We convert the results of every API call to N-triples and summarize the final results considering all triple patterns. We evaluated our proposed DRAZ using modified Fedbench benchmark queries over heterogeneous metadata standards, such as DCAT and DOI. We observed that DRAZ can achieve 70 to 100 percent correctness of the results despite the unavailability of the JOIN operations.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.438-450
• /
• 2003

Spatial joins find pairs of objects that overlap with each other. In spatial joins using indexes, original-space indexes such as the R-tree are widely used. An original-space index is the one that indexes objects as represented in the original space. Since original-space indexes deal with sizes of objects, it is difficult to develop a formal algorithm without relying on heuristics. On the other hand, transform-space indexes, which transform objects in the original space into points in the transform space and index them, deal only with points but no sites. Thus, spatial join algorithms using these indexes are relatively simple and can be formally developed. However, the disadvantage of transform-space join algorithms is that they cannot be applied to original-space indexes such as the R-tree containing original-space objects. In this paper, we present a novel mechanism for achieving the best of these two types of algorithms. Specifically, we propose a new notion of the transform-space view and present the transform-space view join algorithm(TSVJ). A transform-space view is a virtual transform-space index based on an original-space index. It allows us to interpret on-the-fly a pre-built original-space index as a transform-space index without incurring any overhead and without actually modifying the structure of the original-space index or changing object representation. The experimental result shows that, compared to existing spatial join algorithms that use R-trees in the original space, the TSVJ improves the number of disk accesses by up to 43.1% The most important contribution of this paper is to show that we can use original-space indexes, such as the R-tree, in the transform space by interpreting them through the notion of the transform-space view. We believe that this new notion provides a framework for developing various new spatial query processing algorithms in the transform space.