• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.91-97
• /
• 1996

This paper proves by straightforward computation an interesting property of a recursive indexing: it preserves the entropy of a geometrically-distributes stationary memoryless source. This result is a pleasant surprise because the recursive indexing though one-to-one, is a symbol-to-string mapping and the entropy is measured in terms of the source symbols. This preservation of the entropy implies that the minimum average number of bits needed to represent a geometric memoryless source by the recursive indexing followed by a good binary encoder of a finite imput alphabet remains the same as that by a good encoder of an infinite input alphabet. Therefore, the recursive indexing theoretically keeps coding optimality intact. For this reason recursive indexing can provide an interface for a binary code with a finite code book that performs reasonably well for a source with an infinite alphabet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.865-873
• /
• 2004

MPEG-2 Advanced Audio Coding(AAC) is widely used in the multi-channel audio compression standards. And it combines hi인-resolution filter bank prediction techniques, and Huffman coding algorithm to achieve the broadcast-quality audio level at very low data rates. The forward and inverse modified discrete transforms which are operated in the encoder and the decoder of the filter bank need many computations. In this paper, we propose suitable recursive structure at IMDCT processing for MPEG-2 AAC real-time decoder. We confirm the memory, the computation speed and complexity of the proposed structure.

• 전기의세계
• /
• v.31 no.3
• /
• pp.204-208
• /
• 1982

The objective of this paper is to present a digital method for improving the lateral resolution of the B-scan images in the medical applications of ultrasound. The method is based upon a mathematical model of the lateral blurring caused by the finite beam width of the transducers. This model provides a simple method of applying a recursive scheme for image restoration with fast computation time. The point spread function (P.S.F.) can be measured by the reflective signals after scanning the small pins located along the depth of interest. From the measured P.S.F., one can compute the coefficient matrices of the inverse discrete-time dynamic state variable equation of the blurring process. Then, a recursive scheme for deblurring is applied to the recorded B-scan to improve the lateral resolution. One major advantage of the present recursive scheme over the transform method is in its applicability for the space-variant imaging, such as in the case of the rotational movement of transducer.

• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.1
• /
• pp.8-15
• /
• 1999

One of the main reason advocating redundant manipulators' superiority in application is that they can afford to optimize a dexterity measure, for example the manipulability measure. However, to obtain the gradient of the manipulability is not an easy task in case of general manipulator with high degrees of redundancy. This article proposes a method to compute the gradient of the manipulability, based on recursive algorithm to compute the Jacobian and its derivative using Denavit-Hartenberg parameters only. To characterize the null motion of redundant manipulators, the null space matrix using square minors of the Jacobian is also proposed. With these capabilities, the inverse kinematics of a redundant manipulator system can be done automatically. The result is easily extended to dual manipulator system using the relative kinematics.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2296-2298
• /
• 2001

This is to discuss on the robust identification method using the Caratheodory -Fejer theorem. The robust identification method in this paper points out the question at issue brought from numerical analysis in case of Zhou and Kimura method and carries out recursive computation considering the presence of probable noise. Effectiveness of the proposed method is verified theoretically through the numerical simulation.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.1-15
• /
• 2017

Kanenobu has given infinite families of knots with the same HOMFLY polynomial invariant but distinct Alexander module structure. In this paper, we give a recursive formula for the Khovanov cohomology of all Kanenobu knots K(p, q), where p and q are integers. The result implies that the rank of the Khovanov cohomology of K(p, q) is an invariant of p + q. Our computation uses only the basic long exact sequence in knot homology and some results on homologically thin knots.

• Korean Journal of Optics and Photonics
• /
• v.35 no.4
• /
• pp.164-169
• /
• 2024

We applied recursive numerical computation to create a basic design of a camera optical module for mobile phones. To enhance the resolution performance for a 38-degree field of view, we constructed the optical system with six non-spherical lenses. However, to increase its applicability to a compact mobile phone, we limited the overall length to 5 mm in the design. Using the data obtained from the basic design, we proceeded with optimization design using the Zemax design tool. The optimized optical system achieved a resolution performance with a modulation transfer function value of more than 19% for a 280 lines/mm pattern and image distortion within 1.0% for all wavelength rays. In this paper, we verify the feasibility of using recursive numerical computation for the basic design of a compact mobile phone camera.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.3
• /
• pp.427-432
• /
• 2018

This paper uses a recursive least squares method to estimate the projectile motion trajectory of an object in real time. The equations of motion of the object are obtained considering the air resistance which occurs in the actual experiment environment. Because these equations consider air resistance, parameter estimation of nonlinear terms is required. However, nonlinear recursive least squares estimation is not suitable for estimating trajectory of projectile in that it requires a lot of computation time. Therefore, parameter estimation for real-time trajectory prediction is performed by recursive least square estimation after using Taylor series expansion to approximate nonlinear terms to polynomials. The proposed method is verified through experiments by using VICON Bonita motion capture system which can get three dimensional coordinates of projectile. The results indicate that proposed method is more accurate than linear Kalman filter method based on the equations of motion of projectile that does not consider air resistance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.5
• /
• pp.3132-3138
• /
• 2014

In many communication systems, intersymbol interference, DC and impulsive noise are hard-to-solve problems. For the purpose of cancelling such interferences, the concept of lagged cross-correlation of probability has been used for blind equalization. However, this algorithm has a large burden of computation. In this paper, a recursive method of the algorithm based on the lagged probability correlation is proposed. The summation operation in the calculation of gradient of the cost is transformed into a recursive gradient calculation. The recursive method shows to reduce the high computational complexity of the algorithm from O(NM) to O(M) for M symbols and N block data having advantages in implementation while keeping the robustness against those interferences. From the results of the simulation, the proposed method yields the same learning performance with reduced computation complexity.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2344-2353
• /
• 2018

A coupled recursive total least squares (CRTLS) algorithm is proposed for parameter estimation of permanent magnet synchronous machines (PMSMs). TLS considers the errors of both input variables and output ones, and thus achieves more accurate estimates than standard least squares method does. The proposed algorithm consists of two recursive total least squares (RTLS) algorithms for the d-axis subsystem and q-axis subsystem respectively. The incremental singular value decomposition (SVD) for the RTLS obtained by an approximate calculation with less computation. The performance of the CRTLS is demonstrated by simulation and experimental results.