• Title/Summary/Keyword: coprime

Search Result 52, Processing Time 0.023 seconds

Track-following Control for Disk Surface Defect of Optical Disk Drive Systems. (광디스크 드라이브의 디스크 표면 결함에 대한 트래킹 제어)

  • Lee, Joon-Seong;Jeong, Dong-Seul;Chung, Chung-Choo
    • 정보저장시스템학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.223-228
    • /
    • 2005
  • In oprical disk drives, surface defects on a disk distort tracking error signal and disturb a precision tracking control.. A conventional method against disk defect is held the tracking control signal when a defective portion is detected. However, if the defective portion is getting longer, objective lens will get away from following track. In order to keep the postion of spot from following track, the servo system must predict tracking error and control the object lens in the defective portion. A tracking control system for optical disk drives was proposed recently based on both Coprime Factorization(CF) and Zero Phase Erro. Tracking(ZPET) control. The system was proposed for overcome the limit of previously tracking error. But there were no research about the method against the defective portion. This paper proposes a new and simple ZPET construct. as a new method against the defective portion. From experimental results, we have proved that proposed method improves the performance against the defective portion, decreases the uncertainty of a model, and requires less memory than the previously proposed method.

  • PDF

Colourings and the Alexander Polynomial

  • Camacho, Luis;Dionisio, Francisco Miguel;Picken, Roger
    • Kyungpook Mathematical Journal
    • /
    • v.56 no.3
    • /
    • pp.1017-1045
    • /
    • 2016
  • Using a combination of calculational and theoretical approaches, we establish results that relate two knot invariants, the Alexander polynomial, and the number of quandle colourings using any finite linear Alexander quandle. Given such a quandle, specified by two coprime integers n and m, the number of colourings of a knot diagram is given by counting the solutions of a matrix equation of the form AX = 0 mod n, where A is the m-dependent colouring matrix. We devised an algorithm to reduce A to echelon form, and applied this to the colouring matrices for all prime knots with up to 10 crossings, finding just three distinct reduced types. For two of these types, both upper triangular, we found general formulae for the number of colourings. This enables us to prove that in some cases the number of such quandle colourings cannot distinguish knots with the same Alexander polynomial, whilst in other cases knots with the same Alexander polynomial can be distinguished by colourings with a specific quandle. When two knots have different Alexander polynomials, and their reduced colouring matrices are upper triangular, we find a specific quandle for which we prove that it distinguishes them by colourings.