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
On distributed coding for relay channels
KTH, School of Electrical Engineering (EES), Communication Theory. (Communication Theory)
2010 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Cooperative transmission is considered to be a key-technique for increasing the robustness, the efficiency, or the coverage of wireless communication networks. The basic concept is that the information transmission from a sender to a receiver can be aided by one or several relay nodes in a cooperative manner under constraints on power, complexity or delay.

The main part of this thesis is devoted to studies on practical realizations of cooperative communication systems. Coding solutions that implement the decode-and-forward protocol in three-node relay channels are proposed by employing convolutional and Turbo codes. Distributed Turbo coding (DTC) was the first technique to bring parallel code concatenation into relay networks. To complement the research on parallel concatenated codes, we propose distributed serially concatenated codes (DSCCs) which provide a better error-floor performance and an increased robustness compared with DTCs. Thereafter, we present a flexible distributed code design which can be adapted to the channel conditions in a simple way. For both the cases with perfect and limited channel-state information, the adaptive coding scheme outperforms static codes, like DTCs and DSCCs, in terms of transmission rate and application range.

The aforementioned implementations of relaying are based on blockwise decoding and re-encoding at the relay. In some applications, however, these techniques are not feasible due to limited processing and storage capabilities of the relay nodes. Therefore, we propose to combine instantaneous relaying strategies with bit-interleaved coded modulation. A significant gain can be obtained by using sawtooth and constellation rearrangement relaying with optimized bit-to-symbol mappings compared with conventional instantaneous relaying strategies and compared with standard mappings optimized for point-to-point communications. Both the parameters of the instantaneous relaying schemes and the bit-to-symbol mappings are optimized to maximize mutual information.

Place, publisher, year, edition, pages
Stockholm: KTH , 2010. , ix, 113 p.
Series
Trita-EE, ISSN 1653-5146 ; 2010:026
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-12967ISBN: 978-91-7415-678-2 (print)OAI: oai:DiVA.org:kth-12967DiVA: diva2:319926
Presentation
2010-06-10, Q21, Osquldas väg 6B, KTH, Stockholm, 13:00 (English)
Opponent
Supervisors
Note
QC20100607Available from: 2010-06-07 Created: 2010-05-20 Last updated: 2010-06-07Bibliographically approved

Open Access in DiVA

fulltext(1020 kB)572 downloads
File information
File name FULLTEXT01.pdfFile size 1020 kBChecksum SHA-512
f613ca48019f6bef8f80f709b462ccc219ae08a12b2a9638fa5d279c42d0ce7dba45049ead0cd8b6f6b570d75c04a08c4f7924f08327026b201174561a4959f3
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Si, Zhongwei
By organisation
Communication Theory
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 572 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 242 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