• Title/Summary/Keyword: reconfigurable

Search Result 536, Processing Time 0.034 seconds

Design of Radiation Pattern Reconfigurable Antenna for Vital Signal Sensing Device Attached on Wristband and SAR Analysis on Human body (팔목 부착형 생체신호 측정기기에 사용가능한 방사패턴 재구성 안테나 설계 및 인체 SAR 영향 분석)

  • Lee, Chang Min;Jung, Chang Won
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.1
    • /
    • pp.666-670
    • /
    • 2015
  • This paper presents radiation pattern reconfigurable antenna for Fitbit Flex wristband which detects vital signal. Also, the paper presents Specific Absorption Rate (SAR) from the loop-dipole radiation pattern reconfigurable antenna based on the position of human body. The proposed loop-dipole radiation pattern reconfigurable antenna produces two opposite side direction radiation pattern using two RF switches. The resonant frequency of the radiation pattern reconfigurable antenna is Bluetooth communication bandwidth (2.4 - 2.485 GHz) and the maximum gain of the proposed antenna is 1.96 dBi. The proposed antenna satisfied the standard SAR value of 1.6 W/kg in 1 g tissue of the human body when the Bluetooth communication input average power of 0.04 W is excited to five parts of human body (head, chest, stomach, back, wrist). The maximum SAR value of in this simulation is presented in the part of head.

A k-Tree-Based Resource (CU/PE) Allocation for Reconfigurable MSIMD/MIMD Multi-Dimensional Mesh-Connected Architectures

  • Srisawat, Jeeraporn;Surakampontorn, Wanlop;Atexandridis, Kikitas A.
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.58-61
    • /
    • 2002
  • In this paper, we present a new generalized k-Tree-based (CU/PE) allocation model to perform dynamic resource (CU/PE) allocation/deallocation decision for the reconfigurable MSIMD/MIMD multi-dimensional (k-D) mesh-connected architectures. Those reconfigurable multi-SIMD/MIMD systems allow dynamic modes of executing tasks, which are SIMD and MIMD. The MIMD task requires only the free sub-system; however the SIMD task needs not only the free sub-system but also the corresponding free CU. In our new k-Tree-based (CU/PE) allocation model, we introduce two best-fit heuristics for the CU allocation decision: 1) the CU depth first search (CU-DFS) in O(kN$_{f}$ ) time and 2) the CU adjacent search (CU-AS) in O(k2$^{k}$ ) time. By the simulation study, the system performance of these two CU allocation strategies was also investigated. Our simulation results showed that the CU-AS and CU-DFS strategies performed the same system performance when applied for the reconfigurable MSIMD/MIMD 2-D and 3-D mesh-connected architectures.

  • PDF

Design, Fabrication and Measurement of a Compact, Frequency Reconfigurable, Modified T-shape Planar Antenna for Portable Applications

  • Iqbal, Amjad;Ullah, Sadiq;Naeem, Umair;Basir, Abdul;Ali, Usman
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.4
    • /
    • pp.1611-1618
    • /
    • 2017
  • This paper presents a compact reconfigurable printed monopole antenna, operating in three different frequency bands (2.45 GHz, 3 GHz and 5.2 GHz), depending upon the state of the lumped element switch. The proposed multiband reconfigurable antenna is designed and fabricated on a 1.6 mm thicker FR-4 substrate having a relative permittivity of 4.4. When the switch is turned ON, the antenna operates in a dual band frequency mode, i.e. WiFi at 2.45 GHz (2.06-3.14 GHz) and WLAN at 5.4 GHz (5.11-5.66 GHz). When the switch is turned OFF, it operates only at 3 GHz (2.44-3.66 GHz). The antenna radiates omni-directionally in these bands with an adequate, bandwidth (>10 %), efficiency (>90 %), gain (>1.2 dB), directivity (>1.7 dBi) and VSWR (<2). The fabricated antenna is tested in the laboratory to validate the simulated results. The antenna, due to its reasonably compact size ($39{\times}37mm^2$), can be used in portable devices such as laptops and iPads.

An AT2 Optimal Reconfigurable Mesh Algorithm for The Constrained Off-line Competitive Deletion Problem (제한된 오프라인 경쟁삭제 문제를 해결하기 위한 AT2 최적의 재구성 가능 메쉬 알고리즘)

  • Lee, Kwang-Eui
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.225-230
    • /
    • 2002
  • The constrained off-line competitive deletion problem is a simple form of the set manipulation operations problem. It excludes the insertion operation from the off-line competitive deletion problem. An optimal sequential algorithm and a CREW PRAM algorithm which runs $O(log^2nloglogn)$ time using O(n/loglogn) processors were already presented in the literature. In this paper, we present a reconfigurable mesh algorithm for the constrained off-line competitive deletion problem. The proposed algorithm is executed in a constant time on an $n{\times}n$ reconfigurable mesh, and the result is $AT^2$ optimal.

Scalable Application Mapping for SIMD Reconfigurable Architecture

  • Kim, Yongjoo;Lee, Jongeun;Lee, Jinyong;Paek, Yunheung
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.15 no.6
    • /
    • pp.634-646
    • /
    • 2015
  • Coarse-Grained Reconfigurable Architecture (CGRA) is a very promising platform that provides fast turn-around-time as well as very high energy efficiency for multimedia applications. One of the problems with CGRAs, however, is application mapping, which currently does not scale well with geometrically increasing numbers of cores. To mitigate the scalability problem, this paper discusses how to use the SIMD (Single Instruction Multiple Data) paradigm for CGRAs. While the idea of SIMD is not new, SIMD can complicate the mapping problem by adding an additional dimension of iteration mapping to the already complex problem of operation and data mapping, which are all interdependent, and can thus significantly affect performance through memory bank conflicts. In this paper, based on a new architecture called SIMD reconfigurable architecture, which allows SIMD execution at multiple levels of granularity, we present how to minimize bank conflicts considering all three related sub-problems, for various RA organizations. We also present data tiling and evaluate a conflict-free scheduling algorithm as a way to eliminate bank conflicts for a certain class of mapping problem.

Design of a reconfigurable paper antenna using the origami method (종이접기 방식을 사용한 방사패턴 가변형 종이 안테나 설계)

  • Park, Dong-Kook
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.7
    • /
    • pp.642-646
    • /
    • 2016
  • A wearable antenna made using conductive tape on paper is presented in this paper. The proposed antenna is composed of a half-wavelength conducting dipole strip and a parasitic conducting strip on the A4 copy paper. The antenna is fed at the center of the dipole strip by an SMA connector. The configuration of the proposed antenna changes according to the origami method. Therefore the radiation patterns of the antenna vary according to whether or not the paper is folded. This approach solves the problem that the reception ratio of the signal decreases because of null points in the antenna radiation pattern. The reflection coefficient and the radiation pattern of the proposed antenna at 900 MHz are evaluated using an EM simulation and measurements. It was shown that the proposed paper antenna has reconfigurable characteristics at 900 MHz when utilizing the origami method.