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

PLoS One. 2019 Aug 15;14(8):e0219490. doi: 10.1371/journal.pone.0219490. eCollection 2019.

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.

MeSH terms

  • Algorithms*
  • Computer Communication Networks*
  • Models, Statistical*
  • Time Factors

Grants and funding

The authors [SUR, SEA, FM and MAZR] received no specific funding for this work. Additionally, for author FM, the funder (Kabul Depot, Kabul, Afghanistan) provided support in the form of salaries for author [FM], but did not have any additional role in the study design, data collection and analysis, decision to publish, or preparation of the manuscript.