• 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 Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.446-454
• /
• 2004

With the growth of multimedia systems, compressing image data has become more important in the area of multimedia services. Since a compressed image bitstream can often be seriously distorted by various types of channel noise, an error concealment algorithm becomes a very important issue. In order to solve this problem, Hsia proposed the error concealment algorithm where he recovered lost block data using 1D boundary matching vectors. His algorithm, however, requires high computational complexity since each matching vector needs MAD (Mean Absolute Difference) values of all pixels, which is either a boundary line top or a boundary line bottom of a damaged block. We propose a hierarchical search-based fast error concealment scheme as well as its approximated version to reduce computational time. In the proposed scheme, a hierarchical search is applied to reduce the number of checking points for searching a vector. The error concealment schemes proposed in this paper can be about 3 times faster than Hsia's with keeping visual quality and PSNR.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.362-364
• /
• 1998

집합의 표현 방법에는 원소들을 그대로 가지고 있는 배열 형태와 유한한 집합에 한해서 0.1로써 표현하는 비트 벡터가 있다. 집합의 크기가 매우 클 때는 표현 방법과 연산 처리 기법이 저장 공간 및 처리 시간면에서 문제가 된다. 이 논문에서는 유한집합이지만, 범위가 매우 큰 집합에 대하여 집합 연산의 처리 기법들을 소개하고, 그 성능을 비교해 보고, 범위의 크기가 집합 연산에 참여하는 집합의 원소 수에 따른 좋은 집합 표현 방법과 집합 연산 처리 기법을 소개한다.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.143-146
• /
• 2001

본 논문에서는 다 채널 페이저 연산 장치를 전용하드웨어로 구현하기 위한 설계 구조에 대하여 제시하였으며, 이를 연산량이 많은 곱셈기를 시분할에 의해 공유하는 구조를 제시하였다. 또한 페이저 측정을 위한 Sliding-DFT 알고리즘을 순환 구현할 경우의 근사구현 오차에 관한 정량적인 연구를 수행하였다. 이러한 오차 영향의 해석을 기반으로 하여 곱셈기 공유 구조를 적용한 페이저 연산 장치를 설계하고, 설계한 하드웨어의 내부동작을 보여주는 시뮬레이션을 통해 설계의 정확성을 확인하였다

• Journal of Broadcast Engineering
• /
• v.21 no.3
• /
• pp.412-424
• /
• 2016

Broadcast encryption (BE) is a cryptographic primitive that enables a sender to broadcast a message to a set of receivers in a secure channel. The efficiency of BE is measured by three factors: ciphertext transmission cost, user storage cost, and computational cost for decryption. In general, BE is applied to the environments where a large number of receivers should be accommodated, so that the transmission cost is considered as being the most important factor. In this paper, we suggest a new BE system, using Shamir's secret sharing method, which considerable reduces the transmission cost. In comparison to the previous Subset Difference (SD) system, the transmission size of our BE is longer until $r{\leq}\sqrt{n}$, but get shorter when $r{\geq}\sqrt{n}$ for number of revoked users and n number of total users. We show that the advantage can be achieved at the slight expense of both the storage and computational costs.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.12
• /
• pp.1-7
• /
• 2019

This paper presents low-complexity single-image dehazing to enhance the visibility of outdoor images that are susceptible to degradation due to weather and environmental conditions, and applies it to various devices. The conventional methods involve refinement of coarse transmission with high computational complexity and extensive memory requirements. But the proposed transmission estimation method includes excellent edge-preserving performance from comparison of the pixel-based dark channel and the patch-based dark channel in the vicinity of edges, and transmission can be estimated with low complexity since no refinement is required. Moreover, it is possible to accurately estimate transmissions and adaptively remove haze according to the characteristics of the images via prediction of the atmospheric light for each pixel using joint bright and dark channel (JBDC). Comprehensive experiments on various hazy images show that the proposed method exhibits reduced computational complexity and excellent dehazing performance, compared to the existing methods; thus, it can be applied to various fields including real-time devices.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.397-400
• /
• 2016

In this paper, we propose an efficient algorithm for computing architecture for high-performance Inter Prediction SAD HEVC encoder. HEVC Motion Estimation (ME) of the Inter Prediction is a process for searching for the currently high prediction block PU and the correlation in the interpolated reference picture in order to remove temporal redundancy. ME algorithm uses full search(FS) or fast search algorithm. Full search technique has the guaranteed optimal results but has many disadvantages which include high calculation and operational time due to the motion prediction with respect to all candidate blocks in a given search area. Therefore, this paper proposes a new algorithm which reduces the computational complexity by reusing the SAD operation in full search to reduce the amount of calculation and computational time of the Inter Prediction. The proposed algorithm is applied to an HEVC standard software HM16.12. There was an improved operational time of 61% compared to the traditional full search algorithm, BDBitrate was decreased by 11.81% and BDPSNR increased by about 0.5%.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.19 no.2
• /
• pp.417-426
• /
• 2024

In general, the implementation of machine learning requires prior knowledge and experience with deep learning models, and substantial computational resources and time are necessary for data processing. As a result, machine learning encounters several limitations when deployed on embedded processors. To address these challenges, this paper introduces a novel approach where a genetic algorithm is applied to the convolution operation within the machine learning process, specifically for performing a selective convolution operation.In the selective convolution operation, the convolution is executed exclusively on pixels identified by a genetic algorithm. This method selects and computes pixels based on a ratio determined by the genetic algorithm, effectively reducing the computational workload by the specified ratio. The paper thoroughly explores the integration of genetic algorithms into machine learning computations, monitoring the fitness of each generation to ascertain if it reaches the target value. This approach is then compared with the computational requirements of existing methods.The learning process involves iteratively training generations to ensure that the fitness adequately converges.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1172-1179
• /
• 2006

Recently, the H.264/AVC, which was standardized jointly by ISO/IEC and ITU-T, has been expanding its applications in various areas. This standard includes many advanced component techniques compared to the existing MPEG techniques. Intra prediction which is to predict the spatial data in an intra frame in one of them. But it has a serious defect that it needs large amount of calculation. To overcome this defect, this paper proposed a method to reduce about 60% of the amount of calculation with only O.02dB of image quality degradation. This method determines the calculation directly without much pre-calc cluation process by referring the left block(s) and upper blocks(s) that were processd already. Comparing to the exi sting methods, its image quality degradation is so small that it is expected to be used in many areas. Especially in the wireless appliances such as DMB phone which has restricted power source, we expect it would be used efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.288-296
• /
• 2009

In POCS (projection onto convex sets)-based reconstruction of HR (high resolution) image, the quality of reconstructed image is gradually improved through iterative motion estimation and image restoration. The amount of computation, however, increases because of the repeated inter-frame motion estimation. In this paper, an HR reconstruction algorithm is proposed where modified ARPS (adaptive rood pattern search) and POCS are simultaneously performed. In the modified ARPS, the motion estimates obtained from phase correlation or from the previous steps in POCS restoration are utilized as the initial reference in the motion estimation. Moreover, estimated motion is regularized with reference to the neighboring blocks' motion to enhance the reliability. Computer simulation results show that, when compared to conventional methods which are composed of full search block matching and POCS restoration, the proposed method is about 30 times faster and yet produces HR images of almost equal or better quality.