Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme
| Autor: | Sheng Yang, Jean-Claude Belfiore |
|---|---|
| Přispěvatelé: | Laboratoire Traitement et Communication de l'Information (LTCI), Télécom ParisTech-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), Laboratoire des signaux et systèmes (L2S), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Yang, Sheng |
| Jazyk: | angličtina |
| Rok vydání: | 2006 |
| Předmět: |
FOS: Computer and information sciences
Computer science Computer Science - Information Theory MIMO Cooperative diversity 02 engineering and technology Library and Information Sciences Topology relay Upper and lower bounds Multiplexing law.invention symbols.namesake Relay law 0202 electrical engineering electronic engineering information engineering ComputingMilieux_MISCELLANEOUS Computer Science::Information Theory H.1.1 relay scheduling diversity-multiplexing tradeoff (DMT) [STIC]domain_stic business.industry Information Theory (cs.IT) [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT] 020206 networking & telecommunications [STIC] domain_stic Computer Science Applications Transmit diversity Additive white Gaussian noise Diversity gain ACM H.1.1 symbols 020201 artificial intelligence & image processing slotted amplify-and-forward (SAF) business Decoding methods Information Systems Computer network Communication channel |
| Zdroj: | IEEE Transactions on Information Theory IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2007 |
| ISSN: | 0018-9448 |
| Popis: | In a slow fading channel, how to find a cooperative diversity scheme that achieves the transmit diversity bound is still an open problem. In fact, all previously proposed amplify-and-forward (AF) and decode-and-forward (DF) schemes do not improve with the number of relays in terms of the diversity multiplexing tradeoff (DMT) for multiplexing gains r higher than 0.5. In this work, we study the class of slotted amplify-and-forward (SAF) schemes. We first establish an upper bound on the DMT for any SAF scheme with an arbitrary number of relays N and number of slots M. Then, we propose a sequential SAF scheme that can exploit the potential diversity gain in the high multiplexing gain regime. More precisely, in certain conditions, the sequential SAF scheme achieves the proposed DMT upper bound which tends to the transmit diversity bound when M goes to infinity. In particular, for the two-relay case, the three-slot sequential SAF scheme achieves the proposed upper bound and outperforms the two-relay non-orthorgonal amplify-and-forward (NAF) scheme of Azarian et al. for multiplexing gains r < 2/3. Numerical results reveal a significant gain of our scheme over the previously proposed AF schemes, especially in high spectral efficiency and large network size regime. 30 pages, 11 figures, submitted to IEEE trans. IT, revised version |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|