DocumentCode :
766751
Title :
M/M/1 Transient State Occupancy Probabilities Via the Discrete Fourier Transform
Author :
Ackroyd, Martin H.
Author_Institution :
Univ. of Aston in Birmingham, Birmingham, England
Volume :
30
Issue :
3
fYear :
1982
fDate :
3/1/1982 12:00:00 AM
Firstpage :
557
Lastpage :
559
Abstract :
A procedure is given for the computation of the transient state occupancy probabilities of the 
queue. The method makes use of the inverse discrete Fourier transform, computed by means of the fast Fourier transform. It avoids the direct evaluation of modified Bessel functions and sidesteps difficulties due to the computation of very large and very small intermediate quantities.
queue. The method makes use of the inverse discrete Fourier transform, computed by means of the fast Fourier transform. It avoids the direct evaluation of modified Bessel functions and sidesteps difficulties due to the computation of very large and very small intermediate quantities.Keywords :
DFT; Discrete Fourier transforms (DFT´s); Queuing analysis; Store-and-forward switching; Amplitude modulation; Communication systems; Data communication; Discrete Fourier transforms; Diversity reception; Equalizers; Error analysis; Jacobian matrices; Mobile communication; Rayleigh channels;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOM.1982.1095480
Filename :
1095480
Link To Document :
