Chapter 6 Fractal antennas,分形天線_第1頁(yè)
Chapter 6 Fractal antennas,分形天線_第2頁(yè)
Chapter 6 Fractal antennas,分形天線_第3頁(yè)
Chapter 6 Fractal antennas,分形天線_第4頁(yè)
Chapter 6 Fractal antennas,分形天線_第5頁(yè)
已閱讀5頁(yè),還剩41頁(yè)未讀, 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡(jiǎn)介

1、Chapter 6 Fractal Antenna6.1 Fractal Theory The term fractal, which means broken or irregular fragments, was originally coined by Mandelbrot in 1973. Possess an inherent self-similarity or self-affinity in their geometrical structure. Fractal geometry is combined with electromagnetic theory for the

2、purpose of investigating a new class of radiation, propagation, and scattering problems. One of the most promising areas of fractal-electrodynamicsresearch is in its application to antenna theory and design.The Koch Fractal34Length1Length342LengthFirst iterationAfter2 iterations6.2 Fractal geometryA

3、fter 3 iterations343LengthAfter n iterations34nLength34LengthAfter iterations(work with me here, people)The Koch snowflake is six of these put together to form . . . . . well, a snowflake.Notice that the perimeter of the Koch snowflake is infinite . . . . . but that the area it bounds is finite (ind

4、eed, it iscontained in the white square).The Koch snowflake has even been used in technology:Boston - Mar 13, 2002Fractal Antenna Systems, Inc. today disclosed that it hasfiled for patent protection on a new class of antenna arraysthat use close-packed arrangements of fractal elements toget superior

5、 performance characteristics.Fractal Tiling Arrays - Firm Reports Breakthrough in Array AntennasCan you name the movie?Each of the six sides of the Koch snowflake isself-similar: If you take a small copy of it . . . . . then dilate by a factor of 3 . . . . . you get four copies of the original.But s

6、elf-similarity is not what makes the Koch snowflakea fractal! (Contrary to a common misconception.)After all, many common geometric objects exhibitself-similarity. Consider, for example, the humblesquare.If you take a small square . . . . . and dilate by a factor of 2 . . . . . then you get 4 copies

7、 of the original.A square is self-similar, but it most certainly is not a fractal.If you take a small square . . . . . and dilate by a factor of 3 . . . . . then you get 9 copies of the original.Let k be the scale factor.Let N be the number of copies of the original that you get.Note that for the sq

8、uare, we have that:2logNkNk2Or in other words, we have:Lets computeNklogfor some other shapes.Line segmentOriginalDilatedk = scale factor = 2N = number of copies of original = 21logNkTriangleOriginalDilatedk = scale factor = 2N = number of copies of original = 42logNkCubeOriginalDilatedk = scale fac

9、tor = 2N = number of copies of original = 83logNkShapeSquare2Line segment1Triangle2Cube3NklogWhat doesNklogtell us about a shape?Thats right:Nklogtells us the dimension of the shape.(Note that for this to make sense, the shape has to beself-similar.)So for a self-similar shape, we can takeNklogto be

10、 the definition of its dimension.(It turns out that this definition coincides with a much moregeneral definition of dimension called the fractal dimension.)Now lets recall what k and N were for one side of theKoch snowflake:k = scale factor = 3N = number of copies of original = 4.261. 14loglog3NkSo

11、each side of the Koch snowflake is approximately1.261-dimensional.Thats what makes the Koch snowflake a fractal the fact that its dimension is not an integer.Start with a square of side length 3, with a square of sidelength 1 removed from its center.perimeter = 4(3) + 4(1)area = 1322The Sierpinski F

12、ractalThe Sierpinski FractalThink of this shape as consisting of eight small squares, eachof side length 1.area = 31813222From each small square, remove its central square.perimeter =31481434perimeter =31483148143422area = 31831813222222Iterate.31831831813323222222area = 31483148314814343322perimete

13、r =Iterate.The Sierpinski carpet is whats left afteryoure finished removing everything.In other words, its the intersection of all the previous sets.31483148314814343322perimeter =038434nn.31831831813323222222area = .98989813322981312= 0So the Sierpinski carpet has an infinite perimeter butit bounds a region with an area of zero!WeirdYour turn: compute the fractal dimension of the Sierpinski carpet.89. 18log3The Minkowski FractalThe Triangle Sierpinski FractalThe Hilbert Fractal6.3 Fractal antennasThe Koch Fractal AntennaThe Triangle Sierpinski Fra

溫馨提示

  • 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

最新文檔

評(píng)論

0/150

提交評(píng)論