A generalization of the Rake receiver performance
Thierry Clessienne, Sheng Yang
Abstract
Thierry Clessienne, Sheng Yang
Abstract
We generalize the theoretical expression of the Rake receiver performance by considering arbitrary numbers of Rake fingers, the path correlation and the imperfections of the channel estimator (error and bias). Just like the terminal complexity and consumption, the performance of the terminal depends narrowly on the number of Rake fingers. Removing the channel estimation bias can considerably improve the Rake receiver performance when the paths are spaced by less than a one chip period. The study shows that, in the presence of path correlation, the perfect channel estimation does not give necessarily the best performance.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We generalize the theoretical expression of the Rake receiver performance by considering arbitrary numbers of Rake fingers, the path correlation and the imperfections of the channel estimator (error and bias). Just like the terminal complexity and consumption, the performance of the terminal depends narrowly on the number of Rake fingers. Removing the channel estimation bias can considerably improve the Rake receiver performance when the paths are spaced by less than a one chip period. The study shows that, in the presence of path correlation, the perfect channel estimation does not give necessarily the best performance.
Key concepts: Rake, Rake receiver, Estimator, Channel (broadcasting), Computer science, Path (computing), Algorithm, Terminal (telecommunication)