Tyck till om SwePub Sök
här!
Sökning: onr:"swepub:oai:DiVA.org:kth-28930" >
Rate-Maximizing Map...
Rate-Maximizing Mappings for Memoryless Relaying
-
- Zaidi, Ali Abbas (författare)
- KTH,Kommunikationsteori,ACCESS Linnaeus Centre
-
- Nasir Khormuji, Majid (författare)
- KTH,Kommunikationsteori,ACCESS Linnaeus Centre
-
- Yao, Sha (författare)
- KTH,Kommunikationsteori,ACCESS Linnaeus Centre
-
visa fler...
-
- Skoglund, Mikael (författare)
- KTH,Kommunikationsteori,ACCESS Linnaeus Centre
-
visa färre...
-
(creator_code:org_t)
- NEW YORK : IEEE, 2009
- 2009
- Engelska.
-
Ingår i: 2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY. - NEW YORK : IEEE. - 9781424443123 ; , s. 694-698
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We study the problem of optimal design of relay mappings for the Gaussian relay channel in order to maximize the reliable transmission rate. We consider both Gaussian and modulation constrained signaling at the source. To optimize the relay mapping, we use an iterative integral equation as a necessary condition for optimality. The optimized relay mappings demonstrate significant rate improvement over conventional linear relaying (amplify-and-forward). The optimized mappings allow an efficient utilization of the side information received via the source destination link at the destination. Hence, the proposed mappings can be considered as an analog, memoryless approach to implementing compress-and-forward relaying with Wyner-Ziv compression in the relay.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- CAPACITY THEOREMS
- NETWORKS
- CHANNEL
- Computer science
- Datalogi
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas