Literature Database Entry


Muhammad Sohaib Amjad and Ozgur Gurbuz, "Linear Digital Cancellation with Reduced Computational Complexity for Full-Duplex Radios," Proceedings of IEEE Wireless Communications and Networking Conference (WCNC 2017), San Francisco, CA, March 2017.


Recent works have demonstrated the feasibility and potential of full-duplex (FD) wireless systems to double the spectral efficiency of half-duplex (HD) systems. Self-interference (SI) cancellation is the key to FD communication and the residual SI is the major factor determining the performance of an FD radio. This paper presents a novel frequency domain based approach, for the reconstruction of SI signal in digital domain. Unlike the existing time domain reconstruction approach, which requires convolution, the proposed approach is simple and uses FFT processing for SI signal reconstruction. By means of computational complexity evaluation, it is shown that the proposed reconstruction approach offers 61% reduction in the floating point operations required to reconstruct SI signal. Furthermore, via detailed simulations on the performance of digital SI cancellation under fading channels, it is demonstrated that the SI suppression achieved with the proposed approach is not only comparable to existing approach, but with frequency domain SI channel estimates, it can offer 5-7 dB better cancellation under highly frequency selective fading conditions, suggesting its suitability for long range transmission.

Quick access

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


Muhammad Sohaib Amjad
Ozgur Gurbuz

BibTeX reference

    author = {Amjad, Muhammad Sohaib and Gurbuz, Ozgur},
    doi = {10.1109/WCNC.2017.7925764},
    title = {{Linear Digital Cancellation with Reduced Computational Complexity for Full-Duplex Radios}},
    publisher = {IEEE},
    address = {San Francisco, CA},
    booktitle = {IEEE Wireless Communications and Networking Conference (WCNC 2017)},
    month = {3},
    year = {2017},

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.