• Journal of Information Technology Services
• /
• v.7 no.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.

• Broadcasting and Media Magazine
• /
• v.7 no.3
• /
• pp.75-82
• /
• 2002

In this report, the complexity analysis of the JVT(Joint Video Team) codec, which has jointly developed the next video coding standard, is performed. Three types of configurations in terms of coding efficiency are set and the analysis of the memory band width and computation time for each configuration is performed. ATOMIUM complexity analysis tool is used for both the memory access statistics and computation time calculation of JVT codec. Also the complexity of each video coding tool in the encoder and decoder is shown in relative complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.160-168
• /
• 2011

A Frequency domain beamforming technique is widely used in sonar systems with a large number of beams and sensors. In the battlefield environment requiring real-time signal processing, it is needed to optimize the computational complexity of the spectrum computation to implement an efficient and fast frequency domain beamformer. So, in this paper, we proposed the pruned-GSFFT (pruned generalized sliding fast Fourier transform) as a new spectrum computation method. The proposed method help to reduce the computational complexity of the real-time partial spectrum computation by eliminating the redundancy between consecutive input samples and skipping the regardless frequency bands. Also the characteristics of the proposed pruned-GSFFT method and its computational complexity are compared to those of previous FFT algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.38-48
• /
• 2011

Block based LCD backlight nonideality and crosstalk compensation methodologies are proposed based on the analysis of backlight profiles and image pixel homogeneity. Large computation complexity required in the conventional compensations is minimized without the degradation of image qualities by optimizing image block size, image area inside the block to be excluded from the compensation computation and the required backlight range to be computed. The optimization results of computation complexity as well as image qualities are verified for the proposed compensation by real image data simulations.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• 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
• /
• v.29 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.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
• /
• v.15 no.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).

• Journal of Information Technology Services
• /
• v.9 no.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.