Upper and lower bounds for the Rice Ie-function

Abstract

This work is devoted in the derivation of novel upper and lower bounds for the Rice Ie-function. These bounds are expressed in closed-form and are shown to be quite tight. This is particularly evident by the fact that for a certain range of parameter values, the derived lower bound virtually behaves as a remarkably accurate approximation. As a result, the offered expressions can be considered useful mathematical tools that can be efficiently employed in various analytical studies related to natural sciences and engineering. To this effect, they can be sufficiently applied in the area of digital communications over fading channels for the derivation of explicit representations for vital performance measures such as bit and symbol error probability, among others.