• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.65-72
• /
• 1992

The economical detection of dual-tone multifrequency(DTMF) signals is a important when developing cost-effective telecommunication equipment. This paper propose that the modified M-channel Goertzel algorithm can reduces the real-time processing and memory waste. By using this M. G. algorithm, it will compare and evaluate to the performance of the digital DTMF receivers using the G. A.

• Journal of the Korea Society for Simulation
• /
• v.20 no.4
• /
• pp.59-66
• /
• 2011

This work presents an algorithm for generating multi-RUN (m-RUN) deadlock avoidance policy based on simulated annealing algorithm. The basic idea of this method is to gradually improve the current m-RUN DAP after constructing an initial m-DAP by using simple m RUN DAPs. The search for a neighbor of the current m-RUN DAP is done by selecting and changing only one component of the current m-RUN, while accepting some unimproved solutions with some probability. It is examined for its performance by generating some sample system configurations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.1
• /
• pp.95-100
• /
• 2020

This paper related with the performance evaluation of mSE-MMA (modified Signed Error-Multi Modulus Algorithm) adaptive equalization algorithm which is possible to reduce the distortion that is occurs in nonlinear communication channel like as additive noise, intersymbol interference and fading. The SE-MMA algorithm are emerged in order to reducing the computational load compared to the presently MMA algorithm, it has the degraded equalization performance by this. In order to improve the performance degradation of SE-MMA, the mSE-MMA controls the step size according to the existence of arbitrary radius circle of equalizer output is centered at transmitted symbol point. The performance of proposed mSE-MMA algorithm were compared to present SE-MMA using the same channel and noise environment by computer simulation. For this, the recoverd signal constellation which is the output of equalizer, residual isi and MD (Maximum Distortion), MSE learning curve which is represents the convergence performance and SER which is represents the roburstness of noise were used as performance index. As a result of simulation, the mSE-MMA has more superior to the SE-MMA in every performance index, and was confirmed that mSE-MMA has roburstness to the noise in the SER performance than SE-MMA especially.

• Journal of Yeungnam Medical Science
• /
• v.16 no.2
• /
• pp.237-243
• /
• 1999

We conducted this study to find the optimal correction factor(${\alpha}$) of Lassen's linearization algorithm which has been applied for correction of flow-limited uptake at a high flow range in $^{99m}Tc$ d,l-hexamethylpropy leneamine oxime(HMPAO) and $^{99m}Tc$ ethyl cysteinate dimer(ECD). Ten patients with chronic cerebral infarction were involved in this study. We obtained the corrected $^{99m}Tc$ HMPAO and $^{99m}Tc$-ECD brain SPECT(single photon emission computed tomography) using the algorithm with ${\alpha}$ values that varied from 0.1 to 10 and compared the results with regional cerebral blood flow determined by positron emission tomography (PET-rCBF). The multi-modal volume registration by maximization of mutual information was used for matching between PET-rCBF and SPECT images. The highest correlation coefficient between $^{99m}Tc$-HMPAO and $^{99m}Tc$-ECD brain uptake and PET-rCBF was revealed at ${\alpha}$ 1.4 and 2.1, respectively. We concluded that the ${\alpha}$ values of Lassen's linearization algorithm for $^{99m}Tc$-HMPAO and $^{99m}Tc$-ECD brain SPECT images were 1.4 and 2.1, respectively to indicate cerebral blood flow with comparison of PET-rCBF.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.308-312
• /
• 2003

In this paper, we propose the M-QDMR algorithm for improvement QoS in the wire/wireless integrated environment. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that M-QDMR can simply and dynamically adjusts the construction of multicast tree with little delay and the most reducible bandwidth resources.

• IE interfaces
• /
• v.21 no.3
• /
• pp.254-261
• /
• 2008

Connected-(r,s)-out of-(m,n) : F system is an important topic in redundancy design of the complex system reliability and it's maintenance policy. Previous studies applied Monte Carlo simulation and genetic, simulated annealing algorithms to tackle the difficulty of maintenance policy problem. These algorithms suggested most suitable maintenance cycle to optimize maintenance pattern of connected-(r,s)-out of-(m,n) : F system. However, genetic algorithm is required long execution time relatively and simulated annealing has improved computational time but rather poor solutions. In this paper, we propose the ant colony optimization approach for connected-(r,s)-out of-(m,n) : F system that determines maintenance cycle and minimum unit cost. Computational results prove that ant colony optimization algorithm is superior to genetic algorithm, simulated annealing and tabu search in both execution time and quality of solution.

• Journal of Digital Convergence
• /
• v.13 no.10
• /
• pp.343-351
• /
• 2015

With the diverse services of the current M2M environment being expanded to the organizations, the corporations, and the daily lives, the possibility of the occurrence of the vulnerabilities of the security of the related technologies have become an issue. In order to solve such a problem of the vulnerability of the security, this thesis proposes the technique for applying the cryptography algorithm for the protection of the device key of the M2M environment. The proposed technique was based on the elliptic curve cryptography Through the key exchange and the signature exchange in the beginning, the security session was created. And the white box cipher was applied to the encryption that creates the white box table using the security session key. Application results cipher algorithm, Elliptic Curve Cryptography provides a lightweight mutual authentication, a session key for protecting the communication session and a conventional white-box cipher algorithm and was guaranteed the session key used to encrypt protected in different ways. The proposed protocol has secure advantages against Data modulation and exposure, MITM(Man-in-the-middle attack), Data forgery and Manipulation attack.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.7
• /
• pp.213-218
• /
• 2015

Given two strings X and Y (|X|=m, |Y|=n) over an alphabet ${\Sigma}$, the extended edit distance between X and Y can be computed using dynamic programming in O(mn) time and space. Recently, a parallel algorithm that takes O(m+n) time and O(mn) space using m threads to compute the extended edit distance between X and Y was presented. In this paper, we present an improved parallel algorithm using the shared memory on GPU. The experimental results show that our parallel algorithm runs about 19~25 times faster than the previous parallel algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7C
• /
• pp.627-634
• /
• 2007

When a higher-order modulation scheme (16QAM or 64QAM) is applied to the communications system using the nonlinear high power amplifier (HPA), the performance can be degraded by the nonlinear distortion of the HPA. The nonlinear distortion can be compensated by the adaptive nonlinear Volterra equalizer using the low-complexity LMS algorithm at the receiver. However, the LMS algorithm shows very slow convergence performance. So, in this paper, the parallel M-band discrete wavelet transformed LMS algorithm is proposed in order to improve the convergence speed. Throughout the computer simulations, it is shown that the convergence performance of the proposed method is superior to that of the conventional time-domain and transform-domain LMS algorithms.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.5
• /
• pp.902-907
• /
• 2008

Shape of the pulse waveform is affected by the visco-elasticity characteristics of the arterial wall and the reflection waves generated at the bifurcations of arterial branches. This study was designed to improve the accuracy for the extraction of pulse wave features, then proved the superiority of the developed algorithm by clinical evaluation. Upstroke point of the pulse wave was used as an extraction feature since it is minimally affected by the waveform variation. R-peak of the ECG was used as a reference to decide the minimum level, then intersection of the least squares of regression line was used as an upstroke point. Developed algorithm was compared with the existing minimum value detection algorithm and tangent-intersection algorithm using data obtained from 102 subjects. Developed algorithm showed the least standard deviation of $0.29{\sim}0.44\;m/s$ compared with that of the existing algorithms, $0.91{\sim}3.66\;m/s$. Moreover, the rate of standard deviation of more than 1.00m/s for the PWV values reduced with the range of $29.0{\sim}42.4%$, which proved the superiority of the newly developed algorithm.