• 한국IT서비스학회지
• /
• 제7권4호
• /
• pp.221-230
• /
• 2008

Green's relations are five equivalence relations that characterize the elements of a semigroup in terms of the principal ideals. The J relation is one of Green's relations. Although there are known algorithms that can compute Green relations, they are not useful for finding all J relations in the semigroup of all $n{\times}n$ Boolean matrices. Its computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices. The size of the semigroup of all $n{\times}n$ Boolean matrices grows exponentially as n increases. It is easy to see that it involves exponential time complexity. The computation of J relations over the $5{\times}5$ Boolean matrix is left an unsolved problem. The paper shows theorems that can reduce the computation time, discusses an algorithm for efficient J relation computation whose design reflects those theorems and gives its execution results.

• 방송과미디어
• /
• 제7권3호
• /
• pp.75-82
• /
• 2002

본 연구에서는 ITU-T와 MPEG에서 공동개발중인 JVT압축/복원방식에 대한 복잡도 분석이 수행된다. 압축률을 향상시키는 측면U떠 부호화 할 때 3가지의 configuration을 설정하여 각각의 configuration이 부호기와 복호기 구현시 필요한 메모리 및 계산시간에 대한 분석을 수행한다. 복잡도분석을 위하여 ATOMIUM 분석기를 이용한 메모리 대역폭 및 처리시간의 2가지 요인에 대한 결과를 소개한다. 또한 부호기 및 복호기의 각 비디오 툴들에 대한 상대적인 계산량을 정량적으로 도시한다.

• 대한전자공학회논문지SP
• /
• 제48권4호
• /
• pp.160-168
• /
• 2011

주파수 영역 빔형성기 (frequency domain beamformer)는 시간 영역 빔형성기에 비해 연산량 측면에서 효율성이 높아 다수의 빔과 센서가 요구되는 수동 소나 시스템에서 널리 사용되고 있다. 주파수 영역 빔형성기에서는 푸리에 변환을 통한 입력 신호의 스펙트럼 분석 과정이 필수적이며, 이 과정의 효율성에 따라 전체 시스템의 성능이 결정된다. 또한 기본적으로 실시간 신호처리가 요구되는 실제 전장 환경에서 이러한 스펙트럼 연산 과정 최적화의 중요성이 더욱 부각되고 있다. 따라서 본 논문에서는 실시간으로 수신되는 협대역 신호의 효율적인 국부 스펙트럼 분석 (partial spectrum analysis)을 위해, TD (transform decomposition) 기법과 GSFFT (generalized sliding fast Fourier transform) 기법의 장점을 모두 적용한 pruned-GSFFT 기법을 제안한다. 또한 제안된 기법의 구현상의 특성을 분석하고 요구되는 연산량을 기존 기법들과 비교한다.

• 대한전자공학회논문지SP
• /
• 제48권4호
• /
• pp.38-48
• /
• 2011

Backlight Profile과 Image Pixel의 Homogeneity 분석을 통한 Block 단위 LCD Backlight Nonideality 및 Crosstalk Compensation 방안이 제안되었다. Image에 따라 Block Size 및 연산에서 제외되는 Block 범위 그리고 연산에 고려되는 Backlight 범위를 최적화하여, 화질을 유지하면서 연산량을 최소화시켰다. 실제 영상을 바탕으로 하는 Simulation을 통해 제안된 Compensation 연산량과 화질이 평가되었다.

• 전자공학회논문지A
• /
• 제30A권3호
• /
• pp.114-129
• /
• 1993

A FFT array processor algorithm and architecture which anc use a minumum required number of simple, duplicate multiplier-adder processing elements according to various computation speed, will be presented. It is based on the p fold symmetry in the radix p constant geometry FFT butterfly stage with shuffled inputs and normally ordered outputs. Also, a methodology to implement a high performance high radix FFT with VLSI by constructing a high radix processing element with the duplications of a simple lower radix processing element will be discussed. Various performances and the trade-off between computation speed and hardware complexity will be evaluated and compared. Bases on the presented architecture, a radix 2, 8 point FFT processing element chip has been designed and it structure and the results will be discusses.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 춘계학술발표대회
• /
• pp.297-300
• /
• 2007

Due to its impressive compression performance, the H.264 video coder is highlighted in the video communications industry, such as DMB (Digital Multimedia Broadcasting), PMP (Portable Multimedia Player), etc. The main bottleneck to use the H.264 coder lays in the computational complexity, i.e. five times more complex than the market leading MPEG-4 Simple Profile codec. In this paper, we propose the hierarchical mode decision method for intraframe coding for the reduction of the computation complexity of the encoder. By determining the mode group early, the propose algorithm can skip the computationally demanding computation in the mode decision. The proposed algorithm is composed of three steps: $16{\times}16$ mode decision, $4{\times}4$ mode-group decisions, and final mode decision among the selected mode group. The simulation results show that the proposed algorithm achieves 20% to 50% reduction in the computational complexity compared with the conventional algorithm.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.547-562
• /
• 2011

We establish a new formalism of the non-periodic autocorrelation function (NPAF) of two sequences, which is suitable for the computation of the NPAF of any two sequences. It is shown, that this encoding of NPAF is efficient for sequences of small weight. In particular, the check for two sequences of length n having weight w to have zero NPAF can be decided in $O(n+w^2{\log}w)$. For n > w^2{\log}w$, the complexity is O(n) thus we cannot expect asymptotically faster algorithms.

• 한국통신학회논문지
• /
• 제36권3C호
• /
• pp.163-169
• /
• 2011

Partial transmit sequence (PTS) algorithm is known as one of the most efficient ways to reduce the peak-to-average power ratio (PAPR) in the orthogonal frequency division multiplexing (OFDM) system. The PTS algorithm, however, requires large numbers of computation to implement. Thus there has been a trade-off between performance of PAPR reduction and computational complexity. In this paper, the performance of PAPR reduction and computation complexity of PTS algorithms are analyzed and compared through computer simulations. Subsequently, a new PTS algorithm is proposed which can be a reasonable method to reduce the PAPR of OFDM when both the performance of PAPR reduction and computational complexity are considered simultaneously.

• The Journal of the Acoustical Society of Korea
• /
• 제15권3E호
• /
• pp.74-77
• /
• 1996

In this paper we implement the Discrete Rotational Fourier Transform(DRFT) which is a discrete version of the Angular Fourier Transform and its inverse transform. We simplify the computation algorithm in [4], and calculate the complexity of the proposed implementation of the DRFT and the inverse DRFT, in comparison with the complexity of a DFT (Discrete Fourier Transform).

• 한국IT서비스학회지
• /
• 제9권4호
• /
• pp.219-229
• /
• 2010

The Green's equivalence relations have played a fundamental role in the development of semigroup theory. They are concerned with mutual divisibility of various kinds, and all of them reduce to the universal equivalence in a group. Boolean matrices have been successfully used in various areas, and many researches have been performed on them. Studying Green's relations on a monoid of boolean matrices will reveal important characteristics about boolean matrices, which may be useful in diverse applications. Although there are known algorithms that can compute Green relations, most of them are concerned with finding one equivalence class in a specific Green's relation and only a few algorithms have been appeared quite recently to deal with the problem of finding the whole D or J equivalence relations on the monoid of all $n{\times}n$ Boolean matrices. However, their results are far from satisfaction since their computational complexity is exponential-their computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and the size of the monoid of all $n{\times}n$ Boolean matrices grows exponentially as n increases. As an effort to reduce the execution time, this paper shows an isomorphism between the R relation and L relation on the monoid of all $n{\times}n$ Boolean matrices in terms of transposition. introduces theorems based on it discusses an improved algorithm for the J relation computation whose design reflects those theorems and gives its execution results.