A generalized distributed rateless coding scheme for non-cooperative multi-source transmissions

Jonghyun Baik, Jun Heo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Rateless codes are representative capacity achieving codes for the binary erasure channels. We consider a network where multiple noncooperative sources with arbitrarily correlated messages communicate with a single destination. The conventional distributed rateless coding scheme introduces a general And-or tree analysis and provides linear programming (LP) based solutions only for some special cases. However, in this paper, an optimization method applicable to all the cases is proposed. Based on the generalized analysis, we define a new objective and employ the sequential quadratic programming (SQP) algorithm to solve the problem. The obtained solution contains optimal degree distributions and symbol-selection weights. It is shown that the proposed scheme exhibits the reduced overhead at the higher symbol recovery rate region compared to the conventional schemes.

Original languageEnglish
Title of host publicationIEEE Wireless Communications and Networking Conference, WCNC
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2862-2867
Number of pages6
ISBN (Print)9781479930838
DOIs
Publication statusPublished - 2014 Jan 1
Event2014 IEEE Wireless Communications and Networking Conference, WCNC 2014 - Istanbul, Turkey
Duration: 2014 Apr 62014 Apr 9

Other

Other2014 IEEE Wireless Communications and Networking Conference, WCNC 2014
CountryTurkey
CityIstanbul
Period14/4/614/4/9

Fingerprint

Quadratic programming
Linear programming
Recovery

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Baik, J., & Heo, J. (2014). A generalized distributed rateless coding scheme for non-cooperative multi-source transmissions. In IEEE Wireless Communications and Networking Conference, WCNC (pp. 2862-2867). [6952903] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/WCNC.2014.6952903

A generalized distributed rateless coding scheme for non-cooperative multi-source transmissions. / Baik, Jonghyun; Heo, Jun.

IEEE Wireless Communications and Networking Conference, WCNC. Institute of Electrical and Electronics Engineers Inc., 2014. p. 2862-2867 6952903.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Baik, J & Heo, J 2014, A generalized distributed rateless coding scheme for non-cooperative multi-source transmissions. in IEEE Wireless Communications and Networking Conference, WCNC., 6952903, Institute of Electrical and Electronics Engineers Inc., pp. 2862-2867, 2014 IEEE Wireless Communications and Networking Conference, WCNC 2014, Istanbul, Turkey, 14/4/6. https://doi.org/10.1109/WCNC.2014.6952903
Baik J, Heo J. A generalized distributed rateless coding scheme for non-cooperative multi-source transmissions. In IEEE Wireless Communications and Networking Conference, WCNC. Institute of Electrical and Electronics Engineers Inc. 2014. p. 2862-2867. 6952903 https://doi.org/10.1109/WCNC.2014.6952903
Baik, Jonghyun ; Heo, Jun. / A generalized distributed rateless coding scheme for non-cooperative multi-source transmissions. IEEE Wireless Communications and Networking Conference, WCNC. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 2862-2867
@inproceedings{6dfa9f64b183494d920ff4eef6f78abb,
title = "A generalized distributed rateless coding scheme for non-cooperative multi-source transmissions",
abstract = "Rateless codes are representative capacity achieving codes for the binary erasure channels. We consider a network where multiple noncooperative sources with arbitrarily correlated messages communicate with a single destination. The conventional distributed rateless coding scheme introduces a general And-or tree analysis and provides linear programming (LP) based solutions only for some special cases. However, in this paper, an optimization method applicable to all the cases is proposed. Based on the generalized analysis, we define a new objective and employ the sequential quadratic programming (SQP) algorithm to solve the problem. The obtained solution contains optimal degree distributions and symbol-selection weights. It is shown that the proposed scheme exhibits the reduced overhead at the higher symbol recovery rate region compared to the conventional schemes.",
author = "Jonghyun Baik and Jun Heo",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/WCNC.2014.6952903",
language = "English",
isbn = "9781479930838",
pages = "2862--2867",
booktitle = "IEEE Wireless Communications and Networking Conference, WCNC",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - A generalized distributed rateless coding scheme for non-cooperative multi-source transmissions

AU - Baik, Jonghyun

AU - Heo, Jun

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Rateless codes are representative capacity achieving codes for the binary erasure channels. We consider a network where multiple noncooperative sources with arbitrarily correlated messages communicate with a single destination. The conventional distributed rateless coding scheme introduces a general And-or tree analysis and provides linear programming (LP) based solutions only for some special cases. However, in this paper, an optimization method applicable to all the cases is proposed. Based on the generalized analysis, we define a new objective and employ the sequential quadratic programming (SQP) algorithm to solve the problem. The obtained solution contains optimal degree distributions and symbol-selection weights. It is shown that the proposed scheme exhibits the reduced overhead at the higher symbol recovery rate region compared to the conventional schemes.

AB - Rateless codes are representative capacity achieving codes for the binary erasure channels. We consider a network where multiple noncooperative sources with arbitrarily correlated messages communicate with a single destination. The conventional distributed rateless coding scheme introduces a general And-or tree analysis and provides linear programming (LP) based solutions only for some special cases. However, in this paper, an optimization method applicable to all the cases is proposed. Based on the generalized analysis, we define a new objective and employ the sequential quadratic programming (SQP) algorithm to solve the problem. The obtained solution contains optimal degree distributions and symbol-selection weights. It is shown that the proposed scheme exhibits the reduced overhead at the higher symbol recovery rate region compared to the conventional schemes.

UR - http://www.scopus.com/inward/record.url?scp=84912096630&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84912096630&partnerID=8YFLogxK

U2 - 10.1109/WCNC.2014.6952903

DO - 10.1109/WCNC.2014.6952903

M3 - Conference contribution

SN - 9781479930838

SP - 2862

EP - 2867

BT - IEEE Wireless Communications and Networking Conference, WCNC

PB - Institute of Electrical and Electronics Engineers Inc.

ER -