• Title/Summary/Keyword: canonical

Search Result 1,010, Processing Time 0.023 seconds

A Study On Hardware Implementation of Canonical Chua's Circuit (Canonical Chua 회로의 Hardware 제작에 관한 연구)

  • Ko, Jae-Ho;Bang, Sung-Yun;Bae, Young-Chul;Yim, Hwa-Yeoung
    • Proceedings of the KIEE Conference
    • /
    • 1997.07b
    • /
    • pp.624-626
    • /
    • 1997
  • Canonical Chua's circuit is a simple electronic circuit which exhibits a variety of bifurcation phenomena and attractors. It consists of two capacitors, an inductor, two linear resistors, and a nonlinear resistor. When the circuit exhibits chaotic signals, the nonlinear resistor of canonical Chua's circuit may have three different voltage - current characteristics. In this paper, the design methodology for practical implementation of the nonlinear resistors which have all these characteristics is described. In addition, the effectiveness of result is shown by not only the MATLAB simulation but also the PSPICE simulation.

  • PDF

A Non-Canonical Linearly Constrained Constant Modulus Algorithm for a Blind Multiuser Detector

  • Jiang, Hong-Rui;Kwak, Kyung-Sup
    • ETRI Journal
    • /
    • v.24 no.3
    • /
    • pp.239-246
    • /
    • 2002
  • We investigate an alternative blind adaptive multiuser detection scheme based on a non-canonical linearly constrained constant modulus (LCCM) criterion and prove that, under the constrained condition, the non-canonical linearly constrained constant modulus algorithm (LCCMA) can completely remove multiple -access interference. We further demonstrate that the non-canonical LCCM criterion function is strictly convex in the noise-free state, and that under the constrained condition, it is also strictly convex even where small noise is present. We present a simple method for selecting the constant as well as a stochastic gradient algorithm for implementing our scheme. Numerical simulation results verify the scheme's efficiency.

  • PDF

Efficient Huffman Decoding using Canonical Huffman Tree (정규 허프만 트리를 이용한 허프만 코드의 효율적인 디코딩)

  • Park, Sang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.4
    • /
    • pp.111-117
    • /
    • 2007
  • We present an efficient decoding scheme for Huffman codes in which we use a properties of canonical prefix tree. After Huffman tree is converted to canonical Huffman tree, we represent Huffman tree with minimum information using rules associated with values of nodes in canonical tree. The proposed scheme can reduce memory to store Huffman tree information while maintains the same Processing time. The memory size in order to represent tree information is 2h + 2klogn which is less than those of previous methods. But the number of search is similar to previously proposed techniques.

  • PDF

Adaptive Observer Design for Multi-Output Unobservable Nonlinear Systems (다중출력 관측불가능 비선형 시스템의 적응관측기 설계기법)

  • Jo Nam-Hoon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.4
    • /
    • pp.271-278
    • /
    • 2005
  • In this paper, we present an adaptive observer for multi-output nonlinear systems that include unknown constant parameters and are not necessarily observable. Based on generalized nonlinear observer canonical form, new adaptive observer canonical form is proposed. Sufficient conditions are given for a nonlinear system to be transformed into the proposed adaptive observer canonical form. The existence of the proposed adaptive observer is given in terms of Lyapunov-like condition and SPR condition. An illustrative example is presented to show the design procedure of the proposed method.

Selective Encryption of Canonical Huffman code (정규 허프만 코드의 선택적 암호화)

  • Park, Sang-ho
    • Journal of IKEEE
    • /
    • v.22 no.4
    • /
    • pp.1163-1167
    • /
    • 2018
  • The selective encryption scheme for canonical Huffman codes using the inversion of bit values is proposed. The symbols are divided into blocks of a certain size, and each symbol in the block is compressed by canonical Huffman coding. Blocks are determined to be sent in the original code or encrypted form. The encryption block inverts the values of the whole bits, and bits of block that do not encrypt are not inverted. Those compressed data are transmitted with the encryption information. It is possible to decrypt the compressed data on the receiving side using the encryption information and compressed data.

A Study on the Discriminant Variables of Face Skin Colors for the Korean Females (한국 여성의 얼굴 피부색 판별을 위한 색채 변수에 관한 연구)

  • Kim, Ku-Ja;Chung, Hae-Won
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.29 no.7 s.144
    • /
    • pp.978-986
    • /
    • 2005
  • The color of apparel products have a close relationship with the face skin colors of consumers. In order to extract the favorable colors which flatter to consumer's face skin colors, this study was carried our to classify the face skin colors of Korean females. The criteria that select new subjects who have the classified face skin colors have to be decided. With color spectrometer, JX-777, face skin colors of subjects were measured and classified into three clusters that had similar hue, value and chroma with Munsell Color System. Sample size was 324 Korean females and other new 10 college girls. Data were analyzed by K-means cluster analysis, ANOVA, Duncan multiple range test, Stepwise discriminant analysis using SPSS Win. 12. Findings were as follows: 1. 324 subjects who have YR colors were clustered into 3 face skin color groups. 2. Discriminant variables of face skin colors were 5 variables : b value of cheek, V value of forehead, L value of cheek, C value of forehead and H value of cheek by the standardized canonical discriminant function coefficient 1. 3. Hit ratio of type 1 was $96.8\%$, of type 2 was $94.9\%$, of type 3 was $100.0\%$ and mean of hit ratio was $96.9\%$ by canonical discriminant function of 5 variables. 4. With the unstandardized canonical discriminant function coefficient and constant, canonical discriminant function equation 1 and 2 were calculated. And cutting score and range of score of the classified types were computed. The criteria that select the new subjects were decided.

Assessment of tunnel damage potential by ground motion using canonical correlation analysis

  • Chen, Changjian;Geng, Ping;Gu, Wenqi;Lu, Zhikai;Ren, Bainan
    • Earthquakes and Structures
    • /
    • v.23 no.3
    • /
    • pp.259-269
    • /
    • 2022
  • In this study, we introduce a canonical correlation analysis method to accurately assess the tunnel damage potential of ground motion. The proposed method can retain information relating to the initial variables. A total of 100 ground motion records are used as seismic inputs to analyze the dynamic response of three different profiles of tunnels under deep and shallow burial conditions. Nine commonly used ground motion parameters were selected to form the canonical variables of ground motion parameters (GMPCCA). Five structural dynamic response parameters were selected to form canonical variables of structural dynamic response parameters (DRPCCA). Canonical correlation analysis is used to maximize the correlation coefficients between GMPCCA and DRPCCA to obtain multivariate ground motion parameters that can be used to comprehensively assess the tunnel damage potential. The results indicate that the multivariate ground motion parameters used in this study exhibit good stability, making them suitable for evaluating the tunnel damage potential induced by ground motion. Among the nine selected ground motion parameters, peck ground acceleration (PGA), peck ground velocity (PGV), root-mean-square acceleration (RMSA), and spectral acceleration (Sa) have the highest contribution rates to GMPCCA and DRPCCA and the highest importance in assessing the tunnel damage potential. In contrast to univariate ground motion parameters, multivariate ground motion parameters exhibit a higher correlation with tunnel dynamic response parameters and enable accurate assessment of tunnel damage potential.