2018
DOI: 10.1186/s13634-018-0529-9
|View full text |Cite
|
Sign up to set email alerts
|

Superimposed signaling inspired channel estimation in full-duplex systems

Abstract: Residual self-interference (SI) cancellation in the digital baseband is an important problem in full-duplex (FD) communication systems. In this paper, we propose a new technique for estimating the SI and communication channels in a FD communication system, which is inspired from superimposed signaling. In our proposed technique, we add a constant real number to each constellation point of a conventional modulation constellation to yield asymmetric shifted modulation constellations with respect to the origin. W… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 41 publications
0
2
0
Order By: Relevance
“…2 The design of optimum asymmetric modulation constellations is outside the scope of this paper and is the subject of future work [14]. It is again clear from (5) that the effect of superimposed signalling with constant signal P is the same as shifting the modulation constellation by P along the horizontal axis.…”
Section: B Modified System Modelmentioning
confidence: 99%
“…2 The design of optimum asymmetric modulation constellations is outside the scope of this paper and is the subject of future work [14]. It is again clear from (5) that the effect of superimposed signalling with constant signal P is the same as shifting the modulation constellation by P along the horizontal axis.…”
Section: B Modified System Modelmentioning
confidence: 99%
“…For the complexity analysis of the proposed joint channel and PN estimation technique, we take the approach used by [36,37] and count the number of multiplications and additions used in each step of EKF algorithm. Table 2 shows the complexity of each step of EKF algorithm using O−notation.…”
Section: Complexity Analysis Of Ekfmentioning
confidence: 99%