File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/8.52269
- Scopus: eid_2-s2.0-0025419127
- WOS: WOS:A1990CZ50800010
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Recursive algorithms for calculating the scattering from N strips or patches
Title | Recursive algorithms for calculating the scattering from N strips or patches |
---|---|
Authors | |
Issue Date | 1990 |
Citation | Ieee Transactions On Antennas And Propagation, 1990, v. 38 n. 4, p. 507-515 How to Cite? |
Abstract | Using the definition of recursive relations for the reflection operator for N strips or patches, two easily programmable recursive algorithms are developed to calculate the scattering by N strips or patches. One algorithm is for arbitrary excitation, and the other is for a fixed excitation. The recursive algorithms require the inversion of small matrices at each stage and hence are suitable for programming on smaller computers. If the N strips or patches are identical and equally spaced, symmetry can be exploited to speed up the algorithms. A program was developed to calculate scattering by N strips, and the result is shown to converge to scattering by a large strip when the N strips are contiguous. |
Persistent Identifier | http://hdl.handle.net/10722/182499 |
ISSN | 2023 Impact Factor: 4.6 2023 SCImago Journal Rankings: 1.794 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gurel, Levent | en_US |
dc.contributor.author | Chew, Weng Cho | en_US |
dc.date.accessioned | 2013-05-02T05:15:37Z | - |
dc.date.available | 2013-05-02T05:15:37Z | - |
dc.date.issued | 1990 | en_US |
dc.identifier.citation | Ieee Transactions On Antennas And Propagation, 1990, v. 38 n. 4, p. 507-515 | en_US |
dc.identifier.issn | 0018-926X | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/182499 | - |
dc.description.abstract | Using the definition of recursive relations for the reflection operator for N strips or patches, two easily programmable recursive algorithms are developed to calculate the scattering by N strips or patches. One algorithm is for arbitrary excitation, and the other is for a fixed excitation. The recursive algorithms require the inversion of small matrices at each stage and hence are suitable for programming on smaller computers. If the N strips or patches are identical and equally spaced, symmetry can be exploited to speed up the algorithms. A program was developed to calculate scattering by N strips, and the result is shown to converge to scattering by a large strip when the N strips are contiguous. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | IEEE Transactions on Antennas and Propagation | en_US |
dc.title | Recursive algorithms for calculating the scattering from N strips or patches | en_US |
dc.type | Article | en_US |
dc.identifier.email | Chew, Weng Cho: wcchew@hku.hk | en_US |
dc.identifier.authority | Chew, Weng Cho=rp00656 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1109/8.52269 | en_US |
dc.identifier.scopus | eid_2-s2.0-0025419127 | en_US |
dc.identifier.volume | 38 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.spage | 507 | en_US |
dc.identifier.epage | 515 | en_US |
dc.identifier.isi | WOS:A1990CZ50800010 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Gurel, Levent=7004393069 | en_US |
dc.identifier.scopusauthorid | Chew, Weng Cho=36014436300 | en_US |
dc.identifier.issnl | 0018-926X | - |