Rights statement: © 2008 The Author(s). This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Final published version, 747 KB, PDF document
Available under license: CC BY
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Article number | 471327 |
---|---|
<mark>Journal publication date</mark> | 2008 |
<mark>Journal</mark> | EURASIP Journal on Advances in Signal Processing |
Volume | 2008 |
Number of pages | 9 |
Publication Status | Published |
<mark>Original language</mark> | English |
This paper investigates the effects of channel estimation error at the receiver on the achievable rate of distributed space-time block coded transmission. We consider that multiple transmitters cooperate to send the signal to the receiver and derive lower and upper bounds on the mutual information of distributed space- time block codes ( D-STBCs) when the channel gains and channel estimation error variances pertaining to different transmitter-receiver links are unequal. Then, assessing the gap between these two bounds, we provide a limiting value that upper bounds the latter at any input transmit powers, and also show that the gap is minimum if the receiver can estimate the channels of different transmitters with the same accuracy. We further investigate positioning the receiving node such that the mutual information bounds of D-STBCs and their robustness to the variations of the subchannel gains are maximum, as long as the summation of these gains is constant. Furthermore, we derive the optimum power transmission strategy to achieve the outage capacity lower bound of D-STBCs under arbitrary numbers of transmit and receive antennas, and provide closed-form expressions for this capacity metric. Numerical simulations are conducted to corroborate our analysis and quantify the effects of imperfect channel estimation.
Copyright (c) 2008 L. Musavian and S. Aissa.