nach oben

Telecommunication Systems

Erschienen in:

12.11.2018

Overhead minimization of online codes

verfasst von: Hassan Tavakoli

Erschienen in: Telecommunication Systems | Ausgabe 2/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

We introduce a novel method and two algorithms for designing efficient degree distributions with minimum overhead for online codes. The first algorithm is the general form for solving the problem of overhead minimization and the second one is an adaptive method based on the first method. In these two approaches, the codes are designed based on a discretized non-linear optimization problem. One direct result of the presented algorithms is decreasing the number of samples for solving the non-linear programming problem of the overhead minimization problem, which is not easy to solve without discretization. Also, we find a simple criteria in order to choose the critical sample points and show that the convergence rate improves. By considering these algorithms, one can construct an online code with minimum overhead for any given erasure channel parameter. Furthermore, the complexity of our algorithms has a linear relation with the number of samples because linear programming model is used. Simulation results are presented that show the efficiency of the proposed algorithms.

Vorheriger Artikel RSRP difference elimination and motion state classification for fingerprint-based cellular network positioning system

Nächster Artikel A self-tuning controller for queuing delay regulation in TCP/AQM networks

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Gallager, R. G. (1963). Low-density parity-check codes. Cambridge, MA: MIT Press.CrossRef

Karami, A. R., Ahmadian Attari, M., & Tavakoli, H. (2009). Multi layer perceptron neural networks decoder for LDPC codes. In 2009 5th international conference on wireless communications, networking and mobile computing, Beijing, 2009 (pp. 1–4). https://doi.org/10.1109/wicom.2009.5303382.

Tavakoli, H., Attari, M. A., & Peyghami, M. R. (2011). Optimal rate for irregular LDPC codes in binary erasure channel. In Information theory workshop (ITW), 2011 IEEE, Paraty, 2011 (pp. 125–129). https://doi.org/10.1109/itw.2011.6089360.

Tavakoli, H., Attari, M. A., & Peyghami, M. R. (2011). Optimal rate and maximum erasure probability LDPC codes in binary erasure channel. In 2011 49th annual Allerton conference on communication, control, and computing (Allerton), Monticello, IL, 2011. https://doi.org/10.1109/allerton.2011.6163054.

Tavakoli, H., Ahmadian, M., & Peyghami, M. R. (2012). Optimal rate irregular low-density parity-check codes in binary erasure channel. IET Communications, 6(13), 2000–2006. https://doi.org/10.1049/iet-com.2011.0915.CrossRef

Tavakoli, H. (2014). Reducing the complexity of the linear programming decoding. In 2014 7th international symposium on telecommunications (IST), Tehran, 2014 (pp. 582–584). https://doi.org/10.1109/istel.2014.7000772.

Tavakoli, H. (2014). Source and channel optimal rate LDPC code design for one sender in BE-MAC with source correlation, In 2014 7th international symposium on telecommunications (IST), Tehran (pp. 578–581). https://doi.org/10.1109/istel.2014.7000771.

Tavakoli, H. (2014). A fast convergence density evolution algorithm for optimal rate LDPC codes in BEC. In: 2014 7th international symposium on telecommunications (IST), Tehran (pp. 574–577). https://doi.org/10.1109/istel.2014.7000770.

Tavakoli, H., & Razi, A. (2016). Optimizing low density parity check code for two parallel erasure links. In 2016 international symposium on information theory and its applications (ISITA), Monterey, CA (pp. 394–397).

10.

Tavakoli, H. (2017). A family of LDPC codes for Binary Symmetric Channel with optimized rate. In 2017 Iranian Conference on Electrical Engineering (ICEE), Tehran, 2017 (pp. 1774–1778).

11.

Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman D., & Stemann, V. (1997). Practical loss-resilient codes. In Proceedings of the 29th annual ACM symposium on theory of computing (pp. 150–169), May 1997.

12.

Oswald, P., & Shokrollahi, A. (2002). Capacity-achieving sequences for the erausre channel. IEEE Transactions on Information Theory, 48, 3017–3028.CrossRef

13.

Chung, S.-Y., Forney, G., Richardson, T., & Urbanke, R. (2001). On the design of low-density parity check codes within 0.0045 db of the Shannon Limit. IEEE Communications Letters, 5, 58–60.CrossRef

14.

Luby, M. (2002). LT codes. In Foundations of computer science, 2002. Proceedings. The 43rd annual IEEE symposium on (pp. 271–280). https://doi.org/10.1109/sfcs.2002.1181950.

15.

Ebrahimzadeh, F., Attari, M. A., & Tavakoli, H. (2017). Extended LT decoder based on extra ripples. In 2017 Iranian conference on electrical engineering (ICEE), Tehran, 2017 (pp. 1735–1740).

16.

Shokrollahi, A. (2006). Raptor codes. IEEE Transactions on Information Theory, 52(6), 2551–2567.CrossRef

17.

Shokrollahi, A., Lassen, S., & Luby, M. (2001). Multi-stage code generator and decoder for communication systems. U.S. Patent application number 20030058958, Dec 2001.

18.

Yang, S., & Yeung, R. W. (2014). Batched sparse codes. IEEE Transactions on Information Theory, 60(9), 5322–5346.CrossRef

19.

Lázaro, F., Paolini, E., Liva, G., & Bauch, G. (2016). Distance spectrum of fixed-rate raptor codes with linear random precoders. IEEE Journal on Selected Areas in Communications, 34(2), 422–436.CrossRef

20.

Lázaro, F., Liva, G., & Bauch, G. (2017). Inactivation decoding of LT and raptor codes: analysis and code design. IEEE Transactions on Communications, 65(10), 4114–4127.

21.

Talari, A., & Rahnavard, N. (2014). Robust LT codes with alternating feedback. Computer Communications, 49, 60–68.CrossRef

22.

Maymounkov, P., & Mazieres, D. (2003). Rateless codes and big downloads. In International workshop on peer-to-peer systems (pp. 247–255). Berlin: Springer.

23.

Maymounkov, P. (2002). Online codes. Technical report, New York University.

24.

Ben-Tal, A., & Nemirovski, A. (1998). Robust convex optimization. Mathematics of Operations Research, 23(4), 769–805.CrossRef

Titel: Overhead minimization of online codes
verfasst von: Hassan Tavakoli
Publikationsdatum: 12.11.2018
Verlag: Springer US
Erschienen in: Telecommunication Systems / Ausgabe 2/2019
Print ISSN: 1018-4864
Elektronische ISSN: 1572-9451
DOI: https://doi.org/10.1007/s11235-018-0524-3

Neuer Inhalt

Bildnachweise

VDI-Icon, Profil Icon, inhalt2, Springer Professional Modul/© Springer Fachmedien Wiesbaden GmbH, Nachhaltigkeitsaward Key Visual/© Cometis AG/Global ESG Monitor | Daniel Rupp | Generiert mit KI, Search Icon, Banner Hanser, Arbeitszeit/© granata68 / Fotolia, E-Autos im Fuhrpark: Lohnt sich das noch?/© Petair / stock.adobe.com, Kryptowährungen/© gopixa / Getty Images / iStock, Zeitschrift Wissensmanagement Cover, PatentFit-Logo/© Springer Fachmedien Wiesbaden GmbH, Sustainibility Finance/© Robert Kneschke / stock.adobe.com / Springer Fachmedien Wiesbaden GmbH, Zukunftswerkstatt Sales Excellence 2024/© AndreyPopov / Getty Images / iStock, 2023_Antrieb/© supervisuell

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 2/2019

On the fundamental limit to the use of cognitive radio in underwater acoustic sensor networks

RSRP difference elimination and motion state classification for fingerprint-based cellular network positioning system

Energy-efficient Nature-Inspired techniques in Cloud computing datacenters

Throughput analysis and optimization of cognitive radio networks using incremental relaying

On solving the 1 + 1 routing, wavelength and network coding assignment problem with a bi-objective integer linear programming model

New evolution in two-way relay networks based on physical layer network coding

Neuer Inhalt

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.