• Title/Summary/Keyword: Rotation Sequence

Search Result 115, Processing Time 0.027 seconds

Analysis of Navigation Error According to Rotational Motions of Rotational Inertial Navigation for Designing Optimal Rotation Sequence (최적 회전 절차 설계를 위한 회전형 관성항법장치의 회전 동작별 항법 오차 분석)

  • Jae-Hyuck Cha;Chan-Gook Park;Seong-Yun Cho;Min-Su Jo;Chan-Ju Park
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.19 no.2
    • /
    • pp.445-452
    • /
    • 2024
  • This paper analyzes the navigation error for each rotational motion in order to design an optimal rotation sequence, which is a key technology in the rotational inertial navigation. Rotational inertial navigation system is designed to cancel out navigation errors caused by inertial sensor errors by periodically rotating the inertial measurement unit. A properly sequenced rotational motion cancels out the maximum amount of navigation error and is known as an optimal rotation sequence. To design such an optimal turning procedure, this paper identifies the feasible rotational motions that can be implemented in a rotational inertial navigation system and analyzes the navigation error introduced by each rotational motion. In addition, by analyzing the characteristics of the navigation error generated during a rotation sequence in combination, this paper presents the conditions for designing an optimal rotation sequence.

Chromospheric Activity, Rotation and Age On Lower Main Sequence Stars

  • Park, Young-Deuk;Yun, Hong-Sik
    • Publications of The Korean Astronomical Society
    • /
    • v.1 no.1
    • /
    • pp.13-20
    • /
    • 1984
  • New empirical relations between stellar CaII emission and rotation or age are derived by analyzing Wilson's CaII flux measurements (1968, 1978) of lower main sequence stars, and then we correlate them with their age and rotation rate. It is found that stellar chromospheric emission decays smoothly with age as a star slows down rotationally, establishing that both the emission level and rotation rate decrease with the square root of age.

  • PDF

A New SLM Method using Dummy Sequence Insertion far the PAPR Reduction of the OFDM Communication System (OFDM통신 시스템의 PAPR저감을 위한 Dummy Sequence를 삽입하는 새로운 SLM 기법)

  • 이재은;허근재;김상우;유흥균
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.15 no.4
    • /
    • pp.379-386
    • /
    • 2004
  • OFDM(orthogonal frequency division multiplexing) communications system is very attractive for the high data rate transmissionin the frequency selective fading channel. Since OFDM has high PAPR(peak-to-average power ratio), OFDM signal may be distorted by the nonlinear HPA(high power amplifier). In this paper, we propose an improved dummy sequence scheme for reducing the PAPR in OFDM communication system. This method inserts each different dummy sequence at the predefined sub-carriers fur PAPR reduction. After IFFT, the OFDM data signal with the lowest PAPR is selected to transmit. The complementary sequence is used as dummy sequence. So, it can cut down the computation time and quantity because it dose not require the peak value optimization for finding the phase rotation factor and the transmission of the side information about the rotation factor unlike the PTS method.

An Efficient In-Place Block Rotation Algorithm and its Complexity Analysis (효율적 In-Place Block Rotation 알고리즘과 복잡도 분석)

  • Kim, Pok-Son;Kutzner, Arne
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.3
    • /
    • pp.428-433
    • /
    • 2010
  • The notion "block rotation" denotes the operation of exchanging two consecutive sequences of elements uv to vu. There are three already well-known block rotation algorithms called BlockRotation, Juggling and Reversal algorithm. Recently we presented a novel block rotation algorithm called QuickRotation. In this paper we compare QuickRotation to these three known block rotation algorithms. This comparison covers a complexity analysis as well as benchmarking and shows that a switch to QuickRotation is almost always advantageous.

QRD-RLS Algorithm Implementation Using Double Rotation CORDIC (2회전 CORDIC을 이용한 QRD-RLS 알고리듬 구현)

  • 최민호;송상섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5C
    • /
    • pp.692-699
    • /
    • 2004
  • In this paper we studied an implementation of QR decomposition-based RLS algorithm using modified Givens rotation method. Givens rotation can be obtained with a sequence of the CORDIC operations. In order to reduce the computing time of QR decomposition we restricted the number of iterations of the CORDIC operation per a Givens rotation and used double-rotation method to remove the square-root in the scaling factor.

Phase Representation with Linearity for CORDIC based Frequency Synchronization in OFDM Receivers (OFDM 수신기의 CORDIC 기반 주파수 동기를 위한 선형적인 위상 표현 방법)

  • Kim, See-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.3
    • /
    • pp.81-86
    • /
    • 2010
  • Since CORDIC (COordinate Rotation DIgital Computer) is able to carry out the phase operation, such as vector to phase conversion or rotation of vectors, with adders and shifters, it is well suited for the design of the frequency synchronization unit in OFDM receivers. It is not easy, however, to fully utilize the CORDIC in the OFDM demodulator because of the non-linear characteristics of the direction sequence (DS), which is the representation of the phase in CORDIC. In this paper a new representation method is proposed to linearize the direction sequence approximately. The maximum phase error of the linearized binary direction sequence (LBDS) is also discussed. For the purpose of designing the hardware, the architectures for the binary DS (BDS) to LBDS converter and the LBDS to BDS inverse converter are illustrated. Adopting LBDS, the overall frequency synchronization hardware for OFDM receivers can be implemented fully utilizing CORDIC and general arithmetic operators, such as adders and multipliers, for the phase estimation, loop filtering of the frequency offset, derotation for the frequency offset correction. An example of the design of 22 bit LBDS for the T-DMB demodulator is also presented.

STELLAR ACTIVITY AND ROTATION PERIOD OF LOWER MAIN SEQUENCE STARS

  • Yun, Hong-Sik;Park, Young-Deuk
    • Journal of The Korean Astronomical Society
    • /
    • v.21 no.1
    • /
    • pp.79-95
    • /
    • 1988
  • To examine relations between stellar activity and rotation we estimated parameters of stellar activity such as $R'_{HK}$, $R'_{MgII}$, $R'_{CII}$, $R'_{CIV}$ and $R'_{X-ray}$ from the published data which measure the activity levels of stellar chromospheres, transition regions and coronae. In the present study we considered only the main sequence stars in an attempt to minimize the influence of other stellar parameters such as radius, age and stellar convection on stellar activity since they are also known to affect the magnetic field generation. In the present analysis we selected only those stars that satisfy the following conditions: (1) flux measurements are available together with Ca II fluxes and (2) rotation periods are determined by Ca II observations. We derived relations between the ${\bar{R}}ossby$ number $R_o$ and stellar activity $R'_{HK}$, $R'_{MgII}$, $R'_{CII}$, $R'_{CIV}$ and $R'_{X-ray}$ and assessed the relations by plotting $R'_{HK}$, $R'_{MgII}$ and $R'_{X-ray}$ against rotation period $P_{rot}$ for comparison with observations. From the comparison it is found that as far as the rotation-activity relation is concerned, (1) normalized surface flux $R'_{HK}$ is better than the surface flux $F'_{HK}$, in the sense that $R'_{HK}$ differentiates the color dependence better and (2) $R'_{HK}$ defined by Rutten (1984) describes the observations notably better than $R'_{HK}$ of Noyes et al. (1984).

  • PDF

Pruning and Matching Scheme for Rotation Invariant Leaf Image Retrieval

  • Tak, Yoon-Sik;Hwang, Een-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.6
    • /
    • pp.280-298
    • /
    • 2008
  • For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.