Abstract
We consider the achievable rate for frequency-selective fading channels when the channel state information (CSI) is to be estimated at the receiver. Since the estimated CSI is not perfect, the achievable rate must be degraded from that with perfect CSI. Using the rate-distortion theory, we study an upper bound on the achievable rate and investigate how the achievable rate can be maximized through an optimization problem by allocating the resources such as degrees of freedom (the transmission time in our work or transmission power) for the exploration of CSI (i.e., the channel estimation) using pilot symbols, and the exploitation of channels to transmit data symbols. Although our study is based on some ideal assumptions, the results could help develop flexible communication systems such as software defined radio (SDR) to achieve a best performance by optimizing radio resources for unknown channels.
Similar content being viewed by others
Notes
Although the results from the rate-distortion theory are upper bounds, for simplicity, we will call them rate or achievable rate hereafter.
This practical implementation issue is not addressed in this paper and will be studied as a further issue in the future.
Some of assumptions are not realistic, but we use them as they allow us to derive a closed-form expression.
References
Cavers, J. K. (1991). An analysis of pilot symbol assisted modulation for Rayleigh fading channels. IEEE Transactions on Vehicular Technology, 40, 686–693.
Ohno, S., & Giannakis, G. B. (2004). Capacity maximizing MMSE-optimal pilots for wireless OFDM over frequency-selective block Rayleigh-fading channels. IEEE Transactions on Information Theory, 50, 2138–2145.
Dong, M., & Tong, L. (2004). Optimal insertion of pilot symbols for transmissions over time-varying flat fading channels. IEEE Transactions on Signal Processing, 52(5), 1403–1418.
Hadaschik, N., Ascheid, G., & Meyr, H. (2006). Achievable data rate of wideband OFDM with data-aided channel estimation. In Proc. IEEE PIMRC (pp. 1–5).
Agarwal, M., & Honig, M. L. (2005). Wideband fading channel capacity with training and partial feedback. In Proc. Allerton conf.
Hassibi, B., & Hochwald, B. M. (2003). How much training is needed in multiple-antenna wireless links? IEEE Transactions on Information Theory, 49, 951–963.
Mitola, J. III (2000). Software radio architecture. New York: Wiley.
Medard, M. (2000). The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel. IEEE Transactions on Information Theory, 46, 933–946.
Georghiades, C. N., & Han, J. C. (1997). Sequence estimation in the presence of random parameters via the EM algorithm. IEEE Transactions on Communications, 45, 300–308.
Zamiri-Jafarian, H., & Pasupathy, S. (1999). EM-based recursive estimation of channel parameters. IEEE Transactions on Communications, 47, 1297–1302.
Choi, J. (2008). An EM based joint data detection and channel estimation incorporating with initial channel estimate. IEEE Communication Letters, 12, 654–656.
Choi, J. (2006). MIMO-BICM iterative receiver with the EM based channel estimation and simplified MMSE combining with soft cancellation. IEEE Transactions on Signal Processing, 54, 3247–3251.
Khalighi, M. A., & Boutros, J. J. (2006). Semi-blind channel estimation using the EM algorithm in iterative MIMO APP detectors. IEEE Transactions on Wireless Communications, 5(11), 3165–3173.
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 39, 1–38.
Choi, J. (2006). Adaptive and iterative signal processing in communications. Cambridge University Press.
Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. New York: Wiley.
Borkar, W. S. (2008). Stochastic approximation: a dynamic systems viewpoint. Cambridge University Press.
Alouini, M.-S., & Goldsmith, A. J. (1999). Capacity of Rayleigh fading channels under different adaptive transmission and diversity-combining techniques. IEEE Transactions on Vehicular Technology, 48, 1165–1181.
Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge University Press.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by HY-SDR Research Center at Hanyang University, Seoul, Korea, under the ITRC Program of MIC, Korea.
Appendices
Appendix A: Proof of Theorem 4
The second order derivative of \({{\cal K}}(\alpha)\) is given by
From this, we can see that if the following two conditions hold:
-
(i)
\(\psi(\bar \gamma(\alpha))\) is nondecreasing;
-
(ii)
\(\psi(\bar \gamma(\alpha))\) is concave,
then \({{\cal K}}(\alpha)\) is concave or \(\frac{d^2 {{\cal K}}(\alpha)}{d \alpha^2} < 0\).
For the first condition, we need the following two results.
Lemma 2
\(I_{\rm erg,d} (D) = \psi(\bar \gamma(D))\) is decreasing on the interval D ∈ [0, 1].
Proof
We can show that \(\bar \gamma(D)\) is decreasing on D ∈ [0, 1]. Since ψ(x) is increasing, \(I_{\rm erg,d} (D) = \psi(\bar \gamma(D))\) is decreasing. □
Lemma 3
If γ a ≫ 1, D *(α) is nonincreasing on the interval α ∈ (0, 1).
Proof
If γ a ≫ 1, D *(α) in Eq. 37 becomes
After some manipulations, we can show that \(\frac{d}{d \alpha} \bar D^*(\alpha) \le 0\), α ∈ (0,1). □
From Lemmas 2 and 3, the first condition is satisfied if γ a ≫ 1.
The following results are crucial to verify the second condition.
Lemma 4
\(\psi(x) = E[\log (1+ x |h_l|^2)]\) is concave and nondecreasing.
Proof
Since log(x) is concave and a sum of concave functions are also concave [19], we can conlcude that \(\psi(x) = E[\log (1+ x |h_l|^2)]\) is concave. Furthermore, since log(1 + x) is nondecreasing, ψ(x) is also nondecreasing. □
From Eq. 29, we have the following relation:
Lemma 5
If \(\bar \gamma(\alpha)\) is concave, \(\psi(\bar \gamma(\alpha))\) is concave.
Proof
According to [19], a composite function h(f(x)) is concave if h(x) is concave and nondecreasing and f(x) is concave. We can show that \(\psi(\bar \gamma(\alpha)) = E[\log (1+ \bar \gamma(\alpha) |h_l|^2)]\) is concave because (1) ψ(x) is concave and nondecreasing from Lemma 4 and (2) \(\bar \gamma(\alpha)\) is assumed to be concave. □
From Lemma 5, we now see that the second condition is satisfied if \(\bar \gamma(\alpha)\) is concave.
For a high γ a, we have
After some manipulations, we can show that \(\frac{d^2}{d \alpha^2} v(\alpha) \le 0\). This confirms that \(\bar \gamma(\alpha)\) is concave when γ a ≫ 1. This completes the proof.
Appendix B: Proof of Theorem 5
From Theorem 4, it is known that \({{\cal K}}(\alpha)\) is concave for γ a ≫ 1. This implies that α * is the solution of the following equation:
As x increases, we can approximate ψ(x) as
where \(C = E[\log|h_l|^2]\) is a constant. This allows a high SNR approximation of \({{\cal K}}(\alpha)\) as follows:
The second approximate results from Eq. 54. For convenience, logarithms are taken to the base e. Taking the derivate with respect to α, we have
As γ a increases, α decreases and \(\frac{1}{2 \alpha}\) becomes dominant. Thus, for a high SNR, the solution of Eq. 55 approaches
Appendix C: Proof of Theorem 6
From Eq. 56, we have
From Eq. 54, consider the Taylor series of v(α) at 0 as follows:
Since α * approaches 0 as γ a increases, from Eq. 58, we have
Thus,
where \(C_1 = \frac{\log e}{2}\). Substituting Eq. 60 into Eq. 59, we have
Rights and permissions
About this article
Cite this article
Choi, J., Ha, J. On the Achievable Rate for Wideband Channels with Estimated CSI. J Sign Process Syst 66, 75–86 (2012). https://doi.org/10.1007/s11265-010-0520-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11265-010-0520-7