- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- The computation of the block-error rate on a Rayleigh-fading...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
The computation of the block-error rate on a Rayleigh-fading channel in the presence of additive white Gaussian noise Maranda, Brian Howard
Abstract
The problem of computing the probability P[sub f](M,N) of more than M bit errors in a block of N bits for a Rayleigh-fading channel in the presence of additive white Gaussian noise is considered. In the case of very slow Rayleigh fading, analytical formulas for P[sub f](M,N) have been derived in the literature, but these formulas are not well suited for numerical computation. Several simple approximations for the special case P[sub f](O,N) have also appeared in the literature, but apparently no work has been done for the case M > 0. In this thesis an accurate approximation for P[sub f](M,N) is derived, and a bound on the error in this approximation is given. Also included are approximations for P[sub f](M,N) when selection diversity is employed. If very slow fading is not assumed, there exist no known analytical methods for the computation of the block-error probability. Simulations are performed on a digital computer for this case. Furthermore, an empirical formula is derived that can be used to estimate easily and accurately the output of the simulator. The consequence is a great saving of time and effort in the computation of a value of P[sub f](M,N) that is more realistic than that provided under the assumption of very slow fading.
Item Metadata
Title |
The computation of the block-error rate on a Rayleigh-fading channel in the presence of additive white Gaussian noise
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
1982
|
Description |
The problem of computing the probability P[sub f](M,N) of more than M bit errors in a block of N bits for a Rayleigh-fading channel in the presence of additive white Gaussian noise is considered. In the case of very slow Rayleigh fading, analytical formulas for P[sub f](M,N) have been derived in the literature, but these formulas are not well suited for numerical computation. Several simple approximations for the special case P[sub f](O,N) have also appeared in the literature, but apparently no work has been done for the case M > 0. In this thesis an accurate approximation for P[sub f](M,N) is derived, and a bound on the error in this approximation is given. Also included are approximations for P[sub f](M,N) when selection diversity is employed. If very slow fading is not assumed, there exist no known analytical methods for the computation of the block-error probability. Simulations are performed on a digital computer for this case. Furthermore, an empirical formula is derived that can be used to estimate easily and accurately the output of the simulator. The consequence is a great saving of time and effort in the computation of a value of P[sub f](M,N) that is more realistic than that provided under the assumption of very slow fading.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2010-04-22
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0095826
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.