• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.405-409
• /
• 2007

Each class in remotely sensed imagery has different spectral and spatial characteristics. Natural features have relatively smaller spatial changes than spectral changes. Meanwhile, urban area in which buildings, roads, and cars are included is inclined to face more changes of spatial variation than spectral one. This study aims to propose the new urban complexity index (UCI) based on the 3D DWT computation of remotely sensed imageries considering these characteristics. And then we analyze relation between index and land cover map. The 3DWUCI values are related to class and the indices of urban area are greater than natural area. The proposed UCI could be used to express effectively the standard of urban complexity over a wide area.

• 디지털산업정보학회논문지
• /
• 제9권1호
• /
• pp.95-102
• /
• 2013

This paper covers nulling algorithm. In this algorithm, we assume that nulling points are already known. In general, nulling algorithm using matrix equation was utilized. But, this algorithm is pointed out that computational complexity is disadvantage. So, we choose gradient method to reduce the computational complexity. In order to further reduce the computational complexity, we propose approximate gradient method using characteristic of trigonometric functions. The proposed method has same performance compared with conventional method while having half the amount of computation when the number of antenna and nulling point are 20 and 1, respectively. In addition, we could virtually eliminate the trigonometric functions arithmetic. Trigonometric functions arithmetic cause a big problem in actual implementation like FPGA processor(Field Programmable gate array). By utilizing the above algorithm in a multi-cell environment, beamforming gain can be obtained and interference can be reduced at same time. By the above results, the algorithm can show excellent performance in the cell boundary.

• ETRI Journal
• /
• 제33권2호
• /
• pp.194-200
• /
• 2011

This paper presents a deblocking method for video compression in which the blocking artifacts are effectively extracted and eliminated based on both spatial and frequency domain operations. Firstly, we use a probabilistic approach to analyze the performance of the conventional macroblock-level deblocking scheme. Then, based on the results of the analysis, an algorithm to reduce the computational complexity is introduced. Experimental results show that the proposed algorithm outperforms the conventional video coding methods in terms of computation complexity while coding efficiency is maintained.

• 디지털산업정보학회논문지
• /
• 제18권1호
• /
• pp.1-9
• /
• 2022

Galois field arithmetic is important in error correcting codes and public-key cryptography schemes. Hardware realization of these schemes requires an efficient implementation of Galois field arithmetic operations. Multiplication is the main finite field operation and designing efficient multiplier can clearly affect the performance of compute-intensive applications. Diverse algorithms and hardware architectures are presented in the literature for hardware realization of Galois field multiplication to acquire a reduction in time and area. This paper presents a low complexity semi-systolic multiplier to facilitate parallel processing by partitioning Montgomery modular multiplication (MMM) into two independent and identical units and two-level systolic computation scheme. Analytical results indicate that the proposed multiplier achieves lower area-time (AT) complexity compared to related multipliers. Moreover, the proposed method has regularity, concurrency, and modularity, and thus is well suited for VLSI implementation. It can be applied as a core circuit for multiplication and division/exponentiation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.5723-5743
• /
• 2018

The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.

• 한국전자통신학회논문지
• /
• 제9권10호
• /
• pp.1087-1094
• /
• 2014

일반적으로 스피커는 설계 원리, 제작 과정 등의 요인에 의하여 비선형 왜곡을 발생하게 되는데, 비선형 왜곡으로 인하여 음질이 떨어지거나 변형하게 된다. 따라서 이러한 비선형 왜곡을 보정하여 스피커를 선형화한다면 보다 향상된 양질의 소리를 청취하거나 만족도를 높일 수 있다. 본 논문에서는 스피커의 비선형 왜곡을 보정하기 위해서 새로운 적응 제어기를 제안하였다. 분석적인 해석과 함께 컴퓨터 모의실험을 통해 기존의 적응 제어기와 제안된 적응 제어기가 모두 비선형 왜곡을 지닌 스피커 시스템을 선형화하는데 적용할 수 있다는 것을 확인하였다. 또한, 제안된 적응 제어기가 거의 동일한 계산 양으로 기존의 적응 제어기보다 비선형 왜곡을 보정하는데 빠른 수렴속도와 우수한 성능을 가지고 있다는 사실을 확인하였다.

• Journal of information and communication convergence engineering
• /
• 제7권2호
• /
• pp.193-198
• /
• 2009

The H.264/ AVC video coding standard supports the intra prediction with various block sizes for luma component and a 8x8 block size for chroma components. This new feature of H.264/AVC offers a considerably higher improvement in coding efficiency compared to previous compression standards. In order to achieve this, H.264/AVC uses the Rate-distortion optimization (RDO) technique to select the best intra prediction mode for each block size, and it brings about the drastic increase of the computation complexity of H.264 encoder. In this paper, a fast block size decision algorithm is proposed to reduce the computation complexity of the intra prediction in H.264/AVC. The proposed algorithm computes the smoothness based on AC and DC coefficient energy for macroblocks and compares with the nonparametric criteria which is determined by considering information on neighbor blocks already reconstructed, so that deciding the best probable block size for the intra prediction. Also, the use of non-parametric criteria makes the performance of intra-coding not be dependent on types of video sequences. The experimental results show that the proposed algorithm is able to reduce up to 30% of the whole encoding time with a negligible loss in PSNR and bitrates and provides the stable performance regardless types of video sequences.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권1호
• /
• pp.44-57
• /
• 2016

Rectification is used as a preprocessing to reduce the computation complexity of disparity estimation. However, rectification also requires a complex computation. To minimize the computing complexity, rectification using a lookup-table (R-LUT) has been introduced. However, since, the R-LUT consumes large amount of memory, rectification with compressed LUT (R-CLUT) has been introduced. However, the more we reduce the memory consumption, the more we need decoding overhead. Therefore, we need to attain an acceptable trade-off between the size of LUT and decoding overhead. In this paper, we present such a trade-off by adaptively combining simple coding methods, such as differential coding, modified run-length coding (MRLE), and Huffman coding. Differential coding is applied to transform coordinate data into a differential form in order to further improve the coding efficiency along with Huffman coding for better stability and MRLE for better performance. Our experimental results verified that our coding scheme yields high performance with maintaining robustness. Our method showed about ranging from 1 % to 16 % lower average inverse of compression ratio than the existing methods. Moreover, we maintained low latency with tolerable hardware overhead for real-time implementation.

• 대한임베디드공학회논문지
• /
• 제14권6호
• /
• pp.313-319
• /
• 2019

Finite field operations have played an important role in error correcting codes and cryptosystems. Recently, the necessity of efficient computation processing is increasing for security in cyber physics systems. Therefore, efficient implementation of finite field arithmetics is more urgently needed. These operations include addition, multiplication, division and inversion. Addition is very simple and can be implemented with XOR operation. The others are somewhat more complicated than addition. Among these operations, multiplication is the most important, since time-consuming operations, such as exponentiation, division, and computing multiplicative inverse, can be performed through iterative multiplications. In this paper, we propose a multiplexer based parallel computation algorithm that performs Montgomery multiplication over finite field using redundant basis. Then we propose an efficient multiplexer based semi-systolic multiplier over finite field using redundant basis. The proposed multiplier has less area-time (AT) complexity than related multipliers. In detail, the AT complexity of the proposed multiplier is improved by approximately 19% and 65% compared to the multipliers of Kim-Han and Choi-Lee, respectively. Therefore, our multiplier is suitable for VLSI implementation and can be easily applied as the basic building block for various applications.

• 한국멀티미디어학회논문지
• /
• 제14권8호
• /
• pp.1000-1009
• /
• 2011

영상 보간법은 영상의 크기변환에서 할당되지 못한 화소에 대한 값을 추정하는 기술로써, 보간된 결과 영상에서 나타나는 화질 열화 현상을 최소화하면서도 낮은 계산복잡도를 가지는 것이 필요하다. 본 논문에서는 반복적 오차 제거를 이용한 영상 보간법을 제안한다. 제안하는 방법은 5단계로 구성되며, 각각 손실 정보 계산 단계, 손실 정보 추정 단계 손실 정보 적용 단계 오차 계산 단계 오차 적용 단계이다. 실험을 통해서 기존의 방법보다 평균 3.3dB이상 PSNR(peak signal to noise rate)이 향상된 것을 알 수 있었고, 주관적인 화질도 개선된 것을 확인하였으며 계산복잡도가 최소 83% 이상 감소한 것을 측정하였다. 제안한 영상 보간 방법은 영상 복원 및 확대를 위한 다양한 응용 환경에서 유용하게 사용될 수 있다.