• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1A
• /
• pp.10-27
• /
• 2005

In this paper, we propose a high level design architecture of WCDMA(UMTS) base station modem and synchronization algorithms applied to the proposed architecture. Also analysis of each synchronization algorithm and performance evaluation of fixed point designed modem are shown. Since the target system is base station modem, each synchronization algorithm is designed for its stable operation. To minimize implementation complexity, optimum fixed point design for best operation of synchronization algorithms is performed. We performed symbol level link simulation with fixed point designed modem simulator for data rate of 12.2kbps, 64kbps, 144kbps, and 384kbps. We compared performance results to the minimum requirements specified in 3GPP TS 25.104(Release 5). Extensive computer simulation shows that the proposed modem architecture has stable operation and outperform the minimum requirement by 2 dB. The proposed modem architecture has been applied in the implementation of WCDMA reverse link receiver modem chip successfully.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.11
• /
• pp.1137-1143
• /
• 2009

This paper presents the FPGA implementation of efficient algorithms for approximating exponential function based on floating point format data. The Taylor-Maclaurin expansion as a conventional approximation method becomes inefficient since high order expansion is required for the large number to satisfy the approximation error. A format converter is designed to convert fixed data format to floating data format, and then the real number is separated into two fields, an integer field and an exponent field to separately perform mathematic operations. A new assembly command is designed and added to previously developed command set to refer the math table. To test the proposed algorithm, assembly program has been developed. The program is downloaded into the Altera DSP KIT W/STRATIX II EP2S180N Board. Performances of the proposed method are compared with those of the Taylor-Maclaurin expansion.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2011.06a
• /
• pp.285-286
• /
• 2011

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.8
• /
• pp.578-584
• /
• 2004

The CSVM(Current Support Vector Machine) that is a digital architecture performing all phases of recognition process including kernel computing, learning, and recall of SVM(Support Vector Machine) on a chip is proposed. Concurrent operation by parallel architecture of elements generates high speed and throughput. The classification problems of bio data having high dimension are solved fast and easily using the CSVM. Quadratic programming in original SVM learning algorithm is not suitable for hardware implementation, due to its complexity and large memory consumption. Hardware-friendly SVM learning algorithms, kernel adatron and kernel perceptron, are embedded on a chip. Experiments on fixed-point algorithm having quantization error are performed and their results are compared with floating-point algorithm. CSVM implemented on FPGA chip generates fast and accurate results on high dimensional cancer data.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.5
• /
• pp.841-849
• /
• 2001

The pixel information of the object was obtained sequentially and pixels were clustered to a label by the line labeling method. Feature points were determined by finding the slope for edge pixels after selecting the fixed number of edge pixels. The slope was estimated by the least square method to reduce the detection error. Once a matching point was determined by comparing the feature information of the object and the pattern, the parameters for translation, scaling and rotation were obtained by selecting the longer line of the two which passed through the matching point from left and right sides. Finally, modified Hausdorff Distance has been used to identify the similarity between the object and the given pattern. The multi-label method was developed for recognizing the patterns with more than one label, which performs the modified Hausdorff Distance twice. Experiments have been performed to verify the performance of the proposed algorithm and method for simple target image, complex target image, simple pattern, and complex pattern as well as the partially hidden object. It was proved via experiments that the proposed image matching algorithm for recognizing the object had a good performance of matching.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.23 no.2
• /
• pp.211-217
• /
• 2005

The general rule of boundary delimitation is the principle of equidistance. The principle of equidistance is a method that determine boundary delimitation from the fixed distant of baseline or basepoint. But there is no artificial and natural object in the sea to determine boundary. And the principle of equidistant can't be applied in every cases, because of the local characteristic of ground. In this paper, we suggest Three-Point Algorithm which is effective algorithm for maritime boundary delimitation. And the main objective of this study is to get capability of maritime boundary delimitation technique.

• Kyungpook Mathematical Journal
• /
• v.49 no.4
• /
• pp.667-674
• /
• 2009

In this paper, a new one-step iterative scheme with error for approximating common fixed points of asymptotically quasi-nonexpansive type nonself-mappings in Banach space is defined. The results obtained in this paper extend and improve the recent ones, announced by H. Y. Zhou, Y. J. Cho, and S. M. Kang [Zhou et al.,(2007), namely, A new iterative algorithm for approximating common fixed points for asymptotically non-expansive mappings, published to Fixed Point Theory and Applications 2007 : 1-9], and many others.

• East Asian mathematical journal
• /
• v.17 no.1
• /
• pp.57-70
• /
• 2001

In this paper, we introduce a class of generalized quasivariational inclusions for fuzzy mappings and show its equivalence with a class of fixed point problems. Using this equivalence, we develop the Mann and Ishikawa type perturbed iterative algorithms for this class of generalized quasivariational inclusions. Further, we prove the existence of solutions for the class of generalized quasivariational inclusions and discuss the convergence criteria for the perturbed algorithms.

• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.613-622
• /
• 2012

In this paper, we propose a new algorithm to modify the standard Mann' process to have strong convergence for $k$-strictly pseudo-contractive non-self mapping in Hilbert spaces.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.81-84
• /
• 2000

Cellular automata are discrete dynamical systems whose behaviour is completely specified in terms of a local relation. If cellular automata convergence to fixed points, then it can be used to image processing. From the generalized Potts automata point of view, we propose in this paper a cellular automata technique for reducing image noise. To minimize blurring effect, an algorithm based on neighborhood median computation is Preferred. Experimental results are reported.