• Title/Summary/Keyword: implementation algorithm

Search Result 4,233, Processing Time 0.03 seconds

Performance Analysis of FSA Algorithm for Tag Identification in RFID Systems (RFID 시스템에서 태그 식별을 위한 SFSA 알고리즘의 성능 분석)

  • Lim, In-Taek;Choi, Jin-Oh;Choi, Jin-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.563-566
    • /
    • 2008
  • In RFID system. when a variety of tags are present in the interrogation zone of a single reader at the same time, the system requires a multiple tag identification scheme that allows the reader to read data from the individual tags. Anti-collision algorithms required for the multiple tag identification are essential for the implementation of RFID system. This paper analyzed the performance of SFSA algorithm, which is easy to implement. According to the analytical results, the algorithm's performances are closely related with the number of tags and the frame size.

  • PDF

An Efficient Built-in Self-Test Algorithm for Neighborhood Pattern- and Bit-Line-Sensitive Faults in High-Density Memories

  • Kang, Dong-Chual;Park, Sung-Min;Cho, Sang-Bock
    • ETRI Journal
    • /
    • v.26 no.6
    • /
    • pp.520-534
    • /
    • 2004
  • As the density of memories increases, unwanted interference between cells and the coupling noise between bit-lines become significant, requiring parallel testing. Testing high-density memories for a high degree of fault coverage requires either a relatively large number of test vectors or a significant amount of additional test circuitry. This paper proposes a new tiling method and an efficient built-in self-test (BIST) algorithm for neighborhood pattern-sensitive faults (NPSFs) and new neighborhood bit-line sensitive faults (NBLSFs). Instead of the conventional five-cell and nine-cell physical neighborhood layouts to test memory cells, a four-cell layout is utilized. This four-cell layout needs smaller test vectors, provides easier hardware implementation, and is more appropriate for both NPSFs and NBLSFs detection. A CMOS column decoder and the parallel comparator proposed by P. Mazumder are modified to implement the test procedure. Consequently, these reduce the number of transistors used for a BIST circuit. Also, we present algorithm properties such as the capability to detect stuck-at faults, transition faults, conventional pattern-sensitive faults, and neighborhood bit-line sensitive faults.

  • PDF

Scheduling Algorithm for WDM-PON in SUCCESS Network Architecture (SUCCESS 네트워크 구조에서의 WDM-PON을 위한 스케줄링 알고리즘)

  • Kim, Hyun-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7B
    • /
    • pp.427-432
    • /
    • 2005
  • Emerging high broad band multimedia service with high quality has led to demand for challenge of optical access network and Passive Optical Network is one of the most important technologies for future optical access network. In this paper, we study the scheduling algorithm for WDM-PON in SUCCESS network architecture, a next generation hybrid WDM/TDM optical access network architecture. Due to economic implementation of this architecture, the shared resources efficiently need to be assigned and then we propose the efficient scheduling algorithm based on specific architecture and characters of SUCCESS. We evaluate and analyze the performance in terms of the average packet delay and throughput of the whole system.

An Implementation of a Current Controlled Bi-directional Inverter with ZVT Switching (ZVT 스위칭 되는 전류제어형 양방향 인버터의 구현)

  • 李 星 龍;高 晟 勳;金 成 佑
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.7 no.2
    • /
    • pp.129-136
    • /
    • 2002
  • A single-phase inverter using a diode bridge-type resonant circuit to implement ZVT(Zero Voltage Transition) switching is presented. It Is shown that the ZACE(Zero Average Current Error) algorithm based Polarized ramptime current control can provide a suitable interface between DC link of diode bridge-type resonant circuit and the inverter. The current control algorithm is analyzed about how to design the circuit with auxiliary switch which can ZVT operation for the main power switch. The simulation and experimental results would be shown to verify the proposed current algorithm, because the main Power switch is turn on with ZVT and the hi-directional inverter is operated.

Design and Implementation of Ubiquitous Sensor Network System for Monitoring the Bio-information and Emergency of the Elderly in Silver Town

  • Choi, Seong-Ho;Park, Hyung-Kun;Yu, Yun-Seop
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.2
    • /
    • pp.219-222
    • /
    • 2010
  • An ubiquitous sensor network (USN) system to monitor the bio information and the emergency of the elderly in the silver town is presented. The USN system consists of the sensor node platforms based on MCU of Atmage128L and RF Chip of CC2420 satisfying IEEE 802.15.4, which includes the bios sensor module such as the electrocardiogram (ECG) sensor and the temperature sensor. Additionally, when an emergency of the elderly is occurred in the silver town, the routing algorithm suitable to find and inform the location of the elderly is proposed, and the proposed routing algorithm is applied to the USN. To collect and manage the ECG data at the PC connected to the sink node, LabView software is used. The bio information and the emergency of the elderly can also be monitored at the client PC by TCP/IP networks in the USN system.

Optimal path planning for the capturing of a moving object

  • Kang, Jin-Gu;Lee, Sang-Hun;Hwang, Cheol-Ho;Lee, Jang-Myung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1419-1423
    • /
    • 2004
  • In this paper, we propose an algorithm for planning an optimal path to capture a moving object by a mobile robot in real-time. The direction and rotational angular velocity of the moving object are estimated using the Kalman filter, a state estimator. It is demonstrated that the moving object is tracked by using a 2-DOF active camera mounted on the mobile robot and then captured by a mobile manipulator. The optimal path to capture the moving object is dependent on the initial conditions of the mobile robot, and the real-time planning of the robot trajectory is definitely required for the successful capturing of the moving object. Therefore the algorithm that determines the optimal path to capture a moving object depending on the initial conditions of the mobile robot and the conditions of a moving object is proposed in this paper. For real-time implementation, the optimal representative blocks have been utilized for the experiments to show the effectiveness of the proposed algorithm.

  • PDF

Optimal path planning for the capturing of a moving object

  • Hwang, Cheol-Ho;Lee, Sang-Hun;Ko, Jae-Pyung;Lee, Jang-Myung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.186-190
    • /
    • 2003
  • In this paper, we propose an algorithm for planning an optimal path to capture a moving object by a mobile robot in real-time. The direction and rotational angular velocity of the moving object are estimated using the Kalman filter, a state estimator. It is demonstrated that the moving object is tracked by using a 2-DOF active camera mounted on the mobile robot and then captured by a mobile manipulator. The optimal path to capture the moving object is dependent on the initial conditions of the mobile robot, and the real-time planning of the robot trajectory is definitely required for the successful capturing of the moving object. Therefore the algorithm that determines the optimal path to capture a moving object depending on the initial conditions of the mobile robot and the conditions of a moving object is proposed in this paper. For real-time implementation, the optimal representative blocks have been utilized for the experiments to show the effectiveness of the proposed algorithm.

  • PDF

QoS Based IrDA in Mobile Phones

  • Kim Jong Sung;Yoon Sang Sub;Chun Byung Sik
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.528-531
    • /
    • 2004
  • This paper presents the design and implementation of a QoS based IrDA in mobile phones. The IrDA standards have arised from the need to connect various mobile devices together. But currently, we have a difficult to connecting various mobile devices together. The difficult thing is to adjust the minimum turn around time. The minimum turn around time in IrDA deals with the time needed for a receiver circuit to recover following saturation by transmissions from the same device (turn around latency). This parameter corresponds to the required time delay between the last byte of the last frames sent by a station and the point at which it is ready the first byte of a frame from another station. This parameter comes into play when the link is turned around and is negotiated independency for each station. We solve this matter by using the Dynamic Adjustment Algorithm (DAA). The dynamic adjustment algorithm adjusts the minimum turn around time according to the numbers of devices. We apply our direct adjustment algorithm to our QoS based IrDA in mobile phones and show the improved performance of connection with various mobile phones together.

  • PDF

An Efficient Dead Pixel Detection Algorithm and VLSI Implementation (효율적인 불량화소 검출 알고리듬 및 하드웨어 구현)

  • An Jee-Hoon;Lee Won-Jae;Kim Jae-Seok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.9 s.351
    • /
    • pp.38-43
    • /
    • 2006
  • In this paper, we propose the efficient dead pixel detection algorithm for CMOS image sensors and its hardware architecture. The CMOS image sensors as image input devices are becoming popular due to the demand for miniaturized, low-power and cost-effective imaging systems. However, the presence of the dead pixels degrade the image quality. To detect the dead pixels, the proposed algorithm is composed of scan, trace and detection step. The experimental results showed that it could detect 99.99% of dead pixels. It was designed in a hardware description language and total logic gate count is 3.2k using 0.25 CMOS standard cell library.

New Data Matrix Structure and Algorithm Implementation for Digital Holographic Data Storage (디지털 홀로그래픽 정보 저장을 위한 새로운 데이터 매트릭스 구조 및 알고리즘 구현)

  • Choi, Jae-Kwang;Kim, Jung-Hoi;Kim, Nam
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.2
    • /
    • pp.17-25
    • /
    • 2004
  • In this Paper, new data matrix structure and respective processing algorithm for digital holographic storage are Proposed. Data matrix consists of user data and reference grid which is used to compensate geometrical errors such as magnification, shift and rotation of stored information. Processing algorithm identifies the location of reference grid and extracts user data. As a result of experiment, raw BER in case of shit, rotation and magnification are 3.09${\times}$10$^{-18}$ , 6.14${\times}$10$^{-12}$ , 1.2${\times}$10$^{-7}$ , respectively.