Literature Database Entry


Muhammad Sohaib Amjad and Falko Dressler, "Software-based Real-time Full-duplex Relaying: An Experimental Study," IEEE Transactions on Green Communications and Networking, vol. 4 (3), pp. 647–656, September 2020.


Relaying in wireless networks is one of the most important concepts to improve the overall communication performance and to increase coverage. Relay systems can work in either half or full-duplex mode. Half-duplex relaying unfortunately increases the overall latency and also causes spectral losses. On the other hand, in-band full-duplex relaying helps to overcome such issues by simultaneously receiving packets from the source and forwarding them towards the destination. We present a software-based real-time full-duplex relaying system, which we implemented in GNU Radio. The system supports running simulations using an abstract channel model as well as over-the-air experiments using Software Defined Radios (SDRs). A major challenge in developing such a system is dealing with self-interference. For this, we constructed a new looped self-interference cancellation system and integrated it with the GNU Radio implementation. In an experimental study, we validated and evaluated our system to characterize the practical performance of the proposed full-duplex relay system. Our main focus is on the impact of the residual looped self-interference, for which we show analytical and simulation results to confirm the experimental study.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX


Muhammad Sohaib Amjad
Falko Dressler

BibTeX reference

    author = {Amjad, Muhammad Sohaib and Dressler, Falko},
    doi = {10.1109/TGCN.2020.2966140},
    title = {{Software-based Real-time Full-duplex Relaying: An Experimental Study}},
    pages = {647--656},
    journal = {IEEE Transactions on Green Communications and Networking},
    publisher = {IEEE},
    month = {9},
    number = {3},
    volume = {4},
    year = {2020},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.