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
Bidirectional broadcasting by using multi-edge type LDPC convolutional codes
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9307-484X
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-0036-9049
2012 (English)In: Turbo Codes and Iterative Information Processing (ISTC), 2012 7th International Symposium on, IEEE conference proceedings, 2012, 91-95 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we propose multi-edge type (MET) LDPC convolutional codes for the bidirectional broadcast channel with common message (BBC-CM). It describes a two-user broadcast channel in which different subsets of the broadcasted messages are a priori known at the receivers. This situation occurs, e.g., in the second transmission phase of a bidirectional relaying protocol. In the proposed scheme, the transmitter broadcasts codewords of an MET LDPC convolutional code. Each user tries then to recover the unknown messages by decoding a two-edge type code which is embedded in the MET code. We prove for each user that the two-edge type LDPC convolutional code has the same properties as a standard LDPC convolutional code, and therefore it is capacity achieving for the binary erasure channel (BEC) and the general binary memoryless symmetric (BMS) channel. Meanwhile, we show that the capacity region of the BBC-CM is achieved. Numerical results with finite node degrees show that the achievable rates approach the channel capacities in both BECs and BI-AWGN channels.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2012. 91-95 p.
Keyword [en]
Bi-directional Relaying, Binary erasure channel, Broadcast channels, Capacity regions, Code-words, LDPC convolutional codes, Memoryless, Node degree, Numerical results, Transmission phase
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-107897DOI: 10.1109/ISTC.2012.6325205Scopus ID: 2-s2.0-84870814375ISBN: 978-145772115-1 (print)OAI: oai:DiVA.org:kth-107897DiVA: diva2:578691
Conference
7th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2012; Gothenburg; 27 August 2012 through 31 August 2012
Funder
ICT - The Next Generation
Note

QC 20130118

Available from: 2012-12-18 Created: 2012-12-18 Last updated: 2013-09-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Thobaben, RagnarSkoglund, MikaelOechtering, Tobias

Search in DiVA

By author/editor
Si, ZhongweiThobaben, RagnarSkoglund, MikaelOechtering, Tobias
By organisation
Communication TheoryACCESS Linnaeus Centre
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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