File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fast Algorithm for Scattering from Planar Arrays of Conducting Patches

TitleFast Algorithm for Scattering from Planar Arrays of Conducting Patches
Authors
KeywordsAlgorithms
Antenna Arrays
Frequency Selective Surface
Scattering
Issue Date1998
Citation
Ieee Microwave And Guided Wave Letters, 1998, v. 8 n. 4, p. 155-157 How to Cite?
AbstractA direct (noniterative) algorithm for the solution of the electromagnetic scattering from three-dimensional planar arrays of conducting patches is developed. For an N-unknown problem, the computational complexity of this new solution technique is shown to be O(N2 log2N), which is considerably lower than the O(N3) computational complexity of the conventional direct solution techniques. The advantages of the reduction in the computational complexity is pronounced in the solution of large electromagnetics problems, such as scattering from large and finite arrays of patches, synthesis and analysis of finite-sized frequency selective surfaces (FSS's), and radiation and scattering from large phased-array antennas, to name a few.
Persistent Identifierhttp://hdl.handle.net/10722/182593
ISSN
2002 Impact Factor: 1.746
References

 

DC FieldValueLanguage
dc.contributor.authorGürel, Len_US
dc.contributor.authorChew, WCen_US
dc.date.accessioned2013-05-02T05:16:01Z-
dc.date.available2013-05-02T05:16:01Z-
dc.date.issued1998en_US
dc.identifier.citationIeee Microwave And Guided Wave Letters, 1998, v. 8 n. 4, p. 155-157en_US
dc.identifier.issn1051-8207en_US
dc.identifier.urihttp://hdl.handle.net/10722/182593-
dc.description.abstractA direct (noniterative) algorithm for the solution of the electromagnetic scattering from three-dimensional planar arrays of conducting patches is developed. For an N-unknown problem, the computational complexity of this new solution technique is shown to be O(N2 log2N), which is considerably lower than the O(N3) computational complexity of the conventional direct solution techniques. The advantages of the reduction in the computational complexity is pronounced in the solution of large electromagnetics problems, such as scattering from large and finite arrays of patches, synthesis and analysis of finite-sized frequency selective surfaces (FSS's), and radiation and scattering from large phased-array antennas, to name a few.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Microwave and Guided Wave Lettersen_US
dc.subjectAlgorithmsen_US
dc.subjectAntenna Arraysen_US
dc.subjectFrequency Selective Surfaceen_US
dc.subjectScatteringen_US
dc.titleFast Algorithm for Scattering from Planar Arrays of Conducting Patchesen_US
dc.typeArticleen_US
dc.identifier.emailChew, WC: wcchew@hku.hken_US
dc.identifier.authorityChew, WC=rp00656en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0032038583en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0032038583&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume8en_US
dc.identifier.issue4en_US
dc.identifier.spage155en_US
dc.identifier.epage157en_US
dc.identifier.scopusauthoridGürel, L=7004393069en_US
dc.identifier.scopusauthoridChew, WC=36014436300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats