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

Jonghyun Baik; Jun Heo

doi:10.1109/WCNC.2014.6952903

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

Jonghyun Baik, Jun Heo

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 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 language	English
Title of host publication	IEEE Wireless Communications and Networking Conference, WCNC
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2862-2867
Number of pages	6
ISBN (Electronic)	9781479930838
DOIs	https://doi.org/10.1109/WCNC.2014.6952903
Publication status	Published - 2016 Apr 3
Event	2014 IEEE Wireless Communications and Networking Conference, WCNC 2014 - Istanbul, Turkey Duration: 2014 Apr 6 → 2014 Apr 9

Publication series

Name	IEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)	1525-3511

Other

Other	2014 IEEE Wireless Communications and Networking Conference, WCNC 2014
Country/Territory	Turkey
City	Istanbul
Period	14/4/6 → 14/4/9

Bibliographical note

Publisher Copyright:
© 2014 IEEE.

ASJC Scopus subject areas

General Engineering

Access to Document

10.1109/WCNC.2014.6952903

Cite this

Baik, J., & Heo, J. (2016). A generalized distributed rateless coding scheme for non-cooperative multi-source transmissions. In IEEE Wireless Communications and Networking Conference, WCNC (pp. 2862-2867). Article 6952903 (IEEE Wireless Communications and Networking Conference, WCNC). 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., 2016. p. 2862-2867 6952903 (IEEE Wireless Communications and Networking Conference, WCNC).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Baik, J & Heo, J 2016, A generalized distributed rateless coding scheme for non-cooperative multi-source transmissions. in IEEE Wireless Communications and Networking Conference, WCNC., 6952903, IEEE Wireless Communications and Networking Conference, WCNC, 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

@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",

note = "Publisher Copyright: {\textcopyright} 2014 IEEE.; 2014 IEEE Wireless Communications and Networking Conference, WCNC 2014 ; Conference date: 06-04-2014 Through 09-04-2014",

year = "2016",

month = apr,

day = "3",

doi = "10.1109/WCNC.2014.6952903",

language = "English",

series = "IEEE Wireless Communications and Networking Conference, WCNC",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2862--2867",

booktitle = "IEEE Wireless Communications and Networking Conference, WCNC",

}

TY - GEN

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

AU - Baik, Jonghyun

AU - Heo, Jun

PY - 2016/4/3

Y1 - 2016/4/3

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

U2 - 10.1109/WCNC.2014.6952903

DO - 10.1109/WCNC.2014.6952903

M3 - Conference contribution

AN - SCOPUS:84912096630

T3 - IEEE Wireless Communications and Networking Conference, WCNC

SP - 2862

EP - 2867

BT - IEEE Wireless Communications and Networking Conference, WCNC

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2014 IEEE Wireless Communications and Networking Conference, WCNC 2014

Y2 - 6 April 2014 through 9 April 2014

ER -

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

Abstract

Publication series

Other

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this