IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0219490.html
   My bibliography  Save this article

A novel application of breadth first algorithm for achieving collision free memory mapping

Author

Listed:
  • Saeed ur Rehman
  • Saeed Ehsan Awan
  • Fazel Rehman Mumtaz
  • Muhammad Asif Zahoor Raja

Abstract

We are living in the world of handheld smart devices including smart phones, mini computers, tablets, net-books and others communication devices. The telecommunication standards used in these devices includes error correction codes which are integral part of current and future communication systems. To achieve the higher data rate applications, the turbo and Low Density Parity Check (LDPC) codes are decoded on parallel architecture which in turn raises the memory conflict issue. In order to get the good performance, the simultaneous access to the entire memory bank should be performed without any conflict. In this article we present breadth first technique applied on transportation modeling of the problem for solving the collision issue of Turbo decoders in order to get optimized architecture solution.

Suggested Citation

  • Saeed ur Rehman & Saeed Ehsan Awan & Fazel Rehman Mumtaz & Muhammad Asif Zahoor Raja, 2019. "A novel application of breadth first algorithm for achieving collision free memory mapping," PLOS ONE, Public Library of Science, vol. 14(8), pages 1-18, August.
    • Handle: RePEc:plo:pone00:0219490
    DOI: 10.1371/journal.pone.0219490
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0219490
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0219490&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0219490?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0219490. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.