• Title/Summary/Keyword: represented polynomial

Search Result 80, Processing Time 0.022 seconds

Modal Parameter Identification from Frequency Response Functions Using Legendre Polynomials (Legendre 다항식을 이용한 주파수 응답 함수의 곡선접합과 모드 매개변수 규명)

  • Park, Nam-Gyu;Jeon, Sang-Youn;Suh, Jeong-Min;Kim, Hyeong-Koo;Jang, Young-Ki;Kim, Kyu-Tae
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.16 no.7 s.112
    • /
    • pp.769-776
    • /
    • 2006
  • A measured frequency response function can be represented as a ratio of two polynomials. A curve-fitting of frequency responses with Legendre polynomialis suggested in the paper. And the suggested curve-fitting algorithm is based on the least-square error method. Since the Legendre polynomials satisfy the orthogonality condition, the curve-fitting with the polynomials results to more reliable curve-fitting than ordinary polynomial method. Though the proposed curve-fitting with Legendre polynomials cannot cover all frequency range of interest, example shows that the suggested method is quite applicable in a limited frequency band.

Design of Hard Partition-based Non-Fuzzy Neural Networks

  • Park, Keon-Jun;Kwon, Jae-Hyun;Kim, Yong-Kab
    • International journal of advanced smart convergence
    • /
    • v.1 no.2
    • /
    • pp.30-33
    • /
    • 2012
  • This paper propose a new design of fuzzy neural networks based on hard partition to generate the rules of the networks. For this we use hard c-means (HCM) clustering algorithm. The premise part of the rules of the proposed networks is realized with the aid of the hard partition of input space generated by HCM clustering algorithm. The consequence part of the rule is represented by polynomial functions. And the coefficients of the polynomial functions are learned by BP algorithm. The number of the hard partition of input space equals the number of clusters and the individual partitioned spaces indicate the rules of the networks. Due to these characteristics, we may alleviate the problem of the curse of dimensionality. The proposed networks are evaluated with the use of numerical experimentation.

The Decoding Algorithm of Binary BCH Codes using Symmetric Matrix (대칭행렬을 이용한 2원 BCH 부호의 복호알고리즘)

  • 염흥렬;이만영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.4
    • /
    • pp.374-387
    • /
    • 1989
  • The decoding method of Binary BCH Codes using symmetric matrix is proposed in this paper. With this method, the error-locator-polynomial is composed by symmetric matrix which consists of the powers of the unknown X plus the synfromes as its elements. The symmetric matirx can also be represented in terms of the unknown X. But the each coefficients of the error-locator polynomial represents the matirx with the syndromes as its entries. By utilizing this proposed algorithm, the device for decoding circuit of the (63, 45) BCH Code for t=3 has been implemented for demonstration.

  • PDF

Analysis of Power Amplifier Nonlinear Response Based on Practical Circuit Parameters (회로 특성 파라미터에 근거한 전력 증폭기의 비선형 응답 특성)

  • Park, Yong-Kuk;Kim, Hyeong-Seok
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.5
    • /
    • pp.721-725
    • /
    • 2012
  • In this paper, a novel analysis on the nonlinear response of a power amplifier (PA) with the intermodulation distortion (IMD) asymmetry is proposed based on the mutislice behavioral model. The coefficients of the odd-order and even-order polynomial of that model are represented with the PA practical circuit parameters such as intercept points, gain and amplitudes of excitation inputs. We also develop the analytic expressions to distinguish baseband frequency effect from second harmonic effect on the IMD asymmetry. We also validate the derived analytic expressions through measurements.

Analysis of Characteristic Polynomials of 90/150 Group CA (90/150 그룹 CA의 특성다항식 분석)

  • Cho Sung-Jin;Kim Kyung-Ja;Choi Un-Sook;Hwang Yoon-Hee;Kim Han-Doo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.393-396
    • /
    • 2006
  • In this paper, we analyze the characteristic polynomials of 90/150 cellular automata which uses only 90, 150 rules as state-transition rules. In particular, we propose the method which the characteristic polynomial is represented as the exponential type of a primitive polynomial by synthesizing 90/150 CA.

  • PDF

Evaluation of MR-SENSE Reconstruction by Filtering Effect and Spatial Resolution of the Sensitivity Map for the Simulation-Based Linear Coil Array (선형적 위상배열 코일구조의 시뮬레이션을 통한 민감도지도의 공간 해상도 및 필터링 변화에 따른 MR-SENSE 영상재구성 평가)

  • Lee, D.H.;Hong, C.P.;Han, B.S.;Kim, H.J.;Suh, J.J.;Kim, S.H.;Lee, C.H.;Lee, M.W.
    • Journal of Biomedical Engineering Research
    • /
    • v.32 no.3
    • /
    • pp.245-250
    • /
    • 2011
  • Parallel imaging technique can provide several advantages for a multitude of MRI applications. Especially, in SENSE technique, sensitivity maps were always required in order to determine the reconstruction matrix, therefore, a number of difference approaches using sensitivity information from coils have been demonstrated to improve of image quality. Moreover, many filtering methods were proposed such as adaptive matched filter and nonlinear diffusion technique to optimize the suppression of background noise and to improve of image quality. In this study, we performed SENSE reconstruction using computer simulations to confirm the most suitable method for the feasibility of filtering effect and according to changing order of polynomial fit that were applied on variation of spatial resolution of sensitivity map. The image was obtained at 0.32T(Magfinder II, Genpia, Korea) MRI system using spin-echo pulse sequence(TR/TE = 500/20 ms, FOV = 300 mm, matrix = $128{\times}128$, thickness = 8 mm). For the simulation, obtained image was multiplied with four linear-array coil sensitivities which were formed of 2D-gaussian distribution and the image was complex white gaussian noise was added. Image processing was separated to apply two methods which were polynomial fitting and filtering according to spatial resolution of sensitivity map and each coil image was subsampled corresponding to reduction factor(r-factor) of 2 and 4. The results were compared to mean value of geomety factor(g-factor) and artifact power(AP) according to r-factor 2 and 4. Our results were represented while changing of spatial resolution of sensitivity map and r-factor, polynomial fit methods were represented the better results compared with general filtering methods. Although our result had limitation of computer simulation study instead of applying to experiment and coil geometric array such as linear, our method may be useful for determination of optimal sensitivity map in a linear coil array.

THE NUMBERS THAT CAN BE REPRESENTED BY A SPECIAL CUBIC POLYNOMIAL

  • Park, Doo-Sung;Bang, Seung-Jin;Choi, Jung-Oh
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.2
    • /
    • pp.167-171
    • /
    • 2010
  • We will show that if d is a cubefree integer and n is an integer, then with some suitable conditions, there are no primes p and a positive integer m such that d is a cubic residue (mod p), $3\;{\nmid}\;m$, p || n if and only if there are integers x, y, z such that $$x^3\;+\;dy^3\;+\;d^2z^3\;-\;3dxyz\;=\;n$$.

Modeling and Digital Predistortion Design of RF Power Amplifier Using Extended Memory Polynomial (확장된 메모리 다항식 모델을 이용한 전력 증폭기 모델링 및 디지털 사전 왜곡기 설계)

  • Lee, Young-Sup;Ku, Hyun-Chul;Kim, Jeong-Hwi;Ryoo, Kyoo-Tae
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.19 no.11
    • /
    • pp.1254-1264
    • /
    • 2008
  • This paper suggests an extended memory polynomial model that improves accuracy in modeling memory effects of RF power amplifiers(PAs), and verifies effectiveness of the suggested method. The extended memory polynomial model includes cross-terms that are products of input terms that have different delay values to improve the limited accuracy of basic memory polynomial model that includes the diagonal terms of Volterra kernels. The complexity of the memoryless model, memory polynomial model, and the suggested model are compared. The extended memory polynomial model is represented with a matrix equation, and the Volterra kernels are extracted using least square method. In addition, the structure of digital predistorter and digital signal processing(DSP) algorithm based on the suggested model and indirect learning method are proposed to implement a digital predistortion linearization. To verify the suggested model, the predicted output of the model is compared with the measured output for a 10W GaN HEMT RF PA and 30 W LDMOS RF PA using 2.3 GHz WiBro input signal, and adjacent-channel power ratio(ACPR) performance with the proposed digital predistortion is measured. The proposed model increases model accuracy for the PAs, and improves the linearization performance by reducing ACPR.

High-Secure Multivariable Knapsack Cryptosystem (안전성이 높은 다변수 Knapsack 암호시스템)

  • Lee, Byeong-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.4
    • /
    • pp.611-618
    • /
    • 1995
  • In the high information societies, the requirement of encryption security is increasing so as to protect information from the threat of attacks by illegal changes of data, illegal leakage of data, disorder of data sequences and the unauthorized sender and an unauthorized receiver etc. In this paper, multivariable knapsack crytosystem is proposed for security of computer communication. This system is securer and simpler than the conventional knapsack cryptosystems. And, proposed cryptosystem composed what represented each element of superincreasing vector with multivar able polynomial after transforming it of ciphervector. For the deciphering of ciphertext, the plaintext is determined by using the integers of secret and the superincreasing vector of secret key. Thus, the stability of this cryptosystem is based on the difficulty of obtaining the root that ciphervector becomes the superincreasing vector, in substituting the integers of secret for ciphervector to represent with the miltivariable polynomial. The propriety of proposed multivariable knapsack cryptosystem was proved through computer simulation.

  • PDF

A Note on Series Approximation of Transition Density of Diffusion Processes (확산모형 전이확률밀도의 급수근사법과 그 계수)

  • Lee, Eun-Kyung;Choi, Young-Soo;Lee, Yoon-Dong
    • The Korean Journal of Applied Statistics
    • /
    • v.23 no.2
    • /
    • pp.383-392
    • /
    • 2010
  • Modelling financial phenomena with diffusion processes is frequently used technique. This study reviews the earlier researches on the approximation problem of transition densities of diffusion processes, which takes important roles in estimating diffusion processes, and consider the method to obtain the coefficients of series efficiently, in series approximation method of transition densities. We developed a new efficient algorithm to compute the coefficients which are represented by repeated Dynkin operator on Hermite polynomial.