Analog channel estimation techniques for beamformer design in massive MIMO systems
11811563 · 2023-11-07
Assignee
Inventors
Cpc classification
International classification
Abstract
Novel channel estimation techniques that can be performed solely in the analog domain are provided. The techniques use continuous analog channel estimation (CACE), periodic analog channel estimation (PACE), and multiantenna frequency shift reference (MAFSR). These techniques provide sufficient channel knowledge to enable analog beamforming at the receiver while significantly reducing the estimation overhead. These schemes involve transmission of a reference tone of a known frequency, either continuously along with the data (CACE, MAFSR) or in a separate phase from data (PACE). Analysis of the methods show that sufficient receiver beamforming gain can be achieved in sparse channels by building the beamformer using just the amplitude and phase estimates of the reference tone from each receiver antenna.
Claims
1. A MIMO system that applies continuous analog channel estimation, the MIMO system comprising: a transmitter (TX) that transmits a transmitted signal that includes a data signal combined with a predetermined reference signal; and a receiver (RX) including: a plurality of antennas wherein each antenna receives the transmitted signal and outputs an associated received signal; a baseband conversion processor that either includes an independent oscillator or recovers the predetermined reference signal including either or both of signal amplitude and phase, each associated received signal being multiplied with an independent oscillator signal or a recovered reference signal and with its quadrature component in the analog domain, resulting in processor output signals that are low-pass signals with at least partially compensated inter-antenna phase shift; an amplitude and phase compensation processor that adjusts outputs from the baseband conversion processor via analog phase shifters; an analog adder that receives output signals from the amplitude and phase compensation processor, the output signals including an in-phase-derived control signal and a quadrature output signal for each antenna in the plurality of antennas, the analog adder configured to emulate signal combining and beamforming by performing a weighted sum of the output signals from the amplitude and phase compensation processor to form a summed signal output, the analog adder including a first component configured to sum in-phase-derived output signals and a second part configured to sum quadrature output signals, wherein the summed signal output includes a real component Re(ω.sub.LPF(t)) and an imaginary component Im(ω.sub.LPF(t); and an analog to digital converter that samples the real component Re(ω.sub.LPF(t)) and imaginary component Im(ω.sub.LPF(t) of the summed signal output.
2. The MIMO system of claim 1 wherein the amplitude and phase compensation processor applies a baseband reference signal in the outputs from the baseband conversion processor as control signals to the analog phase shifters to further compensate for inter-antenna phase-shifts in the outputs from the baseband conversion processor.
3. The MIMO system of claim 1 wherein the transmitter transmits the transmitted signal by orthogonal frequency division multiplexing (OFDM).
4. The MIMO system of claim 1 wherein the analog adder applies a weight sum when summing the processor output signals.
5. The MIMO system of claim 1 wherein the baseband conversion processor includes a local oscillator instead of a signal recovery circuit.
6. The MIMO system of claim 1 wherein the baseband conversion processor includes: at least one reference signal recovery circuit; a plurality of first mixers with each antenna having an associated first mixer; and a plurality of second mixers with each antenna having a second mixer.
7. The MIMO system of claim 6 wherein each antenna has an associated signal recovery circuit.
8. The MIMO system of claim 6 wherein the reference signal recovery circuit includes a secondary phase locked loop array that receives signals-from a subset of the plurality of antennas and wherein outputs from each secondary phase locked loop are summed and fed as control signals to a primary phase locked loop.
9. The MIMO system of claim 8 wherein the outputs from each phase locked loop are summed as a weighted sum.
10. The MIMO system of claim 6 wherein: an associated reference signal recovery circuit of each antenna isolates and recovers the predetermined reference signal as an associated isolated reference signal from the associated received signal; the associated first mixer of each antenna multiplies the associated isolated reference signal with the associated received signal to produce an associated in-phase-derived output signal; and an associated second mixer of each antenna multiplies the quadrature component of the associated isolated reference signal with the associated received signal to produce a quadrature-derived output signal such that the associated in-phase-derived output signal and the quadrature-derived output signal are the processor output signals.
11. The MIMO system of claim 10 further comprising a plurality of low noise amplifiers positioned between each antenna and the baseband conversion processor.
12. The MIMO system of claim 10 wherein each associated reference signal recovery circuit includes an injection locked oscillator, a phase locked loop, or a bandpass filter.
13. The MIMO system of claim 10 wherein sufficient frequency separation may be provided between the predetermined reference signal and the data signal to enable each reference recovery circuit.
14. The MIMO system of claim 10 wherein a plurality of filters extract a baseband signal and filter out noise from the associated in-phase-derived output signal outputted by the plurality of first mixers and a second plurality of low pass filters extract associated quadrature-derived signals outputted by the plurality of second mixers.
15. The MIMO system of claim 14 further comprising a low pass filter and/or down converter that receives the summed signal output and outputs an analog baseband signal.
16. The MIMO system of claim 10 wherein a sparse nature of wireless channels is exploited to ensure a large beamforming gain after the summed signal output.
17. The MIMO system of claim 12 that can perform receive beamforming without digital channel estimation.
18. The MIMO system of claim 12 further comprising an analog to digital converter that converts an analog baseband signal to digital baseband signal and a demodulator that demodulates the digital baseband signal.
19. The MIMO system of claim 1 comprising the amplitude and phase compensation processor which includes associated phase shifters, each phase shifter receiving in-phase-derived control signal and a quadrature-derived control signal such that outputs from the baseband conversion processor are phase adjusted.
20. The MIMO system of claim 19, wherein the amplitude and phase compensation processor includes lowpass filters that filter in-phase and quadrature output signals from the baseband conversion processor to generate the in-phase-derived control signal and the quadrature-derived control signal to be used for the associated phase shifters, the baseband conversion processor including: at least one reference signal recovery circuit; a plurality of first mixers with each antenna having an associated first mixer; and a plurality of second mixers with each antenna having a second mixer.
21. The MIMO system of claim 1 wherein the baseband conversion processor recovers the predetermined reference signal.
22. The MIMO system of claim 1 wherein signal combining and beamforming is emulated without the receiver applying explicit channel estimation.
23. A MIMO system that applies continuous analog channel estimation, the MIMO system comprising: a transmitter (TX) that transmits a transmitted signal that includes a data signal combined with a predetermined reference signal; and a receiver (RX) including: at least three antennas wherein each antenna receives the transmitted signal and outputs an associated received signal; a baseband conversion processor that either includes an independent oscillator or recovers the predetermined reference signal including either or both of signal amplitude and phase, each associated received signal being multiplied with an independent oscillator signal or a recovered reference signal and with its quadrature component in the analog domain, resulting in processor output signals that are low-pass signals with at least partially compensated inter-antenna phase shift; and an analog adder configured to emulate signal combining and beamforming by performing a weighted sum of output signals from the baseband conversion processor to form a summed signal output, the output signals including an in-phase-derived output signal for each antenna and the summed signal output having a real component Re(ω.sub.LPF(t)) and imaginary component Im(ω.sub.LPF(t); and an analog to digital converter that samples the summed signal output.
24. The MIMO system of claim 23 wherein the transmitter transmits the transmitted signal by orthogonal frequency division multiplexing (OFDM).
25. The MIMO system of claim 23 wherein the analog adder applies a weighted sum when summing the processor output signals.
26. The MIMO system of claim 23 wherein the baseband conversion processor includes a local oscillator instead of a signal recovery circuit.
27. The MIMO system of claim 23 wherein the baseband conversion processor includes: at least one reference signal recovery circuit; a plurality of first mixers with each antenna having an associated first mixer; and a plurality of second mixers with each antenna having a second mixer.
28. The MIMO system of claim 27 wherein each antenna has an associated signal recovery circuit.
29. The MIMO system of claim 27 wherein the reference signal recovery circuit includes a secondary phase locked loop array that receives signals from a subset of the at least three antennas and wherein outputs from each secondary phase locked loop are summed and fed as control signals to a primary phase locked loop.
30. The MIMO system of claim 29 wherein the outputs from each phase locked loop are summed as a weighted sum.
31. The MIMO system of claim 26 wherein: an associated reference signal recovery circuit of each antenna isolates and recovers the predetermined reference signal as an associated isolated reference signal from the associated received signal; an associated first mixer of each antenna multiplies the associated isolated reference signal with the associated received signal to produce an associated in-phase-derived output signal; and an associated second mixer of each antenna multiplies the quadrature component of the associated isolated reference signal with the associated received signal to produce a quadrature-derived output signal such that the associated in-phase-derived output signal and the quadrature-derived output signal are the processor output signals.
32. The MIMO system of claim 31 further comprising a plurality of low noise amplifiers positioned between each antenna and the baseband conversion processor.
33. The MIMO system of claim 31 wherein each associated reference signal recovery circuit includes an injection locked oscillator, a phase locked loop, or a bandpass filter.
34. The MIMO system of claim 31 wherein sufficient frequency separation may be provided between the predetermined reference signal and the data signal to enable each reference recovery circuit.
35. The MIMO system of claim 32 wherein a plurality of filters extract a baseband signal and filter out noise from the associated in-phase-derived output signal outputted by a plurality of first mixers and a second plurality of low pass filters extract associated quadrature-derived signals outputted by a plurality of second mixers.
36. The MIMO system of claim 35 further comprising a low pass filter and/or down converter that receives the summed signal output and outputs an analog baseband signal.
37. The MIMO system of claim 31 wherein a sparse nature of wireless channels is exploited to ensure a large beamforming gain after the summed signal output.
38. The MIMO system of claim 33 that can perform receive beamforming without digital channel estimation.
39. The MIMO system of claim 33 further comprising an analog to digital converter that converts an analog baseband signal to digital baseband signal and a demodulator that demodulates the digital baseband signal.
40. The MIMO system of claim 23 wherein signal combining and beamforming is emulated without the receiver applying explicit channel estimation.
41. A MIMO system that applies continuous analog channel estimation, the MIMO system comprising: a transmitter (TX) that transmits a transmitted signal that includes a data signal combined with a predetermined reference signal; and a receiver (RX) including: a plurality of antennas wherein each antenna receives the transmitted signal and outputs an associated received signal and wherein each antenna has an associated signal recovery circuit; a baseband conversion processor that either includes an independent oscillator or recovers the predetermined reference signal including either or both of signal amplitude and phase, each associated received signal being multiplied with an independent oscillator signal or a recovered reference signal and with its quadrature component in the analog domain, resulting in processor output signals that are low-pass signals with at least partially compensated inter-antenna phase shift, the baseband conversion processor further including at least one reference signal recovery circuit, a plurality of first mixers with each antenna having an associated first mixer, and a plurality of second mixers with each antenna having a second mixer, wherein the reference signal recovery circuit includes a secondary phase locked loop array that receives signals-from a subset of the plurality of antennas and wherein outputs from each secondary phase locked loop are summed and fed as control signals to a primary phase locked loop; an amplitude and phase compensation processor that adjusts outputs from the baseband conversion processor via analog phase shifters; an analog adder that receives and sums output signals from the amplitude and phase compensation processor as a summed signal output thereby emulating signal combining and beamforming, the output signals including an in-phase-derived output signal for each antenna in the plurality of antennas, the summed signal output having a real component Re(ω.sub.LPF(t)) and imaginary component Im(ω.sub.LPF(t); and an analog to digital converter that samples a real component Re(ω.sub.LPF(t)) and imaginary component Im(ω.sub.LPF(t) of the summed signal output.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
(1)
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
for simulations and
(15)
for analytic approximation. We assume A.sub.1.sup.(r)=1, A.sub.5.sup.(r)=0.7e.sup.jπ/3, A.sub.15.sup.(r)=0.5e.sup.−jπ/3 and the remaining parameters are from Table 1.
(16) and the PLL parameters are from Table 1. For
(17)
(18) |), K=50, g=5).
(19)
(20)
DETAILED DESCRIPTION
(21) Reference will now be made in detail to presently preferred compositions, embodiments and methods of the present invention, which constitute the best modes of practicing the invention presently known to the inventors. The Figures are not necessarily to scale. However, it is to be understood that the disclosed embodiments are merely exemplary of the invention that may be embodied in various and alternative forms. Therefore, specific details disclosed herein are not to be interpreted as limiting, but merely as a representative basis for any aspect of the invention and/or as a representative basis for teaching one skilled in the art to variously employ the present invention.
(22) It is also to be understood that this invention is not limited to the specific embodiments and methods described below, as specific components and/or conditions may, of course, vary. Furthermore, the terminology used herein is used only for the purpose of describing particular embodiments of the present invention and is not intended to be limiting in any way.
(23) It must also be noted that, as used in the specification and the appended claims, the singular form “a,” “an,” and “the” comprise plural referents unless the context clearly indicates otherwise. For example, reference to a component in the singular is intended to comprise a plurality of components.
(24) The term “comprising” is synonymous with “including,” “having,” “containing,” or “characterized by.” These terms are inclusive and open-ended and do not exclude additional, unrecited elements or method steps.
(25) The phrase “consisting of” excludes any element, step, or ingredient not specified in the claim. When this phrase appears in a clause of the body of a claim, rather than immediately following the preamble, it limits only the element set forth in that clause; other elements are not excluded from the claim as a whole.
(26) The phrase “consisting essentially of” limits the scope of a claim to the specified materials or steps, plus those that do not materially affect the basic and novel characteristic(s) of the claimed subject matter.
(27) With respect to the terms “comprising,” “consisting of,” and “consisting essentially of,” where one of these three terms is used herein, the presently disclosed and claimed subject matter can include the use of either of the other two terms.
(28) Throughout this application, where publications are referenced, the disclosures of these publications in their entireties are hereby incorporated by reference into this application to more fully describe the state of the art to which this invention pertains.
Abbreviations
(29) “ACE” means analog channel estimation. “aCSI” means average channel state information. “ADC” means analog-to-digital converters. “BS” means base-station. “DAC” means digital-to-analog converters. “IA” means initial access. “MA-FSR” means multi-antenna frequency shift reference “MIMO” means multiple-input-multiple-output. “MPC” means multi-path components. “OFDM” means orthogonal frequency division multiplexing. “CACE” means continuous analog channel estimation “PACE” means periodic analog channel estimation. “rCSI” means required channel state information. “RTAT” means reference tone aided transmission. “SNR” means signal-to-noise ratio. “TX” means transmitter. “RX” means receiver. “UE” means user equipment. “aBD” mean analog beamformer design phase
(30) With reference to
(31) Still referring to
(32) In the variation depicted in
(33) In the variation depicted in
(34) With reference to
(35) Still referring to
(36) Still referring to
(37) In a refinement, the reference signal can be recovered from one antenna or a plurality of antennas.
(38) In a variation, MIMO system 60 includes a low pass filter and/or downconverter 100 that receives as input the summed signal output and outputs a baseband signal. The baseband signal is sampled by Analog to digital converter 102 to form a digital baseband signal. The digital baseband signal is then demodulated by OFDM demodulator 104 that demodulates the bandpass signal.
(39) With reference to
(40) With reference to
(41) With respect to the systems of
(42) The following examples illustrate the various embodiments of the present invention. Those skilled in the art will recognize many variations that are within the spirit of the present invention and scope of the claims.
(43) 1. Continuous Analog Channel Estimation Aided Beamforming for Massive MIMO Systems
(44) I. Introduction
(45) In this embodiment, a more generalized ACE approach for RX beamforming, called continuous ACE (CACE) is explored, that does not require carrier recovery at the RX, mitigates oscillator phase noise and works in multi-path channels. The latter is accomplished by exploiting not only phase of the carrier signal at the RX but also its amplitude. In CACE, a reference tone, i.e. a sinusoidal tone at a known frequency, is continuously transmitted along with the data by the TX as illustrated in
(46) Notation: scalars are represented by light-case letters; vectors by bold-case letters; and sets by calligraphic letters. Additionally, j=√{square root over (−1)}, a* is the complex conjugate of a complex scalar a, |a| represents the .sub.2-norm of a vector a, A.sup.T is the transpose of a matrix A and A.sup.† is the conjugate transpose of a complex matrix A. Finally,
.sub.a is an a×a identity matrix,
.sub.a,b is the a×b all zeros matrix,
{ } represents the expectation operator,
represents equality in distribution, Re{.Math.}/lm{.Math.} refer to the real/imaginary component, respectively, and
(a, B) represents a circularly symmetric complex Gaussian vector with mean a and covariance matrix B.
(47) II. General Assumptions and System Model
(48) We consider a single cell system in downlink, where a M.sub.tx antenna base-station (BS) transmits data to multiple UEs simultaneously via spatial multiplexing. Since we mainly focus on the downlink, we shall use the terms BS/TX and UE/RX interchangeably. Each UE is assumed to have a hybrid architecture, with M.sub.rx antennas and one down-conversion chain, and it performs CACE aided RX beamforming. On the other hand, the BS may have an arbitrary architecture and it transmits a single spatial data-stream to each scheduled UE. For convenience, we consider the use of noise-less and perfectly linear antennas, filters, amplifiers and mixers at both the BS and the representative UE. We assume the downlink BS-UE communication to be divided into three stages: (i) Initial Access (IA)(ii) TX beamformer design—where the TX acquires rCSI for all the UEs and uses it to perform UE scheduling, TX beamforming and power allocation and (iii) Data transmission—wherein the BS transmits data signals and the scheduled UEs use CACE to adapt the RX beams and receive the data. Through a major portion of this paper, we assume that the IA and TX beamformer design have been performed apriori and shall focus on the data transmission stage. However in Section 5, we shall also discuss how CACE beamforming can help in stages (i) and (ii).
(49) In stage (iii), we assume the BS to transmit spatially orthogonal signals to the scheduled UEs to mitigate inter-user interference. This can be achieved, for example, by careful UE scheduling and/or via avoiding transmission to common channel scatterers (A. Adhikary, E. A. Safadi, M. K. Samimi, R. Wang, G. Caire, T. S. Rappaport, and A. F. Molisch, “Joint spatial division and multiplexing for mm-wave channels,” IEEE Journal on Selected Areas in Communications, vol. 32, pp. 1239-1255, June 2014). For this system model and for a given TX beamformer and power allocation, we shall restrict the analysis to a single representative UE without loss of generality. The BS is assumed to transmit orthogonal frequency division multiplexing (OFDM) symbols to the representative UE, with K=K.sub.1+K.sub.2+1 sub-carriers indexed as ={−K.sub.1, . . . , K.sub.2}. The 0-th sub-carrier is used as a reference tone, i.e., a pure sinusoidal signal with a pre-determined frequency, while data is transmitted on the K.sub.1−g lower and K.sub.2−g higher sub-carriers, represented by the index set {K.sub.1, . . . , −g−1, g+1, . . . , K.sub.2}. The 2g sub-carriers indexed as {−g, . . . , −1, 1, . . . , g} are blanked to act as a guard band between the reference and data sub-carriers as illustrated in
(50)
for −T.sub.cp≤t≤T.sub.s, where t is the M.sub.tx×1 unit-norm TX beamforming vector for this UE (designed apriori in stage (ii)), E.sup.(r) is the energy-per-symbol allocated to the reference tone, ={−g, . . . , 0, . . . g} defines the non-data sub-carriers, x.sub.k is the data signal on the k-th sub-carrier, f.sub.c is the reference frequency, f.sub.k=k/T.sub.s represents the frequency offset of the k-th sub-carrier and T.sub.s, T.sub.cp are the symbol duration and the cyclic prefix duration, respectively. Here we define the complex equivalent signal such that the actual (real) transmit signal is given by s.sub.tx(t)=Re{{tilde over (s)}.sub.tx(t)}. For the data sub-carriers (k∈
\
), we assume the use of independent data streams with equal power allocation, and circularly symmetric Gaussian signaling, i.e., x.sub.k˜
(0, E.sup.(d)). The transmit power constraint is then given by E.sup.(r)+(K−|
|)E.sup.(d)≤E.sub.s, where E.sub.s is the total OFDM symbol energy (excluding the cyclic prefix). The channel to the representative UE is assumed to have L MPCs with the M.sub.rx×M.sub.tx channel impulse response matrix and its Fourier transform, respectively, given as (M. Akdeniz, Y. Liu, M. Samimi, S. Sun, S. Rangan, T. Rappaport, and E. Erkip, “Millimeter wave channel modeling and cellular capacity evaluation,” IEEE Journal on Selected Areas in Communications, vol. 32, pp. 1164-1179, June 2014.19):
H(t)=a.sub.rx(
)a.sub.tx(
).sup.†δ(t−
), (1.2a)
(f)=
a.sub.rx(
)a.sub.tx(
).sup.†
, (1.2b)
where α.sub. is the complex amplitude and τ
.sub. is the delay and a.sub.tx(
), a.sub.rx(
) are the M.sub.tx×1 TX and M.sub.rx×1 RX array response vectors, respectively, of the
-th MPC. As an illustration, the
-th RX array response vector for a uniform planar array with M.sub.H horizontal and M.sub.V vertical elements (M.sub.rx=M.sub.HM.sub.V) is given by a.sub.rx(
)=ā.sub.rx(ψ.sub.azi.sup.rx(
), ψ.sub.ele.sup.rx(
)), where
(51)
for h∈{0, . . . , M.sub.H−1} and ν∈(1, . . . , M.sub.V), ψ.sub.azi.sup.rx(), ψ.sub.ele.sup.rx(
) are the azimuth and elevation angles of arrival for the
-th MPC, Δ.sub.H, Δ.sub.V are the horizontal and vertical antenna spacings and λ is the carrier wavelength. Expressions for a.sub.tx(
) can be obtained similarly. Note that in (1.2) we implicitly ignore the frequency variation of individual MPC amplitudes (α.sub.0, . . . , α.sub.L−1) and the beam squinting effects (S. K. Garakoui, E. A. M. Klumperink, B. Nauta, and F. E. van Vliet, “Phased-array antenna beam squinting related to frequency dependency of delay circuits,” in European Microwave Conference, pp. 1304-1307, October 2011.53), which are reasonable assumptions for moderate system bandwidths. It is emphasized that the complete channel response (including all MPCs) however still experiences frequency selective fading. To prevent inter-symbol interference, we let the cyclic prefix be longer than the maximum channel delay: T.sub.cp>τ.sub.L−1. We also consider a generic temporal variation model, where the time for which MPC parameters {
,a.sub.tx(
),a.sub.rx(
),
} stay approximately constant is much larger than the symbol duration T.sub.s. Finally, we do not assume any distribution prior or side information on {
,a.sub.tx(
),a.sub.rx(
),
}.
(52) Each RX antenna front-end is assumed to have a low noise amplifier (LNA) followed by a band-pass filter (BPF) that leaves the desired signal un-distorted but suppresses the out-of-band noise. The filtered signal is then converted to baseband using the in-phase and quadrature-phase components of an RX local oscillator, as depicted in
(53)
for 0≤t≤T.sub.s, where the Re/Im parts of {tilde over (s)}.sub.rx,BB(t) are the outputs corresponding to the in-phase and quadrature-phase components of the RX oscillator, θ(t) is the phase-noise process of the RX oscillator and {tilde over (w)}(t) is the M.sub.rx×1 complex equivalent, baseband, stationary, additive, vector Gaussian noise process, with individual entries being circularly symmetric, independent and identically distributed (i.i.d.), and having a power spectral density: .sub.w(f)=N.sub.0 for −f.sub.K.sub.
(54)
where w.sub.θ(t) is a real white Gaussian process with variance σ.sub.θ.sup.2. We assume the RX to have apriori knowledge of σ.sub.θ. As illustrated in
(55)
where we define A(t)LPF.sub.ĝ{e.sup.−jθ(t)} and ŵ(t) is the M.sub.rx×1 filtered Gaussian noise with power spectral density:
.sub.w(f)=N.sub.0 for −f.sub.ĝ≤f≤f.sub.ĝ. An illustration of this filtering operation is provided in
(56)
where we define
(57)
Conventional OFDM demodulation follows on y[n] to obtain the different OFDM sub-carrier outputs, as analyzed in Section 3.
(58) III. Analysis of the Demodulation Outputs
(59) Without loss of generality, we shall restrict the analysis to the representative 0-th OFDM symbol and thus, we only focus on {y[n]|0≤n<K}. Note that the sampled, band-limited additive noise {tilde over (w)}[n] and the sampled RX phase-noise e.sup.−jθ[n] for 0≤n<K can be expressed using their normalized Discrete Fourier Transform (nDFT) expansions as:
{tilde over (w)}[n]=W[k]e.sup.j2πkn/K, (1.8a)
e.sup.−jθ[n]=Ω[k]e.sup.j2πkn/K, (1.8b)
where
(60)
are the corresponding nDFT coefficients. Here nDFT is an unorthodox definition for Discrete Fourier Transform, where the normalization by K is performed while finding W[k],Ω[k] instead of in (1.8). These nDFT coefficients are periodic with period K and satisfy the following lemma:
(61) Lemma 3.1 The nDFT coefficients of e.sup.−jθ[n] for 0≤n<K satisfy:
(62)
for arbitrary integers k.sub.1, k.sub.2, where δ.sub.a,b.sup.K=1 if a=b (mod K) or δ.sub.a,b.sup.K=0 otherwise.
(63) Proof. See Appendix 1A.
(64) To test the accuracy of the approximation in Lemma 3.1, the Monte-Carlo simulations of Δ.sub.k,k, Δ.sub.k,k+1 and Δ.sub.k,k+100 for a typical phase-noise process (−93 dBc/Hz at 10 MHz offset) are compared to (1.9b) in
(65) Lemma 3.2 The nDFT coefficients of {tilde over (w)}[n], i.e., {W[k]|∀k}, are jointly Gaussian with:
(66)
for arbitrary integers k.sub.1, k.sub.2, where δ.sub.a,b.sup.K=1 if a=b (mod K) or δ.sub.a,b.sup.K=0 otherwise.
(67) Proof. See Appendix 1B.
(68) Note that using these nDFT coefficients, the low-pass filtered versions of {tilde over (w)}[n] and e.sup.−jθ[n] in (1.7) can be approximated as:
ŵ[n]≈W[k]e.sup.j2πkn/K, (1.11a)
A[n]≈Ω[k]e.sup.j2πkn/K, (1.11b)
where ={−ĝ, . . . , ĝ} and the approximations are obtained by replacing the linear convolution of {tilde over (s)}.sub.rx,BB(t) and the filter response LPF.sub.ĝ{ } with a circular convolution. This is accurate when the filter response has a narrow support, i.e., for ĝ»1. The remaining results in this paper are based on the approximations in (1.9)-(1.11) and on an additional approximation discussed later in Remark 3.1. While we still use the ≤, =, ≥ operators in the following results for convenience of notation, it is emphasized that these equations are true in the strict sense only if the approximations in (1.9)-(1.11) and Remark 3.1 are met with equality. However simulation results are also used in Section VI to test the validity of these approximations. Substituting (8) and (11) into (7), the k-th OFDM demodulation output can be expressed as:
(69)
(70) We shall split Y.sub.k as Y.sub.k=S.sub.k+I.sub.k+Z.sub.k where S.sub.k, referred to as the signal component, involves the terms in (1.12) containing x.sub.k and not containing the channel noise, I.sub.k, referred to as the interference component, involves the terms containing E.sup.(r), {x.sub.\{k}} and not containing the channel noise, and Z.sub.k, referred to as the noise component, containing the remaining terms. These signal, interference and noise components are analyzed in the following subsections.
(71) A. Signal Component Analysis
(72) From (1.12), the signal component for k∈\
can be expressed as:
S.sub.k=M.sub.rxβ.sub.0,k√{square root over (E.sup.(r))}x.sub.k[|Ω[{dot over (k)}]|.sup.2], (1.13)
where we define β.sub.k.sub.t.sup.†
(k.sub.1).sup.†
(k.sub.2)t/M.sub.rx. Since
⊂
, note that
|Ω[{dot over (k)}]|.sup.2<1 from Lemma 3.1, i.e., the phase-noise causes some loss in power of the signal component. However this loss is much smaller than in PACE (V. V. Ratnam and A. F. Molisch, “Periodic analog channel estimation aided beamforming for massive MIMO systems,” IEEE Transactions on Wireless Communications, 2019, accepted) or digital CE based beamforming, where only |Ω[0]| contributes to the signal component unless additional phase-noise compensation is used. As is evident from (1.13), CACE based beamforming utilizes the (filtered) received signal vector corresponding to the reference tone as weights to combine the received signal vector corresponding to the data sub-carriers, i.e., it emulates imperfect maximal ratio combining (MRC). The imperfection is because the reference tone and the k-th data stream pass through slightly different channels owing to the difference in their modulating frequencies. However the resulting loss in beamforming gain is expected to be small for sparse channels, i.e., for L«M.sub.tx, M.sub.rx, as shall be shown in Sections IV and VI. The second moment of the signal component, averaged over the phase-noise and data symbols, can be computed as:
{|S.sub.k|.sup.2}=M.sub.rx.sup.2|β.sub.0,k|.sup.2E.sup.(r)E.sup.(d)
{[
|Ω[{dot over (k)}]|.sup.2].sup.2}≥M.sub.rx.sup.2|β.sub.0,k|.sup.2E.sup.(r)E.sup.(d)μ(0,ĝ).sup.2 (1.14)
where we define μ(a,ĝ)Δ.sub.a+{dot over (k)},a+{dot over (k)}, and (114) follows from Jensen's inequality and (1.9b).
(73) B. Interference Component Analysis
(74) From (1.12), the interference component for k∈\
can be expressed as:
I.sub.k=M.sub.rxβ.sub.0,
(75) As is clear from above, the demodulation output Y.sub.k for k∈\
suffers inter-carrier interference (ICI) from other sub-carrier data streams due to the RX phase-noise. The first and second moments of I.sub.k, averaged over the other sub-carrier data {
\[
∪{k}]} and the phase-noise, can be expressed as:
(76)
where ,
are obtained using the fact that {x.sub.k|k∈
} have a zero-mean and are independently distributed;
is obtained by defining β.sub.max
max
|β.sub.k,k|, observing |β.sub.0,k|≤β.sub.max, and using
\[
∪{k}].Math.
\{k} in first term and using the Cauchy-Schwarz inequality for the second term;
follows by changing the summation order in the first term and by using (11) for the second term;
follows by using Ω[k]=Ω[k+K] and (11) for the first term and
follows by using (12) and the Jensen's inequality. As shall be shown in Section VI, (21) may be a loose bound on ICI for lower subcarriers, i.e., |k|«K.
(77) Remark 3.1 A tighter approximation for {|I.sub.k|.sup.2} can be obtained by replacing μ(k,ĝ) in (21) with {tilde over (μ)}(k,ĝ)
Δ.sub.{dot over (k)},{dot over (k)}Δ.sub.{dot over (k)}+k,{dot over (k)}+k.
(78) This heuristic is obtained by assuming Ω[{dot over (k)}] and Ω[{umlaut over (k)}+k] to be independently distributed for {dot over (k)}, {umlaut over (k)}∈ and k∈
\
in step
of (21), but we skip the proof for brevity. As shall be verified in Section VI, Remark 3.1 offers a much better ICI approximation ∀k and hence we shall use {tilde over (μ)}(k,ĝ) instead of μ(k,ĝ) in the forthcoming derivations in Section VI.
(79) C. Noise Component Analysis
(80) From (16), the noise component of Y.sub.k for k∈\
can be expressed as:
Z.sub.k=Z.sub.k.sup.(1)+Z.sub.k.sup.(2)+Z.sub.k.sup.(3), where: (1.17)
Z.sub.k.sup.(1)=√{square root over (T.sub.s)}W[{dot over (k)}].sup.†(
(0)t√{square root over (E.sup.(r))}Ω[k+{dot over (k)}]+
(f.sub.
Z.sub.k.sup.(2)=√{square root over (T.sub.s)}t.sup.†
(0).sup.†W[k+{dot over (k)}]√{square root over (E.sup.(r))}Ω*[{dot over (k)}]
Z.sub.k.sup.(3)=T.sub.sW.sup.†[{dot over (k)}]w[k+{dot over (k)}]
(81) Note that the noise consists of both signal-noise and noise-noise cross product terms. From Lemma 3.2, it can readily be verified that {Z.sub.k}=0 and
{Z.sub.k.sup.(i)[Z.sub.k.sup.(j)]*}=0 for i≠j, where the expectation is taken over the noise realizations. Thus the second moment of Z.sub.k, averaged over the TX data, phase-noise and channel noise, can be expressed as
{|Z.sub.k|.sup.2}=
{|Z.sub.k.sup.(1)|.sup.2}+
{|Z.sub.k.sup.(2)|.sup.2}+
{|Z.sub.k.sup.(3)|.sup.2}, where:
{|Z.sub.k.sup.(1)|.sup.2}
N.sub.0
|
(0)t√{square root over (E.sup.(r))}Ω[{dot over (k)}+k]+
(
M.sub.rxN.sub.0[β.sub.0,0E.sup.(r)Δ.sub.{dot over (k)}+k,{dot over (k)}+k+
β.sub.
{|Z.sub.k.sup.(2)|.sup.2}=.sup.(3)
N.sub.0|
(0)t|.sup.2E.sup.(r)
{|Ω[{dot over (k)}]|.sup.2}=.sup.(4)
M.sub.rxβ.sub.0,0N.sub.0E.sup.(r)Δ.sub.k,k (1.18b)
{|Z.sub.k.sup.(3)|.sup.2}=
T.sub.s.sup.2
{W[{dot over (k)}].sup.†W[k+{dot over (k)}]W[k+{umlaut over (k)}].sup.†W[{umlaut over (k)}]}=.sup.(5)M.sub.rx|
|N.sub.0.sup.2 (1.18c)
where ||=2ĝ+1,
,
follow from Lemma 3.2;
,
follow from (12), and
follows from Lemma 3.2, (1.9b) and the result on the expectation of the product of four Gaussian random variables 9W. Bar and F. Dittrich, “Useful formula for moment computation of normal random variables with nonzero means,” IEEE Transactions on Automatic Control, vol. 16, pp. 263-265, June 1971). From (1.18), we can then upper-bound the noise power as:
{|Z.sub.k|.sup.2}≤M.sub.rxβ.sub.maxN.sub.0[E.sup.(r)+|
|E.sup.(d)]+M.sub.rx|
|N.sub.0.sup.2(1.19)
where we use the fact that |β.sub.k,k|≤β.sub.max, [Δ.sub.k+k,{dot over (k)}+k+Δ.sub.k,{dot over (k)}]≤1 for k∈
\
(as ĝ≤g/2) and
Δ.sub.k+{dot over (k)}−
(82) IV. Performance Analysis
(83) From (1.12)-(1.17), the effective single-input-single-output (SISO) channel between the k-th sub-carrier input and corresponding output can be expressed as:
Y.sub.k=M.sub.rxβ.sub.0,k√{square root over (E.sup.(r))}[|Ω[{dot over (k)}]|.sup.2]x.sub.k+I.sub.k+Z.sub.k, for k∈
\
(1.20)
where I.sub.k and Z.sub.k are analyzed in Sections III-B and III-C, respectively. As is evident from (1.20), the signal component suffers from two kinds of fading: (i) a frequency-selective and channel dependent slow fading component represented by β.sub.0,k and (ii) a frequency-flat and phase-noise dependent fast fading component, represented by |Ω[{dot over (k)}]|.sup.2. The estimation of these fading coefficients is discussed later in this section. In this paper, we consider the simple demodulation approach where x.sub.k is estimated only from Y.sub.k, and the I.sub.k,Z.sub.k are treated as noise. For this demodulation approach, a lower bound to the signal-to-interference-plus-noise ratio (SINR) can be obtained from (1.14), (1.16b), Remark 3.1 and (1.19), as:
(84)
(85) where β{β.sub.0,k|
} and we use the fact that
{|I.sub.k+Z.sub.k|.sup.2}=
{|I.sub.k|.sup.2}+
{|Z.sub.k|.sup.2}.
(86) Remark 4.1 If the RX array response vectors or the MPCs are mutually orthogonal i.e. a.sub.rx(.sub.1).sup.†a.sub.rx(
.sub.2)=M.sub.rx
then β.sub.{dot over (k)},{umlaut over (k)}=
|
|.sup.2|a.sub.tx(
).sup.†t|.sup.2
and β.sub.max=
|
|.sup.2.
(87) The orthogonality of array response vectors is approximately satisfied if the MPCs are well separated and M.sub.rx»L (O. El Ayach, R. Heath, S. Abu-Surra, S. Rajagopal, and Z. Pi, “The capacity optimality of beam steering in large millimeter wave MIMO systems,” in IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), pp. 100-104, June 2012). From Remark 4.1, note that even without explicit CE at the RX γ.sub.k.sup.LB(β) scales with M.sub.rx in the low SNR regime, which is a desired characteristic. While the ICI term also scales with M.sub.rx, its contribution can be kept small in the desired SNR range by picking ĝ such that μ(0,ĝ)≈1. In a similar way, with perfect knowledge of the fading coefficients at the RX, an approximate lower bound to the ergodic capacity can be obtained as:
(88)
where is obtained by assuming I.sub.k, Z.sub.k to be Gaussian distributed and using the expression for ergodic capacity (A. Goldsmith and P. Varaiya, “Capacity of fading channels with channel side information,” IEEE Transactions on Information Theory, vol. 43, no. 6, pp. 1986-1992, 1997),
follows by sending the outer expectation into the log(.Math.) functions and
follows from (1.14), (1.16b) and (1.19). While
is an approximation, it typically yields a lower bound since Variance{
|Ω[{dot over (k)}]|.sup.2}≤μ(0,ĝ)[1−μ(0,ĝ)]«μ(0,ĝ).sup.2 (from (1.9a) and (R. Bhatia and C. Davis, “A better bound on the variance,” The American Mathematical Monthly, vol. 107, p. 353, April 2000).
(89) Note that for demodulating x.sub.k's and achieving the above SINR and capacity, the RX requires estimates of N.sub.0 and the SISO channel fading coefficients β and |Ω[{dot over (k)}]|.sup.2. Since the RX has a good beamforming gain (1.21), the channel parameters β, N.sub.0 can be tracked accurately at the RX with a low estimation overhead using pilot symbols and blanked symbols. These values, along with phase-noise parameter σ.sub.θ, can further be fed back to the TX for rate and power allocation. Note that since these pilots are only used to estimate the SISO channel parameters and not the actual MIMO channel, the advantages of simplified CE are still applicable for a CACE based RX. On the other hand, the low variance albeit fast varying component
|Ω[{dot over (k)}]|.sup.2 can be estimated for every symbol using the 0-th sub-carrier output Y.sub.0. It can be shown from (1.12) that Y.sub.0=M.sub.rxβ.sub.0,0E.sup.(r)
|Ω[{dot over (k)}]|.sup.2+I.sub.0+M.sub.rx|
N.sub.0+Z.sub.0, where we have
{|I.sub.0|.sup.2}≤
{|I.sub.k|.sup.2} and
{|Z.sub.0|.sup.2}≤2
{|Z.sub.k|.sup.2} for any k∈
\
. Thus
|Ω[{dot over (k)}]|.sup.2 can be estimated from Y.sub.0 with an
(90)
which is usually a large value.
(91) A. Optimizing System Parameters
(92) From (1.22), note that the approximate ergodic capacity C.sub.approx(β) is a decreasing function of g for g≥2ĝ. Thus a C.sub.approx(β) maximizing choice of g should satisfy g=2ĝ. From (1.22) and (1.21), we can also lower bound C.sub.approx(β) as:
(93) follows from the fact that log(1+γ.sub.k.sup.LB(β))≥log(γ.sub.k.sup.LB(β)) and by taking the summation over k in (1.22) into the denominator of the logarithm; and
follows from the fact that
{tilde over (μ)}(k,ĝ)≤
μ(0,ĝ)Δ.sub.k,k and E.sup.(d)(K−|
|)+E.sup.(r)=E.sub.s. It can be verified that the numerator of Θ(β) is a differentiable, strictly concave function of E.sup.(r), while the denominator is a positive, affine function of E.sup.(r). Thus Θ(β) is a strictly pseudo-concave function of E.sup.(r) (S. Schaible, “Fractional programming,” Zeitschrift für Operations Research, vol. 27, pp. 39-54, dec 1983), and the C.sub.approx(β) maximizing power allocation can be obtained by setting
(94)
as:
(95)
where Q=M.sub.rx|β.sub.max|.sup.2[1−μ(0,ĝ)]μ(0,ĝ)E.sub.s+β.sub.maxN.sub.0(K−||−|
|) and R=N.sub.0|
|[β.sub.max+N.sub.0(K−|
|)/E.sub.s]. As evident from (1.23b), ĝ offers a trade-off between the phase-noise induced ICI and channel noise accumulation. While finding a closed form expression for (1.23b) maximizing ĝ is intractable, it can be computed numerically by performing a simple line search over 1≤ĝ≤min{K.sub.1, K.sub.2}/2, with g=2ĝ and E.sup.(r) as given by (1.24).
(96) V. Initial Access, TX Beamforming and Uplink Beamforming
(97) In this section we briefly discuss stages (i) and (ii) of downlink transmission (see Section 2), and uplink TX beamforming for CACE aided UEs. In the suggested IA protocol for stage (i), the BS performs beam sweeping along different angular directions, possibly with different beam widths, similar to the approach of 3GPP New Radio (NR). For each TX beam, the BS transmits primary (PSS) and secondary synchronization sequences (SSS) with the reference signal, in a form similar to (1.1). The UEs use CACE aided RX beamforming, and initiate uplink random access to the BS upon successfully detecting a PSS/SSS. As shall be shown in Section VI, the SINR expression (1.21) is resilient to frequency mismatches between TX and RX oscillators, and thus is also applicable for the PSS/SSSs where frequency synchronization may not exist. Since angular beam-sweeping is only performed at the BS, the IA latency does not scale with M.sub.rx and yet the PSS/SSS symbols can exploit the RX beamforming gain, thus improving cell discovery radius and/or reducing IA overhead. This is in contrast to digital CE at the UE, which would require sweeping through many RX beam directions for each TX direction, necessitating several repetitions of the PSS/SSS for each TX beam. During downlink stage (ii), note that scheduling of UEs, designing TX beamformer and allocation of power requires knowledge of {|,a.sub.tx(
)} for all the UEs. Such rCSI can be acquired at the BS either by downlink CE with CSI feedback from the UEs or by uplink CE. The protocol for downlink CE with feedback is similar to the IA protocol, with the BS transmitting pilot symbols instead of PSS and SSS. Uplink CE can be performed by transmitting orthogonal pilots from the UEs omni-directionally, and using any of the digital CE algorithms from Section I at the BS. Note that CACE cannot be used at the BS since the pilots from multiple UEs need to be separated via digital processing.
(98) Note that the phase shifts used for RX beamforming at a CACE aided UE in downlink, can also be used for transmit beamforming in the uplink. However since the reference signal is not available at the UE during uplink transmission in time division duplexing systems, a mechanism for locking these phase shift values from a previous downlink transmission stage is required (similar to (V. V. Ratnam and A. F. Molisch, “Periodic analog channel estimation aided beamforming for massive MIMO systems,” IEEE Transactions on Wireless Communications, 2019, accepted to)). In contrast, frequency division duplexing can avoid such a mechanism due to continuous availability of the downlink reference, and consequently ŝ.sub.rx,BB(t).
(99) VI. Simulation Results
(100) For the simulations, we consider a single cell scenario with a λ/2-spaced 32×8 (M.sub.tx=256) antenna BS and one representative UE with a λ/2-spaced 16×4 (M.sub.rx=64) antenna army, having perfect timing synchronization to the BS, one down-conversion chain, and using CACE aided beamforming. The BS has apriori rCSI and transmits one spatial OFDM data stream with T.sub.s=1 μs, K.sub.1=K.sub.2+1=512 and f.sub.c=30 GHz along the strongest MPC, i.e., t=a.sub.tx({|
|}. The UE oscillator has Wiener phase-noise with variance σ.sub.θ.sup.2 known both to the BS and UE. The UE also has perfect knowledge of β, N.sub.0 and
|Ω[{dot over (k)}]|.sup.2.
(101) For testing the validity of the analytical results, we first consider a sample sparse channel matrix H(t) with L=3, ={0,20,40}ns, angles of arrival ψ.sub.azi.sup.rx={0, π/6, −π/6}, ψ.sub.ele.sup.rx={0.45π, π/2, π/2} and effective amplitudes
(102)
The UE uses ĝ=g/2=10, σ.sub.θ.sup.2=1/T.sub.s and E.sup.(r), E.sup.(d) from (1.24). For this model, the symbol error rates (SERs) for the sub-carriers, obtained by Monte-Carlo simulations, are compared to the analytical SERs for a Gaussian channel with SINR given by (1.21) (with/without Remark 3.1) in
(103)
(104)
(P. Sudarshan, N. Mehta, A. Molisch, and J. Zhang, “Channel statistics-based RF pre-processing with antenna selection,” IEEE Transactions on Wireless Communications, vol. 5, pp. 3501-3511, December 2006), which in turn is either (a) known apriori at BS or (b) is estimated by nested array based sampling (P. Pal and P. P. Vaidyanathan, “Nested arrays: A novel approach to array processing with enhanced degrees of freedom,” IEEE Transactions on Signal Processing, vol. 58, pp. 4167-4181, August 2010). To decouple the loss in beamforming gain due to CE errors from loss due to phase-noise, we assume σ.sub.θ≈0. As is evident from
(105) Note that the throughputs in |/K<5% for CACE.
(106) VII. Conclusions
(107) This paper proposes the use of a novel CE technique called CACE for designing the RX beamformer in massive MIMO systems. In CACE, a reference tone is transmitted along with the data signals. At each RX antenna, the received signal is converted to baseband, the reference component is isolated, and is used to control the analog phase-shifter through which the data component is processed. The resulting baseband phase-shifted signals from all the antennas are then added, and fed to the down-conversion chain. This emulates using the received signal for reference as a matched filter for data, and enables both RX beamforming and phase-noise cancellation. The performance analysis suggests that in sparse channels and for ĝ»1, the SINR with CACE scales linearly with M.sub.rx. The analysis and simulations also show that ĝ yields a trade-off between phase-noise induced ICI and noise accumulation. Simulations suggest that CACE suffers only a small degradation in beamforming gain in comparison to digital CE based beamforming in sparse channels, and is resilient to TX-RX oscillator frequency mismatch. In comparison to other ACE schemes, CACE performs marginally worse than PACE at high SNR but performs much better at lower SNR. It also performs much better than MA-FSR, albeit at a higher RX hardware complexity. Finally, CACE also provides phase-noise suppression unlike most other CE schemes. The CE overhead reduction with CACE is significant, especially when downlink CE with feedback is required. The IA latency reduction with CACE aided beamforming is also discussed. While baseband phase shifters are sufficient for a CACE based RX unlike in conventional analog beamforming, 2M.sub.rx mixers may be required for the baseband conversion at the RX; thus adding to the hardware cost.
APPENDIX 1.A
(108) Proof of Lemma \refLemma_PN_properties. Note that from the definition of Ω[k], we have
(109)
where represents the nDFT Operation. Then using convolution property of the nDFT, we have:
(110)
which proves property (1.9a). Property (1.9b) can be obtained as follows:
(111)
where follows by using the expression for the characteristic function of the Gaussian random variable θ[{dot over (n)}]−θ[{umlaut over (n)}];
follows by defining u={dot over (n)}−{umlaut over (n)} and
follows by changing the inner summation limits which is accurate for σ.sub.θ.sup.2T.sub.s»1 and
follows from the expression for the sum of a geometric series.
APPENDIX 1B
(112) Proof of Lemma \refLemma_N_properties. Note that each component of {tilde over (w)}(t) is independent and identically distributed as a circularly symmetric Gaussian random process. Hence its nDFT coefficients, obtained as
(113)
are also jointly Gaussian and circularly symmetric. For these coefficients at RX antennas a, b we obtain:
(114)
where we use the auto-correlation function of the channel noise at any RX antenna as: R.sub.{tilde over (w)}(t)=N.sub.0 sin(πKt/T.sub.s)exp{−jπ(K.sub.1−K.sub.2)t/T.sub.s}/πt.
APPENDIX 1C
(115) Here we model the RX phase-noise θ(t) as a zero mean Omstein-Ulhenbeck (OU) process (J. L. Doob, “The brownian movement and stochastic equations,” The Annals of Mathematics, vol. 43, p. 351, April 1942), which is representative of the output of a type-1 phase-locked loop with a linear phase detector (A. Viterbi, Principles of coherent communication. McGraw-Hill series in systems science, McGraw-Hill, 1966; D. Petrovic, W. Rave, and G. Fettweis, “Effects of phase noise on OFDM systems with and without PLL: Characterization and compensation,” IEEE Transactions on Communications, vol. 55, pp. 1607-1616, August 2007; A. Mehrotra, “Noise analysis of phase-locked loops,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 49, pp. 1309-1316, September 2002). For such a model, θ(t) satisfies:
(116)
where, w.sub.θ(t) is a standard real white Gaussian process, and η.sub.θ, σ.sub.θ are system parameters. From (6) it can be shown that θ(t) is a stationary Gaussian process (in steady state), with an auto-correlation function given by:
(117)
(D. Petrovic, W. Rave, and G. Fettweis, “Effects of phase noise on OFDM systems with and without PLL: Characterization and compensation,” IEEE Transactions on Communications, vol. 55, pp. 1607-1616, August 2007).
(118) Lemma 10.1 For phase-noise modeled as an OU process we have:
(119)
for arbitrary integers k.sub.1, k.sub.2, where δ.sub.a,b.sup.K=1 if a=b (mod K) or δ.sub.a,b.sup.K=0 otherwise, and
(120)
(121) Proof of Lemma \refLemma_OU_PN_properties. Note that from the definition of Ω[k], we have
(122)
where represents the nDFT Operation. Then using convolution property of the nDFT, we have:
(123)
(124) which proves property (1.9a). Property (1.9b) can be obtained as follows:
(125)
(126) where follows by using the expression for the characteristic function of the Gaussian random variable θ[{dot over (n)}]−θ[{umlaut over (n)}];
follows by defining u={dot over (n)}−{umlaut over (n)} and
follows by using the fact that R.sub.θ[u] has a limited support around u=0 and hence R.sub.θ[u]≈R.sub.θ[u−K]≈0 for u>(K−1)/2. Note that since e.sup.−R.sup.
(127) 2. Periodic Analog Channel Estimation Aided Beamforming for Massive MIMO Systems
(128) I. Introduction
(129) In the present embodiment, a novel ACE scheme, referred to as periodic ACE (PACE) is provided. In this embodiment, the reference is transmitted judiciously, and its amplitude and phase are explicitly estimated to drive an RX phase shifter array. In contrast to CACE, PACE requires one carrier recovery circuit and M.sub.rx phase shifters (see
(130) On the flip side, PACE requires some additional analog hardware components, such as mixers and filters, in comparison to conventional digital CE. Additionally, the accumulation of power from multiple MPCs may cause frequency selective fading in a wide-band scenario, which can degrade performance. Finally, the proposed approach in its current suggested form does not support reception of multiple spatial data streams and can only be used for beamforming at one end of a communication link. This architecture is therefore more suitable for use at the user equipment (UEs). The possible extensions to multiple spatial stream reception shall be explored in future work. While the proposed architecture is also applicable in narrow-band scenarios, in this paper we shall focus on the analysis of a wide-band scenario where the repetition interval of PACE and beamformer update is of the order of aCSI coherence time, i.e. time over which the aCSI stays approximately constant (also called stationarity time in some literature). The contributions of the present embodiment include:
(131) 1. The development of a novel transmission technique, namely PACE, and a corresponding RX architecture that enable RX analog beamforming with low CE overhead.
(132) 2. To enable the RX operation, two novel reference recovery circuits are explored. These circuits are non-linear, making their analysis non-trivial. We provide an approximate analysis of their phase-noise and the resulting performance that is tight in the high SNR regime.
(133) 3. The achievable system throughput with PACE aided beamforming in a wide-band channel is analytically characterized.
(134) 4. Simulations with practically relevant channel models are used to support the analytical results and compare performance to existing schemes.
(135) Notation: scalars are represented by light-case letters; vectors by bold-case letters; and sets by calligraphic letters. Additionally, j=√{square root over (−1)}, a* is the complex conjugate of a complex scalar a, |a| represents the .sub.2-norm of a vector a and A.sup.† is the conjugate transpose of a complex matrix A. Finally,
{ } represents the expectation operator, .Math. represents the Kronecker product,
represents equality in distribution, Re{.Math.}/Im{.Math.} refer to the real/imaginary component, respectively,
(a,B) represents a circularly symmetric complex Gaussian vector with mean a and covariance matrix B, Exp{a} represents an exponential distribution with mean a and Uni{a, b} represents a uniform distribution in range [a, b].
(136) II. PACE General Assumptions and System Model
(137) We consider the downlink of a single-cell MIMO system, wherein one base station (BS) with M.sub.tx antennas transmits to several UEs with M.sub.rx antennas each. Since focus is on the downlink, we shall use abbreviations BS & TX and UE & RX interchangeably. Each UE is assumed to have one up/down-conversion chain, while no assumptions are made regarding the BS architecture.
(138) Here we assume the communication between the BS and UEs to involve three important phases: (i) initial access (IA)—where the BS and UEs find each other, timing/frequency synchronization is attained and spectral resources are allocated; (ii) analog beamformer design—where the BS and UEs obtain the required aCSI to update the analog precoding/combining beams; and (iii) data transmission. The relative time scale of these phases are illustrated in
(139) The BS transmits one spatial data-stream to each scheduled UE, and all such scheduled UEs are served simultaneously via spatial multiplexing. Furthermore, the data to the UEs is assumed to be transmitted via orthogonal precoding beams, such that, there is no inter-user interference. Under these assumptions and given transmit precoding beams and power allocation, we shall restrict the analysis to one representative UE without loss of generality. For convenience, we shall also assume the use of noise-less and perfectly linear antennas, filters, amplifiers and mixers at both the BS and UE. An analysis including the non-linear effects of these components is beyond the scope of this paper. The BS transmits orthogonal frequency division multiplexing (OFDM) symbols with K sub-carriers, indexed as ={−K.sub.1, . . . , K.sub.2−1, K.sub.2} with K.sub.1+K.sub.2+1=K, to this representative UE. The BS transmits two kinds of symbols: reference symbols and data symbols. In a reference symbol, only a reference tone, i.e., a sinusoidal signal with a pre-determined frequency known both to the BS and UE, is transmitted on the 0-th subcarrier, and the remaining sub-carriers are all empty. On the other hand, in a data symbol all the K sub-carriers are used for data transmission. The purpose of the reference symbols is to aid PACE and beamformer design at the RX, as shall be explained later. Since the BS can afford an accurate oscillator, we shall assume that the BS suffers negligible phase noise. The M.sub.tx×1 complex equivalent transmit signal for the 0-th symbol, if it is a reference or data symbol, respectively, can then be expressed as:
(140)
for −T.sub.cp≤t≤T.sub.s, where t is the M.sub.tx×1 unit-norm TX beamforming vector for this UE with |t|=1, x.sub.k.sup.(d) is the data signal at the k-th OFDM sub-carrier, j=√{square root over (−1)}, f.sub.c is the carrier/reference frequency, f.sub.k=k/T.sub.s represents the frequency offset of the k-th sub-carrier, T.sub.cs=T.sub.cp+T.sub.s and T.sub.s, T.sub.cp are the symbol duration and the cyclic prefix duration, respectively. Here we define the complex equivalent signal such that the actual (real) transmit signal is given by s.sub.tx.sup.(.Math.)(t)=Re{{tilde over (s)}.sub.tx(t)}. For the data symbols, we assume the use of Gaussian signaling with E.sub.k.sup.(d)={|x.sub.k|.sup.2}, for each k∈
. The total average transmit OFDM symbol energy (including cyclic prefix) allocated to the UE is defined as E.sub.cs, where E.sub.cs≥E.sup.(r) and E.sub.cs≥
E.sub.k.sup.(d). For convenience we also assume that f.sub.c is a multiple of 1/T.sub.cs, which ensures that the reference tone has the same initial phase in consecutive reference symbols.
The channel to the representative UE is assumed to be sparse with L resolvable MPCs (L«M.sub.tx, M.sub.rx), and the corresponding M.sub.rx×M.sub.tx channel impulse response matrix is given as (M. Akdeniz, Y. Liu, M. Samimi, S. Sun, S. Rangan, T. Rappaport, and E. Erkip, “Millimeter wave channel modeling and cellular capacity evaluation,” IEEE Journal on Selected Areas in Communications, vol. 32, pp. 1164-1179, June 2014):
H(t)=a.sub.rx(
)a.sub.tx(
).sup.†δ(t−
), (2.2)
where is the complex amplitude and
is the delay and a.sub.tx(
), a.sub.rx(
) are the TX and RX array response vectors, respectively, of the
-th MPC. As an illustration, the
-th RX array response vector for a uniform planar array with M.sub.H horizontal and M.sub.V vertical elements (M.sub.rx=M.sub.HM.sub.V) is given by a.sub.rx(
)=ā.sub.rx(ω.sub.azi.sup.rx(
), ψ.sub.ele.sup.rx(
)), where we define:
(141)
ψ.sub.azi.sup.rx(), ψ.sub.ele.sup.rx(
) are azimuth and elevation angles of arrival for the
-th MPC, Δ.sub.H, Δ.sub.V are the horizontal and vertical antenna spacings and A is the wavelength of the carrier signal. Expressions for a.sub.tx(
) can be obtained similarly. Note that in (2.2) we implicitly assume frequency-flat MPC amplitudes {α.sub.0, . . . , α.sub.L−1} and ignore beam squinting effects (S. K. Garakoui, E. A. M. Klumperink, B. Nauta, and F. E. van Vliet, “Phased-army antenna beam squinting related to frequency dependency of delay circuits,” in European Microwave Conference, pp. 1304-1307, October 2011), which are reasonable assumptions for moderate system bandwidths. To prevent inter symbol interference, we also let the cyclic prefix be longer than the maximum channel delay: T.sub.cp>τ.sub.L−1. To model a time varying channel, we treat {
,a.sub.tx(
),a.sub.rx(
)} as aCSI parameters, that remain constant within an aCSI coherence time and may change arbitrarily afterwards. However since the channel is more sensitive to delay variations, the MPC delays {τ.sub.0, . . . , τ.sub.L−1} are modeled as iCSI parameters that only remain constant within a shorter interval called the iCSI coherence time. Note that this time variation of delays is an equivalent representation of the Doppler spread experienced by the RX. Finally, we do not assume any distribution prior or side information on {
,a.sub.tx(
),a.sub.rx(
),
}.
(142) The RX front-end is assumed to have a low noise amplifier followed by a band-pass filter at each antenna element that leaves the desired signal un-distorted but suppresses the out-of-band noise. The M.sub.rx×1 filtered complex equivalent received waveform for the 0-th symbol can then be expressed as:
{tilde over (s)}.sub.rx.sup.(.Math.)(t)=a.sub.rx(
)a.sub.tx(
).sup.†{tilde over (s)}.sub.tx.sup.(.Math.)(t−
)+√{square root over (2)}{tilde over (w)}.sup.(.Math.)(t)e.sup.j2πf.sup.
for 0≤t≤T.sub.s, where (.Math.)=(r)/(d), {tilde over (w)}.sup.(.Math.)(t) is the M.sub.rx×1 complex equivalent, baseband, stationary, additive, vector Gaussian noise process, with individual entries being circularly symmetric, independent and identically distributed (i.i.d.), and having a power spectral density: .sub.w(f)=N.sub.0 for −f.sub.K.sub.
(143) III. Analog Beamformer Design at the Receiver
(144) During each beamformer design phase, the BS transmits D consecutive reference symbols to facilitate PACE at the RX. This process involves two steps: locking a local RX oscillator to the received reference tone and using this locked oscillator to estimate the amplitude and phase-offsets at each antenna. Here locking refers to ensuring that the phase difference between the oscillator and the received reference tone is approximately constant. The first D.sub.1 reference symbols are used for the former step and the remaining D.sub.2=D−D.sub.1 symbols are used for the latter step. Therefore D is independent of M.sub.rx and is mainly determined by the time required for oscillator locking (see Remark 3.1). The first step shall be referred to as recovery of the reference tone and is analyzed in Section 3.1 and while the latter step is discussed in Section 3.2. As shall be shown both steps are significantly impaired by channel noise. Therefore in Section 3.3, we propose an improved architecture for reference tone recovery that provides better noise performance, albeit with a slightly higher hardware complexity. For convenience, we shall assume that the MPC delays do not change within the beamformer design phase, and are represented as {{circumflex over (τ)}.sub.0, . . . , {circumflex over (τ)}.sub.L−1} (see also Remark 3.2). However the delays may be different during the data transmission phase, as shall be considered in Section 4. Without loss of generality, assuming the first reference symbol to be the 0-th OFDM symbol, the complex equivalent RX signal for the D reference symbols at antenna m can be expressed as:
(145)
is the amplitude of the reference tone at antenna m.
(146) III-A Recovery of the Reference Tone—Using One PLL
(147) For locking a local RX oscillator to the reference signal, we first consider the use of a type 2 analog PLL at RX antenna 1, as illustrated in
(148) Here LF is assumed to be a first-order active low-pass filter with a transfer function (s)=1+∈/s and the loop gain G is assumed to adapt to the amplitude of the input such that G|A.sub.1.sup.(r)|=constant. For convenience, we also ignore the VCO's internal noise (A. Mehrotra, “Noise analysis of phase-locked loops,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 49, pp. 1309-1316, September 2002; D. Petrovic, W. Rave, and G. Fettweis, “Effects of phase noise on OFDM systems with and without PLL: Characterization and compensation,” IEEE Transactions on Communications, vol. 55, pp. 1607-1616, August 2007). Without loss of generality, let the output of the VCO (i.e. the recovered reference tone) be expressed as:
s.sub.PLL(t)=s.sub.vco(t)=√{square root over (2)} cos [2πf.sub.ct+
where θ(t) may be arbitrary and we define
(149)
where f.sub.vco is the free running frequency of the VCO with no input, we use (2.5) and assume f.sub.c is much larger than the bandwidth of LF. In this subsection, we are interested in finding the time required for locking (D.sub.1 T.sub.cs), i.e., for θ(t) to (nearly) converge to a constant and characterizing the distribution of the PLL output s.sub.PLL(t), or equivalently θ(t), during the last D.sub.2 reference symbols when the PLL is locked to the reference tone. The first part is answered by the following remark:
(150) Remark 3.1 For the PLL considered, the phase lock acquisition time is
(151)
in the no noise scenario (S. C. Gupta, “Phase-locked loops,” Proceedings of the IEEE, vol. 63, pp. 291-306, February 1975; A. Viterbi, Principles of coherent communication. McGraw-Hill series in systems science, McGraw-Hill, 1966). Thus ∈ and |A.sub.1.sup.(r)|G must be of the orders of 1/T.sub.s and 2π|f.sub.c−f.sub.vco| respectively, to keep Dt small.
(152) Numerous techniques (D. Messerschmitt, “Frequency detectors for PLL acquisition in timing and carrier recovery,” IEEE Transactions on Communications, vol. 27, pp. 1288-1295, September 1979; Y. Venkataramayya and B. S. Sonde, “Acquisition time improvement of PLLs using some aiding functions,” Indian Institute of Science Journal, vol. 63, pp. 73-88, March 1981) have been proposed to further reduce the lock acquisition time, which are not explored here for brevity. In the locked state, it can be shown that θ(t) suffers from random fluctuations due to the input noise {tilde over (w)}.sub.1.sup.(r)(t) in (2.7), and that θ(t) (modulo 2π) is approximately a zero mean random process (S. C. Gupta, “Phase-locked loops,” Proceedings of the IEEE, vol. 63, pp. 291-306, February 1975; A. Viterbi, Principles of coherent communication. McGraw-Hill series in systems science, McGraw-Hill, 1966). This fluctuation manifests as phase noise of s.sub.PLL(t). While several attempts have been made to characterize the locked state θ(t) (see (S. C. Gupta, “Phase-locked loops,” Proceedings of the IEEE, vol. 63, pp. 291-306, February 1975; A. Viterbi, Principles of coherent communication. McGraw-Hill series in systems science, McGraw-Hill, 1966.] and references therein), closed form results are available only for a few simple scenarios that are not applicable here. Therefore, for analytical tractability, we linearize (2.7) using the following widely used approximations (A. Viterbi, Principles of coherent communication. McGraw-Hill series in systems science, McGraw-Hill, 1966):
(153) 1. We neglect cycle slips and assume that the deviations of θ(t) about its mean value are small, such that e.sup.−jθ(t)≈1−jθ(t) in the locked state.
(154) 2. We assume that the distribution of the baseband noise process {tilde over (w)}.sub.1.sup.(r)(t) is invariant to multiplication with e.sup.−j[(t)e.sup.−j[
.sub.w(f).
(155) Approximation 1 is accurate in the locked state and in the large SNR regime, while Approximation 2 is accurate when the noise bandwidth is much larger than the loop filter bandwidth (A. Viterbi, Principles of coherent communication. McGraw-Hill series in systems science, McGraw-Hill, 1966; A. J. Viterbi, “Phase-locked loop dynamics in the presence of noise by Fokker-Planck techniques,” Proceedings of the IEEE, vol. 51, pp. 1737-1753, December 1963]. Using these approximations and the definition of
(156)
where we replace θ(t) by θ.sub.L(t) to denote use of the linear approximation. Note that for sufficient SNR, θ(t)θ.sub.L(t) (modulo 2π) during the last D.sub.2 reference symbols. Assuming θ.sub.L(0)=0 and the PLL input to be 0 for t≤0 and taking the Laplace transform on both sides of (2.8), we obtain:
(157)
where Θ.sub.L(s) and Ŵ.sub.1.sup.(r)(s) are the Laplace transforms of θ.sub.L(t) and ŵ.sub.1.sup.(r)(t), respectively. It can be verified using the final value theorem that the contribution of the last term on the right hand side of (2.9) vanishes for t»0 (i.e., in locked state). Therefore ignoring this term in (2.9), we observe that θ.sub.L(t) is a zero mean, stationary Gaussian process (A. Mehrotra, “Noise analysis of phase-locked loops,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 49, pp. 1309-1316, September 2002), in the locked state. Furthermore, the locked state power spectral density, auto-correlation function and variance of θ.sub.L(t) can then be computed, respectively, as:
(158)
where 2a=G|A.sub.1.sup.(r)|+√{square root over (G.sup.2|A.sub.1.sup.(r)|.sup.2−4G|A.sub.1.sup.(r)|∈)}, 2b=G|A.sub.1.sup.(r)|−√{square root over (G.sup.2|A.sub.1.sup.(r)|.sup.2−4G|A.sub.1.sup.(r)|∈)}, (2.12)-(2.13) follow from finding the inverse Fourier transform via partial fraction expansion and the final expressions follow by observing that .sub.w(f)≤N.sub.0 for all f. Since θ.sub.L(t) is stationary and Gaussian in locked state, note that its distribution is completely characterized by (2.10)-(2.11).
(159) III-B Phase and Amplitude Offset Estimation
(160) This subsection analyzes the procedure for reference signal phase and amplitude offset estimation at each RX antenna. As illustrated in
{tilde over (s)}.sub.PLL(t)=√{square root over (2)}e.sup.j[2πf.sup.
At each RX antenna, the received reference signal is multiplied by the in-phase and quadrature-phase components of the PLL signal, and the resulting outputs are fed to ‘filter, sample and hold’ circuits. This circuit involves a low pass filter with a bandwidth of ≈1/(D.sub.2T.sub.cs), followed by a sample and hold circuit that samples the filtered output at the end of the D reference symbols. For convenience, in this paper we shall approximate this ‘filter, sample and hold’ by an integrate and hold operation as depicted in
(161)
where
(162)
is a scaling factor, T.sub.1D.sub.1T.sub.cs−T.sub.cp, T.sub.2
DT.sub.cs−T.sub.cp,
(f.sub.k)
a.sub.rx(
)a.sub.tx(
).sup.†
is the M.sub.rx×M.sub.tx frequency-domain channel matrix for the k-th subcarrier during beamformer design phase and ŵ.sup.(r)(t)
{tilde over (w)}.sup.(r)(t)e.sup.−j[
.sub.w(f) (see Approximation 2). Note that in locked state (T.sub.1≤t≤T.sub.2), we have θ(t)
θ.sub.L(t) (modulo 2π), as per approximations 1 and 2. Furthermore from (2.11), the auto-correlation function of θ.sub.L(t) decays exponentially with a time constant of O(1/G|A.sub.1.sup.(r)|). Therefore, for G|A.sub.1.sup.(r)|»1/(D.sub.2T.sub.cs), I.sub.PACE experiences enough independent realizations of θ(t). Therefore replacing the integral in (2.14) with an expectation over VCO phase noise, we have:
(163)
where follows from the fact that θ(t)
θ.sub.L(t) (modulo 2π) in locked state,
follows by defining
(164)
and by using the characteristic function for the stationary Gaussian process θ.sub.L(t). Since ŵ.sup.(r)(t) is i.i.d. Gaussian with a power spectral density .sub.w(f), it can be verified that ŵ.sup.(r)˜
[
.sub.M.sub.
.sub.M.sub.
(165)
«K.sub.1, K.sub.2. From (2.15), note that the signal component of the sample and hold output I.sub.PACE is directly proportional to the channel matrix at the reference frequency. The outputs are used as a control signals to the RX phase-shifter array, to generate the RX analog beam to be used during the data transmission phase. From (2.15) and (2.12), note that either D.sub.2 or |A.sub.1.sup.(r)| can be increased, to reduce the impact of noise ŵ.sup.(r) on the analog beam. Since |A.sub.1.sup.(r)| is a non-decreasing function of E.sup.(r) (see (2.5)), this implies that E.sup.(r) should be kept as large as possible while satisfying E.sup.(r)≤E.sub.cs and meeting the spectral mask regulations.
(166) Note that the results in this section are based on several approximations, including the linear phase noise analysis in Section 3.1. To test the accuracy of these results, the numerical values of |∫.sub.T.sub.
(167)
in
(168) TABLE-US-00001 TABLE 1 One PLL and weighted arraying simulation parameters. Parameter Value Parameter Value f.sub.c 30 GHz ∈ 4/T.sub.s f.sub.c − f.sub.vco 5 MHz f.sub.1F 1 GHz.sup. T.sub.s 1 μs f.sub.c − f.sub.1F − f.sub.vco.sup.p 5 MHz T.sub.cp 0.1 μs {1, 5, 15} K.sub.1 512 μ 2π/T.sub.s K.sub.2 511 G.sup.p|A.sub.rss.sup.(r)|.sup.2/μ π|f.sub.c − f.sub.1F − f.sub.vco.sup.p| G|A.sub.1.sup.(r)| π|f.sub.c − f.sub.vco| ∈.sup.p 4/T.sub.s
(169) Remark 3.2 The preceding derivations assumed that the MPC delays are identical for the D reference symbols. However since the PLL continuously tracks the RX signal and phase/amplitude estimation at each antenna is performed simultaneously, these results are valid even if the delays change slowly within the beamformer design phase.
(170) Remark 3.3 The RX phase-shifter array or the down-conversion chain are not utilized during the D reference symbols of the beamformer design phase. Therefore, data reception is also possible during these D reference symbols in parallel, as long as a sufficient guard band between the data sub-carriers and the reference sub-carrier is provided (similar to (2.27)) to reduce impact on the PLL performance.
(171) Note that in a multi-cell scenario, use of the same reference tone in adjacent cells can cause reference tone contamination, i.e., I.sub.PACE may contain components corresponding to the channel from a neighboring BS. This is analogous to pilot contamination in conventional CE approaches (T. Marzetta, “Noncooperative cellular wireless with unlimited numbers of base station antennas,” IEEE Transactions on Wireless Communications, vol. 9, pp. 3590-3600, November 2010), and can be avoided by using different, well-separated reference frequencies in adjacent cells.
(172) III-C. Recovery of the Reference Tone—Using Weighted Carrier Arraying
(173) For reducing the PLL SNR threshold and improving performance, in this subsection we propose a new reference recovery technique called weighted carrier arraying, as illustrated in of antennas, which compensate for the inter-antenna phase shift. The resulting phase compensated signals from the
antennas are weighted, combined and tracked by the primary PLL, which operates at a higher SNR and with a wider loop bandwidth than the secondary PLLs. Note that this architecture can be interpreted as a generalization of the carrier recovery process in (P. Thompson, “Adaptation by direct phase-shift adjustment in narrow-band adaptive antenna systems,” IEEE Transactions on Antennas and Propagation, vol. 24, pp. 756-760, September 1976; C. Golliday and R. Huff, “Phase-locked loop coherent combiners for phased array sensor systems,” IEEE Transactions on Communications, vol. 30, pp. 2329-2340, October 1982; J. H. Schrader, “Receiving system design for the arraying of independently steerable antennas,” IRE Transactions on Space Electronics and Telemetry, vol. SET-8, pp. 148-153, June 1962; J. H. Schrader, “A phase-lock receiver for the arraying of independently directed antennas,” IEEE Transactions on Antennas and Propagation, vol. 12, pp. 155-161, March 1964) that allows weighted combining. We shall next analyze the performance of this arrayed PLL in the locked state. However, an analysis of the transient behavior and lock acquisition time of this design is beyond the scope of this paper.
(174) In
s.sub.vco.sup.p(t)=√{square root over (2)} cos [2π(f.sub.c−f.sub.IF)t+θ(t)]
s.sub.vco,m.sup.s(t)=√{square root over (2)} cos [2πf.sub.1Ft+
respectively, where θ(t), ϕ.sub.m(t) are arbitrary, f.sub.IF is the common free running frequency of the secondary VCOs, and . Now similar to Section 3.1, from (2.5) the differential equation governing the secondary PLL at antenna m∈
can be expressed as:
(175)
where we define ŵ.sub.m.sup.(r)(t){tilde over (w)}.sub.m.sup.(r)(t)e.sup.−j[
(176)
where f.sub.vco.sup.p is the free running frequency of the primary VCO, G.sup.p is the loop gain and LF.sub.p is an active low pass filter with transfer function LF.sub.p(s)=(1+ϵ.sup.p/s). Similar to Section 3.1, to obtain the locked state distribution of θ(t) we shall rely on the linear PLL analysis by using: 1) e.sup.−j[ϕ.sup.{tilde over (w)}.sub.m.sup.(r)(t), which is accurate for a wide noise bandwidth. Using these approximations in (2.16)-(2.17) with zero initial conditions and taking Laplace transforms, we obtain:
(177)
where Ŵ.sub.m.sup.(r)(s), Θ.sub.L(s) and Φ.sub.m.sup.L(s) are the Laplace transforms of ŵ.sub.m.sup.(r)(t), linear approximation θ.sub.L(t) and linear approximation ϕ.sub.m.sup.L(t), respectively. We assume that the loop gains of the PLLs adapt to the amplitudes of the input such that |A.sub.m.sup.(r)|G.sub.m.sup.s=μ∀m∈ and
G.sup.p|A.sub.m.sup.(r)|.sup.2=constant. Then solving the system of equations in (2.18), we obtain:
(178)
It can be verified using the final value theorem that the last term in (2.19) only contributes a constant phase shift for t»0 (in locked state), say
(179)
where [A.sub.rss.sup.(r)].sup.2=|A.sub.m.sup.(r)|.sup.2. Comparing (2.21) to (2.12), note that the PLL phase noise is essentially reduced by the maximal ratio combining gain corresponding to the
antennas. As this variation in θ.sub.L(t) manifests as phase noise of s.sub.PLL(t) in
(180) IV. Data Transmission
(181) During the data transmission phase, OFDM symbols of type (1 b) are transmitted and the corresponding received signals are processed via the phase-shifter array with I.sub.PACE as the control signals. Without loss of generality, again assuming the 0-th OFDM symbol as a representative data symbol, the combined data signal at the RX for 0≤t≤T.sub.s can be expressed as:
(182)
where the 1/√{square root over (2)} is a scaling constant for convenience and we assume that the MPC delays for this representative data symbol are {τ.sub.0, . . . , τ.sub.L−1}. This phase shifted and combined signal R(t) is then converted to baseband by a separate RX oscillator, and any resulting phase noise is assumed to be mitigated via some digital phase noise compensation techniques (D. Petrovic, W. Rave, and G. Fettweis, “Effects of phase noise on OFDM systems with and without PLL: Characterization and compensation,” IEEE Transactions on Communications, vol. 55, pp. 1607-1616, August 2007; P. Robertson and S. Kaiser, “Analysis of the effects of phase-noise in orthogonal frequency division multiplex (OFDM) systems,” in IEEE International Conference on Communications (ICC), vol. 3, pp. 1652-1657 vol. 3, June 1995; S. Wu, P. Liu, and Y. Bar-Ness, “Phase noise estimation and mitigation for OFDM systems,” IEEE Transactions on Wireless Communications, vol. 5, pp. 3616-3625, December 2006; S. Randel, S. Adhikari, and S. L. Jansen, “Analysis of RF-pilot-based phase noise compensation for coherent optical OFDM systems,” IEEE Photonics Technology Letters, vol. 22, pp. 1288-1290, September 2010). Therefore neglecting the down-conversion phase noise, the resulting baseband signal can be expressed as R.sub.BB(t)=R(t)e.sup.−j2πf.sup.) is then given by:
(183)
where (f.sub.k)
a.sub.rx(
)a.sub.tx(
).sup.†
is the M.sub.rx×M.sub.tx frequency domain channel matrix for the k-th data subcarrier and
(184)
with {tilde over (W)}.sup.(d)[k] being independently distributed for each k∈ as {tilde over (W)}.sup.(d)[k]˜
[
.sub.M.sub.
.sub.M.sub.
.sub.PACE.sup.† is similar (with appropriate scaling), but not identical, to the MRC beamformer for the k-th sub-carrier: t.sup.†
(f.sub.k).sup.†. The mismatch is due to the beamforming noise Ŵ.sup.(r) and because the reference symbols and the k-th sub-carrier data stream pass through slightly different channels, owing to the difference in sub-carrier frequencies and the MPC delays (
≠
). Consequently, the beamformer
.sub.PACE only achieves imperfect MRC, leading to some loss in performance and causing the effective channel coefficients
.sub.PACE.sup.†
(f.sub.k)t to vary with the sub-carrier index k, i.e., the system experiences frequency-selective fading. Furthermore, since the MPC delays {τ.sub.0, . . . , τ.sub.L−1} change after every iCSI coherence time, so may these channel coefficients. As depicted in
.sub.PACE.sup.†
(f.sub.k)t|k∈
} at the RX. Since these pilots are used only to estimate the effective single-input-single-output (SISO) channel and not the actual MIMO channel, the corresponding overhead is small and shall be neglected here. Assuming perfect estimates of these channel coefficients, from (2.22) the effective SNR for the k-th sub-carrier, and the instantaneous system spectral efficiency (iSE), respectively, can be expressed as:
(185)
where we neglect the cyclic prefix overhead in (2.24) for convenience. Note that the iSE maximizing data power allocation {E.sub.k.sup.(d)|k∈} can be obtained via water-filling across the sub-carriers. While the exact expressions for (2.23)-(2.24) are involved, their expectations with respect to
.sub.PACE can be bounded, as stated by the following theorem.
(186) Theorem 4.1 If the RX array response vectors for the channel MPs are mutually orthogonal, i.e., a.sub.rx().sup.†a.sub.rx(i)=0 for
≠i, the effective SNR and iSE, averaged over the beamformer noise Ŵ.sup.(r), can be bounded as in (2.25)
(187)
where β({dot over (f)},{umlaut over (f)})=|
|.sup.2|a.sub.tx(
).sup.†t|.sup.2
and ≳ represents a ≥ inequality at a high enough SNR such that the approximations in Section 3 are accurate.
(188) Proof Substituting (2.15) in (2.22), and by treating the received signal component corresponding to {tilde over (W)}.sup.(r), i.e., [{tilde over (W)}.sup.(r)].sup.†(f.sub.k)tx.sub.k, as noise, we can obtain a lower bound to the mean SNR as:
(189)
where follows from the Jensen's inequality and
from the orthogonality of the array response vectors. Similarly, by treating [Ŵ.sup.(r)].sup.†
(f.sub.k)tx.sub.k as Gaussian noise independent of x.sub.k, a lower bound on the mean iSE can be obtained as:
(190)
where we use similar steps to (2.26).
(191) The array response orthogonality condition in Theorem 4.1 is satisfied if the scatterers corresponding to different MPCs are well separated and M.sub.rx»L (O. El Ayach, R. Heath, S. Abu-Surra, S. Rajagopal, and Z. Pi, “The capacity optimality of beam steering in large millimeter wave MIMO systems,” in IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), pp. 100-104, June 2012). Note that even though the RX does not explicitly estimate the array response vectors a.sub.rx() for the MPCs, we still observe an RX beamforming gain of M.sub.rx in (2.25a). The impact of imperfect MRC combining and the resulting frequency-selective fading is quantified by β(f.sub.c,f.sub.k), where note that |β(f.sub.c,f.sub.k)|≤|β(0,0). Another drawback of the fading is that it may cause a drastic drop in performance of the one PLL architecture in Section III-A if |A.sub.1.sup.(r)|—the reference signal strength at the antenna 1—falls in a fading dip, as is evident from (2.12) and (225). Note however that the weighted arraying architecture in Section 3.3 enjoys diversity against such fading by recovering the reference tone from multiple antennas
.
(192) V. Initial Access and aCSI Estimation at the BS
(193) In this section we suggest how aCSI can be acquired at the BS during the TX beamformer design phase and also propose a sample IA protocol that can utilize PACE. Note that power allocation, user-scheduling and design of the TX beamformer t requires knowledge of the TX array response vectors and amplitudes {||,a.sub.tx(
)} for the different UEs. Such aCSI can be acquired at the BS either via uplink CE, or by downlink CE with CSI feedback from the RX. Uplink CE can be performed by transmitting an orthogonal pilot from each UE omni-directionally, and using any of the digital CE algorithms from Section 1 at the BS. Note that PACE cannot be used at the BS since the pilots from multiple UEs need to be separated via digital processing. For downlink CE with feedback, the BS transmits reference signals sequentially along different transmit precoder beams (beam sweeping), with D reference symbols for each beam. The UEs perform PACE for each TX beam, and provide the BS with uplink feedback about the corresponding link strength for data transmission.
(194) The suggested IA protocol is somewhat similar to the downlink CE with feedback, where the BS performs beam sweeping along different angular directions, possibly with different beam widths. For each TX beam, the BS transmits D reference symbols, followed by a sequence of primary (PSS) and secondary synchronization sequences (SSS). The RX performs PACE, and provides uplink feedback to the BS upon successfully detecting a PSS. However due to lack of prior timing synchronization during IA phase, the ‘filter, sample and hold’ circuit in Section 3.2 cannot be used directly for the PACE. One alternative is to allow continuous transmission of the reference tone even during the PSS and SSS with the following suggested symbol structure:
(195)
where defines a guard band around the reference tone, to reduce the impact of the data sub-carriers on the PLL output. The amplitude and phase estimation can then be performed similar to Section 3.2, by multiplying the received signal at each antenna with the PLL output and then filtering with a low pass filter with cut-off frequency 1/(D.sub.2Tc). Due to the continuous availability of the reference tone, the filter outputs can be directly used to control the phase shifter at each antenna without the ‘sample and hold’ operation. Since D=O(1), the IA latency does not scale with M.sub.rx and yet the PSS/SSS symbols can exploit the RX beamforming gain, thus improving cell discovery radius and/or reducing IA overhead.
(196) VI. Simulation Results
(197) For the simulation results, we consider a single cell scenario with a λ/2-spaced 32×8 (M.sub.tx=256) antenna BS and one representative UE with a λ/2-spaced 16×4 (M.sub.rx=64) antenna array, having one down-conversion chain and using PACE aided beamforming. The BS has perfect aCSI and transmits one spatial OFDM data stream to this UE with K=1024 sub-carriers and the beamformer t aligned with the strongest channel MPC. The RX beamformer design phase is assumed to last D=6 symbols with D.sub.2=2, where the BS transmits reference symbols with power E.sup.(r)=20E.sub.cs/K (to satisfy spectral mask regulations). The system parameters for the one PLL and weighted arraying case, respectively, are as given in Table 1. For comparison to existing schemes, we include the performance of RTAT—the continuous ACE based beamforming scheme in (V. V. Ratnam and A. Molisch, “Reference tone aided transmission for massive MIMO: analog beamforming without CSI,” in IEEE International Conference on Communications (ICC), (Kansas City, USA), May 2018), and of statistical RX analog beamforming (P. Sudarshan, N. Mehta, A. Molisch, and J. Zhang, “Channel statistics-based RF pre-processing with antenna selection,” IEEE Transactions on Wireless Communications, vol. 5, pp. 3501-3511, December 2006), where the beamformer is the largest eigen-vector of the RX spatial correlation matrix:
(198)
For both these schemes we ignore impact of phase noise and additionally, for statistical beamforming we consider two cases: (a) perfect knowledge of R.sub.rx(t) at the RX and (b) estimate of R.sub.rx(t) obtained using sparse-ruler sampling (P. Pal and P. P. Vaidyanathan, “Nested arrays: A novel approach to array processing with enhanced degrees of freedom,” IEEE Transactions on Signal Processing, vol. 58, pp. 4167-4181, August 2010)—a reduced complexity digital CE technique. Note that PACE uses 6 reference symbols per beamformer update phase, RTAT avoids reference symbols but requires continuous transmission of the reference and sparse-ruler sampling requires 21 pilot symbols for M.sub.rx=64.
(199) We first consider a sparse multi-path channel having L=3 MPCs with delays ={0,20,40}ns, angles of arrival ψ.sub.azi.sup.rx={0, π/6, −π/6}, ω.sub.ele.sup.rx={0.45π, π/2, π/2} and effective amplitudes
(200)
respectively, during the RX beamformer design phase and =
+{30,25,25} ps for one snapshot of the data transmission phase. For this channel, the mean iSE of PACE aided beamforming, obtained using Monte-Carlo simulations with the non-linear PLL equations (2.7), (2.16), (2.17), is compared to the analytical approximation (2.25b), and the performance other schemes in
.sub.PACE in (2.14) is random, the one sigma interval of iSE is also depicted as a shaded region here. As is evident from the results, the beamforming gain with PACE aided beamforming is only 2 dB lower than that of statistical beamforming, above a certain SNR threshold. Below this threshold, however, PACE experiences an exponential decay in performance due to the oscillator phase noise, as also predicted by Theorem 4.1. As is expected, this SNR threshold is lower for weighted carrier arraying than for one PLL. Furthermore, the derived analytical approximations are also accurate above this SNR threshold. PACE also outperforms RTAT at high SNR due to the judicious transmission of the reference, while the deceptively better performance of RTAT at low SNR is due to neglect of phase-noise. Note that these PACE results are obtained for an oscillator offset of 5 MHz (see Table 1). Better performance can be achieved if the PLL is optimized for more accurate local oscillators.
(201) To study the impact of more realistic channels and number of MPCs, we next model the channel as a rich scattering stochastic channel with L resolvable MPCs, each with 10 unresolved sub-paths. Here the MPCs and sub-paths are generated identically to the clusters and rays, respectively, in the 3GPP TR38.900 Rel 14 channel model (UMi NLoS scenario)(TR38.900, “Study on channel model for frequency spectrum above 6 GHz (release 14),” Tech. Rep. V14.3.1, 3GPP, 2017). The only difference from (TR38.900, “Study on channel model for frequency spectrum above 6 GHz (release 14),” Tech. Rep. V14.3.1, 3GPP, 2017) is that we use an intra-cluster delay spread of ins and an intra-cluster angle spread of π/50 (for all elevation, azimuth, arrival and departure), to ensure that the sub-paths of each MPC are unresolvable. The channel SNR at each RX antenna (including the TX beamforming gain) is fixed at 0 dB, and the channel variation between beamformer design phase and one snapshot of the data transmission phase is modeled by assuming that the RX moves a distance of d=2 cm in a random azimuth direction without changing its orientation. Note that this channel can also be represented by our system model by replacing L in (2.2) with 10L. For this stochastic channel model, the mean iSE for PACE aided beamforming, averaged over channel realizations, is compared to RTAT and statistical beamforming in
(202) Note that for the iSE results in this section, we did not include the CE overhead. While digital approaches like sparse ruler sampling (S. Haghighatshoar and G. Caire, “Massive MIMO channel subspace estimation from low-dimensional projections,” IEEE Transactions on Signal Processing, vol. 65, pp, 303-318, January 2017; P. Pal and P. P. Vaidyanathan, “Nested arrays: A novel approach to array processing with enhanced degrees of freedom,” IEEE Transactions on Signal Processing, vol. 58. pp. 4167-4181, August 2010) require 21 pilots (for M.sub.rx=64), PACE uses only D=6 pilots. The corresponding overhead reduction is significant when downlink CE with feedback is used for aCSI acquisition at the BS, such as in frequency division duplexing systems. For example with exhaustive beamscanning (C. Jeong, J. Park, and H. Yu, “Random access in millimeter-wave beamforming cellular networks: issues and approaches,” IEEE Communications Magazine, vol. 53, pp. 180 . . . 185, January 2015) at the TX and an aCSI coherence time of 10 ms, the BS aCSI acquisition overhead reduces from 40% for sparse ruler techniques to 11% for PACE (see Section 5 for protocol). The overhead reduction is expected to be higher if the additional time required for beam switching and settling (O. S. Sands, “Beam-switch transient effects in the RF path of the ICAPA receive phased array antenna,” tech. rep., NASA Technical Memorandum TM-2003-212588, February 2002; K. Venugopal, A. Alkhateeb, N. G. Prelcic, and R. W. Heath, “Channel estimation for hybrid architecture-based wideband millimeter wave systems,” IEEE Journal on Selected Areas in Communications, vol. 35, pp. 1996-2009, September 2017) are also taken into account. Thus, PACE aided beamforming shows potential in solving the CE overhead issue of hybrid massive MIMO systems, with minimal degradation in performance.
(203) VII. Conclusions
(204) This paper proposes the use of PACE for designing the RX beamformer in massive MIMO systems. This process involves transmission of a reference sinusoidal tone during each beamformer design phase, and estimation of its received amplitude and phase at each RX antenna using analog hardware. A one PLL based carrier recovery circuit is proposed to enable the PACE receiver, and its analysis suggests that the quality of obtained channel estimates decay exponentially with inverse of the SNR at the PLL input. To remedy this and also to obtain diversity against fading, a multiple PLL based weighted carrier arraying architecture is also proposed. The performance analysis suggests that PACE aided beamforming can be interpreted as using the channel estimates on one sub-carrier to perform beamforming on other sub-carriers, with an additional loss factor corresponding to the circuit phase-noise. Simulation results suggest that PACE aided beamforming suffers only a small beamforming loss in comparison to conventional analog beamforming in sparse channels, at sufficiently high SNR. This loss however increases with the number of channel MPCs L, and hence PACE is mostly suitable for sparse channels with few MPCs. The CE overhead reduction with PACE is significant when downlink CE with feedback is required. Benefits of PACE aided beamforming during IA phase are also discussed, although a more detailed analysis will be a subject for future work. Similarly the performance of PACE at very low SNR and with system mismatches/imperfections also requires more attention.
(205) 3. Multi-Antenna FSR Receivers: Low Complexity, Non-Coherent, Massive Antenna Receivers
(206) I. Introduction
(207) In the present embodiment, a novel multi-antenna frequency shift reference (MA-FSR) receiver is provided. The MA-FSR receiver (RX) uses only one down-conversion chain, supports wide-band transmission with non-coherent demodulation, and can perform receive beamforming without requiring phase-shifters, explicit channel estimation, or complicated signal processing—thus alleviating the drawbacks of the above mentioned schemes. Inspired by the frequency shift reference (FSR) schemes for single-input-single-output (SISO) ultra-wideband (UWB) systems, in this scheme the transmitter (TX) transmits a reference signal and several data signals on different frequency sub-carriers via orthogonal frequency division multiplexing (OFDM). At each RX antenna, the received waveform corresponding to the data sub-carriers is then correlated with the received waveform corresponding to the reference signal via a simple squaring operation. The outputs are then summed up and fed to a single down-conversion chain for data demodulation. As shall be shown later, this operation emulates maximal ratio combining (MRC) at the RX with imperfect channel estimates. Since the RX beamforming is enabled without channel estimation, MA-FSR is especially suitable for fast time-varying channels, such as in V2V or V2X networks. Furthermore, due to the non-coherent RX architecture, the phase noise of the transmit signal has negligible influence on the performance. The RX also exploits power from all the channel multi-path components (MPCs) and is therefore resilient to blocking of MPCs. Unlike conventional UWB FSR systems, there is no bandwidth spreading of the data signal involved. Therefore, the noise enhancement due to the non-linear RX architecture is significantly smaller, making it practically viable. On the flip side, the proposed scheme only uses 50% of frequency sub-carriers for data transmission, can only support a single spatial data-stream, cannot suppress interference and can only be used for beamforming in the receive mode of a node. Therefore, MA-FSR is more suitable for scenarios with abundant spectrum and where beamforming at the TX is unnecessary or where beamforming at TX is achieved using conventional channel estimation methods. Examples include device-to-device networks where beamforming at RX provides sufficient link margin or infrastructure based networks where down-link traffic is dominant. The contributions of the present embodiment, include:
(208) 1. Development of an MA-FSR RX architecture for massive MIMO systems, that allows non-coherent transmission, lowers implementation cost and energy consumption at the cost of 50% bandwidth efficiency and that does not require phase-shifters or channel estimation at the RX.
(209) 2. Characterization of the achievable throughput for the proposed MA-FSR system, both analytically and via simulations, for the single-input-multiple-output (SIMO) scenario in a wide-band channel.
(210) 3. Presentation of a class of improved MA-FSR architectures that can further improve performance, albeit, with a higher hardware complexity.
(211) Notation: scalars are represented by light-case letters; vectors by bold-case letters; and sets by calligraphic letters. Additionally, j=√{square root over (−1)},* { } represents the expectation operator, c* is the complex conjugate of a complex scalar c, c.sup.† is the Hermitian transpose of a complex vector c, δ(t) represents the Dirac delta function, δ.sub.a,b represents the Kronecker delta function and Re{.Math.}/Im{.Math.} refer to the real/imaginary component, respectively. Furthermore a* and a.sup.† denote the complex conjugate and the conjugate transpose of a vector a, respectively.
(212) II. General Assumptions and System Model
(213) We consider a SIMO link (which can be part of a larger system) where the TX has a single antenna and the RX has M»1 antennas and one down-conversion chain. Note that this model also covers a MIMO link where the TX transmits a single spatial data stream, since the combination of TX precoding vector and propagation channel creates an effective SIMO link. The TX transmits OFDM symbols with 2K sub-carriers, indexed as (0, . . . , 2K−1). A reference signal is transmitted on the 0-th sub-carrier and K−g data signals are transmitted on the sub-carrier set {K, K+1, . . . , 2K−g−1}. Here g ensures that the transmit signal lies within the system bandwidth, and is usually small, determined by the TX phase noise. The remaining sub-carriers, i.e., {1, . . . , K−1}∪{2K−g, . . . , 2K−1} are unused. While it uses only ≈50% of the sub-carriers for data transmission, this OFDM structure is necessary to prevent inter-stream interference, as shall be shown in section 3. Then, the complex equivalent transmit signal for the 0-th symbol (for −T.sub.p≤t≤T.sub.s) can be expressed as:
(214)
where E.sub.r is the energy allocated to the reference signal, x.sub.k is the data signal for k-th OFDM sub-carrier, f.sub.c is the carrier frequency, f.sub.k=k/T.sub.s represents the frequency offset of k-th sub-carrier from the reference signal, θ(t) represents the phase noise process at the TX and T.sub.s, T.sub.p are the symbol duration and the cyclic prefix duration, respectively. Here we define the complex equivalent signal such that the actual (real) transmit signal is given by Re{s(t)}. We assume further that the data signals on the sub-carriers {x.sub.k|k∈} are mutually independently distributed with zero means. The total average transmit symbol energy is then given by E.sub.s=E.sub.r+
E.sub.d.sup.(k), where E.sub.d.sup.(k)=
{|x.sub.k|.sup.2} is the energy allocated to the k-th sub-carrier.
(215) The channel is assumed to have L«M scatterers with the M×1 channel impulse response vector given as (M. Akdeniz, Y. Liu, M. Samimi, S. Sun, S. Rangan, T. Rappaport, and E. Erkip, “Millimeter wave channel modeling and cellular capacity evaluation,” IEEE Journal on Selected Areas in Communications, vol. 32, pp. 1164-1179, June 2014):
h(t)=δ(t−
), (3.2)
where is the complex gain,
is the delay and a
is the RX array response vector, respectively, of the
-th MPC. As an illustration, the array response vector for a λ/2-spaced uniform linear array is given by: [
].sub.i=
, where λ is the wavelength of the carrier signal and
is the angle of arrival of the
-th MPC. Note that here we implicitly assume the system bandwidth is small enough to ignore beam squinting effects. For ease of analysis, we assume that the array response vectors for the scatterers are mutually orthogonal i.e.
=M
. This assumption is reasonable if the scatterers are well separated and M»L (O. El Ayach, R. Heath, S. Abu-Surra, S. Rajagopal, and Z. Pi, “The capacity optimality of beam steering in large millimeter wave MIMO systems,” in IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), pp. 100-104, June 2012). Later, in section 5 we shall also study the system performance when the above assumption is relaxed. To prevent inter symbol interference, we let the cyclic prefix be longer than maximum channel delay: T.sub.p≥τ.sub.L−1. To model a generic time varying channel, we assume that the MPC parameters remain constant for at least a coherence time interval T.sub.coh, and may/may not change afterwards.
(216) The RX front-end is assumed to have a low noise amplifier followed by a band-pass filter (BPF) at each antenna element, as depicted in
r(t)=s.sub.BB(t−
+n(t)e.sup.j2πf.sup.
where s.sub.BB(t)s(t)e.sup.−j2πf.sup.
.sub.n(f)=2N.sub.0 for 0≤f≤f.sub.2K. The filtered signals at each antenna are then squared and summed up, as depicted in
(217)
where r.sub.m(t)=[r(t)].sub.m is the complex equivalent received signal at the m-th antenna. Note that both r.sub.m(t).sup.2, r.sub.m*(t).sup.2 are high pass signals with a carrier frequency of 2f.sub.c. This summed signal r.sub.sq(t) is then low-pass filtered (with a cut-off frequency of 2K/T.sub.s) to get:
(218)
where we use the orthogonality assumption for the array response vectors. Finally, r.sub.LPF(t) is sampled by an ADC at a sampling rate of 4K/T.sub.s samples/sec and conventional OFDM demodulation follows. Note that since r.sub.LPF(t) is a real signal with maximum frequency 2K/T.sub.s, the ADC sampling rate must be at least 4K/T.sub.s samples/sec to prevent aliasing. However it can be shown that the signal of interest i.e., the product between the reference and data sub-carriers only lies within the frequency range K/T.sub.s≤|f|≤(2K−g−1)/T.sub.s. Thus the same performance can also be obtained by replacing the low-pass filter by a band-pass filter with a pass-band of K/T.sub.s≤|f|≤2K/T.sub.s, and using an ADC sampling rate of 2K/T.sub.s samples/sec.
(219) III. Analysis of the Demodulation Outputs
(220) Inspired by our similar analysis for the UWB FSR RX in (V. V. Ratnam, A. F. Molisch, A. Alasaad, F. Alawwad, and H. Behairy, “Bit and power allocation in QAM capable multi-differential frequency-shifted reference UWB radio,” in IEEE Global Communications Conference (GLOBECOM), pp. 1-7. December 2017), the current section analyzes the OFDM demodulation outputs. The OFDM demodulated output for the k-th subcarrier of the 0-th symbol can be expressed as (−2K≤k≤2K−1):
(221)
(222) We shall express each demodulation output as Y.sub.k=S.sub.k+Z.sub.k where S.sub.k, referred to as the signal component, involves terms in (3.6) not containing the channel noise and Z.sub.k, referred to as the noise component, containing the remaining terms. It can be verified from (3.5) and the expression for s.sub.BB(t) that only the demodulation outputs {Y.sub.k|K≤|k|≤(2K−g)} involve signal components. We shall therefore consider a sub-optimal, albeit simple, demodulation approach where only the outputs {Y.sub.k|k∈} are utilized for demodulating the data, and the noise components are treated as noise.
(223) A. Signal Component Analysis
(224) From (3.5)-(3.6), the signal components of the OFDM demodulated outputs Y.sub.k, for k∈, can be expressed as:
(225)
where follows from the sub-carrier allocation, which ensures that, despite the non-linear RX architecture, only the cross-product between the reference signal and the data on the k-th sub-carrier contribute to S.sub.k, for k≥K. Essentially, the MA-FSR RX utilizes the received vector corresponding to the reference tone as weights to combine the received signal corresponding to the data, thus emulating maximal ratio combining of the contributions from the different antennas with imperfect channel estimates. Since this combining takes place via squaring in the analog domain, the proposed RX enables beamforming without channel estimation or use of phase-shifters. However, as is evident from (3.7), the signals from the L multi-path components do not add up in-phase, at the demodulation outputs. This is due to the fact that the reference signal and the k-th data stream pass through slightly different channels owing to the difference in modulating frequency. This leads to some amount of frequency selective fading, as shall be explained later in Section IV.
(226) B. Noise Component Analysis
(227) From (3.6), the noise component of the OFDM demodulation output Y.sub.k, for k∈, can be expressed as:
(228)
Note that the noise consists of both: noise-noise cross product and data-noise cross product terms. Given the transmit data vector x and channel impulse response h(t), the conditional mean of the noise components can be computed as:{Z.sub.k|x,h}=0,
where we use the fact that the noise process n(t) is stationary, has a zero mean and
(229)
Similarly, the conditional second order statistics of the noise components can be computed as (detailed steps are given in Appendix 8):
(230)
where a,b≥K, β.sub.a,b(h)|
|.sup.2
,
(a,b)
{(k.sub.1,k.sub.2)|k.sub.1, k.sub.2∈
k.sub.1−k.sub.2=a−b, k.sub.2≥b} and
(a,b)
{(k.sub.1, k.sub.2)|k.sub.1,k.sub.2 ∈
, k.sub.1−k.sub.2=a+b−4K, k.sub.2≥b}. Clearly, from (3.9a)-(3.9b) we see that the noise components at the OFDM outputs are mutually correlated and are further dependent on the data vector x. For reducing computational complexity, we consider the sub-optimal approach where each sub-carrier data is decoded independently. Under this assumption, the noise variances, averaged over the transmit data vector x reduce to:
.sub.k,k(h)=M[(2K−k)N.sub.0.sup.2
+N.sub.0⊕.sub.0,0(E.sub.r+Σ.sub.k.sub..sub.k,k(h)=0, (3.10b)
where k∈ and we use the fact that the data streams have a zero mean and are mutually independent (see Section II). We shall henceforth approximate the noise component at each OFDM output {Z.sub.k|k∈
} to be jointly Gaussian distributed. While this allows finding a lower bound to the system capacity, the accuracy of this assumption is also justified via simulations in Section V.
(231) IV. Performance Analysis
(232) Using (3.7) and (3.10), the effective SISO channel between the transmit data and the k-th demodulation output (k∈) can be expressed as:
Y.sub.k=M√{square root over (E.sub.rE.sub.d.sup.(k))}β.sub.k,0(h)
where x.sub.k/√{square root over (E.sub.d.sup.(k))} and Z.sub.k˜
(0,
.sub.k,k(h)). We assume that at regular intervals the TX transmits pilot symbols using which the RX can estimate the “fading coefficients” {β.sub.k,0|k∈
}. Similarly, using blanked pilots i.e., symbols where no signal is transmitted, the RX can also estimate N.sub.0. Note that since β.sub.k,0, N.sub.0 and β.sub.0,0 are average channel parameters, they change slowly and can be tracked accurately and with low overhead. Henceforth, we shall assume the RX has perfect knowledge of these channel parameters for each channel realization h(t). These values are further assumed to be fed back to the TX, via a feedback channel, for bit and power allocation. Note that since these pilots are used only to estimate the average channel parameters and not the actual SIMO channel, the advantages of simplified channel estimation are still applicable for MA-FSR RX. From the Gaussian assumption for {Z.sub.k|k∈
} and from (3.10), note that (3.11) represents a parallel Gaussian channel across the sub-carriers. The effective SNR for the k-th demodulation output (k∈
) is then given by:
(233)
(234) Note that even though the RX does not explicitly perform channel estimation, we still observe a beamforming gain of M in γ.sub.k(h(t)). However since the different MPCs do not add up in phase at the RX and the noise power varies with k, the system suffers from frequency selective fading, which causes some loss in performance. Similarly, we define the instantaneous sum rate (iSR) as:
(235)
where we neglect the cyclic prefix overhead for convenience.
(236) A. Power Allocation
(237) Since both the signal and noise variances in (3.11) are affected by the transmit powers in a non-linear way, finding the iSR maximizing power allocation to the data and reference tone is difficult. We shall therefore rely on the following sub-optimal solution.
(238) Lemma 1 For any feasible power allocation {E.sub.r, E.sub.d.sup.(k)|k∈}, we have: γ.sub.k(h(t))≤2{tilde over (γ)}.sub.k(h(t)) for all k∈
, where {tilde over (γ)}.sub.k(h(t)) is the effective SNR with:
(239)
(240) Proof Case 1: Let E.sub.r≥E.sub.s/2. Then for any power allocation {E.sub.r, E.sub.d.sup.(k)|k∈} and an k∈
we have:
(241)
where follows from the AM-GM inequality, and
follows by noting that Σ.sub.k.sub.
(242) Case 2: If on the other hand E.sub.r<E.sub.s/2, then from (3.12), we can write for any k∈:
(243)
where follows from the fact that {tilde over (E)}.sub.r>E.sub.r and 2{tilde over (E)}.sub.d.sup.(k)>E.sub.d.sup.(k)>{tilde over (E)}.sub.d.sup.(k) (see (3.14)). Therefore the theorem follows.
(244) As a consequence of Lemma 1, using E.sub.r=E.sub.s/2 can at-worst cause a 3 dB loss in the SNR of the data streams. Note that the SNR expression in (3.12) can be approximated as:
(245)
which is obtained by using by replacing E.sub.d.sup.(k) by (E.sub.s−E.sub.r)/(K−g). Now using {circumflex over (γ)}.sub.k(h(t)) instead of γ.sub.k(h(t)) in W. Bar and F. Dittrich, “Useful formula for moment computation of normal random variables with nonzero means,” IEEE Transactions on Automatic Control, vol. 16, pp. 263-265, June 1971. (3.13) with E.sub.r=E.sub.s/2 and Σ.sub.k E.sub.d.sup.(k)=E.sub.s/2, a sub-optimal iSR maximizing power allocation for {E.sub.d.sup.(k)|k∈} can be obtained by the water-filling algorithm. In fact, it can be shown that this allocation is optimal, as
(246)
(247) IV. Simulation Results
(248) For simulations we consider a SIMO system, where the RX has a half-wavelength spaced uniform linear array (M=64) with one down-conversion chain and is equipped with a MA-FSR RX. The TX transmits OFDM symbols with T.sub.s=2 μs, T.sub.cp=0.2 μs, g=5 and f.sub.c=30 GHz. The phase noise at the TX is modeled as a Wiener process with {|θ(t+T.sub.s)−θ(t)|.sup.2}=π.sup.2. We consider a sample channel impulse response h(t) with: L=3,
=50|
−1|ns,
=(
−1)π/10,
={−
exp
/σ.sub.ϕ}, σ.sub.ϕ=π/10 and [
].sub.i=
. We also assume perfect timing synchronization, and perfect knowledge of {β.sub.k,0|k∈
} at the RX. For this h(t), the symbol error rate (SER) for (3.6), obtained by Monte-Carlo simulations, is compared to the analytical SER for the effective channel (3.11) in
(249) We next compare the analytical iSR of MA-FSR (3.13) to the iSR of a coherent RX with analog beamforming that only occupies half the bandwidth, i.e., |f|≤K/T.sub.s, in
(250) The results show that for β.sub.0,0E.sub.s/N.sub.0≥10 dB, MA-FSR suffers from an SNR loss of ≤9 dB in comparison to analog beamforming. However at lower values, the SNR loss increases significantly, as is also evident from (3.13). Note that β.sub.0,0E.sub.s/N.sub.0=10 dB corresponds to a per sub-carrier SNR of around −10 dB without the RX beamforming gain, and thus, indeed represents a scenario where the RX beamforming gain is essential. Furthermore, we observe that the performance of equal data power allocation is comparable to water-filling. However these results depend on L. Larger values of L intensify the frequency selective fading of MA-FSR, thereby possibly increasing the SNR loss in
(251) VI. Improved MA-FSR Designs
(252) Note that the MA-FSR RX performance degrades significantly below a certain threshold SNR. This is mainly due to the noise enhancement resulting from the squaring operation, which leads to the large noise-noise cross term in (3.8). Since the transmit signal is mainly restricted to frequencies
(253)
(ignoring phase noise), the impact of this noise enhancement can be significantly reduced by suppressing the noise at lower frequencies by a factor of √{square root over (ϵ)} using a filter, as illustrated in
(254)
where E.sub.sum.sup.(k)=E.sub.r+E.sub.d.sup.(k)+Σ.sub.k.sub.
(255) VII. Conclusion
(256) In this work a novel non-coherent massive antenna RX is proposed, that only requires a single down-conversion chain, can support high data-rates and can perform RX beamforming without phase shifters or channel estimation. The MA-FSR RX essentially uses the received signal for a reference tone to combine the received signal corresponding to the data, via a squaring operation at each antenna. The carefully designed sub-carrier allocation prevents inter-carrier interference. The analysis suggests that the effective channel between the sub-carrier inputs and the demodulated outputs behaves like a parallel Gaussian channel with frequency selective fading, where the frequency selectivity arises due to modulating frequency mismatch between the reference and data sub-carriers and due to the varying noise levels. These varying noise levels arise due to the noise enhancement experienced by the squaring operation at the RX. The simulation results show that MA-FSR suffers only ≈6 dB SNR loss in comparison to analog beamforming in sparse channels, as long as the mean received power is above a certain threshold. This threshold behavior is due to the noise enhancement due to the squaring operation, and several improved FSR designs that can reduce its impact are also proposed,
APPENDIX 3.A
(257) From (3.8), the conditional cross-covariance between the noise components at the a-th and b-th sub-carriers can further be computed as:
(258)
where follows from the fact that n(t) is zero-mean Gaussian and therefore the odd moments of n(t) are zero;
follows by using the identity Re{A}Re{B}=½Re{AB*+AB} for any scalars A, B, and by ignoring the terms involving pseudo-covariance of the circularly symmetric Gaussian noise and
follows by defining
(259)
for any 1≤i≤M, using the results on expectation of a product of four Gaussian random variables [15], and from the orthogonality of the array response vectors. Defining a new variable w=v−u and using change of variables, we can approximate .sub.a,b(x, h) as:
(260)
where follows by assuming that the phase noise e.sup.jθ(t) is constant within the support of the noise auto-correlation function R.sub.n[w] and
follows by changing the summation limits since R.sub.n[w] has a very narrow support of around O(1) and by defining β.sub.a,b
|
|.sup.2
. Note that
is accurate as long as the system bandwidth is much larger than the phase noise bandwidth [16]. Now taking a summation over u, we obtain:
(261)
where we define (a, b)
{(k.sub.1,k.sub.2)|k.sub.1, k.sub.2 ∈
, k.sub.1−k.sub.2=a−b} and the remaining terms vanish since |a−b|≤K−1<k.sub.1, k.sub.2≤2K−g−1. Note that the sampled noise auto-correlation function can be expressed in terms of the power spectral density as:
(262)
Thus, substituting R.sub.n[w] we have:
(263)
where follows from the identity:
(264)
and using the fact that S.sub.n(f) is non-zero only in the range 0≤f≤2K/T.sub.s and we define (a, b)
{(k.sub.1, k.sub.2)∈
(a, b)|k.sub.2≥b}. Using a similar sequence of steps the noise pseudo-covariance can be computed as:
.sub.a,b(x,h)=
Mβ.sub.k.sub.
where we define (a,b)
{(k.sub.1, k.sub.2)|k.sub.1,k.sub.2 ∈
, k.sub.1−k.sub.2=a+b−4K, k.sub.2≥b}.
(265) While exemplary embodiments are described above, it is not intended that these embodiments describe all possible forms of the invention. Rather, the words used in the specification are words of description rather than limitation, and it is understood that various changes may be made without departing from the spirit and scope of the invention. Additionally, the features of various implementing embodiments may be combined to form further embodiments of the invention.