Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Improving Collaborative Transmit Diversity by Using Constellation Rearrangement
KTH, School of Electrical Engineering (EES), Communication Theory.
KTH, School of Electrical Engineering (EES), Communication Theory.
2007 (English)In: IEEE Wireless Communications and Networking Conference, WCNC, 2007, 804-808 p.Conference paper, Published paper (Refereed)
Abstract [en]

We propose an enhancement to cooperative transmit diversity based on uncoded detect-and-forward, by using so-called constellation rearrangement (CR) at the relay. With CR, the relay uses a bit-symbol mapping that is different from the one used by the source. We find the optimal bit-symbol mappings for both the source and the relay and the associated optimal detectors, and show that the improvement over conventional relaying with Gray mapping at the source and the relay can amount to a power gain of several dB. This performance improvement comes at no additional power or bandwidth expense, and at virtually no increase in complexity.

Place, publisher, year, edition, pages
2007. 804-808 p.
Series
IEEE Wireless Communications and Networking Conference, ISSN 1525-3511
Keyword [en]
Bandwidth, Diversity reception, Signal detection, Telecommunication systems, Collaborative transmit diversity, Constellation rearrangement, Optimal bit-symbol mappings, Optimal detectors
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-8302DOI: 10.1109/WCNC.2007.153ISI: 000252337101059Scopus ID: 2-s2.0-36349018202ISBN: 1424406595 (print)ISBN: 978-142440659-3 OAI: oai:DiVA.org:kth-8302DiVA: diva2:13587
Conference
2007 IEEE Wireless Communications and Networking Conference, WCNC 2007; Kowloon; China; 11 March 2007 through 15 March 2007
Note

Conference: IEEE Wireless Communications and Networking Conference. Hong Kong, PEOPLES R CHINA. MAR 11-15, 2007

Available from: 2008-04-30 Created: 2008-04-30 Last updated: 2015-07-15Bibliographically approved
In thesis
1. Relaying Protocols for Wireless Networks
Open this publication in new window or tab >>Relaying Protocols for Wireless Networks
2008 (English)Licentiate thesis, comprehensive summary (Other scientific)
Abstract [en]

Motivated by current applications in multihop transmission and ad hoc networks, the classical three-node relay channel consisting of a source-destination pair and a relay has received significant attention. One of the crucial aspects of the relay channel is the design of proper relaying protocols, i.e., how the relay should take part into transmission. The thesis addresses this problem and provides a partial answer to that.

In this thesis, we propose and study two novel relaying protocols. The first one is based on constellation rearrangement (CR) and is suitable for higher-order modulation schemes. With CR, the relay uses a bit-symbol mapping that is different from the one used by the source. We find the optimal bit-symbol mappings for both the source and the relay and the associated optimal detectors, and show that the improvement over conventional relaying with Gray mapping at the source and the relay can amount to a power gain of several dB. This performance improvement comes at no additional power or bandwidth expense, and at virtually no increase in complexity. The second one is a half-duplex decode-and-forward (DF) relaying scheme based on partial repetition (PR) coding at the relay. With PR, if the relay decodes the received message successfully, it re-encodes the message using the same channel code as the one used at the source, but retransmits only a fraction of the codeword. We analyze the proposed scheme and optimize the cooperation level (i.e., the fraction of the message that the relay should transmit). We compare our scheme with conventional repetition in which the relay retransmits the entire decoded message, and with parallel coding, and additionally with dynamic DF. The finite SNR analysis reveals that the proposed partial repetition can provide a gain of several dB over conventional repetition. Surprisingly, the proposed scheme is able to achieve the same performance as that of parallel coding for some relay network configurations, but at a much lower complexity.

Additionally, the thesis treats the problem of resource allocation for collaborative transmit diversity using DF protocols with different type of CSI feedback at the source. One interesting observation that emerges is that the joint powerbandwidth allocation only provides marginal gain over the relaying protocols with optimal bandwidth allocation.

Place, publisher, year, edition, pages
Stockholm: KTH, 2008. vii, 13 p.
Series
Trita-EE, ISSN 1653-5146 ; 2008:019
Keyword
The relay channel, constellation rearrangement, decode-and-forward, resource allocation
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-4716 (URN)
Presentation
2008-05-16, Q21, Q, Osquldas väg 6, KTH, Stockholm, Sweden, 13:15
Opponent
Supervisors
Note
QC 20101119Available from: 2008-04-30 Created: 2008-04-30 Last updated: 2010-11-19Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Nasiri Khormuji, MajidLarsson, Erik G.
By organisation
Communication Theory
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 55 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf