SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS

Similar documents
Duality in linear interval equations

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms

Comparison between nmos Pass Transistor logic style vs. CMOS Complementary Cells*

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE

A Fast Delay Analysis Algorithm for The Hybrid Structured Clock Network

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

COSC 6374 Parallel Computation. Dense Matrix Operations

COSC 6374 Parallel Computation. Communication Performance Modeling (II) Edgar Gabriel Fall Overview. Impact of communication costs on Speedup

3.5.1 Single slit diffraction

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview

Lesson 4.4. Euler Circuits and Paths. Explore This

A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES

3.5.1 Single slit diffraction

Fault tree conversion to binary decision diagrams

Introduction to Algebra

Minimal Memory Abstractions

Lecture 12 : Topological Spaces

Triple/Quadruple Patterning Layout Decomposition via Novel Linear Programming and Iterative Rounding

Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions

Incremental Design Debugging in a Logic Synthesis Environment

CS 241 Week 4 Tutorial Solutions

CS553 Lecture Introduction to Data-flow Analysis 1

Transparent neutral-element elimination in MPI reduction operations

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink

Width and Bounding Box of Imprecise Points

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems

An Efficient 8b/10b Encoder and Decoder Design using Reversible Logic Gates

SOFTWARE-BUG LOCALIZATION WITH GRAPH MINING

Distributed Systems Principles and Paradigms

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline

A new way to evaluate steel sheet surfaces

Analysis of Fundus Fluorescein Angiogram Based on the Hessian Matrix of Directional Curvelet Sub bands and Distance Regularized Level Set Evolution

Image Compression based on Quadtree and Polynomial

Parallelization Optimization of System-Level Specification

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.

Key words: Fuzzy linear programming, fuzzy triangular, fuzzy trapezoidal, fuzzy number, modified S-curve function, fuzzy simplex method.

GENG2140 Modelling and Computer Analysis for Engineers

Lecture 8: Graph-theoretic problems (again)

International Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016)

Selecting the Most Highly Correlated Pairs within a Large Vocabulary

MATH 2530: WORKSHEET 7. x 2 y dz dy dx =

4452 Mathematical Modeling Lecture 4: Lagrange Multipliers

[SYLWAN., 158(6)]. ISI

2 Computing all Intersections of a Set of Segments Line Segment Intersection

Tabu Split and Merge for the Simplification of Polygonal Curves

Agilent G3314AA BioConfirm Software

12/9/14. CS151 Fall 20124Lecture (almost there) 12/6. Graphs. Seven Bridges of Königsberg. Leonard Euler

Honors Thesis: Investigating the Algebraic Properties of Cayley Digraphs

WORKSHOP 8B TENSION COUPON

6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.

Application of FEA to Image-based Models of Electrical Trees with Uniform Conductivity

Colour-texture analysis of paintings using ICA filter banks

Multi-dimensional Selectivity Estimation Using Compressed Histogram Information*

Greedy Algorithm. Algorithm Fall Semester

An Approach to Filter the Test Data for Killing Multiple Mutants in Different Locations

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco

Rakesh Kumar Singh, P.Senthilkumaran and Kehar Singh * Department of Physics Indian Institute of Technology Hauz Khas, New Delhi ABSTRACT

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

Additional Measurement Algorithms in the Overhauser Magnetometer POS-1

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Exploiting Locality to Ameliorate Packet Queue Contention and Serialization

IMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING

Single-Layer Trunk Routing Using 45-Degree Lines within Critical Areas for PCB Routing

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model.

Distance vector protocol

Manufacturing and Flat-wise Compression Performance of Modified 3D Integrated Sandwich Fabric Composites

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE

Fig.25: the Role of LEX

Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book

Efficient Subscription Management in Content-based Networks

Motion Simulation of Cycloidal Gears, Cams, and Other Mechanisms

Research Article Determining Sensor Locations in Wireless Sensor Networks

CS321 Languages and Compiler Design I. Winter 2012 Lecture 5

Double Integrals. MATH 375 Numerical Analysis. J. Robert Buchanan. Fall Department of Mathematics. J. Robert Buchanan Double Integrals

Calculus Differentiation

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions

A decision support system prototype for fuzzy multiple objective optimization

Approximate Joins for Data Centric XML

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

Spectral Analysis of MCDF Operations in Image Processing

WORKSHOP 9 HEX MESH USING SWEEP VECTOR

Midterm Exam CSC October 2001

SUPPLEMENTARY INFORMATION

On the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis

EECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining

LETKF compared to 4DVAR for assimilation of surface pressure observations in IFS

Abstract. Calculation of mirror profile The theory underlying the calculation of the mirror profiles is described below.

Clinopyroxene. Pyroxene. Clinopyroxene. Compositional Groups

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs.

4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees.

CS453 INTRODUCTION TO DATAFLOW ANALYSIS

Error Numbers of the Standard Function Block

A New Approach for Ranking of Fuzzy Numbers using the Incentre of Centroids

A Transportation Problem Analysed by a New Ranking Method

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks

The User-defined Modeling Method of Power System Components Based on RTDS-CBuilder

Correcting the Dynamic Call Graph Using Control Flow Constraints

Inter-domain Routing

Transcription:

Progress In Eletromgnetis Reserh C, Vol. 3, 195 22, 28 SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS W.-L. Chen nd G.-M. Wng Rdr Engineering Deprtment Missile Institute of Air Fore Engineering University Snyun County, Shnxi Provine, 7138, P. R. Chin Astrt In this pper, we present novel tehnique to redue the size of edge-fed mirostrip pth ntenn. By ething the pth s the Sierpinski rpet, the resonnt frequeny n e lowered to lower vlues, nd this property n e employed to redue the size of the onventionl pth ntenn. The mesurement results show, the pth hieved mximum 33.9% size redution y the edge-fed Sierpinski Crpet mirostrip pth ntenn (SCMPA) of the seond itertion order, nd other performnes, suh s return loss ndwidth nd rdition ptterns, were virtully unhnged. 1. INTRODUCTION Aside from using high dieletri sustrtes [1], pplying shorting tehniques [2], nd inresing the eletril length of the ntenn y optimizing the shpe [3], there re minly two tehniques to redue the size of n edge-fed mirostrip pth ntenn. One is loding the edges of the pth with indutive elements [4, 5], nd the other is inserting the pitive elements into the pth [6, 7]. Koh frtl shpes hve een pplied to the edges of the pth to redue the size of the ntenn in [8 1], nd the essene of this tehnique flls into the indutive loding t the pth edges. And until now, there hs no reporting out the pplition of frtl theory to the tehnique of pitive loding. In this pper, we propose novel tehnique to pply frtl theory into this tehnique. By ething the pth s Sierpinski rpet of different itertion orders, the simultion results show the operting frequeny of the ntenn n e lowered to lower vlues, t the sme time mintining the ndwidth, rdition ptterns omprle to tht of norml edge-fed mirostrip pth

196 Chen nd Wng ntenn, nd this property n e used to redue the size of the pth ntenn. The proposed method is verified y the mesurement results. 2. SMALL SIZE EDGE-FED SCMPAS 2.1. Frequeny Lowering Property of the SCMPAs The Sierpinski rpet struture hs een pplied to ntenn engineering widely [11, 12], s shown in Fig. 1, ut until now, it hs not een used to redue the size of the edge-fed mirostrip pth ntenn. w w w Figure 1. Shemtis of the edge-fed Sierpinski rpet mirostrip pth ntenns of different itertion orders. S: Zeroth itertion order, S1: First itertion order, S2: Seond itertion order. As n e seen from Fig. 1, the dropped little retngulr elements re inside the pth, thus these elements n e onsidered s pitive elements. The whole struture of S1 nd S2 re somewht like the strutures loded y pitive elements s reported in [6, 7], nd this tehnique is expeted to lower the operting frequeny. As soon s the enter operting frequeny (f =1.8 GHz) nd the sustrte prmeters (er =4.3 nd h = 1 mm) given out, the design of the SCMPA n e omplished esily. Firstly, the onventionl edge-fed mirostrip retngulr pth ntenn n e designed followed the stndrd proedures given in [2]. Their optimum dimensions hve een determined through the optimiztion proess using FEM (finite element method)-sed Ansoft HFSS version 1.. Thus the physil prmeters of the onventionl edge-fed pth ntenn n e rrived t = 6 mm, =39.2 mm, =26.8 mm, nd w =1.9 mm. Seondly, the SCMPAs of different itertion orders n e designed y dropping elements on the pth s Sierpinski rpet, whose itertion ftor is 1/3, without hnging the physil prmeters of the pth, s shown in Fig. 1. Beuse of the mnufturing tolerne, the itertion order is limited to 2.

Progress In Eletromgnetis Reserh C, Vol. 3, 28 197-2 -4 Return Loss (db) -6-8 -1-12 -14-16 S S1 S2-18 -2 1.35 1.4 1.45 1.5 1.55 1.6 1.65 1.7 1.75 1.8 1.85 1.9 1.95 Frequeny (GHz) Figure 2. Simulted return losses of the designed edge-fed SCMPAs. Fig. 2 shows the simulted return loss, nd Fig. 3 shows the simulted rdition ptterns, of the designed edge-fed SCMPAs of different itertion orders, respetively, using Ansoft HFSS version 1.. As expeted y the uthors, the enter operting frequeny of the designed SCMPAs of different itertion orders shifted to lower vlues s the itertion orders inresed, s shown in Fig. 2. The enter operting frequeny of the onventionl edge-fed retngulr pth ntenn is 1.8 GHz, the edge-fed SCMPA of first itertion order is 1.5 GHz, nd the edge-fed SCMPA of the seond itertion order is 1.46 GHz. As lso shown in Fig. 3, side from deresing of the ntenn gin, whih is inevitle when the ntenn size deresed, the rdition ptterns of E-plne (phi = ) nd H-plne (phi = 9 ) of the designed SCMPAs of different itertion orders re omprle to eh other. From the ove nlysis, the frequeny lowering property of the SCMPAs is shown lerly, nd this property, s pitive loding tehnique, n e used to redue the size of the pth ntenns. 2.2. Smll Size Edge-Fed SCMPAs nd Experiment Results We designed the smll size edge-fed SCMPAs t 1.8 GHz, using the sustrte prmeters given ove. By optimizing the physil prmeters (,, nd ) of the SCMPAs of different itertion orders to mke the resonnt frequeny entered t 1.8 GHz, the vlues of these prmeters n e rrived suessfully, whih were s shown in Fig. 4. The prototypes of the designed smll size SCMPAs of different

198 Chen nd Wng 1 5-5 Gin (db) -1-15 -2-25 -3-35 S, f=1.8ghz S1, f=1.5ghz S2, f=1.46ghz -4-18 -15-12 -9-6 -3 3 6 9 12 15 18 6 3-3 Thet (deg) () Gin (db) -6-9 -12-15 S, f=1.8ghz S1, f=1.5ghz S2, f=1.46ghz -18-18 -15-12 -9-6 -3 3 6 9 12 15 18 Thet (deg) () Figure 3. Simulted rdition ptterns. () phi = deg, () phi = 9 deg. itertion orders were frited for experimentl use, nd Fig. 5 shows the photogrph of the frited prototypes. Fig. 6 shows the simulted nd mesured return losses, nd Fig. 7 shows the simulted nd mesured rdition ptterns, of the designed SCMPAs of different itertion orders. As n e seen from Fig. 4 nd Fig. 5, when resonted t sme frequeny, the size of the pth of SCMPA with the First itertion order

Progress In Eletromgnetis Reserh C, Vol. 3, 28 199 =49.mm =33.mm =21. 8mm w=1.9mm = 48.mm = 32.4mm =21.5mm w=1.9mm w f =1.8GHz w f =1.8GHz () S1 () S2 Figure 4. 1.8 GHz. Shemtis of designed edge-fed SCMPAs resonted t Figure 5. Photogrph of the designed edge-fed SCMPAs resonted t 1.8 GHz.. -2.5-5. -2-4 Return Loss (db) -7.5-1. -12.5-15. -17.5-2. S S1-22.5 S2-25. 1.65 1.7 1.75 1.8 1.85 1.9 1.95 Frequeny (GHz) () Simulted results Return Loss (db) -6-8 -1-12 -14-16 -18-2 1.65 1.7 1.75 1.8 1.85 1.9 1.95 Frequeny (GHz) () Mesured results Figure 6. Return losses of the designed smll size SCMPAs. S S1 S2 is 68.75% of the size of the pth of onventionl pth ntenn, thus hieved 31.25% size redution, nd the size of the pth of SCMPA with the seond itertion order is 66.1% of the size of the pth of the onventionl pth ntenn, thus hieved 33.9% size redution. And from these oservtions, it is expeted tht the resonnt frequeny of the SCMPAs with itertion orders higher thn the seond itertion

2 Chen nd Wng () S () S1 () S2 Figure 7. SCMPAs. Rdition ptterns of the designed smll size edge-fed would remin lmost onstnt. As lso n e seen from Fig. 6 nd Fig. 7, the ntenn performnes suh s the return loss ndwidth nd the rdition ptterns of the SCMPAs re virtully unhnged.

Progress In Eletromgnetis Reserh C, Vol. 3, 28 21 3. CONCLUSION In this pper, sed on the pitive loding tehnique, the frequeny lowering property of the edge-fed Sierpinski rpet mirostrip ntenns is studied. As expeted y the uthors, the edge-fed Sierpinski rpet mirostrip ntenns hve lower resonnt frequenies thn the onventionl pth ntenn, nd this property n y used to redue the pth size of the ntenn. When designed the edge-fed Sierpinski rpet mirostrip ntenns of different itertion orders t the sme frequeny, for Sierpinski rpet with 1/3 itertion ftor, the size of the pth n e redued to out 33.9% of the onventionl ounterprt without degrding the ntenn performnes, suh s the return loss nd rdition ptterns. The essene of this size redution tehnique is loding pitive elements inside the pth, nd to hieve muh greter redution in ntenn size, this tehnique n e used simultneously with other size redution tehniques, suh s indutive loding, using high dieletri onstnt sustrte, shorting tehnique, et. REFERENCES 1. Lo, T. K. nd Y. Hwng, Mirostrip ntenns of very high permittivity for personl ommunitions, 1997 Asi-Pifi Mirowve Conferene, 253 256, 1997. 2. Wong, K.-L., Compt nd Brodnd Mirostrip Antenns, 1 7, John Wiely & Sons In., 22. 3. Hersovii, N., M. F. Osorio, et l., Minituriztion of retngulr mirostrip pthes using geneti lgorithms, IEEE Antenns nd Wireless Propgtion Letters, Vol. 1, 94 97, 22. 4. Reed, S., L. Deslos, C. Terret, nd S. Toutin, Size redution of pth ntenn y mens of indutive lods, Mirowve nd Optil Tehnology Letters, Vol. 29, No. 2, 79 81, 21. 5. Deslos, L., Y. Mhe, S. Reed, G. Poilsne, nd S. Toutin, Pth ntenn size redution y omining indutive loding nd short-points tehnique, Mirowve nd Optil Tehnology Letters, Vol. 3, No. 6, 385 386, 21. 6. Deslos, L., Size redution of pth y mens of slots insertion, Mirowve nd Optil Tehnology Letters, Vol. 25, No. 2, 111 113, 2. 7. Leon, G., R. R. Boix, nd F. Medin, A omprison mong different redued-size resonnt mirostrip pthes, Mirowve nd Optil Tehnology Letters, Vol. 29, No. 3, 143 146, 21.

22 Chen nd Wng 8. Kim, I.-K., J.-G. Yook, nd H.-K. Prk, Frtl-shpe smll size mirostrip ntenn, Mirowve nd Optil Tehnology Letters, Vol. 34, No. 1, 15 17, 22. 9. Gutermn, J., A. A. Moreir, nd C. Peixeiro, Mirostrip frtl ntenns for multistndrd terminls, IEEE Antenns nd Wireless Propgtion Letters, Vol. 3, 351 354, 24. 1. Ginviffw, J. P. nd R.-S. Yhy, Frtl ntenns: A novel ntenn minituriztion tehnique nd pplitions, IEEE Antenns nd Propgtion Mgzine, Vol. 44, No. 1, 2 36, 22. 11. Rhim, M. K. A., N. Adullh, nd M. Z. A. Aziz, Mirostrip Sierpinski rpet ntenn design, 25 Asi-Pifi Conferene on Applied Eletromgnetis Proeedings, 58 61, 25. 12. Ooi, B.-L., A modified ontour integrl nlysis for Sierpinski frtl rpet ntenns with nd without eletromgneti nd gp ground plne, IEEE Trns. Antenns nd Propgtion, Vol. 52, No. 5, 1286 1293, 24.