• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.928-936
• /
• 2004

This paper proposes simple and effective Contention Window (CW) adjusting algorithm to solve the fairness problem of the IEEE 802.11 under the Distributed Coordination Function (DCF). This adjusting algorithm can support variable packet length as well as both RTS/CTS access method and hidden nodes. Simulation results show that fairness problem can be very severe in the original MAC protocol of the wireless network. In case of implement our algorithm, fair sharing was enlarged prominently and the fairness sharing was improved about maximum 30%.

• Journal of IKEEE
• /
• v.14 no.3
• /
• pp.182-189
• /
• 2010

A new Adaptive neural state-feedback controller for the fully nonaffine pure-feedback nonlinear system are presented in this paper. By reformulating the original pure-feedback system to a standard normal form with respect to newly defined state variables, the proposed controller requires no backstepping design procedure. Avoiding backstepping makes the controller structure and stability analysis considerably simple. The proposed controller employs only one neural network to approximate unknown ideal controllers, which highlights the simplicity of the proposed neural controller. Simulation examples demonstrate the efficiency and performance of the proposed approach.

• Journal of Broadcast Engineering
• /
• v.14 no.6
• /
• pp.742-748
• /
• 2009

Most commercial digital still cameras use a single sensor array (e.g., CMOS or CCD) with color filter array (CFA) to reduce the cost and size. Since the image obtained with CFA has only one color value per pixel, the demosaicing is needed to acquire missing two color values. Although many demosaicing methods have been proposed, they still have artifacts such as rainbow and zippering artifact. In this paper, we propose the simple demosaicing algorithm using tendency of neighbor pixels with the enhanced weighting function. In the experimental results, our algorithm shows much better subjective qualities of the images than conventional demosaicing algorithm and improves objective qualities.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.10
• /
• pp.25-32
• /
• 2011

We have analyzed adjacent cell dependency of threshold voltage shift caused by the cell to cell interference, and we proposed a 3-adjacent-cell model to model the pattern dependency of the threshold voltage shift. The proposed algorithm is verified by using MATLAB simulation and measurement results. In the experimental results, we found that accuracy of the proposed simple 3-adjacient-cell model is comparable to the widely used conventional 8-adjacient-cell model. The Bit Error Rate (BER) of LSB and of MSB is improved by 28.9% and 19.8%, respectively, by applying the proposed algorithm based on 3-adjacent-cell model to 20nm-class 2-bit MLC NAND flash memories.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.6
• /
• pp.60-69
• /
• 2000

In this paper we propose a new two-color signal processing algorithm for efficient target tracking under complicated condition including interfernces such as background noises and countermeasures. For the efficient target tracking, we adopt two detection bands, and define the ratio between two band signals which represents the spectral distribution characteristics of a target or interference. The proposed algorithm detects the ratio of interference, and extracts only the target signal from the target and the interference mixed signal by using it. To evaluate the performance of the proposed algorithm, we apply it to a rosette tracker and perform various simulations. The simulation results show that the proposed algorithm extracts the target signal from the mixed signal well. The proposed algorithm is also ready to be applied to a real system since it is simple and adaptive for environment change.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.895-904
• /
• 2007

This paper proposes a robust sub-optimal smart antenna in Code Division Multiple Access (CDMA) basestation. It makes use of the property of the Least Mean Square (LMS) algorithm and the Conjugate Gradient Method (CGM) algorithm for beamforming processes. The weight update takes place at symbol level which follows the PN correlators of receiver module under the assumption that the post correlation desired signal power is far larger than the power of each of the interfering signals. The proposed algorithm is simple and has as low computational load as five times of the number of antenna elements(O(5N)) as a whole per each snapshot. The output Signal to Interference plus Noise Ratio (SINR) of the proposed smart antenna system when the weight vector reaches the steady state has been examined. It has been observed in computer simulations that proposed beamforming algorithm improves the SINR significantly compared to the single antenna case. The convergence property of the weight vector has also been investigated to show that the proposed hybrid algorithm performs better than CGM and LMS during the initial stage of the weight update iteration. The Bit Error Rate (BER) characteristics of the proposed array has also been shown as the processor input Signal to Noise Ratio (SNR) varies.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.29 no.5 s.236
• /
• pp.609-616
• /
• 2005

While the SIMPLE algorithm is most widely used for the simulations of flow phenomena that take place in the industrial equipments or the manufacturing processes, it is less adopted for the simulations of the free surface flow. Though the SIMPLE algorithm is free from the limitation of time step, the free surface behavior imposes the restriction on the time step. As a result, the explicit schemes are faster than the implicit scheme in terms of computation time when the same time step is applied to, since the implicit scheme includes the numerical method to solve the simultaneous equations in its procedure. If the computation time of SIMPLE algorithm can be reduced when it is applied to the unsteady free surface flow problems, the calculation can be carried out in the more stable way and, in the design process, the process variables can be controlled based on the more accurate data base. In this study, a modified SIMPLE algorithm is presented fur the free surface flow. The broken water column problem is adopted for the validation of the modified algorithm (MoSIMPLE) and for comparison to the conventional SIMPLE algorithm.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.1
• /
• pp.24-30
• /
• 1996

The ray tracing method, which is one of many photorealistic rendering techniques, requires heavy computational processing to synthesize images. Parallel processing can be used to reduce the computational processing time. A parallel algorithm for the ray tracing has been implemented and executed for various images on transputer systems. In order to develop a scalable parallel algorithm, a processor farming technique has been exploited. Since each image is divided and distributed to each farming processor, the scalability of the parallel system and load balancing are achieved naturally in the proposed algorithm. Efficiency of the parallel algorithm is obtained up to 95% for nine processors. However, the best size of a distributed task is much higher in simple images due to less computational requirement for every pixel. Efficiency degradation is observed for large granularity tasks because of load unbalancing caused by the large task. Overall, transputer systems behave as good scalable parallel processing system with respect to the cost-performance ratio.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.10 no.6
• /
• pp.87-94
• /
• 2006

Estimating moving vehicle loads is important in modeling design loads for bridge design and construction. The paper proposes a moving force identification algorithm using moment influence lines measured at multi-axes. Density estimation function was applied to estimate more than two wheel loads when estimated load values fluctuated severely. The algorithm has been examined through simulation studies on a simple-span plate-girder bridge. Influences of measurement noise and error in velocity on the identification results were investigated in the simulation study. Also, laboratory experiments were carried out to examine the algorithm. The load identification capability was dependent on the type and speed of moving loads, but the developed algorithm could identify loads within 10% error in maximum.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11C
• /
• pp.1581-1591
• /
• 2004

In this paper, we investigate the design of three low-complexity joint estimation algorithms(LJEAs) for frequency offset and carrier phase. The proposed LJEAs are based on the interpolation technique of correlation values of the received signal in frequency and phase domains. With these algorithms, the estimation ranges $\Delta$f$_{d}$${\times}$T$_{s}$ . are less than 1/2N$_{s}$ , and 1/N$_{s}$ which are comparable to conventional algorithms. The Proposed LJEAs require only 2N$_{s}$ or 4N$_{s}$ complex multiplications which are very simple compared with the conventional algorithms. Nevertheless the estimation accuracies of the LJEAs are as good as those of the conventional algorithms. Suitable areas of application include joint estimation of frequency offset and carrier phase in burst-mode digital transmission such as satellite communications.