• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1183-1186
• /
• 1998

Adaptive nois canceller can extract the noiseremoved spech in noisy speech signal by adapting the filter-coefficients to the background noise environment. A kind of LMS algorithm is one of the most popular adaptive algorithm for noise cancellation due to low complexity, good numerical property and the merit of easy implementation. However there is the matter of increasing misadjustment at voiced speech signal. Therefore the demanded speech signal may be extracted. In this paper, we propose a fast and noise robust wavelet packet adaptive noise canceller with NLMS-SUM method LMS combined algorithm. That is, we decompose the frequency of noisy speech signal at the base of the proposed analysis tree structure. NLMS algorithm in low frequency band can efficiently dliminate the effect of the low frequency noise and SUM method LMS algorithm at each high frequency band can remove the high frequency nosie. The proposed wavelet packet adaptive noise canceller is enhanced the more in SNR and according to Itakura-Satio(IS) distance, it is closer to the clean speech signal than any other previous adaptive noise canceller.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.4
• /
• pp.1-7
• /
• 1998

This paper describes a meshless of element-free method based on fuzzy knowledge processing. To efficiently simulate complicated physical phenomena with dynmics and non-linear ploblem using computational mechanics, special method is required such as parallel processing or adaptive analysis techniques. However, the conventional finite element method is too complicated to be employed in the above cases. In order to reduce the above complexity of the conventional finite element analysis systms, the so called meshles finite elements as an input information have been stuided. Node is generated if its distance form existing node points is similar to the node spacing fuction at the point. The node spacing function is well controlled by the fuzzy knowledge processing Practical performances of the present system are demonstrated through several three-dimensional(3D) problems.

• Journal of electromagnetic engineering and science
• /
• v.3 no.1
• /
• pp.50-56
• /
• 2003

This paper proposes a coding scheme of control channel for mobile packet communication to maximize the minimum Hamming distance, which is based on shifting of basis vectors of Reed Muller code with optimized dynamic puncturing and/or(partial) sequence repetition. Since the maximum likelihood decoding can be performed using the extremely simple FHT(Fast Hadamard Transformation), it is suitable for real time optimum decoding of control channel information with very little complexity. We show applications of the proposed coding method to TFCI(Transport Format Combination Indicator) code in split and normal modes of 3GPP W-CDMA system. We also discuss how this method can reduce rate indication error over AWGN(Additive White Gaussian Noise) as well as fading channels when the proposed coding scheme is applied to 1xEV-DV system of $3^{rd}$TEX> generation partnership project 2(3GPP2) to indicate the data rate transmitted on the reverse traffic channel by a Mobile Station(MS).

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.459-465
• /
• 2010

A new blind equalization algorithm that is based on maximizing the probability that the constant modulus errors concentrate near zero is proposed. The cost function of the proposed algorithm is to maximize the probability that the equalizer output power is equal to the constant modulus of the transmitted symbols. Two blind information-theoretic learning (ITL) algorithms based on constant modulus error signals are also introduced: One for minimizing the Euclidean probability density function distance and the other for minimizing the constant modulus error entropy. The relations between the algorithms and their characteristics are investigated, and their performance is compared and analyzed through simulations in multi-path channel environments. The proposed algorithm has a lower computational complexity and a faster convergence speed than the other ITL algorithms that are based on a constant modulus error. The error samples of the proposed blind algorithm exhibit more concentrated density functions and superior error rate performance in severe multi-path channel environments when compared with the other algorithms.

• Smart Structures and Systems
• /
• v.15 no.4
• /
• pp.1063-1083
• /
• 2015

The main purpose of this research is to utilize simple mathematical models to depict the vibration behavior and the resulted sound field of a piezoelectric disk for ultrasonic transducers. Instead of using 1-D vibration model, coupled effect between the thickness and the radial motions was considered to be close to the real vibration behavior. Moreover, Huygens-Fresnel principle was used in both incident and reflected waves to analyze the sound field under obstacles in finite distance. Results of the tested piezoelectric disk show that, discrepancies between the simulation and experiment are 2.5% for resonant frequency and 12% for resulted sound field. Therefore, the proposed method can be used to reduce the complexity in modeling vibration problems, and increase the reliability on analyzing piezoeletric transducers in the design stage.

• The Journal of Korea Robotics Society
• /
• v.4 no.4
• /
• pp.312-319
• /
• 2009

This paper proposes a low-complexity indoor localization method of mobile robot under the dynamic environment by fusing the landmark image information from an ordinary camera and the distance information from sensor nodes in an indoor environment, which is based on sensor network. Basically, the sensor network provides an effective method for the mobile robot to adapt to environmental changes and guides it across a geographical network area. To enhance the performance of localization, we used an ordinary CCD camera and the artificial landmarks, which are devised for self-localization. Experimental results show that the real-time localization of mobile robot can be achieved with robustness and accurateness using the proposed localization method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.102-109
• /
• 2001

In this paper, in order to reduce the computational complexity of codebook, we propose a fast search algorithm which takes advantage of the information generated in the process of the self-organizing map (SOM). In an attempt to demonstrate the influence of the ordering of codebook on the performance of the partial distance search (PDS), we present the results of computation savings for three cases of ordering of codebooks.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.135-140
• /
• 2003

In this paper, we investigate the error performance of a serially concatenated system using a nonrecursive convolutional code as the outer code and a recursive QPSK space-time trellis code as the inner code on quasi-static and rapid Rayleigh fading channels. At the receiver, we consider iterative decoding based on the maximum a posteriori (MAP) algorithm. The performance is evaluated by means of computer simulations and it is shown that better error performance can be obtained by using low complexity outer and/or inner codes and the Euclidean distance criterion based recursive space-time inner codes. We also obtain new systems with large number of trasmit and/or receive antennas providing good error performance.

• Journal of the Korean Institute of Rural Architecture
• /
• v.1 no.3
• /
• pp.77-86
• /
• 1999

Recently the change of social environment has influence on the living of human for the complexity and the variety. And so the relation of architecture and function required the complex space. The government tried to complex the service for healthcare and social welfare by the exhibition model for health and welfare center. In this sence, this study aims to explore the basic data for the planning of location to the community welfare center and the healthcare facility in a district by grasping the difference of level at facility among region. In sum, the useful data were collected, analyzed, and synthesized through this study and could be used in the relevant research in the future as reference informations.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.429-437
• /
• 2005

Sensor localization has become an essential requirement for realistic applications over wireless sensor networks (WSN). In this paper we propose an ad hoc localization algorithm that is infrastructure-free, anchor-free, and computationally efficient with reduced communication. A novel combination of distance and direction estimation technique is introduced to detect and estimate ranges between neighbors. Using this information we construct unidirectional coordinate systems to avoid the reflection ambiguity. We then compute node positions using a transformation matrix [T], which reduces the computational complexity of the localization algorithm while computing positions relative to the fixed coordinate system. Simulation results have shown that at a node degree of 9 we get $90\%$ localization with $20\%$ average localization error without using any error refining schemes.