• Journal of Broadcast Engineering
• /
• v.19 no.6
• /
• pp.836-846
• /
• 2014

To expedite UHD (Ultra High Definition) video service, the HEVC (High-Efficiency Video Coding) technology has recently been standardized and it achieves two times higher compression efficiency than the conventional H.264/AVC. To obtain the improved efficiency, however, it employs many complex methods which need complicated calculation, thereby resulting in a significantly increased computational complexity when compared to that of H.264/AVC. For example, to improve the coding efficiency of intra frame coding, up to 35 intra prediction modes are defined in HEVC, but this results in an increased encoding time than the H.264/AVC. In this paper, we propose a fast intra prediction mode decision scheme which reduces computational complexity by changing the number of intra prediction mode in accordance with the percentage of PU sizes for a given video resolution, and by classifying the 35 intra prediction modes into 4 categories considering video resolution and quantization parameter. The experimental results show that the total encoding time is reduced by about 7% on average at the cost of only 2% increase in BD-rate.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.11a
• /
• pp.81-83
• /
• 2015

객관적 영상 화질 측정(Image Quality Assessment: IQA)방법은 영상 화질 최적화 문제해결을 목적으로 하는 영상 처리 및 컴퓨터 비전 분야에 매우 중요하게 사용된다. 이를 위해, 저복잡도, 고성능 및 좋은 수학적 특성(예를 들어, 척도성(metricability), 미분가능성(differentiability) 및 볼록 성질(convexity))을 모두 만족시키는 객관적 IQA 방법이 활발히 연구되어 왔다. 그러나, 위해 위에서 언급한 좋은 수학적 특성을 가지는 대부분의 객관적 IQA 방법들은 좋은 수학적 특성을 만족시키기 위해 상당한 예측성능의 감소를 초래했다. 본 논문은 위에서 언급한 좋은 수학적 특성을 모두 만족시키면서, 예측 성능이 향상된 새로운 IQA 방법을 제안한다. 인간 시각 체계의 감수영역은 광도 입력에 대해 공간 도메인에서 미분 형태의 응답을 가지므로, 제안 방법은 이러한 시각 체계 응답을 모방하여 기울기 연산자를 도입한다. 제안한 방법에서 도입한 기울기 연산자는 매우 단순하게 설계되어, 계산 복잡도가 매우 낮다. 광범위한 실험 결과, 제안하는 IQA 방법은 기존 수학적 특성이 좋은 IQA 방법들 대비 더 좋은 성능을 보이면서 계산 복잡도 또한 낮았다. 따라서 제안 IQA 방법은 다양한 영상 화질 최적화 문제에 매우 효과적으로 적용될 수 있다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.1
• /
• pp.1-9
• /
• 2009

OFDM(Orthogonal Frequency Division Multiplexing) system is robust to frequency selective fading and narrowband interference in high-speed data communications. However, an OPDM signal consists of a number of independently modulated subcarriers and the superposition of these subcarriers causes a problem that can give a large PARR(Peak-to-Average Power Ratio). PTS(Partial Transmit Sequence) scheme can reduce the PAPR by dividing OFDM signal into subblocks and then multiplying the phase weighting factors to each subblocks, but computational complexity for selecting of phase weighting factors increases exponentially with the number of subblocks. Therefore, in this paper, MG-PSO(Modified Greedy algorithm-Particle Swarm Optimization) algorithm that combines modified greedy algorithm and PSO(Particle Swarm Optimization) algorithm is proposed to use for the phase control method in PTS scheme. This method can solve the computational complexity and guarantee to reduce PAPR. We analyzed the performance of the PAPR reduction when we applied the proposed method to telecommunication systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.914-920
• /
• 2006

In this paper, we introduce a new partial transmit sequence (PTS) orthogonal frequency division multiplexing (OFDM) scheme with low computational complexity. In the proposed scheme, $2^n$-point inverse fast Fourier transform (IFFT) is divided into two parts. An input symbol sequence is partially transformed using the first l stages of IFFT into an intermediate signal sequence and the intermediate signal sequence is partitioned into a number of intermediate signal subsequences. Then, the remaining n - l stages of IFFT are applied to each of the intermediate signal subsequences and the resulting signal subsequences are summed after being multiplied by each member of a set of W rotating vectors to yield W distinct OFDM signal sequences. The one with the lowest peak to average power ratio (PAPR) among these OFDM signal sequences is selected for transmission. The new PTS OFDM scheme reduces the computational complexity while it shows almost the same performance of PAPR reduction as that of the conventional PTS OFDM scheme.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.1028-1035
• /
• 2005

OFDM system has high PAPR(Peak-to-Average-Power Ratio) problem. In this paper, we present a low complexity phase weighting method to reduce the computational quantity so that we can cut down the processing time of SPW method. Proposed method is derived from the DFT property of periodical sequences by which PAPR can be reduced efficiently. The simulation results show the same PAPR reduction efficiency of proposed method in comparison with conventional methods. It can reduce 2.15 dB of PAPR with two phase factors and 3.95 dB of PAPR with four phase factors. The computation analysis shows significant improvement in the low complexity phase weighting method.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2124-2126
• /
• 2003

본 논문에서는 M-Max 선택적 계수 갱신 알고리즘을 이용한 부밴드 광대역 적응 빔포밍 구조를 제안하였다. 기존의 적응 필터 분야에서 일반적으로 가장 안정화된 적응 알고리즘인 NLMS 적응 필터링을 수행할 때 필터의 길이가 증가 할수록 복잡도가 증가하는 문제점을 매 갱신 주기마다 모든 각각의 계수들 위치에서 대응하는 기울기 추정치 크기를 바탕으로 선택된 계수만을 갱신함으로써 모든 계수를 갱신할 때와 비교해서 복잡도는 크게 감소하는 반면 수렴 성능은 거의 비슷한 M-Max 알고리즘이 제안되어왔다. 이러한 H-Max 알고리즘을 부밴드 적응 빔포밍 구조에 적용하고 그 타당성을 모의실험을 통하여 광대역 서브밴드 적응 빔포밍에 선택적 계수 갱신 알고리즘을 적용하였을 때 성능 저하 거의 없이 계산량은 크게 감소됨을 검증하였다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.7
• /
• pp.705-710
• /
• 2011

In this paper, we proposed the low computational complexity soft-decision e-BCH decoding algorithm based on the Chase algorithm. In order to make the test patterns, it is necessary to re-order the least reliable received symbols. In the process of ordering and finding optimal decoding symbols, high computational complexity is required. Therefore, this paper proposes the method of low computational complexity algorithm for soft-decision e-BCH decoding process.

• Journal of Broadcast Engineering
• /
• v.17 no.5
• /
• pp.765-780
• /
• 2012

In this paper, we propose a fast mode decision method that determines the coding unit depth for enhancement layers to improve an encoding speed of a scalable video encoder based on HEVC. To decide the coding unit depth of the enhancement layer, firstly, the coding unit depth of the corresponded coding unit in the basement layer is employed. At this stage, the final CU depth is decided by calculating the rate-distortion costs of one lower depth to one upper depth of the referenced depth. The proposed method can reduce a computational load since it does not calculate the rate-distortion costs for all the depths of a target CU. We found that the proposed algorithm decreases encoding complexity of 26% with approximately 1.4% bit increment, compared with the simulcast encoder of the HM 4.0.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.2
• /
• pp.201-208
• /
• 2013

In this paper, the PTS scheme generate alternative orthogonal frequency frequency division multiplexing (OFDM) signal sequences by multiplying all the time domain samples with phase rotating vectors to find an OFDM signal having the minimum peak-to-average power ratio (PAPR). However, it needs an exhaustive search which causes large computational complexity. In order to solve this problem, we propose two efficient methods based on the crest factor. The first proposed scheme is to select time domain sample with large magnitude to calculate PAPR, and the next scheme is to calculate the absolute value of real and imaginary part of the sample at each subblock. The simulation results show that the proposed schemes achieve better PAPR reduction performance than existing PTS schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4C
• /
• pp.321-329
• /
• 2008

H.264/AVC video coding standard enables a considerably higher improvement in coding efficiency compared with previous standards such as MPEG-2, H.263 and MPEG-4. To achieve this, for each macro-block in H.264/AVC, Rate-Distortion Optimization (RDO) technique is employed to select the best motion vector, reference frame, and macro-block mode. As a result, computational complexity is increased significantly whereas RDO achieve higher improvement. This paper presents fast intra mode selection algorithm based on constraints of frequency characteristics which are derived from intra coding modes of H.264/AVC. First of all, we observe the features of each intra mode through the frequency analysis of image. And then proposed Frequency Error Costs (FECs) are calculated to select the best mode which has minimum cost. Computational complexity is considerably reduced because rate-distortion costs only calculate the candidate modes which are set of best mode and its neighbouring two modes. Experimental results show that proposed algorithm reduces the complexity dramatically maintaining the rate-distortion performance compared with H.264/AVC reference software.