• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.11a
• /
• pp.1037-1041
• /
• 2007

With the advent of sound field simulator, many sound fields have been reproduced by obtaining the impulse responses of specific acoustic spaces like famous concert hall, opera house. This sound field reproduction has been done by the linear convolution operation between the sound input signal and the impulse response of certain acoustic space. However, the conventional finite impulse response based linear convolution operation always makes real-time implementation of sound field generator impossible due to the large amount of computational burden. This paper introduces the fast convolution method using perceptual redundancy in the processed signals, input audio signal and room impulse response. Temporal and spectral psycho-acoustic filters considering masking effects are implemented in the proposed convolution structure. It reduces the computational burden of convolution methods for realtime implementation of a sound field generator. The conventional convolutions are compared with the proposed one in views of computational burden and sound quality. In the proposed method, a considerable reduction in the computational burden was realized with acceptable changes in sound quality.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.18 no.2
• /
• pp.231-237
• /
• 2008

With the advent of sound field simulator, many sound fields have been reproduced by obtaining the impulse responses of specific acoustic spaces like famous concert hall, opera house. This sound field reproduction has been done by the linear convolution operation between the sound input signal and the impulse response of certain acoustic space. However, the conventional finite impulse response based linear convolution operation always makes real-time implementation of sound field generator impossible due to the large amount of computational burden. This paper introduces the fast convolution method using perceptual redundancy in the processed signals, input audio signal and room impulse response. Temporal and spectral real-time masking blocks are implemented in the proposed convolution structure. It reduces the computational burden of convolution methods for real-time implementation of a sound field generator. The conventional convolutions are compared with the proposed one in views of computational burden and sound quality. In the proposed method, a considerable reduction in the computational burden was realized with acceptable changes in sound quality.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.3
• /
• pp.344-350
• /
• 2006

The software GPS receivers based on the SDR technology provide the ability to easily adapt the other signal processing algorithms without changing or modifying the hardware of the GPS receiver. However, it is difficult to implement the software GPS receivers using a commercial processor because of the heavy computational burden for processing the GPS signals in real-time. This paper proposes an efficient GPS signal processing scheme to reduce the computational burden for processing the GPS signals in the software GPS receiver, which uses a fundamental notion compressing the replica signals and the encoded look-up table method to generate correlation values between GPS signals and replica signals. In this paper, it is explained that the computational burden of the proposed scheme is much smaller than that of the typical GPS signal processing scheme. Finally, the processing time of the proposed scheme is compared with that of the typical scheme, and the improvement in the aspect of the computational burden is also shown.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2340-2344
• /
• 2003

This paper considers a tracking filter algorithm which can track a maneuvering target. Multiresolutional Interacting Multiple Model (MRIMM) algorithm is proposed to reduce computational burden. In this paper multiresolutional state space model equation and multiresolutional measurement equation are derived by using wavelet transform. This paper shows the outline of MRIMM algorithm. Simulation results show that MRIMM algorithm maintains a good tracking performance and reduces computational burden.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.83.2-83
• /
• 2001

This paper presents a new formulation approach to reduce computational burden of the direct kinematics of 6-dof haptic devices with three sets of a parallel-serial linkage. Their direct kinematics has been formulated through employing the Denavit-Hartenberg notation, which results in complicated formulation procedures and heavy computational burden. For reducing these problems, this paper reconfigures the haptic devices into an equivalent kinematic model of the 3-6 Stewart-Gough Platform that has three connecting joints on the moving platform. Moreover, the direct kinematics of the 3-6 Platform can be effectively formulated by using the proposed Tetrahedron Approach.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.329-337
• /
• 2016

With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

• Journal of Biomedical Engineering Research
• /
• v.17 no.3
• /
• pp.319-326
• /
• 1996

Clinical myography(EMG) is a technique for diagnosing neuromuscular disorders by analyzing the electrical signal that can be records by needle electrode during a muscular contraction. The EMG signal arises from electrical discharges that accompany the generation of force by groups of muscular fiber, and the analysis of EMG signal provides symptoms that can distinguish disorder of mLecle from disor- ders of nerve. One of the methods for analysis of EMG signal is to separate the individual discharge-the motor unit action potentials(MVAPS) - from EMG signal. But we can only observe the EMG signal that is a superimposed version of time delayed MUAPS. To obtain the information about MUAP(, i.e., position, firing number, magnitude etc), first of all, a method that can separate each MUAP from the EMG signal must be developed Although the methods for MUAP separation have been proposed by many researcherl they have required heavy computational burden. In this paper, we proposed a new method that has less computational burden and performs more reliable separation of superimposed EMG signal using wavelet filter which has multiresolution analysis as major property. As a result, we develope the separation algorithm of superimposed EMG signal which has less computational burden than any other researchers and exacutes exact separation process. The performance of this method has been discussed in the automatic resolving procedure which is neccessary to identify every firing of every motor unit from the EMG pattern.

• Journal of Positioning, Navigation, and Timing
• /
• v.12 no.1
• /
• pp.11-22
• /
• 2023

In this paper, we propose an efficient satellite selection method for multi-constellation GNSS. The number of visible satellites has increased dramatically recently due to multi-constellation GNSS. By the increased availability, the overall GNSS performance can be improved. Whereas, due to the increase of the number of visible satellites, the computational burden in implementing advanced processing such as integer ambiguity resolution and fault detection can be increased considerably. As widely known, the optimal satellite selection method requires very large computational burden and its real-time implementation is practically impossible. To reduce computational burden, several sub-optimal but efficient satellite selection methods have been proposed recently. However, these methods are prone to the local optimum problem and do not fully utilize the information redundancy between different constellation systems. To solve this problem, the proposed method utilizes the inter-system biases and geometric assignments. As a result, the proposed method can be implemented in real-time, avoids the local optimum problem, and does not exclude any single-satellite constellation. The performance of the proposed method is compared with the optimal method and two popular sub-optimal methods by a simulation and an experiment.

• Communications for Statistical Applications and Methods
• /
• v.7 no.1
• /
• pp.47-54
• /
• 2000

This article is concerned with the algorithm for the Chebyshev estimation with/without linear equality and/or inequality constraints. The algorithm employs a linear scaling transformation scheme to reduce the computational burden which is induced when the data set is quite large. The convergence of the proposed algorithm is proved. And the updating and orthogonal decomposition techniques are considered to improve the computational efficiency and numerical stability.

• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.1-6
• /
• 2016

The biased zero-error probability and its related algorithms require heavy computational burden related with some summation operations at each iteration time. In this paper, a recursive approach to the biased zero-error probability and related algorithms are proposed, and compared in the simulation environment of shallow water communication channels with ambient noise of biased Gaussian and impulsive noise. The proposed recursive method has significantly reduced computational burden regardless of sample size, contrast to the original MBZEP algorithm with computational complexity proportional to sample size. With this computational efficiency the proposed algorithm, compared with the block-processing method, shows the equivalent robustness to multipath fading, biased Gaussian and impulsive noise.