• The Journal of the Acoustical Society of Korea
• /
• v.20 no.3
• /
• pp.8-14
• /
• 2001

In this paper, we present a new cost function for subband block adaptive algorithm and block conjugate gradient algorithm for noise cancellation of acoustic signal. For the cost function, we process the subband signals with data blocks for each subbands and recombine it a whole data block. After these process, the cost function has a quadratic form in adaptive filter coefficients, it guarantees the convergence of the suggested block conjugate gradient algorithm. And the block conjugate gradient algorithm which minimizes the suggested cost function has better performance than the case of full-band block conjugate gradient algorithm, the computer simulation results of noise cancellation show the efficiency of the suggested algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.11
• /
• pp.2093-2099
• /
• 2016

This paper describes a design of crypto-processor that supports multiple block cipher algorithms of PRESENT, ARIA, and AES. The crypto-processor integrates three cores that are PRmo (PRESENT with mode of operation), AR_AS (ARIA_AES), and AES-16b. The PRmo core implementing 64-bit block cipher PRESENT supports key length 80-bit and 128-bit, and four modes of operation including ECB, CBC, OFB, and CTR. The AR_AS core supporting key length 128-bit and 256-bit integrates two 128-bit block ciphers ARIA and AES into a single data-path by utilizing resource sharing technique. The AES-16b core supporting key length 128-bit implements AES with a reduced data-path of 16-bit for minimizing hardware. Each crypto-core contains its own on-the-fly key scheduler, and consecutive blocks of plaintext/ciphertext can be processed without reloading key. The crypto-processor was verified by FPGA implementation. The crypto-processor implemented with a $0.18{\mu}m$ CMOS cell library occupies 54,500 gate equivalents (GEs), and it can operate with 55 MHz clock frequency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1346-1353
• /
• 1999

We propose the MADF(multiplication free adaptive digital filter) algorithm and implement the fractionally spaced equalizer based on it. To evaluate the performance of proposed MADF algorithm, fractionally spaced equalizer(FSE) is used. Especially, we present that this method have the advantages for the condition having the low-frequency and slow speed

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2725-2736
• /
• 1998

In this paper. we present a new pitch determination method for speech analysis. namely VFF(Variable Forgetting Factor) based. by using the WRLS-VFF-VT(Weighted Recursive Least Square-Variable Forgetting Factor-Variable Threshold) algorithm. A proposed method uses VFF to identify the glottal closure points which correspond to the instants of the main excitation pulses for voiced speech. The modified EGG

• The Journal of the Korea institute of electronic communication sciences
• /
• v.2 no.3
• /
• pp.174-179
• /
• 2007

In this paper, we present a optimal module selection using genetic algorithm under the power, area, delay constraint. The proposed algorithm use the way of optimal module selection it will be able to minimize power consumption. In the comparison and experimental results, The proposed application algorithm reduce maximum power saving up to 26.9% comparing to previous non application algorithm, and reduce minimum power saving up to 9.0%. It also show the average power saving up to 15.525% and proved the power saving efficiency.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.533-538
• /
• 2001

This paper describes a combinational method to compute the global and local solutions of optimization problems. The present hybrid algorithm uses both a genetic algorithm and a local concentrate search algorithm (e. g simplex method). The hybrid algorithm is not only faster than the standard genetic algorithm but also supplies a more accurate solution. In addition, this algorithm can find the global and local optimum solutions. The present algorithm can be supplied to minimize the resonance response (Q factor) and to yield the critical speeds as far from the operating speed as possible. These factors play very important roles in designing a rotor-bearing system under the dynamic behavior constraint. In the present work, the shaft diameter, the bearing length, and clearance are used as the design variables.

• Journal of IKEEE
• /
• v.6 no.2 s.11
• /
• pp.111-118
• /
• 2002

In this paper, we present a variable block method to reduce additive computational requirements in determining step-size of variable step-size LMS (VS-LMS) algorithms. The block length is inversely proportional to the changing of step-size in VS-LMS algorithm. The technique reduces computational requirements of the conventional VS-LMS algorithms without a degradation of performance in convergence rate and steady state error. And a method for deriving initial step-size, when the input is zero mean, white Gaussian sequence, is proposed. For demonstrating the good performances of the proposed method, simulation results are compared with the conventional variable step-size algorithms in convergence speed and computational requirements.

• School Mathematics
• /
• v.12 no.3
• /
• pp.439-454
• /
• 2010

This study presents how two eighth grade students generated their own algorithms in the context of fraction measurement division situations by modifications of unit-segmenting schemes. Teaching experiment was adopted as a research methodology and part of data from a year-long teaching experiment were used for this report. The present study indicates that the two participating students' construction of reciprocal relationship between the referent whole [one] and the divisor by using their unit- segmenting schemes and its strategic use finally led the students to establish an algorithm for fraction measurement division problems, which was on par with the traditional invert-and-multi- ply algorithm for fraction division. The results of the study imply that teachers' instruction based on understanding student-generated algorithms needs to be accounted as one of the crucial characteristics of good mathematics teaching.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.15 no.4
• /
• pp.579-589
• /
• 2002

In this paper, a Wittrick-Williams algorithm is developed for the spectral element model of an elastic-piezoelectric two-layer active beam. This algorithm may help calculate all the required natural frequencies, which lie below any chosen frequency, without the possibility of missing any due to close grouping or due to the abrupt sign changes of the determinant of spectral element matrix via infinity instead of via zero. A uniform active beam and a partially patched active beam are considered as the illustrative examples to confirm the present algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.122-129
• /
• 2012

As a greedy algorithm reconstructing the sparse signal from underdetermined system, orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we present an extension of OMP for pursuing efficiency of the index selection. Our approach, referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple (N) columns are identified per step. Using the restricted isometry property (RIP), we derive the condition for gOMP to recover the sparse signal exactly. The gOMP guarantees to reconstruct sparse signal when the sensing matrix satisfies the RIP constant ${\delta}_{NK}$ < $\frac{\sqrt{N}}{\sqrt{K}+2\sqrt{N}}$. In addition, we show recovery performance and the reduced number of iteration required to recover the sparse signal.