The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Optimal channel estimation and training design for two-way relay networks
Abstract
In this work, we consider the two-way relay network (TWRN) where two terminals exchange their information through a relay node in a bi-directional manner and study the training-based channel estimation under the amplify-and-forward (AF) relay scheme. We propose a two-phase training protocol for channel estimation: in the first phase, the two terminals send their training signals concurrently to the relay; and in the second phase, the relay amplifies the received signal and broadcasts it to both terminals. Each terminal then estimates the channel parameters required for data detection. First, we assume the channel parameters to be deterministic and derive the maximum-likelihood (ML) -based estimator. It is seen that the newly derived ML estimator is nonlinear and differs from the conventional least-square (LS) estimator. Due to the difficulty in obtaining a closed-form expression of the mean square error (MSE) for the ML estimator, we resort to the Crameacuter-Rao lower bound (CRLB) on the estimation MSE for design of optimal training sequence. Secondly, we consider stochastic channels and focus on the class of linear estimators. In contrast to the conventional linear minimum-mean-square-error (LMMSE) -based estimator, we introduce a new type of estimator that aims at maximizing the effective receive signal-to-noise ratio (SNR) after taking into consideration the channel estimation errors, thus referred to as the linear maximum SNR (LMSNR) estimator. Furthermore, we prove that orthogonal training design is optimal for both the CRLB- and the LMSNR-based design criteria. Finally, simulations are conducted to corroborate the proposed studies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838089 · Cited by 12,193
Capacity theorems for the relay channel
Cover, T., & Gamal, A. E. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056084 · Cited by 4,123
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
Laneman, J. N., & Wornell, G. W. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817829 · Cited by 4,002
Hot topic: physical-layer network coding
Zhang, S., Liew, S. C., & Lam, P. P. (2006) · Proceedings of the 12th annual international conference on Mobile computing and networking · doi:10.1145/1161089.1161129 · Cited by 1,512
Embracing wireless interference: analog network coding
Katti, S., Gollakota, S., & Katabi, D. (2007) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1282380.1282425 · Cited by 1,253
Training-based MIMO channel estimation: a study of estimator tradeoffs and optimal training signals
Biguesh, M., & Gershman, A. B. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.863008 · Cited by 1,074
Performance Bounds for Bidirectional Coded Cooperation Protocols
Kim, S. J., Mitran, P., & Tarokh, V. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929913 · Cited by 446
Cited by
Physical-layer network coding: Tutorial, survey, and beyond
Liew, S. C., Zhang, S., & Lu, L. (2013) · Physical Communication · doi:10.1016/j.phycom.2012.05.002 · Cited by 329
Metadata
- Authors
- Gao, F., Zhang, R., & Liang, Y.-C.
- Venue
- IEEE Transactions on Communications
- Published
- 2009-10
- Volume
- 57
- Issue
- 10
- Pages
- 3024-3033
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2143365251
- Cited by
- 312
- References
- 8
- FWCI
- 34.84
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.