• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.620-626
• /
• 2014

In this paper, we propose a parallel collaborative sphere decoder with a scalable architecture promising quasi-maximum likelyhood performance with a relatively small amount of computational resources. This design offers a hardware-friendly algorithm using a modified node operation through fixing the variable complexity of the critical path caused by the sequential nature of the conventional sphere decoder (SD). It also reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by tree pruning using collaboratively operated node operators. A Monte Carlo simulation shows that our proposed design can be implemented using only half the parallel operators compared to the approach using an ideal fully parallel scheme such as FSD, with only about a 7% increase of the normalized decoding time for MIMO dimensions of $16{\times}16$ with 16-QAM modulation.

• Nuclear Engineering and Technology
• /
• v.52 no.11
• /
• pp.2594-2600
• /
• 2020

A gamma camera system using radionuclide has a functional imaging technique and is frequently used in the field of nuclear medicine. In the gamma camera, it is extremely important to improve the image quality to ensure accurate detection of diseases. In this study, we designed a blind-deconvolution framework after a noise-reduction algorithm based on a non-local mean, which has been shown to outperform conventional methodologies with regard to the gamma camera system. For this purpose, we performed a simulation using the Monte Carlo method and conducted an experiment. The image performance was evaluated by visual assessment and according to the intensity profile, and a quantitative evaluation using a normalized noise-power spectrum was performed on the acquired image and the blind-deconvolution image after noise reduction. The result indicates an improvement in image performance for gamma camera images when our proposed algorithm is used.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.63
• /
• pp.33-43
• /
• 2001

To estimate the reliability of a large and complex network with a small variance, we propose two dynamic Monte Carlo sampling methods: the sequential minimal cut set (SMCS) and the sequential minimal path set (SMPS) methods. These methods do not require all minimal cut sets or path sets to be given in advance and do not simulate all arcs at each trial, which can decrease the valiance of network reliability. Based on the proposed methods, we develop the importance sampling estimators, the total hazard (or safety) estimator and the hazard (or safety) importance sampling estimator, and compare the performance of these simulation estimators. It is found that these estimators can significantly reduce the variance of the raw simulation estimator and the usual importance sampling estimator. Especially, the SMCS algorithm is very effective in case that the failure probabilities of arcs are low. On the contrary, the SMPS algorithm is effective in case that the success Probabilities of arcs are low.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.961-971
• /
• 1996

The effect of inband TDMA narrow band jammers to DS-CDMA system performance and the suppression techniques are investigated using Monte Carlo simulations. TIA stantard North American Digital Cellular wea used as jammer. Levinson Dubin and conventional recursive least square algorithm were emphasized since these techniques can be implemented with a few DSPs for CDMA application. Two filter structures, i.e., complex suppression filter and real suppression filter in each inphase and quadrature channels, are investigated and their performances are compared. Complex suppression filter with Levinson Durbin algorithm of 20msec updata rate is the most promising with respect to implementation and performance poit of view. Implementation feasibility is discussed and the channel capacity lost by suppression is computed.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.1
• /
• pp.123-131
• /
• 2014

An INS/vision integrated navigation algorithm is proposed for environments with insufficient number of landmarks. In the proposed algorithm, the raw measurements on the focal plane are directly used in order to cope with the situation where the number of landmarks are not sufficient. In addition to this, the combination of landmarks, which has smallest value of DOP, is used in the update of measurement in order to improve navigation performance. In order to evaluate the performance of the proposed integrated navigation system, Monte-Carlo simulation and van test was performed. The results of the simulation and experiment show that the proposed navigation system gives better navigation performance than an INS/vision integrated navigation system which does not use the raw measurements on the focal plane and the navigation system provides navigation solutions even in environments with insufficient number of landmarks.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2006.05a
• /
• pp.3-7
• /
• 2006

Development of light sources has been constantly grown for a high efficacy and long life. And, the design of luminaires has ben developed for the reflection and refraction of light mechanism. But it has been not enough to study for the refraction of light mechanism. Therefore, this study aims to study for the refraction of light mechanism to using Monte-Carlo method and Ray-tracing method. In addition, the purpose of this study is to shu calculation process for development of 3 dimensional planar prism design algorithm in orer to use the results of photometric data that is able to obtain various luminous intensity distribution.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.4
• /
• pp.124-132
• /
• 2008

In this paper, a dynamical filter called the Highest Probability Data Association Filter(HPDAF) improved by adding target feature information is proposed for robust target detection and tracking in clutter. IIR contains 2-dimensional kinematic coordinate, intensity, and feature information. In data association of the HPDAF for track initiation, feature information is utilized in addition to coordinate and intensity information. The performance of the proposed HPDA algorithm is tested and compared with the conventional HPDAF algorithm for track initiation by a series of Monte Carlo simulation runs for a 3-dimensional missile-target engagement. scenario.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.5
• /
• pp.739-747
• /
• 2010

In this paper, we propose new data association method called the Highest Probability Data Association(HPDA) using a Signal Amplitude information ordering method applied to active sonar tracking and track initiation in cluttered environment. The performance of HPDA is tested in a series of Monte Carlo simulations runs and is compared with the existing Probabilistic Data Association with Amplitude Information(PDA-AI) for active sonar tracking in clutter. The proposed HPDA algorithm is also applied to automatic track initiation in clutter and its performance is compared with the existing IPDA-AI algorithm.

• Structural Engineering and Mechanics
• /
• v.5 no.2
• /
• pp.115-126
• /
• 1997

Importance sampling methods have been developed with the aim of reducing the computational costs inherent in Monte Carlo methods. This study proposes a new algorithm called the adaptive kernel method which combines and modifies some of the concepts from adaptive sampling and the simple kernel method to evaluate the structural reliability of time variant problems. The essence of the resulting algorithm is to select an appropriate starting point from which the importance sampling density can be generated efficiently. Numerical results show that the method is unbiased and substantially increases the efficiency over other methods.

• Journal of Integrative Natural Science
• /
• v.2 no.2
• /
• pp.55-58
• /
• 2009

A ligand-receptor docking program is an indispensible tool in modern pharmaceutical design. An accurate prediction of small molecular docking pose to a receptor is essential in drug design as well as molecular recognition. An effective docking program requires the ability to locate a correct binding pose in a surprisingly complex conformational space. However, there is an inherent difficulty to predict correct binding pose. The odds are more demanding than finding a needle in a haystack. This mainly comes from the flexibility of both ligand and receptor. Because the searching space to consider is so vast, receptor rigidity has been often applied in docking programs. Even nowadays the receptor may not be considered to be fully flexible although there have been some progress in search algorithm. Improving the efficiency of searching algorithm is still in great demand to explore other applications areas with inherently flexible ligand and/or receptor. In addition to classical search algorithms such as molecular dynamics, Monte Carlo, genetic algorithm and simulated annealing, rather recent algorithms such as tabu search, stochastic tunneling, particle swarm optimizations were also found to be effective. A good search algorithm would require a good balance between exploration and exploitation. It would be a good strategy to combine algorithms already developed. This composite algorithms can be more effective than an individual search algorithms.