Literature Database Entry


Muhammad Nabeel, Akram Chbib, Muhammad Sohaib Amjad, Falko Dressler and Jürgen Peissig, "Low-Complexity Linear and Non-Linear Digital Self-Interference Cancellation," Proceedings of IEEE Conference on Standards for Communications and Networking (CSCN 2023), Munich, Germany, November 2023, pp. 189–194.


To fully utilize the in-band full-duplex (IBFD) communication in practice, digital self-interference (SI) cancellation is indispensable. In the literature, several methods have been proposed to suppress the SI signal in digital domain, however, mostly linear and non-linear SI techniques are studied separately. In this work, we review existing digital SI cancellation methods and present a low-complexity solution for both linear and non-linear digital SI cancellation by exploiting frequency-domain processing as well as a neural network-based approach. We developed an orthogonal frequency division multiplexing (OFDM)-based IBFD transceiver in GNU Radio and use it in combination with USRP software-defined radios (SDRs) to experimentally demonstrate the performance in an unified framework. Our results show that the proposed SI cancellation is computationally 4 times more efficient and achieves a similar SI cancellation performance as the state of the art.

Quick access

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


Muhammad Nabeel
Akram Chbib
Muhammad Sohaib Amjad
Falko Dressler
Jürgen Peissig

BibTeX reference

    author = {Nabeel, Muhammad and Chbib, Akram and Amjad, Muhammad Sohaib and Dressler, Falko and Peissig, J{\"{u}}rgen},
    doi = {10.1109/CSCN60443.2023.10453185},
    title = {{Low-Complexity Linear and Non-Linear Digital Self-Interference Cancellation}},
    pages = {189--194},
    publisher = {IEEE},
    address = {Munich, Germany},
    booktitle = {IEEE Conference on Standards for Communications and Networking (CSCN 2023)},
    month = {11},
    year = {2023},

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.

Last modified: 2024-07-19