IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v64y2017i3d10.1007_s11235-016-0185-z.html
   My bibliography  Save this article

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

Author

Listed:
  • Maria de Lourdes M. G. Alcoforado

    (University of Pernambuco (UPE))

  • Jamerson J. C. B. Jesus

    (University of Pernambuco (UPE))

  • Valdemar C. Rocha

    (Federal University of Pernambuco)

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.

Suggested Citation

  • Maria de Lourdes M. G. Alcoforado & Jamerson J. C. B. Jesus & Valdemar C. Rocha, 2017. "Turbo coding for the noisy 2-user binary adder channel with punctured convolutional codes," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(3), pages 459-465, March.
    • Handle: RePEc:spr:telsys:v:64:y:2017:i:3:d:10.1007_s11235-016-0185-z
    DOI: 10.1007/s11235-016-0185-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-016-0185-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-016-0185-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. I. M. M. Souza & M. L. M. G. Alcoforado & V. C. Rocha, 2018. "Turbo decoding of simple product codes in a two user binary adder channel employing the Bahl–Cocke–Jelinek–Raviv algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 68(3), pages 513-521, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:64:y:2017:i:3:d:10.1007_s11235-016-0185-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.