## DefinitionEdit

Modified Bessel Functions are a special form of Bessel Functions, which were defined by Friedrich Bessel and Daniel Bernoulli as solutions, y(x), to Bessel's Differential Equation:

In this equation v is an unrestricted constant which can be real or complex, and defines the "order" of the function. A special case of the Bessel Function occurs when v is an integer. Like regular Bessel Functions, Modified Bessel Functions appear in various applications in physics and engineering, namely in dealing with stochastic processes such as noise in communication systems.

The nth Order Modified Bessel Function of the First Kind is defined as:

Modified Bessel Functions, unlike regular Bessel Functions which behave like decaying sines or cosines, are monotonically increasing or decreasing functions that are defined as 1 for x=0.

### DerivationEdit

The Modified Bessel Equation is derived by allowing the argument, x, to be purely imaginary. Thus, by letting x = ix, the equation becomes:
^{[1]}**:**

This differential equation is then solved by:

where is a Bessel Function of the First Kind, and is a Bessel Function of the Second Kind.

If v is not an integer, and by substituting , the Modified Bessel Function of the First Kind is defined as:

In the case where v is a positive integer, i.e. v=n, then the Modified Bessel Function of the First Kind of nth order can be defined as:

where, as with regular Bessel Functions, it can be shown that

and is defined as the Modified Bessel Function of the Second Kind, of nth order.

When evaluated for real positive values of x, the Modified Bessel Function of the First Kind can be defined as:

## Approximations for Modified Bessel Functions of the First KindEdit

In many applications, such as dealing with white nosie, it is important to be able to accurately evaluate Modified Bessel Function for various positive arguments, x. Two methods for efficient approximation of different ranges of x will be discussed in this article.

### Power Series ExpansionEdit

The Power Series Expansion for Modified Bessel Functions of the First Kind for an integer order, n is given by

The first terms of this sum can be used to accurately evaluate Modified Bessel Functions for an argument x. The more terms that are used, the more accurate the approximation.

This is an appropriate approximation for small values of x, but as the argument gets larger the numerator becomes significantly larger

#### Zero OrderEdit

Using the first five terms for the approximation gives:

##### ExampleEdit

Evaluating the five term approximation for for a small value, x=2, yields 2.279513889. The actual value of the function 2.279585302, which means there is a 0.007% error.

For x=5, this approximation gives 26.44640435, where the actual value is 27.23987182, an error of 2.9%. Adding one more term to the sum yields 27.1086782, and an error of 0.48%.

#### First OrderEdit

Once again using the first five terms for the approximation, this becomes:

##### Higher OrdersEdit

The Power Series expansion is an efficient way for approximating small values of x with a degree of error that can be minimized by adding more terms from the sum. This becomes impractical for large values of x as more terms are needed to keep the error within a tolerable range. Thus, this method should only be used for values of x less than or equal to 5.

### Asymptotic ExpansionEdit

In order to compute values of x larger than 5, the Modified Bessel Function of the First Kind is defined by its Asymptotic Expansion, as follows for zero and first order.

#### Zero OrderEdit

Using only the first five terms of the inner sum gives:

##### ExampleEdit

Evaluating the five term approximation for for x=20 gives 43,558,279. The value given in tables is 43,558,283, which gives an error of 0.0009%.

For x=100 this yields 1.07374171 x 10^42, which is the approximate value given in tables.

#### First OrderEdit

Using only the first five terms of the inner sum gives:

When x becomes very large (larger than 150), the approximation is simplified to:

#### Higher OrdersEdit

For any higher order Modified Bessel Functions, the general approximation given can be used so long as x is much, much greater than n.

More accurate calculation for any order of Modified Bessel Functions can be performed at High Precision Calculation of Modified Bessel Function

## Some ApplicationsEdit

There are many applications which require accurate computation of the Modified Bessel Function. Two of these applications are in Radar Detection Theory and Windowing in Digital Signal Processing.

### Radar Detection TheoryEdit

In Radar Detection Theory, the returned target signal is defined as v(t) = s(t) + n(t), where s(t) is the return signal from a target and n(t) is additive zero mean white Gaussian noise with variance . The function v(t) is defined as the output of an IF Band Pass Filter after being received by the antenna and passing through a low noise amplifier. This function is then passed through an envelope detector and a low pass filter which produces r(t), the envelope of v(t).
^{[2]}**:**

The probability density function of the random variables r(t) and (t), the random noise phase of v(t), is given by:

where A is the amplitude of the sine wave from the target return signal.

Then, dropping the phase dependence by integrating from 0 to 2pi over d, the function becomes:

where the integral on the right hand side is a zero-order Modified Bessel Function. Thus, f(r) can be rewritten as

which follows a Ricean probability density function for typical values of

If there is no target return signal, then the argument of the Modified Bessel Function is 0, which evaluates to 1, and the function simplifies to

Thus, in the absence of a target return signal, the probability density function follows a Rayleigh distribution.

When there is a strong target signal return, then is very large, and the Modified Bessel Function can be approximated by . After simplification, it is seen that when there is a strong target return the function follows a Gaussian probability density function.

### Kaiser WindowEdit

The **Kaiser window** is a one-parameter family of window functions used for Digital Signal Processing, and is defined by the formula

^{[3]}**:**

where:

*I*_{0}is the zeroth order Modified Bessel function of the first kind.- α is an arbitrary real number that determines the shape of the window;
- in the frequency domain, it determines the trade-off between main-lobe width and side lobe level, which is a central decision in window design.

*M*is an integer, and the length of the sequence is**N**=*M*+1.

When *N* is an odd number, the peak value of the window is *w*_{M/2} = 1. And when *N* is even, the peak values are *w*_{N/2-1} = *w*_{N/2} < 1.

This function requires accurate calculation of Modified Bessel Functions

## NotesEdit

- ↑ B. D. Brewster Geelen, Accurate solution for the modified Bessel function of the first kind. 4 November 1994; Revised 21 July 1995; accepted 21 July 1995. Available online 20 January 2000. http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V1P-3YCMV3H-C&_user=945462&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000048964&_version=1&_urlVersion=0&_userid=945462&md5=df95e1702680ef6e239b5486694f0aa0
- ↑ Bassem R. Mahafza, Radar Systems Analysis and Design Using MATLAB, IEEE Transactions on Acoustics, Chapman and Hall, 2nd Ed., February 2005, pp 145-148.
- ↑ James F. Kaiser and Ronald W. Schafer,
*On the Use of the Io-Sinh Window for Spectrum Analysis*, IEEE Transactions on Acoustics, Speech and Signal Processing, Vol. ASSP-28, No. 1, February 1980, pp 105-107.