DocumentCode
1132308
Title
Comments ´´Rapid evaluation of integer-order Bessel functions using an FFT algorithm´´ (and reply)
Author
Miller, E.K. ; Nachamkin, J.
Author_Institution
Los Alamos Nat. Lab., NM, USA
Volume
34
Issue
2
fYear
1992
fDate
4/1/1992 12:00:00 AM
Firstpage
65
Lastpage
66
Abstract
The commenter disagrees with a statement by J. Nachamkin and D.C. Hoffman (see ibid., vol.33, no.6, p.33-5, Dec. 1991) that complicated procedures are needed to find the initial terms in the recursion relation when backward-recursion techniques are used, and points out that the initial terms required to start backward recursion need not be calculated at J. Nachamkin agrees that in many cases using recursions is better than all the other methods.<>
Keywords
Bessel functions; fast Fourier transforms; FFT algorithm; backward recursion; integer-order Bessel functions; recursion relation;
fLanguage
English
Journal_Title
Antennas and Propagation Magazine, IEEE
Publisher
ieee
ISSN
1045-9243
Type
jour
DOI
10.1109/74.134322
Filename
134322
Link To Document