• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.2
• /
• pp.143-150
• /
• 2004

In this paper, a recursive digital filter realization for an ionospheric channel model is proposed. This realization is in the form of a cascade of identical second-order all-pass filters, and is determined by only three parameters; two coefficients of an all-pass section, and the number of sections. The values of these parameters are optimized by a nonlinear optimization algorithm called the "downhill simplex method", so that the resulting time delay function closely approximates that of the ionospheric channel model. Comparing with the nonrecursive digital filter realization, it can be shown that the proposed recursive-digital-filter-realization is advantageous in points of view for the numbers of filter coefficients and the realization.

• 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.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.6
• /
• pp.37-43
• /
• 1999

Two-way addressing method has been proposed for efficient VLSI implementation of Euclidean calculation circuit for pipelined Reed-Solomon decoder. This new circuit is operating with single clock while exploiting maximum parallelism, and uses register addressing instead of register shifting to minimize the switching power. Logic synthesis shows the circuit with the new scheme takes 3,000 logic gates, which is about 40% reduction from the previous 5,000 gate implementation. Computer simulation also shows the power consumption is about 3mW. The previous implementation with multiple clock consumed about 5mW.

• The Journal of Engineering Research
• /
• v.3 no.1
• /
• pp.85-95
• /
• 1998

In this study, we consider a recursive procedure to obtain the stationary probability distribution for analyzing Coxian queueing networks with finite queues. This network deals with multiple class customers. Due to the state space representing multiple class customers, the sub-matrices corresponding to states can not be square matrices and can not be inverted. Therefore, we introduce more complex recursive method to avoid the singular problem. The open queueing network that we study consists of 3 parallel first-level sources linked to a single second level queue. We consider two types of schemes for entering a queue. The first scheme is assumed to be the first-blocked-first-enter (FBFE) and the second scheme is the higher-priority-first-enter (HPFE). Arrival and service times are assume to have a Coxian distribution with two phases. Comparison between the resulting using Gauss-Seidel method and recursive procedure will be shown.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.2
• /
• pp.184-194
• /
• 2016

In existing identification methods for on-orbit spacecraft, such as eigensystem realization algorithm (ERA) and subspace method identification (SMI), singular value decomposition (SVD) is used frequently to estimate the modal parameters. However, these identification methods are often used to process the linear time-invariant system, and there is a lower computation efficiency using the SVD when the system order of spacecraft is high. In this study, to improve the computational efficiency in identifying time-varying modal parameters of large spacecraft, a faster recursive algorithm called fast approximated power iteration (FAPI) is employed. This approach avoids the SVD and can be provided as an alternative spacecraft identification method, and the latest modal parameters obtained can be applied for updating the controller parameters timely (e.g. the self-adaptive control problem). In numerical simulations, two large flexible spacecraft models, the Engineering Test Satellite-VIII (ETS-VIII) and Soil Moisture Active/Passive (SMAP) satellite, are established. The identification results show that this recursive algorithm can obtain the time-varying modal parameters, and the computation time is reduced significantly.

• The Korean Journal of Applied Statistics
• /
• v.20 no.3
• /
• pp.531-540
• /
• 2007

The recursive feature elimination for support vector machine is known to be useful in selecting relevant genes. Since the criterion for choosing relevant genes is the absolute value of a coefficient, the recursive feature elimination may suffer from a scaling problem. We propose a modified version of the recursive feature elimination algorithm using bootstrap. In our method, the criterion for determining relevant genes is the absolute value of a coefficient divided by its standard error, which accounts for statistical variability of the coefficient. Through numerical examples, we illustrate that our method is effective in gene selection.

• Journal of Broadcast Engineering
• /
• v.24 no.4
• /
• pp.633-642
• /
• 2019

Recently, the convolution neural network (CNN) model at a single image super-resolution (SISR) have been very successful. The residual learning method can improve training stability and network performance in CNN. In this paper, we propose a SISR using recursive residual network architecture by introducing dense skip connections for learning nonlinear mapping from low-resolution input image to high-resolution target image. The proposed SISR method adopts a method of the recursive residual learning to mitigate the difficulty of the deep network training and remove unnecessary modules for easier to optimize in CNN layers because of the concise and compact recursive network via dense skip connection method. The proposed method not only alleviates the vanishing-gradient problem of a very deep network, but also get the outstanding performance with low complexity of neural network, which allows the neural network to perform training, thereby exhibiting improved performance of SISR method.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.6
• /
• pp.736-747
• /
• 2006

Simultaneous Localization and Map Building(SLAM) is one of the fundamental problems in robot navigation. The Extended Kalman Filter(EKF), which is widely adopted in SLAM approaches, requires extensive computation. The conventional particle filter also needs intense computation to cover a high dimensional state space with particles. This paper proposes an efficient SLAM method based on the recursive unscented Kalman filtering in an environment including a large number of landmarks. The posterior probability distributions of the robot pose and the landmark locations are represented by their marginal Gaussian probability distributions. In particular, the posterior probability distribution of the robot pose is calculated recursively. Each landmark location is updated with the recursively updated robot pose. The proposed method reduces filtering dimensions and computational complexity significantly, and has produced very encouraging results for navigation experiments with noisy multiple simultaneous observations.

• ETRI Journal
• /
• v.25 no.2
• /
• pp.144-147
• /
• 2003

We propose a new serial concatenation scheme for space-time and recursive convolutional codes, in which a space-time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi-static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.512-517
• /
• 2007

In the previous development of the recursive thermostat chained fully flexible cell molecular dynamics simulation, implicit time integration method such as generalized leapfrog integration is used. The implicit algorithm is very much complicated and not easy to show time reversibility because it is solved by the nonlinear iterative procedure. Thus we develop simple, explicit symplectic time integration formula for the recursive thermostat chained fully flexible unit cell simulation. Uniaxial tension test is performed to verify the present explicit algorithm. We check that the present simulation satisfies the ergodic hypothesis for various values of fictitious mass and coefficient of multiple thermostat system. The proposed method should be helpful to predict mechanical and thermal behavior of nano-scale structure.