 Research
 Open Access
 Published:
Spatial degreesoffreedom in largearray fullduplex: the impact of backscattering
EURASIP Journal on Wireless Communications and Networking volume 2016, Article number: 286 (2016)
Abstract
The key challenge for inband fullduplex wireless communication is managing selfinterference. Many designs have employed spatial isolation mechanisms, such as shielding or multiantenna beamforming, to isolate the selfinterference waveform from the receiver. Because such spatial isolation methods confine the transmit and receive signals to a subset of the available space, the full spatial resources of the channel may be underutilized, expending a cost that may nullify the net benefit of operating in fullduplex mode. In this paper, we leverage an antennatheorybased channel model to analyze the spatial degrees of freedom available to a fullduplex capable base station. We observe that whether or not spatial isolation outperforms timedivision (i.e., halfduplex) depends heavily on the geometric distribution of scatterers. Unless the angular spread of the objects that scatter to the intended users is overlapped by the spread of objects that backscatter to the base station, then spatial isolation outperforms time division, otherwise time division may be optimal.
Introduction
Currently deployed wireless communications equipment operates in halfduplex mode, meaning that transmission and reception are orthogonalized either in time (timedivisionduplex) or frequency (frequencydivisionduplex). Research in recent years [1–12] has investigated the possibility of wireless equipment operating in fullduplex mode, meaning that the transceiver will both transmit and receive at the same time and in the same spectrum. A potential benefit of fullduplex is illustrated in. User 1 wishes to transmit uplink data to a base station, and User 2 wishes to receive downlink data from the same base station. If the base station is halfduplex, then it must either service the users in orthogonal time slots or in orthogonal frequency bands. However, if the base station can operate in fullduplex mode, then it can enhance spectral efficiency by servicing both users simultaneously. The challenge to fullduplex communication, however, is that the base station transmitter generates highpowered selfinterference which potentially swamps its own receiver, precluding the detection of the uplink message.^{1}
For fullduplex to be feasible, the selfinterference must be suppressed. The two main approaches to selfinterference suppression are cancellation and spatial isolation, and we now define each. Selfinterference cancellation is any technique which exploits the foreknowledge of the transmit signal by subtracting an estimate of the selfinterference from the received signal. Cancellation can be applied at digital baseband, at analog baseband, at RF, or, as is most common, applied at a combination of these three domains [4–7, 11, 13, 14]. Spatial isolation is any technique to spatially orthogonalize the selfinterference and the signalofinterest. Some spatial isolation techniques studied in the literature are multiantenna beamforming [1, 15–19], directional antennas [20], shielding via absorptive materials [21], and crosspolarization of transmit and receive antennas [10, 21]. The key differentiator between cancellation and spatial isolation is that cancellation requires and exploits knowledge of the selfinterference, while spatial isolation does not. To our knowledge, all fullduplex designs to date have required both cancellation and spatial isolation in order for fullduplex to be feasible even at very short ranges (i.e., <10 m). For example, see designs such as [5, 6, 10, 11], each of which leverages cancellation techniques as well as at least one spatial isolation technique. Moreover, because cancellation performance is limited by transceiver impairments such as phase noise [22], spatial isolation often accounts for an outsized portion of the overall selfinterference suppression.
For example, in the fullduplex design of [21] which demonstrated fullduplex feasibility at WiFi ranges, of the 95 dB of selfinterference suppression achieved, 70 dB is due to spatial isolation, while only 25 dB is due to cancellation. Therefore, if fullduplex feasibility is to be extended from WiFitypical ranges to the ranges typical of femtocells or even larger cells, then excellent spatial isolation performance will be required, hence our focus is on spatial isolation in this paper.
In a previous work [21], we studied three passive techniques for spatial isolation: directional antennas, absorptive shielding, and crosspolarization, and measured their performance in a prototype base station both in an anechoic chamber that mimics free space, and in a reflective room. As expected, the techniques suppressed the selfinterference quite well (more than 70 dB) in an anechoic chamber, but scattering environments, the suppression was much less, (no more than 45 dB), due to the fact that passive techniques operate primarily on the direct path between the transmit and receive antennas, and do little to suppress paths that include an external backscatterer. The directpath limitation of passive spatial isolation mechanisms raises the question of whether or not spatial isolation can be useful in a backscattering environment. Another class of spatial isolation techniques called “active” or “channel aware” spatial isolation [23] can indeed suppress both direct and backscattered selfinterference. In particular, if multiple antennas are used and if the selfinterference channel response can be estimated, then the radiation pattern can be shaped adaptively to mitigate both directpath and backscattered selfinterference. However, this pattern shaping (i.e., beamforming) will consume spatial degreesoffreedom that could have otherwise been leveraged for spatial multiplexing. Thus, there is an important tradeoff between spatial selfinterference isolation and achievable degrees of freedom.
To appreciate the tradeoff, consider the example in Fig. 1. The direct path from the base station transmitter, T _{2}, to its receiver R _{1}, can be passively suppressed by shielding the receiver from the transmitter as shown in [21], but there will also be backscattered selfinterference due to objects near the base station (depicted by gray blocks in Fig. 1). The selfinterference caused by scatterer S _{0}, for example, in Fig. 1, could be avoided by creating a null in the direction of S _{0}. However, losing access to the scatterer could create a lessrich scattering environment, diminishing the spatial degreesoffreedom of the uplink or downlink. Moreover, creating the null consumes spatial degreesoffreedom that could otherwise be used for spatial multiplexing to the downlink user, diminishing the achievable degreesoffreedom of the downlink. This example leads us to pose the following question.
Question: Under what scattering conditions can spatial isolation be leveraged in fullduplex operation to provide a degreeoffreedom gain over halfduplex? More specifically, given a constraint on the size of the antenna arrays at the base station and at the user devices, and given a characterization of the spatial distribution of the scatterers in the environment, what is the uplink/downlink degreeoffreedom region when the only selfinterference mitigation strategy is spatial isolation?
Modeling approach: To answer the above question, we leverage the antennatheorybased channel model developed by Poon, Broderson, and Tse in [24–26], which we will label the “PBT” model. In the PBT model, instead of constraining the number of antennas, the size of the array is constrained. Furthermore, instead of considering a channel matrix drawn from a probability distribution, a channel transfer function which depends on the geometric position of the scatterers relative to the arrays is considered (Fig. 2).
Contribution: We extend the PBT model to the threenode fullduplex topology of Fig. 1, and derive the degreeoffreedom region, \(\mathcal {D}_{\mathsf {FD}}\): the set of all achievable uplink/downlink degreeoffreedom tuples. By comparing \(\mathcal {D}_{\mathsf {FD}}\) to \(\mathcal {D}_{\mathsf {HD}}\), the degreeoffreedom region achieved by timedivision halfduplex, we observe that fullduplex outperforms halfduplex, i.e., \(\mathcal {D}_{\mathsf {HD}}\subset \mathcal {D}_{\mathsf {FD}}\), in the following two scenarios.

1.
When the base station arrays are larger than the corresponding user arrays, the base station has a larger signal space than is needed for spatial multiplexing and can leverage the extra signal dimensions to form beams that avoid selfinterference (i.e., selfinterference zeroforcing).

2.
More interestingly, when the forward scattering intervals and the backscattering intervals are not completely overlapped, the base station can avoid selfinterference by signaling in the directions that scatter to the intended receiver, but do not backscatter to the basestation receiver. Moreover, the base station can also signal in directions that do cause selfinterference, but ensure that the generated selfinterference is incident on the basestation receiver only in directions in which uplink signal is not incident on the basestation receiver, i.e., signal such that the selfinterference and uplink signal are spatially orthogonal.
In [27], an experimental evaluation of a transmitbeamformingbased method for fullduplex operation called “SoftNull” is presented. Inspired by the achievability proof in Section 3.1, the SoftNull algorithm presented in [27] seeks to maximally suppress selfinterference for a given required number of downlinkdegreesoffreedom. This paper presents an information theoretic analysis of the performance limits of beamformingbased fullduplex systems, whereas [27] presents an experimental evaluation of a specific design. We would like to refer [27] to readers who may be interested in how the theoretical intuitions from this paper can guide the design and implementation of a beamformingbased fullduplex system.
Organization of the paper: Section 2 specifies the system model: we begin with an overview of the PBT model in Section 2.1 and then in Section 2.2 apply the model to the scenario of a fullduplex base station with uplink and downlink flows. Section 3 gives the main analysis of the paper, the derivation of the degreesoffreedom region. We start Section 3 by stating the theorem which characterizes the degreesoffreedom region and then give the achievability and converse arguments in Sections 3.1 and 3.2, respectively. In Section 4, we assess the impact of the degreesoffreedom result on the design and deployment of fullduplex base stations, and include an application example, that shows how the results of this paper are used to guide the design of a fullduplex base station in [27]. We give concluding remarks in Section 5.
System model
We now give a brief overview of the PBT channel model presented in [24]. We then extend the PBT model to the case of the threenode fullduplex topology of Fig. 1, and define the required mathematical formalism that will ease the degreesoffreedom analysis in the sequel.
Overview of the PBT model
As illustrated in Fig. 3, the PBT channel model considers a wireless communication link between a transmitter equipped with a unipolarized continuous linear array of length 2L _{ T } and a receiver with a similar array of length 2L _{ R }. The authors observe that there are two key domains: the array domain, which describes the current distribution on the arrays, and the wavevector domain which describes radiated and received field patterns. Channel measurement campaigns show that the angles of departure and the angles of arrival of the physical paths from a transmitter to a receiver tend to be concentrated within a handful of angular clusters [28–31]. Thus the authors of the PBT model [24] focus on the union of the clusters of anglesofdeparture from the transmit array, denoted Θ _{ T }, and the union of the clusters of anglesofarrival to the receive array, Θ _{ R }. Because a linear array aligned to the zaxis array can only resolve the zcomponent, the intervals of interest are Ψ _{ T }={cosθ:θ∈Θ _{ T }} and Ψ _{ R }={cosθ:θ∈Θ _{ R }}. In [24], it is shown from the first principles of Maxwell’s equations that an array of length 2L _{ T } has a resolution of 1/(2L _{ T }) over the interval Ψ _{ T }, so that the dimension of the transmit signal space of radiated field patterns is 2L _{ T }Ψ _{ T }. Likewise the dimension of the receive signal space is 2L _{ R }Ψ _{ R }, so that the spatial degrees of freedom a pointtopoint communication link, d _{P2P}, is
Extension of PBT model to threenode fullduplex
Now we extend the PBT channel model in [24], which considers a pointtopoint topology, to the threenode fullduplex topology of Fig. 1. The antennatheorybased PBT channel model is built upon farfield assumptions, i.e., that the propagation path is much larger than a wavelength. We acknowledge that directpath selfinterference may not obey farfield behavior. However, the backscattered selfinterference, which will travel several wavelengths to reach an external scatterer and then return to the base station, is indeed a farfield signal. As discussed in the introduction, the intent of this paper is to understand the impact of backscattered selfinterference as a function of the size of antenna arrays and the geometric distribution of the scatterers. Since the backscattering is indeed a farfield phenomenon, the PBT model is a quite wellsuited model for our study.
As in [24], we consider continuous linear arrays of infinitely many infinitesimally small unipolarized antenna elements.^{2} Each of the two transmitters T _{ j }, j=1,2, is equipped with a linear array of length \(2{L}_{T_{j}}\), and each receiver, R _{ i }, i=1,2, is equipped with a linear array of length \(2{L}_{R_{i}}\). The lengths \({L}_{T_{j}}\) and \({L}_{R_{i}}\) are normalized by the wavelength of the carrier, and thus are unitless quantities. For each array, define a local coordinate system with origin at the midpoint of the array and zaxis aligned along the length of the array. Let \(\theta _{T_{j}} \in [0,\pi)\) denote the elevation angle relative to the T _{ j } array, and let \(\theta _{R_{i}}\) denote the elevation angle relative to the R _{ i } array. Denote the current distribution on the T _{ j } array as x _{ j }(p _{ j }), where \(p_{j}\in [{L}_{T_{j}},{L}_{T_{j}}]\phantom {\dot {i}\!}\) is the position along the lengths of the array, and \(\phantom {\dot {i}\!}x_{j}:[{L}_{T_{j}},{L}_{T_{j}}] \rightarrow \mathbb {C}\) gives the magnitude and phase of the current. The current distribution, x _{ j }(p _{ j }), is the transmit signal controlled by T _{ j }, which we constrain to be square integrable. Likewise, we denote the received current distribution on the R _{ i } array as \(\phantom {\dot {i}\!}y_{i}(q_{i}),\ q_{i}\in [{L}_{R_{i}},{L}_{R_{i}}]\).
The signal received by the base station receiver, R _{1}, at a point \(\phantom {\dot {i}\!}q_{1} \in [{L}_{R_{2}},{L}_{R_{2}}]\) along its array is given by
where \(\phantom {\dot {i}\!}{z}_{1}({q}_{1}),\ q_{1}\in [{L}_{R_{1}},{L}_{R_{1}}]\) is the noise along the R _{1} array. The channel response integral kernel, C _{ ij }(q _{ i },p _{ j }), gives the current excited at a point q _{ i } on the receive array due to a current at the point p _{ j } on the transmit array. Note that the first term in (2) gives the received uplink signalofinterest, while the second term gives the selfinterference generated by the base station’s own transmission. We assume that the mobile users are out of range of each other, such that there is no channel from T _{1} to R _{2}.^{3} Thus, R _{2}’s received signal at a point \(\phantom {\dot {i}\!}q_{2}\in [{L}_{R_{2}},{L}_{R_{2}}]\) is
The channel response kernel, C _{ ij }(·,·) is composed of a transmit array response, \(\phantom {\dot {i}\!}\boldsymbol {A}_{T_{j}}(\cdot, \cdot)\), a scattering response, H _{ ij }(·,·), and a receive array response, \(\phantom {\dot {i}\!}\boldsymbol {A}_{R_{i}}(\cdot, \cdot)\) [24]. The channel response kernel is given by
where \(\boldsymbol {\hat {k}}\) is a unit vector that gives the direction of departure from the transmitter array, and \(\boldsymbol {\hat {\kappa }}\) is a unit vector that gives the direction of arrival to the receiver array. The transmit array response kernel, \(\phantom {\dot {i}\!}\boldsymbol {A}_{T_{j}}(\boldsymbol {\hat {k}}, {p})\), maps the current distribution along the T _{ j } array (a function of p) to the field pattern radiated from T _{ j } (a function of direction of departure, \(\boldsymbol {\hat {k}}\)). The scattering response kernel, \(H_{ij}(\boldsymbol {\hat {\kappa }}, \boldsymbol {\hat {k}})\), maps the fields radiated from T _{ j } in direction \(\boldsymbol {\hat {k}}\) to the fields incident on R _{ i } at direction \(\boldsymbol {\hat {\kappa }}\). The receive array response, \(\phantom {\dot {i}\!}{A}_{R_{i}}({q},\boldsymbol {\hat {\kappa }})\), maps the field pattern incident on R _{ i } (a function of direction of arrival, \(\boldsymbol {\hat {\kappa }}\)) to the current distribution excited on the R _{ i } array (a function of position q), which is the received signal.
Array responses
In [24], the transmit array response for a linear array is derived from the first principles of Maxwell’s equations and shown to be \( {A}_{T_{j}}(\boldsymbol {\hat {k}}, {p}) = {A}_{T_{j}}(\cos \theta _{T_{j}}, p) = e^{\mathrm {i}2\pi p \cos \theta _{T_{j}}}, p \in \left [{L}_{T_{j}}, {L}_{T_{j}} \right ], \) where \(\theta _{T_{j}}\in [0,\pi)\) is the elevation angle relative to the T _{ j } array. Due to the symmetry of the array (aligned to the zaxis), the radiation pattern is symmetric with respect to the azimuth angle and only depends on the elevation angle \(\theta _{T_{j}}\) through \(\cos \theta _{T_{j}}\). For notational convenience, let \(\phantom {\dot {i}\!}t \equiv \cos \theta _{T_{j}} \in [1, 1]\), so that we can simplify the transmit array response kernel to
By reciprocity, the receive array response kernel, \(\phantom {\dot {i}\!}{A}_{R_{i}}({q}, \boldsymbol {\hat {\kappa }})\), is
where \(\phantom {\dot {i}\!}\tau \equiv \cos \theta _{R_{i}} \in [1, 1]\) is the cosine of the elevation angle relative to the R _{ i } array. Note that the transmit and receive array response kernels are identical to the kernels of the Fourier transform and inverse Fourier transform, respectively, a relationship we will further explore in Section 2.5.
Scattering responses
The scattering response kernel, \(H_{ij}(\boldsymbol {\hat {\kappa }},\boldsymbol {\hat {k}})\), gives the amplitude and phase of the path departing from T _{ j } at direction \(\boldsymbol {\hat {k}}\) and arriving at R _{ i } at direction \(\boldsymbol {\hat {\kappa }}\). Since we are considering linear arrays which only resolve the cosine of the elevation angle, we can consider H _{ ij }(τ,t) which gives the superposition of the amplitude and phase of all paths emanating from T _{ j } with an elevation angle whose cosine is t and arriving at R _{ i } at an elevation angle whose cosine is τ.
As is done in [24], motivated by measurements showing that scattering paths are clustered with respect to the transmitter and receiver, we adopt a model that focuses on the boundary of the scattering clusters rather than the discrete paths themselves, as illustrated in Fig. 2.
Let \(\phantom {\dot {i}\!}\Theta _{T_{ij}}^{(k)}\) denote the angle subtended at transmitter T _{ j } by the k ^{th} cluster that scatters to R _{ i }, and let \(\Theta _{T_{ij}} = \bigcup _{k}\Theta _{T_{ij}}^{(k)}\) be the total transmit scattering interval from T _{ j } to R _{ i }. This scattering interval, \(\phantom {\dot {i}\!}\Theta _{T_{ij}}\), is the set of directions that when illuminated by T _{ j } scatters energy to R _{ i }. In Fig. 2, to avoid clutter, we illustrate the case in which \(\phantom {\dot {i}\!}\Theta _{T_{ij}}^{(k)}\) is a single contiguous angular interval, but in general, the interval will be noncontiguous and consist of several individual clusters. Similarly let \(\phantom {\dot {i}\!}\Theta _{R_{ij}}^{(k)}\) denote the corresponding angle subtended at R _{ i } by the k ^{th} cluster illuminated by T _{ j }, and let \(\phantom {\dot {i}\!}\Theta _{R_{ij}} = \bigcup _{k}\Theta _{R_{ij}}^{(k)}\) be set of directions from which energy can be incident on R _{ i } from T _{ j }.
Thus, we see in Fig. 2 that from the pointofview of the basestation transmitter, T _{2}, \(\Theta _{T_{22}}\) is the angular interval over which the base station can radiate signals that will reach the intended downlink receiver, R _{2}. The angular interval, \(\phantom {\dot {i}\!}\Theta _{T_{12}}\), is the interval in which the base station’s radiated signals will backscatter to the base station’s own receiver, R _{1}, as selfinterference. Likewise, from the pointofview of the base station receiver, R _{1}, \(\phantom {\dot {i}\!}\Theta _{R_{11}}\), is the interval over which the base station may receive signals from the uplink transmitter, T _{1}, while \(\phantom {\dot {i}\!}\Theta _{R_{12}}\) is the interval in which selfinterference may be present. Clearly, the extent to which the selfinterference intervals and the signalofinterest intervals overlap will have a major impact on the degrees of freedom of the network. Because linear arrays can only resolve the cosine of the elevation angle t≡ cosθ, we define the “effective” scattering intervals for the transmit and receive arrays, respectively, as
Define the size of the transmit and receive scattering intervals as \( \Psi _{T_{ij}} = \int _{\Psi _{T_{ij}}} t\, dt\) and \( \Psi _{R_{ij}} = \int _{\Psi _{R_{ij}}} \tau \, d\tau. \)
As in [24], we assume the following characteristics of the scattering responses:

1)
H _{ ij }(τ,t)≠0 only if \((\tau,t) \in \Psi _{R_{ij}}\times \Psi _{T_{ij}}\).

2)
\(\int H_{ij}(\tau,t)dt \neq 0\ \forall \ \tau \in \Psi _{R_{ij}}\).

3)
\(\int H_{ij}(\tau,t)d\tau \neq 0\ \forall \ t \in \Psi _{T_{ij}}\).

4)
The point spectrum of H _{ ij }(·,·), excluding 0, is infinite.

5)
H _{ ij }(·,·) is Lebesgue measurable, that is \(\quad \int _{1}^{1} \int _{1}^{1} H_{ij}(\tau,t)^{2} \,d\tau \,dt < \infty.\)
The first condition means that the scattering response is zero unless the angle of arrival and angle of departure both lie within their respective scattering intervals. The second condition means that in any direction of departure, \(t \in \Psi _{T_{ij}}\), there exists at least one path from transmitter T _{ j } receiver R _{ i }. Similarly, the third condition implies that in any direction of arrival, \(\tau \in \Psi _{R_{ij}}\), there exists at least one path from T _{ j } to R _{ i }. The fourth condition means that there are many paths from the transmitter to the receiver within the scattering intervals, so that the number of propagation paths that can be resolved within the scattering intervals is limited by the length of the arrays and not by the number of paths. The final condition aids our analysis by ensuring the corresponding integral operator is compact, but is also a physically justified assumption since one could argue for the stricter assumption \(\int _{1}^{1} \int _{1}^{1} H_{ij}(\tau,t)^{2} \,d\tau \,dt \leq 1\), since no more energy can be scattered than is transmitted.
Hilbert space of wavevectors
We can now write the original inputoutput relation given in (2) and (3) as
The channel model of (7) and (8) is expressed in the array domain, that is the transmit and receive signals are expressed as the current distributions excited along the array. Just as one can simplify a signal processing problem by leveraging the Fourier integral to transform from the time domain to the frequency domain, we can leverage the transmit and receive array responses to transform the problem from the array domain to the wavevector domain. In other words, we can express the transmit and receive signals as field distributions over direction rather than current distributions over position along the array. In fact, for our case of the unipolarized linear array, the transmit and receive array responses are the Fourier and inverseFourier integral kernels, respectively.
Let \(\mathcal {T}_{j}\) be the space of all field distributions that transmitter T _{ j }’s array of length \({L}_{T_{j}}\) can radiate towards the available scattering clusters, \(\Psi _{T_{jj}}\cup \Psi _{T_{ij}}\) (both signalofinterest and selfinterference). In the vernacular of [24], \(\mathcal {T}_{j}\) is the space of field distributions arraylimited to \({L}_{T_{j}}\) and wavevectorlimited to \(\Psi _{T_{jj}}\cup \Psi _{T_{ij}}\). To be precise, define \(\mathcal {T}_{j}\) to be the Hilbert space of all squareintegrable functions \(X_{j}:\Psi _{T_{jj}}\cup \Psi _{T_{ij}}\rightarrow \mathbb {C}\), that can be expressed as
for some \(x_{j}(p),\ p\in [{L}_{T_{j}},{L}_{T_{j}}]\phantom {\dot {i}\!}\). The inner product defined for this Hilbert Space between two member functions, \(\phantom {\dot {i}\!}U_{j},V_{j}\in \mathcal {T}_{j}\), is the usual inner product: \( \langle U_{j},V_{j}\rangle = \int _{\Psi _{T_{jj}}\cup \Psi _{T_{ij}}} U_{j}(t)V_{j}^{*}(t)\, dt. \) Likewise, let \(\mathcal {R}_{i}\) be the space of field distributions that can be incident on receiver R _{ i } from the available scattering clusters, \(\phantom {\dot {i}\!}\Psi _{R_{ii}}\cup \Psi _{R_{ij}}\), and resolved by an array of length \({L}_{R_{i}}\). More precisely, \(\mathcal {R}_{i}\) is the Hilbert space of all squareintegrable functions \(Y_{i}:\Psi _{R_{ii}}\cup \Psi _{R_{ij}} \rightarrow \mathbb {C}\), that can be expressed as
for some \(y_{i}(q),\ q\in [{L}_{R_{i}},{L}_{R_{i}}]\phantom {\dot {i}\!}\), with the same inner product. From [24], we know that the dimension of these arraylimited and wavevectorlimited transmit and receive spaces are, respectively,
We can define the scattering integrals in (7) and (8) as operators mapping from one Hilbert space to another. Define the operator \(\mathsf {H}_{ij}:\mathcal {T}_{j}\rightarrow \mathcal {R}_{i}\) by
We can now write the channel model of (7) and (8) in the wavevector domain as
where \(X_{j} \in \mathcal {T}_{j}\), for j=1,2 and \(Y_{i}, Z_{i} \in \mathcal {R}_{i}\) for i=1,2. The following lemma states key properties of the scattering operators in (12–13) that we will leverage in our analysis.
Lemma 1
The scattering operators H _{ ij }, (i,j)∈{(1,1),(2,2),(1,2)} have the following properties:

1.
The scattering operator, \(\mathsf {H}_{ij}: \mathcal {T}_{j}\rightarrow \mathcal {R}_{i}\), is a compact operator.

2.
The dimension of the range of the scattering operator, dim R(H _{ ij })≡dim N(H _{ ij })^{⊥}, (i.e., the dimension of the space orthogonal to the operator’s nullspace) is given by \(\phantom {\dot {i}\!}\text {dim}\,R(\mathsf {H}_{ij}) = 2\,\text {min}\{{L}_{T_{j}} \Psi _{T_{ij}}, {L}_{R_{i}} \Psi _{R_{ij}} \}. \)

3.
There exists a singular system \(\left \{\sigma _{ij}^{(k)}, U_{ij}^{(k)}, V_{ij}^{(k)}\right \}_{k=1}^{\infty }\) for scattering operator H _{ ij }, where the singular value \(\sigma _{ij}^{(k)}\) is nonzero if and only if \(k\leq 2\,\text {min}\{{L}_{T_{j}} \Psi _{T_{ij}}, {L}_{R_{i}} \Psi _{R_{ij}} \}\).
Proof
Property 1 holds because H _{ ij }(·,·), the kernel of integral operator H _{ ij }, is square integrable, and an integral operator with a square integrable kernel is compact (see Theorem 8.8 of [32]). Property 2 is just a restatement of the main result of [24]. Property 3 follows from the first two properties: The compactness of H _{ ij }, established in Property 1, implies the existence of a singular system, since there exists a singular system for any compact operator (see Section 16.1 of [32]). Property 2 implies that only the first \(2\,\text {min}\{{L}_{T_{j}} \Psi _{T_{ij}}, {L}_{R_{i}} \Psi _{R_{ij}} \}\) of the singular values will be nonzero, since the \(\left \{U_{ij}^{(k)}\right \}\) corresponding to nonzero singular values form a basis for R(H _{ ij }), which has dimension \(2\,\text {min}\{{L}_{T_{j}} \Psi _{T_{ij}}, {L}_{R_{i}} \Psi _{R_{ij}} \}\). See Lemma 5 in Appendix B for a description of the properties of singular systems for compact operators, or see Section 2.2 of [33] or Section 16.1 of [32] for a thorough treatment. □
Spatial degreesoffreedom analysis
We now give the main result of the paper: a characterization of the spatial degreesoffreedom region for the PBT channel model applied to a fullduplex base station with uplink and downlink flows.
Theorem 1
Let d _{1} and d _{2}, respectively, denote the spatial degrees of freedom of the uplink data flow from T _{1} to R _{1}, and the downlink data flow from T _{2} to R _{2}. The spatial degreesoffreedom region, \(\mathcal {D}_{\mathsf {FD}}\), of the threenode fullduplex channel is the convex hull of all spatial degreesoffreedom tuples, (d _{1},d _{2}), satisfying
The degreesoffreedom region characterized by Theorem 1, \(\mathcal {D}_{\mathsf {FD}}\), is the pentagonshaped region shown in Fig. 4. Figure 5 a shows a geometric interpretation of the parameters in Theorem 1. The achievability part of Theorem 1 is given in Section 3.1, and the converse is given in Section 3.2.
Achievability
Overview of achievability proof: Before launching into the full proof, we would like to give a brief sketch of the achievability of corner point (d1′,d2′) of the degreesoffreedom region \(\mathcal {D}_{\mathsf {FD}}\) shown in Fig. 4. The steps for achieving the degreesoffreedom tuple \((d_{1}', d_{2}') = (d_{1}^{\mathsf {max}}, d_{\mathsf {sum}}^{\mathsf {max}}  d_{1}^{\mathsf {max}})\) are illustrated in Fig. 5 b.

1.
First, the uplink transmitter, T _{1}, transmits the maximum number of data streams that the uplink channel will support, \(d_{1}^{\mathsf {max}} = 2\,\text {min} ({L}_{T_{1}} \Psi _{T_{11}}, {L}_{R_{1}} \Psi _{R_{11}})\) (illustrated by blue arrows in Fig. 5 b). The base station downlink transmitter, T _{2}, must then structure its transmit signal such that it does not interfere with the base station receiver’s reception of these \(d_{1}^{\mathsf {max}}\) data streams, as is described in the following steps.

2.
Second, the base station transmitter, T _{2}, transmits as many data streams as can be supported in the interval \(\Psi _{T_{22}} \setminus \Psi _{T_{12}}\) (illustrated by red arrows in Fig. 5 b), which is the interval over which signal will couple to the downlink user R _{2}, but will not present any selfinterference to the base station’s own receiver R _{1}.

3.
Third, the base station transmits as many data streams as possible in the interval \(\Psi _{T_{22}} \cap \Psi _{T_{12}}\) while ensuring that the selfinterference is only incident on the base station receiver, R _{1} over the interval \(\Psi _{R_{11}} \setminus \Psi _{R_{12}}\) (illustrated by green arrows in Fig. 5 b), which is the interval over which no uplink signal form T _{1} will be incident on receiver R _{1}. This step occupies a majority of the proof.
The final step in the achievability proof is to show that if the transmission strategies described in steps 1–3 are employed, that the receivers, R _{1} and R _{2}, can successfully recover the d _{1} and d _{2}dimensional data streams, respectively.
Full achievability proof: We establish achievability of \(\mathcal {D}_{\mathsf {FD}}\) by way of two lemmas. The first lemma shows the achievability of two specific spatial degreesoffreedom tuples, and the second shows that these tuples are indeed the corner points of \(\mathcal {D}_{\mathsf {FD}}\).
Lemma 2
The spatial degreeoffreedom tuples (d1′,d2′) and (d1″,d2″), given below, are achievable:
where the terms \(\phantom {\dot {i}\!}d_{T_{2}}\), \(\phantom {\dot {i}\!}\delta _{T_{2}}d_{R_{1}}\), and \(\phantom {\dot {i}\!}\delta _{R_{1}}\) are given in (17–20) within the table at the bottom of the page.
Proof
Due to the symmetry of the problem, it suffices to demonstrate achievability of only the first spatial degreeoffreedom pair in Lemma 2, (d1′,d2′), as the second pair, (d1″,d2″), follows from symmetry. Thus we seek to prove the achievability of the tuple (d1′,d2′) given in (1718). We will show achievability of (d1′,d2′) in the case where \({L}_{T_{1}} \Psi _{T_{11}} \geq {L}_{R_{1}} \Psi _{R_{11}}\), for which
where
Achievability of (d1′,d2′) in the \({L}_{T_{1}} \Psi _{T_{11}} < {L}_{R_{1}} \Psi _{R_{11}}\) case is analogous.
We now begin the steps to show achievability of (25) and (26). □
Defining key subspaces
We first define key subspaces of the transmit and receive wavevector spaces (\(\mathcal {T}_{1}\), \(\mathcal {T}_{2}\), \(\mathcal {R}_{1}\), and \(\mathcal {R}_{2}\)) that will be crucial in demonstrating achievability.
Subspaces of \(\boldsymbol{\mathcal {T}}_{2}\): Recall that \(\mathcal {T}_{2}\) is the space of all field distributions that can be radiated by the base station transmitter, T _{2}, in the direction of the scatterer intervals, \(\Psi _{T_{22}} \cup \Psi _{T_{12}}\), (both signalofinterest and selfinterference). Let \(\mathcal {T}_{22\setminus 12} \subseteq \mathcal {T}_{2}\) be the subspace of field distributions that can be transmitted by T _{2}, which are nonzero only in the interval \(\Psi _{T_{22}}\setminus \Psi _{T_{12}}\),
More intuitively, \(\mathcal {T}_{22\setminus 12}\) is the space of transmissions from the base station which couple only to the intended downlink user, and do not couple back to the base station receiver as selfinterference. Similarly let \(\mathcal {T}_{12} \subseteq \mathcal {T}_{2}\) be the subspace of functions that are only nonzero in the interval \(\Psi _{T_{12}}\),
that is, the space of base station transmissions which do couple to the base station receiver as selfinterference. Finally, let \(\mathcal {T}_{22\cap 12}\subseteq \mathcal {T}_{12} \subseteq \mathcal {T}_{2}\) be the subspace of field distributions that are nonzero only in the interval \(\Psi _{T_{22}}\cap \Psi _{T_{12}}\),
the space of base station transmission which couple both to the downlink user and to the base station receiver. From the result of [24], we know that the dimension of each of these transmit subspaces of \(\mathcal {T}_{1}\) is as follows:
Definition 1
We say that Hilbert space \(\mathcal {A}\) is the orthogonal direct sum of Hilbert spaces \(\mathcal {B}\) and \(\mathcal {C}\) if any \(a\in \mathcal {A}\) can be decomposed as a=b+c, for some \(b\in \mathcal {B}\) and \(c \in \mathcal {C}\), where a and b are orthogonal. We use the notation \(\mathcal {A} = \mathcal {B} \oplus \mathcal {C}\) to denote that A is the orthogonal direct sum of \(\mathcal {B}\) and \(\mathcal {C}\).
One can check that \(\mathcal {T}_{12}\) and \(\mathcal {T}_{22\setminus 12}\) are constructed such that they form an orthogonal direct sum for space \(\mathcal {T}_{2}\):
thus any \(X_{2} \in \mathcal {T}_{2}\) can be written as \(\phantom {\dot {i}\!}X_{2} = X_{2_{\mathsf {Orth}}} + X_{2_{\mathsf {Int}}}\), for some \(\phantom {\dot {i}\!}X_{2_{\mathsf {Orth}}}\in \mathcal {T}_{22\setminus 12}\) and \(\phantom {\dot {i}\!}X_{2_{\mathsf {Int}}}\in \mathcal {T}_{12}\), such that \(\phantom {\dot {i}\!}X_{2_{\mathsf {Orth}}} \perp X_{2_{\mathsf {Int}}}.\) By the construction of \(\mathcal {T}_{22\setminus 12}\), \(\phantom {\dot {i}\!}\mathsf {H}_{12}X_{2_{\mathsf {Orth}}} = 0\), since \(H_{12}(\tau,t) = 0\forall \, t\notin \Psi _{T_{12}}\phantom {\dot {i}\!}\) and \(\phantom {\dot {i}\!}X_{2_{\mathsf {Orth}}}\in \mathcal {T}_{22\setminus 12}\) implies \(\phantom {\dot {i}\!}X_{2_{\mathsf {Orth}}}(t) = 0\ \forall \ t \in \Psi _{T_{12}}\). In other words, \(\phantom {\dot {i}\!}X_{2_{\mathsf {Orth}}}\in \mathcal {T}_{22\setminus 12}\) is zero everywhere the integral kernel H _{12}(τ,t) is nonzero. Thus, any transmitted field distribution that lies in the subspace \(\mathcal {T}_{22\setminus 12}\) will not present any interference to R _{2}.
Subspaces of \(\boldsymbol{\mathcal {T}}_{1}\): Recall that \(\mathcal {T}_{1}\) is the space of all field distributions that can be radiated by the uplink user transmitter, T _{1}, towards the available scatterers. Let \(\mathcal {T}_{11} \subseteq \mathcal {T}_{1}\) be the subspace of field distributions that can be transmitted by T _{1}’s continuous linear array of length \({L}_{T_{1}}\) which are nonzero only in the interval \(\Psi _{T_{11}}\), more precisely
More intuitively, \(\mathcal {T}_{11}\) is the space of transmissions from the uplink user which will couple to the base station receiver. From the result of [24], we know that
Note that \(\mathcal {T}_{11}=\mathcal {T}_{1}\), since we have assumed \(\Psi _{T_{21}} = \emptyset \). Although \(\mathcal {T}_{11}\) is thus redundant, we define it for notational consistency.
Subspaces of \(\boldsymbol{\mathcal {R}}_{1}\): Recall that \(\mathcal {R}_{1}\) is the space of all incident field distributions that can be resolved by the base station receiver, R _{1}. Let \(\mathcal {R}_{12} \subseteq \mathcal {R}_{1}\) to be the subspace of received field distributions which are nonzero only for \(\tau \in \Psi _{R_{12}}\), that is
Less formally, \(\mathcal {R}_{12}\) is the space of receptions at the base station which could have emanated from the base stations own transmitter. Similarly, let \(\mathcal {R}_{12\setminus 11}\subseteq \mathcal {R}_{12} \subseteq \mathcal {R}_{1}\) be the subspace of received field distributions that are only nonzero for \(\tau \in \Psi _{R_{12}} \setminus \Psi _{R_{11}}\),
Less formally, \(\mathcal {R}_{12\setminus 11}\) is the space of receptions at the base station which could have emanated from the base station transmitter, but could not have emanated from the uplink user. Finally, define \(\mathcal {R}_{11} \subseteq \mathcal {R}_{1}\) to be the subspace of received field distributions that are nonzero only for \(\tau \in \Psi _{R_{11}}\),
the space of base station receptions which could have emanated from the intended uplink user. Note that \( \mathcal {R}_{1} = \mathcal {R}_{11} \oplus \mathcal {R}_{12\setminus 11}. \) From the result of [24], we know the dimension of each of the above basestation receive subspaces is as follows:
Subspaces of \(\boldsymbol{\mathcal {R}}_{2}\): Recall that \(\mathcal {R}_{2}\) is the space of all incident field distributions that can be resolved by the downlink user receiver, R _{2}. Let \(\mathcal {R}_{22} \subseteq \mathcal {R}_{2}\) to be the subspace of received field distributions which are nonzero only for \(\tau \in \Psi _{R_{22}}\), that is
Note that \(\mathcal {R}_{22}=\mathcal {R}_{2}\), since we have assumed \(\Psi _{R_{21}} = \emptyset \). Although \(\mathcal {R}_{22}\) is thus redundant, we define it for notational consistency. By substituting the subspace dimensions given above into (25) and (27), we can restate the degreeoffreedom pair whose achievability we are establishing as
Now that we have defined the relevant subspaces, we can show how these subspaces are leveraged in the transmission and reception scheme that achieves the spatial degreesoffreedom tuple (d1′,d2′).
Spatial processing at each transmitter/receiver
We now give the transmission schemes at each transmitter and the recovery schemes at each receiver.
Processing at uplink user transmitter, T _{ 1 } : Recall that \(d_{1}' = \text {dim} \mathcal {R}_{11}\) is the number of spatial degreesoffreedom we wish to achieve for Flow _{1}, the uplink flow. Let \(\left \{ \chi _{1}^{(k)} \right \}_{k=1}^{d_{1}'},\ \chi _{1}^{(i)} \in \mathbb {C},\) be the d1′ symbols that T _{1} wishes to transmit to R _{1}. We know from Lemma 1 that there exists a singular value expansion for H _{11}, so let \(\left \{\sigma _{11}^{(k)}, U_{11}^{(k)}, V_{11}^{(k)}\right \}_{k=1}^{\infty }\) be a singular system for the operator \(\mathsf {H}_{11}: \mathcal {T}_{1}\rightarrow \mathcal {R}_{1}\) (see Lemma 5 in Appendix B for the definition of a singular system).
Note that the functions \( \left \{ V_{11}^{(k)} \right \}_{k=1}^{\text {dim} \mathcal {T}_{1}}\) form an orthonormal basis for \(\mathcal {T}_{1}\), and since \(d_{1}' = \text {dim} \mathcal {R}_{11} \leq \text {dim} \mathcal {T}_{1}\), there are at least as many such basis functions as there are symbols to transmit.
We construct X _{1}, the transmit wavevector signal transmitted by T _{1}, as
Processing at the base station transmitter, T _{ 2 } :
Recall that \(d_{2}' =\text {min}\left \{d_{T_{2}},2{L}_{R_{2}} \Psi _{R_{22}}\right \}\), where \(d_{T_{2}}\) is given in (27), is the number of spatial degreesoffreedom we wish to achieve for Flow _{2}, the downlink flow. Let \(\left \{ \chi _{2}^{(k)} \right \}_{k=1}^{d_{2}'}\) be the d2′ symbols that T _{2} wishes to transmit to R _{2}. We split the T _{2} transmit signal into the sum of two orthogonal components, \(X_{2_{\mathsf {Orth}}} \in \mathcal {T}_{22\setminus 12} \) and \(X_{2_{\mathsf {Int}}} \in \mathcal {T}_{12}\), so that the wavevector signal transmitted by T _{2} is
Recall that \(\phantom {\dot {i}\!}X_{2_{\mathsf {Orth}}}\in \mathcal {T}_{22\setminus 12}\) implies \(\mathsf {H}_{12}X_{2_{\mathsf {Orth}}} = 0\phantom {\dot {i}\!}\). Thus, we can construct \(\phantom {\dot {i}\!}X_{2_{\mathsf {Orth}}} \in \mathcal {T}_{22\setminus 12}\) without regard to the structure of H _{12}. Let \(\left \{ Q_{22\setminus 12}^{(i)} \right \}_{i=1}^{\text {dim} \mathcal {T}_{22\setminus 12}}\) be an arbitrary orthonormal basis for \(\mathcal {T}_{22\setminus 12}\), and let
be the number of symbols that T _{2} will transmit along \(X_{2_{\mathsf {Orth}}}\). We construct \(X_{2_{\mathsf {Orth}}}\) as
Recall that there are d2′ total symbols that T _{2} wishes to transmit, and we have transmitted \(d_{2_{\mathsf {Orth}}}'\) symbols along \(X_{2_{\mathsf {Orth}}}\), thus there are d2′−d2_{ Orth }′ symbols remaining to transmit along \(X_{2_{\mathsf {Int}}}\). Let
Now since \(\phantom {\dot {i}\!}X_{2_{\mathsf {Int}}}\in \mathcal {T}_{12}\), \(\phantom {\dot {i}\!}\mathsf {H}_{12}X_{2_{\mathsf {Int}}}\) is nonzero in general, \(\phantom {\dot {i}\!}X_{2_{\mathsf {Int}}}\) will present interference to R _{1}. Therefore, we must construct \(\phantom {\dot {i}\!}X_{2_{\mathsf {Int}}}\) such that it communicates \(\phantom {\dot {i}\!}d_{2_{\mathsf {Int}}}'\) symbols to R _{2}, without impeding R _{1} from recovering the d1′ symbols transmitted from T _{1}. Thus, the construction of \(\phantom {\dot {i}\!}X_{2_{\mathsf {Int}}}\in \mathcal {T}_{12}\) will indeed depend on the structure of H _{12}.
First consider the case where \(\text {dim} \mathcal {T}_{12} \leq \text {dim} \mathcal {R}_{12}\). In this case, Eq. (50), which gives the number of symbols that must be transmitted along \(X_{2_{\mathsf {Int}}}\), simplifies to \(d_{2_{\mathsf {Int}}}' = \text {min} \left \{\text {dim} \mathcal {T}_{22\cap 12}, \text {dim} \mathcal {R}_{12\setminus 11}, (\text {dim} \mathcal {R}_{22}  \text {dim} \mathcal {T}_{22\setminus 12})^{+}\right \}\). Let \(\left \{\sigma _{12}^{(k)}, U_{12}^{(k)}, V_{12}^{(k)}\right \}_{k=1}^{\infty }\) be a singular system for H _{12}. From Property 3 of Lemma 1, we know that \(\sigma _{12}^{(k)}\) is zero for \(k>\text {dim} \mathcal {T}_{12}\) and nonzero for \(k\leq \text {dim} \mathcal {T}_{12}\). Note that \( \left \{ V_{12}^{(k)} \right \}_{k=1}^{\text {dim} \mathcal {T}_{12}}\) is an orthonormal basis for \(\mathcal {T}_{12}\). In the case of \(\text {dim} \mathcal {T}_{12} \leq \text {dim} \mathcal {R}_{12}\) (the case for which are constructing \(X_{2_{\mathsf {Int}}}\)), we have
so that there are at least as many \(V_{12}^{(k)}\)’s as there are symbols to transmit along \(X_{2_{\mathsf {Int}}}\). We construct \(X_{2_{\mathsf {Int}}}\) as
Now we will consider the construction of \(X_{2_{\mathsf {Int}}}\) for the other case where \(\text {dim} \mathcal {T}_{12} > \text {dim} \mathcal {R}_{12}\). In the \(\text {dim} \mathcal {T}_{12} > \text {dim} \mathcal {R}_{12}\) case Eq. (50), which gives the number of symbols that must be transmitted along \(X_{2_{\mathsf {Int}}}\), simplifies to
Note that the signal that R _{1} receives from T _{1} will lie only in \(\mathcal {R}_{11}\). Thus, if we can ensure that the signal from T _{2} falls in the orthogonal space, \(\mathcal {R}_{12\setminus 11}\), then we have avoided interference. Let \(\mathsf {H}''_{12}:\mathcal {T}_{12}\rightarrow \mathcal {R}_{12}\) be the restriction of \(\mathsf {H}_{12}:\mathcal {T}_{2}\rightarrow \mathcal {R}_{1}\) to domain \(\mathcal {T}_{12}\) and codomain \(\mathcal {R}_{12}\). We consider the constriction, H12″, instead of H _{12} so that the preimage under H12″ is a subset of \(\mathcal {T}_{12}\), so that any functions within this preimage have not already been used in constructing \(X_{2_{\mathsf {Orth}}}\). We can characterize the requirement that Y _{1}(τ) not be interfered over \(\tau \in \Psi _{R_{11}}\) as \(\mathsf {H}^{\prime \prime }_{12}X_{2_{\mathsf {Int}}} \in \mathcal {R}_{12\setminus 11},\) or equivalently \(X_{2_{\mathsf {Int}}} \in \mathcal {P}_{12\setminus 11},\) where
is the preimage of \(\mathcal {R}_{12\setminus 11}\) under H12″. Thus, any function in \(\mathcal {P}_{12\setminus 11}\) can be used for signaling to R _{2} without interfering X _{1} at R _{1}. The number of symbols that can be transmitted will thus depend on the dimension of this interferencefree preimage. Corollary 1 in the appendix states that if \(\mathsf {C}:\mathcal {X}\rightarrow \mathcal {Y}\) is a linear operator with closed range, and \(\mathcal {S}\) is a subspace of the range of C, \(\mathcal {S} \subset R(\mathsf {C})\), then \(\text {dim} {\mathsf {C}}^{\leftarrow }(\mathcal {S}) = \text {dim} N(\mathsf {C}) + \text {dim}(\mathcal {S})\). Note that R(H12″) has finite dimension (namely 2 \(\text {min}\left \{{L}_{T_{2}} \Psi _{T_{12}},{L}_{R_{1}}\Psi _{R_{12}} \right \}<\infty \)), and since any finite dimensional subspace of a normed space is closed, R(H12″) is closed. Further, note that since we are considering the case where \(\text {dim} \mathcal {T}_{12} > \text {dim} \mathcal {R}_{12}\), it is easy to see that \(R(\mathsf {H}^{\prime \prime }_{12}) = \mathcal {R}_{12}\), which implies \(\mathcal {R}_{12\setminus 11}\subseteq R(\mathsf {H}^{\prime \prime }_{12})\), since \(\mathcal {R}_{12\setminus 11}\subseteq \mathcal {R}_{12}\) by construction. Thus, the linear operator \(\mathsf {H}^{\prime \prime }_{12}:\mathcal {T}_{12}\rightarrow \mathcal {R}_{12}\) and the subspace \(\mathcal {R}_{12\setminus 11}\) satisfy the conditions on operator C and subspace \(\mathcal {S}\), respectively, in the hypothesis of Corollary 1. Thus, we can apply Corollary 1 to show that, when \(\text {dim} \mathcal {T}_{12} > \text {dim} \mathcal {R}_{12}\), the dimension of \(\mathcal {P}_{12\setminus 11}\) is given by
Therefore, the dimension of \(\mathcal {P}_{12\setminus 11}\), the preimage of \(\mathcal {R}_{12\setminus 11}\) under H12″, is indeed large enough to allow T _{2} to transmit the remaining \(d_{2_{\mathsf {Int}}}'\) symbols along the basis functions of \(\text {dim}\mathcal {P}_{12\setminus 11}\). Let \(\ \left \{P_{12}^{(i)} \right \}_{i=1}^{\text {dim}\mathcal {P}_{12\setminus 11}}\) be an orthonormal basis for \(\mathcal {P}_{12\setminus 11}\). Then, we construct \(X_{2_{\mathsf {Int}}}\) as
In summary, combining all cases we see that the wavevector transmitted by T _{2} is
Now that we have constructed X _{1}, the uplink wavevector signal transmitted on the the uplink user, and X _{2}, the wavevector signal transmitted on the dowlink by the base station, we show how the base station receiver, R _{1} and the downlink user R _{2} process their received signals to detect the original informationbearing symbols.
Processing at the base station receiver, R _{ 1 } : We need to show that R _{1} can obtain at least \(d_{1}' = \text {dim} \mathcal {R}_{11}\) independent linear combinations of the d1′ symbols transmitted from T _{1}, and that each of these linear combinations are corrupted only by noise, and not interference from T _{2}.
In the case where \(\text {dim} \mathcal {T}_{12} > \text {dim} \mathcal {R}_{12}\), T _{2} constructed X _{2} such that H _{12} X _{2} is orthogonal to any function in \(\mathcal {R}_{11}\). Therefore, R _{1} can eliminate interference from T _{2} by simply projecting Y _{1} onto \(\mathcal {R}_{11}\) to recover the \(\text {dim} \mathcal {R}_{11}\) linear combinations it needs. We now formalize this projection onto \(\mathcal {R}_{11}\). Recall that the set of leftsingular functions of H _{11}, \(\left \{U_{11}^{(l)} \right \}_{l=1}^{\text {dim} \mathcal {R}_{11}},\) form an orthonormal basis for \(\mathcal {R}_{11}\). In the case where \(\text {dim} \mathcal {T}_{12} > \text {dim} \mathcal {R}_{12}\), receiver R _{2} constructs the set of complex scalars \(\left \{ \xi _{1}^{(l)} \right \}_{l=1}^{\text {dim} \mathcal {R}_{11}},\quad \xi _{1}^{(l)} = \left \langle Y_{1}, U_{11}^{(l)} \right \rangle.\) One can check that result of each of these projections is
and thus obtains each of the \(d_{1}'=\text {dim} \mathcal {R}_{11}\) linear combinations of the intended symbols corrupted only by noise, as desired. Moreover, in this case the obtained linear combinations are already diagonalized, with the lth projection only containing a contribution from the lth desired symbol.
In the case where \(\text {dim} \mathcal {T}_{12} \leq \text {dim} \mathcal {R}_{12}\), H _{12} X _{2} in general will not be orthogonal to every function in \(\mathcal {R}_{11}\), and some slightly more sophisticated processing must be performed to decouple the interference from the signal of interest. First, R _{1} can recover \(\text {dim} \mathcal {R}_{11\setminus 12}\) interferencefree linear combinations by projecting its received signal, Y _{1}, onto \(\mathcal {R}_{11\setminus 12}\). Let \(\left \{J_{11\setminus 12}^{(l)}\right \}_{l=1}^{\text {dim} \mathcal {R}_{11\setminus 12}}\) be an orthonormal basis for \(\mathcal {R}_{11\setminus 12}\). Receiver R _{1} forms a set of complex scalars
Note that each \(J_{11\setminus 12}^{(l)}\) will be orthogonal to H _{12} X _{2} for any X _{2} since each \(J_{11\setminus 12}^{(l)} \in \mathcal {R}_{11\setminus 12}\), and \(\mathsf {H}_{12}X_{2} \in \mathcal {R}_{12}\) for any X _{2}, and \(\mathcal {R}_{11\setminus 12}\) is the orthogonal complement of \(\mathcal {R}_{12}\). Therefore, each \(\xi _{1}^{(l)}\) will be interference free, i.e., will be a linear combination of the symbols \(\left \{\chi _{1}^{\left (l\right)}\right \}_{l=1}^{d_{1}'}\) plus noise, and will contain no contribution from the \(\left \{\chi _{2}^{\left (l\right)}\right \}_{l=1}^{d_{2}'}\) symbols. One can check that these \(\text {dim}\, \mathcal {R}_{11\setminus 12}\) projections result in
It remains to obtain \(d_{1}'  \text {dim} \,\mathcal {R}_{11\setminus 12} = \text {dim} \,\mathcal {R}_{11}  \text {dim} \,\mathcal {R}_{11\setminus 12} = \text {dim}\, \mathcal {R}_{11\cap 12}\) more independent and interferencefree linear combinations of T _{1}’s symbols so that R _{1} can solve the system and recover the symbols. Receiver R _{1} will obtain these linear combinations via a careful projection onto a subspace of \(\mathcal {R}_{12}\) (which is the orthogonal complement of \(\mathcal {R}_{11\setminus 12}\), the space onto which we have already projected Y _{1} to obtain the first \(\text {dim}\, \mathcal {R}_{11\setminus 12}\) linear combinations). Recall that the set of leftsingular functions of H _{12}, \(\left \{U_{12}^{(l)} \right \}_{l=1}^{\text {dim}\, \mathcal {R}_{12}}\), form an orthonormal basis for \(\mathcal {R}_{12}\). Receiver R _{1} obtains the remaining \(\mathcal {R}_{11\cap 12}\) linear combinations by projecting Y _{1} onto the last \(\text {dim}\, \mathcal {R}_{11\cap 12}\) of these basis functions, forming \(\left \{ \xi _{1}^{(l)}\right \}_{l=\text {dim}\, \mathcal {R}_{11\setminus 12}+1}^{\text {dim}\, \mathcal {R}_{11}}\) by computing
We compute the terms of Eq. (64) individually. The contribution of T _{1}’s transmit wavevector is
In the first step, (65), we use the singular function decomposition of H _{11}. In the second step, (66), we plug in the construction of X _{1} given in 46, and in the last step, (67), we leverage the fact that \(\sum _{i} \chi _{1}^{\left (i\right)} \left \langle V_{11}^{(m)}, V_{11}^{(i)} \right \rangle = \chi _{1}^{\left (m\right)}\), due to the orthonormality of the right singular functions. The contribution of T _{2}’s interfering wavevector is
In step (68) above, we use the fact that \(\phantom {\dot {i}\!}\mathsf {H}_{12} X_{2_{\mathsf {Orth}}} = 0\) by the construction of \(X_{2_{\mathsf {Orth}}}\). Step (69) uses the singular function expansion of H _{12}, step (70) substitutes the construction of \(X_{2_{\mathsf {Int}}}\), step (71) rearranges terms and step (72) leverages the orthonormality of the right singular functions. In the last step, (74), we have leveraged that when \(\text {dim}\, \mathcal {T}_{12}\leq \text {dim}\, \mathcal {R}_{12} \), \(d_{2_{\mathsf {Int}}}' \leq \text {dim}\, \mathcal {R}_{12\setminus 11}\) (see Eq. 50), which means the largest value of i in the summation, \(d_{2_{\mathsf {Int}}}'\), is smaller that the smallest value of \(\text {dim}\, \mathcal {R}_{12}  k\) under consideration, \(\text {dim}\, \mathcal {R}_{12}  \mathcal {R}_{11\cap 12} + 1 = \text {dim}\, \mathcal {R}_{12\setminus 11} + 1\), so that the deltafunction \(\delta _{(i,\text {dim}\, \mathcal {R}_{12}  k)}\) will never evaluate to one. Substituting (67) and (74) back into (64) shows that the output symbols obtained by projecting Y _{1} onto the last \(\mathcal {R}_{11\cap 12}\) functions of \(\left \{U_{12}^{(l)} \right \}_{l=1}^{\text {dim}\, \mathcal {R}_{12}}\) are
Combining the processing in all cases, we see that receiver R _{1} has formed a set of d1′ complex scalars \(\left \{ \xi _{1}^{(l)}\right \}_{l=1}^{d_{1}'}\), such that
where
and
Thus, as desired, in all cases the base station receiver R _{1} is able to obtain d1′ interferencefree linear combinations of the d1′ symbols from the uplink user transmitter T _{1}. Now, we move to the processing at the downlink user receiver.
Processing at R _{ 2 }: We wish to show that the downlink receiver, R _{2}, can recover the d2′ symbols transmitted by the base station transmitter, T _{ w }. Let \(\left \{\sigma _{22}^{(k)}, U_{22}^{(k)}, V_{22}^{(k)}\right \}\) be a singular system for the operator H _{22}, and let \(r_{22}\equiv \text {min}\left \{2{L}_{T_{2}} \Psi _{T_{22}},2{L}_{R_{2}} \Psi _{R_{22}}\right \}\). From Property 2 of Lemma 1, we know that \(\sigma _{22}^{(k)}\) is zero for all k>r _{22} and nonzero for k≤r _{22}, so that
One can check that
where
and
Reducing to parallel pointtopoint vector channels
The above processing at each transmitter and receiver has allowed the receivers R _{1} and R _{2} to recover the symbols
respectively, where the linear combination coefficients, \(a_{1}^{(lm)}\) and \(a_{2}^{(lm)}\), are given in (77) and (81), respectively, and the additive noise on each of the recovered symbols, \(\zeta _{1}^{(l)}\) and \(\zeta _{2}^{(l)}\), are given in (78) and (82), respectively.
We can rewrite (8384) in matrix notation as
where χ _{1} and χ _{2} are the d1′×1 and d2′×1 vectors of input symbols for transmitters T _{1} and T _{2}, respectively, ζ _{1} and ζ _{2} are the d1′×1 and d2′×1 vectors of additive noise, respectively, and A _{1} and A _{2} are d1′×d1′ and d2′×d2′ square matrices whose elements are taken from \(a_{1}^{(lm)}\) and \(a_{2}^{(lm)}\), respectively. The matrices A _{1} and A _{2} will be full rank for all but a measurezero set of channel response kernels. Also, since each of the \(\zeta _{j}^{(l)}\)’s are linear combinations of Gaussian random variables, the the noise vectors, ζ _{1} and ζ _{2}, are Gaussian distributed. Therefore, the spatial processing has reduced the original channel to two parallel fullrank Gaussian vector channels: the first a d1′×d1′ channel and the second a d2′×d2′ channel, which are well known to have d1′ and d2′ degreesoffreedom, respectively [34]. Therefore, the spatial degreesoffreedom pair (d1′,d2′) is indeed achievable.
Lemma 3
The degreeoffreedom pairs (d1′,d2′) and (d1″,d2″), are the corner points of \(\mathcal {D}_{\mathsf {FD}}\), that is
Proof
Note that it is sufficient to prove only Eq. (87), as Eq. (88) follows by the symmetry of the expressions. It is easy to see that \(d_{1}' = \text {min}\left \{2{L}_{T_{1}} \Psi _{T_{11}}, 2{L}_{R_{1}} \Psi _{R_{11}}\right \} = d_{1}^{\mathsf {max}}\), but it is not so obvious that \(d_{2}' = \text {min}\left \{d_{2}^{\mathsf {max}}, d_{\mathsf {sum}}^{\mathsf {max}}  d_{1}^{\mathsf {max}}\right \}\). However, one can verify that \(d_{2}' = \text {min}\{d_{2}^{\mathsf {max}}, d_{\mathsf {sum}}^{\mathsf {max}}  d_{1}^{\mathsf {max}}\}\) by evaluating the left and righthand sides for all combinations of the conditions
and observing equality in each of the four cases. Table 1 shows the expressions to which d2′ and \(\text {min}\left \{d_{2}^{\mathsf {max}}, d_{\mathsf {sum}}^{\mathsf {max}}  d_{1}^{\mathsf {max}}\right \}\) both simplify in each of the four possible cases. □
Lemmas 2 and 3 show that the corner points of \(\mathcal {D}_{\mathsf {FD}}\), (d1′,d2′) and (d1″,d2″) are achievable. And, thus, all other points within \(\mathcal {D}_{\mathsf {FD}}\) are achievable via time sharing between the schemes that achieve the corner points.
Converse
To establish the converse part of Theorem 1, we must show that the region \(\mathcal {D}_{\mathsf {FD}}\), which we have already shown is achievable, is also an outer bound on the degreesoffreedom, i.e., we want to show that if an arbitrary degreeoffreedom pair (d _{1},d _{2}) is achievable, then \((d_{1},d_{2}) \in \mathcal {D}_{\mathsf {FD}}\). It is easy to see that if (d _{1},d _{2}) is achievable, then the singeuser constraints on \(\mathcal {D}_{\mathsf {FD}}\), given in (14) and (15), must be satisfied as the degreesoffreedom for each flow cannot be more than the pointtopoint degreesoffreedom shown in [24]. Thus, the only step remaining in the converse is to establish an outer bound on the sum degreesoffreedom which coincides with \(d_{\mathsf {sum}}^{\mathsf {max}}\), the sumdegreesoffreedom constraint on the achievable region, \(\mathcal {D}_{\mathsf {FD}}\), given in (16).
Thus, to conclude the converse argument, we will now prove the following Genieaided outer bound on the sum degreesoffreedom which coincides with the sumdegreesoffreedom constraint on the achievable region.
Lemma 4
Sketch of proof: Before diving into the full proof, we would first like to give a brief overview of the steps in the converse proof. Our process for proving Lemma 4 is twofold.

1) First, a genie expands the transmit scattering intervals \(\Psi _{T_{22}}\) and \(\Psi _{T_{12}}\) until the two intervals are fully overlapped, and likewise expands expands \(\Psi _{R_{11}}\) and \(\Psi _{R_{12}}\) until they are fully overlapped, as shown in Fig. 6. To ensure that the net manipulation of the genie can only enlarge \(\mathcal {D}_{\mathsf {FD}}\), the genie also increases the array lengths \({L}_{T_{2}}\) and \({L}_{R_{1}}\) sufficiently for any added interference due to the expansion of \(\Psi _{T_{12}}\) and \(\Psi _{R_{12}}\) to be compensated by the increased array lengths.

2) After the above genie manipulation is performed, the maximum of the T _{2} and R _{1} signaling dimensions are equal to \(d_{\mathsf {sum}}^{\mathsf {max}}\) in constraint (16), and since the scattering intervals are overlapped, the channel model becomes the Hilbert space equivalent of the wellstudied MIMO Zchannel [35, 36]. The Hilbert space analog to the bounding techniques employed in [35, 36] are then leveraged to conclude the converse proof.
Proof
We prove Lemma 4 by way of a Genie that aids the transmitters and receivers by enlarging the scattering intervals and lengthening the antenna arrays in a way that can only enlarge the degreesoffreedom region. Applying the pointtopoint bounds to the Genieaided system in a careful way then establishes the outer bound. Assume an arbitrary scheme achieves the degreesoffreedom pair (d _{1},d _{2}). Thus receivers R _{1} and R _{2} can decode their corresponding messages with probability of error approaching zero. We must show that the assumption of (d _{1},d _{2}) being achievable implies the constraint in Eq. (91).
Let a Genie expand both scattering intervals at T _{2} into the union of the two scattering intervals, that is expand \(\Psi _{T_{22}}\) and \(\Psi _{T_{12}}\) to
Likewise, the Genie expands the scattering intervals at R _{1} into their union, that is expand \(\Psi _{R_{11}}\) and \(\Psi _{R_{12}}\) to
The Genie’s expansion of \(\Psi _{T_{22}}\) to \(\Psi '_{T_{2}}\) can only enlarge the degreesoffreedom region, as T _{2} could simply not transmit in the added interval \(\Psi '_{T_{2}} \setminus \Psi _{T_{22}}\) (i.e., ignore the added dimensions for signaling to R _{2}) to obtain the original scenario. Likewise, expanding \(\Psi _{R_{11}}\) to \(\Psi '_{R_{1}}\) will only enlarge the degreesoffreedom region as R _{1} can ignore the portion of the wavevector received over \(\Psi '_{R_{1}}\setminus \Psi _{R_{11}}\) to obtain the original scenario. However, expanding the interference scattering clusters, \(\Psi _{T_{12}}\) and \(\Psi _{R_{12}}\), to \(\Psi '_{T_{2}}\) and \(\Psi '_{R_{1}}\), respectively, can indeed shrink the degreesoffreedom region due to the additional interference caused by the added overlap with the signalofinterest intervals \(\Psi _{T_{22}}\) and \(\Psi _{R_{22}}\), respectively. We need a final Genie manipulation to compensate for this added interference, so that the net Genie manipulation can only enlarge the degreesoffreedom region. Therefore, in the next step we will have the Genie lengthen the arrays at T _{2} and R _{1} sufficiently to allow any interference introduced by expanding \(\Psi _{T_{12}}\) and \(\Psi _{R_{12}}\), to \(\Psi '_{T_{2}}\) and \(\Psi '_{R_{1}}\), respectively, to be zeroforced without sacrificing any previously available degrees of freedom. Expansion of \(\Psi _{T_{12}}\) to \(\Psi '_{T_{2}} \equiv \Psi _{T_{22}} \cup \Psi _{T_{12}}\) causes the dimension of the interference that T _{2} presents to R _{1} to increase by at most \(2{L}_{T_{2}}\Psi _{T_{22}} \setminus \Psi _{T_{12}}\). Therefore, let the Genie also lengthen R _{1}’s array from \(2{L}_{R_{1}}\) to \(2{L'}_{R_{1}} = 2{L}_{R_{1}} + 2{L}_{T_{2}} \frac {\Psi _{T_{22}} \setminus \Psi _{T_{12}}} {\Psi _{R_{11}} \cup \Psi _{R_{12}}}\), so that the dimension of the total receive space at R _{1}, \(\text {dim}\,\mathcal {R}_{1}\), is increased from \(\text {dim}\,\mathcal {R}_{1} = 2{L}_{R_{1}} \Psi _{R_{11}} \cup \Psi _{R_{12}} \) to
We observe in (95), that the Genie’s lengthening of the T _{2} array by \(2{L}_{T_{2}} \frac {\Psi _{T_{22}} \setminus \Psi _{T_{12}}} {\Psi _{R_{11}} \cup \Psi _{R_{12}}}\) has increased the dimension of R _{1}’s total receive signal space by \( 2{L}_{T_{2}}\Psi _{T_{22}} \setminus \Psi _{T_{12}}\), which is the worst case increase in the dimension of the interference from T _{2} due to expansion of \(\Psi _{T_{12}}\) to \( \Psi _{T_{22}} \cup \Psi _{T_{12}}\). Therefore, the dimension of the subspace of \(\mathcal {R}'_{1}\) which is orthogonal to the interference from T _{2} will be at least as large as in the original orthogonal space of \(\mathcal {R}_{1}\). Thus, the combined expansion of \(\Psi _{T_{12}}\) to \(\Psi '_{T_{2}}\) and lengthening of the R _{1} array to \({L'}_{R_{1}}\) can only enlarge the degreesoffreedom region. Analogously, expansion of \(\Psi _{R_{12}}\) to \(\Psi '_{R_{1}} \equiv \Psi _{R_{11}}\cup \Psi _{R_{12}}\) increases the dimension of \(\mathcal {R}_{12}\), the subspace of R _{1}’s receive space which is vulnerable to interference from T _{2}, by at most \(2{L}_{R_{1}} \Psi _{R_{11}}\setminus \Psi _{R_{12}}\). Therefore, let the Genie lengthen T _{2}’s array from \(2{L}_{T_{2}}\) to \(2{L'}_{T_{2}} = 2{L}_{T_{2}} + 2{L}_{R_{1}} \frac {\Psi _{R_{11}} \setminus \Psi _{R_{12}}} {\Psi _{T_{22}} \cup \Psi _{T_{12}}}\), so that the dimension of the transmit space at T _{2}, \(\text {dim}\,\mathcal {T}_{2}\), is increased from \(\text {dim}\,\mathcal {T}_{2} = 2{L}_{T_{2}} \Psi _{T_{22}} \cup \Psi _{T_{12}} \) to
We see in (99) that the Genie’s lengthening of T _{2}’s array to \(2{L'}_{T_{2}}\) increases the dimension of T _{2}’s transmit signal space by \(2{L}_{R_{1}} \Psi _{R_{11}}\setminus \Psi _{R_{12}}\), which is the worst case increase in the dimension of the subspace of R _{1}’s receive subspace vulnerable to interference from T _{2}. Therefore, T _{1} can leverage these extra \(2{L}_{R_{1}} \Psi _{R_{11}}\setminus \Psi _{R_{12}}\) dimensions to zero force to the subspace of R _{1}’s receive space that has become vulnerable to interference from T _{2} due to the expansion \(\Psi _{R_{12}}\) to \(\Psi '_{R_{1}}\). Thus, the net effect of the Genie’s expansion of T _{2}’s interference scattering interval, \(\Psi _{R_{12}}\), to \(\Psi '_{R_{1}}\) and lengthening of the T _{2} array to \(2{L'}_{T_{2}}\) can only enlarge the degreesoffreedom region.
The Genieaided channel is illustrated in Fig. 6, which emphasizes the fact that the Genie has made the channel fullycoupled in the sense that the signalofinterest scattering and the interference scattering intervals are identical: any direction of departure from T _{2} which scatters to R _{2} also scatters to R _{1}, and any direction of arrival to R _{1} which signal can be received from T _{1} is a direction from which signal can be received from T _{2}. Note that for the Genieaided channel,
which is the outer bound on sum degreesoffreedom that we wish to prove. Thus, if we can show that for the Genieaided channel
then the converse is established. Because the Genieaided channel is now fully coupled, it is similar to the continuous Hilbert space analog of the fullrank discreteantennas MIMO Z interference channel. Thus, the remaining steps in the converse argument are inspired by the techniques used in [35–37] for outer bounding the degreesoffreedom of the MIMO interference channel.
Consider the case in which \(\text {dim} \,\mathcal {T}'_{2} \leq \text {dim}\,\mathcal {R}'_{1}\). Since our Genie has enforced \(\Psi '_{T_{22}} = \Psi '_{T_{12}}\) and we have assumed \(\text {dim}\, \mathcal {T}'_{2} \leq \text {dim}\,\mathcal {R}'_{1}\), receiver R _{1} has access to the entire signal space of T _{2}, i.e., T _{2} cannot zero force to R _{1}. Moreover, by our hypothesis that (d _{1},d _{2}) is achieved, R _{1} can decode the message from T _{1}, and can thus reconstruct and subtract the signal received from T _{1} from its received signal.
Since R _{1} has access to the entire signalspace of T _{2}, after removing the signal from T _{1} the only barrier to R _{1} also decoding the message from T _{2} is the receiver noise process. If it is not already the case, let a Genie lower the noise at receiver R _{1} until T _{2} has a better channel to R _{1} than R _{2} (this can only increase the capacity region since R _{1} could always locally generate and add noise to obtain the original channel statistics). By hypothesis, R _{2} can decode the message from T _{2}, and since T _{2} has a better channel to R _{1} than R _{2}, R _{1} can also decode the message from T _{1}.
Since R _{1} can decode the messages from both T _{1} and T _{2}, we can bound the degreesoffreedom region of the Genieaided channel by the corresponding pointtopoint channel in which T _{1} and T _{2} cooperate to jointly communicate their messages to R _{1}, which has degreesoffreedom \(\text {min}\left (\text {dim}\, \mathcal {T}'_{1} + \text {dim}\,\mathcal {T}'_{2},\ \text {dim}\,\mathcal {R}'_{1}\right)\), which implies that
Now, consider the alternate case in which \(\text {dim}\, \mathcal {T}'_{2}< \text {dim}\,\mathcal {R}'_{1}\). In this case, we let a Genie increase the length of the R _{1} array once more from \(2{L'}_{R_{1}}\) to \(2{L''}_{R_{1}} = 2{L'}_{T_{2}} \frac {\Psi '_{T_{2}}}{\Psi '_{R_{1}}} > 2{L'}_{R_{1}}\), so that the dimension of the receive signal space at R _{1}, which we now call \(\mathcal {R}''_{1}\), is expanded to
Since \(\text {dim}\, \mathcal {R}''_{1} = \text {dim}\, \mathcal {T}'_{2}\) and \(\Psi '_{T_{22}} = \Psi '_{T_{12}}\), R _{1} again has access to the entire transmit signal space of T _{2}, we can use the same argument we leveraged above in the \(\text {dim} \mathcal {T}'_{2} \leq \text {dim}\,\mathcal {R}'_{1}\) case to show that
Combining the bounds in (108) and (111) yields,
thus showing that the sumdegreesoffreedom bound of Eq. (16) in Theorem 1 must hold for any achievable degreeoffreedom pair. □
Combining Lemma 4 with the trivial pointtopoint bounds establishes that the region \(\mathcal {D}_{\mathsf {FD}}\), given in Theorem 1, is an outer bound on any achievable degreesoffreedom pair, thus establishing the converse part of Theorem 1.
Impact on fullduplex design
We have characterized, \(\mathcal {D}_{\mathsf {FD}}\), the degreesoffreedom region achievable by a fullduplex basestation which uses spatial isolation to avoid selfinterference while transmitting the uplink signal while simultaneously receiving. Now, we wish to discuss how this result impacts the operation of fullduplex base stations. In particular, we aim to ascertain in what scenarios fullduplex with spatial isolation outperforms halfduplex, and are there scenarios in which fullduplex with spatial isolation achieves an ideal rectangular degreesoffreedom region (i.e., both the uplink flow and downlink flow achieving their respective pointtopoint degreesoffreedom).
To answer the above questions, we must first briefly characterize \(\mathcal {D}_{\mathsf {HD}}\), the region of degreesoffreedom pairs achievable via halfduplex mode, i.e., by timedivisionduplex between uplink and downlink transmission. It is easy to see that the halfduplex achievable region is characterized by
where α∈[0,1] is the time sharing parameter. Obviously \(\mathcal {D}_{\mathsf {HD}}\subseteq \mathcal {D}_{\mathsf {FD}}\), but we are interested in contrasting the scenarios for which \(\mathcal {D}_{\mathsf {HD}}\subset \mathcal {D}_{\mathsf {FD}}\), and fullduplex spatial isolation strictly outperforms halfduplex time division, and the scenarios for which \(\mathcal {D}_{\mathsf {HD}}=\mathcal {D}_{\mathsf {FD}}\) and halfduplex can achieve the same performance as fullduplex. We will consider two particularly interesting cases: the fully spread environment, and the symmetric spread environment.
Overlapped scattering case
Consider the worst case for fullduplex operation in which the selfinterference backscattering intervals perfectly overlap the forward scattering intervals of the signalsof interest. By “overlapped” we mean that the directions of departure from the base station transmitter, T _{2}, that scatter to the intended downlink receiver, R _{2}, are identical to the directions of departure that backscatter to the base station receiver, R _{1}, as selfinterference, so that \(\Psi _{T_{11}} = \Psi _{T_{12}}\). Likewise, the directions of arrival to the base station receiver, R _{1}, of the intended uplink signal from T _{1} are identical to the directions of arrival of the backscattered selfinterference from T _{2}, so that \(\Psi _{R_{22}} = \Psi _{T_{12}}\). To reduce the number of variables in the degreesoffreedom expressions, we assume each of the scattering intervals are of size Ψ, so that \( {\Psi _{T_{11}} \,=\, \Psi _{R_{11}} \,=\, \Psi _{T_{22}} = \Psi _{R_{22}} = \Psi _{T_{12}}= \Psi _{R_{12}} \equiv \Psi .} \) We further assume that the base station arrays are of length \(2{L}_{R_{1}} = 2{L}_{T_{2}} = 2{L}_{\mathsf {BS}}\), and the user arrays are of equal length \(2{L}_{T_{1}} = 2{L}_{R_{2}} = 2{L}_{\mathsf {Usr}}\). In this case, the fullduplex degreesoffreedom region, \(\mathcal {D}_{\mathsf {FD}}\), simplifies to
while the halfduplex achievable region, \(\mathcal {D}_{\mathsf {HD}}\) simplifies to
The following remark characterizes the scenarios for which fullduplex with spatial isolation beats halfduplex.
Remark
In the overlapped scattering case, \(\mathcal {D}_{\mathsf {HD}} \subset \mathcal {D}_{\mathsf {FD}}\) when 2L _{ BS }>2L _{ Usr }, else \(\mathcal {D}_{\mathsf {HD}} = \mathcal {D}_{\mathsf {FD}}\).
We see that fullduplex outperforms halfduplex only if the base station arrays are longer than the user arrays. This is because in the overlapped scattering case, the only way to spatially isolate the selfinterference is zero forcing, and zero forcing requires extra antenna resources at the base station. When 2L _{ BS }≤2L _{ Usr }, the base station has no extra antenna resources it can leverage for zero forcing, and thus, spatial isolation of the selfinference is no better than isolation via time division. However, when 2L _{ BS }>2L _{ Usr }, the base station transmitter can transmit (2L _{ BS }−2L _{ Usr })Ψ zeroforced streams on the downlink without impeding the reception of the the full 2L _{ Usr }Ψ streams on the uplink, enabling a sumdegreesoffreedom gain of (2L _{ BS }−2L _{ Usr })Ψ over halfduplex. Indeed when the base station arrays are at least twice as long as the user arrays, the degreesoffreedom region is rectangular, and both uplink and downlink achieve the ideal 2L _{ Usr }Ψ degreesoffreedom.
Symmetric spread
The previous overlapped scattering case is the worst case for full duplex operation. Let us now consider the more general case where the selfinterference backscattering and the signalofinterest forward scattering are not perfectly overlapped. This case illustrates the impact of the overlap of the scattering intervals on fullduplex performance. Once again, to reduce the number of variables, we will make following symmetry assumptions. Assume all the arrays in the network, the two arrays on the base station as well as the array on each of the user devices, are of the same length 2L, that is \(2{L}_{T_{1}} = 2{L}_{R_{1}} = 2{L}_{T_{2}} = 2{L}_{R_{2}} \equiv 2L.\) Also, assume that the size of the forward scattering intervals to/from the intended receiver/transmitter is the same for all arrays \(\Psi _{T_{11}} = \Psi _{R_{11}} = \Psi _{T_{22}} = \Psi _{R_{22}} \equiv \Psi _{\mathsf {Fwd}},\) and that the size of the backscattering interval is the same at the base station receiver as at the base station trasmitter \( \Psi _{T_{12}} = \Psi _{R_{12}} \equiv \Psi _{\mathsf {Back}}.\) Finally, assume the amount of overlap between the backscattering and the forward scattering is the same at the base station transmitter as at the base station receiver so that \(\Psi _{T_{22}}\cap \Psi _{T_{12}} = \Psi _{R_{11}}\cap \Psi _{R_{12}} \equiv \Psi _{\mathsf {Fwd}} \cap \Psi _{\mathsf {Back}} = \Psi _{\mathsf {Fwd}}  \Psi _{\mathsf {Fwd}} \setminus \Psi _{\mathsf {Back}}.\)
We call Ψ _{ Back } the backscatter interval since it is the angle subtended at the base station by the backscattering clusters, while we call Ψ _{ Fwd } the forward interval, since it is the angle subtended by the clusters that scatter towards the intended transmitter/receiver. In this case, the fullduplex degreeoffreedom region, \(\mathcal {D}_{\mathsf {FD}}\) simplifies to
while the halfduplex achievable region, \(\mathcal {D}_{\mathsf {HD}}\) is
Remark
Comparing \(\mathcal {D}_{\mathsf {FD}}\) and \(\mathcal {D}_{\mathsf {HD}}\) above we see that in the case of symmetric scattering, \(\mathcal {D}_{\mathsf {HD}} = \mathcal {D}_{\mathsf {FD}}\) if and only if Ψ _{ Fwd }=Ψ _{ Back }, else \(\mathcal {D}_{\mathsf {HD}} \subset \mathcal {D}_{\mathsf {FD}}\) (we are neglecting the trivial case of L=0).
Thus, the fullduplex spatial isolation region is strictly larger than the halfduplex timedivision region unless the forward interval and the backscattering interval are perfectly overlapped. The intuition is that when Ψ _{ Fwd }=Ψ _{ Back } the scattering interval is shared resource, just as is time, thus trading spatial resources is equivalent to trading timeslots. However, if Ψ _{ Fwd }≠Ψ _{ Back }, there is a portion of space exclusive to each user which can be leveraged to improve upon time division. Moreover, inspection of \(\mathcal {D}_{\mathsf {FD}}\) above leads to the following remark.
Remark
In the case of symmetric scattering, the degreesoffreedom region is rectangular if and only if
The above remark can be verified by comparing (118) and (119) observing that the sumrate bound, (119), is only active when
Straightforward setalgebraic manipulation of condition (122) shows that it is equivalent to (121).
The intuition is that because Ψ _{ Back }∖Ψ _{ Fwd } are the set directions in which the base station couples to itself but not to the users, the corresponding 2LΨ _{ Back }∖Ψ _{ Fwd } dimensions are useless for spatial multiplexing, and therefore “free” for zero forcing the selfinterference, which has maximum dimension 2LΨ _{ Fwd }∩Ψ _{ Back }. Thus, when Ψ _{ Back }∖Ψ _{ Fwd }≥Ψ _{ Fwd }∩Ψ _{ Back }, we can zero force any selfinterference that is generated, without sacrificing any resource needed for spatial multiplexing to intended users.
Consider a numerical example in which Ψ _{ Fwd }=1 and Ψ _{ Back }=1, thus the overlap between the two, Ψ _{ Fwd }∩Ψ _{ Back }, can vary from zero to one. Figure 7 plots the halfduplex region, \(\mathcal {D}_{\mathsf {HD}}\), and the fullduplex region, \(\mathcal {D}_{\mathsf {FD}}\), for several different values of overlap, Ψ _{ Fwd }∩Ψ _{ Back }. We see that when Ψ _{ Fwd }=Ψ _{ Back } so that Ψ _{ Fwd }∩Ψ _{ Back }=1, both \(\mathcal {D}_{\mathsf {HD}}\) and \(\mathcal {D}_{\mathsf {FD}}\) are the same triangular region. When Ψ _{ Fwd }∩Ψ _{ Back }=0.75, we get a rectangular region. Once Ψ _{ Fwd }∩Ψ _{ Back }≤0.5, Ψ _{ Back }∖Ψ _{ Fwd } becomes greater than 0.5, such that condition of (121) is satisfied and the degreeoffreedom region becomes rectangular.
The overall takeaway is that as the amount of backscattering increases, more degrees of freedom must be sacrificed to achieve sufficient selfinterference suppression, and less degrees of freedom are left for signaling to the desired users. Therefore, fullduplex operation, where selfinterference is suppressed by beamforming, is indeed feasible, when the antenna array at the base station is sufficiently large, and when the backscattering is sufficiently limited.
Simulation example
We now consider a simple simulation example that illustrates the results of Theorem 1. In particular, this example illustrates that as the angular spread of the backscattering increases, more transmit degrees of freedom must be sacrificed in order to sufficiently suppress selfinterference at the base station. Theorem 1 was derived under several theoretical assumptions which are relaxed in this simulation to show that the same trends still apply. The channel model of (2) focuses on backscattering only; in this simulation, we also consider the directpath selfinterference from the transmit array to the receive array. Moreover, Theorem 1 was derived using continuous linear arrays, but to make the simulation closer to practical implementations, we consider discrete arrays rather than continuous arrays.
As depicted in Fig. 8, the base station transmit array is a 36element linear array, and likewise for the receive array. The separation between antenna elements within each array is Δ=λ/2, where λ is the wavelength. These discrete arrays would therefore roughly correspond to a continuous arrays of length L=18 (normalized by wavelength). The transmit and receive arrays are parallel to each other and sidebyside, with a separation between the transmit and receive arrays of 5λ. We model the antenna elements as ideal point sources, such that the directpath channel between transmit antenna m and receive antenna n can be simply modeled as [38, 39]
where, r _{ nm } is the distance between antennas m and n, \(k = \frac {2\pi }{\lambda }\) is the wavenumber, and \(j = \sqrt {1}\). As is done in the simulation examples of [25], the backscattering is modeled via a simple discretization of the original continuous channel model
where C _{12} is the continuous selfinterference channel response described in Eqs. (2)–(8). We generate channel realizations by drawing H(τ,t) from a twodimensional white gaussian process over \((\tau,t) \in \Psi _{R_{12}} \times \Psi _{T_{12}}\), and set H(τ,t)=0 for \((\tau,t) \notin \Psi _{R_{12}} \times \Psi _{T_{12}}\). As in the symmetricspread example, for convenience we let \(\Psi _{T_{12}} = \Psi _{R_{12}} = \Psi _{\mathsf {Back}}\). The total selfinterference channel is H _{ self }=C _{ direct }+α C _{ scat }., where α is a scalar chosen such that the backscattered selfinterference is 20 dB weaker (on average) than the directpath selfinterference. We assume the noise floor is 80 dB below the transmit signal power. We consider the case of no backscattering, as well as cases where the backscattering subtends angles of 15°, 45°, 90°, and the fully backscattered case where the backscattering subtends 180°.
We simulate a transmit beamforming scheme inspired by the degreesoffreedom achievability proof of section 3. Let d _{ T } denote the dimension of the base stations transmit signal (i.e., the number of data streams the base station wishes to transmit).^{4} In the achievability proof, the base station transmitter avoids selfinterference by projecting the d _{ T } transmit symbols onto the nullspace of the selfinterference channel. Here, we generalize this nullspaceprojection approach by having the base station transmitter project its d _{ T } transmit symbols onto the d _{ T } weakest singular vectors (i.e., the d _{ T } left singular vectors corresponding to the d _{ T } smallest singular values) of the selfinterference channel, H _{ self }. This beamforming approach, which we call “soft nulling” allows a flexible tradeoff between number of downlink dimensions, d _{ T }, and the amount of selfinterference generated: better selfinterference suppression can be achieved by sacrificing transmit dimension. This concept of soft nulling is explored in depth in [27].
The results of the simulation are shown in Fig. 9. We see that for the case of no backscattering, the selfinterference can be suppressed to the noise floor while maintaining a 32dimensional downlink signal, only sacrificing 4 of the 36 downlink dimensions in order to suppress selfinterference. However, in concurrence with the trend predicted by Theorem 1, as the angular spread of the backscattering increases, more transmit dimension must be sacrificed in order to suppress the selfinterference to the noise floor. Merely increasing the backscattering spread to 15° has a large impact: only 22 downlink transmit dimensions can be maintained while suppressing the selfinterference to the noise floor—14 of the 36 transmit dimensions must be sacrificed to suppress the selfinterference. In the case of a fullybackscattered selfinterference channel, the selfinterference cannot be suppressed to the noise floor even if only one transmit dimension is used. In summary, we see that the angular spread of the backscattering dictates how many transmit dimensions must be sacrificed in order to sufficiently suppress selfinterference.
Conclusions
Fullduplex operation presents an opportunity for base stations to as much as double their spectral efficiency by both transmitting downlink signal and receiving uplink signal at the same time in the same band. The challenge to fullduplex operation is highpowered selfinterference that is received both directly from the base station transmitter and backscattered from nearby objects. The receiver can be spatially isolated from the transmitter by leveraging multiantenna beamforming to avoid selfinterference, but such beamforming can also decrease the degreesoffreedom of the intended uplink and downlink channels. We have leveraged a spatial antennatheorybased channel model to analyze the spatial degreesoffreedom available to a fullduplex base station. The analysis has shown the fullduplex operation can indeed outperform halfduplex operation when either (1) the base station arrays are large enough for the base station to zeroforce the backscattered selfinterference or (2) the backscattering directions are not fully overlapped with the forward scattering directions, so that the base station can leverage the nonoverlapped intervals for interference free signaling to/from the intended users.
Endnotes
^{1} An additional challenge is the potential for the uplink user’s transmission to interfere with the downlink user’s reception, but in this paper we focus solely on the challenge of selfinterference.
^{2} We acknowledge that a continuous array which can support arbitrary current distributions may not be feasible to construct in practice due to the complications of feeding the array and achieving impedance match. However, as has been shown in the work of [24–26], a continuous array is nonetheless a very useful theoretical construct to develop performance bounds for any discrete antenna array subject to the same size constraint.
^{3} There is extensive ongoing research on scheduling algorithms to select uplink and downlink users such that the uplink user generates little interference to the downlink user [40–44] (and references within). Thus, we make the simplifying assumption that there is no channel from the uplink transmitter, T _{1}, to the downlink receiver, R _{2}. This assumption allows the analysis to focus on the challenge of backscattered selfinterference. An extension of this work, [45], which is outside the scope of this paper, focuses on the challenge of interuser interference in a fullduplex network, and provides analysis for the case where there is a nonzero channel from T _{1} to R _{2}.
^{4} We call d _{ T } the “dimension of the transmit signal” instead of “degrees of freedom”, because in this simulation, where SNR is finite, the term “degrees of freedom” is not correct by the rigorous definition used in the prior analysis.
Appendix A: Functional analysis definitions
Let \(\mathcal {X}\) be a Hilbert space, the orthogonal complement of \(\mathcal {S} \subseteq \mathcal {X}\), denoted \(\mathcal {S}^{\perp }\), is the subset \( \mathcal {S}^{\perp } \equiv \{x \in \mathcal {X}: \langle x,u\rangle =0\ \forall \ u\in \mathcal {S} \}.\) Let \(\mathcal {X}\) and \(\mathcal {Y}\) be vector spaces (e.g., Hilbert spaces) and let \(\mathsf {C}:\mathcal {X}\rightarrow \mathcal {Y}\) be a linear operator. Let \(\mathcal {S} \subseteq \mathcal {Y}\) be a subspace of \(\mathcal {Y}\). The nullspace of C, denoted N(C), is the subspace \(N(\mathsf {C}) \equiv \{x\in \mathcal {X}: \mathsf {C}x = 0 \}.\) The range of C, denoted R(C), is the subspace \(R(\mathsf {C}) \equiv \{\mathsf {C}x: x\in \mathcal {X}\}.\) The preimage of \(\mathcal {S}\) under C, \({\mathsf {C}}^{\leftarrow }(\mathcal {S})\), is the subspace (one can check that if \(\mathcal {S}\) is a subspace then \({\mathsf {C}}^{\leftarrow }(\mathcal {S})\) is a subspace also). \({\mathsf {C}}^{\leftarrow }(\mathcal {S}) \equiv \{x \in \mathcal {X}: \mathsf {C}x \in \mathcal {S} \}.\) The rank of C is the dimension of the range of C. A fundamental result in functional analysis is that the dimension of the range of C is also the dimension of the orthogonal complement of the nullspace of C (i.e. the coimage of C) so that we can write \( \mathop {\text {rank}} \mathsf {C} \equiv \text {dim} \,R(\mathsf {C}) = \text {dim}\, N(\mathsf {C})^{\perp }. \)
Appendix B: functional analysis lemmas
Lemma 5
Let \(\mathcal {X}\) and \(\mathcal {Y}\) be Hilbert spaces and let \(\mathsf {C}:\mathcal {X}\rightarrow \mathcal {Y}\) be a compact linear operator. There exists a singular system {σ _{ k },v _{ k },u _{ k }}, for C defined as follows. The set of functions {u _{ k }} form an orthonormal basis for \(\overline {R(\mathsf {C})}\), the closure of the range of C, and the set of functions {v _{ k }} form an orthonormal basis for N(C)^{⊥}, the coimage of C. The set of positive real numbers σ _{ k }, called the singular values of C, are the nonzero eigenvalues of (C ^{∗} C) arranged in decreasing order. The singular system diagonalizes C in the sense that for any (σ _{ k },v _{ k },u _{ k })∈{σ _{ k },v _{ k },u _{ k }}, C v _{ k }=σ _{ k } u _{ k }. Moreover, the operation of C on any \({x}\in \mathcal {X}\) can be expanded as \( \mathsf {C} {x} = \sum _{k} \sigma _{k} \langle {x}, {v}_{k} \rangle {u}_{k}, \) which is called the singular value expansion of C x. See Section 16.1 and 16.2 of [32] for a proof.
Lemma 6
Let \(\mathcal {X}\) and \(\mathcal {Y}\) be Hilbert spaces and let \(\mathsf {C}:\mathcal {X}\rightarrow \mathcal {Y}\) be a linear operator with closed range. There exists a unique linear operator C ^{+}, called the MoorePenrose pseudoinverse of C, with the following properties: (i) C ^{+} C x=x ∀x∈N(C)^{⊥} (ii) CC ^{+} y=y ∀y∈R(C) (iii) R(C ^{+})=N(C)^{⊥} (iv) N(C ^{+})=R(C)^{⊥}.
See Definition 2.2 and Proposition 2.3 of [33] for a proof.
Lemma 7
Let \(\mathcal {X}\)and \(\mathcal {Y}\) be finitedimensional Hilbert spaces and let \(\mathsf {C}:\mathcal {X}\rightarrow \mathcal {Y}\)be a linear operator with closed range. Let \(\mathcal {S} \subseteq \mathcal {Y}\) be a subspace of \(\mathcal {Y}\). Then the dimension of the preimage of \(\mathcal {S}\) under C is
Proof
For notational convenience, let \(d_{P} \equiv \text {dim}\, {\mathsf {C}}^{\leftarrow }(\mathcal {S})\), d _{ N }≡dim N(C), and \(d_{R\cap \mathcal {S}} \equiv \text {dim}\,(R(\mathsf {C})\cap \mathcal {S})\). Thus we wish to show that \(d_{P} = d_{N} + d_{R\cap \mathcal {S}}\). First note that \( N(\mathsf {C}) \subseteq {\mathsf {C}}^{\leftarrow }(\mathcal {S}) \), since \(\mathcal {S}\) is a subspace and hence contains the zero vector, and the preimage of the zero vector under C is the nullspace of C. Denote the intersection between the preimage of S under C and the orthogonal complement of the nullspace of C (i.e., the coimage) as
Note that \(\mathcal {B}\) is a subspace of \(\mathcal {X}\) since the intersection of any collection of subspaces is itself a subspace (see Thm. 1 on p. 3 of [46]). Every \(x\in {\mathsf {C}}^{\leftarrow }(\mathcal {S})\) can be expressed as x=w+u for some w∈N(C) and \(u \in \mathcal {B}\), and 〈w,u〉=0 for any w∈N(C) and \(u \in \mathcal {B}\). Thus, we can say that the preimage, \({\mathsf {C}}^{\leftarrow }(\mathcal {S})\), is the orthogonal direct sum of subspaces N(C) and \(\mathcal {B}\) ([32] Def. 4.26), a relationship we note we denote as \( {\mathsf {C}}^{\leftarrow }(\mathcal {S}) = N(\mathsf {C}) \oplus \mathcal {B}. \)
Let \(\{ a_{i} \}_{i=1}^{d_{N}}\) be a basis for N(C) and \(\{ b_{i} \}_{i=1}^{d_{\mathcal {B}}}\) be a basis for \(\mathcal {B}\), where d _{ N }=dim N(C) and \(d_{\mathcal {B}} = \text {dim}\, \mathcal {B}\). Construct the set \(\{ e_{i} \}_{i=1}^{d_{N}+d_{\mathcal {B}}}\) according to
We claim that \(\{ e_{i} \}_{i=1}^{d_{N}+d_{\mathcal {B}}}\) forms a basis for \({\mathsf {C}}^{\leftarrow }(\mathcal {S})\). To check that \(\{ e_{i} \}_{i=1}^{d_{N}+d_{\mathcal {B}}}\) is a basis for \({\mathsf {C}}^{\leftarrow }(\mathcal {S})\), we must first show \(\{ e_{i} \}_{i=1}^{d_{N}+d_{\mathcal {B}}}\) spans \({\mathsf {C}}^{\leftarrow }(\mathcal {S})\), and then show that the elements of \(\{ e_{i} \}_{i=1}^{d_{N}+d_{\mathcal {B}}}\) are linearly independent. Consider an arbitrary \(x\in {\mathsf {C}}^{\leftarrow }(\mathcal {S})\). Since \({\mathsf {C}}^{\leftarrow }(\mathcal {S}) = N(\mathsf {C}) \oplus \mathcal {B}\), x=w+u for some w∈N(C) and \(u \in \mathcal {B}\). Since by construction, \(\{ e_{i} \}_{i=1}^{d_{N}}\) is a basis for N(C) and \(\{ e_{i} \}_{i=1+d_{N}}^{d_{N}+d_{\mathcal {B}}}\) is a basis for N(C), one can choose λ _{ i } such that that \(w = \sum _{i=1}^{d_{N}} \lambda _{i} e_{i}\) and \(u = \sum _{i=1+d_{N}}^{d_{N}+d_{\mathcal {B}}} \lambda _{i} e_{i}\). Thus,
for some λ _{ i }. Thus \(\{ e_{i} \}_{i=1}^{d_{N}+d_{\mathcal {B}}}\) spans \({\mathsf {C}}^{\leftarrow }(\mathcal {S})\). Now let us show linear independence: that \(\sum _{i=1}^{d_{N}+d_{\mathcal {B}}} \lambda _{i} e_{i} = 0\) if and only if λ _{ i }=0 for all \(i\in \{1,2,\dots,d_{N}+d_{\mathcal {B}}\}\). The “if” part is trivial, thus it remains to show that \(\sum _{i=1}^{d_{N}+d_{\mathcal {B}}} \lambda _{i} e_{i} = 0\) implies λ _{ i }=0 ∀i. The condition \(\sum _{i=1}^{d_{N}+d_{\mathcal {B}}} \lambda _{i} e_{i} = 0\) implies
which implies w=−u for some w∈N(C) and \(u \in \mathcal {B}\). Every element of N(C) is orthogonal to every element of \(\mathcal {B}\) by construction, hence the only way Eq. (129) can be satisfied is if w=u=0, that is if both sides of Eq. (129) are zero, implying λ _{ i }=0 for all \(i\in \{1,2,\dots,d_{N}+d_{\mathcal {B}}\}\) as desired. Thus, we have shown \(\{ e_{i} \}_{i=1}^{d_{N}+d_{\mathcal {B}}}\) is a basis for \({\mathsf {C}}^{\leftarrow }(\mathcal {S})\), and hence
Consider the set \(\left \{\mathsf {C} e_{i}\right \}_{i=1+d_{N}}^{d_{N}+d_{\mathcal {B}}}\). By the definition of range, each element of the set \(\left \{\mathsf {C} e_{i}\right \}_{i=1+d_{N}}^{d_{N}+d_{\mathcal {B}}}\) is in R(C), and since by construction each e _{ i } is in \({\mathsf {C}}^{\leftarrow }(\mathcal {S})\), each element of \(\left \{\mathsf {C} e_{i}\right \}_{i=1+d_{N}}^{d_{N}+d_{\mathcal {B}}}\) is also in \(\mathcal {S}\). We therefore have that
and since there are \(d_{\mathcal {B}}\) elements in \(\left \{\mathsf {C} e_{i}\right \}_{i=1+d_{N}}^{d_{N}+d_{\mathcal {B}}}\), it must be that \(d_{\mathcal {B}} \leq d_{R\cap \mathcal {S}}.\) Substituting the above inequality into Eq. (130) gives \(d_{P} \leq d_{N} + d_{R\cap \mathcal {S}}.\)
To complete the proof we must show that \(d_{P} \geq d_{N} + d_{R\cap \mathcal {S}}\). Let \(\{s_{i}\}_{i=1}^{d_{R\cap \mathcal {S}}}\) be a basis for \(R(\mathsf {C}) \cap \mathcal {S}\). By assumption R(C) is closed, thus we have by Lemma 6 that the MoorePenrose pseudoinverse, C ^{+}, exists and satisfies the properties listed in Lemma 6. Consider the set \(\left \{\mathsf {C}^{+} s_{i}\right \}_{i=1}^{d_{R\cap \mathcal {S}}}\). We claim that
By property (iv) in Lemma 6, we have that C ^{+} s _{ i }∈N(C)^{⊥} for each \(\mathsf {C}^{+} s_{i}\in \left \{\mathsf {C}^{+} s_{i}\right \}_{i=1}^{d_{R\cap \mathcal {S}}}\). Since s _{ i }∈R(C), we have that C(C ^{+} s _{ i })=s _{ i } by property (ii) of the pseudoinverse, and since \(s_{i} \in \mathcal {S}\), we have that \(\mathsf {C} \mathsf {C}^{+} s_{i} = s_{i} \in \mathcal {S}\) for each \(\mathsf {C}^{+} s_{i}\in \left \{\mathsf {C}^{+} s_{i}\right \}_{i=1}^{d_{R\cap \mathcal {S}}}\). Thus, each element of \(\{\mathsf {C}^{+} s_{i}\}_{i=1}^{d_{R\cap \mathcal {S}}}\) is also in \({\mathsf {C}}^{\leftarrow }(\mathcal {S})\), the preimage of \(\mathcal {S}\) under C. Thus we have that each element of \( \left \{\mathsf {C}^{+} s_{i}\right \}_{i=1}^{d_{R\cap \mathcal {S}}}\) is in \(N(\mathsf {C})^{\perp } \cap {\mathsf {C}}^{\leftarrow }(\mathcal {S})\) which justifies the claim of Eq. (132). Now, Eq. (132) implies that \( d_{R\cap \mathcal {S}} \leq d_{\mathcal {B}} \). Substituting the above inequality into Eq. (130) gives \(d_{P} \geq d_{N} + d_{R\cap \mathcal {S}},\) concluding the proof. □
Corollary 1
Let \(\mathcal {X}\) and \(\mathcal {Y}\) be finitedimensional Hilbert spaces and let \(\mathsf {C}:\mathcal {X}\rightarrow \mathcal {Y}\) be a linear operator with closed range. Let \(\mathcal {S} \subseteq R(\mathsf {C})\subseteq \mathcal {Y}\) be a subspace of the range of C. Then, the dimension of the preimage of \(\mathcal {S}\) under C is \( \text {dim}\, {\mathsf {C}}^{\leftarrow }(\mathcal {S}) = \text {dim}\, N(\mathsf {C}) + \text {dim}\,(\mathcal {S}). \)
Proof
The proof follows trivially from Lemma 7 by noting that since \(\mathcal {S} \subseteq R(\mathsf {C})\), \(R(\mathsf {C})\cap \mathcal {S} = \mathcal {S}\), which we substitute into Eq. 125 to obtain the corollary. □
References
 1
DW Bliss, PA Parker, AR Margetts, in Proceedings of the 2007 IEEE/SP 14th Workshop on Statistical Signal Processing. Simultaneous transmission and reception for improved wireless network performance (Institute of Electrical and Electronics Engineers (IEEE)New York, 2007), pp. 478–482.
 2
AK Khandani. Methods for spatial multiplexing of wireless twoway channels, (2010). US Patent US 7817641 B1. https://www.google.com/patents/US7817641.
 3
B Radunovic, D Gunawardena, P Key, APN Singh, V Balan, G Dejean, Rethinking indoor wireless: low power, low frequency, full duplex (2009). Microsoft Research, Technical Report # MSRTR2009148, https://www.microsoft.com/enus/research/publication/rethinkingindoorwirelesslowpowerlowfrequencyfullduplex/.
 4
M Duarte, A Sabharwal, in Proc. 2010 Asilomar Conference on Signals and Systems. Fullduplex wireless communications using offtheshelf radios: feasibility and first results (Institute of Electrical and Electronics Engineers (IEEE)New York, 2010).
 5
J Choi, M Jain, K Srinivasan, P Levis, S Katti, in MobiCom 2010. Achieving single channel, full duplex wireless communication (Association of Computing Machinery (ACM) PublicationsNew York, 2010).
 6
M Jain, JI Choi, T Kim, D Bharadia, S Seth, K Srinivasan, P Levis, S Katti, P Sinha, in MobiCom 2011. Practical, realtime, full duplex wireless (New York, 2011), pp. 301–312. http://doi.acm.org/10.1145/2030613.2030647.
 7
M Duarte, C Dick, A Sabharwal, Experimentdriven characterization of fullduplex wireless systems. IEEE Trans. Wireless Commun. 11(12), 4296–4307 (2012).
 8
A Sahai, G Patel, A Sabharwal, Pushing the limits of fullduplex: design and realtime implementation (2011). Rice Univeristy, Technical Report # TREE1104. https://arxiv.org/abs/1107.0607.
 9
MA Khojastepour, K Sundaresan, S Rangarajan, X Zhang, S Barghi, in ACM 1480 Workshop on Hot Topics in Networks. The case for antenna cancellation for scalable fullduplex wireless communications (ACMNew York, 2011), pp. 17:1–17:6.
 10
E Aryafar, MA Khojastepour, K Sundaresan, S Rangarajan, M Chiang, in 1483 Proceedings of the 18th annual international conference on Mobile 1484 computing and networking. MIDU: enabling MIMO full duplex, ser. 1485 Mobicom ’12 (ACMNew York, 2012), pp. 257–268.
 11
M Duarte, A Sabharwal, V Aggarwal, R Jana, K Ramakrishnan, C Rice, N Shankaranarayanan, Design and characterization of a fullduplex multiantenna system for WiFi networks. IEEE Trans. Vehicular Technol. 63(3), 1160–1177 (2014).
 12
M Duarte, Fullduplex wireless: Design, implementation and characterization (2012). Ph.D.dissertation, Rice University. http://warp.rice.edu/trac/wiki/DuartePhDThesis.
 13
T Riihonen, S Werner, R Wichman, in Wireless Communications and Networking Conference, WCNC 2009. Comparison of fullduplex and halfduplex modes with a fixed amplifyandforward relay (IEEE, 2009) (Institute of Electrical and Electronics Engineers (IEEE)New York, 2009), pp. 1–5.
 14
T Riihonen, S Werner, R Wichman, Z Eduardo, in IEEE 10th Workshop on Signal Processing Advances in Wireless CommunicationsCommunications, 2009. SPAWC ’09. On the feasibility of fullduplex relaying in the presence of loop interference (Institute of Electrical and Electronics Engineers (IEEE)New York, 2009), pp. 275–279.
 15
B Day, A Margetts, D Bliss, P Schniter, Fullduplex bidirectional MIMO: achievable rates under limited dynamic range. IEEE Trans. Signal Process. 60(7), 3702–3713 (2012).
 16
B Day, A Margetts, D Bliss, P Schniter, Fullduplex MIMO relaying: achievable rates under limited dynamic range. IEEE J. Selected Areas Commun. 30(8), 1541–1553 (2012).
 17
T Riihonen, R Wichman, J Hamalainen, in IEEE International Symposium on Wireless Communication Systems. 2008. ISWCS ‘08. Cophasing fullduplex relay link with nonideal feedback information (Institute of Electrical and Electronics Engineers (IEEE)New York, 2008), pp. 263–267.
 18
T Riihonen, S Werner, J Cousseau, R Wichman, in 42nd Asilomar Conference on Signals, Systems and Computers, 2008. Design of cophasing allpass filters for fullduplex OFDM relays (Institute of Electrical and Electronics Engineers (IEEE)New York, 2008), pp. 1030–1034.
 19
T Riihonen, S Werner, R Wichman, Mitigation of loopback selfinterference in fullduplex MIMO relays. IEEE Trans. Signal Process. 59(12), 5983–5993 (2011).
 20
E Everett, M Duarte, C Dick, A Sabharwal, in Asilomar Conference on Signals, Systems and Computers. Empowering fullduplex wireless communication by exploiting directional diversity (Institute of Electrical and Electronics Engineers (IEEE)New York, 2011).
 21
E Everett, A Sahai, A Sabharwal, Passive selfinterference suppression for fullduplex infrastructure nodes. IEEE Trans. Wireless Commun. 13(2), 680–694 (2014).
 22
A Sahai, G Patel, C Dick, A Sabharwal, On the impact of phase noise on active cancelation in wireless fullduplex. IEEE Trans. Vehicular Technol. 62(9), 4494–4510 (2013).
 23
A Sabharwal, P Schniter, D Guo, DW Bliss, S Rangarajan, R Wichman, Inband fullduplex wireless: Challenges and opportunities. IEEE Journal on Selected Areas in Communications. 32(9), 1637–1652 (2014).
 24
A Poon, R Brodersen, D Tse, Degrees of freedom in multipleantenna channels: a signal space approach. IEEE Trans. Inf. Theory. 51(2), 523–536 (2005).
 25
A Poon, D Tse, R Brodersen, Impact of scattering on the capacity, diversity, and propagation range of multipleantenna channels. IEEE Trans. Inf. Theory. 52(3), 1087–1100 (2006).
 26
A Poon, D Tse, Degreeoffreedom gain from using polarimetric antenna elements. IEEE Trans. Inf. Theory. 57(9), 5695–5709 (2011).
 27
E Everett, C Shepard, L Zhong, A Sabharwal, SoftNull: manyantenna fullduplex wireless via digital beamfoming. IEEE Trans. Wireless Commun. 15(12), 8077–8092 (2016).
 28
A Poon, M Ho, in IEEE International Conference on Communications, 2003. ICC ’03. Indoor multipleantenna channel characterization from 2 to 8 GHz, vol 5 (Institute of Electrical and Electronics Engineers (IEEE)New York, 2003), pp. 3519–3523.
 29
Q Spencer, B Jeffs, M Jensen, A Swindlehurst, Modeling the statistical time and angle of arrival characteristics of an indoor multipath channel. IEEE J. Selected Areas Commun. 18(3), 347–360 (2000).
 30
RJM Cramer, An evaluation of ultrawideband propagation channels (2000). Ph.D. dissertation, University of Southern California.
 31
R Heddergott, P Truffer, Statistical characteristics of indoor radio propagation in NLOS scenarios. European Cooperation in the field of scientific and technical research, Valencia, Spain, In COST. 259:, 1–15 (2000).
 32
N Young, An Introduction to Hilbert Space (Cambridge University Press, Cambridge, 1988).
 33
HW Engl, M Hanke, A Neubauer, Regularization of Inverse Problems (Kluwer Academic Publishers, Dordrecht, 1996).
 34
E Telatar, Capacity of multiantenna gaussian channels. European Trans. Telecommu. 10(6), 585–595 (1999).
 35
L Ke, Z Wang, Degrees of freedom regions of twouser MIMO Z and full interference channels: the benefit of reconfigurable antennas. IEEE Trans. Inf. Theory. 58(6), 3766–3779 (2012).
 36
S Jafar, M Fakhereddin, Degrees of freedom for the MIMO interference channel. IEEE Trans. Inf. Theory. 53(7), 2637–2642 (2007).
 37
S Krishnamurthym, S Jafar, in 2012 IEEE Global Communications Conference (GLOBECOM). Degrees of freedom of 2user and 3user rankdeficient MIMO interference channels (Institute of Electrical and Electronics Engineers (IEEE)New York, 2012), pp. 2462–2467.
 38
DNC Tse, P Viswanath, Fundamentals of Wireless Communication (Cambridge University Press, Cambrige, 2005).
 39
CA Balanis, Antenna Theory: Analysis and Design, 3rd ed., (WileyInterscience, Hoboken, 2005).
 40
A Tang, X Wang, ADuplex: Medium access control for efficient coexistence between full duplex and half duplex communications. IEEE Trans. Wireless Commun. 14(10), 15871–58851 (2015).
 41
JY Kim, O Mashayekhi, H Qu, M Kazadiieva, P Levis, JANUS: a novel MAC protocol for full duplex radio. Stanford Univerisity, Tech. Rep. CSTR. 2.7(23) (2013). http://hci.stanford.edu/cstr/reports/201302.pdf.
 42
N Singh, D Gunawardena, A Proutiere, B Radunovic, H Balan, P Key, in Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2011. Efficient and fair MAC for wireless networks with selfinterference cancellation (Institute of Electrical and Electronics Engineers (IEEE)New York, 2011), pp. 94–101.
 43
Q Gao, G Chen, L Liao, Y Hua, in Computing, Networking and Communications (ICNC), 2014 International Conference on. Fullduplex cooperative transmission scheduling in fastfading MIMO relaying wireless networks (Institute of Electrical and Electronics Engineers (IEEE)New York, 2014), pp. 771–775.
 44
C Karakus, SN Diggavi, Opportunistic scheduling for fullduplex uplinkdownlink networks (2015). CoRR, vol. abs/1504.05898. http://arxiv.org/abs/1504.05898.
 45
Y Chen, A Sabharwal, Degrees of freedom of spatial selfinterference suppression for inband fullduplex with internode interference (2016). arXiv preprint arXiv: 1606.05809. https://arxiv.org/pdf/1606.05809.pdf.
 46
PD Lax, Funtional Analysis (Wiley, New York, 2002).
Acknowledgements
This work was partially supported by National Science Foundation (NSF) Grants CNS 0923479, CNS 1012921, CNS 1161596 and NSF Graduate Research Fellowship 0940902.
Author information
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Everett, E., Sabharwal, A. Spatial degreesoffreedom in largearray fullduplex: the impact of backscattering. J Wireless Com Network 2016, 286 (2016) doi:10.1186/s1363801607813
Received:
Accepted:
Published: