Cart (Loading....) | Create Account
Close category search window
 

Rapid evaluation of integer-order Bessel functions using an FFT algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nachamkin, J. ; OLAC, Edwards AFB, CA, USA ; Hoffman, D.C.

A rapid, accurate, and stable method for computing integer-order Bessel functions is presented. In contrast to the iterative procedures normally used in the numerical evaluation of Bessel functions, this approach requires little more than a commonly available fast Fourier transform algorithm, and yet, for a given argument, can provide many J/sub n/s in a single pass.<>

Published in:

Antennas and Propagation Magazine, IEEE  (Volume:33 ,  Issue: 6 )

Date of Publication:

Dec. 1991

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.