## Abstract The problem of rapid far‐field computation from near‐field samples acquired on a plane‐polar geometry is addressed in this paper. A fast processing algorithm is developed which uses the fast Fourier transform and the related shift theorem, by exploiting the convolution property of the r
✦ LIBER ✦
A plane-polar near-field to far-field transformation with the fast Hankel transform method
✍ Scribed by Chen CAO; Emmanuel Van Lil; Antoine Van De Capelle; Kees Van ’t Klooster
- Book ID
- 112969204
- Publisher
- Springer-Verlag
- Year
- 1991
- Tongue
- English
- Weight
- 787 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0003-4347
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Efficient near-field to far-field transf
✍
Sandra Costanzo; Giuseppe Di Massa
📂
Article
📅
2006
🏛
John Wiley and Sons
🌐
English
⚖ 242 KB
Fast and accurate near-field-far-field t
✍
Bucci, O.M.; Gennarelli, C.; Savarese, C.
📂
Article
📅
1991
🏛
IEEE
🌐
English
⚖ 770 KB
Near-field-far-field transformation from
✍
Bucci, O.M.; Gennarelli, C.; Riccio, G.; Savarese, C.
📂
Article
📅
1998
🏛
The Institution of Electrical Engineers
🌐
English
⚖ 739 KB
The bi-polar planar near-field measureme
✍
R. Yaccarino; Y. Rahmat-samii; L. Williams
📂
Article
📅
1994
🏛
IEEE
🌐
English
⚖ 993 KB
Modification to time domain near-field t
✍
Giannopoulos, A.; Randhawa, B.S.; Tealby, J.M.; Marvin, A.C.
📂
Article
📅
1997
🏛
The Institution of Electrical Engineers
🌐
English
⚖ 287 KB
Reduced-rank approximations to the far-f
✍
Andrew J. Hesford; Robert C. Waag
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 760 KB
The fast multipole method (FMM) has been shown to have a reduced computational dependence on the size of finest-level groups of elements when the elements are positioned on a regular grid and FFT convolution is used to represent neighboring interactions. However, transformations between plane-wave e