Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
Telecommunication Systems
Erschienen in: Telecommunication Systems 3/2017

06.06.2016

Turbo coding for the noisy 2-user binary adder channel with punctured convolutional codes

verfasst von: Maria de Lourdes M. G. Alcoforado, Jamerson J. C. B. de Jesus, Valdemar C. da Rocha Jr.

Erschienen in: Telecommunication Systems | Ausgabe 3/2017

Einloggen

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

search-config
loading …

Abstract

This paper investigates the use of punctured recursive systematic convolutional codes for turbo coding in a 2-user binary adder channel (2-BAC) in the presence of additive white Gaussian noise, aiming to achieve a higher transmission sum rate with reduced decoding complexity. The encoders for the 2-BAC are assumed to be block synchronized and to employ identical puncturing patterns. Iterative decoding combining the Bahl Cocke Jelinek Raviv algorithm and a two-user punctured trellis is employed. For each user and for a fixed puncturing pattern, random interleavers of length 256 bits or 1024 bits, respectively, are simulated and corresponding curves relating bit error rate versus signal to noise ratio are presented for performance comparison purposes. Computer simulation indicates that the loss in performance of a punctured turbo code can be negligible when longer interleavers are used for both users, similarly to the single user case.
Vorheriger Artikel ReIDD: reliability-aware intelligent data dissemination protocol for broadcast storm problem in vehicular ad hoc networks
Nächster Artikel Towards successful VoLTE and VoWiFi deployment: network function virtualization solutions’ benefits and challenges

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
Literatur
1.
Kasami, T., & Lin, S. (1976). Coding for a multiple-access channel. IEEE Transactions on Information Theory, 2(22), 129–137.CrossRef
2.
Cain, J. B., Clark, G. C, Jr., & Geist, J. M. (1979). Punctured convolutional codes of rate \((n-1)/n\) and simplified maximum likelihood decoding. IEEE Transactions on Information Theory, 25(1), 97–100.CrossRef
3.
Wicker, S. B. (1995). Error control systems for digital communication and storage. Upper Saddle River, NJ: Prentice Hall.
4.
Bisla, J. K., Dhillon, N., & Sharma, K. (2014). Performance evaluation of punctured convolutional codes for OFDM-WiMAX system. International Journal of Electronics and Electrical Engineering, 2(3), 142–148.
5.
Mattas, M., & Ostergard, P. R. J. (2005). A new bound for the zero-error capacity region of the two-user binary adder channel. IEEE Transactions on Information Theory, 51, 3289–3291.CrossRef
6.
Kiviluoto, L., & Ostergard, P. R. J. (2007). New uniquely decodable codes for the t-user binary adder channel with \(3 \le t \le 5\). IEEE Transactions on Information Theory, 53, 1219–1220.CrossRef
7.
Roumy, A., & Declerq, D. (2007). Characterization and optimization of LDPC codes for the 2-user Gaussian multiple access channel. EURASIP Journal on Wireless Communications and Networking, 2007, 1–10.CrossRef
8.
Beltrão Neto, H. V., & da Rocha Jr., V. C. (2009). Iterative decoding results for the Gaussian multiuser binary adder channel. In Proceedings of tenth international symposium on communication theory and applications (pp. 1–6).
9.
Wang, G., Land, I., & Grant, A. (2012). Irregular repeat accumulate codes with few iterations for the binary adder channel. In Proceedings of 7th international symposium on turbo codes and iterative information processing (ISTC 2012) (pp. 215–219).
10.
Lu, S., Cheng, J., & Hou, W., et al. (2013). Generalized construction of signature code for multiple-access adder channel. In Proceedings of IEEE international symposium on information theory (ISIT 2013) (pp. 1655–1659).
11.
Matsuda, H. (2013). Coding for a noisy binary multiple-access adder channel. American Journal of Computational and Applied Mathematics, 3(1), 23–25.
12.
Alcoforado, M. L. M. G., Oliveira, M. C. C., & da Rocha, V. C, Jr. (2015). The Bahl-Cocke-Jelinek-Raviv decoding algorithm applied to the three-user binary adder channel. IET Communications, 9(7), 897–902.CrossRef
13.
Bahl, L. R., Cocke, J., Jelinek, F., et al. (1974). Optimal decoding of linear codes for minimizing symbol error rate. IEEE Transactions on Information Theory, 2(20), 284–287.CrossRef
14.
Khalid, A., Khan, E., Adebisi, B., et al. (2015). Image transmission using unequal error protected multi-fold turbo codes over a two-user power-line binary adder channel. IET Image Processing, 9(5), 395–404.CrossRef
15.
Peterson, R., & Costello, D. J, Jr. (1979). Binary convolutional codes for a multiple-access channel. IEEE Transactions on Information Theory, 25(1), 101–105.CrossRef
16.
Alcoforado, M. L. M. G., da Rocha, V. C, Jr., Markarian, G., et al. (2011). Iterative decoding of turbo convolutional codes over noisy two-user binary adder channel. Electronics Letters, 13(47), 749–751.CrossRef
17.
Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit, error-correcting coding and decoding: turbo codes. In Proceedings of IEEE international conference on communications, (ICC’93), 2/3 (pp. 1064–1071).
18.
Alcoforado, M. L. M. G., & da Rocha, V. C, Jr. (2010). The Bahl-Cocke-Jelinek-Raviv algorithm applied to the two user binary adder channel. Journal of Communication and Information Systems, 25, 30–35.CrossRef
19.
Heegard, C., & Wicker, S. (1999). Turbo coding. Berlin: Kluwer Academic Publishers.CrossRef
Metadaten
Titel
Turbo coding for the noisy 2-user binary adder channel with punctured convolutional codes
verfasst von
Maria de Lourdes M. G. Alcoforado
Jamerson J. C. B. de Jesus
Valdemar C. da Rocha Jr.
Publikationsdatum
06.06.2016
Verlag
Springer US
Erschienen in
Telecommunication Systems / Ausgabe 3/2017
Print ISSN: 1018-4864
Elektronische ISSN: 1572-9451
DOI
https://doi.org/10.1007/s11235-016-0185-z

Weitere Artikel der Ausgabe 3/2017

Telecommunication Systems 3/2017 Zur Ausgabe

OriginalPaper

Multi-user access mechanism with intra-access categories differentiation for IEEE 802.11ac wireless local area networks

OriginalPaper

Cognitive radio intelligent-MAC (CR-i-MAC): channel-diverse contention free approach for spectrum management

OriginalPaper

Channel capacity and outage probability analysis of multiuser diversity MIMO MRC systems with antenna selection in the presence of delayed feedback

OriginalPaper

Improved fast handover method for multiple node by using mobile nodes guide

OriginalPaper

Towards successful VoLTE and VoWiFi deployment: network function virtualization solutions’ benefits and challenges

OriginalPaper

ReIDD: reliability-aware intelligent data dissemination protocol for broadcast storm problem in vehicular ad hoc networks

Neuer Inhalt

    Bildnachweise