Performance analysis of turbo codes and distributed turbo codes in buffer-aided relay systems

Attarkashani A., Hamouda W., Moualeu J. M., Haghighat J.

IEEE Transactions on Communications, vol.67, no.7, pp.4620-4633, 2019 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 67 Issue: 7
  • Publication Date: 2019
  • Doi Number: 10.1109/tcomm.2019.2911280
  • Journal Name: IEEE Transactions on Communications
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.4620-4633
  • Keywords: Buffer-aided relays, delay, diversity gain, pair-wise error probability, relay selection, throughput, Turbo code
  • TED University Affiliated: No

Abstract

In this paper, we investigate the performance of a relay selection scheme in a buffer-aided multi-relay network with coded transmissions. We consider: 1) two different coding schemes, i.e., Turbo codes and distributed Turbo codes (DTC) and 2) quasi-static Rayleigh fading channels, where all the links are independent but asymmetric. For each of the aforementioned schemes, we analyze the performance of the system in terms of the average throughput and average delay. In addition, simple and explicit approximations of the asymptotic throughput for infinite buffer size and the high signal-to-noise ratio (SNR) regime are obtained. Our analysis of the asymptotic throughput provides the maximum achievable diversity gain of the system, and the accuracy of the derived analytical framework is assessed when compared to the Monte-Carlo simulations.