Documente Academic
Documente Profesional
Documente Cultură
fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
Abstract— The focus of this paper is on multi-user multi- by restricting attention to small cell coverage and by reaping
input multi-output (MIMO) transmissions for millimeter wave the increased array gains from the use of large antenna
systems with a hybrid precoding architecture at the base- arrays at both the base-station and user ends, significant rate
station. To enable multi-user transmissions, the base-station
uses a cell-specific codebook of beamforming vectors over an improvements can be realized in practice.
initial beam alignment phase. Each user uses a user-specific Millimeter wave propagation is spatially sparse with few
codebook of beamforming vectors to learn the top-P (where dominant clusters in the channel relative to the number of
P ≥ 1) beam pairs in terms of the observed signal-to-noise antennas [5], [6], [11], [12]. Spatial sparsity of the channel
ratio (SNR) in a single-user setting. The top-P beam indices along with the use of large antenna arrays motivates a subset
along with their SNRs are fed back from each user and
the base-station leverages this information to generate beam of physical layer beamforming schemes based on directional
weights for simultaneous transmissions. A typical method to transmissions for signaling. In this context, there have been
generate the beam weights is to use only the best beam a number of studies on the design and performance analysis
for each user and either steer energy along this beam, or of directional beamforming/precoding structures for single-
to utilize this information to reduce multi-user interference. user multi-input multi-output (MIMO) systems [13]–[22].
The other beams are used as fall back options to address
blockage or mobility. Such an approach completely discards These works [16]–[19] show that directional schemes are
information learned about the channel condition(s) even though not only good from an implementation standpoint, but are
each user feeds back this information. With this background, also robust to phase changes across clusters and allow a
this work develops an advanced directional precoding structure smooth tradeoff between peak beamforming gain and initial
for simultaneous transmissions at the cost of an additional user discovery latency. There has also been progress in
marginal feedback overhead. This construction relies on three
main innovations: 1) Additional feedback to allow the base- generalizing such directional constructions for multi-user
station to reconstruct a rank-P approximation of the channel MIMO transmissions [22]–[25].
matrix between it and each user, 2) A zeroforcing structure that In this context, while legacy systems use as many radio
leverages this information to combat multi-user interference frequency (RF) chains1 as the number of antennas, their
by remaining agnostic of the receiver beam knowledge in the higher cost, energy consumption, area and weight at mil-
precoder design, and 3) A hybrid precoding architecture that
allows both amplitude and phase control at low-complexity and
limeter wave carrier frequencies has resulted in the popularity
cost to allow the implementation of the zeroforcing structure. of hybrid beamforming systems [26]–[29]. A hybrid beam-
Numerical studies show that the proposed scheme results in forming system uses a smaller number of RF chains than the
a significant sum rate performance improvement over naı̈ve number of antennas, with the one extreme case of a single RF
schemes even with a coarse initial beam alignment codebook. chain being called the analog/RF beamforming system and
Index Terms— Millimeter wave, multi-input multi-output, the other extreme of as many RF chains as the number of
multi-user, beamforming, hybrid precoding, phase and am- antennas being called the digital beamforming system. Spatial
plitude control, zeroforcing, generalized eigenvector, channel sparsity of millimeter wave channels ensures that having as
estimation
many RF chains as the number of dominant clusters in the
channel is sufficient to reap the full array gain possible over
I. I NTRODUCTION these channels.
A number of recent works have addressed hybrid beam-
Over the last few years, there has been a growing interest
forming for millimeter wave systems. The problem of finding
in leveraging the opening up of the spectrum in the millimeter
the optimal precoder and combiner with a hybrid architecture
wave band (∼30-100 GHz) in realizing the emerging higher
is posed as a sparse reconstruction problem in [17], leading
data rate demands of cellular systems [1]–[4]. Communica-
to algorithms and solutions based on basis pursuit methods.
tions in the millimeter wave band suffers from increased
While the solutions achieve good performance in certain
path loss exponents, higher shadow fading, blockage and
cases, to address the performance gap between the solution
penetration losses, etc., than sub-6 GHz systems leading to
proposed in [17] and the unconstrained beamformer structure,
a poorer link margin than legacy systems [5]–[10]. However,
1 An RF chain includes (but is not limited to) analog-to-digital converters
This material is based upon work supported in part by the National (ADCs), digital-to-analog converters (DACs), mixers, low-noise and power
Science Foundation under grants CCF1403458 and CNS1642982. amplifiers (PAs), etc.
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
an iterative scheme is proposed in [30], [31] relying on end). To realize this reconstruction, we envision the additional
a hierarchical training codebook for adaptive estimation of feedback of the phase of the received signal estimate of
millimeter wave channels. The authors in [30], [31] show the top-P beams over the beam alignment phase and the
that a few iterations of the scheme are sufficient to achieve cross-correlation information of the top-P beams at the user
near-optimal performance. In [32], it is established that a end with the beam used for multi-user reception. With this
hybrid architecture can approach the performance of a digital novel construction, the base-station can remain agnostic of
architecture as long as the number of RF chains is twice that the user’s top-P beams in precoder design. In terms of
of the data-streams. A heuristic algorithm with good perfor- overhead, in 3GPP 5G-NR, these quantities can be fed back
mance is developed when this condition is not satisfied. A over the physical uplink control channel (PUCCH) with a
number of other works such as [33]–[36] have also explored Type-II feedback scheme [41, Sec. 8.2.1.6.3, pp. 24-26]; see
iterative/algorithmic solutions for hybrid beamforming. Sec. V-C for a detailed study that demonstrates this feedback
A common theme that underlies most of these works is the overhead to be marginal. Leveraging the rank-P channel
assumption of phase-only control in the RF/analog domain approximation, we propose the use of a zeroforcing structure
for the hybrid beamforming architecture. This assumption that is then quantized to meet the RF precoding constraints
makes sense at the user end with a smaller number of (amplitude and phase control) at the base-station end for
antennas (relative to the base-station end), where operating simultaneous transmissions.
the PAs below their peak rating across RF chains can lead
to a substantially poor uplink performance. On the other To benchmark and compare the performance of the pro-
hand, amplitude control (denoted as amplitude tapering in the posed scheme, we establish two upper bounds for the sum
antenna theory literature) is necessary at the base-station end rate. This is a fundamentally difficult problem given the non-
with a large number of antennas for side-lobe management convex dependence of the sum rate on the beamforming
and mitigating out-of-band emissions. Further, given that the vectors [42]–[44]. The first bound is based on an intuitive
base-station is a network resource, simultaneous amplitude parsing and understanding of the zeroforcing structure. The
and phase control of the individual antennas across RF second bound is based on an alternating optimization of
chains is feasible at millimeter wave base-stations at a low- the beamformer-combiner pair with signal-to-leakage and
complexity2 and cost [37, pp. 285-289], [38], [39]. In particu- noise ratio (SLNR) [45] and signal-to-interference and noise
lar, the millimeter wave experimental prototype demonstrated ratio (SINR) as optimization metrics. Numerical studies show
in [40] allows simultaneous amplitude and phase control. that the proposed scheme performs significantly better than
Thus, it is important to consider a hybrid architecture with a naı̈ve beam steering solution even for an initial beam
these constraints. Further, given the directional nature of the alignment codebook of poor resolution. Further, the proposed
channel, a solution should both inherit a directional structure scheme is comparable with the established upper bounds pro-
and provide an intuitive description of the beam weights. vided the beam alignment codebook resolution is moderate-
For example, a black box-type algorithmic solution that does to-good. Thus, our work establishes the utility and efficacy
not provide an intuitive description of the beam weights is of the proposed feedback techniques as well as opens up
less preferable over a solution that is constructed out of avenues for further investigation of such approaches in hybrid
measurement reports obtained over an initial beam alignment beamforming with millimeter wave systems.
phase with a directional structure for the sounding beams.
Main Contributions: With this backdrop, this work addresses Organization: This paper is organized as follows. Sec. II
these two fundamental issues in hybrid beamformer design. develops the system setup and explains the RF precoder
It is assumed that the base-station trains all the users in the architectural constraints adopted in this work. In Sec. III, we
cell with a cell-specific codebook of beamforming vectors provide a background of the initial beam alignment phase
over an initial beam alignment phase. Each user makes an and the feedback mechanism necessary for the multi-user
estimate3 of the top-P (where P ≥ 1) beams over this phase beamforming envisioned in this work. Sec. IV generates two
and reports the beam indices to be used by the base-station as upper bounds on the sum rate to benchmark the performance
well as the measured/received signal-to-noise ratios (SNRs). of the proposed scheme. Sec. V performs a number of numer-
The simplest implementation at the base-station uses only ical studies to understand the performance of the proposed
the best beam information for beam steering or zeroforcing scheme relative to a naı̈ve beam steering solution as well as to
as in [23], [24], with other beams serving as fall back options. the upper bounds developed in Sec. IV. Concluding remarks
In contrast to this approach, we propose to reconstruct are provided in Sec. VI.
or estimate a rank-P approximation of the channel matrix
between the base-station and the user (at the base-station Notations: Lower- and upper-case bold symbols are used to
denote vectors and matrices, respectively. The i-th entry of a
2 Any calibration complexity can be seen as a one-time effort at the unit
vector x and the (i, j)-th entry of a matrix X are denoted by
level for a large array and defrayed as a low network cost. x(i) and X(i, j), respectively. The regular matrix transpose
3 In a practical implementation such as the Third Generation Partnership
Project New Radio (3GPP 5G-NR) design, P = 4 is typically assumed both and complex conjugate Hermitian transpose operations of a
in terms of measurements and reporting [41]. The received SNR is estimated matrix are denoted by (·)T and (·)† , respectively. The two-
as the received power of a beamformed link (corresponding to the beam pair norm of a vector is denoted as ∥·∥ with C, R and CN standing
under consideration) using a certain reference symbol resource. This metric
is typically known as the reference symbol received power (RSRP) of the for the set of reals, complex numbers and the complex normal
link. random variable, respectively.
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
II. S YSTEM S ETUP where Σintf denotes the interference and noise covariance
We consider a cellular downlink scenario with a single matrix
base-station serving Kcell potential users. The base-station ρ
and each user are assumed to be equipped with planar arrays Σintf = Irk + G†Dig, k G†RF, k Hk FRF ·
K
of dimensions Ntx × Ntz antennas and Nrx × Nrz antennas,
∑
respectively. At both ends, the inter-antenna element spacing FDig, m F†Dig, m F†RF H†k GRF, k GDig, k . (5)
is λ/2 where λ is the wavelength of propagation. With Nt = m̸=k
Ntx · Ntz and Nr = Nrx · Nrz , the base-station and each user
are assumed to have Mt ≤ Nt and Mr ≤ Nr RF chains,
The traditional use of finite-rate feedback has been to
respectively.
convey the index of a precoder matrix from an appropriately-
For the channel Hk ∈ CNr ×Nt between the base-station
designed codebook of precoders to assist with adaptive trans-
and the k-th user (where k = 1, · · · , Kcell ), we assume
missions to improve Rk [47], [48]. More generally, feedback
an extended geometric propagation model over Lk clus-
from users can also be used to aid in scheduling, channel es-
ters/paths [6], [46]
timation and advanced/non-codebook based precoder design.
√
Nr Nt ∑
Lk
In this work, as we will see later in Sec. III, we assume that
Hk = αk,ℓ uk,ℓ v†k,ℓ . (1) each user feeds back its top beam indices, an estimate of the
Lk
ℓ=1 received SNR and signal phase, and cross-correlation of the
In (1), αk,ℓ , uk,ℓ and vk,ℓ denote the complex gain, the array top receive beams to assist with the design of a non-codebook
steering vector at the user end corresponding to the angle based multi-user precoder structure. In terms of precoder
of arrival (AoA) in azimuth/zenith, and the array steering constraints, we make the assumption that FDig, m ∈ CMt ×rm .
vector at the base-station corresponding to the angle of For the RF precoder, we assume that the amplitude and
departure (AoD) in azimuth/zenith, respectively. The cluster phase of each entry in FRF are controlled by a finite precision
gains are assumed to be independent and identically dis- gain controller and phase shifter, respectively. In other words,
tributed (i.i.d.) standard complex Gaussian random variables: the amplitude and phase come from a set of 2Bamp and 2Bphase
αk,ℓ ∼[ CN (0, 1). The normalization of the channel ensures
† ]
quantization levels
that E Tr(Hk Hk ) = Nr Nt .
In terms of the system model, we focus on the narrowband |FRF (i, j)| ∈ {A1 , · · · , A2Bamp } ,
aspects and assume that the base-station serves K ≤ Kcell { }
users simultaneously with data along Mt RF chains. The ∠FRF (i, j) ∈ ϕ1 , · · · , ϕ2Bphase , (6)
base-station precodes rm data-streams for the m-th user
with the rm × 1 symbol vector sm using the Mt × rm where 0 ≤ A1 < A2 < · · · < A2Bamp . Prior work on
digital/baseband precoder FDig, m which is then up-converted hybrid beamforming such as [17], [30]–[32] etc., assume that
to the carrier frequency by the use of the Nt ×Mt RF precoder the RF precoder can only be controlled by a phase shifter.
FRF . This results in the following system equation at the k-th However, such constraining assumptions are not reflective of
user practical implementations [38]–[40], where an independent
√ [ K ] gain controller can be used in every RF chain for every
ρ ∑
yk = Hk FRF · FDig, m sm + nk (2) antenna. With these structural constraints on the precoder,
K m=1 the transmit power constraint is captured by
where ρ is the pre-precoding SNR and nk ∼ CN (0, INr ) is ( )
∑
K
the Nr × 1 white Gaussian noise vector added at the k-th Tr F†Dig, m F†RF FRF FDig, m ≤ K. (7)
user. We assume that sm are i.i.d. complex Gaussian random m=1
vectors with E[sm ] = 0 and E[sm s†m ] = Irm .
At the k-th user, we assume that yk is processed (down- We are interested in the design of∑ RF and digital pre-
converted) with an Nr ×Mr user-specific RF combiner GRF, k coders with the sum rate, Rsum ,
K
k=1 Rk , being the
followed by a user-specific Mr × rk digital combiner GDig, k metric to maximize. In general, we only need the constraints
∑K
to produce an estimate of sk as follows r
k=1 k ≤ M t ≤ N t and max r
k k ≤ M r ≤ Nr . However,
√
† † ρ † the considered sum rate optimization with such an assump-
b
sk = GDig, k GRF, k yk = G G† Hk FRF FDig, k sk tion is quite complicated. To overcome this complexity, we
K Dig, k RF, k
√ consider a simple use-case in this work.
ρ † ∑ K
+ GDig, k G†RF, k Hk FRF FDig, m sm + nk .
K
m=1,m̸=k
(3) III. M ULTI -U SER B EAMFORMER D ESIGN
The achievable rate Rk (in nats/s/Hz) at the k-th user when
treating multi-user interference as noise is given as We are interested in the practically-motivated setting where
( ρ
each user is equipped with only one RF chain and the
Rk = log det Irk + G†Dig, k G†RF, k Hk FRF FDig, k · base-station transmits one data-stream to each user that is
K ) simultaneously scheduled. In this scenario, Mr = rk = 1
F†Dig, k F†RF H†k GRF, k GDig, k · Σ−1
intf (4) (for all k = 1, · · · , K) and Mt = K ≤ Nt . The system
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
decoding model in (2) and (3) reduce to A typical design methodology for Ftr is a hierarchical design
with different sets of beams that trade-off peak array gain
sk = G†Dig, k G†RF, k yk
b at the cost of initial beam acquisition latency. For example,
√ at least from the 3GPP 5G-NR perspective, the designs of
ρ Ftr and Gtrk are intended to be implementation-specific at the
= G†Dig, k G†RF, k · Hk FRF · FDig · |{z}
s +nk
| {z } | {z } K |{z} |{z} base-station and user ends, respectively. Nevertheless, over-
1×1 1×Nr Nt ×K K×K K×1
arching design guidelines for beam broadening are provided
(8) in [14], [19], [49], [50]. In particular, a broadened beam
√
ρ can be generated by an optimal co-phasing of a number
= · g† Hk [f1 s1 , · · · , fK sK ] + gk† nk (9)
K k of array steering vectors in appropriately chosen directions.
T
Both the number of such vectors as well as their steering
where FDig = [FDig,1 , · · · , FDig,K ] and s = [s1 , · · · , sK ] , directions can be optimized to produce a broadened beam. It
and the second equation follows assuming4 fk = FRF FDig,k must also be pointed out that most of the beam broadening
and GRF, k = gk . The power constraint is equivalent to
∑K †
works have some variations in terms of design principles and
m=1 fk fk ≤ K and Rk reduces to these variations themselves do not affect the flavor of results
( †
) reported in this paper.
K · |gk Hk fk |
ρ 2
Rk = log 1 + ρ ∑
. (10) In the beam alignment phase, the top-P beam indices at
1+ K · m̸=k |gk† Hk fm |2 the base-station and each user that maximize an estimate of
the received SNR are learned. In particular, the received SNR
The focus of this section is to first develop an advanced
corresponding to the (m, n)-th beam index pair at the k-th
feedback mechanism and a systematic design of the multi-
user is given as
user beamforming structure based on a directional repre-
( 2
sentation of the channel. This structure allows the base- (k) )†
SNR(k) (m, n) = g H f
k tr,n . (13)
station to combat multi-user interference in simultaneous rx tr,m
transmissions.
Let the beam pair indices at the k-th user be arranged in
non-increasing order of the received SNR and let the top-P
A. Initial Beam Alignment beam pair indices be denoted as
Enabling multi-user transmissions in practice is critically {( ) ( )}
M= mk1 , nk1 , · · · , mkP , nkP . (14)
dependent on an initial beam acquisition process (commonly
known as the beam alignment phase). In a practical im- With the simplified notation of
plementation such as 3GPP 5G-NR, beam alignment cor-
(k)
responds to a beam sweep over a block of secondary syn- rx (mℓ , nℓ ), ℓ = 1, · · · , P,
SNRrx, ℓ , SNR(k) k k
(15)
chronization (SS) signals transmitted over multiple ports/RF (k) (k)
chains. The use of multiple directional beams over multiple we have SNRrx, 1 ≥ · · · ≥ SNRrx, P . With the initial beam
ports results in a composite beam pattern at the base-station alignment methodology as described above, we now leverage
end (as seen from the user side). The composite pattern can the top-P beam information learned at the k-th user to
lead to uncertainty in the direction of the strongest path estimate the channel matrix Hk and to design FRF at the
between the base-station and the user. This directional ambi- base-station end.
guity is subsequently resolved with a beam refinement over
the individual constituent beams that make the composite B. Channel Reconstruction and Beamformer Design
beam on separate resource elements. Beam refinement allows
identification and ambiguity resolution of the constituent A typical use of the feedback information at the base-
beams. station is to select the top/best beam indices for all the users
and to leverage this information to construct a multi-user
Such a “post directional ambiguity resolved” beam align-
transmission scheme. Such an approach is adopted in [24],
ment process is modeled by assuming that the base-station is
where multi-user
( beam) designs leveraging only the top beam
equipped with an N element codebook Ftr
{ } pair index, mk1 , nk1 , and intended to serve different objec-
Ftr = f tr,1 , . . . , f tr,N , (11) tives are proposed: i) greedily (from each user’s perspective)
steering a beam to the best direction for that user (called
and the k-th user is equipped with an M element user-specific the beam steering scheme), ii) using the information collated
codebook Gtrk from different users to combat interference to other simulta-
{ } neously scheduled users via a zeroforcing solution (called
(k) (k)
Gtrk = gtr,1 , . . . , gtr,M . (12) the zeroforcing scheme), and iii) for leveraging both the
beam steering and interference management objectives via a
4 A simple realization of the hybrid precoding architecture is achieved by generalized eigenvector optimization (called
( the)generalized
setting FDig = IK and the desired fk for the k-th user is set as the k- eigenvector scheme). If the beam pair mk1 , nk1 is blocked
th column of FRF . The desired fk is such that fk† fk ≤ 1 and meets the or fades, the k-th user requests the base-station to switch to
quantization constraints in (6). In a practical implementation, FDig could be
primarily used for sub-band precoding and in the narrowband context of this the beam index nk2 and it switches to the beam with index
work, FDig = IK would reflect such an implementation-driven model. mk2 (and so on) [10].
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
In this work, we propose to generalize the structures in [24] For both φk,ℓ and νk,ℓ , without loss in generality, relative
by leveraging all the top-P beam pair indices fed back phases with respect to φk,1 and νk,1 (that is, φk,ℓ − φk,1 and
from each user. In this direction, the base-station intends to νk,ℓ − νk,1 ) can be reported.
reconstruct or estimate a rank-P approximation of (a scaled The mappings between the quantities of interest and the
version of) the channel matrix Hk corresponding to the k-th approximated quantities as well as the feedback overhead
user as follows needed from each user to implement the proposed scheme are
∑P described in Table I. While the feedback overhead increases
bk =
H α b †k,ℓ ,
b k,ℓ v
bk,ℓ u (16) linearly with P (the rank of the channel approximation), there
ℓ=1 are diminishing returns in terms of channel representation
where u b k,ℓ and v b k,ℓ are defined as estimates of the array accuracy since the clusters captured in H b k are sub-dominant
steering vectors uk,ℓ and vk,ℓ , respectively. Given the channel as P increases (and are eventually limited by Lk ). Thus, it is
model structure in (1), (16) is simplified by estimating vk, ℓ useful to select P to trade-off these two conflicting objectives.
and |αk, ℓ | by ftr,nkℓ and γk,ℓ , respectively, where Following the above discussion, the k-th user feeds back
√ the P × 5 matrix Pk , defined as
( ) k
(k)
γk,ℓ , QBSNR SNRrx, ℓ (17) n1 γk,1 0 µk,1 0
nk2 γk,2 φk,2 − φk,1 µk,2 νk,2 − νk,1
for some choice of BSNR . In the above description, QB (·) de- Pk , . .. .. .. .. , (22)
.. . . . .
notes an appropriately-defined B-bit quantization operation5
of the quantity under consideration. However, estimating H bk nP γk,P φk,P − φk,1 µk,P νk,P − νk,1
k
It then quantizes the amplitude and phase of βk,ℓ for some We are interested in benchmarking the performance of
choice of Bcorr, amp and Bcorr, phase and feeds them back the zeroforcing structure against an upper bound on Rsum .
The goal of optimizing Rsum over {fk , gk } with perfect
µk,ℓ , QBcorr, amp (|βk,ℓ |) , νk,ℓ , QBcorr, phase (∠βk,ℓ ) . (21) channel state information {Hk } is a non-convex optimiza-
5 A B-bit quantization operation is precisely specified if 2B disjoint
tion problem [42]–[44] that appears to be complicated. In
intervals that exactly and entirely span the range of the quantity and a this context, an alternate formulation based on the signal-
representative/quantized value from each interval are specified. to-leakage and noise ratio metric [45] that simultaneously
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
6
TABLE I: Mappings between quantities describing Hk and the approximated quantities, and their feedback overhead.
maximizes the array gain seen by the k-th user, |gk† Hk fk |2 , • In the case where ηm,k = 0 except if m = k or m = m′
and minimizes the interfering array gain seen by the other (for a specific m′ ̸= k), it can be seen that fk reduces
†
users, |gm Hm fk |2 , m ̸= k is relevant. Since these objectives to
are in some sense conflicting and can be weighed differently, ( )
Hb † gk − ηm′ ,k · g† ′ H
b m′ H
b † gk · H
b † ′ g m′
we consider the composite metric k m k m
fk =
( )
.
Hb gk − ηm′ ,k · g ′ H
† † b m′ H
b gk · H
† b † ′ g m′
ηk,k |gk† Hk fk |2 k m k m
SLNRk , ∑ †
(25) (29)
1+ m̸=k ηm,k |gm Hm fk |2
In other words, the specific design of fk in (29) removes
for an appropriate set of weighting factors ηm,k ≥ 0 with
a certain component of the beam corresponding to the
m, k ∈ {1, · · · , K}.
m′ -th user from the beam corresponding to the k-th user.
• In the general case, while it gets much harder to simplify
A. Upper Bound Motivated by the Zeroforcing Structure fk in (27), it can be seen that fk has the structure
∑K b b †
Building on Prop. 1, we now develop an upper bound for δm,k Hm gm
fk =
∑m=1
(30)
Rsum motivated by the zeroforcing structure. In this direction,
K δbm,k H b †m gm
m=1
we consider a signal-to-leakage-type metric equivalent of (25)
based on the estimated channel matrix H bk for some complex scalars δbm,k . In other words, the
† b optimal fk is in the span of {H b † gm } with the weights
m
\k , η |g H f | 2
b
SLNR ∑
k,k k k k
(26) {δm,k } that make the linear combination being a com-
† b
1 + m̸=k ηm,k |gm Hm fk |2 plicated function of {ηm,k } as well as {H b † gm }.
m
• The above observations are not entirely surprising given
for an appropriate set of weighting factors ηm,k ≥ 0 with
the Karhunen-Loève interpretation of the eigen-space of
m, k ∈ {1, · · · , K}.
the channel(s) [11], [51], [52] and utilizing an expansion
Proposition 2. Assuming that {H b † gm } and {ηm,k } are of fk on this basis. Such an expansion is also consistent
m
known at the base-station, the choice of fk that maximizes with Prop. 1 which shows that in the pure interference
\ k is given by the generalized eigenvector structure
SLNR management case (ηm,k → ∞ for all m ̸= k), fk is
( )−1 given as
∑ b † b b
†
INt + m̸=k ηm,k Hm gm gm Hm †
H k gk ∑K b † gm
Gm,k H
fk =
( ∑ )−1
. (27) fk =
∑m=1 m
(31)
b †m gm gm † b b † gk
K Gm,k H b †m gm
INt + m̸=k ηm,k H Hm H k
m=1
( )−1
Proof. See Appendix C. where the K × K matrix G = HH† .
• On the other hand, from (23), we note that H b † gm is
m
Several remarks are in order at this stage. itself a linear combination of the beams from Ftr . Thus,
• In the case where ηm,k are set to zero for all m ̸= k
fk in (27) is a linear combination of beams from Ftr . In
(that is, the focus is not on interference management), other words, the design of fk is equivalent to a search
the solution in (27) reduces to over N scalar (complex) weights, where N denotes the
size of the initial beam alignment codebook at the base-
∑P −j(φk,ℓ +νk,ℓ )
b † gk
H ℓ=1 µk,ℓ γ k,ℓ · e · ftr,nℓk station end.
fk = k
=
∑P
. With this interpretation, while Prop. 2 considers only the
∥Hb gk ∥
†
−j(φk,ℓ +νk,ℓ ) · f
ℓ=1 µk,ℓ γk,ℓ · e tr,nk
k ℓ \ b
(28) maximization of SLNRk (not even the sum rate with Hk ), we
can consider the optimization of Rsum over fk from a class
This is not surprising, and the base-station greedily Fk , defined as
steers a beam along the weighted set of top-P beams { ∑N
from Ftr for the k-th user. In other words, the base- δn,k ftr, n
Fk , fk : fk =
∑n=1
N
station generates a set of transmit weights that are n=1 δn,k ftr, n
}
matched to the transmit angular spread of the channel
such that δn,k ∈ C, k = 1, · · · , K . (32)
as identified by the resolution of Ftr .
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
7
(i) (i+1)
Theorem 1. Assume that the same multi-user beams gk as With {fk = = 1, · · · , K} fixed, compute
fk , k gk
in the zeroforcing scheme are used for reception at the k-th as the solution to the following optimization
user. Let {δn,k
⋆
} be defined as the solution to the search over (i+1)
gk = arg max SINRk . (38)
the complex scalars {δn,k } gk
{δn,k
⋆
} = arg max Rsum . (33) Again, from Lemma 1 in Appendix A, we have
{δn,k : fk ∈ Fk } −1
ρ ∑
= INr + (i) (i),† †
(i+1) (i)
With gk as above and gk Hk fm fm Hk Hk fk .
K
∑N ⋆
m̸=k
n=1 δn,k ftr, n (39)
fk =
∑N
, (34)
⋆
n=1 δn,k ftr, n (N ) (N +1)
3) Compute Rsum with {fk stop } and {gk stop } for a
we obtain an upper bound to the sum rate with the zeroforcing (potential) upper bound.
scheme. Numerical studies show that for almost all channel realiza-
The proof is trivial following the structure of fk in the tions, the proposed algorithm converges in a small number of
zeroforcing scheme in (31) and the definition of the class steps (Nstop ≈ 10) to lead to a tolerable level of difference
Fk in (32). Since the structure in (34) is obtained as a between successive iterates of Rsum . Further, while we are
search over scalar parameters, we call this upper bound a unable to theoretically establish that the proposed algorithm
scalar optimization-based upper bound. Further, while (34) results in an upper bound to Rsum , numerical studies (see
is difficult to practically implement, it provides a benchmark Sec. V-D) suggest that it leads to an upper bound for almost
to compare the realizable zeroforcing scheme of Prop. 1. all channel realizations.
Another important consequence of (34) is that the coeffi-
V. N UMERICAL S TUDIES
cients of fk for either the zeroforcing or the upper bound are
(in general) not of equal amplitude. Thus, fk has to be quan- We now present numerical studies in a single-cell down-
tized for implementation to ensure that the RF beamforming link framework to illustrate the advantages of the proposed
constraints are satisfied. In particular, we compute bfk with an beamforming solutions. The channel model from (1) is used
appropriate quantization scheme as below to generate a channel matrix with Lk = 6 clusters, AoDs
uniformly distributed in a 120o ×30o coverage area, and AoAs
|b
fk (i)| = Q eB (|fk (i)|) , ∠b
amp
eB
fk (i) = Q phase
(∠fk (i)) , (35) uniformly distributed in a 120o ×120o coverage area for each
of the k = 1, · · · , Kcell users in the cell. The AoD spread
and use them in transmissions for the k-th user. Good choices captures a traditional three-sector approach with a 30o zenith
e will be discussed in Sec. V-C.
for Q(·) coverage and the AoA spread corresponds to the assumption
of the use of multiple subarrays [9] with the best subarray
B. Bounding Rsum with an Alternating/Iterative Optimization limited to a 120 × 120 coverage. Lk = 6 is justified from
o o
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
proposed in [19] results in a discrete Fourier transform (DFT) terms of beam alignment (N = M → ∞). Thus, it is
codebook solution for N = 32 and N = 16. From Fig. 1, we not surprising that as N and M increase, the performance
observe that a beam codebook of small size (e.g., N = 4) of the proposed schemes compare well with that of [23],
where each beam offers a broad directional coverage can [24]. For lower codebook resolutions, the proposed schemes
reduce the acquisition latency at the cost of peak and/or overcome the codebook disadvantage by leveraging a better
worst-case array gain. On the other hand, a beam codebook channel approximation as P increases. These observations
of large size (e.g., N = 32) where each beam can offer suggest that the optimal choice of the rank in approximating
precision in terms of beamspace (and array gain) comes at b k (which in turn determines the feedback overhead)
gk† H
the cost of acquisition latency. For the codebooks at the user depends not only on the rank of the true channel Hk , but also
end, two codebook sizes (M = 4 for a reduced acquisition on the codebook granularities. In general, a higher P (and
latency and M = 16 for performance improvement at the feedback overhead) is necessary if the codebook resolution
cost of acquisition latency) are considered with similar beam is rich enough at the user end to allow the parsing of the
design principles as for the base-station side. channel better, but poor enough at the base-station end to
At this stage, it is worth noting that a number of system allow a sustained performance improvement with increasing
parameters impact the performance of the proposed multi- P . In particular, we provide the following heuristic design
user schemes such as: i) Granularity of Ftr and Gtrk (initial guidelines based on our studies
beam alignment codebook sizes), ii) Coarseness of channel
1 if M and N are small
approximation (rank-P ), iii) Finite-rate feedback of channel 2 if M is small and N is large
P = (40)
reconstruction parameters, and iv) Quantization of the result-
4 if M is large.
ing multi-user beams.
B. Quantizer Design
A. Impact of Initial Beam Alignment Codebook
Towards the second study, we utilize different quantization
In the first study, we consider the relative performance
functions to quantize the different parameters needed in
of the zeroforcing scheme (proposed in Prop. 1) relative to
channel reconstruction. For a phase term θ with a dynamic
a baseline beam steering scheme with different initial beam
range of [0, 2π) (e.g., ∠b
str,k,ℓ and ∠βk,ℓ ), we use a uniform
alignment codebooks. We assume that the system has infinite-
quantizer of the form
precision feedback of channel reconstruction parameters and ( B )
infinite-precision resolution in the quantization of multi-user 2π 2
QB (θ) = B · round ·θ , (41)
beams. We also compare the performance of the proposed 2 2π
schemes with the zeroforcing scheme presented in [23], [24], where round(·) stands for a function that rounds off the
where the system is assumed to be able to find perfectly underlying quantity to the nearest integer. For an amplitude
aligned directional beams in the training phase. Fig. 2 illus- term α with a dynamic range of [0, 1] (e.g., |βk,ℓ |), we use
trates this comparative performance with different choices of a non-uniform quantizer of the form
P in approximating gk† H b k and different codebook sizes (N ( )
and M ). round (2B − 1) · α
QB (α) = . (42)
While it is intuitive that there should be diminishing perfor- 2B − 1
mance as P increases (since increasing P beyond the channel The reason for scaling with respect to 2B − 1 in (42) instead
rank Lk is not expected to improve performance), whether of by 2B is because we want the quantized set to include
this saturation in performance is observed with a low-rank both 0 and 1 for proper cross-correlation quantization. For
channel approximation is dependent on the resolution of the example, in the typical case where the multi-user reception
codebooks. In particular, increasing P when the codebook (k)
beam gk = gtr,mk , we have |βk,1 | = 1 and the use of
granularity is already poor (small M and N ) does not lead 1
a uniform amplitude quantizer will not allow the correct
to any performance improvement than observed with P = 1 reproduction of this important quantity at the base-station
(beam steering). On the other hand, with a high resolution end.
for Ftr (large N ), even a rank-2 approximation appears to Quantization of the SNR is performed on a dB scale rather
be sufficient to reap most of the performance improvement than on a linear scale. This is intuitive since SNR mea-
gains. This is because the performance of the baseline (beam surements have a wide dynamic range. The proposed SNR
steering) scheme is already quite good and significant relative quantizer is similar to quantizations considered in Fourth
improvement over it with increasing P has a lower likelihood Generation (4G) systems. In particular, for a received SNR
unless the channel has a large number of similar gain clusters term ϱ (in
(a low-probability event). When M is large and N is small, ( dB)(k)with
) a theoretically unbounded range (e.g.,
10 log10 SNRrx, ℓ ), we first cap ϱ to a maximum value of
the beam steering performance is poor and the channel can be
ϱmax and quantize a spread of ∆ (in dB) with 2B quantization
better approximated with the higher codebook resolution of
levels (denoted as ϱi ) as follows:
Gtrk leading to a sustained performance improvement for even
up to P = 4. For example, with N = 4 or 8 and M = 16, ∆
ϱi = ϱmax − B · i, i = 0, · · · , 2B − 1. (43)
zeroforcing based on a rank-4 channel approximation leads 2 −1
to around 2 bps/Hz improvement at the median level. The quantization of ϱ is given as
In terms of performance comparison, note that the scheme
QB (ϱ) = ϱi⋆ where i⋆ = arg min |ϱ − ϱi |. (44)
from [23], [24] assumes P = 1 but infinite-precision in i=0,··· ,2B −1
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
9
20 20
17.5 17.5
15 15
12.5 12.5
10 10
7.5 7.5
5 5
2.5 2.5
0 0
25 35 45 55 65 75 85 95 105 115 125 135 145 155 25 35 45 55 65 75 85 95 105 115 125 135 145 155
Azimuth angle (in degrees) Azimuth angle (in degrees)
(a) (b)
15 12.5
12.5
10
10
Array gain (in dB)
7.5
7.5
5
5
2.5
2.5
0 0
25 35 45 55 65 75 85 95 105 115 125 135 145 155 25 35 45 55 65 75 85 95 105 115 125 135 145 155
Azimuth angle (in degrees) Azimuth angle (in degrees)
(a) (b)
Fig. 1: Beam patterns in the azimuth plane of four different base-station codebooks, all covering a 120o × 30o coverage
area, with (a) N = 32, (b) N = 16, (c) N = 8, and (d) N = 4 elements in Ftr .
The parameters ϱmax and ∆ correspond to the maximum quantized beam weights as
quantizer level value and the distance between adjacent
quantizer levels, respectively. In our numerical studies, we |b eB (|fk (i)|) = √1 ·
fk (i)| = Q
Nt
use ϱmax = 30 dB with ∆ = 24 dB for B = 2 bits, and { ( )
∆ = 30 dB for B = 4 bits. 0 if 10 log10 Nt · |fk (i)|2 < −∆f · (2B−1 − 1)
fj ⋆
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
10
1 1
0.9 0.9
0.8 0.8
N=4 N = 16 N=8 N = 32
0.7 0.7
0.6 0.6
CDF
CDF
0.5 0.5
0.4 0.4
0.3 0.3
0.9 0.9
0.8 0.8
N=4 N=8
0.7 0.7
0.6 0.6
CDF
CDF
N = 16 N = 32
0.5 0.5
0.4 0.4
0.3 0.3
of interest necessary for the channel reconstruction step. As infinite-precision for the other two quantities. To simplify this
noted from Table I, each user quantizes and feeds back to the investigation, we assume that Bcorr, phase = Bcorr, amp = Bcorr
base-station: i) the base-station beam indices, ii) the received and Fig. 3(c) considers the impact of Bcorr on performance.
SNRs, iii) the received signal’s phases, and iv) user side Both Figs. 3(b) and (c) show that increasing Best, phase or
codebook correlation information (amplitude and phases). To Bcorr has maximal impact on performance for large P . In
reduce clutter in presentation, in our studies illustrated in other words, if the channel approximation gets better, it
Fig. 3, we only focus on the N = 8 and N = 32 codebooks becomes pertinent to quantize the phase terms and codebook
for beam alignment with M = 16 at the user side. Fig. 3(a) correlation information in the channel reconstruction with a
considers the impact of BSNR (the number of bits used in finer resolution.
received SNR quantization) while infinite-precision is used
for the signal phases and codebook correlation. This figure While Figs. 3(a)-(c) study the quantization of each param-
shows that the proposed scheme is robust to BSNR in the sense eter of interest separately, we now consider the impact of
that for both the P = 2 and P = 4 cases, the performance finite-rate quantization of all the parameters necessary for
improvement is minimal as BSNR is increased from 2 bits to channel reconstruction (relative to infinite-precision quan-
4 bits. tization). For this, we consider the case where BSNR =
Best, phase = Bcorr, amp = Bcorr, phase = 3 bits with M =
On the other hand, Fig. 3(b) considers the impact of 16. From Fig. 3(d), we observe that the proposed joint
Best, phase (the number of bits used in received signal phase quantization scheme performs comparable with a scheme that
quantization) while infinite-precision is used for received uses infinite-precision for all the parameters of interest.
SNR and codebook correlation. In the third experiment, we
study the impact of codebook correlation quantization with At this stage, it is important to note that the feedback
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
11
1 1
0.9 0.9
0.8 0.8
N=8 N = 32 N=8 N = 32
0.7 0.7
0.6 0.6
CDF
CDF
0.5 0.5
0.4 0.4
0.9 0.9
0.8 0.8
N=8 N = 32 N=8 N = 32
0.7 0.7
0.6 0.6
CDF
CDF
0.5 0.5
0.4 0.4
overhead of φk,ℓ and νk,ℓ can be combined6 since they are M , N and P . On a first glance, while this may appear to be
always used in the form φk,ℓ + νk,ℓ (see (23)). Thus, based onerous, similar feedback overheads are currently considered
on the above studies, we make the following heuristic design viable in 3GPP 5G-NR design. In particular, two types of
guidelines on the feedback overhead feedback methods are being studied [41, Sec. 8.2.1.6.3, pp.
24-26]: i) Type-I feedback of both the beam indices and
BSNR = 2 bits, Best, phase + Bcorr, phase = Bcorr, amp = P bits.
RSRPs of the top-4 beams, and ii) a more general Type-II
(48)
feedback that can include feedback of covariance matrices,
Combining this information with Table I, the total feedback co-phasing factors with different codebook structures, etc.
overhead from each user is given as Further, the time-scales at which this information has to
Bfeedback = P · [log2 (N ) + BSNR + Bcorr, amp ] be reported is on the order of the coherence time of the
channel (which varies from a few milliseconds at high speeds
+ (P − 1) · [Best, phase + +Bcorr, phase ] (in bits) (49)
to a few hundreds of milliseconds in an indoor or low
= P · [log2 (N ) + 2 + P ] + (P − 1) · P (50) speed scenario [10], [40]) allowing multiple long PUCCH
= P · [log2 (N ) + 2P + 1] bits. (51) instances for beam reporting. Also, this control information
can be fed back on legacy carriers such as 4G links in
Bfeedback is presented in Table II for the choices P ∈ {2, 4}
a non-standalone deployment. Thus, the feedback overhead
and N ∈ {4, 8, 16, 32}. From Table II, a 56 bit control pay-
necessary for realizing the proposed schemes are practically
load appears to be sufficient to convey the information neces-
viable.
sary for multi-user beamforming across different choices of
6 Similarly, it might be envisioned that the feedback of γ
k,ℓ and µk,ℓ can
be combined, but their dynamic ranges are different. Feedback overhead
reduction could be a useful topic of study in future research.
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
12
TABLE II: Feedback overhead (Bfeedback ) for different choices of P and N
N =4 N =8 N = 16 N = 32
P =2 14 16 18 20
P =4 44 48 52 56
1
D. Quantization of Multi-User Beams and Comparison with Beam steering
0.9 Zeroforcing, P = 2
Upper Bounds Zeroforcing, P = 4
0.8 Scalar optimization
Alt. optimization
In the third study, the effect of quantizing the multi-user 0.7 Fully-digital
beams to ensure that it fits the RF precoder constraints as
0.6
in (6) is considered. In general, if a low rate quantization is
CDF
0.5
used (Bamp or Bphase ) as P increases, the resultant multi-user
beam’s sum rate performance could be worse than that with 0.4
beam steering. In particular, from Fig. 4(a), we observe that 0.3
a higher phase resolution (Bphase ) is necessary for improved
0.2
performance as the codebook resolution improves (large N )
or when P increases. On the other hand, from Fig. 4(b), 0.1
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
13
1 1
0.9 0.9
0.8 0.8
N=8 N = 32 N=8 N = 32
0.7 0.7
0.6 0.6
CDF
CDF
0.5 0.5
0.4 0.4
0.3 0.3
0.2 0.2
Beam steering Beam steering
Zeroforcing, B =3 Zeroforcing, B =4
0.1 phase 0.1 amp
Zeroforcing, B =5 Zeroforcing, B =6
phase amp
0 0
2 3 4 5 6 7 8 9 10 11 12 13 14 2 3 4 5 6 7 8 9 10 11 12 13 14
Sum rate (in bps/Hz) Sum rate (in bps/Hz)
(a) (b)
Fig. 4: CDF of sum rates of the different schemes with quantization constraints on the multi-user beam’s (a) phases and (b)
amplitudes.
1 1
Beam steering
0.9 0.9 Zeroforcing, P = 2
Zeroforcing, P = 4
0.8 0.8 Scalar optimization
Alt. optimization
0.7 0.7 Fully-digital
0.6 0.6
CDF
CDF
0.5 0.5
0.4 0.4
portance in practical implementations. While the solutions Lemma 1. If B is an n × n positive definite matrix, then
proposed in this work can be readily extended to polarization- the principal square-root (denoted as B1/2 ) exists and is
diversity transmissions, extending it to the case where the invertible (denoted as B−1/2 ). Further, if A is another n × n
users possess two (or more) RF chains with the base-station positive semi-definite matrix, the following optimization over
communicating over two spatial layers is of importance from n × 1 unit-norm vectors is well-understood [24], [44]
a 3GPP 5G-NR deployment perspective. Study of different ( )
f † Af B−1/2 · Dom eig B−1/2 A B−1/2
hybrid beamforming architectures such as the sub-connected fopt = arg max † = ( )
structure in [35] and comparison with the proposed scheme(s) f : ∥f ∥=1 f Bf ∥B−1/2 · Dom eig B−1/2 A B−1/2 ∥
would be of interest. Sensitivity of such advanced schemes to (52)
impairments such as Doppler and phase noise are also worth with Dom eig(·) denoting the dominant eigenvector operation
exploring more carefully. of the underlying matrix. In the special case where A =
ww† is a rank-1 matrix for some column vector w, then fopt
B−1 w
A PPENDIX reduces to fopt = ∥B−1 w∥ .
A. Generalized Eigenvector Solution Note that the generalized eigenvector of a matrix pair
We need the following statement on the generalized eigen- (A, B) is a vector x that solves the problem Ax = σBx
vector solution to the standard optimization that will be for some scalar σ. From this description, it can be seen that
repeatedly considered in this work. fopt in (52) is the dominant unit-norm generalized eigenvector
of the matrix pair (A, B).
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
14
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JSTSP.2018.2819135, IEEE
Journal of Selected Topics in Signal Processing
15
1932-4553 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.