• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.6
• /
• pp.51-57
• /
• 2010

In this paper, we propose a new adaptive MIMO switching algorithm that provides the optimal trade-off between throughput and reliability of data in MIMO system. The proposed algorithm is based on the variable packet error predictor which is robust for channel estimation error, and we show that our algorithm has a better spectrum efficiency than the conventional MIMO switching techniques about 8 percent point.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.17 no.31
• /
• pp.115-123
• /
• 1994

Group scheduling, which is a kind of operations scheduling based on the GT concept is analyzed in a multi-stage manufacturing system. The purpose of this research is to develop and evaluate a heuristic algorithm for determining gro up sequence and job sequence within each group to minimize a complex cost function, i.e. the sum of the total pe-nalty cost for tardiness and the total holding cost for flow time, in a multi-stage manufacturing system with group setup time dependent upon group sequence. A heuristic algorithm for group sc heduling is developed, and a numerical example is illustrated. For the evaluation of the pro-posed heuristic algorithm, the heuristic solution of each of 63 problems is compared with that of random scheduling. The result shows that the proposed heuristic algorithm provides better solution in light of the proposed cost function.

• The Korean Journal of Applied Statistics
• /
• v.33 no.4
• /
• pp.511-526
• /
• 2020

Single-cell RNA-sequencing (scRNA-seq) data consists of each cell's RNA expression extracted from large populations of cells. One main purpose of using scRNA-seq data is to identify inter-cellular heterogeneity. However, scRNA-seq data pose statistical challenges when applying traditional clustering methods because they have many missing values and high level of noise due to technical and sampling issues. In this paper, motivated by analyzing scRNA-seq data, we propose a novel spectral-based clustering method by imposing different weights on genes when computing a similarity between cells. Assigning weights on genes and clustering cells are performed simultaneously in the proposed clustering framework. We solve the proposed non-convex optimization using an iterative algorithm. Both real data application and simulation study suggest that the proposed clustering method better identifies underlying clusters compared with existing clustering methods.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.5
• /
• pp.917-922
• /
• 2018

In the conventional interchannel interference self-cancellation (ICI-SC) schemes, the length of sampling window is the same as the symbol length of orthogonal frequency division multiplexing (OFDM). Thus, the number of complex operations to compute the interference coefficient of each subchannel is significantly increased. To solve this problem, we present an approximated mathematical model for the coefficients of ICI-SC schemes. Based on the proposed approximation, we analyze mean squared error (MSE) and computational complexity of the ICI-SC schemes with the length of sampling window. As a result, the presented approximation has an error of less than 0.01% on the MSE compared to the original equation. When the number of subchannels is 1024, the number of complex computations for the interference coefficients is reduced by 98% or more. Since the computational complexity can be remarkably reduced without sacrificing the self-cancellation capability, it is considered that the proposed approximation is very useful to develop an algorithm for the ICI-SC scheme.

• Journal of the Architectural Institute of Korea Structure & Construction
• /
• v.33 no.12
• /
• pp.53-62
• /
• 2017

Many gradient-based mathematical methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. The main objective of this paper is to propose an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) meta-heuristic algorithm that is derived using penalty function. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this paper, a discrete search strategy using the HS algorithm with a static penalty function is presented in detail and its applicability using several standard truss examples is discussed. The numerical results reveal that the HS algorithm with the static penalty function proposed in this study is a powerful search and design optimization technique for structures with discrete-sized members.

• Journal of Korea Multimedia Society
• /
• v.12 no.1
• /
• pp.107-121
• /
• 2009

First reason for generation of standby power is because starting voltage must pass through from the source of electricity to IC. The second reason is due to current when IC is in operation. Purpose of this abstract is on structures of simple modules that automatically switch on or off through analysis of state on standby power and analysis of cutoff point patterns as well as application of algorithms. To achieve this, this paper is based on analysis of electric signals and modeling. Also, on/off cutoff criteria has been established for reduction of standby power. To find on/off cutoff point, that is executed algorithm of similar group and leading pattern group generation in the standby power state. Therefore, the algorithm was defined as an important parameter of the subtraction value of calculated between $1^{st}$ SCS, $2^{nd}$ SCS, and the median value of sampling coefficient per second from a wall outlet.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.10
• /
• pp.707-716
• /
• 2017

The advances in image display devices necessitate display images suitable for the user's purpose. The display devices should be able to provide object-based image information when a depthmap is required. In this paper, we represent the algorithm using a histogram-based image segmentation method for depthmap generation. In the conventional K-means clustering algorithm, the number of centroids is parameterized, so existing K-means algorithms cannot adaptively determine the number of clusters. Further, the problem of K-means algorithm tends to sink into the local minima, which causes over-segmentation. On the other hand, the proposed algorithm is adaptively able to select centroids and can stand on the basis of the histogram-based algorithm considering the amount of computational complexity. It is designed to show object-based results by preventing the existing algorithm from falling into the local minimum point. Finally, we remove the over-segmentation components through connected-component labeling algorithm. The results of proposed algorithm show object-based results and better segmentation results of 0.017 and 0.051, compared to the benchmark method in terms of Probabilistic Rand Index(PRI) and Segmentation Covering(SC), respectively.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.1
• /
• pp.21-28
• /
• 2009

DFT-spread OFDM(Discrete Fourier Transform-Spread Orthogonal Frequency Division Multiplexing) is very effective for solving the PAPR(Peak-to-Average Power Ratio) problem. Therefore, the SC-FDMA(Single Carrier-Frequency Division Multiple Access) which is basically same to the DFT spread OFDM was adopted as the uplink standard of the 3GPP LTE ($3^{rd}$ Generation Partnership Project Long Term Evolution). Unlike the ordinary OFDM system, the SC-FDMA using DFT spreading method is vulnerable to the ICI(Inter-Carrier Interference) problem caused by the phase noise and IQ(In-phase/Quadrature) imbalance and effected FDE(Frequency Domain Equalizer). In this paper, the ICI effects from the phase noise and IQ imbalance which can be problems in uplink transmission are analyzed according the back-off level of HPA. Next, we propose the equalizer algorithm to remove the ICI effects. This proposed equalizer based on the FDE can be considered as up-graded and improved version of PNS(Phase Noise Suppression) algorithm. This proposed equalizer effectively compensates the ICI resulting from the phase noise and IQ imbalance. Finally, through the computer simulation, it can be shown that about SNR=14 dB is required for the $BER=10^{-4}$ after ICI compensation when the back-off is 4.5 dB, $\varepsilon=0.005$, $\phi=5^{\circ}$, and $pn=0.06\;rad^2$.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.3
• /
• pp.33-38
• /
• 2004

In this paper we presents a underwater sound recognition algorithm by which we can identify the sound signal without the influence of disturbances due to underwater environmental changes. The proposed method provides a means suitable for acoustic releaser which require low power dissipation and long-time underwater operation. We demonstrate its ability of securing stability and fast sound recognition through both numerical and experimental methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4160-4176
• /
• 2015

Data compression like image and video compression has come a long way since the introduction of Compressive Sensing (CS) which compresses sparse signals such as images, videos etc. to very few samples i.e. M < N measurements. At the receiver end, a robust and efficient recovery algorithm estimates the original image or video. Many prominent algorithms solve least squares problem (LSP) iteratively in order to reconstruct the signal hence consuming more processing time. In this paper non-iterative threshold based recovery algorithm (NITRA) is proposed for the recovery of images and videos without solving LSP, claiming reduced complexity and better reconstruction quality. The elapsed time for images and videos using NITRA is in ㎲ range which is 100 times less than other existing algorithms. The peak signal to noise ratio (PSNR) is above 30 dB, structural similarity (SSIM) and structural content (SC) are of 99%.