Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartA
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 11A, Issue 7 - Dec 2004
Volume 11A, Issue 6 - Oct 2004
Volume 11A, Issue 5 - Oct 2004
Volume 11A, Issue 4 - Aug 2004
Volume 11A, Issue 3 - Jun 2004
Volume 11A, Issue 2 - Apr 2004
Volume 11A, Issue 1 - Feb 2004
Volume 11, Issue 2 - 00 2004
Volume 11, Issue 1 - 00 2004
Selecting the target year
Bit-Parallel Systolic Divider in Finite Field GF(2
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 109~114
DOI : 10.3745/KIPSTA.2004.11A.2.109
This paper presents a high-speed bit-parallel systolic divider for computing modular division A(
) mod G(
) in finite fields GF
. The presented divider is based on the binary GCD algorithm and verified through FPGA implementation. The proposed architecture produces division results at a rate of one every 1 clock cycles after an initial delay of 5m-2. Analysis shows that the proposed divider provides a significant reduction in both chip area and computational delay time compared to previously proposed systolic dividers with the same I/O format. In addition, since the proposed architecture does not restrict the choice of irreducible polynomials and has regularity and modularity, it provides a high flexibility and Scalability with respect to the field size m. Therefore, the proposed divider is well suited to VLSI implementation.
Implementation of Multiple-Valued Adder and Multiplier Using Current-Mode CMOS
Seong, Hyeon-Kyeong ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 115~122
DOI : 10.3745/KIPSTA.2004.11A.2.115
In this paper, the multiple-valued adders and multipliers are implemented by current-mode CMOS. First, we implement the 3-valued T-gate and the 4-valued T-gate using current-mode CMOS which have an effective availability of integrated circuit design. Second we implement the circuits to be realized 2-variable 3-valued addition table and multiplication table over finite fields
, and 2-variable 4-valued addition table and multiplication table over finite fields
with the multiple-valued T-gates. Finally, these operation circuits are simulated under
CMOS standard technology,
unit current, and 3.3V VDD voltage Spice. The simulation results have shown the satisfying current characteristics. The 3-valued adder and multiplier, and the 4-valued adder and multiplier implemented by current-mode CMOS is simple and regular for wire routing and possesses the property of modularity with cell array. Also, since it is expansible for the addition and multiplication of two polynomials in the finite field with very large m, it is suitable for VLSI implementation.
Development of Bluetooth Protocol Stack on Embedded System
Lee, Sang-Hak ; Chung, Tae-Choong ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 123~128
DOI : 10.3745/KIPSTA.2004.11A.2.123
Recent advancement in RF technology and wireless communications has enabled the development of noble networks. Bluetooth that can be used in various application field is a kind of WPAN(Wireless Personal Area Network) standard that is widely known. Bluetooth enables voice and data applications to operate simultaneously. Various applications have been implemented based on standard Profiles. In this paper, we describes the development of Biuetooth network AP(Access Point) system for network connection of Bluetooth devices. Unlike headset, mouse, and keyboard, the access point should have capability to support multiple connection and stabilized network throughput. We have designed and developed the hardware system, core stack and profiles on embedded system to comply with standard specification. Our system showed compatibility and good protocol performance through testing with lots of products that is available in market.
Enhanced Bitmap Lookup Algorithm for High-Speed Routers
Lee, Kang-woo ; Ahn, Jong-suk ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 129~142
DOI : 10.3745/KIPSTA.2004.11A.2.129
As the Internet gets faster, the demand for high-speed routers that are capable of forwarding more than giga bits of data per second keeps increasing. In the previous research, Bitmap Trie algorithm was developed to rapidly execute LPM(longest prefix matching) process which is Well known as the Severe performance bottleneck. In this paper, we introduce a novel algorithm that drastically enhanced the performance of Bitmap. Trie algorithm by applying three techniques. First, a new table called the Count Table was devised. Owing to this table, we successfully eliminated shift operations that was the main cause of performance degradation in Bitmap Trie algorithm. Second, memory utilization was improved by removing redundant forwarding information from the Transfer Table. Lastly. the range of prefix lookup was diversified to optimize data accesses. On the other hand, the processing delays were classified into three categories according to their causes. They were, then, measured through the execution-driven simulation that provides the higher quality of the results than any other simulation techniques. We tried to assure the reliability of the experimental results by comparing with those that collected from the real system. Finally the Enhanced Bitmap Trie algorithm reduced 82% of time spent in previous algorithm.
An event-based timeout policy to decrease the overhead of session managements in network systems
Yim, Kang-bin ; Choi, Chang-seok ; Moon, Jong-wook ; Jung, Gi-hyun ; Choi, Kyung-hee ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 143~148
DOI : 10.3745/KIPSTA.2004.11A.2.143
The session management overhead on the network systems like firewalls or intrusion detection systems is getting grown as the session table is glowing. In this paper. we propose the event-based timeout management policy to increase packet processing throughput on network systems by decreasing the system`s timeout management overhead that is comparable to the existing time-based timeout management policies. Through some empirical studies using a session management system implemented in this paper we probed that the proposed policy provides better packet processing throughput than the existing policies.
An XML Compiler Generator using Object Oriented Attribute Grammar and SML
Choi, Jong-Myung ; Yoo, Chae-Woo ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 149~158
DOI : 10.3745/KIPSTA.2004.11A.2.149
XML as a standard for representing data and document structure is widely used in every area, and we have to write XML compilers which process the XML documents according to a user`s intention. Because it takes time and costs to write XML compilers by hand, we need some generators that automatically generate XML compilers. In this paper, we introduce an XML compiler generator named XCC. It reads DTD and semantic rules, and it generates XML compiler and Java classes which correspond to the elements defined in the DTD.
A Tree-Compare Algorithm for Similarity Evaluation
Kim, Young-Chul ; Yoo, Chae-Woo ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 159~164
DOI : 10.3745/KIPSTA.2004.11A.2.159
In the previous researches, tree comparison methods are almost studied in comparing weighted or labeled tree(decorated tree). But in this paper, we propose a tree comparison and similarity evaluation algorithm can be applied to comparison of two normal trees. The algorithm converts two trees into node string using unparser, evaluates similarity and finally return similarity value from 0.0 to 1.0. In the experiment part of this paper, we visually presented matched nodes and unmatched nodes between two trees. By using this tree similarity algorithm, we can not only evaluate similarity between two specific programs or documents but also detect duplicated code.
Implementation of A Clipping-based Conversion Server for Building Wireless Internet Sites
Cho, Seung-Ho ; Cha, Jeong-Hoon ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 165~174
DOI : 10.3745/KIPSTA.2004.11A.2.165
Because a quantity wireless internet contents is much less than wired internet contents, it exist high necessities that wired internet contents should be converted into wireless internet contents. The conversion server implemented in this paper, automatically recognizes the type of user agents when they request, retrieves source documents on the web site specified by an URL, generates metaXML documents as an intermediate form, and converts them wireless markup documents appropriate for user agents. The conversion server interoperates with the image converter for image conversion and the clipper which is an authoring tool for clipping existing wired internet documents. We performed experiments about capability of the conversion server transcoding static/dynamic web pages specified by an URL. According to performance results on dynamic web pages, the conversion server showed better throughput when a thread pool in the terror maintains 5 threads compared with 1 and 10 threads.
A Design of Multi-tier Structure Digital Content Distribution System based on Public Key
Ko, Il-Seok ; Na, Yun-Ji ; Cho, Dong-Wook ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 175~180
DOI : 10.3745/KIPSTA.2004.11A.2.175
Generally, as for the multimedia high quality contents, an illegality facsimile is possible without a damage of a quality. Also a distribution of contents duplicated illegality in an Internet is giving a great economic loss to digital contents provider. Therefore, a study for security and efficient distribution of digital contents is required. The most important issues in a design of digital contents distribution system are a user convenience, an execution speed and a security. In this study, we designed digital contents distribution system that used a web caching technology and an encryption/decryption technique on hierarchical structure. The proposed system was the digital contents distribution system that improved a security and execution speed, a convenience of a user. Also it verified performance superiority of a proposed system by an examination.
Controlling of UPnP Devices through Phone Interface in a Home Networking
Han, Sang-suk ; Eun, Seong-bae ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 181~188
DOI : 10.3745/KIPSTA.2004.11A.2.181
Recently most of the study about home-networking middleware take the way of web-control through the internet. Although the way of control using wire and PDA also be taken, but does not use standard techniques like UPnP and is limited in the technique controlling simple device. This paper is about the development of a Voice Gateway controlling many kinds of UPnP controlling devices connected to network. voice gateway is consisted of MPC850 module and phone interface and the set-top box, a part of computer in voice gateway is consisted of PSTN interface, information controlling process and the process of UPnP protocol. And I tried to implement this through entire system board.
Interactive Facial Expression Animation of Motion Data using Sammon`s Mapping
Kim, Sung-Ho ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 189~194
DOI : 10.3745/KIPSTA.2004.11A.2.189
This paper describes method to distribute much high-dimensional facial expression motion data to 2 dimensional space, and method to create facial expression animation by select expressions that want by realtime as animator navigates this space. In this paper composed expression space using about 2400 facial expression frames. The creation of facial space is ended by decision of shortest distance between any two expressions. The expression space as manifold space expresses approximately distance between two points as following. After define expression state vector that express state of each expression using distance matrix which represent distance between any markers, if two expression adjoin, regard this as approximate about shortest distance between two expressions. So, if adjacency distance is decided between adjacency expressions, connect these adjacency distances and yield shortest distance between any two expression states, use Floyd algorithm for this. To materialize expression space that is high-dimensional space, project on 2 dimensions using Sammon`s Mapping. Facial animation create by realtime with animators navigating 2 dimensional space using user interface.
The Design of 10-bit 200MS/s CMOS Parallel Pipeline A/D Converter
Chung, Kang-Min ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 195~202
DOI : 10.3745/KIPSTA.2004.11A.2.195
This paper introduces the design or parallel Pipeline high-speed analog-to-digital converter(ADC) for the high-resolution video applications which require very precise sampling. The overall architecture of the ADC consists of 4-channel parallel time-interleaved 10-bit pipeline ADC structure a]lowing 200MSample/s sampling speed which corresponds to 4-times improvement in sampling speed per channel. Key building blocks are composed of the front-end sample-and-hold amplifier(SHA), the dynamic comparator and the 2-stage full differential operational amplifier. The 1-bit DAC, comparator and gain-2 amplifier are used internally in each stage and they were integrated into single switched capacitor architecture allowing high speed operation as well as low power consumption. In this work, the gain of operational amplifier was enhanced significantly using negative resistance element. In the ADC, a delay line Is designed for each stage using D-flip flops to align the bit signals and minimize the timing error in the conversion. The converter has the power dissipation of 280㎽ at 3.3V power supply. Measured performance includes DNL and INL of +0.7/-0.6LSB, +0.9/-0.3LSB.
A study on the convergence of Wegmann`s method applying a low frequency pass filter
Song, Eun-Jee ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 203~206
DOI : 10.3745/KIPSTA.2004.11A.2.203
Wegmann`s method has been known as the most efficient one for the Theodorsen equation that is needed to solve conformal mapping. It was researched in the earlier studies (1). However divergence was revealed in some difficult problems by numerical experiment using Wegmann`s method. We analyzed the cause of divergence and proposed an improved method by applying a low frequency pass filter to Wegmann`s method. Numerical experiments using the improved method showed convergence for all divergent problems using the Wegmann`s method. In this paper, we prove theroretically the cause of convergence in the Numerical experiment using the improved method by applying a low frequency pass filter to Wegmann`s method. We make use of Fourier transforms in this theoretical proof of convergence.
Generation Tool of Learning Object Sequencing based on SCORM
Kuk, Sun-Hwa ; Park, Bock-Ja ; Song, Eun-Ha ; Jeong, Young-Sik ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 207~212
DOI : 10.3745/KIPSTA.2004.11A.2.207
In this paper, based on SCORM Sequencing Model, we propose the learning content structure which has structure informations of learning object and decision rules how to transfer learning object to learner. It is intended to provide the technical means for learning content objects to be easily shared and reused across multiple learning delivery environment. We develop the generation tool of learning object sequencing, for processing the learning with variable teaching methodologies. The teaming objects also are automatically packaged the PIE(Package Interchange File) to transmit with SCORM RTE(Run-Time Environment) and attached SCO(Sharable Content Object) function for tracking learner information.
A Study on Learning-Path Individualization System for Improving Learning Effects in Web-based Education
Baek, Jang-hyeon ; Kim, Yung-sik ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 213~222
DOI : 10.3745/KIPSTA.2004.11A.2.213
Today`s Web-based teaching-learning is developing in the direction that learners select and organize the contents, time and order of learning by themselves. That is, it is evolving to provide teaching-learning environment adaptive to individual learners` characteristics(their level of knowledge, pattern of study. areas of interest). This study analyzed learners` learning paths among the variables of learners` characteristics considered important in Web-based teaching- learning process using the Apriori algorithm and grouped learners who had similar learning paths. Based on the result, the author designed and developed a learning-path individualization system In order to provide learners with learning paths, Interface, the progress of learning etc. The proposed system is expected to provide optimal learning environment fit for learners` pattern of study and to be enhancing individual learner`s learning effects
A Study on the Design of LTSA-based Guide System for Elementary Math
Kim, Teh-Nyun ; Kim, Young-Mi ; Hwang, Dae-Joon ;
The KIPS Transactions:PartA, volume 11A, issue 2, 2004, Pages 223~230
DOI : 10.3745/KIPSTA.2004.11A.2.223
We suggest on this paper the LTSA-based Guide System for elementary mathematics, that is useful in managing of educational contents, avoiding redundant contents-development and improving reusability of contents. And it gives more satisfaction to the learner by making leaner choose his own courses. We considered the educational differences between learners, for the learning not to be a mechanical thing, by giving the educational course and method adequate to the learner By focusing on the educational differences between learners resulted from elementary educational adaption example implemented on the base of the international standard, we suggested a method for activating the coaching process in the system.