• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.405-408
• /
• 2002

LSP(Line Spectrum Pairs) Parameter is used for speech analysis in vocoders or recognizers since it has advantages of constant spectrum sensitivity. low spectrum distortion and easy linear interpolation. However the method of transforming LPC(Linear Predictive Coding) into LSP is so complex that it takes much time to compute. Among conventional methods, the real root method is considerably simpler than others, but nevertheless, it still suffers from its jndeterministic computation time because the root searching is processed sequentially in frequency region. We suggest a method of reducing the LSP transformation time using voice characteristics The proposed method is to apply search order and interval differently according to the distribution of LSP parameters. in comparison with the conventional real root method, the proposed method results in about 46.5% reduction. And, the total computation time is reduce to about 5% in the G.723.1 vocoder.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.05a
• /
• pp.45-48
• /
• 2002

Consider the mean distance of Brownian motion on Riemannian manifolds. We obtain the first three terms of the asymptotic expansion of the mean distance by means of Stochastic Differential Equation(SDE) for Brownian motion on Riemannian manifold. This method proves to be much simpler for further expansion than the methods developed by Liao and Zheng(1995). Our expansion gives the same characterizations as the mean exit time from a small geodesic ball with regard to Euclidean space and the rank 1 symmetric spaces.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.209-212
• /
• 1996

In this paper, we propose to re-size images using an oblique projection operator instead of the orthogonal one in order to obtain faster, simpler, and more general algorithms. The main advantage is that it becomes perfectly feasible to use higher order models(e.g., splines of degree n 3). We develop the theoretical background and present a simple and practical implementation procedure that uses B-splines. Experiments show that the proposed algorithm consistently outperforms the standard interpolation method and that it essentially provides the same performance as the optimal procedure (least squares solution) with considerably less computations.

• Korea-Australia Rheology Journal
• /
• v.21 no.2
• /
• pp.143-146
• /
• 2009

Breakthrough of high Weisenberg number problem is related with keeping the positive definiteness of the conformation tensor in numerical procedures. In this paper, we suggest a simple method to preserve the positive definiteness by use of vector decomposition of the conformation tensor which does not require eigenvalue problem. We also derive the constitutive equation of tensor-logarithmic transform in simpler way than that of Fattal and Kupferman and discuss the comparison between the vector decomposition and tensor-logarithmic transformation.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1319-1322
• /
• 2003

We present a web document summarizer, simpler more condense than the existing ones, of a search engine. This summarizer generates summaries with a statistic-based summarization method using Clustering or MMR technique to reduce redundancy in the results, and that generates summaries using Perfect Link Graph. We compare the results with the summaries generated by human subjects. For the comparison, we use FScore. Our experimental results verify the accuracy of the summarization methods.

• Proceedings of the Korean Reliability Society Conference
• /
• 2001.06a
• /
• pp.463-469
• /
• 2001

An algorithm is presenter for generating the most probable states in decreasing order of probability of each unit. The proposed new algorithm in this note is compared with the existing methods regarding memory requirement and execution time. Our method is simpler and, judging from the computing experiment, it requires less memory size than the previously known methods and takes comparable execution time to previous methods for an acceptable level of criterion.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.37-50
• /
• 1997

We consider the channel allocation problem for the earth orbit (LEO) satellite systems. This problm is known to be NP-complete and a couple of heuristic algorithms have been developed. In this paper, we convert the problem into a simpler form through the concept of pattern. And we suggest another algorithm based on Simulated Annealing for this simplified problem. The results of performance comparison show that our method works very well. Simulation results are reported.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.83-85
• /
• 2012

Gait analysis through wearable sensors is becoming a key research topic in mobile. In gait analysis, step detection is one of the most important processes that will lay down the foundation for future implementation. In this paper, we will propose a simpler algorithm to determine and analyze the steps using accelerometer sensor built-in mobile phone that physically placed into the trouser pocket. This is the location where most of mobile devices are. With 5 volunteers walking in 160 seconds, the accuracy of this method is approximately 98.5%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1C
• /
• pp.8-13
• /
• 2006

A new RS(Reed Solomon) Decoder design method, using Galois Subfield GF($2^4$) Multiplier, is described. The Decoder is designed using Normalized error position stored ROM. Here New Inverse Calculator in GF($2^8$) is designed, which is simpler and faster than the classical GF($2^8$) direct inverse calculator, using the Galois Subfield GF($2^4$) Arithmatic operator.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.7
• /
• pp.30-36
• /
• 1998

Memory management is one of the most important problems in implementing viterbi decoders. This paper introduces a novel traceback scheme for memory management of high-speed viterbi decoders. The new method balances the read and the write oeprations by inserting dummy write operations into the traceback process, resulting in simpler memory access schemes. It is suitable for VLSI implementation since it uses minimal memory requirements, it does not need global interconnections, and its address genration shceme for accessig memory contents is very simple.