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
Erasure Floor Analysis of Distributed LT Codes
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-0002-5407-0835
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. University of South Australia, Australia.ORCID iD: 0000-0001-7182-9543
2015 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 63, no 8, 2788-2796 p.Article in journal (Refereed) Published
Abstract [en]

We investigate the erasure floor performance of distributed Luby transform (DLT) codes for transmission within a multi-source, single-relay, and single-destination erasure-link network. In general, Luby transform (LT) codes exhibit a high erasure floor due to poor minimum-distance properties, which can be improved by maximizing the minimum variable-node degree. The same behavior is observed for DLT codes, and therefore a new combining scheme at the relay is proposed to maximize the minimum variable-node degree in the decoding graph. Furthermore, the encoding process at the sources and the combining scheme at the relay are coordinated to improve the transmission overhead. To characterize the asymptotic performance of the proposed DLT codes, we derive closed-form density-evolution expressions, considering both lossless and lossy source-relay channels, respectively. To support the asymptotic analysis, we evaluate the performance of the proposed DLT codes by numerical examples and demonstrate that the numerical results correspond closely to the analysis. Significant improvements in both the erasure floor and transmission overhead are obtained for the proposed DLT codes, as compared to conventional DLT codes.

Place, publisher, year, edition, pages
2015. Vol. 63, no 8, 2788-2796 p.
Keyword [en]
Multi-source networks, distributed LT codes, buffer, relay combining, erasure floor
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-173278DOI: 10.1109/TCOMM.2015.2451640ISI: 000359535700005Scopus ID: 2-s2.0-84939443909OAI: oai:DiVA.org:kth-173278DiVA: diva2:852647
Note

QC 20150909

Available from: 2015-09-09 Created: 2015-09-09 Last updated: 2017-12-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Xiao, MingRasmussen, Lars Kildehoj

Search in DiVA

By author/editor
Hussain, IqbalXiao, MingRasmussen, Lars Kildehoj
By organisation
ACCESS Linnaeus CentreCommunication Theory
In the same journal
IEEE Transactions on Communications
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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