• Title/Summary/Keyword: Pseudo random number

Search Result 102, Processing Time 0.015 seconds

Opticla Angle Sensor Using Pseudorandom-code And Geometry-code (슈도 랜덤 코드와 기하학 코드를 이용한 광학적 Angle Sensor)

  • 김희성;도규봉
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.2
    • /
    • pp.27-32
    • /
    • 2004
  • Absolute optical angle sensor is described that is an essentially digital opto-electronic device. Its purpose is to resolve the relative and absolute angle position of coded disk using Pseudorandom-code and Geometry-code. In this technique, the angular position of disk is determined in coarse sense first by Pseudorandom-code. A further fine angular position data based on Pixel count is obtained by Geometry-code which result 0.006$^{\circ}$ resolution of the system provided that 7 ${\mu}{\textrm}{m}$ line image sensor are used. The proposed technique is novel in a number of aspects, such that it has the non-contact reflective nature, high resolution of the system, relatively simple code pattern, and inherent digital nature of the sensor. And what is more the system can be easily modified to torque sensor by applying two coded disks in a manner that observe the difference in absolute angular displacement. The digital opto-electronic nature of the proposed sensor, along with its reporting of both torque and angle, makes the system ideal for use in intelligent vehicle systems. In this communication, we propose a technique that utilizes Pseudorandom-code and Geometry-code to determine accurate angular position of coded disk. We present the experimental results to demonstrate the validity of the idea.

90/150 RCA Corresponding to Maximum Weight Polynomial with degree 2n (2n 차 최대무게 다항식에 대응하는 90/150 RCA)

  • Choi, Un-Sook;Cho, Sung-Jin
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.4
    • /
    • pp.819-826
    • /
    • 2018
  • The generalized Hamming weight is one of the important parameters of the linear code. It determines the performance of the code when the linear codes are applied to a cryptographic system. In addition, when the block code is decoded by soft decision using the lattice diagram, it becomes a measure for evaluating the state complexity required for the implementation. In particular, a bit-parallel multiplier on finite fields based on trinomials have been studied. Cellular automata(CA) has superior randomness over LFSR due to its ability to update its state simultaneously by local interaction. In this paper, we deal with the efficient synthesis of the pseudo random number generator, which is one of the important factors in the design of effective cryptosystem. We analyze the property of the characteristic polynomial of the simple 90/150 transition rule block, and propose a synthesis algorithm of the reversible 90/150 CA corresponding to the trinomials $x^2^n+x^{2^n-1}+1$($n{\geq}2$) and the 90/150 reversible CA(RCA) corresponding to the maximum weight polynomial with $2^n$ degree by using this rule block.