.png){kind=icon}
.png){kind=icon}
Return
A Memory Polynomial-Based Iterative Orthogonal Least Square Algorithm for Reconstructing Self-Interferences in Full-Duplex Communications
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2023.3342214.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In in-band full-duplex (IBFD) communication systems, the digital self-interference cancellation (DSIC) is one of the most challenging problems. In this brief, we consider the DSIC from the perspective of compressed sensing and sparse reconstruction and propose an iterative orthogonal least square (IOLS) algorithm based on the memory polynomial-based self-interference canceller, which aims to select the most relevant polynomial terms (atoms) from the memory-polynomial dictionary and greedily acquires the sparse polynomial model coefficients. By incorporating the Gram-Schmidt orthogonalization and backward substitution into the IOLS, the sparse reconstruction of the digital self-interference (SI) is carried out iteratively avoiding direct calculation of the pseudo-inverse matrix in each selection step. Simulation results show that the proposed achieves up to 90% reduction in terms of the model complexity with regard to the conventional polynomial-based least square (LS) method while providing the comparable cancellation performance.
Keywords:
Interference cancellation
Mixers
Radio frequency
Channel estimation
Couplings
Wireless communication
Receivers
Full-duplex communication
digital self-interference cancellation
memory-polynomial model
iterative orthogonal least square
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W