• Title/Summary/Keyword: FSA algorithm

Search Result 36, Processing Time 0.023 seconds

Optimal Frame Size Allocation Mechanism for Fast Tag Identification in RFID System (RFID 시스템에서 고속 태그 식별을 위한 최적의 프레임 크기 할당 기법)

  • Lim, In-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1569-1574
    • /
    • 2008
  • Almost all the RFID systems in the 13.56MHz ISM band adopt the FSA algorithm as the anti-collision algorithm. The FSA algorithm is based on the slotted ALOHA with a fixed frame size. The FSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. Therefore, this paper proposes a new OFSA. The proposed OFSA algorithm dynamically allocates the optimal frame size at every frame based on the number of tags in the reader's identification range. According to the simulation results, the system efficiency of the proposed algorithm should be maintained optimally. Also, the proposed algorithm always obtained the minimum tag identification delay.

The Effect Analysis and Correction of Phase errors by Satellite Attitude Errors using the FSA for the Spotlight SAR Processing (Spotlight SAR 신호처리기법 FSA를 이용한 위성 자세오차로 인한 위상오차 영향분석 및 보정)

  • Shim, Sang-Heun
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.10 no.2
    • /
    • pp.160-169
    • /
    • 2007
  • In this paper, we have described and simulated the effect analysis and correction of phase errors in the SAR rawdata induced by satellite attitude errors such as drift, jitter. This simulation is based on the FSA(Frequency Scaling Algorithm) for high resolution image formation of the Spotlight SAR. Phase errors produce the degradation of SAR image quality such as loss of resolution, geometric distortion, loss of contrast, spurious targets, and decrease in SNR. To resolve this problem, this paper presents method for correction of phase errors using the PGA(Phase Gradient Algorithm) in connection with the FSA. Several results of the phase errors correction are presented for Spotlight SAR rawdata.

A Computer Algorithm for the evaluation of elements in Face Stimulus Assessment (얼굴자극검사의 평가를 위한 컴퓨터 알고리즘)

  • Kim, Jong-Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.6
    • /
    • pp.1961-1968
    • /
    • 2010
  • The Face Stimulus Assessment is an efficient projective drawing test developed by Betts. This paper categorizes scales which Betts suggested into the following five groups: accuracy of painting, color fit, perception of shape, precision of drawing, and space usage. In this paper, a computer algorithm which objectively evaluates these five scales is suggested. The proposed algorithm defines the areas of the lip, eyes, hair, etc. which take on significant roles in the evaluation of the FSA and based on these factors, it calculates the grade of each scale through the main color and color ratio. The consistency of evaluations between the computer algorithm and the art therapist is measured by the Quadratic Weighted Kappa. By providing objectivity and consistency, the computer algorithm is expected to solve the problem of uncertainty found in art therapists' evaluations of projective drawing tests caused by their subjective judgment, experience, and intuition.

A Scheme for Estimating Number of Tags in FSA-based RFID Systems

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.2
    • /
    • pp.164-169
    • /
    • 2009
  • An RFID system consists of radio frequency tags attached to objects that need to be identified and one or more electromagnetic readers. Unlike the traditional bar code system, the great benefit of RFID technology is that it allows information to be read without requiring contact between the tag and the reader. For this contact-less feature, RFID technology in the near future will become an attractive alternative to bar code in many application fields. In almost all the 13.56MHz RFID systems, FSA (Framed Slot ALOHA) algorithm is used for identifying multiple tags in the reader's identification range. In FSA algorithm, the tag identification time and system efficiency depend mainly on the number of tags and frame size. In this paper, we propose a tag number estimation scheme and a dynamic frame size allocation scheme based on the estimated number of tags.

A Modified FSA Technique Using Full-aperture for SAR Spotlight Mode (SAR 집중조사모드를 위해 전 개구면을 사용하는 수정된 FSA 기법)

  • Jung, Young-Kwang;Ra, Won-Sang
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.44 no.10
    • /
    • pp.921-932
    • /
    • 2016
  • In this paper, a modified FSA(Frequency Scaling Algorithm) is proposed for KOMPSAT-5 high-resolution SAR image generation. In order to enhance performance of azimuth compression, degraded in sub-aperture processing due to the imperfect geometric parameter of data acquisition, the full-aperture signal processing algorithm is designed based on the exact time-frequency analysis. In addition, an azimuth scaling function is newly devised to make the full-aperture processing algorithm suitable for KOMPSAT-5 sliding-spotlight mode. Different from the previous sub-aperture FSA schemes, the suggested technique could accommodate the merit of unified signal processing structure regardless of operational modes of KOMPSAT-5. Through the point target simulation, it is verified that the suggested algorithm provides superior performance of azimuth compression over the existing full-aperture processing methods. The experimental results using real data acquired by KOMPSAT-5 are also given to demonstrate the effectiveness of our scheme as well.

Dynamic Frame Size Allocation Scheme based on Estimated Number of Tags (태그수추정에 기반한 동적 프레임 크기 할당 기법)

  • Lim, In-Taek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.3
    • /
    • pp.469-474
    • /
    • 2009
  • An RFID system consists of radio frequency tags attached to objects that need to be identified and one or more electromagnetic readers. Unlike the traditional bar code system, the great benefit of RFID technology is that it allows information to be read without requiring contact between the tag and the reader. For this contact-less feature, RFID technology in the near future will become an attractive alternative to bar code in many application fields. In almost all the 13.56MHz RFID systems, FSA algorithm is used for identifying multiple tags in the reader's identification range. In FSA algorithm, the tag identification time and system efficiency depend mainly on the number of tags and frame size. In this paper, we propose a tag number estimation scheme and a dynamic frame size allocation scheme based on the estimated number of tags.

A Mechanism for Dynamic Allocation of Frame Size in RFID System

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.4
    • /
    • pp.364-369
    • /
    • 2008
  • The FSA algorithm for identifying multiple tags in RFID systems is based on the slotted ALOHA scheme with a fixed frame size. The performance of FSA algorithm is dependent on the frame size and the number of tags in the reader's identification range. Therefore, this paper proposes a new ODFSA. The proposed ODFSA algorithm dynamically allocates the optimal frame size at every frame based on the number of tags in the reader's identification range. According to the simulation results, the system efficiency of the proposed algorithm should be maintained optimally. Also, the proposed algorithm always obtained the minimum tag identification delay.

Dynamic FSA Algorithm for Fast Tag Identification in RFID Systems (RFID 시스템에서 고속 태그 식별을 위한 동적 FSA 알고리즘)

  • Lim In-Taek;Choi Jin-Oh
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.5
    • /
    • pp.806-811
    • /
    • 2006
  • In RFID system, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to as anti-collision algorithm. Among the existing anti-collision algorithms, SFSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. This paper proposes a new anti-collision algorithm called DFSA which determines the optimal frame size using the number of collided slots at every frame. According to the simulation results, the tag identification time of the proposed algorithm is faster than that of SFSA.

A DFS-ALOHA Algorithm with Slot Congestion Rates in a RFID System (RFID시스템에서 슬롯의 혼잡도를 이용한 DFS-ALOHA 알고리즘)

  • Lee, Jae-Ku;Choi, Seung-Sik
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.267-274
    • /
    • 2009
  • For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. There are two methods of anti-collision algorithms for the identification of multiple tags, conclusive algorithms based on tree and stochastic algorithms based on slotted ALOHA. In this paper, we propose a Dynamic Framed Slotted ALOHA-Slot Congestion(DFSA-SC) Algorithm. The proposed algorithm improves the efficiency of collision resolution. The performance of the proposed DFSA-SC algorithm is showed by simulation. The identification time of the proposed algorithm is shorter than that of the existing DFSA algorithm. Furthermore, when the bit duplication of the tagID is higher, the proposed algorithm is more efficient than Query Tree algorithm.

Fast Motion Estimation Algorithm using Temporal Continuity of Motion Vector (움직임 벡터의 시간적 연속성을 이용한 고속 움직임 추정 알고리즘)

  • 이경환;류권열;최정현
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.7
    • /
    • pp.1121-1130
    • /
    • 2003
  • This paper proposes a new motion estimation algorithm using the temporal continuity of motion. We set up a wide global search region (GSR), which basically corresponds to the search region of FSA, and local search regions (LSRs), the positions for which are predicted by the motion vectors of the temporal neighbor blocks, are constructed in the GSR. The previous frame blocks that possibly have effects on the current block are to be the temporal neighbor blocks. Then Motion estimation is only performed in the areas made by LSRs. Experimental results show that the proposed method can maintain visual qualifies with significant reductions of complexity by reducing search regions, when compared to the conventional FSA.

  • PDF