• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.3001-3003
• /
• 2005

이 논문에서는 OFDM(orthogonal frequency division multiplexing) 통신 시스템에서 고려해야할 중요한 문제 중의 하나인 PAPR(peak to average power ratio) 문제를 다루었다. SLM(selected mapping) OFDM 시스템을 기반으로 구현하였고, PAPR을 줄이기 위한 방법으로 새로운 위상 가중치를 곱하는 방법을 제안하였다. 여기서는 여러 가지 방법들(PSK, QPSK, 랜덤)로 위상 가중치를 발생시켰고, 발생된 위상 가중치를 병렬 조합으로 적용하여, 최저의 PAPR을 가져오는 값을 선택했다. 실험결과에서, 단일의 위상 가중치만을 곱하여 사용할 때 보다 위상 가중치를 복합적으로 사용했을 때 큰 PAPR 감소를 보임으로서, 제안된 방법의 우수성을 보였다. 그러나 아직 해결해야할 것들 중에서, 여러가지 위상 가중치를 사용함에 따른 시스템 복잡도가 증가하는 문제점이 존재한다. 본 연구에서 제안하는 방법은 비록 복잡도의 증가라는 단점을 가지고 있지만, 성능면에서의 향상은 커다란 장점이다.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.489-496
• /
• 2015

In this paper, a new weighted prediction scheme is proposed to improve the coding efficiency for video scenes containing brightness variations. Conventional weighted prediction is applied by the reference picture and use only one weighted parameter set. Thus, it is only useful for GBV(Glabal Brightness Variation). In order to solve this problem, the proposed algorithm use three kind of schemes depending on situation. Experimental results show that maximum coding efficiency gain of the proposed method is up to 10.2% in luminance. Average computional time complexity is increased about 163% in encoder and about 101% in decoder.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.105-106
• /
• 2014

본 논문에서는, 움직임이 존재하는 영역과 존재하지 않는 영역을 구분하여 영역마다 다른 가중치 계수 세트 w와 o를 사용하는 알고리즘이 제안된다. 제안된 기술의 실험 결과는 BD-rate기준으로 최대 -5.4%의 효율을 가져오며 인코더 복잡도는 약 110%, 디코더 복잡도는 거의 변화가 없다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.450-454
• /
• 2015

In this paper, when points with weights are given in a plane, for an arbitrary constant r, we shall find a square area S such that the sum of weights of points belonging to S is maximized. If the length of the side of S is not given, the problem to find arbitrary rectangular area has been studied. In this paper, we will consider the problem to find a square area with a side of a length r when a constant r is given. We will solve the one dimensional problem in dynamic environment and propose an algorithm with the time complexity of O(nlogn+rn).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.241-248
• /
• 2007

In predictive image coding, a LS (Least Squares)-based adaptive predictor is an efficient method to improve image edge predictions. This paper proposes a hybrid interpolation with weighted edge detector. A hybrid approach of switching between bilinear interpolation and EDI (Edge-Directed Interpolation) is proposed in order to reduce the overall computational complexity The objective and subjective quality is also similar to the bilinear interpolation and EDI. Experimental results demonstrate that this hybrid interpolation method that utilizes a weighted edge detector can achieve reduction in complexity with minimal degradation in the interpolation results.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.27-34
• /
• 2013

We propose a simple power allocation scheme for an amplify-and-forward multiple relay system with multiple-input multiple-output antennas. Unlike the existing relay precoding matrix with full elements, proposed precoder is a diagonal matrix whose diagonal element is the relay gain for each stream. Furthermore, a weight vector is applied to streams, such that the mutual information of the system approaches that of the exhaustive search scheme, regardless of the number of antennas. Numerical results show that proposed scheme outperforms the conventional schemes with respect to mutual information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1184-1193
• /
• 2006

Image interpolation has been widely used and studied in the various fields of image processing. There are many approaches of varying complexity and robustness. In this paper, a new distance weight is proposed for the conventional linear interpolation. In comparison with the conventional linear weight, the new distance weight uses a quadratic or cubic polynomial equation to reflect that the interpolated value should be influenced more by the value of closer pixels in an input image. In this paper, the new adaptive linear (NAL) interpolation, which considers patterns near the interpolated value, is also proposed. This algorithm requires a pattern weight, which is used to determine the ratio of reflection on local patterns, to obtain an interpolated image that exhibits better quality at various magnification factors (MF). In the computer simulation, not only did the NAL interpolation exhibit much lower computational complexity than conventional bicubic interpolation, it also improved peak signal-to-noise ratios (PSNR).

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1575-1585
• /
• 2010

It is very important to forecast a back resource of a software development effort at the early stage of development life cycle for successful project processing, and it is carried out through software size estimation. The recent trend of software size estimation method is focused on the user's value such as FPA. We measure the actual development effort through case study and calculate CFP directly according to the cosmic-ffp manual V.3.0. in this paper. We also propose the software development effort estimation model by using the produced data. COSMIC-FFP does not use weights of necessary function elements, and so it has disadvantage in estimating sizes. This paper proposes the estimation model to estimate the precision software size by using system complexity as weight.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.1
• /
• pp.153-160
• /
• 2022

A greedy algorithm is proposed to select a subset of nodes of a graph for bandlimited graph signals in which each signal value is generated with its weight. Since graph signals are weighted, we seek to minimize the weighted reconstruction error which is formulated by using the QR factorization and derive an analytic result to find iteratively the node minimizing the weighted reconstruction error, leading to a simplified iterative selection process. Experiments show that the proposed method achieves a significant performance gain for graph signals with weights on various graphs as compared with the previous novel selection techniques.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06b
• /
• pp.49-51
• /
• 2006

휴대폰의 사용영역이 넓어지면서 휴대폰에 저장되는 컨텍스트 정보 활용에 관심이 높아지고 있다. 하지만 정보의 양이 방대하기 때문에 개인이 정보를 분석하여 자신에게 필요한 정보로 바꾸기 위해서는 많은 노력이 필요하다. 본 논문에서는 휴대폰으로부터 컨텍스트 정보를 수집하여 활용할 수 있는 방법으로 개인이 하루 동안 경험한 일에 대한 정보를 한 눈에 알아볼 수 있도록 도와주는 계층적 이야기 구성 모델을 제안한다. 계층적 이야기 구성 모델은 3단계로 구성된다. 우선 각각의 로그를 분석하여 관련 있는 것들을 그룹으로 분류하고 분류된 그룹 내에서 설정된 경로에 대한 가중치를 계산하여 해당 그룹의 가중치로 저장한다. 마지막으로 그룹간의 경로에 대한 가중치를 계산하여 가장 높은 가중치를 갖는 경로를 한아 이야기 구성 모델로 설정한다. 계층적으로 이야기 경로를 선택한 경우와 그룹으로 분류하지 않고 경로를 계산한 경우의 시간 복잡도를 비교 평가하여 성능을 측정하였다. 이야기 구성모델을 계층적으로 분류했을 때의 성능이 분류하지 않은 경우보다 경로를 선정할 때 더 높은 성능을 나타내었다.