Introduction
Joint communication and sensing (JCAS), also referred to as integrated sensing and communication, has become a defining capability of sixth-generation networks: a single platform, spectrum, and waveform deliver information and probe the environment at the same time [1 , 2 , 3 , 4 ] . Non-terrestrial networks are a natural host for this integration [5 , 6 ] . A low-Earth-orbit (LEO) satellite carries a high-gain payload that already covers a wide area from a known position, so the same hardware can provide broadband connectivity and wide-area sensing for maritime surveillance, disaster monitoring, or infrastructure inspection without duplicating radio-frequency (RF) chains or spectral resources. In a monostatic implementation, however, the satellite must receive the ground echo while it transmits the downlink over the same time-frequency resources. This is full-duplex (FD) operation [7 , 8 ] , and the sensing receiver is exposed to the self-interference (SI) generated by the onboard transmitter, which exceeds the echo of a large vessel by 80–100 dB after passive isolation.
State of the Art
FD JCAS has been studied mainly for terrestrial base stations, from FD orthogonal frequency-division multiplexing (OFDM) radar measurements [9 ] to the design of beamformers for FD sensing at millimeter waves [10 ] , waveforms [11 ] , joint transmit and receive beamformers [12 ] , joint beamforming and power allocation [13 ] , and hybrid architectures [14 ] . These works model the SI as a short-memory channel whose residual is proportional to the transmit power and treat the target return as contemporaneous with the SI. They rely on the FD cancellation chain of passive suppression [15 ] , analog and digital cancellation with limited dynamic range [16 , 17 , 18 ] , spatial suppression [19 ] , and beamforming-based cancellation at millimeter waves [20 , 21 , 22 ] , and on dual-function waveform and beamforming design without FD constraints [23 , 24 , 25 , 26 , 27 , 28 ] . For satellites, the literature is at the stage of feasibility studies and surveys: FD satellite communications are analyzed in [29 ] , JCAS for satellite systems is surveyed in [5 ] , and massive multiple-input multiple-output (MIMO) LEO downlinks are designed in [30 ] . On the optimization side, fractional objectives are handled by the quadratic transform [31 , 32 ] , and block-coordinate schemes converge under mild conditions [33 , 34 ] .
Research Gap
Three questions that decide whether monostatic JCAS in space is viable remain open. First, no model separates the delayed echo-generating signal from the contemporaneous SI-generating signal, so the effect of the delay structure on canceller estimation, in particular echo absorption, is unknown. Second, the limits that the SI imposes on spaceborne sensing are not established: how close the radar signal-to-interference-plus-noise ratio (SINR) can come to its half-duplex value given the non-reconstructible SI and finite analog-to-digital converter (ADC) resolution, which tap budget suffices, and when the payload should switch from communication to sensing. Third, no design jointly optimizes the beamformers, the sensing covariance, the combiners of several targets, and the analog and digital cancellers under the constraints of a satellite payload, and the gain over handling the SI at the receiver only is unknown.
Contributions
This paper answers these questions and thereby lays the foundations of monostatic JCAS in space. It extends our conference contribution, which introduced the delay-selective architecture for a single target, as follows:
Model. We develop a single-carrier FD LEO JCAS model with K K K users and Q Q Q monostatic targets that makes this separation explicit, describes the coupling by pulse-sampled path responses on a two-sided delay support, and accounts for the motion-induced echo phase, the non-reconstructible SI, and ADC quantization (§ 2 ).
Fundamental limits. We prove that delay-selective cancellers are without loss of optimality (Proposition 1), quantify in closed form the echo absorption of a least-squares canceller whose support contains the target delay (Lemma 1, Corollary 1), and derive closed forms for the radar SINR ceiling under spatially white non-reconstructible SI, together with a bound for correlated SI (Proposition 2 ), the minimum pre-ADC SI power and the tap budget for full cancellation (Lemma 2, Corollary 2), and the communication–sensing change-over weight (Proposition 3) (Section III).
Joint design. We maximize the communication and sensing sum-SINRs, each normalized by its half-duplex benchmark and weighted by one scalar per function, over the beamformers, sensing covariance, Q Q Q combiners, and both cancellers under power, tap-norm, and pre-ADC constraints by an alternating algorithm with closed-form blocks; both canceller updates and Lemma 2 are instances of one generalized Sylvester solution (Lemma 3 ), and the monotone convergence of the objective and the complexity are established (Sections IV and § 5 ).
Evaluation. With a complete Ka-band link budget, we confirm the closed forms, including the echo loss by a time-domain least-squares Monte Carlo, and compare the joint design with half-duplex references and with a sequential design that optimizes the cancellers for the SI-free beamformers, with an SI-unaware design as an infeasible reference, under tap budgets, low-resolution ADCs, quantized analog taps, and multiple targets (Section VI).
Notation
Bold letters denote vectors and matrices; ( ⋅ ) H (\cdot)^{H} ( ⋅ ) H and ( ⋅ ) † (\cdot)^{\dagger} ( ⋅ ) † denote Hermitian transpose and Moore–Penrose inverse; tr ( ⋅ ) \operatorname{tr}(\cdot) tr ( ⋅ ) , ∥ ⋅ ∥ 2 \lVert\cdot\rVert_{2} ∥ ⋅ ∥ 2 , and ∥ ⋅ ∥ F \lVert\cdot\rVert_{F} ∥ ⋅ ∥ F are the trace, Euclidean and Frobenius norms; I N \mathbf{I}_{N} I N is the N × N N \times N N × N identity; δ n , m \delta_{n,m} δ n , m is the Kronecker delta; C N ( 0 , R ) \mathcal{CN}(0,\mathbf{R}) C N ( 0 , R ) is the circularly symmetric complex Gaussian distribution; E { ⋅ } \mathbb{E}\{\cdot\} E { ⋅ } and R { ⋅ } \mathfrak{R}\{\cdot\} R { ⋅ } are expectation and real part; ⪰ \succeq ⪰ is the Loewner order; and sinc ( x ) = sin ( π x ) / ( π x ) \operatorname{sinc}(x)=\sin(\pi x)/(\pi x) sinc ( x ) = sin ( π x ) / ( π x ) .
System Model
We consider an FD LEO satellite that serves K K K single-antenna ground users and senses Q Q Q ground targets in a monostatic configuration. The satellite has N t N_t N t transmit and N r N_r N r sensing receive antennas (ports of a subarrayed panel), mounted on the same rigid platform. A single-carrier waveform is shared by the communication and sensing functions; it is preferred for its low peak-to-average power ratio at the power-limited satellite amplifier and because the delay separation is explicit at the symbol rate. The support restriction developed below applies equally to the time-domain cancellers of an OFDM transceiver. Figure 1 illustrates the scenario, the receiver, and the delay structure that the design exploits.
Figure 1. System overview. (a) Monostatic FD JCAS from a LEO satellite: the downlink beams serve the users and illuminate the target, whose echo returns after τ q ≈ 2.3 m s \tau_q \approx2.3\ \mathrm{ms} τ q ≈ 2.3 ms , while the transmit–receive coupling produces SI. (b) Delay-selective receiver: the analog and digital cancellers reconstruct the SI from x [ n ] \mathbf{x}[n] x [ n ] on the short-delay support D S I \mathcal{D}_{\mathrm{SI}} D SI , and only the range-compression reference is delayed by d q d_q d q . (c) Delay structure: the SI taps occupy D S I \mathcal{D}_{\mathrm{SI}} D SI around d = 0 d=0 d = 0 , the echo lies at d q ≈ 4.6 × 10 4 d_q \approx4.6 \times10^4 d q ≈ 4.6 × 1 0 4 ; a canceller whose support contains d q d_q d q absorbs the echo (Lemma 1).
Transmit and Communication Models
Let K = { 1 , … , K } \mathcal{K}=\{1,\ldots,K\} K = { 1 , … , K } denote the user set. At symbol time n n n , the satellite transmits
x [ n ] = ∑ k = 1 K w k s k [ n ] + v [ n ] , (1) \mathbf{x}[n]=\sum_{k=1}^{K}\mathbf{w}_{k}s_{k}[n]+\mathbf{v}[n], \tag*{(1)} x [ n ] = k = 1 ∑ K w k s k [ n ] + v [ n ] , (1)
where w k ∈ C N t \mathbf{w}_{k}\in\mathbb{C}^{N_t} w k ∈ C N t is the beamformer of user k k k , s k [ n ] s_{k}[n] s k [ n ] is its information symbol, and v [ n ] ∈ C N t \mathbf{v}[n]\in\mathbb{C}^{N_t} v [ n ] ∈ C N t is an optional dedicated sensing signal. The symbols are temporally white and mutually independent, E { s k [ n ] s j ∗ [ m ] } = δ k , j δ n , m \mathbb{E}\{s_{k}[n]s_{j}^{*}[m]\}=\delta_{k,j}\delta_{n,m} E { s k [ n ] s j ∗ [ m ]} = δ k , j δ n , m , and the sensing signal satisfies E { v [ n ] v H [ m ] } = R s δ n , m \mathbb{E}\{\mathbf{v}[n]\mathbf{v}^{H}[m]\}=\mathbf{R}_{s}\delta_{n,m} E { v [ n ] v H [ m ]} = R s δ n , m , R s ⪰ 0 \mathbf{R}_{s}\succeq0 R s ⪰ 0 , independently of the symbols. The transmit covariance is
R x = E { x [ n ] x H [ n ] } = ∑ k = 1 K w k w k H + R s . (2) \mathbf{R}_{x}=\mathbb{E}\{\mathbf{x}[n]\mathbf{x}^{H}[n]\}=\sum_{k=1}^{K}\mathbf{w}_{k}\mathbf{w}_{k}^{H}+\mathbf{R}_{s}. \tag*{(2)} R x = E { x [ n ] x H [ n ]} = k = 1 ∑ K w k w k H + R s . (2)
The sequence x [ n ] \mathbf{x}[n] x [ n ] is pulse-shaped with a fixed root-raised-cosine (RRC) pulse p ( t ) p(t) p ( t ) of symbol period T s T_s T s , which is known and not optimized. After timing and Doppler compensation, user k k k receives
y k [ n ] = h k H w k s k [ n ] + ∑ j ≠ k h k H w j s j [ n ] + h k H v [ n ] + n k [ n ] , (3) y_{k}[n]=\mathbf{h}_{k}^{H}\mathbf{w}_{k}s_{k}[n]+\sum_{j\ne k}\mathbf{h}_{k}^{H}\mathbf{w}_{j}s_{j}[n]+\mathbf{h}_{k}^{H}\mathbf{v}[n]+n_{k}[n], \tag*{(3)} y k [ n ] = h k H w k s k [ n ] + j = k ∑ h k H w j s j [ n ] + h k H v [ n ] + n k [ n ] , (3)
where h k ∈ C N t \mathbf{h}_{k}\in\mathbb{C}^{N_t} h k ∈ C N t is the effective satellite-to-user channel and n k [ n ] ∼ C N ( 0 , σ k 2 ) n_{k}[n]\sim\mathcal{CN}(0,\sigma_{k}^{2}) n k [ n ] ∼ C N ( 0 , σ k 2 ) . The communication SINR is
γ k = ∣ h k H w k ∣ 2 ∑ j ≠ k ∣ h k H w j ∣ 2 + h k H R s h k + σ k 2 . (4) \gamma_{k}=\frac{\lvert\mathbf{h}_{k}^{H}\mathbf{w}_{k}\rvert^{2}}{\sum_{j\ne k}\lvert\mathbf{h}_{k}^{H}\mathbf{w}_{j}\rvert^{2}+\mathbf{h}_{k}^{H}\mathbf{R}_{s}\mathbf{h}_{k}+\sigma_{k}^{2}}. \tag*{(4)} γ k = ∑ j = k ∣ h k H w j ∣ 2 + h k H R s h k + σ k 2 ∣ h k H w k ∣ 2 . (4)
Delayed Target Echoes and SI Channel
Target q ∈ Q = { 1 , … , Q } q\in\mathcal{Q}=\{1,\ldots,Q\} q ∈ Q = { 1 , … , Q } has round-trip delay τ q \tau_{q} τ q , integer symbol delay d q = ⌊ τ q / T s ⌋ d_{q}=\lfloor\tau_{q}/T_{s}\rfloor d q = ⌊ τ q / T s ⌋ , and fractional delay δ q = τ q − d q T s \delta_{q}=\tau_{q}-d_{q}T_{s} δ q = τ q − d q T s , ∣ δ q ∣ ≤ T s / 2 \lvert\delta_{q}\rvert\le T_{s}/2 ∣ δ q ∣ ≤ T s /2 , whose effect is a known amplitude factor absorbed into β q \beta_{q} β q (§ 2 -D). The delay τ q \tau_{q} τ q is predicted from the satellite ephemeris and the target position provided by a preceding detection or tracking stage, or it is a hypothetical range bin in search mode; the design below requires only d q ∉ D S I d_{q}\notin\mathcal{D}_{\mathrm{SI}} d q ∈ / D SI and is otherwise independent of d q d_{q} d q , so that errors in τ q \tau_{q} τ q do not affect it. Within a coherent processing interval (CPI) of duration T C P I T_{\mathrm{CPI}} T CPI , d q d_{q} d q is held fixed, which requires the range walk to stay below half a symbol, ∣ r ˙ q ∣ < c T s / ( 4 T C P I ) \lvert\dot{r}_{q}\rvert<cT_{s}/(4T_{\mathrm{CPI}}) ∣ r ˙ q ∣ < c T s / ( 4 T CPI ) ; this holds near the zero-Doppler instant and, otherwise, after ephemeris-based range-migration compensation. The fast phase variation is retained explicitly.
The target channel is modeled as
H q = β q a r ( θ q ) a t H ( θ q ) ∈ C N r × N t , ∣ β q ∣ 2 = ψ p 2 ( δ q ) G e 2 λ c 2 ( 4 π ) 3 R q 4 L a 2 . (5) \mathbf{H}_q=\beta_q\mathbf{a}_r(\theta_q)\mathbf{a}_t^{H}(\theta_q)\in\mathbb{C}^{N_r\times N_t},\qquad|\beta_q|^2=\frac{\psi_p^2(\delta_q)G_e^2\lambda_c^2}{(4\pi)^3R_q^4L_a^2}. \tag*{(5)} H q = β q a r ( θ q ) a t H ( θ q ) ∈ C N r × N t , ∣ β q ∣ 2 = ( 4 π ) 3 R q 4 L a 2 ψ p 2 ( δ q ) G e 2 λ c 2 . (5)
which collects the two-way propagation loss over the slant range R q R_q R q , the atmospheric loss L a L_a L a , the port gain G e G_e G e , and the straddle factor ψ p 2 ( δ q ) ≤ 1 \psi_p^2(\delta_q)\leq1 ψ p 2 ( δ q ) ≤ 1 defined below, while a t ( θ q ) \mathbf{a}_t(\theta_q) a t ( θ q ) and a r ( θ q ) \mathbf{a}_r(\theta_q) a r ( θ q ) are the transmit and receive steering vectors toward the target. The reflection coefficient ρ q \rho_q ρ q satisfies E { ρ q } = 0 \mathbb{E}\{\rho_q\}=0 E { ρ q } = 0 and E { ∣ ρ q ∣ 2 } = σ q 2 \mathbb{E}\{|\rho_q|^2\}=\sigma_q^2 E { ∣ ρ q ∣ 2 } = σ q 2 , where σ q 2 \sigma_q^2 σ q 2 is the radar cross section (RCS). Satellite motion produces the deterministic carrier phase
ϕ q [ n ] = exp ( − j 2 π f c τ q ( n T s ) ) , (6) \phi_q[n]=\exp\left(-j2\pi f_c\tau_q(nT_s)\right), \tag*{(6)} ϕ q [ n ] = exp ( − j 2 π f c τ q ( n T s ) ) , (6)
where f c f_c f c is the carrier frequency, λ c = c / f c \lambda_c=c/f_c λ c = c / f c is the wavelength, and τ q ( t ) \tau_q(t) τ q ( t ) follows from the ephemeris. The echo of target q q q is
y q [ n ] = ρ q ϕ q [ n ] H q x [ n − d q ] . (7) \mathbf{y}_q[n]=\rho_q\phi_q[n]\mathbf{H}_q\mathbf{x}[n-d_q]. \tag*{(7)} y q [ n ] = ρ q ϕ q [ n ] H q x [ n − d q ] . (7)
Hence the echo observed at time n n n is generated by the transmission emitted d q d_q d q symbols earlier, whereas the SI is generated by the symbols transmitted around time n n n through the short-memory MIMO channel
y S I [ n ] = ∑ d ∈ D S I H S I [ d ] x [ n − d ] , D S I = { − D p r e , … , D p o s t } , (8) \mathbf{y}_{\mathrm{SI}}[n]=\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\mathbf{H}_{\mathrm{SI}}[d]\mathbf{x}[n-d],\qquad\mathcal{D}_{\mathrm{SI}}=\{-D_{\mathrm{pre}},\ldots,D_{\mathrm{post}}\}, \tag*{(8)} y SI [ n ] = d ∈ D SI ∑ H SI [ d ] x [ n − d ] , D SI = { − D pre , … , D post } , (8)
with D S I = ∣ D S I ∣ ≪ d q D_{\mathrm{SI}}=|\mathcal{D}_{\mathrm{SI}}|\ll d_q D SI = ∣ D SI ∣ ≪ d q . The coupling consists of L S I L_{\mathrm{SI}} L SI paths with N r × N t N_r\times N_t N r × N t gain matrices G ℓ \mathbf{G}_\ell G ℓ and delays τ ℓ \tau_\ell τ ℓ , and the taps are their discrete-time equivalents at the receiver sampling instants of § 2 -D,
H S I [ d ] = ∑ ℓ = 0 L S I − 1 ψ p ( d T s − τ ℓ ) G ℓ , (9) \mathbf{H}_{\mathrm{SI}}[d]=\sum_{\ell=0}^{L_{\mathrm{SI}}-1}\psi_p(dT_s-\tau_\ell)\mathbf{G}_\ell, \tag*{(9)} H SI [ d ] = ℓ = 0 ∑ L SI − 1 ψ p ( d T s − τ ℓ ) G ℓ , (9)
where ψ p \psi_p ψ p is the pulse autocorrelation defined in § 2 -D, applied entrywise when τ ℓ \tau_\ell τ ℓ depends on the antenna pair. Since τ ℓ ≠ 0 \tau_\ell\ne0 τ ℓ = 0 , the pulse produces precursor taps (d < 0 d<0 d < 0 ) as well as tails, e.g., 22 and 14 dB below the main tap for paths at 0.1 T s 0.1T_s 0.1 T s and 0.3 T s 0.3T_s 0.3 T s with roll-off 0.35, the value used in Section VI, far above any practical cancellation floor. They are realizable because x [ n − d ] \mathbf{x}[n-d] x [ n − d ] , d < 0 d<0 d < 0 , has already entered the transmit pulse-shaping filter, and D p r e D_{\mathrm{pre}} D pre and D p o s t D_{\mathrm{post}} D post are chosen so that the omitted tail energy lies below the non-reconstructible SI of § 2 -C. Since d q ≥ ⌈ 2 h / ( c T s ) ⌉ d_q\geq\lceil2h/(cT_s)\rceil d q ≥ ⌈ 2 h / ( c T s )⌉ for a satellite at altitude h h h , i.e., d q ≥ 4 × 10 4 d_q\geq4\times10^4 d q ≥ 4 × 1 0 4 for h = 300 k m h=300\ \mathrm{km} h = 300 km and 1 / T s = 20 M B d 1/T_s=20\ \mathrm{MBd} 1/ T s = 20 MBd , d q ∉ D S I d_q\notin\mathcal{D}_{\mathrm{SI}} d q ∈ / D SI holds with a margin of four orders of magnitude. The dominant path, ℓ = 0 \ell=0 ℓ = 0 , is the near-field line-of-sight coupling with the spherical-wave response
[ G 0 ] r , t = κ S I λ c 4 π d r , t exp ( − j 2 π λ c d r , t ) (10) [\mathbf{G}_0]_{r,t}=\sqrt{\kappa_{\mathrm{SI}}}\frac{\lambda_c}{4\pi d_{r,t}}\exp\left(-j\frac{2\pi}{\lambda_c}d_{r,t}\right) \tag*{(10)} [ G 0 ] r , t = κ SI 4 π d r , t λ c exp ( − j λ c 2 π d r , t ) (10)
and delay τ 0 , r , t = d r , t / c \tau_{0,r,t}=d_{r,t}/c τ 0 , r , t = d r , t / c , where d r , t d_{r,t} d r , t is the distance between transmit antenna t t t and receive antenna r r r , and 0 < κ S I ≤ 1 0<\kappa_{\mathrm{SI}}\leq1 0 < κ SI ≤ 1 is the passive-isolation attenuation. The remaining paths model short-delay reflections from the satellite structure.
Delay-Selective Cancellation With Impairments
The analog canceller subtracts c A [ n ] = ∑ d ∈ D S I C A [ d ] x [ n − d ] \mathbf{c}_{\mathrm{A}}[n]=\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\mathbf{C}_{\mathrm{A}}[d]\mathbf{x}[n-d] c A [ n ] = ∑ d ∈ D SI C A [ d ] x [ n − d ] before the low-noise amplifiers and ADCs, and the digital canceller subtracts c D [ n ] = ∑ d ∈ D S I C D [ d ] x [ n − d ] \mathbf{c}_{\mathrm{D}}[n]=\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\mathbf{C}_{\mathrm{D}}[d]\mathbf{x}[n-d] c D [ n ] = ∑ d ∈ D SI C D [ d ] x [ n − d ] after sampling, with C A [ d ] , C D [ d ] ∈ C N r × N t \mathbf{C}_{\mathrm{A}}[d],\mathbf{C}_{\mathrm{D}}[d]\in\mathbb{C}^{N_r\times N_t} C A [ d ] , C D [ d ] ∈ C N r × N t . Both are computed from an estimate H ^ S I [ d ] \widehat{\mathbf{H}}_{\mathrm{SI}}[d] H SI [ d ] of the coupling taps, obtained by least squares on the SI support from previous CPIs or from a calibration sequence (Lemma 1(a) in Section III); samples from previous CPIs identify the taps only on the range of the transmit covariance used in them, whereas a full-rank calibration sequence identifies them in every transmit direction, as the tie-breaking rule of § 5 -E3 requires. For N p ≫ N t D S I N_p\gg N_tD_{\mathrm{SI}} N p ≫ N t D SI its estimation error lies well below the non-reconstructible SI introduced next, so we set H ^ S I [ d ] = H S I [ d ] \widehat{\mathbf{H}}_{\mathrm{SI}}[d]=\mathbf{H}_{\mathrm{SI}}[d] H SI [ d ] = H SI [ d ] and keep the hat for the quantities available to the cancellers. What limits the cancellation is the part of the SI that no linear canceller over D S I \mathcal{D}_{\mathrm{SI}} D SI can reconstruct: transmitter noise, power-amplifier distortion, phase noise, and coupling drift between estimation and use [16 ] . We model it as a zero-mean, time-varying perturbation of the taps, so that the received SI is
y S I [ n ] = ∑ d ∈ D S I ( H S I [ d ] + Δ n [ d ] ) x [ n − d ] , (11) \mathbf{y}_{\mathrm{SI}}[n] = \sum_{d\in\mathcal{D}_{\mathrm{SI}}} \left(\mathbf{H}_{\mathrm{SI}}[d] + \boldsymbol{\Delta}_{n}[d]\right)\mathbf{x}[n-d], \tag*{(11)} y SI [ n ] = d ∈ D SI ∑ ( H SI [ d ] + Δ n [ d ] ) x [ n − d ] , (11)
where Δ n [ d ] \boldsymbol{\Delta}_{n}[d] Δ n [ d ] is independent of x \mathbf{x} x and of H ^ S I [ d ] \widehat{\mathbf{H}}_{\mathrm{SI}}[d] H SI [ d ] and has i.i.d. C N ( 0 , σ Δ , d 2 ) \mathcal{CN}(0,\sigma_{\Delta,d}^{2}) C N ( 0 , σ Δ , d 2 ) entries with σ Δ , d 2 = ϵ 2 ∥ H S I [ d ] ∥ F 2 / ( N r N t ) \sigma_{\Delta,d}^{2}=\epsilon^{2}\lVert\mathbf{H}_{\mathrm{SI}}[d]\rVert_{F}^{2}/(N_{\mathrm{r}}N_{\mathrm{t}}) σ Δ , d 2 = ϵ 2 ∥ H SI [ d ] ∥ F 2 / ( N r N t ) . Its temporal correlation does not affect the second-order quantities below, and, being uncorrelated with x [ n − d ] \mathbf{x}[n-d] x [ n − d ] , it is not removed by any least-squares fit. The parameter ϵ 2 \epsilon^{2} ϵ 2 is the normalized power of the non-reconstructible SI, which we call the SI-knowledge floor, and σ Δ 2 = ∑ d σ Δ , d 2 \sigma_{\Delta}^{2}=\sum_{d}\sigma_{\Delta,d}^{2} σ Δ 2 = ∑ d σ Δ , d 2 . The residual channels after the analog and after both stages are
H ^ A [ d ] = H ^ S I [ d ] − C A [ d ] , (12) \widehat{\mathbf{H}}_{\mathrm{A}}[d] = \widehat{\mathbf{H}}_{\mathrm{SI}}[d] - \mathbf{C}_{\mathrm{A}}[d], \tag*{(12)} H A [ d ] = H SI [ d ] − C A [ d ] , (12)
H ^ r e s [ d ] = H ^ S I [ d ] − C A [ d ] − C D [ d ] , (13) \widehat{\mathbf{H}}_{\mathrm{res}}[d] = \widehat{\mathbf{H}}_{\mathrm{SI}}[d] - \mathbf{C}_{\mathrm{A}}[d] - \mathbf{C}_{\mathrm{D}}[d], \tag*{(13)} H res [ d ] = H SI [ d ] − C A [ d ] − C D [ d ] , (13)
and the true residuals are H ^ A [ d ] + Δ n [ d ] \widehat{\mathbf{H}}_{\mathrm{A}}[d]+\boldsymbol{\Delta}_{n}[d] H A [ d ] + Δ n [ d ] and H ^ r e s [ d ] + Δ n [ d ] \widehat{\mathbf{H}}_{\mathrm{res}}[d]+\boldsymbol{\Delta}_{n}[d] H res [ d ] + Δ n [ d ] . Averaging over Δ n [ d ] \boldsymbol{\Delta}_{n}[d] Δ n [ d ] under the whiteness assumptions, the covariance of the SI entering the ADCs is
R A S I = ∑ d ∈ D S I H ^ A [ d ] R x H ^ A H [ d ] + σ Δ 2 tr ( R x ) I N r . (14) \mathbf{R}_{\mathrm{A}}^{\mathrm{SI}} = \sum_{d\in\mathcal{D}_{\mathrm{SI}}}\widehat{\mathbf{H}}_{\mathrm{A}}[d]\mathbf{R}_{x}\widehat{\mathbf{H}}_{\mathrm{A}}^{H}[d] + \sigma_{\Delta}^{2}\operatorname{tr}(\mathbf{R}_{x})\mathbf{I}_{N_{\mathrm{r}}}. \tag*{(14)} R A SI = d ∈ D SI ∑ H A [ d ] R x H A H [ d ] + σ Δ 2 tr ( R x ) I N r . (14)
For b b b -bit I/Q ADCs with automatic gain control, clipped at the peak of the complex envelope, the signal-to-quantization-noise ratio is SQNR = 6.02 b + 1.76 − P A P R =6.02b+1.76-\mathrm{PAPR} = 6.02 b + 1.76 − PAPR [dB], with PAPR the peak-to-average power ratio of the complex envelope (equivalently, 6.02 b + 4.77 6.02b+4.77 6.02 b + 4.77 dB minus the PAPR of each real component [17 ] ). Using the branch-averaged input power, the quantization noise in each receive branch has power ϱ tr ( R A S I ) \varrho\operatorname{tr}(\mathbf{R}_{\mathrm{A}}^{\mathrm{SI}}) ϱ tr ( R A SI ) with ϱ = 10 − S Q N R / 10 / N r \varrho=10^{-\mathrm{SQNR}/10}/N_{\mathrm{r}} ϱ = 1 0 − SQNR /10 / N r [16 ] . The post-cancellation signal is therefore
y D [ n ] = ∑ q y q [ n ] + ∑ d ∈ D S I ( H ^ r e s [ d ] + Δ n [ d ] ) x [ n − d ] + z r [ n ] + z Q [ n ] , (15) \mathbf{y}_{\mathrm{D}}[n] = \sum_{q}\mathbf{y}_{q}[n] + \sum_{d\in\mathcal{D}_{\mathrm{SI}}}\left(\widehat{\mathbf{H}}_{\mathrm{res}}[d]+\boldsymbol{\Delta}_{n}[d]\right)\mathbf{x}[n-d]+\mathbf{z}_{r}[n]+\mathbf{z}_{Q}[n], \tag*{(15)} y D [ n ] = q ∑ y q [ n ] + d ∈ D SI ∑ ( H res [ d ] + Δ n [ d ] ) x [ n − d ] + z r [ n ] + z Q [ n ] , (15)
where z r [ n ] ∼ C N ( 0 , σ r 2 I N r ) \mathbf{z}_{r}[n]\sim\mathcal{CN}(0,\sigma_{r}^{2}\mathbf{I}_{N_{\mathrm{r}}}) z r [ n ] ∼ C N ( 0 , σ r 2 I N r ) is thermal noise and z Q [ n ] \mathbf{z}_{Q}[n] z Q [ n ] is the quantization noise. Both cancellers are delay selective : their nonzero taps are restricted to D S I \mathcal{D}_{\mathrm{SI}} D SI , so they cannot generate a replica at any target delay.
Range Compression and Delay-Resolved Radar SINR
Let ψ p ( τ ) \psi_{p}(\tau) ψ p ( τ ) denote the normalized autocorrelation of the RRC pulse, i.e., the raised-cosine response after receive matched filtering, with ψ p ( k T s ) = δ k , 0 \psi_{p}(kT_{s})=\delta_{k,0} ψ p ( k T s ) = δ k , 0 . The receiver samples the matched-filter output once per symbol at t n = n T s t_{n}=nT_{s} t n = n T s , common to all targets. The return of target q q q then contributes ρ q ϕ q [ n ] H q ∑ i ψ p ( ( n − d q − i ) T s − δ q ) x [ i ] \rho_{q}\phi_{q}[n]\mathbf{H}_{q}\sum_{i}\psi_{p}((n-d_{q}-i)T_{s}-\delta_{q})\mathbf{x}[i] ρ q ϕ q [ n ] H q ∑ i ψ p (( n − d q − i ) T s − δ q ) x [ i ] , whose dominant term is (7) scaled by ψ p ( δ q ) \psi_{p}(\delta_{q}) ψ p ( δ q ) , absorbed into β q \beta_{q} β q in (5), with a straddle loss of at most about 4 dB and about 1.2 dB on average over δ q \delta_{q} δ q ; the neighboring terms are uncorrelated with the range-compression reference and are negligible. Likewise, an SI path with delay τ ℓ \tau_{\ell} τ ℓ contributes ∑ i ψ p ( ( n − i ) T s − τ ℓ ) G ℓ x [ i ] \sum_{i}\psi_{p}((n-i)T_{s}-\tau_{\ell})\mathbf{G}_{\ell}\mathbf{x}[i] ∑ i ψ p (( n − i ) T s − τ ℓ ) G ℓ x [ i ] , including precursors from i > n i>n i > n , which gives the taps (9), the same for every target since the sampling grid is common. Because the satellite transmits continuously, the SI in the
samples of the delay bin of target q q q is generated by the symbols x [ n − d ] \mathbf{x}[n-d] x [ n − d ] , d ∈ D S I d\in\mathcal{D}_{\mathrm{SI}} d ∈ D SI , emitted around each sampling instant, and not by x [ n − d q ] \mathbf{x}[n-d_{q}] x [ n − d q ] .
The target is detected by range compression over the N p = T C P I / T s N_{p}=T_{\mathrm{CPI}}/T_{s} N p = T CPI / T s samples of a CPI. With the known illumination sequence g q [ n ] = a t H ( θ q ) x [ n ] \mathbf{g}_{q}[n]=\mathbf{a}_{t}^{H}(\theta_{q})\mathbf{x}[n] g q [ n ] = a t H ( θ q ) x [ n ] and P q = a t H ( θ q ) R x a t ( θ q ) \mathbf{P}_{q}=\mathbf{a}_{t}^{H}(\theta_{q})\mathbf{R}_{x}\mathbf{a}_{t}(\theta_{q}) P q = a t H ( θ q ) R x a t ( θ q ) , the range-and Doppler-matched output at the delay bin of target q q q is
r q = 1 N p P q ∑ n = 1 N p ϕ q ∗ [ n ] g q ∗ [ n − d q ] y D [ n ] . (16) \mathbf{r}_{q}=\frac{1}{\sqrt{N_{p}P_{q}}}\sum_{n=1}^{N_{p}}\phi_{q}^{*}[n]\mathbf{g}_{q}^{*}[n-d_{q}]\mathbf{y}_{\mathrm{D}}[n]. \tag*{(16)} r q = N p P q 1 n = 1 ∑ N p ϕ q ∗ [ n ] g q ∗ [ n − d q ] y D [ n ] . (16)
Since x [ n − d q ] \mathbf{x}[n-d_{q}] x [ n − d q ] is independent of x [ n − d ] \mathbf{x}[n-d] x [ n − d ] for d ∈ D S I d\in\mathcal{D}_{\mathrm{SI}} d ∈ D SI and of x [ n − d q ′ ] \mathbf{x}[n-d_{q'}] x [ n − d q ′ ] for q ′ ≠ q q'\ne q q ′ = q (targets in different range bins, d q ≠ d q ′ d_{q}\ne d_{q'} d q = d q ′ ), the echo of target q q q adds coherently in (16), whereas the residual SI, the SI-knowledge error, the thermal and quantization noise, and the echoes of the other targets are uncorrelated with the reference and are integrated incoherently in the same way. For N p ≫ 1 N_{p}\gg1 N p ≫ 1 ,
r q ≈ N p P q ρ q β q a r ( θ q ) + i q , (17) \mathbf{r}_{q}\approx\sqrt{N_{p}P_{q}\rho_{q}\beta_{q}}\mathbf{a}_{r}(\theta_{q})+\mathbf{i}_{q}, \tag*{(17)} r q ≈ N p P q ρ q β q a r ( θ q ) + i q , (17)
with target covariance N p R q N_{p}\mathbf{R}_{q} N p R q , R q = σ q 2 H q R x H q H \mathbf{R}_{q}=\sigma_{q}^{2}\mathbf{H}_{q}\mathbf{R}_{x}\mathbf{H}_{q}^{H} R q = σ q 2 H q R x H q H , and interference-plus-noise covariance
R i = R S I r e s + ( σ r 2 + ϱ tr ( R A S I ) ) I N r , (18) \mathbf{R}_{i}=\mathbf{R}_{\mathrm{SI}}^{\mathrm{res}}+\left(\sigma_{r}^{2}+\varrho\operatorname{tr}(\mathbf{R}_{\mathrm{A}}^{\mathrm{SI}})\right)\mathbf{I}_{N_{\mathrm{r}}}, \tag*{(18)} R i = R SI res + ( σ r 2 + ϱ tr ( R A SI ) ) I N r , (18)
R S I r e s = ∑ d ∈ D S I H ^ r e s [ d ] R x H ^ r e s H [ d ] + σ Δ 2 tr ( R x ) I N r , (19) \mathbf{R}_{\mathrm{SI}}^{\mathrm{res}}=\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\widehat{\mathbf{H}}_{\mathrm{res}}[d]\mathbf{R}_{x}\widehat{\mathbf{H}}_{\mathrm{res}}^{H}[d]+\sigma_{\Delta}^{2}\operatorname{tr}(\mathbf{R}_{x})\mathbf{I}_{N_{\mathrm{r}}}, \tag*{(19)} R SI res = d ∈ D SI ∑ H res [ d ] R x H res H [ d ] + σ Δ 2 tr ( R x ) I N r , (19)
where the echoes of the other targets, whose per-sample power is 50 dB below the noise in the scenarios of interest, have been neglected in R i \mathbf{R}_{i} R i . The processing gain N p N_{p} N p thus multiplies the target term only, while residual SI and noise are treated identically. With a receive combiner u q ∈ C N r \mathbf{u}_{q}\in\mathbb{C}^{N_{\mathrm{r}}} u q ∈ C N r per target, the delay-resolved radar SINR is
γ q = N p u q H R q u q u q H R i u q , q ∈ Q . (20) \gamma_{q}=\frac{N_{p}\mathbf{u}_{q}^{H}\mathbf{R}_{q}\mathbf{u}_{q}}{\mathbf{u}_{q}^{H}\mathbf{R}_{i}\mathbf{u}_{q}},\qquad q\in\mathcal{Q}. \tag*{(20)} γ q = u q H R i u q N p u q H R q u q , q ∈ Q . (20)
Note that R i \mathbf{R}_{i} R i is common to all targets: the cancellers and the transmit covariance shape one interference field that every combiner sees, and only the reference in (16) and the combiner u q \mathbf{u}_{q} u q are target specific.
Fundamental Properties
This section establishes the results that govern the design: the support restriction is without loss of optimality; a canceller estimated over a support that contains the target delay absorbs the echo by a computable factor; the radar SINR has a closed-form ceiling set by the non-reconstructible SI, here modeled as spatially white; the pre-ADC SI power achievable under a tap budget has a closed form; and the optimal design changes over from communication to sensing at a closed-form weight. Proofs are given in the Appendix.
Delay Selectivity Is Without Loss of Optimality
Let J ( W , { u q } , { C A [ d ] } , { C D [ d ] } ) = ∑ k α k γ k + ∑ q α q γ q \mathcal{J}(\mathbf{W},\{\mathbf{u}_{q}\},\{\mathbf{C}_{\mathrm{A}}[d]\},\{\mathbf{C}_{\mathrm{D}}[d]\})=\sum_{k}\alpha_{k}\gamma_{k}+\sum_{q}\alpha_{q}\gamma_{q} J ( W , { u q } , { C A [ d ]} , { C D [ d ]}) = ∑ k α k γ k + ∑ q α q γ q denote the weighted sum-SINR with nonnegative weights, evaluated with (4) and (20), where the sums in (14) and (19) now run over every delay at which a canceller tap is nonzero.
Proposition 1 (Support invariance): Let { C A [ d ] , C D [ d ] } d ∈ Z \{\mathbf{C}_{\mathrm{A}}[d],\mathbf{C}_{\mathrm{D}}[d]\}_{d\in\mathbb{Z}} { C A [ d ] , C D [ d ] } d ∈ Z be any cancellers with finite support, and let { C A ′ [ d ] , C D ′ [ d ] } \{\mathbf{C}'_{\mathrm{A}}[d],\mathbf{C}'_{\mathrm{D}}[d]\} { C A ′ [ d ] , C D ′ [ d ]} be obtained by setting to zero every tap with d ∉ D S I d\notin\mathcal{D}_{\mathrm{SI}} d ∈ / D SI . Then, for every W \mathbf{W} W and { u q } \{\mathbf{u}_q\} { u q } , the primed cancellers satisfy the tap-norm and pre-ADC constraints whenever the unprimed ones do, and J \mathcal{J} J does not decrease. Consequently, the delay-support restriction C A [ d ] = C D [ d ] = 0 \mathbf{C}_{\mathrm{A}}[d]=\mathbf{C}_{\mathrm{D}}[d]=\mathbf{0} C A [ d ] = C D [ d ] = 0 , d ∉ D S I d\notin\mathcal{D}_{\mathrm{SI}} d ∈ / D SI , can be imposed without loss of optimality in any design problem whose objective is nondecreasing in each γ q \gamma_q γ q and γ k \gamma_k γ k .
The proposition states that delay selectivity adds no degree of freedom: a tap at d ∉ D S I d\notin\mathcal{D}_{\mathrm{SI}} d ∈ / D SI can only add a positive semidefinite term to the interference, coherently integrated if d = d q d=d_q d = d q , consume budget, and increase the pre-ADC power. Its role is therefore not to improve the optimum but to make the optimum reachable when the cancellers are estimated from data, which is the subject of the next result.
Echo Absorption by a Non-Delay-Selective Canceller
The estimate H ^ S I [ d ] \widehat{\mathbf{H}}_{\mathrm{SI}}[d] H SI [ d ] from which the cancellers are computed is itself obtained by regressing received samples on delayed transmit symbols, and the echo is present in those samples. The next result shows that the support of that regression decides whether the echo survives. Consider a least-squares (LS) canceller with support S ⊂ Z \mathcal{S}\subset\mathbb{Z} S ⊂ Z , estimated from the N p N_p N p post-analog samples Y = [ y [ 1 ] , … , y [ N p ] ] \mathbf{Y}=[\mathbf{y}[1],\ldots,\mathbf{y}[N_p]] Y = [ y [ 1 ] , … , y [ N p ]] and the stacked regressors X = [ X d ] d ∈ S \mathbf{X}=[\mathbf{X}_d]_{d\in\mathcal{S}} X = [ X d ] d ∈ S , X d = [ x [ 1 − d ] , … , x [ N p − d ] ] \mathbf{X}_d=[\mathbf{x}[1-d],\ldots,\mathbf{x}[N_p-d]] X d = [ x [ 1 − d ] , … , x [ N p − d ]] , as [ C [ d ] ] d ∈ S = Y X † [\mathbf{C}[d]]_{d\in\mathcal{S}}=\mathbf{Y}\mathbf{X}^{\dagger} [ C [ d ] ] d ∈ S = Y X † , and applied to the same block.
Lemma 1 (Echo absorption): Let x [ n ] \mathbf{x}[n] x [ n ] be temporally white with covariance R x \mathbf{R}_x R x , and let ϕ ˉ q = N p − 1 ∑ n = 1 N p ϕ q [ n ] \bar{\phi}_q=N_p^{-1}\sum_{n=1}^{N_p}\phi_q[n] ϕ ˉ q = N p − 1 ∑ n = 1 N p ϕ q [ n ] and ζ q = ∣ ϕ ˉ q ∣ 2 ∈ [ 0 , 1 ] \zeta_q=|\bar{\phi}_q|^2\in[0,1] ζ q = ∣ ϕ ˉ q ∣ 2 ∈ [ 0 , 1 ] denote the coherence of the echo phase over the CPI. As N p → ∞ N_p\to\infty N p → ∞ :
(a) if S ⊆ D S I \mathcal{S}\subseteq\mathcal{D}_{\mathrm{SI}} S ⊆ D SI , then C [ d ] → H ^ A [ d ] R x R x † \mathbf{C}[d]\to\widehat{\mathbf{H}}_{\mathrm{A}}[d]\mathbf{R}_x\mathbf{R}_x^\dagger C [ d ] → H A [ d ] R x R x † for d ∈ S d\in\mathcal{S} d ∈ S , which removes the reconstructible post-analog SI generated by x [ n ] \mathbf{x}[n] x [ n ] on S \mathcal{S} S , leaves Δ n [ d ] \Delta_n[d] Δ n [ d ] , and leaves the range-compressed echo unchanged;
(b) if d q ∈ S d_q\in\mathcal{S} d q ∈ S , then C [ d q ] → ρ q ϕ ˉ q H q R x R x † \mathbf{C}[d_q]\to\rho_q\bar{\phi}_q\mathbf{H}_q\mathbf{R}_x\mathbf{R}_x^\dagger C [ d q ] → ρ q ϕ ˉ q H q R x R x † , and the range-compressed output equals that of the samples without the fitted taps, compressed with the reference ϕ q ∗ [ n ] − ϕ ˉ q ∗ \phi_q^*[n]-\bar{\phi}_q^* ϕ q ∗ [ n ] − ϕ ˉ q ∗ instead of ϕ q ∗ [ n ] \phi_q^*[n] ϕ q ∗ [ n ] . The echo power is scaled by ( 1 − ζ q ) (1-\zeta_q) ( 1 − ζ q ) and the power of the residual SI and noise by 1 − ζ q 1-\zeta_q 1 − ζ q , so that
γ q N D = ( 1 − ζ q ) γ q ( 1 + O ( ∣ S ∣ N t N p ) ) , (21) \gamma_q^{\mathrm{ND}}=(1-\zeta_q)\gamma_q\left(1+O\left(\frac{|\mathcal{S}|N_t}{N_p}\right)\right), \tag*{(21)} γ q ND = ( 1 − ζ q ) γ q ( 1 + O ( N p ∣ S ∣ N t ) ) , (21) where γ q \gamma_q γ q is the SINR obtained with the same ( R x , u q ) (\mathbf{R}_x,\mathbf{u}_q) ( R x , u q ) and the delay-selective canceller of (a) on S ∩ D S I \mathcal{S}\cap\mathcal{D}_{\mathrm{SI}} S ∩ D SI .
Corollary 1 (Coherence factor in closed form): For a Doppler offset f D f_D f D of the echo in the samples from which the canceller is estimated, ϕ q [ n ] = e j 2 π f D n T s \phi_q[n]=e^{j2\pi f_D nT_s} ϕ q [ n ] = e j 2 π f D n T s , and N p ≫ 1 N_p\gg1 N p ≫ 1 ,
ζ q = sinc 2 ( f D T c p i ) . (22) \zeta_q=\operatorname{sinc}^2(f_D T_{\mathrm{cpi}}). \tag*{(22)} ζ q = sinc 2 ( f D T cpi ) . (22)
Around the zero-Doppler instant, ϕ q ( t ) = e − j π f R t 2 \phi_q(t)=e^{-j\pi f_Rt^2} ϕ q ( t ) = e − j π f R t 2 for t ∈ [ − T c p i / 2 , T c p i / 2 ] t\in[-T_{\mathrm{cpi}}/2,T_{\mathrm{cpi}}/2] t ∈ [ − T cpi /2 , T cpi /2 ] with Doppler rate f R = 2 v e f f 2 / ( λ c R q ) f_R=2v_{\mathrm{eff}}^2/(\lambda_cR_q) f R = 2 v eff 2 / ( λ c R q ) , and
ζ q = C 2 ( X ) + S 2 ( X ) X 2 , X = f R T c p i 2 2 . (23) \zeta_q=\frac{C^2(X)+S^2(X)}{X^2},\qquad X=\sqrt{\frac{f_RT_{\mathrm{cpi}}^2}{2}}. \tag*{(23)} ζ q = X 2 C 2 ( X ) + S 2 ( X ) , X = 2 f R T cpi 2 . (23)
where C ( ⋅ ) C(\cdot) C ( ⋅ ) and S ( ⋅ ) S(\cdot) S ( ⋅ ) are the Fresnel cosine and sine integrals, and v e f f v_{\mathrm{eff}} v eff is the effective relative velocity.
Lemma 1 makes precise what the separation buys. The SI channel has no energy at d q d_q d q , so the tap that a non-delay-selective canceller places there is made entirely of echo, whose coherent part ϕ ˉ q \bar{\phi}_q ϕ ˉ q is fitted and removed. Because the fit is orthogonal to the regressor x [ n − d q ] \mathbf{x}[n-d_q] x [ n − d q ] , which is also the range-compression reference, the residual SI and noise in the target bin are reduced in the same proportion as the remaining echo amplitude, so the SINR loss is 1 − ζ q 1-\zeta_q 1 − ζ q . Near the zero-Doppler crossing ζ q \zeta_q ζ q is close to one: for f R = 2.2 × 10 4 f_R=2.2\times10^4 f R = 2.2 × 1 0 4 Hz/s and T c p i = 5 T_{\mathrm{cpi}}=5 T cpi = 5 ms, ζ q = 0.983 \zeta_q=0.983 ζ q = 0.983 and the loss is 17.8 dB. For f D T c p i ≥ 1 f_DT_{\mathrm{cpi}}\ge1 f D T cpi ≥ 1 , i.e., ∣ t ∣ ≥ 1 / ( f R T c p i ) ≈ 9 |t|\ge1/(f_RT_{\mathrm{cpi}})\approx9 ∣ t ∣ ≥ 1/ ( f R T cpi ) ≈ 9 ms from the zero-Doppler instant since f D ≈ f R t f_D\approx f_Rt f D ≈ f R t , the echo decorrelates within the CPI and the loss vanishes, but the Doppler compensation in (16) and the range-walk correction are then mandatory. The delay-selective canceller of part (a) is immune in all cases. Lemma 1 concerns a canceller estimated on the block to which it is applied, as in on-line estimation from the operating signal, which is also the setting of Figure 5 . If the taps are estimated on other data, the tap at d q d_q d q reflects the echo contained in those data: it absorbs the current echo to the extent that the two are coherent, e.g., for a target observed again with the same reflection coefficient and phase history, and otherwise subtracts a replica uncorrelated with the current echo, which only adds interference (Proposition 1). An echo-free calibration sequence, or the delay-selective support, avoids both effects.
Figure 5. LS cancellers estimated on the CPI at the zero-Doppler crossing (4 × 4 4 \times4 4 × 4 , N p = 4000 N_{\mathrm{p}} = 4000 N p = 4000 , INR = 40 dB): SINR of the non-delay-selective (ND) canceller relative to the delay-selective (DS) canceller, and of the DS canceller relative to the known-SI receiver.
Define the interference-to-noise ratio per receive branch under isotropic transmission at full power,
I N R = P max ∑ d ∈ D S I ∥ H S I [ d ] ∥ F 2 N r N t σ r 2 , (24) \mathrm{INR}=\frac{P_{\max}\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\lVert\mathbf{H}_{\mathrm{SI}}[d]\rVert_F^2}{N_rN_t\sigma_r^2}, \tag*{(24)} INR = N r N t σ r 2 P m a x ∑ d ∈ D SI ∥ H SI [ d ] ∥ F 2 , (24)
so that σ Δ 2 P max / σ r 2 = ϵ 2 I N R \sigma_\Delta^2P_{\max}/\sigma_r^2=\epsilon^2\mathrm{INR} σ Δ 2 P m a x / σ r 2 = ϵ 2 INR , and the half-duplex (HD) sensing signal-to-noise ratio (SNR) of target q q q ,
γ ˉ q = N p σ q 2 ∣ β q ∣ 2 N r N t P max σ r 2 , (25) \bar{\gamma}_q=\frac{N_p\sigma_q^2|\beta_q|^2N_rN_tP_{\max}}{\sigma_r^2}, \tag*{(25)} γ ˉ q = σ r 2 N p σ q 2 ∣ β q ∣ 2 N r N t P m a x , (25)
obtained by beamforming P max P_{\max} P m a x toward the target without SI.
Proposition 2 (Radar SINR ceiling): Under the model (11) of the non-reconstructible SI, for every transmit covariance with tr ( R x ) ≤ P max \operatorname{tr}(\mathbf{R}_x)\le P_{\max} tr ( R x ) ≤ P m a x , every unit-norm combiner, and all linear cancellers,
γ q ≤ γ q ⋆ ≜ γ ˉ q 1 + ϵ 2 I N R ( 1 + ϱ N r ) . (26) \gamma_q\le\gamma_q^\star\triangleq\frac{\bar{\gamma}_q}{1+\epsilon^2\mathrm{INR}(1+\varrho N_r)}. \tag*{(26)} γ q ≤ γ q ⋆ ≜ 1 + ϵ 2 INR ( 1 + ϱ N r ) γ ˉ q . (26) The bound is attained by R x = P max a q a q H / N t \mathbf{R}_x=P_{\max}\mathbf{a}_q\mathbf{a}_q^{\mathsf{H}}/N_t R x = P m a x a q a q H / N t , u q = a r / N r \mathbf{u}_q=\mathbf{a}_r/\sqrt{N_r} u q = a r / N r , C D [ d ] = 0 \mathbf{C}_{\mathrm{D}}[d]=\mathbf{0} C D [ d ] = 0 , and C A [ d ] = H ^ S I [ d ] a q a q H / N t \mathbf{C}_{\mathrm{A}}[d]=\widehat{\mathbf{H}}_{\mathrm{SI}}[d]\mathbf{a}_q\mathbf{a}_q^{\mathsf{H}}/N_t C A [ d ] = H SI [ d ] a q a q H / N t , provided that ∑ d ∥ H ^ S I [ d ] a q ∥ 2 2 / N t ≤ P A max \sum_d\lVert\widehat{\mathbf{H}}_{\mathrm{SI}}[d]\mathbf{a}_q\rVert_2^2/N_t\le P_{\mathrm{A}}^{\max} ∑ d ∥ H SI [ d ] a q ∥ 2 2 / N t ≤ P A m a x and N r σ Δ 2 P max ≤ P A D C max N_r\sigma_\Delta^2P_{\max}\le P_{\mathrm{ADC}}^{\max} N r σ Δ 2 P m a x ≤ P ADC m a x .
Under this model, the ceiling depends on the SI only through the product ϵ 2 I N R \epsilon^2\mathrm{INR} ϵ 2 INR : the reconstructible part of the SI can always be removed from the target bin, so the sensing performance of an FD LEO payload is limited by the power of the SI that no linear canceller can reconstruct, ϵ 2 I N R \epsilon^2\mathrm{INR} ϵ 2 INR , and not by the reconstructible coupling, however strong it is. For
INR = 47 dB and ϵ 2 = − 50 \epsilon^2 = -50 ϵ 2 = − 50 dB, the gap to the HD benchmark is 10 log 10 ( 1 + 10 − 0.3 ) = 1.8 10\log_{10}(1+10^{-0.3})=1.8 10 log 10 ( 1 + 1 0 − 0.3 ) = 1.8 dB; with ϵ 2 = − 30 \epsilon^2=-30 ϵ 2 = − 30 dB it is 17 dB. Since ϱ N r = 10 − S Q N R / 10 ≪ 1 \varrho_{N_r}=10^{-\mathrm{SQNR}/10}\ll1 ϱ N r = 1 0 − SQNR /10 ≪ 1 for any practical ADC, quantization does not affect the ceiling; it affects feasibility through the pre-ADC constraint, which is the subject of the next result.
The ceiling is thus a property of the impairment model, not of the architecture alone. In (11), the non-reconstructible SI is spatially white at the receiver and proportional to tr ( R x ) \operatorname{tr}(\mathbf{R}_x) tr ( R x ) , so no combiner can avoid it. If its contribution to the target bin has instead a general covariance Σ Δ ( R x ) ⪰ 0 \boldsymbol{\Sigma}_{\Delta}(\mathbf{R}_x)\succeq0 Σ Δ ( R x ) ⪰ 0 , e.g., for transmitter noise radiated through the coupling channel, dropping the reconstructible residual and the quantization noise and maximizing over u q \mathbf{u}_q u q as in the proof gives
γ q ≤ N p σ q 2 ∣ β q ∣ 2 max tr ( R x ) ≤ P max a t H R x a t a r H ( σ r 2 I N r + Σ Δ ( R x ) ) − 1 a r . \gamma_q\leq N_p\sigma_q^2\lvert\beta_q\rvert^2\max_{\operatorname{tr}(\mathbf{R}_x)\leq P_{\max}}\frac{\mathbf{a}_t^H\mathbf{R}_x\mathbf{a}_t}{\mathbf{a}_r^H(\sigma_r^2\mathbf{I}_{N_r}+\boldsymbol{\Sigma}_{\Delta}(\mathbf{R}_x))^{-1}\mathbf{a}_r}. γ q ≤ N p σ q 2 ∣ β q ∣ 2 tr ( R x ) ≤ P m a x max a r H ( σ r 2 I N r + Σ Δ ( R x ) ) − 1 a r a t H R x a t .
which reduces to (26), up to the quantization factor, for Σ Δ ( R x ) = σ Δ 2 tr ( R x ) I N r \boldsymbol{\Sigma}_{\Delta}(\mathbf{R}_x)=\sigma_{\Delta}^2\operatorname{tr}(\mathbf{R}_x)\mathbf{I}_{N_r} Σ Δ ( R x ) = σ Δ 2 tr ( R x ) I N r . A correlated floor can raise the ceiling, when the combiner can steer away from it, or lower it, when it concentrates along a r ( θ q ) \mathbf{a}_r(\theta_q) a r ( θ q ) ; Section VI uses the spatially white model.
Pre-ADC SI Power Under a Tap Budget
Let R x = ∑ j = 1 N t p j f j f j H \mathbf{R}_x=\sum_{j=1}^{N_t}p_j\mathbf{f}_j\mathbf{f}_j^H R x = ∑ j = 1 N t p j f j f j H be the eigendecomposition of the transmit covariance, with p j ≥ 0 p_j\geq0 p j ≥ 0 the power in eigendirection f j \mathbf{f}_j f j , and let h j = ∑ d ∈ D S I ∥ H ^ S I [ d ] f j ∥ 2 2 h_j=\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\lVert\widehat{\mathbf{H}}_{\mathrm{SI}}[d]\mathbf{f}_j\rVert_2^2 h j = ∑ d ∈ D SI ∥ H SI [ d ] f j ∥ 2 2 be the SI-channel energy in that direction.
Lemma 2 (Minimum pre-ADC SI power): The minimum of Π A = ∑ d ∈ D S I tr ( H ^ A [ d ] R x H ^ A H [ d ] ) \Pi_A=\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\operatorname{tr}\left(\widehat{\mathbf{H}}_A[d]\mathbf{R}_x\widehat{\mathbf{H}}_A^H[d]\right) Π A = ∑ d ∈ D SI tr ( H A [ d ] R x H A H [ d ] ) over analog cancellers with ∑ d ∥ C A [ d ] ∥ F 2 ≤ P A max \sum_d\lVert\mathbf{C}_A[d]\rVert_F^2\leq P_A^{\max} ∑ d ∥ C A [ d ] ∥ F 2 ≤ P A m a x is
Π A min ( P A max ) = ∑ j = 1 N t ϑ 2 p j h j ( p j + ϑ ) 2 , (27) \Pi_A^{\min}(P_A^{\max})=\sum_{j=1}^{N_t}\frac{\vartheta^2p_jh_j}{(p_j+\vartheta)^2}, \tag*{(27)} Π A m i n ( P A m a x ) = j = 1 ∑ N t ( p j + ϑ ) 2 ϑ 2 p j h j , (27)
attained by C A [ d ] = H ^ S I [ d ] R x ( R x + ϑ I N t ) − 1 \mathbf{C}_A[d]=\widehat{\mathbf{H}}_{\mathrm{SI}}[d]\mathbf{R}_x(\mathbf{R}_x+\vartheta\mathbf{I}_{N_t})^{-1} C A [ d ] = H SI [ d ] R x ( R x + ϑ I N t ) − 1 (read as H ^ S I [ d ] R x R x † \widehat{\mathbf{H}}_{\mathrm{SI}}[d]\mathbf{R}_x\mathbf{R}_x^{\dagger} H SI [ d ] R x R x † if ϑ = 0 \vartheta=0 ϑ = 0 and R x \mathbf{R}_x R x is singular, in which case the minimizer is not unique), where ϑ = 0 \vartheta=0 ϑ = 0 if ∑ j : p j > 0 h j ≤ P A max \sum_{j:p_j>0}h_j\leq P_A^{\max} ∑ j : p j > 0 h j ≤ P A m a x and otherwise ϑ > 0 \vartheta>0 ϑ > 0 is the unique root of ∑ j p j 2 h j / ( p j + ϑ ) 2 = P A max \sum_j p_j^2h_j/(p_j+\vartheta)^2=P_A^{\max} ∑ j p j 2 h j / ( p j + ϑ ) 2 = P A m a x .
Corollary 2 (Budget for full cancellation): The known SI can be removed completely before the ADCs if and only if
P A max ≥ P A ⋆ ( R x ) ≜ ∑ j : p j > 0 h j . (28) P_A^{\max}\geq P_A^\star(\mathbf{R}_x)\triangleq\sum_{j:p_j>0}h_j. \tag*{(28)} P A m a x ≥ P A ⋆ ( R x ) ≜ j : p j > 0 ∑ h j . (28)
If rank ( R x ) = r \operatorname{rank}(\mathbf{R}_x)=r rank ( R x ) = r and the eigenvectors are isotropically distributed and independent of H ^ S I \widehat{\mathbf{H}}_{\mathrm{SI}} H SI , then E { P A ⋆ ( R x ) } = ( r / N t ) ∑ d ∥ H ^ S I [ d ] ∥ F 2 \mathbb{E}\{P_A^\star(\mathbf{R}_x)\}=(r/N_t)\sum_d\lVert\widehat{\mathbf{H}}_{\mathrm{SI}}[d]\rVert_F^2 E { P A ⋆ ( R x )} = ( r / N t ) ∑ d ∥ H SI [ d ] ∥ F 2 , i.e., a relative tap budget ξ A = P A max / ∑ d ∥ H ^ S I [ d ] ∥ F 2 \xi_A=P_A^{\max}/\sum_d\lVert\widehat{\mathbf{H}}_{\mathrm{SI}}[d]\rVert_F^2 ξ A = P A m a x / ∑ d ∥ H SI [ d ] ∥ F 2 of about r / N t r/N_t r / N t suffices on average; for the structured near-field coupling of (10) the realization-dependent factor lies between 0.37 and 1.61 in the scenarios of Section VI.
Corollary 2 is the practical companion of Proposition 2. At the sensing-optimal point the transmit covariance has rank one, so a budget of about $1/N_t$ of the SI-channel energy suffices to reach the ceiling; the exact condition of Proposition 2, ∑ d ∥ H ^ S I [ d ] a t ∥ 2 2 / N t ≤ P A max \sum_d\lVert\widehat{\mathbf{H}}_{\mathrm{SI}}[d]\mathbf{a}_t\rVert_2^2/N_t\leq P_A^{\max} ∑ d ∥ H SI [ d ] a t ∥ 2 2 / N t ≤ P A m a x , holds with ξ A = 0.1 \xi_A=0.1 ξ A = 0.1 in 100% of the realizations of Section VI for $N_t=16 but only in 40% for N t = 8 N_t=8 N t = 8 , and a rank-Q Q Q sensing covariance for Q Q Q targets needs about Q / N t Q/N_t Q / N t . When the budget is insufficient, Π A min > 0 \Pi_A^{\min}>0 Π A m i n > 0 and the design must either accept residual SI in the target bin or steer the transmit covariance away from the strongly coupled eigendirections, which costs illumination power. Lemma 2 also settles the cost of FD operation on the downlink: if Π A min ( P A max ) + N r σ Δ 2 P max ≤ P A D C max \Pi_A^{\min}(P_A^{\max})+N_r\sigma_{\Delta}^2P_{\max}\leq P_{\mathrm{ADC}}^{\max} Π A m i n ( P A m a x ) + N r σ Δ 2 P m a x ≤ P ADC m a x at the HD-optimal communication covariance, the HD beamformers are feasible for the FD problem and FD sensing costs nothing on the communication side at low sensing weights, as confirmed in Section VI.
Communication–Sensing Change-Over
The weighted sum-SINR is linear in the SINRs, and once the reconstructible SI is cancelled the SINRs are linear in the power given to each function. The optimal design therefore switches abruptly between communication and sensing, at a weight that has a closed form. Let Q = 1 Q=1 Q = 1 and weigh the two functions by α c , α r ≥ 0 \alpha_c,\alpha_r\geq0 α c , α r ≥ 0 , α c + α r = 1 \alpha_c+\alpha_r=1 α c + α r = 1 , each normalized by its HD benchmark, i.e., consider the objective α c ∑ k γ k / Γ ‾ c + α r γ q / γ ‾ q \alpha_c\sum_k\gamma_k/\overline{\Gamma}_c+\alpha_r\gamma_q/\overline{\gamma}_q α c ∑ k γ k / Γ c + α r γ q / γ q adopted in Section IV, where Γ ‾ c \overline{\Gamma}_c Γ c is the HD communication sum-SINR, i.e., the maximum of ∑ k γ k \sum_k\gamma_k ∑ k γ k without sensing and without SI, and let
ρ ‾ = γ q ⋆ γ ‾ q = 1 1 + ϵ 2 INR ( 1 + ϱ N r ) (29) \overline{\rho}=\frac{\gamma_q^\star}{\overline{\gamma}_q}=\frac{1}{1+\epsilon^2\operatorname{INR}(1+\varrho N_r)} \tag*{(29)} ρ = γ q γ q ⋆ = 1 + ϵ 2 INR ( 1 + ϱ N r ) 1 (29)
be the normalized ceiling of Proposition 2.
Proposition 3 (Change-over weight): Let the user channels be mutually orthogonal and orthogonal to the target, h k H h j = 0 \mathbf{h}_k^H\mathbf{h}_j=0 h k H h j = 0 for k ≠ j k\neq j k = j and h k H a t ( θ q ) = 0 \mathbf{h}_k^H\mathbf{a}_t(\theta_q)=0 h k H a t ( θ q ) = 0 . Then every feasible point has normalized objective α c ∑ k γ k / Γ ‾ c + α r γ q / γ ‾ q ≤ max { α c , α r ρ ‾ } \alpha_c\sum_k\gamma_k/\overline{\Gamma}_c+\alpha_r\gamma_q/\overline{\gamma}_q\leq\max\{\alpha_c,\alpha_r\overline{\rho}\} α c ∑ k γ k / Γ c + α r γ q / γ q ≤ max { α c , α r ρ } . If, in addition, the HD-optimal communication beamformers satisfy the pre-ADC constraint and the conditions of Proposition 2 hold, the bound is attained, by serving only the users for α r < α r ⋆ \alpha_r<\alpha_r^\star α r < α r ⋆ and only the target for α r > α r ⋆ \alpha_r>\alpha_r^\star α r > α r ⋆ , where
α r ⋆ = 1 1 + ρ ‾ = 1 + ϵ 2 INR ( 1 + ϱ N r ) 2 + ϵ 2 INR ( 1 + ϱ N r ) . (30) \alpha_r^\star=\frac{1}{1+\overline{\rho}}=\frac{1+\epsilon^2\operatorname{INR}(1+\varrho N_r)}{2+\epsilon^2\operatorname{INR}(1+\varrho N_r)}. \tag*{(30)} α r ⋆ = 1 + ρ 1 = 2 + ϵ 2 INR ( 1 + ϱ N r ) 1 + ϵ 2 INR ( 1 + ϱ N r ) . (30)
An SI-unaware design, which ignores the floor, behaves as if ρ ‾ = 1 \overline{\rho}=1 ρ = 1 and changes over at α r = 1 / 2 \alpha_r=1/2 α r = 1/2 , too early; the joint design keeps serving the users up to α r ⋆ > 1 / 2 \alpha_r^\star>1/2 α r ⋆ > 1/2 , e.g., α r ⋆ ≈ 0.60 \alpha_r^\star\approx0.60 α r ⋆ ≈ 0.60 for ϵ 2 INR = − 3 \epsilon^2\operatorname{INR}=-3 ϵ 2 INR = − 3 dB. Equivalently, the floor multiplies the change-over odds α r ⋆ / ( 1 − α r ⋆ ) \alpha_r^\star/(1-\alpha_r^\star) α r ⋆ / ( 1 − α r ⋆ ) by 1 + ϵ 2 INR ( 1 + ϱ N r ) 1+\epsilon^2\operatorname{INR}(1+\varrho N_r) 1 + ϵ 2 INR ( 1 + ϱ N r ) ; without the normalization, i.e., for α c ∑ k γ k + α r γ q \alpha_c\sum_k\gamma_k+\alpha_r\gamma_q α c ∑ k γ k + α r γ q , they would in addition be scaled by Γ ‾ c / γ ‾ q \overline{\Gamma}_c/\overline{\gamma}_q Γ c / γ q , about 19 and 22 dB in Section VI, which moves the change-over to α r ≈ 0.99 \alpha_r\approx0.99 α r ≈ 0.99 . With users that are only nearly orthogonal, the change-over is spread over a narrow range of α r \alpha_r α r around α r ⋆ \alpha_r^\star α r ⋆ . The same linearity drives the allocation among several targets (Section V-F).
We jointly optimize the communication beamformers, the sensing covariance, the Q Q Q radar combiners, and the delay-selective analog and digital cancellers. By Proposition 1, the support restriction is imposed as a constraint without loss of optimality. The weighted sum-SINR maximization problem is
m a x i m i z e { w k } , R s , { u q } , { C A [ d ] } , { C D [ d ] } α c ∑ k = 1 K γ k Γ ‾ c + α r Q ∑ q = 1 Q γ q γ ‾ q s u b j e c t t o tr ( R x ) ≤ P max , tr ( R A S I ) ≤ P A D C max , ∑ d ∥ C A [ d ] ∥ F 2 ≤ P A max , ∑ d ∥ C D [ d ] ∥ F 2 ≤ P D max , C A [ d ] = C D [ d ] = 0 , d ∉ D S I , ∥ u q ∥ 2 = 1 , q ∈ Q , R s ⪰ 0. (31) \begin{aligned}
\mathop{\mathrm{maximize}}_{\{\mathbf{w}_k\},\mathbf{R}_s,\{\mathbf{u}_q\},\{\mathbf{C}_A[d]\},\{\mathbf{C}_D[d]\}}\quad
&\alpha_c\sum_{k=1}^{K}\frac{\gamma_k}{\overline{\Gamma}_c}
+\frac{\alpha_r}{Q}\sum_{q=1}^{Q}\frac{\gamma_q}{\overline{\gamma}_q}\\
\mathrm{subject\ to}\quad
&\operatorname{tr}(\mathbf{R}_x)\le P_{\max},\\
&\operatorname{tr}(\mathbf{R}_A^{\mathrm{SI}})\le P_{\mathrm{ADC}}^{\max},\\
&\sum_d\lVert\mathbf{C}_A[d]\rVert_F^2\le P_A^{\max},\\
&\sum_d\lVert\mathbf{C}_D[d]\rVert_F^2\le P_D^{\max},\\
&\mathbf{C}_A[d]=\mathbf{C}_D[d]=\mathbf{0},\quad d\notin\mathcal{D}_{\mathrm{SI}},\\
&\lVert\mathbf{u}_q\rVert_2=1,\quad q\in\mathcal{Q},\quad\mathbf{R}_s\succeq0. \tag*{(31)}
\end{aligned} maximize { w k } , R s , { u q } , { C A [ d ]} , { C D [ d ]} subject to α c k = 1 ∑ K Γ c γ k + Q α r q = 1 ∑ Q γ q γ q tr ( R x ) ≤ P m a x , tr ( R A SI ) ≤ P ADC m a x , d ∑ ∥ C A [ d ] ∥ F 2 ≤ P A m a x , d ∑ ∥ C D [ d ] ∥ F 2 ≤ P D m a x , C A [ d ] = C D [ d ] = 0 , d ∈ / D SI , ∥ u q ∥ 2 = 1 , q ∈ Q , R s ⪰ 0. (31)
The weights α c , α r ≥ 0 \alpha_c,\alpha_r\ge0 α c , α r ≥ 0 , α c + α r = 1 \alpha_c+\alpha_r=1 α c + α r = 1 , set the priority of communication and sensing, and each function is normalized by its HD benchmark, Γ ‾ c \overline{\Gamma}_c Γ c of Section III-E and γ ‾ q \overline{\gamma}_q γ q of (25). The normalization makes α r \alpha_r α r scale-free: without it, the sensing term would matter only for α r \alpha_r α r close to one (Section III-E); with it, α r = 0 \alpha_r=0 α r = 0 and 1 give the communication-only and the sensing-only design, and the change-over lies at α r ⋆ \alpha_r^\star α r ⋆ . All users share one weight, so the objective favors the strongest channels, as does Γ ‾ c \overline{\Gamma}_c Γ c ; per-user priorities, like the per-target weights of Section V-F, only change the per-SINR weights of Section V. The threshold P A D C max P_{\mathrm{ADC}}^{\max} P ADC m a x in (31c) is the admissible SI power at the ADC inputs, summed over the N r N_r N r branches; we set it to the level at which the quantization noise equals the thermal noise, P A D C max = N r σ r 2 10 S Q N R / 10 P_{\mathrm{ADC}}^{\max}=N_r\sigma_r^2 10^{\mathrm{SQNR}/10} P ADC m a x = N r σ r 2 1 0 SQNR /10 , and below it the quantization noise is accounted for in (18). The significantly weaker target and noise powers are neglected in (31c). Constraints (31d) and (31e) impose tap-norm budgets, which are dimensionless (as ∥ H S I [ d ] ∥ F 2 \lVert\mathbf{H}_{\mathrm{SI}}[d]\rVert_F^2 ∥ H SI [ d ] ∥ F 2 ) and are specified relative to ∑ d ∥ H ~ S I [ d ] ∥ F 2 \sum_d\lVert\widetilde{\mathbf{H}}_{\mathrm{SI}}[d]\rVert_F^2 ∑ d ∥ H SI [ d ] ∥ F 2 through ξ A \xi_A ξ A and ξ D \xi_D ξ D .
Problem (31) couples beamforming and cancellation because R x \mathbf{R}_x R x determines the communication SINRs, the illumination of every target, the pre-ADC SI power, and the residual SI in every target bin, while the cancellers determine how much generated SI survives the analog and digital stages. It is non-convex: the objective is a sum of K + Q K+Q K + Q fractional quadratic functions, and the transmit and cancellation variables are coupled through (14) and (19).
Proposed Algorithm
We employ the quadratic transform [31 ] together with block-coordinate optimization. For fixed auxiliary and dual variables, every primal block admits a closed-form update. The updates hold for the weighted sum-SINR J = ∑ k α k γ k + ∑ q α q γ q \mathcal{J}=\sum_k\alpha_k\gamma_k+\sum_q\alpha_q\gamma_q J = ∑ k α k γ k + ∑ q α q γ q of Proposition 1 with any nonnegative per-SINR weights; (31a) is the case α k = α c / Γ ‾ c \alpha_k=\alpha_c/\overline{\Gamma}_c α k = α c / Γ c for every k k k and α q = α r / ( Q γ ‾ q ) \alpha_q=\alpha_r/(Q\overline{\gamma}_q) α q = α r / ( Q γ q ) . The derivation assumes continuous, fully connected cancellation matrices over D S I \mathcal{D}_{\mathrm{SI}} D SI ; the effect of projecting the analog solution onto quantized hardware is evaluated in Section VI.
Equivalent Transmit-Matrix Representation
Since R s ⪰ 0 \mathbf{R}_s\succeq0 R s ⪰ 0 , write R s = V V H \mathbf{R}_s=\mathbf{V}\mathbf{V}^{H} R s = V V H with V ∈ C N t × N s \mathbf{V}\in\mathbb{C}^{N_t\times N_s} V ∈ C N t × N s ; N s = N t N_s=N_t N s = N t represents any feasible sensing covariance. Define W = [ w 1 , … , w K , V ] = [ q 1 , … , q M ] \mathbf{W}=[\mathbf{w}_1,\ldots,\mathbf{w}_K,\mathbf{V}]=[\mathbf{q}_1,\ldots,\mathbf{q}_M] W = [ w 1 , … , w K , V ] = [ q 1 , … , q M ] , M = K + N s M=K+N_s M = K + N s , so that R x = W W H = ∑ m = 1 M q m q m H \mathbf{R}_x=\mathbf{W}\mathbf{W}^{H}=\sum_{m=1}^{M}\mathbf{q}_m\mathbf{q}_m^{H} R x = W W H = ∑ m = 1 M q m q m H . For each user, γ k = ∣ h k H q k ∣ 2 / I k \gamma_k=\lvert\mathbf{h}_k^{H}\mathbf{q}_k\rvert^2/I_k γ k = ∣ h k H q k ∣ 2 / I k , I k = ∑ m ≠ k ∣ h k H q m ∣ 2 + σ k 2 I_k=\sum_{m\ne k}\lvert\mathbf{h}_k^{H}\mathbf{q}_m\rvert^2+\sigma_k^2 I k = ∑ m = k ∣ h k H q m ∣ 2 + σ k 2 . Let U q = u q u q H \mathbf{U}_q=\mathbf{u}_q\mathbf{u}_q^{H} U q = u q u q H denote the post-analog coupling matrix
G A = ∑ d ∈ D S I H ^ A H [ d ] H ^ A [ d ] + N r σ r 2 I N t . (32) \mathbf{G}_A=\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\widehat{\mathbf{H}}_A^{H}[d]\widehat{\mathbf{H}}_A[d]+N_r\sigma_r^2\mathbf{I}_{N_t}. \tag*{(32)} G A = d ∈ D SI ∑ H A H [ d ] H A [ d ] + N r σ r 2 I N t . (32)
so that tr ( R A S I ) = ∑ m q m H G A q m \operatorname{tr}(\mathbf{R}_A^{\mathrm{SI}})=\sum_m\mathbf{q}_m^{H}\mathbf{G}_A\mathbf{q}_m tr ( R A SI ) = ∑ m q m H G A q m , and, for each target, the effective signature and target-bin SI matrix
a q = N p σ q 2 H q H u q , (33) \mathbf{a}_q=\sqrt{N_p\sigma_q^2}\,\mathbf{H}_q^{H}\mathbf{u}_q, \tag*{(33)} a q = N p σ q 2 H q H u q , (33)
B q = ∑ d ∈ D S I H ^ r e s H [ d ] U q H ^ r e s [ d ] + σ r 2 I N t + σ G A . (34) \mathbf{B}_q=\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\widehat{\mathbf{H}}_{\mathrm{res}}^{H}[d]\mathbf{U}_q\widehat{\mathbf{H}}_{\mathrm{res}}[d]+\sigma_r^2\mathbf{I}_{N_t}+\sigma\mathbf{G}_A. \tag*{(34)} B q = d ∈ D SI ∑ H res H [ d ] U q H res [ d ] + σ r 2 I N t + σ G A . (34)
The radar SINR of target q q q becomes
γ q = ∑ m = 1 M ∣ a q H q m ∣ 2 D q , D q = ∑ m = 1 M q m H B q q m + σ r 2 . (35) \gamma_q=\frac{\sum_{m=1}^{M}\lvert\mathbf{a}_q^{H}\mathbf{q}_m\rvert^2}{D_q},
\qquad
D_q=\sum_{m=1}^{M}\mathbf{q}_m^{H}\mathbf{B}_q\mathbf{q}_m+\sigma_r^2. \tag*{(35)} γ q = D q ∑ m = 1 M ∣ a q H q m ∣ 2 , D q = m = 1 ∑ M q m H B q q m + σ r 2 . (35)
For each user, introduce y k ∈ C y_k\in\mathbb{C} y k ∈ C ; the quadratic-transform identity gives
γ k = max y k [ 2 R e { y k ∗ h k H q k } − ∣ y k ∣ 2 I k ] , (36) \gamma_k=\max_{y_k}\left[2\mathop{\mathrm{Re}}\{y_k^{*}\mathbf{h}_k^{H}\mathbf{q}_k\}-\lvert y_k\rvert^2I_k\right], \tag*{(36)} γ k = y k max [ 2 Re { y k ∗ h k H q k } − ∣ y k ∣ 2 I k ] , (36)
maximized by y k = h k H q k / I k y_k=\mathbf{h}_k^{H}\mathbf{q}_k/I_k y k = h k H q k / I k . For each target, introduce z q ∈ C M \mathbf{z}_q\in\mathbb{C}^{M} z q ∈ C M ; then
γ q = max z q [ 2 R e { z q H W H a q } − ∥ z q ∥ 2 2 D q ] , (37) \gamma_q=\max_{\mathbf{z}_q}\left[2\mathop{\mathrm{Re}}\{\mathbf{z}_q^{H}\mathbf{W}^{H}\mathbf{a}_q\}-\lVert\mathbf{z}_q\rVert_2^2D_q\right], \tag*{(37)} γ q = z q max [ 2 Re { z q H W H a q } − ∥ z q ∥ 2 2 D q ] , (37)
maximized by z q = W H a q / D q \mathbf{z}_q=\mathbf{W}^{H}\mathbf{a}_q/D_q z q = W H a q / D q . With all auxiliary variables fixed, the objective is a concave quadratic in W \mathbf{W} W and in each canceller (D q D_q D q is a convex quadratic in each), which is what makes the closed-form updates possible.
For stream m m m , let K m = K ∖ { m } \mathcal{K}_m=\mathcal{K}\setminus\{m\} K m = K ∖ { m } for m ≤ K m\le K m ≤ K and K m = K \mathcal{K}_m=\mathcal{K} K m = K for m > K m>K m > K . The quadratic and linear coefficients are
Q m = ∑ q = 1 Q α q ∥ z q ∥ 2 2 B q + ∑ k ∈ K m α k ∣ y k ∣ 2 h k h k H , (38) \mathbf{Q}_m=\sum_{q=1}^{Q}\alpha_q\lVert\mathbf{z}_q\rVert_2^2\mathbf{B}_q+\sum_{k\in\mathcal{K}_m}\alpha_k\lvert y_k\rvert^2\mathbf{h}_k\mathbf{h}_k^{H}, \tag*{(38)} Q m = q = 1 ∑ Q α q ∥ z q ∥ 2 2 B q + k ∈ K m ∑ α k ∣ y k ∣ 2 h k h k H , (38)
b m = ∑ q = 1 Q α q z q , m ∗ a q + { α m y m h m , m ≤ K , 0 , m > K . (39) \mathbf{b}_m=\sum_{q=1}^{Q}\alpha_q z_{q,m}^{*}\mathbf{a}_q+
\begin{cases}
\alpha_m y_m\mathbf{h}_m,&m\le K,\\
\mathbf{0},&m>K.
\end{cases} \tag*{(39)} b m = q = 1 ∑ Q α q z q , m ∗ a q + { α m y m h m , 0 , m ≤ K , m > K . (39)
and the transmit subproblem is
m a x i m i z e { q m } ∑ m = 1 M [ 2 R e { b m H q m } − q m H Q m q m ] (40) \mathop{\mathrm{maximize}}_{\{\mathbf{q}_m\}}
\sum_{m=1}^{M}\left[2\mathop{\mathrm{Re}}\{\mathbf{b}_m^{H}\mathbf{q}_m\}-\mathbf{q}_m^{H}\mathbf{Q}_m\mathbf{q}_m\right] \tag*{(40)} maximize { q m } m = 1 ∑ M [ 2 Re { b m H q m } − q m H Q m q m ] (40)
subject to
∑ m ∥ q m ∥ 2 2 ≤ P max , ∑ m q m H G A q m ≤ P A D C max . (41) \sum_m\lVert\mathbf{q}_m\rVert_2^2\le P_{\max},\qquad
\sum_m\mathbf{q}_m^{H}\mathbf{G}_A\mathbf{q}_m\le P_{\mathrm{ADC}}^{\max}. \tag*{(41)} m ∑ ∥ q m ∥ 2 2 ≤ P m a x , m ∑ q m H G A q m ≤ P ADC m a x . (41)
With dual variables η , μ ≥ 0 \eta,\mu\ge0 η , μ ≥ 0 for the power and ADC constraints, the Karush–Kuhn–Tucker (KKT) conditions yield
q m = ( Q m + η I N t + μ G A ) − 1 b m (42) \mathbf{q}_m=(\mathbf{Q}_m+\eta\mathbf{I}_{N_t}+\mu\mathbf{G}_A)^{-1}\mathbf{b}_m \tag*{(42)} q m = ( Q m + η I N t + μ G A ) − 1 b m (42)
(the Moore–Penrose inverse if singular). Since Q m \mathbf{Q}_m Q m takes only K + 1 K+1 K + 1 distinct values, ( η , μ ) (\eta,\mu) ( η , μ ) is found by a nested bisection: for each μ \mu μ the eigendecompositions of Q m + μ G A \mathbf{Q}_m+\mu\mathbf{G}_{\mathrm{A}} Q m + μ G A , m ≤ K + 1 m\le K+1 m ≤ K + 1 , are computed once, after which each evaluation of the power constraint costs O ( M N t ) O(MN_t) O ( M N t ) ; the outer bisection is valid because, after minimization over η \eta η , the derivative of the dual function in μ \mu μ is the slack of the pre-ADC constraint, which is nondecreasing in μ \mu μ . The first K K K columns of W \mathbf{W} W are the beamformers and the remaining ones recover R s = V V H \mathbf{R}_{\mathrm{s}}=\mathbf{V}\mathbf{V}^{H} R s = V V H .
Radar-Combiner Update
For fixed transmit and cancellation variables, the combiner of target q q q maximizes u q H R t a r , q u q / u q H R i n t u q \mathbf{u}_q^{H}\mathbf{R}_{\mathrm{tar},q}\mathbf{u}_q/\mathbf{u}_q^{H}\mathbf{R}_{\mathrm{int}}\mathbf{u}_q u q H R tar , q u q / u q H R int u q with R t a r , q = N p R q \mathbf{R}_{\mathrm{tar},q}=N_p\mathbf{R}_q R tar , q = N p R q and R i n t = R i \mathbf{R}_{\mathrm{int}}=\mathbf{R}_i R int = R i from (18) , whose solution is the dominant generalized eigenvector of ( R t a r , q , R i n t ) (\mathbf{R}_{\mathrm{tar},q},\mathbf{R}_{\mathrm{int}}) ( R tar , q , R int ) . For the rank-one target channel, R t a r , q ∝ a r ( θ q ) a r H ( θ q ) \mathbf{R}_{\mathrm{tar},q}\propto\mathbf{a}_{r}(\theta_q)\mathbf{a}_{r}^{H}(\theta_q) R tar , q ∝ a r ( θ q ) a r H ( θ q ) and the solution reduces exactly to the minimum-variance distortionless-response form
u q = R i n t − 1 a r ( θ q ) ∥ R i n t − 1 a r ( θ q ) ∥ 2 (43) \mathbf{u}_q=\frac{\mathbf{R}_{\mathrm{int}}^{-1}\mathbf{a}_{r}(\theta_q)}{\left\|\mathbf{R}_{\mathrm{int}}^{-1}\mathbf{a}_{r}(\theta_q)\right\|_2} \tag*{(43)} u q = R int − 1 a r ( θ q ) 2 R int − 1 a r ( θ q ) (43)
Since R i n t \mathbf{R}_{\mathrm{int}} R int is common to all targets, the Q Q Q combiners are obtained from one factorization and Q Q Q triangular solves.
Unified Canceller Update
Both cancellers, as well as the minimizer in Lemma 2, solve a problem of the following form.
Lemma 3 (Generalized Sylvester update). Let L ⪰ 0 \mathbf{L}\succeq0 L ⪰ 0 with eigendecomposition L = E Λ E H \mathbf{L}=\mathbf{E}\boldsymbol{\Lambda}\mathbf{E}^{H} L = E Λ E H , let R x = F Σ F H \mathbf{R}_x=\mathbf{F}\boldsymbol{\Sigma}\mathbf{F}^{H} R x = F Σ F H with Σ = diag ( p 1 , … , p N t ) \boldsymbol{\Sigma}=\operatorname{diag}(p_1,\ldots,p_{N_t}) Σ = diag ( p 1 , … , p N t ) , and let { T d } d ∈ D S I \{\mathbf{T}_d\}_{d\in\mathcal{D}_{\mathrm{SI}}} { T d } d ∈ D SI be given. The problem
minimize { C [ d ] } d ∈ D S I ∑ d ∈ D S I [ tr ( L C [ d ] R x C H [ d ] ) − 2 ℜ tr ( T d R x C H [ d ] ) ] \underset{\{\mathbf{C}[d]\}_{d\in\mathcal{D}_{\mathrm{SI}}}}{\operatorname{minimize}}\quad\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\left[\operatorname{tr}\left(\mathbf{L}\mathbf{C}[d]\mathbf{R}_x\mathbf{C}^{H}[d]\right)-2\Re\operatorname{tr}\left(\mathbf{T}_d\mathbf{R}_x\mathbf{C}^{H}[d]\right)\right] { C [ d ] } d ∈ D SI minimize d ∈ D SI ∑ [ tr ( LC [ d ] R x C H [ d ] ) − 2ℜ tr ( T d R x C H [ d ] ) ] subject to ∑ d ∥ C [ d ] ∥ F 2 ≤ P C \sum_d\left\|\mathbf{C}[d]\right\|_{F}^{2}\le P_{\mathrm{C}} ∑ d ∥ C [ d ] ∥ F 2 ≤ P C is solved by C [ d ] = E C ~ d F H \mathbf{C}[d]=\mathbf{E}\widetilde{\mathbf{C}}_d\mathbf{F}^{H} C [ d ] = E C d F H with
[ C ~ d ] i , j = [ T ~ d ] i , j p j [ Λ ] i , i p j + ϑ (44) [\widetilde{\mathbf{C}}_d]_{i,j}=\frac{[\widetilde{\mathbf{T}}_d]_{i,j}p_j}{[\boldsymbol{\Lambda}]_{i,i}p_j+\vartheta} \tag*{(44)} [ C d ] i , j = [ Λ ] i , i p j + ϑ [ T d ] i , j p j (44) where T ~ d = E H T d F \widetilde{\mathbf{T}}_d=\mathbf{E}^{H}\mathbf{T}_d\mathbf{F} T d = E H T d F ,
[ C ~ d ] i , j = [ T ~ d ] i , j p j [ Λ ] i , i p j + ϑ , T ~ d = E H T d F (45) [\widetilde{\mathbf{C}}_d]_{i,j}=\frac{[\widetilde{\mathbf{T}}_d]_{i,j}p_j}{[\boldsymbol{\Lambda}]_{i,i}p_j+\vartheta},\qquad\widetilde{\mathbf{T}}_d=\mathbf{E}^{H}\mathbf{T}_d\mathbf{F} \tag*{(45)} [ C d ] i , j = [ Λ ] i , i p j + ϑ [ T d ] i , j p j , T d = E H T d F (45) where entries with a vanishing denominator are set to zero (minimum-norm solution; with the regularization of Section V-E3, no denominator vanishes), and ϑ ≥ 0 \vartheta\ge0 ϑ ≥ 0 is zero if the unconstrained solution satisfies the budget and otherwise the unique root of ∑ d ∥ C ~ d ∥ F 2 = P C \sum_d\|\widetilde{\mathbf{C}}_d\|_{F}^{2}=P_{\mathrm{C}} ∑ d ∥ C d ∥ F 2 = P C , found by bisection. The digital and analog updates follow by identifying ( L , T d ) (\mathbf{L},\mathbf{T}_d) ( L , T d ) . Because the cancellers enter the quadratic-transformed objective only through − ∑ q α q ∥ z q ∥ 2 2 D q -\sum_q\alpha_q\|\mathbf{z}_q\|_2^2D_q − ∑ q α q ∥ z q ∥ 2 2 D q , the relevant weighting is
L D = ∑ q = 1 Q w q U q , w q = α q ∥ z q ∥ 2 2 , w ˉ = ∑ q w q (46) \mathbf{L}_{\mathrm{D}}=\sum_{q=1}^{Q}w_q\mathbf{U}_q,\qquad w_q=\alpha_q\|\mathbf{z}_q\|_2^2,\qquad\bar{w}=\sum_q w_q \tag*{(46)} L D = q = 1 ∑ Q w q U q , w q = α q ∥ z q ∥ 2 2 , w ˉ = q ∑ w q (46) with z q \mathbf{z}_q z q recomputed from (37) at the current iterate.
Digital canceller: For fixed W \mathbf{W} W , { u q } \{\mathbf{u}_q\} { u q } , and analog canceller, the digital canceller affects only the target-bin residual SI, and minimizing ∑ d tr ( L D H ~ r e s [ d ] R x H ~ r e s H [ d ] ) \sum_d\operatorname{tr}(\mathbf{L}_{\mathrm{D}}\widetilde{\mathbf{H}}_{\mathrm{res}}[d]\mathbf{R}_x\widetilde{\mathbf{H}}_{\mathrm{res}}^{H}[d]) ∑ d tr ( L D H res [ d ] R x H res H [ d ]) subject to (31e) is (43) with L = L D \mathbf{L}=\mathbf{L}_{\mathrm{D}} L = L D and T d = L D H ~ A [ d ] \mathbf{T}_d=\mathbf{L}_{\mathrm{D}}\widetilde{\mathbf{H}}_{\mathrm{A}}[d] T d = L D H A [ d ] , evaluated with the regularization of Section V-E3. For a single target, L D = w U \mathbf{L}_{\mathrm{D}}=w\mathbf{U} L D = w U , so that L ~ D = w ( U + ξ I N r ) \widetilde{\mathbf{L}}_{\mathrm{D}}=w(\mathbf{U}+\xi\mathbf{I}_{N_r}) L D = w ( U + ξ I N r ) , and (44) with the regularization of Section V-E3 becomes
C D [ d ] = U H ~ A [ d ] R ~ x ( R ~ x + ϑ D I N t ) − 1 + ( I N r − U ) H ~ A [ d ] R ~ x ( R ~ x + ζ I N t ) − 1 (47) \mathbf{C}_{\mathrm{D}}[d]=\mathbf{U}\widetilde{\mathbf{H}}_{\mathrm{A}}[d]\widetilde{\mathbf{R}}_x(\widetilde{\mathbf{R}}_x+\vartheta_{\mathrm{D}}\mathbf{I}_{N_t})^{-1}+(\mathbf{I}_{N_r}-\mathbf{U})\widetilde{\mathbf{H}}_{\mathrm{A}}[d]\widetilde{\mathbf{R}}_x(\widetilde{\mathbf{R}}_x+\zeta\mathbf{I}_{N_t})^{-1} \tag*{(47)} C D [ d ] = U H A [ d ] R x ( R x + ϑ D I N t ) − 1 + ( I N r − U ) H A [ d ] R x ( R x + ζ I N t ) − 1 (47) where R ~ x = R x + ξ tr ( R x ) I N t \widetilde{\mathbf{R}}_x=\mathbf{R}_x+\xi\operatorname{tr}(\mathbf{R}_x)\mathbf{I}_{N_t} R x = R x + ξ tr ( R x ) I N t , ϑ D = ϑ / ( w ( 1 + ξ ) ) \vartheta_{\mathrm{D}}=\vartheta/(w(1+\xi)) ϑ D = ϑ / ( w ( 1 + ξ )) , and ζ = ϑ D ( 1 + ξ ) / ξ \zeta=\vartheta_{\mathrm{D}}(1+\xi)/\xi ζ = ϑ D ( 1 + ξ ) / ξ , with ϑ \vartheta ϑ the multiplier of (31e). As ξ → 0 \xi\to0 ξ → 0 , either the budget binds along u \mathbf{u} u , so that ϑ D > 0 \vartheta_{\mathrm{D}}>0 ϑ D > 0 and ζ → ∞ \zeta\to\infty ζ → ∞ , or ϑ D → 0 \vartheta_{\mathrm{D}}\to0 ϑ D → 0 and ζ \zeta ζ remains finite, set by the budget left by the first term. The first term is the minimizer along u \mathbf{u} u , unique on the range of R x \mathbf{R}_x R x ; the second does not affect the objective and spends the remaining budget on the SI outside u \mathbf{u} u , including the transmit directions that currently carry no signal.
Analog canceller: For fixed W \mathbf{W} W , { u q } \{\mathbf{u}_q\} { u q } , and digital canceller, the analog canceller reduces the target-bin residual SI and the quantization noise, and satisfies the pre-ADC constraint:
minimize { C A [ d ] } ∑ d tr ( L ~ D H ~ r e s [ d ] R x H ~ r e s H [ d ] ) + w ˉ ϱ Π A (48) \underset{\{\mathbf{C}_{\mathrm{A}}[d]\}}{\operatorname{minimize}}\quad\sum_d\operatorname{tr}\left(\widetilde{\mathbf{L}}_{\mathrm{D}}\widetilde{\mathbf{H}}_{\mathrm{res}}[d]\mathbf{R}_x\widetilde{\mathbf{H}}_{\mathrm{res}}^{H}[d]\right)+\bar{w}\varrho\Pi_{\mathrm{A}} \tag*{(48)} { C A [ d ]} minimize d ∑ tr ( L D H res [ d ] R x H res H [ d ] ) + w ˉ ϱ Π A (48) subject to Π A ≤ P ~ A D C \Pi_{\mathrm{A}}\le\widetilde{P}_{\mathrm{ADC}} Π A ≤ P ADC , (31d),
where Π A = ∑ d tr ( H ~ A [ d ] R x H ~ A H [ d ] ) \Pi_{\mathrm{A}}=\sum_d\operatorname{tr}(\widetilde{\mathbf{H}}_{\mathrm{A}}[d]\mathbf{R}_x\widetilde{\mathbf{H}}_{\mathrm{A}}^{H}[d]) Π A = ∑ d tr ( H A [ d ] R x H A H [ d ]) and P ~ A D C = P A max − N r σ A 2 tr ( R x ) \widetilde{P}_{\mathrm{ADC}}=P_{\mathrm{A}}^{\max}-N_r\sigma_{\mathrm{A}}^2\operatorname{tr}(\mathbf{R}_x) P ADC = P A m a x − N r σ A 2 tr ( R x ) . With dual variable ν ≥ 0 \nu\ge0 ν ≥ 0 for the pre-ADC constraint, this is (43) with
L = L ~ D + ( ν + w ˉ ϱ ) I N r , T d = L ~ D ( H ~ S I [ d ] − C D [ d ] ) + ( ν + w ˉ ϱ ) H ~ S I [ d ] (49) \mathbf{L}=\widetilde{\mathbf{L}}_{\mathrm{D}}+(\nu+\bar{w}\varrho)\mathbf{I}_{N_r},\qquad\mathbf{T}_d=\widetilde{\mathbf{L}}_{\mathrm{D}}(\widetilde{\mathbf{H}}_{\mathrm{SI}}[d]-\mathbf{C}_{\mathrm{D}}[d])+(\nu+\bar{w}\varrho)\widetilde{\mathbf{H}}_{\mathrm{SI}}[d] \tag*{(49)} L = L D + ( ν + w ˉ ϱ ) I N r , T d = L D ( H SI [ d ] − C D [ d ]) + ( ν + w ˉ ϱ ) H SI [ d ] (49) where L ~ D \widetilde{\mathbf{L}}_{\mathrm{D}} L D is the regularized weighting of Section V-E3, and ν \nu ν is found by an outer bisection on the pre-ADC constraint, which is valid by the same convexity argument as for μ \mu μ . For a single target, E \mathbf{E} E is any unitary matrix with first column u \mathbf{u} u , and, up to the regularization, Λ = diag ( w + ν + ϱ w , ν + ϱ w , … ) \boldsymbol{\Lambda}=\operatorname{diag}(w+\nu+\varrho w,\nu+\varrho w,\ldots) Λ = diag ( w + ν + ϱw , ν + ϱw , … ) , so no eigendecomposition is needed. Lemma 2 is the special case L = I N r \mathbf{L}=\mathbf{I}_{N_r} L = I N r , T d = H ~ S I [ d ] \mathbf{T}_d=\widetilde{\mathbf{H}}_{\mathrm{SI}}[d] T d = H SI [ d ] , i.e., the limit ν → ∞ \nu\to\infty ν → ∞ .
Tie-breaking among minimizers: The digital subproblem is flat along the null spaces of R x \mathbf{R}_x R x and of L D \mathbf{L}_{\mathrm{D}} L D , and the analog one along the null space of R x \mathbf{R}_x R x , so their minimizers are not unique, and the minimum-norm choice reconstructs nothing in the unused transmit and receive directions; the subsequent transmit and combiner updates would then see a large residual SI outside the current subspaces and remain locked to them. We therefore evaluate (44) with R x + ξ tr ( R x ) I N t \mathbf{R}_x+\xi\operatorname{tr}(\mathbf{R}_x)\mathbf{I}_{N_t} R x + ξ tr ( R x ) I N t in place of R x \mathbf{R}_x R x and L ~ D = L D + ξ tr ( L D ) I N r \widetilde{\mathbf{L}}_{\mathrm{D}}=\mathbf{L}_{\mathrm{D}}+\xi\operatorname{tr}(\mathbf{L}_{\mathrm{D}})\mathbf{I}_{N_r} L D = L D + ξ tr ( L D ) I N r in place of L D \mathbf{L}_{\mathrm{D}} L D , ξ = 10 − 6 \xi=10^{-6} ξ = 1 0 − 6 , both in L \mathbf{L} L and in T d \mathbf{T}_d T d (with T d = L D H ~ A [ d ] \mathbf{T}_d=\mathbf{L}_{\mathrm{D}}\widetilde{\mathbf{H}}_{\mathrm{A}}[d] T d = L D H A [ d ] alone, T ~ d \widetilde{\mathbf{T}}_d T d would vanish outside the range of L D \mathbf{L}_{\mathrm{D}} L D ). Among the minimizers, this selects the cancellers that also reconstruct the SI in the unused directions, as far as the budget allows; (46) is its single-target form. As ξ → 0 \xi\to0 ξ → 0 , the selected cancellers remain minimizers of the original subproblems, and the choice is deterministic rather than left to floating-point noise.
Fairness Among Targets The objective (31a) is linear in the radar SINRs, and each γ q \gamma_q γ q is linear in the power allocated to target q q q once the SI is cancelled, so, as in Proposition 3, a weighted sum concentrates all sensing power on the target with the largest weighted gain
Algorithm 1 Joint Beamforming and Delay-Selective SI Cancellation for $K$ Users and $Q$ Targets
Input: Channels $\{\mathbf{h}_k\}$, $\{\mathbf{H}_q\}$, estimates $\{\widehat{\mathbf{H}}_{\mathrm{SI}}[d]\}$, weights, tolerance $\epsilon_{\mathrm{tol}}$, $T_{\max}$
Output: $\mathbf{W}$, $\{\mathbf{u}_q\}$, $\{\mathbf{C}_{\mathrm{A}}[d]\}$, $\{\mathbf{C}_{\mathrm{D}}[d]\}$
1: Initialize with the SI-free design or one of the two cold starts (run all three, keep the best output); $r \leftarrow 0$
2: **repeat**
3: Form $\mathbf{R}_x$, $\widehat{\mathbf{H}}_{\mathrm{A}}[d]$, $\widehat{\mathbf{H}}_{\mathrm{res}}[d]$, $\mathbf{G}_{\mathrm{A}}$, $\{ \mathbf{a}_q,\mathbf{B}_q\}$
4: Update $\{y_k\}$ and $\{z_q\}$ (Section V-B)
5: Update $\mathbf{W}$ by (41) with nested bisection on $(\eta,\mu)$
6: Recompute $\mathbf{R}_x$; update $\{\mathbf{u}_q\}$ by (42)
7: Recompute $\{z_q\}$, form $\widetilde{\mathbf{L}}_{\mathrm{D}}$; update $\{\mathbf{C}_{\mathrm{A}}[d]\}$ by Lemma 3 with (48) and bisection on $\nu$
8: Update $\{\mathbf{C}_{\mathrm{D}}[d]\}$ by Lemma 3 with $\mathbf{L}=\widetilde{\mathbf{L}}_{\mathrm{D}}$, $\mathbf{T}_d=\widetilde{\mathbf{L}}_{\mathrm{D}}\widehat{\mathbf{H}}_{\mathrm{A}}[d]$
9: Evaluate (31a); $r\leftarrow r+1$
10: **until** relative objective change $\leq\epsilon_{\mathrm{tol}}$ or $r\geq T_{\max}$
unless the weights are exactly balanced. Max-min fairness is obtained by weighting the targets individually within the sensing term, α q = α r ω q / ( Q γ ˉ q ) \alpha_q=\alpha_r\omega_q/(Q\bar{\gamma}_q) α q = α r ω q / ( Q γ ˉ q ) with ω q ≥ 0 \omega_q\geq0 ω q ≥ 0 and ∑ q ω q = Q \sum_q\omega_q=Q ∑ q ω q = Q , which leaves α r \alpha_r α r unchanged. Starting from ω q = 1 \omega_q=1 ω q = 1 , after each outer step we set
ω q ← ω q ( γ g γ q ) κ , γ g = ( ∏ q γ q ) 1 / Q , (50) \omega_q\leftarrow\omega_q\left(\frac{\gamma_g}{\gamma_q}\right)^\kappa,\qquad
\gamma_g=\left(\prod_q\gamma_q\right)^{1/Q}, \tag*{(50)} ω q ← ω q ( γ q γ g ) κ , γ g = ( q ∏ γ q ) 1/ Q , (50)
renormalize to ∑ q ω q = Q \sum_q\omega_q=Q ∑ q ω q = Q , and run a few iterations of Algorithm 1 from the previous iterate. The damping κ ∈ ( 0 , 1 ) \kappa\in(0,1) κ ∈ ( 0 , 1 ) and the warm start are essential: with κ = 1 \kappa=1 κ = 1 and an exact inner solve the iteration jumps between extreme points, whereas with κ = 0.3 \kappa=0.3 κ = 0.3 and three inner iterations the SINRs equalize within a few outer steps. Since every iterate is feasible, the one with the largest minimum SINR is retained. The procedure is a heuristic, with no optimality claim beyond feasibility and monotone inner iterations, and is used in Section VI for Q > 1 Q>1 Q > 1 .
Algorithm, Convergence, and Complexity
The complete procedure is summarized in Algorithm 1. Because (31a) is linear in the SINRs, the point at which the algorithm settles depends on its start and typically lies near the communication or the sensing face of the trade-off region, and a stream with zero power remains zero (q m = 0 q_m=0 q m = 0 gives y m = 0 y_m=0 y m = 0 , z q , m = 0 z_{q,m}=0 z q , m = 0 , and b m = 0 \mathbf{b}_m=\mathbf{0} b m = 0 in (39)). Algorithm 1 is therefore run from three starting points, and the best output is retained. The first is the SI-free design at the same weights (steps 3–6 with B q = 0 \mathbf{B}_q=\mathbf{0} B q = 0 and without (31c)), followed by the canceller updates for the resulting R x \mathbf{R}_x R x and a uniform power back-off if (31c) cannot be met, i.e., the sequential design of Section VI-A; since it is feasible, the joint design never does worse. The other two are cold starts with maximum-ratio user beams carrying 50% and 95% of the power, an isotropic sensing signal carrying the rest, the SI-channel estimate scaled to the tap budget as analog canceller, and the same back-off.
Proposition 4 (Monotone convergence): With the canceller updates evaluated in the limit ξ → 0 \xi\to0 ξ → 0 of Section V-E3, the sequence of objective values (31a) generated by Algorithm 1 is nondecreasing and converges; for ξ > 0 \xi>0 ξ > 0 , each canceller update can lower (31a) by at most O ( ξ ) O(\xi) O ( ξ ) .
Proof. Every step keeps the iterate feasible. The auxiliary update (36)–(37) makes the transformed objective equal to (31a), which it lower-bounds for any auxiliary values. The update (41) maximizes the transformed objective over W \mathbf{W} W (a concave quadratic program with the convex constraints of (40)); each u q \mathbf{u}_q u q by (42) maximizes γ q \gamma_q γ q itself, and the communication SINRs do not depend on it; after the auxiliary variables are recomputed, each canceller update by Lemma 3, with the pre-ADC constraint enforced through ν \nu ν , maximizes the transformed objective over that canceller, exactly for ξ → 0 \xi\to0 ξ → 0 and up to O ( ξ ) O(\xi) O ( ξ ) otherwise. Hence (31a) is nondecreasing. It is bounded above by ∑ k α k γ k s u + ∑ q α q γ q s u \sum_k\alpha_k\gamma_k^{\mathrm{su}}+\sum_q\alpha_q\gamma_q^{\mathrm{su}} ∑ k α k γ k su + ∑ q α q γ q su , where γ k s u = P max ∥ h k ∥ 2 / σ k 2 \gamma_k^{\mathrm{su}}=P_{\max}\lVert\mathbf{h}_k\rVert^2/\sigma_k^2 γ k su = P m a x ∥ h k ∥ 2 / σ k 2 is the ceiling (26), hence it converges.
Simulation Results
Setup and Benchmarks
We consider a very-low-LEO satellite at h = 300 h=300 h = 300 km, operating at 20 GHz with 1 / T s = 20 1/T_s=20 1/ T s = 20 MBd and a 43 dBm RF budget. It serves K = 3 K=3 K = 3 users and senses Q = 1 Q=1 Q = 1 large vessel at 60 ∘ 60^\circ 6 0 ∘ elevation with N t = N r = N = 6 N_t=N_r=N=6 N t = N r = N = 6 ∈ { 8 , 16 } \in\{8,16\} ∈ { 8 , 16 } ports. Users and targets are uniformly distributed in the ± 4 ∘ \pm4^\circ ± 4 ∘ field of view with line-of-sight channels, and the fractional target delay is uniform, so that the straddle factor of Section II-D is included in γ ˉ q \bar{\gamma}_q γ ˉ q . The SI channel (9) comprises the near-field path (10) between parallel arrays 0.5 m apart and two Rayleigh platform reflections, 10 and 20 dB weaker, at 15 and 35 ns, sampled by the raised-cosine response (roll-off 0.35) on D p r e = D p o s t = 10 D_{\mathrm{pre}}=D_{\mathrm{post}}=10 D pre = D post = 10 . Table 2 lists all parameters. All designs are evaluated with (4) and (20), i.e., with the residual SI, the non-reconstructible SI, @table #tbl:1 (1)
Table 2. Simulation Parameters and Link Budget
caption: Per-Iteration Complexity of Algorithm 1 @table #tbl:1 (1) and the quantization noise of the actual design. Results are averaged in the linear domain over 15 channel realizations, common to all figures except Figure 5 , and then converted to decibels.
We compare with four references. HD, communication only: the sum-SINR Γ ˉ c \bar{\Gamma}_c Γ ˉ c with the whole power on the downlink and no SI. HD, sensing only: γ ˉ q \bar{\gamma}_q γ ˉ q of (25), and ( ∑ q 1 / γ ˉ q ) − 1 (\sum_q 1/\bar{\gamma}_q)^{-1} ( ∑ q 1/ γ ˉ q ) − 1 for Q Q Q targets with equal SINRs. Both are single-function bounds that no system attains simultaneously. SI-unaware: the SI-free design at the same weights, i.e., steps 3–6 of Algorithm 1 with B q = 0 \mathbf{B}_q = 0 B q = 0 and without (31c), deployed without cancellation, with u q = a r / N r \mathbf{u}_q = \mathbf{a}_r/\sqrt{N_r} u q = a r / N r and no back-off. It violates (31c) and is therefore not a feasible design; it serves only as a reference for the cost of ignoring the SI. Sequential: the same SI-free beamformers, backed off uniformly until (31c) can be met with the canceller of Lemma 2, followed by the combiner and both cancellers optimized for the resulting R x \mathbf{R}_x R x . It handles the SI at the receiver only, is the first starting point of Algorithm 1, and isolates the gain of designing the transmitter jointly with the cancellers; it is the relevant feasible benchmark.
Convergence
Figure 2 shows the objective at α r = 0.55 \alpha_r = 0.55 α r = 0.55 , between the change-over weights 1 / 2 1/2 1/2 of the SI-free design and α r ⋆ \alpha_r^\star α r ⋆ . Every run is nondecreasing (Proposition 4); the largest relative decrease over all runs of this section is below 10 − 9 10^{-9} 1 0 − 9 , i.e., at the numerical precision. All starts come within 10 − 3 10^{-3} 1 0 − 3 of their final value after 9 to 25 iterations, but their final values differ: 0.487 (N = 16 N = 16 N = 16 ) and 0.526 (N = 8 N = 8 N = 8 ) for the SI-free start, and 0.475/0.499 and 0.466/0.493 for the cold starts with 50% and 95% of the power on the users. Over the sweep of Figure 3 , a cold start yields the best output at 11% (N = 16 N = 16 N = 16 ) and 16% (N = 8 N = 8 N = 8 ) of the points, all with α r ≤ 0.65 \alpha_r \le0.65 α r ≤ 0.65 , so all three starts are run; one iteration takes 43 ms (N = 16 N = 16 N = 16 ) and 12 ms (N = 8 N = 8 N = 8 ).
Figure 2. Normalized objective (31a) versus iteration at α r = 0.55 \alpha_r = 0.55 α r = 0.55 for the three starting points of Algorithm 1.
Figure 3. Communication–sensing trade-off traced by α r ∈ [ 0 , 1 ] \alpha_r \in[0,1] α r ∈ [ 0 , 1 ] ; the radar-SINR axis is interrupted between − 42 -42 − 42 and − 14 -14 − 14 dB; the SI-unaware reference violates (31c).
Communication–Sensing Trade-Off
Figure 3 maps the trade-off traced by α r ∈ [ 0 , 1 ] \alpha_r \in[0,1] α r ∈ [ 0 , 1 ] . At α r = 0 \alpha_r = 0 α r = 0 , the proposed design attains Γ ˉ c = 28.4 \bar{\Gamma}_c = 28.4 Γ ˉ c = 28.4 dB (N = 16 N = 16 N = 16 ) and 25.4 dB (N = 8 N = 8 N = 8 ): FD sensing costs nothing on the downlink (Lemma 2). The sequential design must back off in the 2 (N = 16 N = 16 N = 16 ) and 3 (N = 8 N = 8 N = 8 ) realizations in which the tap budget does not remove the SI of its beams, by 1.7 and 3.2 dB, and loses 0.2 and 0.5 dB on average. At α r = 1 \alpha_r = 1 α r = 1 , the radar SINR equals the ceiling γ q ⋆ = 7.44 \gamma_q^\star= 7.44 γ q ⋆ = 7.44 dB within 0.01 dB for N = 16 N = 16 N = 16 , 1.7 dB below the HD sensing SNR, as (26) predicts for ϵ 2 \epsilon^2 ϵ 2 INR = − 3.1 = -3.1 = − 3.1 dB; for N = 8 N = 8 N = 8 it is 0.63 dB, 0.2 dB below the ceiling, because ξ A = 0.1 \xi_A = 0.1 ξ A = 0.1 meets the condition of Proposition 2 in only 40% of the realizations (100% for N = 16 N = 16 N = 16 , Corollary 2).
In between, the proposed design keeps the downlink within 0.2 dB of Γ ˉ c \bar{\Gamma}_c Γ ˉ c up to α r = 0.5 \alpha_r = 0.5 α r = 0.5 while its radar SINR rises from − 11.8 -11.8 − 11.8 to − 0.8 -0.8 − 0.8 dB (N = 16 N = 16 N = 16 ), and it changes over between α r = 0.55 \alpha_r = 0.55 α r = 0.55 and 0.7, around α r ⋆ \alpha_r^\star α r ⋆ . The sequential design inherits the SI-free beams, which change over at α r = 1 / 2 \alpha_r = 1/2 α r = 1/2 (Proposition 3). Its points lie on the curve of the proposed design, within 0.3 dB, but at the wrong weights: at α r = 0.55 \alpha_r = 0.55 α r = 0.55 and N = 16 N = 16 N = 16 , it delivers 6.9 dB of radar SINR at 22.6 dB of downlink, the point that the proposed design selects only for α r \alpha_r α r between 0.6 and 0.65, whereas the proposed design keeps 28.0 dB at 1.0 dB and a 10% larger objective (0.497 against 0.446). Above α r ⋆ \alpha_r^\star α r ⋆ , the SI floor lowers the value of sensing power, so the proposed design gives part of the power back to the users at almost no cost in radar SINR and keeps 1.5, 5.8, and 2.3 dB more downlink at α r = 0.7 \alpha_r = 0.7 α r = 0.7 , 0.8, and 0.9. Overall, its objective exceeds that of the sequential design by up to 11% (N = 16 N = 16 N = 16 ) and 13% (N = 8 N = 8 N = 8 ). With nominal hardware, the known SI is removed completely and (31c) is inactive, so the problem nearly decouples and the joint design adds mainly the correct change-over. The infeasible SI-unaware reference, whose downlink equals that of the SI-free design, overloads the ADCs by 6.6–8.9 dB and attains a radar SINR between −52.9 and −43.6 dB at every weight: ignoring the SI is not an option, and the comparisons below focus on the sequential design.
Ceiling (Proposition 2). In Figure 4 , at α r = 1 \alpha_{\mathrm{r}} = 1 α r = 1 and N = 16 N = 16 N = 16 , the simulated gap to the HD sensing SNR coincides with the closed form within 0.01 dB for ϵ 2 \epsilon^2 ϵ 2 from −70 to −20 dB, which confirms (19) and the achievability part of the proposition; for N = 8 N = 8 N = 8 it exceeds the closed form by 0.27 dB at small ϵ 2 \epsilon^2 ϵ 2 , the signature of ξ A = 0.1 < 1 / 8 \xi_{\mathrm{A}} = 0.1 < 1/8 ξ A = 0.1 < 1/8 (Corollary 2). Once ϵ 2 \epsilon^2 ϵ 2 INR exceeds one, the non-reconstructible SI sets the sensing performance: above −40 dB, every 10 dB of ϵ 2 \epsilon^2 ϵ 2 costs 9.3–9.9 dB of radar SINR. At α r = 0.8 \alpha_{\mathrm{r}} = 0.8 α r = 0.8 , the gap jumps to 15.8 dB (N = 16 N = 16 N = 16 ) and 14.6 dB (N = 8 N = 8 N = 8 ) at ϵ 2 = − 40 \epsilon^2 = -40 ϵ 2 = − 40 dB, where the design switches to the users: by (30), α r ⋆ \alpha_{\mathrm{r}}^{\star} α r ⋆ grows from 0.60 to 0.85 (0.63 to 0.89 for N = 8 N = 8 N = 8 ), so that α r = 0.8 \alpha_{\mathrm{r}} = 0.8 α r = 0.8 falls below the change-over weight, as Proposition 3 predicts.
Figure 4. Gap between the HD sensing SNR and the radar SINR of the proposed design versus ϵ 2 \epsilon^2 ϵ 2 , with the closed form of Proposition 2.
Echo absorption (Lemma 1). Figure 5 reports a time-domain Monte Carlo in which LS cancellers are estimated from N p = 4000 N_{\mathrm{p}} = 4000 N p = 4000 post-analog samples of a 4 × 4 4 \times4 4 × 4 system with INR = 40 dB and an echo 10 dB below the noise per sample, and applied to the same block. The DS canceller recovers the SINR of the known-SI receiver within 0.06 dB, as stated in Lemma 1(a), whereas without cancellation the SINR is 39.4 dB lower. The ND canceller, whose support contains d q d_q d q , follows 1 − ζ q 1-\zeta_q 1 − ζ q of (23) within 0.4 dB; the same holds for a Doppler offset with (22), f D T c p i ∈ [ 0.05 , 2 ] f_{\mathrm{D}}T_{\mathrm{cpi}} \in[0.05, 2] f D T cpi ∈ [ 0.05 , 2 ] . At the LEO operating point, f R T c p i 2 = 0.55 f_{\mathrm{R}}T_{\mathrm{cpi}}^2 = 0.55 f R T cpi 2 = 0.55 , the loss is 17.5 dB, against 17.8 dB in closed form, and by (21) it falls below 1 dB only for f D T c p i ≥ 0.65 f_{\mathrm{D}}T_{\mathrm{cpi}} \ge0.65 f D T cpi ≥ 0.65 or f R T c p i 2 ≥ 5.2 f_{\mathrm{R}}T_{\mathrm{cpi}}^2 \ge5.2 f R T cpi 2 ≥ 5.2 , when the echo decorrelates within the CPI.
Tap budget (Lemma 2, Corollary 2). In Figure 6 , the proposed design reaches the ceiling at ξ A = 0.1 \xi_{\mathrm{A}} = 0.1 ξ A = 0.1 for N = 16 N = 16 N = 16 and 0.2 for N = 8 N = 8 N = 8 , the first grid points above 1 / N t 1/N_{\mathrm{t}} 1/ N t , as Corollary 2 predicts for a rank-one sensing covariance; over N ∈ { 8 , 12 , 16 , 24 , 32 } N \in\{8, 12, 16, 24, 32\} N ∈ { 8 , 12 , 16 , 24 , 32 } , its gap to the ceiling at ξ A = 0.05 \xi_{\mathrm{A}} = 0.05 ξ A = 0.05 decreases as 0.92, 0.47, 0.26, 0.14, and 0.08 dB. Below the threshold, it steers the beam away from the strongly coupled eigen directions and loses 1.8 (N = 16 N = 16 N = 16 ) and 3.1 dB (N = 8 N = 8 N = 8 ) with respect to the ceiling at ξ A = 0.01 \xi_{\mathrm{A}} = 0.01 ξ A = 0.01 , whereas the sequential design, which keeps the SI-free beam, must back off by 2.0 and 4.4 dB and loses 3.1 and 5.1 dB. Where the budget binds, the pre-ADC SI of the proposed design lies within 0.1–1.1 dB of Π A min \Pi_{\mathrm{A}}^{\min} Π A m i n of (27); above 1 / N t 1/N_{\mathrm{t}} 1/ N t , Π A min = 0 \Pi_{\mathrm{A}}^{\min} = 0 Π A m i n = 0 and (31c) is inactive. The infeasible SI-unaware reference stays at −46.0 and −50.4 dB for every budget, with 6.6 and 8.0 dB more SI at the ADCs than P A D C max P_{\mathrm{ADC}}^{\max} P ADC m a x
Figure 6. Radar SINR versus the analog tap budget at α r = 1 \alpha_{\mathrm{r}} = 1 α r = 1 ; the vertical axis is interrupted; the SI-unaware reference violates (31c).
ADC Resolution and Hardware-Constrained Cancellation
With ξ A = 0.1 \xi_{\mathrm{A}}=0.1 ξ A = 0.1 and N = 16 N=16 N = 16 , the known SI is removed before the ADCs and the resolution hardly matters, so Figure 7 uses ξ A = 0.02 \xi_{\mathrm{A}}=0.02 ξ A = 0.02 , for which (31c) is active. At α r = 0.3 \alpha_{\mathrm{r}}=0.3 α r = 0.3 , the proposed design keeps the downlink within 0.8 dB of Γ ˉ c d o w n \bar{\Gamma}_{\mathrm{c}}^{\mathrm{down}} Γ ˉ c down to 3 bits for N = 16 N=16 N = 16 (27.6 against 28.4 dB) and within 3.0 dB for N = 8 N=8 N = 8 , operating on average at 89–100% of P A D C max P_{\mathrm{ADC}}^{\max} P ADC m a x for b ≤ 6 b\leq6 b ≤ 6 . The sequential design must back off by 2.2 (N = 16 N=16 N = 16 ) and 3.6 dB (N = 8 N=8 N = 8 ) already with 8-bit ADCs and by 23 and 27 dB with 4-bit ADCs, where its sum-SINR falls to 17.0 and − 0.7 -0.7 − 0.7 dB. At α r = 1 \alpha_{\mathrm{r}}=1 α r = 1 , the radar SINR of the proposed design remains within 3.0 dB of the ceiling at the same resolution for N = 16 N=16 N = 16 and decreases to − 5.4 -5.4 − 5.4 dB for N = 8 N=8 N = 8 , whereas that of the sequential design falls to − 12.5 -12.5 − 12.5 and − 24.9 -24.9 − 24.9 dB with 4-bit ADCs. With 4-bit ADCs, the joint design thus retains 10.7 dB (N = 16 N=16 N = 16 ) and 23.6 dB (N = 8 N=8 N = 8 ) more downlink and 17.3 and 19.5 dB more radar SINR than the sequential design. The gain comes from the multiplier μ \mu μ in (42) , which steers power away from the eigendirections that couple most strongly into the ADCs, and from ν \nu ν in (49) . Finally, projecting the analog taps onto b A b_{\mathrm{A}} b A -bit amplitude and phase vector modulators (α r = 1 \alpha_{\mathrm{r}}=1 α r = 1 , b = 5 b=5 b = 5 ), with the digital canceller and the combiner re-optimized, costs at most 0.3 and 0.4 dB of radar SINR from b A = 5 b_{\mathrm{A}}=5 b A = 5 and 1.1 and 1.3 dB at b A = 4 b_{\mathrm{A}}=4 b A = 4 , so the continuous analog canceller is a faithful model of a hardware one.
Figure 7. Communication sum-SINR versus ADC resolution at α r = 0.3 \alpha_{\mathrm{r}}=0.3 α r = 0.3 with a hardware-limited analog canceller (ξ A = 0.02 \xi_{\mathrm{A}}=0.02 ξ A = 0.02 ).
Multiple Targets
Figure 8 considers Q ∈ { 1 , … , 4 } Q\in\{1,\ldots,4\} Q ∈ { 1 , … , 4 } targets of equal RCS at random angles, N = 16 N=16 N = 16 , α r = 1 \alpha_{\mathrm{r}}=1 α r = 1 , and b ∈ { 8 , 5 , 4 } b\in\{8,5,4\} b ∈ { 8 , 5 , 4 } , with the target weights equalized by (50) (κ = 0.3 \kappa=0.3 κ = 0.3 , three inner iterations, 30 outer steps) for both designs. The proposed design serves the targets on average within 0.2 dB (8 bits) and 0.9 dB (4 bits) of each other with a single multi-beam (the effective rank of R x R_{\mathrm{x}} R x is one in all but at most two of the 15 realizations), for which ξ A = 0.1 \xi_{\mathrm{A}}=0.1 ξ A = 0.1 suffices (Corollary 2). Its average minimum SINR with 8-bit ADCs, 7.4, 5.0, 3.5, and 2.4 dB for Q = 1 , … , 4 Q=1,\ldots,4 Q = 1 , … , 4 , follows the HD reference (9.2, 6.1, 4.4, and 3.2 dB) at a distance set by the SI floor, and the sequential design performs similarly, since (31c) is inactive.
Figure 8. 10th percentile of the minimum radar SINR over Q Q Q targets with equalized weights (N = 16 N=16 N = 16 , α r = 1 \alpha_{\mathrm{r}}=1 α r = 1 ); HD reference ( ∑ q 1 / γ ˉ q ) − 1 (\sum_q 1/\bar{\gamma}_q)^{-1} ( ∑ q 1/ γ ˉ q ) − 1 .
With 5- and 4-bit ADCs, the constraint becomes active in 20–40% of the realizations with Q ≥ 2 Q\geq2 Q ≥ 2 , those in which the multi-beam aligns with a strongly coupled direction; the sequential design then backs off by up to 19.5 dB and its weakest target falls to − 18.2 -18.2 − 18.2 dB, whereas that of the proposed design never falls below − 2.6 -2.6 − 2.6 dB. At 4 bits and Q = 4 Q=4 Q = 4 , the 10th-percentile minimum SINR is − 1.2 -1.2 − 1.2 dB against − 12.6 -12.6 − 12.6 dB, and the sequential design falls below 0 dB in 33% of the realizations, against 13%. Joint design is thus what makes multi-target sensing reliable with low-resolution ADCs.
Conclusion
We have developed a theory and a design for FD JCAS from a LEO satellite that exploit the separation, by tens of thousands of symbols, between the SI of the current transmission and the echo of a transmission several milliseconds earlier. The separation does not remove SI from the target range bin; what it changes is estimation. Restricting the cancellers to the short-delay SI support is without loss of optimality (Proposition 1), whereas a least-squares canceller whose support contains the target delay reduces the radar SINR by the factor 1 − ζ q 1-\zeta_q 1 − ζ q , 17.8 dB at the zero-Doppler crossing of a vessel (Lemma 1, Corollary 1). When the non-reconstructible SI is spatially white, the residual SI in the target bin floors the radar SINR at γ ˉ q / ( 1 + ϵ 2 I N R ) \bar{\gamma}_q/(1+\epsilon^2\mathrm{INR}) γ ˉ q / ( 1 + ϵ 2 INR ) up to a negligible quantization factor (Proposition 2; Section III-C gives the bound for correlated SI), a tap budget of about r / N t r/N_{\mathrm{t}} r / N t of the SI-channel energy suffices to reach this ceiling with a rank-r r r transmit covariance (Lemma 2, Corollary 2), and the same floor sets the weight at which the optimal design changes over from communication to sensing (Proposition 3). The joint design is solved by an alternating algorithm with closed-form blocks, all canceller updates being instances of one generalized Sylvester solution. Simulations confirm the closed forms. With nominal hardware, a sequential design that keeps the SI-free beamformers and optimizes the cancellers for them reaches the trade-off curve of the joint design, but at the wrong weights, which costs up to 13% in the normalized objective. Joint design matters where the hardware limits the cancellation: it gains 1–2 dB of radar SINR with tight tap budgets and more than 10 dB of downlink and radar SINR with 4-bit ADCs and in the 10th-percentile worst-target SINR of four targets, whereas ignoring the SI overloads the ADCs.
Proof of Proposition 1
Fix W \mathbf{W} W and { u q } \{\mathbf{u}_q\} { u q } . The cancellers enter J \mathcal{J} J through R A S I \mathbf{R}^{\mathrm{SI}}_{\mathrm{A}} R A SI in (14), through R S I r e s \mathbf{R}^{\mathrm{res}}_{\mathrm{SI}} R SI res in (19), and through the range-compressed output (16). For d ∉ D S I d \notin\mathcal{D}_{\mathrm{SI}} d ∈ / D SI , H S I [ d ] = 0 \mathbf{H}_{\mathrm{SI}}[d]=\mathbf{0} H SI [ d ] = 0 , so the residual channels at such delays are H ^ A [ d ] = − C A [ d ] \widehat{\mathbf{H}}_{\mathrm{A}}[d]=-\mathbf{C}_{\mathrm{A}}[d] H A [ d ] = − C A [ d ] and H ^ r e s [ d ] = − C A [ d ] − C D [ d ] \widehat{\mathbf{H}}_{\mathrm{res}}[d]=-\mathbf{C}_{\mathrm{A}}[d]-\mathbf{C}_{\mathrm{D}}[d] H res [ d ] = − C A [ d ] − C D [ d ] , and their contributions C A [ d ] R x C A H [ d ] ⪰ 0 \mathbf{C}_{\mathrm{A}}[d]\mathbf{R}_{x}\mathbf{C}_{\mathrm{A}}^{H}[d]\succeq\mathbf{0} C A [ d ] R x C A H [ d ] ⪰ 0 to R A r e s \mathbf{R}^{\mathrm{res}}_{\mathrm{A}} R A res and ( C A [ d ] + C D [ d ] ) R x ( ⋅ ) H ⪰ 0 (\mathbf{C}_{\mathrm{A}}[d]+\mathbf{C}_{\mathrm{D}}[d])\mathbf{R}_{x}(\cdot)^{H}\succeq\mathbf{0} ( C A [ d ] + C D [ d ]) R x ( ⋅ ) H ⪰ 0 to R S I r e s \mathbf{R}^{\mathrm{res}}_{\mathrm{SI}} R SI res vanish for the primed cancellers. If d = d q d=d_q d = d q for some q q q , the subtracted term − ( C A [ d q ] + C D [ d q ] ) x [ n − d q ] -(\mathbf{C}_{\mathrm{A}}[d_q]+\mathbf{C}_{\mathrm{D}}[d_q])\mathbf{x}[n-d_q] − ( C A [ d q ] + C D [ d q ]) x [ n − d q ] is correlated with the reference in (16) and produces, after range compression, the deterministic term − N p / P q ϕ ˉ q ( C A [ d q ] + C D [ d q ] ) R x a t ( θ q ) -\sqrt{N_p/P_q}\,\bar{\phi}_q(\mathbf{C}_{\mathrm{A}}[d_q]+\mathbf{C}_{\mathrm{D}}[d_q])\mathbf{R}_{x}\mathbf{a}_{t}(\theta_q) − N p / P q ϕ ˉ q ( C A [ d q ] + C D [ d q ]) R x a t ( θ q ) . Because E { ρ q } = 0 \mathbb{E}\{\rho_q\}=0 E { ρ q } = 0 , this term is uncorrelated with the target component N p P q ρ q β q a r \sqrt{N_pP_q}\rho_q\beta_q\mathbf{a}_{r} N p P q ρ q β q a r and adds its power to the interference, not to the signal. Hence, for every q q q , the interference power u q H R i u q \mathbf{u}_q^{H}\mathbf{R}_{i}\mathbf{u}_q u q H R i u q of the primed cancellers is no larger and the signal power is unchanged, so γ q \gamma_q γ q does not decrease; γ k \gamma_k γ k does not depend on the cancellers. Zeroing taps reduces ∑ d ∥ C [ d ] ∥ F 2 \sum_d\|\mathbf{C}[d]\|_{F}^{2} ∑ d ∥ C [ d ] ∥ F 2 and tr ( R A S I ) \operatorname{tr}(\mathbf{R}^{\mathrm{SI}}_{\mathrm{A}}) tr ( R A SI ) , so feasibility is preserved. ▪
Proof of Lemma 1
Write the post-analog samples as y [ n ] = ρ q ϕ q [ n ] H q x [ n − d q ] + ∑ d ∈ D S I H ^ A [ d ] x [ n − d ] + i [ n ] \mathbf{y}[n]=\rho_q\phi_q[n]\mathbf{H}_q\mathbf{x}[n-d_q]+\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\widehat{\mathbf{H}}_{\mathrm{A}}[d]\mathbf{x}[n-d]+\mathbf{i}[n] y [ n ] = ρ q ϕ q [ n ] H q x [ n − d q ] + ∑ d ∈ D SI H A [ d ] x [ n − d ] + i [ n ] , where i [ n ] = ∑ d ∈ D S I Δ n [ d ] x [ n − d ] + z [ n ] \mathbf{i}[n]=\sum_{d\in\mathcal{D}_{\mathrm{SI}}}\mathbf{\Delta}_n[d]\mathbf{x}[n-d]+\mathbf{z}[n] i [ n ] = ∑ d ∈ D SI Δ n [ d ] x [ n − d ] + z [ n ] collects the non-reconstructible SI and the noise; the echo of another target is fitted like that of target q q q if its delay lies in S \mathcal{S} S and is otherwise uncorrelated with the regressors and with the reference, so it is omitted; i [ n ] \mathbf{i}[n] i [ n ] is zero mean and uncorrelated with x [ n − d ′ ] \mathbf{x}[n-d'] x [ n − d ′ ] for every d ′ d' d ′ . By the law of large numbers, N p − 1 X X H → I ∣ S ∣ ⊗ R x N_p^{-1}\mathbf{X}\mathbf{X}^{H}\to\mathbf{I}_{|\mathcal{S}|}\otimes\mathbf{R}_x N p − 1 X X H → I ∣ S ∣ ⊗ R x and N p − 1 Y X d H → E { y [ n ] x H [ n − d ] } N_p^{-1}\mathbf{Y}\mathbf{X}_{d}^{H}\to\mathbb{E}\{\mathbf{y}[n]\mathbf{x}^{H}[n-d]\} N p − 1 Y X d H → E { y [ n ] x H [ n − d ]} time-averaged over the CPI. For d ∈ D S I ∩ S d\in\mathcal{D}_{\mathrm{SI}}\cap\mathcal{S} d ∈ D SI ∩ S this limit is H ^ A [ d ] R x \widehat{\mathbf{H}}_{\mathrm{A}}[d]\mathbf{R}_x H A [ d ] R x ; for d = d q ∈ S d=d_q\in\mathcal{S} d = d q ∈ S , conditioning on ρ q \rho_q ρ q , it is ρ q ϕ ˉ q H q R x \rho_q\bar{\phi}_q\mathbf{H}_q\mathbf{R}_x ρ q ϕ ˉ q H q R x ; for all other d ∈ S d\in\mathcal{S} d ∈ S it is zero. Hence C [ d ] \mathbf{C}[d] C [ d ] converges to H ^ A [ d ] R x R x † \widehat{\mathbf{H}}_{\mathrm{A}}[d]\mathbf{R}_x\mathbf{R}_x^{\dagger} H A [ d ] R x R x † , ρ q ϕ ˉ q H q R x R x † \rho_q\bar{\phi}_q\mathbf{H}_q\mathbf{R}_x\mathbf{R}_x^{\dagger} ρ q ϕ ˉ q H q R x R x † or 0 \mathbf{0} 0 , respectively, and R x R x † \mathbf{R}_x\mathbf{R}_x^{\dagger} R x R x † is the projector onto the range of R x \mathbf{R}_x R x , which contains x [ n ] \mathbf{x}[n] x [ n ] almost surely; this proves the convergence claims of (a) and (b).
For the range-compressed output, let f ∈ C N p \mathbf{f}\in\mathbb{C}^{N_p} f ∈ C N p with [ f ] n = ϕ q ∗ [ n ] g ∗ [ n − d q ] / N p P q [\mathbf{f}]_n=\phi_q^{*}[n]\mathbf{g}^{*}[n-d_q]/\sqrt{N_pP_q} [ f ] n = ϕ q ∗ [ n ] g ∗ [ n − d q ] / N p P q , so that (16) applied to a residual E r \mathbf{E}_r E r is E r f \mathbf{E}_r\mathbf{f} E r f , and let P X = X H ( X X H ) † X \mathbf{P}_{X}=\mathbf{X}^{H}(\mathbf{X}\mathbf{X}^{H})^{\dagger}\mathbf{X} P X = X H ( X X H ) † X , so that the LS residual is Y ( I − P X ) \mathbf{Y}(\mathbf{I}-\mathbf{P}_{X}) Y ( I − P X ) . Since g ∗ [ n − d q ] = x H [ n − d q ] a t \mathbf{g}^{*}[n-d_q]=\mathbf{x}^{H}[n-d_q]\mathbf{a}_t g ∗ [ n − d q ] = x H [ n − d q ] a t , the vector [ g ∗ [ n − d q ] ] n [\mathbf{g}^{*}[n-d_q]]_n [ g ∗ [ n − d q ] ] n lies in the row space of X d q \mathbf{X}_{d_q} X d q . In case (b), write f = ϕ ˉ q g + f ~ \mathbf{f}=\bar{\phi}_q\mathbf{g}+\tilde{\mathbf{f}} f = ϕ ˉ q g + f ~ with [ g ] n = g q ∗ [ n − d q ] / N p P q [\mathbf{g}]_n=\mathbf{g}^{*}_q[n-d_q]/\sqrt{N_pP_q} [ g ] n = g q ∗ [ n − d q ] / N p P q and [ f ~ ] n = ( ϕ q ∗ [ n ] − ϕ ˉ q ) g q ∗ [ n − d q ] / N p P q [\tilde{\mathbf{f}}]_n=(\phi_q^{*}[n]-\bar{\phi}_q)\mathbf{g}^{*}_q[n-d_q]/\sqrt{N_pP_q} [ f ~ ] n = ( ϕ q ∗ [ n ] − ϕ ˉ q ) g q ∗ [ n − d q ] / N p P q ; then ( I − P X ) g = 0 (\mathbf{I}-\mathbf{P}_{X})\mathbf{g}=0 ( I − P X ) g = 0 , and P X f ~ \mathbf{P}_{X}\tilde{\mathbf{f}} P X f ~ has relative norm O ( ∣ S ∣ N t / N p ) O(\sqrt{|\mathcal{S}|N_t/N_p}) O ( ∣ S ∣ N t / N p ) because N p − 1 ∑ n ( ϕ q ∗ [ n ] − ϕ ˉ q ) x [ n − d ] x H [ n − d ] → 0 N_p^{-1}\sum_n(\phi_q^{*}[n]-\bar{\phi}_q)\mathbf{x}[n-d]\mathbf{x}^{H}[n-d]\to\mathbf{0} N p − 1 ∑ n ( ϕ q ∗ [ n ] − ϕ ˉ q ) x [ n − d ] x H [ n − d ] → 0 for every d d d . The reconstructible SI on S ∩ D S I \mathcal{S}\cap\mathcal{D}_{\mathrm{SI}} S ∩ D SI lies in the row space of X \mathbf{X} X and is removed. Hence the output is ( s + I ) f ~ (\mathbf{s}+\mathbf{I})\tilde{\mathbf{f}} ( s + I ) f ~ up to the stated relative error, where s \mathbf{s} s stacks the echo and I \mathbf{I} I stacks the i [ n ] \mathbf{i}[n] i [ n ] together with the SI on D S I ∖ S \mathcal{D}_{\mathrm{SI}}\setminus\mathcal{S} D SI ∖ S , if any, which is also uncorrelated with the reference. The echo gives N p P q ρ q β q a r N p − 1 ∑ n ϕ q [ n ] ( ϕ q ∗ [ n ] − ϕ ˉ q ) = N p P q ρ q β q a r ( 1 − ζ q ) \sqrt{N_pP_q}\rho_q\beta_q\mathbf{a}_rN_p^{-1}\sum_n\phi_q[n](\phi_q^{*}[n]-\bar{\phi}_q)=\sqrt{N_pP_q}\rho_q\beta_q\mathbf{a}_r(1-\zeta_q) N p P q ρ q β q a r N p − 1 ∑ n ϕ q [ n ] ( ϕ q ∗ [ n ] − ϕ ˉ q ) = N p P q ρ q β q a r ( 1 − ζ q ) , i.e., the power factor ( 1 − ζ q ) 2 (1-\zeta_q)^2 ( 1 − ζ q ) 2 , whereas I f ~ \mathbf{I}\tilde{\mathbf{f}} I f ~ , being uncorrelated with the reference, has covariance N p − 1 ∑ n ∣ ϕ q [ n ] − ϕ ˉ q ∣ 2 R i = ( 1 − ζ q ) R i N_p^{-1}\sum_n|\phi_q[n]-\bar{\phi}_q|^2\mathbf{R}_i=(1-\zeta_q)\mathbf{R}_i N p − 1 ∑ n ∣ ϕ q [ n ] − ϕ ˉ q ∣ 2 R i = ( 1 − ζ q ) R i . In case (a), f \mathbf{f} f is asymptotically orthogonal to the row space of X \mathbf{X} X , so the output is ( s + I ) f (\mathbf{s}+\mathbf{I})\mathbf{f} ( s + I ) f with the factors 1 1 1 and R i \mathbf{R}_i R i . The ratio of the SINRs is ( 1 − ζ q ) 2 / ( 1 − ζ q ) = 1 − ζ q (1-\zeta_q)^2/(1-\zeta_q)=1-\zeta_q ( 1 − ζ q ) 2 / ( 1 − ζ q ) = 1 − ζ q , which proves (21). ▪
Proof of Corollary 1
For ϕ q [ n ] = e j 2 π f D n T s \phi_q[n]=e^{j2\pi f_{\mathrm{D}}nT_s} ϕ q [ n ] = e j 2 π f D n T s , ϕ ˉ q \bar{\phi}_q ϕ ˉ q is a Dirichlet kernel, ∣ ϕ ˉ q ∣ = ∣ sin ( π f D T C P I ) / ( N p sin ( π f D T s ) ) ∣ → ∣ sinc ( f D T C P I ) ∣ |\bar{\phi}_q|=|\sin(\pi f_{\mathrm{D}}T_{\mathrm{CPI}})/(N_p\sin(\pi f_{\mathrm{D}}T_s))|\to|\operatorname{sinc}(f_{\mathrm{D}}T_{\mathrm{CPI}})| ∣ ϕ ˉ q ∣ = ∣ sin ( π f D T CPI ) / ( N p sin ( π f D T s )) ∣ → ∣ sinc ( f D T CPI ) ∣ as N p → ∞ N_p\to\infty N p → ∞ with T C P I T_{\mathrm{CPI}} T CPI fixed. For the chirp, ϕ ˉ q = T C P I − 1 ∫ − T C P I / 2 T C P I / 2 e − j π f R t 2 d t = 2 T C P I 2 f R ∫ 0 X e − j π u 2 / 2 d u \bar{\phi}_q=T_{\mathrm{CPI}}^{-1}\int_{-T_{\mathrm{CPI}}/2}^{T_{\mathrm{CPI}}/2}e^{-j\pi f_Rt^2}\,dt=\frac{2}{T_{\mathrm{CPI}}\sqrt{2f_R}}\int_0^X e^{-j\pi u^2/2}\,du ϕ ˉ q = T CPI − 1 ∫ − T CPI /2 T CPI /2 e − j π f R t 2 d t = T CPI 2 f R 2 ∫ 0 X e − j π u 2 /2 d u with u = 2 f R t u=\sqrt{2f_R}t u = 2 f R t and X = 2 f R T C P I / 2 X=\sqrt{2f_R}T_{\mathrm{CPI}}/2 X = 2 f R T CPI /2 ; the integral is C ( X ) − j S ( X ) C(X)-jS(X) C ( X ) − j S ( X ) , and ∣ ϕ ˉ q ∣ 2 = 4 [ C 2 ( X ) + S 2 ( X ) ] / ( 2 f R T C P I 2 ) = [ C 2 ( X ) + S 2 ( X ) ] / X 2 |\bar{\phi}_q|^2=4[C^2(X)+S^2(X)]/(2f_RT_{\mathrm{CPI}}^2)=[C^2(X)+S^2(X)]/X^2 ∣ ϕ ˉ q ∣ 2 = 4 [ C 2 ( X ) + S 2 ( X )] / ( 2 f R T CPI 2 ) = [ C 2 ( X ) + S 2 ( X )] / X 2 . The Doppler rate of a monostatic return at the zero-Doppler crossing is f R = 2 v e f f 2 / ( λ c R q ) f_R=2v_{\mathrm{eff}}^2/(\lambda_cR_q) f R = 2 v eff 2 / ( λ c R q ) , where v e f f v_{\mathrm{eff}} v eff is the geometric mean of the orbital and ground-track speeds. ▪
Proof of Proposition 2
From (18)–(19), u q H R i u q ≥ σ r 2 + σ Δ 2 tr ( R x ) + ϱ tr ( R S I ) \mathbf{u}_q^{H}\mathbf{R}_i\mathbf{u}_q\geq\sigma_r^2+\sigma_\Delta^2\operatorname{tr}(\mathbf{R}_x)+\varrho\operatorname{tr}(\mathbf{R}^{\mathrm{SI}}) u q H R i u q ≥ σ r 2 + σ Δ 2 tr ( R x ) + ϱ tr ( R SI ) , and from (14), tr ( R A S I ) ≥ N r σ Δ 2 tr ( R x ) \operatorname{tr}(\mathbf{R}^{\mathrm{SI}}_{\mathrm{A}})\geq N_r\sigma_\Delta^2\operatorname{tr}(\mathbf{R}_x) tr ( R A SI ) ≥ N r σ Δ 2 tr ( R x ) . Hence u q H R i u q ≥ σ r 2 + σ Δ 2 P ( 1 + ϱ N r ) \mathbf{u}_q^{H}\mathbf{R}_i\mathbf{u}_q\geq\sigma_r^2+\sigma_\Delta^2P(1+\varrho N_r) u q H R i u q ≥ σ r 2 + σ Δ 2 P ( 1 + ϱ N r ) with P = tr ( R x ) P=\operatorname{tr}(\mathbf{R}_x) P = tr ( R x ) . For the numerator, u q H R q u q = σ q 2 ∣ β q ∣ 2 ∣ u q H a r ∣ 2 ≤ σ q 2 ∣ β q ∣ 2 N r N t P \mathbf{u}_q^{H}\mathbf{R}_q\mathbf{u}_q=\sigma_q^2|\beta_q|^2|\mathbf{u}_q^{H}\mathbf{a}_r|^2\leq\sigma_q^2|\beta_q|^2N_rN_tP u q H R q u q = σ q 2 ∣ β q ∣ 2 ∣ u q H a r ∣ 2 ≤ σ q 2 ∣ β q ∣ 2 N r N t P by the Cauchy–Schwarz inequality and a t H R x a t ≤ ∥ a t ∥ 2 2 λ max ( R x ) ≤ N t P \mathbf{a}_t^{H}\mathbf{R}_x\mathbf{a}_t\leq\|\mathbf{a}_t\|_2^2\lambda_{\max}(\mathbf{R}_x)\leq N_tP a t H R x a t ≤ ∥ a t ∥ 2 2 λ m a x ( R x ) ≤ N t P . Therefore γ q ≤ N p σ q 2 ∣ β q ∣ 2 N r N t P / [ σ r 2 + σ Δ 2 P ( 1 + ϱ N r ) ] \gamma_q\leq N_p\sigma_q^2|\beta_q|^2N_rN_tP/[\sigma_r^2+\sigma_\Delta^2P(1+\varrho N_r)] γ q ≤ N p σ q 2 ∣ β q ∣ 2 N r N t P / [ σ r 2 + σ Δ 2 P ( 1 + ϱ N r )] , which is increasing in P P P and equals (26) at P = P max P=P_{\max} P = P m a x . For the stated point, H ^ r e s [ d ] R x = ( H S I [ d ] − H ^ S I [ d ] a t a t H / N t ) a t a t H P max / N t = 0 \widehat{\mathbf{H}}_{\mathrm{res}}[d]\mathbf{R}_x=(\mathbf{H}_{\mathrm{SI}}[d]-\widehat{\mathbf{H}}_{\mathrm{SI}}[d]\mathbf{a}_t\mathbf{a}_t^{H}/N_t)\mathbf{a}_t\mathbf{a}_t^{H}P_{\max}/N_t=\mathbf{0} H res [ d ] R x = ( H SI [ d ] − H SI [ d ] a t a t H / N t ) a t a t H P m a x / N t = 0 , so R S I r e s = σ Δ 2 P max I \mathbf{R}^{\mathrm{res}}_{\mathrm{SI}}=\sigma_\Delta^2P_{\max}\mathbf{I} R SI res = σ Δ 2 P m a x I , R A S I = σ Δ 2 P max I \mathbf{R}^{\mathrm{SI}}_{\mathrm{A}}=\sigma_\Delta^2P_{\max}\mathbf{I} R A SI = σ Δ 2 P m a x I , R i ∝ I \mathbf{R}_i\propto\mathbf{I} R i ∝ I , and all equalities hold with equality; the tap norm is ∑ d ∥ H ^ S I [ d ] ∥ 2 2 / N t \sum_d\|\widehat{\mathbf{H}}_{\mathrm{SI}}[d]\|_2^2/N_t ∑ d ∥ H SI [ d ] ∥ 2 2 / N t and the pre-ADC power is N r σ Δ 2 P max N_r\sigma_\Delta^2P_{\max} N r σ Δ 2 P m a x , which gives the feasibility conditions. ▪
Proof of Proposition 3
Write w k = c k h k + e k \mathbf{w}_k=c_k\mathbf{h}_k+\mathbf{e}_k w k = c k h k + e k with h k H e k = 0 \mathbf{h}_k^{H}\mathbf{e}_k=0 h k H e k = 0 , and let P c = ∑ k ∣ c k ∣ 2 ∥ h k ∥ 2 2 P_c=\sum_k|c_k|^2\|\mathbf{h}_k\|_2^2 P c = ∑ k ∣ c k ∣ 2 ∥ h k ∥ 2 2 and P = tr ( R x ) ≤ P max P=\operatorname{tr}(\mathbf{R}_x)\leq P_{\max} P = tr ( R x ) ≤ P m a x . Dropping the interference in the denominator of γ k \gamma_k γ k , γ k ≤ ∥ h k H w k ∥ 2 / σ k 2 = ∣ c k ∣ 2 ∥ h k ∥ 2 2 / σ k 2 \gamma_k\leq\|\mathbf{h}_k^{H}\mathbf{w}_k\|^2/\sigma_k^2=|c_k|^2\|\mathbf{h}_k\|_2^2/\sigma_k^2 γ k ≤ ∥ h k H w k ∥ 2 / σ k 2 = ∣ c k ∣ 2 ∥ h k ∥ 2 2 / σ k 2 , so ∑ k γ k ≤ γ max P c \sum_k\gamma_k\leq\gamma_{\max}P_c ∑ k γ k ≤ γ m a x P c with γ max = max k ∥ h k ∥ 2 2 / σ k 2 \gamma_{\max}=\max_k\|\mathbf{h}_k\|_2^2/\sigma_k^2 γ m a x = max k ∥ h k ∥ 2 2 / σ k 2 , giving a maximum-ratio transmission of P max P_{\max} P m a x to the strongest user attains this bound without SI, so Γ ˉ c = γ max P max \bar{\Gamma}_c=\gamma_{\max}P_{\max} Γ ˉ c = γ m a x P m a x . For the target, a t H h k = 0 \mathbf{a}_t^{H}\mathbf{h}_k=0 a t H h k = 0 gives a t H R x a t = ∑ k ∣ a t H e k ∣ 2 + a t H R s a t ≤ N t ( P − P c ) \mathbf{a}_t^{H}\mathbf{R}_x\mathbf{a}_t=\sum_k|a_t^{H}\mathbf{e}_k|^2+\mathbf{a}_t^{H}\mathbf{R}_s\mathbf{a}_t\leq N_t(P-P_c) a t H R x a t = ∑ k ∣ a t H e k ∣ 2 + a t H R s a t ≤ N t ( P − P c ) , and, as a proof of the Proposition 2, γ q ≤ γ ˉ q ( P − P c ) / P max \gamma_q\leq\bar{\gamma}_q(P-P_c)/P_{\max} γ q ≤ γ ˉ q ( P − P c ) / P m a x with F = ϵ 2 INR ( 1 + ϱ N r ) F=\epsilon^2\operatorname{INR}(1+\varrho N_r) F = ϵ 2 INR ( 1 + ϱ N r ) . Hence the normalized objective is at most α c P c / P max + α r ( P − P c ) / P max / ( 1 + F P / P max ) \alpha_cP_c/P_{\max}+\alpha_r(P-P_c)/P_{\max}\,/\, (1+FP/P_{\max}) α c P c / P m a x + α r ( P − P c ) / P m a x / ( 1 + F P / P m a x ) , which is linear in P c ∈ [ 0 , P ] P_c\in[0,P] P c ∈ [ 0 , P ] and therefore maximized at an endpoint, giving max { α c P / P max , α r ( P / P max ) / ( 1 + F P / P max ) } \max\{\alpha_cP/P_{\max},\alpha_r(P/P_{\max})/(1+FP/P_{\max})\} max { α c P / P m a x , α r ( P / P m a x ) / ( 1 + F P / P m a x )} ; both terms increase with P P P , so the bound equals max { α c , α r } \max\{\alpha_c,\alpha_r\} max { α c , α r } , with α c = 1 − α r \alpha_c=1-\alpha_r α c = 1 − α r . The two terms are equal at α r ⋆ = 1 / ( 1 + ρ ) \alpha_r^{\star}=1/(1+\rho) α r ⋆ = 1/ ( 1 + ρ ) , and for α r ≠ α r ⋆ \alpha_r\ne\alpha_r^{\star} α r = α r ⋆ only the corresponding endpoint attains it. The HD-optimal beamformers give α c \alpha_c α c , and the point of Proposition 2 gives α r ˉ \alpha_r\bar{} α r ˉ ; both are feasible under the stated conditions, which proves attainment and (30). ▪
Proof of Lemmas 2 and 3
Problem (44) is convex in { C [ d ] } \{\mathbf{C}[d]\} { C [ d ]} (L ⪰ 0 \mathbf{L} \succeq0 L ⪰ 0 , R x ⪰ 0 \mathbf{R}_x \succeq0 R x ⪰ 0 ) with a convex constraint, and Slater’s condition holds, so the KKT conditions are necessary and sufficient. Setting the gradient of the Lagrangian with respect to C ∗ [ d ] \mathbf{C}^{*}[d] C ∗ [ d ] to zero gives L C [ d ] R x + ϑ C [ d ] = T d R x \mathbf{L}\mathbf{C}[d]\mathbf{R}_x+\vartheta\mathbf{C}[d]=\mathbf{T}_d\mathbf{R}_x LC [ d ] R x + ϑ C [ d ] = T d R x . Substituting the eigendecompositions and C ~ d = E H C [ d ] F \widetilde{\mathbf{C}}_d=\mathbf{E}^{H}\mathbf{C}[d]\mathbf{F} C d = E H C [ d ] F decouples the equation entrywise, ( [ Λ ] i , i p j + ϑ ) [ C ~ d ] i , j = [ T ~ d ] i , j p j ([\mathbf{\Lambda}]_{i,i}p_j+\vartheta)[\widetilde{\mathbf{C}}_d]_{i,j}=[\widetilde{\mathbf{T}}_d]_{i,j}p_j ([ Λ ] i , i p j + ϑ ) [ C d ] i , j = [ T d ] i , j p j , whose solution is (45) ; a zero denominator occurs only when p j = 0 p_j=0 p j = 0 or ( ϑ = 0 (\vartheta=0 ( ϑ = 0 and [ Λ ] i , i = 0 ) [\mathbf{\Lambda}]_{i,i}=0) [ Λ ] i , i = 0 ) , in which case the entry does not affect the objective and is set to zero for minimum norm. Since ∥ C [ d ] ∥ F = ∥ C ~ d ∥ F \|\mathbf{C}[d]\|_{F}=\|\widetilde{\mathbf{C}}_d\|_{F} ∥ C [ d ] ∥ F = ∥ C d ∥ F is strictly decreasing in ϑ \vartheta ϑ , complementary slackness fixes ϑ \vartheta ϑ uniquely. Lemma 2 is the case L = I N r \mathbf{L}=\mathbf{I}_{N_r} L = I N r , T d = H S I [ d ] \mathbf{T}_d=\mathbf{H}_{\mathrm{SI}}[d] T d = H SI [ d ] , for which the objective equals Π A \Pi_A Π A up to the constant ∑ d tr ( H S I [ d ] R x H S I H [ d ] ) \sum_d\operatorname{tr}(\mathbf{H}_{\mathrm{SI}}[d]\mathbf{R}_x\mathbf{H}_{\mathrm{SI}}^{H}[d]) ∑ d tr ( H SI [ d ] R x H SI H [ d ]) ; then [ C ~ d ] i , j = [ T ~ d ] i , j p j / ( p j + ϑ ) [\widetilde{\mathbf{C}}_d]_{i,j}=[\widetilde{\mathbf{T}}_d]_{i,j}p_j/(p_j+\vartheta) [ C d ] i , j = [ T d ] i , j p j / ( p j + ϑ ) , the residual in direction j j j is ∑ d , i ∣ [ T ~ d ] i , j ∣ 2 p j ( 1 − p j / ( p j + ϑ ) ) 2 = h j p j ϑ 2 / ( p j + ϑ ) 2 \sum_{d,i}|[\widetilde{\mathbf{T}}_d]_{i,j}|^2p_j(1-p_j/(p_j+\vartheta))^2=h_jp_j\vartheta^2/(p_j+\vartheta)^2 ∑ d , i ∣ [ T d ] i , j ∣ 2 p j ( 1 − p j / ( p j + ϑ ) ) 2 = h j p j ϑ 2 / ( p j + ϑ ) 2 and the tap norm is ∑ j h j p j 2 / ( p j + ϑ ) 2 \sum_jh_jp_j^2/(p_j+\vartheta)^2 ∑ j h j p j 2 / ( p j + ϑ ) 2 , which gives (27) . For Corollary 2, full cancellation requires ϑ = 0 \vartheta=0 ϑ = 0 , i.e., ∑ j : p j > 0 h j ≤ P max \sum_{j:p_j>0}h_j\leq P^{\max} ∑ j : p j > 0 h j ≤ P m a x ; for eigenvectors generic with respect to H S I \mathbf{H}_{\mathrm{SI}} H SI , E { h j } = ∑ d ∥ H S I [ d ] ∥ F 2 / N t \mathbb{E}\{h_j\}=\sum_d\|\mathbf{H}_{\mathrm{SI}}[d]\|_{F}^{2}/N_t E { h j } = ∑ d ∥ H SI [ d ] ∥ F 2 / N t by isotropy, which gives the approximation. ∎