TY - GEN
T1 - A generalized algorithm for the generation of correlated rayleigh fading envelopes in radio channels
AU - Tran, Le Chung
AU - Wysocki, Tadeusz A.
AU - Seberry, Jennifer
AU - Mertins, Alfred
PY - 2005
Y1 - 2005
N2 - Although generation of correlated Rayleigh fading envelopes has been intensively considered in the literature, all conventional methods have their own shortcomings, which seriously impede their applicability. In this paper, a very general, straightforward algorithm for generation of an arbitrary number of Rayleigh envelopes with any desired, equal or unequal power, in wireless channels either with or without Doppler frequency shifts, is proposed. The proposed algorithm can be applied in case of spatial correlation, such as with antenna arrays in Multiple Input Multiple Output (MIMO) systems, or spectral correlation between the random processes like in Orthogonal Frequency Division Multiplexing (OFDM) systems. It can also be used for generating correlated Rayleigh fading envelopes in either discrete-time instants or a real-time scenario. Besides being more generalized, our proposed algorithm is more precise, while overcoming all shortcomings of the conventional methods.
AB - Although generation of correlated Rayleigh fading envelopes has been intensively considered in the literature, all conventional methods have their own shortcomings, which seriously impede their applicability. In this paper, a very general, straightforward algorithm for generation of an arbitrary number of Rayleigh envelopes with any desired, equal or unequal power, in wireless channels either with or without Doppler frequency shifts, is proposed. The proposed algorithm can be applied in case of spatial correlation, such as with antenna arrays in Multiple Input Multiple Output (MIMO) systems, or spectral correlation between the random processes like in Orthogonal Frequency Division Multiplexing (OFDM) systems. It can also be used for generating correlated Rayleigh fading envelopes in either discrete-time instants or a real-time scenario. Besides being more generalized, our proposed algorithm is more precise, while overcoming all shortcomings of the conventional methods.
UR - http://www.scopus.com/inward/record.url?scp=33746288418&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746288418&partnerID=8YFLogxK
U2 - 10.1109/IPDPS.2005.28
DO - 10.1109/IPDPS.2005.28
M3 - Conference contribution
AN - SCOPUS:33746288418
SN - 0769523129
SN - 0769523129
SN - 9780769523125
T3 - Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005
BT - Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005
T2 - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005
Y2 - 4 April 2005 through 8 April 2005
ER -