This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Is Phase Shift Keying Optimal for Channels with Phase-Quantized Output?

Neil Irwin Bernardo, Jingge Zhu, and Jamie Evans Department of Electrical and Electronics Engineering, University of Melbourne
Email: bernardon@student.unimelb.edu.au,{ jingge.zhu, jse}@unimelb.edu.au
Abstract

This paper establishes the capacity of additive white Gaussian noise (AWGN) channels with phase-quantized output. We show that a rotated 2b2^{b}-phase shift keying scheme is the capacity-achieving input distribution for a complex AWGN channel with bb-bit phase quantization. The result is then used to establish the expression for the channel capacity as a function of average power constraint PP and quantization bits bb. The outage performance of phase-quantized system is also investigated for the case of Rayleigh fading when the channel state information (CSI) is only known at the receiver. Our findings suggest the existence of a threshold in the rate RR, above which the outage exponent of the outage probability changes abruptly. In fact, this threshold effect in the outage exponent causes 2b2^{b}-PSK to have suboptimal outage performance at high SNR.

Index Terms:
Low-resolution ADCs, Phase Quantization, Channel Capacity, Phase Shift Keying, Outage Probability

I Introduction

The use of low-resolution analog-to-digital converters (ADCs) has recently gained significant research interest because it addresses practical problems and scalability issues in 5G core technologies such as massive data processing, high power consumption, and cost [1]. Most studies on low-resolution ADCs have been more focused on investigating the fundamental limits and practical detection strategies in the context of multiple-input multiple-output (MIMO) and millimeter wave (mmWave) systems [2, 3, 4, 5]. However, these studies did not properly address the structure of the capacity-achieving input and only analyzed performance via capacity bounds using simplified analytical models. Low-resolution receiver design requires a shift in signal/code construction since Gaussian signaling is no longer optimal in channels with quantized output [6].

Some research efforts have been invested in analyzing the capacity limits of channels with low-resolution quantization and finding the optimum signaling schemes for such channels. One of the first studies on this topic showed that binary antipodal signaling is optimal for real AWGN channel with 1-bit quantized output [7]. Extension of capacity analysis to other wireless channels with 1-bit in-phase and quadrature (I/Q) output quantization revealed that QPSK is the optimum signaling for coherent/noncoherent Rayleigh channel [8][9], noncoherent Rician channel [6], and zero-mean Gaussian mixture channel [10]. However, identifying the structure of capacity-achieving input analytically for static and fading channels with multi-bit I/Q quantization still remains an open problem [6].

Motivated by the above discussion, we aim to extend the capacity results of 1-bit I/Q quantization to multi-bit quantization. However, we shall investigate multi-bit phase quantization instead of the conventional I/Q quantization. Phase quantization ignores the amplitude component thus eliminating the necessity for automatic gain control [11]. Furthermore, phase quantizers can be easily implemented in practice using analog phase detectors and 1-bit comparators which consume negligible power (in the order of mW) [12]. Information rate of phase-quantized block noncoherent receiver has been studied before in [11] but the proponents of the study did not show the optimality of phase shift keying. Error rate analysis of low-resolution phase-modulated communication has been done for the single-input single-output (SISO) fading channel [13, 12], relay channel [14], and multiuser MIMO channel [15] but only investigated uncoded transmissions. In this work, we provide a rigourous proof that phase shift keying is indeed capacity-achieving for static channels with phase-quantized output. In fact, the analytical tractability of the 1-bit ADC case in [8, 7, 6, 9, 10] comes from the tractability of the more general multi-bit phase quantization. We then extend the analysis to phase-quantized Rayleigh fading channel with channel state information (CSI) known only at the receiver and give some insights about the outage exponent (or diversity order) of its outage probability. In particular, our numerical results reveal a threshold effect in the outage exponent when the required transmission rate RR of an MM-PSK scheme exceeds a certain value. The proofs can be found in the supplement material [16].

II System Model

We consider a discrete-time baseband model shown in Figure 1. The transmitter sends a signal XX which has an average power constraint 𝔼[|X|2]P\mathbb{E}[|X|^{2}]\leq P. gLoSg_{\text{LoS}} is a complex constant representing the gain and direction of the line-of-sight (LoS) component and N𝒞𝒩(0,σ2)N\sim\mathcal{CN}(0,\sigma^{2}) is an additive noise. We can express the received signal prior to quantization as

TransmitterXXN𝒞𝒩(0,σ2)N\sim\mathcal{CN}(0,\sigma^{2}) bb-bit Phase Quantizer ZZ Detector 𝒬ϕ(Z)=Y\mathcal{Q}_{\phi}\left(Z\right)=YX^\hat{X} gLoSg_{\text{LoS}}\in\mathbb{C}
Figure 1: System Model of Phase-Quantized Receiver
Z=gLosX+N.Z=g_{\text{Los}}X+N. (1)

The signal is then fed to a symmetric bb-bit phase quantizer 𝒬ϕ()\mathcal{Q}_{\phi}(\cdot) to produce an integer-valued output Y[0,2b1]Y\in[0,2^{b}-1]. To be more precise, the output of the phase quantizer is Y=yY=y if ZyPH\angle Z\in\mathcal{R}^{\text{PH}}_{y}, where yPH\mathcal{R}^{\text{PH}}_{y} is given by

yPH={ϕ[π,π]|2π2byπϕ<2π2b(y+1)π}.\mathcal{R}^{\text{PH}}_{y}=\left\{\phi\in[-\pi,\pi]\;\Big{|}\;\frac{2\pi}{2^{b}}y-\pi\leq\phi<\frac{2\pi}{2^{b}}(y+1)-\pi\right\}.

Due to the circular structure of the phase quantizer, the addition operation Y+kY+k for some kk\in\mathbb{Z} constitutes a modulo 2b2^{b} addition. In this quantization model, only a coarse phase information of the received signal is retained and the goal of the receiver is to reliably recover the message encoded in XX using the phase quantizer output, YY. It should be noted that the discrete-time channel model we considered implicitly assumes that the phase quantizer is symmetric and that the channel output is sampled at the Nyquist rate. However, such quantization and sampling strategy may not be optimal in some cases as pointed out in [17, 18].

We identify the probability quantities essential to express the mutual information. Suppose we define U=gLoSσXU=\frac{g_{\text{LoS}}}{\sigma}X and Z=ZσZ^{\prime}=\frac{Z}{\sigma}. The conditional PDF pZ|U(z|u)p_{Z^{\prime}|U}(z^{\prime}|u) is given by

pZ|U(z|u)=1πexp(|zu|2).p_{Z^{\prime}|U}(z^{\prime}|u)=\frac{1}{\pi}\exp\left(-|z^{\prime}-u|^{2}\right). (2)

Note that in the phase-quantized receiver, we discard any information on the magnitude. Suppose we represent the random variables in polar form (i.e. use Z=RσejΦZ^{\prime}=\frac{\sqrt{R}}{\sigma}e^{j\Phi} and U=αejΘU=\sqrt{\alpha}e^{j\Theta}). The probability of Z=Φ\angle Z^{\prime}=\Phi given U=αU=\sqrt{\alpha} is transmitted can be written as

pΦ|A(ϕ|α)=RpZ|U(z=rσejϕ|u=α)𝑑r=eα2π+αcosϕeαsin2ϕ[1Q(2αcosϕ)]π,\begin{split}p_{\Phi|A}(\phi|\alpha)=&\int_{R}p_{Z^{\prime}|U}\left(z^{\prime}=\frac{\sqrt{r}}{\sigma}e^{j\phi}\Big{|}u=\sqrt{\alpha}\right)\;dr\\ =&\frac{e^{-\alpha}}{2\pi}+\frac{\sqrt{\alpha}\cos\phi e^{-\alpha\sin^{2}\phi}\left[1-Q\left(\sqrt{2\alpha}\cos\phi\right)\right]}{\sqrt{\pi}},\\ \end{split} (3)

where the last equality is obtained from [19, equation (10)]. Q()Q(\cdot) is the tail probability of the standard normal distribution. The conditional PDF pY|U(y|u)p_{Y|U}(y|u) (or pY|A,Θ(y|α,θ)p_{Y|A,\Theta}(y|\alpha,\theta)), denoted as Wy(b)(u)W_{y}^{(b)}(u) (or Wy(b)(α,θ)W_{y}^{(b)}(\alpha,\theta)), is given by

Wy(b)(α,θ)=\displaystyle W_{y}^{(b)}(\alpha,\theta)\;= yPHθpΦ|A(ϕ|α)𝑑ϕ\displaystyle\int_{\mathcal{R}^{\text{PH}}_{y}-\theta}p_{\Phi|A}(\phi|\alpha)\;d\phi
=\displaystyle= 2π2byπθ2π2b(y+1)πθpΦ|A(ϕ|α)𝑑ϕ.\displaystyle\int_{\frac{2\pi}{2^{b}}y-\pi-\theta}^{\frac{2\pi}{2^{b}}(y+1)-\pi-\theta}\;p_{\Phi|A}(\phi|\alpha)\;d\phi. (4)

Equation (II) has no closed-form expression. However, we can still use it to identify the optimal input distribution and numerically compute the capacity of the phase-quantized system. Now, consider an input distribution FU(u)F_{U}(u) with density function fU(u)f_{U}(u). With slight abuse of notation, we use FUF_{U} and fUf_{U} to denote FU(u)F_{U}(u) and fU(u)f_{U}(u), respectively. For a given FUF_{U}, the probability mass function (PMF) of YY is therefore

p(y;FU)=Wy(b)(u)𝑑FUy.\begin{split}p(y;F_{U})=&\int_{\mathbb{C}}W_{y}^{(b)}(u)\;dF_{U}\;\;\forall y.\end{split} (5)

We use the above notation to emphasize that the PMF of YY is induced by the choice of the distribution FUF_{U}. Given the above probability quantities, we can now express the mutual information between UU and YY as follows:

I(U;Y)=\displaystyle I(U;Y)= I(FU)=H(Y)H(Y|U),\displaystyle I(F_{U})=H\left(Y\right)-H\left(Y|U\right), (6)
where H(Y)=\displaystyle\text{where }\;\;H(Y)= y=02b1Wy(b)(u)logp(y;FU)dFU\displaystyle-\int_{\mathbb{C}}\sum_{y=0}^{2^{b}-1}W_{y}^{(b)}(u)\log p(y;F_{U})\;dF_{U}
H(Y|U)=\displaystyle H(Y|U)= y=02b1Wy(b)(u)logWy(b)(u)dFU.\displaystyle-\int_{\mathbb{C}}\sum_{y=0}^{2^{b}-1}W_{y}^{(b)}(u)\log W_{y}^{(b)}(u)\;dF_{U}.

We use the notation I(FU)I(F_{U}) since the mutual information is a result of choosing a specific input distribution FUF_{U}. All log()\log(\cdot) functions in this paper are in base 2 unless stated otherwise. Let P=|gLoS|2σ2PP^{\prime}=\frac{|g_{\text{LoS}}|^{2}}{\sigma^{2}}P. The capacity for a given power constraint is the supremum of mutual information between UU and YY over the set of all input distributions FUF_{U} satisfying the power constraint 𝔼[|U|2]P\mathbb{E}[|U|^{2}]\leq P^{\prime}. In other words,

C=supFUΩI(FU)=I(FU),C=\sup_{F_{U}\in\Omega}I(F_{U})=I(F_{U}^{*}), (7)

where Ω\Omega is the set of all input distributions which have average power less than or equal to PP^{\prime}. In the next section, we establish the properties of the capacity-achieving input distribution FUF^{*}_{U} when gLoSg_{\text{LoS}} is known at the transmitter.

III Capacity-achieving Input for Phase-Quantized AWGN Channel

The mutual information I(FU)I(F_{U}) is concave with respect to FUF_{U} [20, Theorem 2.7.4] and the power constraint ensures that Ω\Omega is convex and compact with respect to weak* topology111This is the coarsest topology in which all linear functionals of dFUdF_{U} of the form f(u)𝑑FU\int f(u)dF_{U}, where f(u)f(u) is a continuous function, are continuous. [21]. The existence of FUF_{U}^{*} is equivalent to showing that I(FU)I(F_{U}) is continuous over FUF_{U}. The finite cardinality of phase quantizer output trivially ensures this and the proof follows closely to the method in [7, Appendix A] and [6, Lemma 1]. We first show that the optimal input distribution satisfies a certain phase symmetry. Then, we prove that FUF_{U}^{*} should have a single amplitude level. Finally, we identify the structure of the optimal input by establishing its discreteness and locating its mass points.

III-A Optimality of 2π2b\frac{2\pi}{2^{b}}-symmetric input distribution

In this subsection, we show that the optimal input distribution is 2π2b\frac{2\pi}{2^{b}}-symmetric (i.e. Uej2πk2bUU\sim e^{j\frac{2\pi k}{2^{b}}}U for all kk\in\mathbb{Z}). We first prove a key lemma about the properties of Wy(b)(α,θ)W_{y}^{(b)}(\alpha,\theta).

Lemma 1.

The function Wy(b)(α,θ)W_{y}^{(b)}(\alpha,\theta) (or Wy(b)(u)W_{y}^{(b)}(u)) satisfies the following properties:

(i)\displaystyle(i) Wy(b)(α,θ+2πk2b)=\displaystyle\;W_{y}^{(b)}\left(\alpha,\theta+\frac{2\pi k}{2^{b}}\right)= Wyk(b)(α,θ)\displaystyle W_{y-k}^{(b)}\left(\alpha,\theta\right) ,k\displaystyle,\forall k\in\mathbb{Z}
(ii)\displaystyle(ii) W2b1y(b)(α,π2b)=\displaystyle\;\;W_{2^{b-1}-y}^{(b)}\left(\alpha,\frac{\pi}{2^{b}}\right)= W2b1+y(b)(α,π2b)\displaystyle W_{2^{b-1}+y}^{(b)}\left(\alpha,\frac{\pi}{2^{b}}\right)
(iii)\displaystyle(iii) W2b1y(b)(α,0)=\displaystyle\;W_{2^{b-1}-y}^{(b)}\left(\alpha,0\right)= W2b11+y(b)(α,0)\displaystyle W_{2^{b-1}-1+y}^{(b)}\left(\alpha,0\right)
Proof.

See [16, Section A]. ∎

Lemma 1.i states that shifting the input by 2πk2b\frac{2\pi k}{2^{b}} corresponds to a shift in the phase quantizer output by k-k. Meanwhile, Lemma 1.ii and 1.iii identify some symmetry of Wy(b)(α,θ)W_{y}^{(b)}(\alpha,\theta) when θ=0\theta=0 and θ=π2b\theta=\frac{\pi}{2^{b}}. The following proposition shows that the capacity is achieved by a 2π2b\frac{2\pi}{2^{b}}-symmetric distribution. Thus, without loss of generality, we can simply restrict our search of FUF_{U}^{*} in this set of input distributions.

Proposition 1.

For any input distribution FUF_{U}, we define another input distribution as

FUs=12bi=02b1FU(uej2πi2b),F_{U}^{s}=\frac{1}{2^{b}}\sum_{i=0}^{2^{b}-1}F_{U}(ue^{j\frac{2\pi i}{2^{b}}}), (8)

which is a 2π2b\frac{2\pi}{2^{b}}-symmetric distribution. Then, I(FUs)I(FU)I(F_{U}^{s})\geq I(F_{U}). Under this input distribution, H(Y)H(Y) is maximized and is equal to bb.

Proof.

See [16, Section B]. ∎

Because of Proposition 1, we consider FUΩsF_{U}\in\Omega_{s}, where Ωs\Omega_{s} is the set of all 2π2b\frac{2\pi}{2^{b}}-symmetric input distributions satisfying the constraint 𝔼[|U|2]P\mathbb{E}[|U|^{2}]\leq P^{\prime}. The capacity in (7) simplifies to

C=binfFUΩsy=02b1Wy(b)(u)logWy(b)(u)H(Y|U=αejθ)𝑑FU.\begin{split}C=b-\underset{F_{U}\in\Omega_{s}}{\inf}\int_{\mathbb{C}}\underbrace{-\sum_{y=0}^{2^{b}-1}W_{y}^{(b)}(u)\log W_{y}^{(b)}(u)}_{H(Y|U=\sqrt{\alpha}e^{j\theta})}\;dF_{U}.\end{split} (9)

III-B Optimality of input with a single amplitude level

To prove that the optimal input should have a single amplitude level, we first establish two properties of H(Y|U=u)H(Y|U=u).

Lemma 2.

The function H(Y|U=αejθ)H(Y|U=\sqrt{\alpha}e^{j\theta}) is decreasing on α\alpha for all θ[0,2π2b) and b1\theta\in\left[0,\frac{2\pi}{2^{b}}\right)\text{ and }b\geq 1.

Proof.

See [16, Section C]. ∎

Lemma 3.

The function H(Y|U=αejθ)H(Y|U=\sqrt{\alpha}e^{j\theta}) is convex on α\alpha for all θ[0,2π2b) and b1\theta\in\left[0,\frac{2\pi}{2^{b}}\right)\text{ and }b\geq 1.

Proof.

See [16, Section D]. ∎

The capacity in (9) can be written as

C=binfFUΩs𝔼A,Θ[y=02b1Wy(b)(u)logWy(b)(u)]=binfFUΩs𝔼Θ[𝔼A|Θ[y=02b1Wy(b)(u)logWy(b)(u)]],\begin{split}C=&b-\underset{F_{U}\in\Omega_{s}}{\inf}\mathbb{E}_{A,\Theta}\left[-\sum_{y=0}^{2^{b}-1}W_{y}^{(b)}(u)\log W_{y}^{(b)}(u)\right]\\ =&b-\underset{F_{U}\in\Omega_{s}}{\inf}\mathbb{E}_{\Theta}\left[\mathbb{E}_{A|\Theta}\left[-\sum_{y=0}^{2^{b}-1}W_{y}^{(b)}(u)\log W_{y}^{(b)}(u)\right]\right],\end{split}

where we used Bayes’ rule in the second line to express the complex PDF fU(u)=fA,Θ(α,θ)f_{U}(u)=f_{A,\Theta}(\alpha,\theta) as fA|Θ(α|θ)fΘ(θ)f_{A|\Theta}(\alpha|\theta)f_{\Theta}(\theta) and perform the complex expectation as two real-valued expectations over α|θ\alpha|\theta and θ\theta. Due to Lemma 3, Jensen’s inequality can be applied. That is,

𝔼A|Θ[H(Y|U=αejθ)]H(Y|U=𝔼α|Θ[α]ejθ),\displaystyle\mathbb{E}_{A|\Theta}\left[H(Y|U=\sqrt{\alpha}e^{j\theta})\right]\geq H(Y|U=\sqrt{\mathbb{E}_{\alpha|\Theta}[\alpha]}e^{j\theta}),

with equality if α\alpha is a constant. This means that for some 2π2b\frac{2\pi}{2^{b}}-symmetric input distribution, FU(a)F_{U}^{(a)}, with two or more amplitude levels, there exists another 2π2b\frac{2\pi}{2^{b}}-symmetric input distribution, FU(b)F_{U}^{(b)}, with one amplitude level that has lower 𝔼A|Θ[H(Y|U=αejθ)]\mathbb{E}_{A|\Theta}\left[H(Y|U=\sqrt{\alpha}e^{j\theta})\right] than FU(a)F_{U}^{(a)}. Moreover, due to Lemma 2, for any 2π2b\frac{2\pi}{2^{b}}-symmetric input distribution with amplitude αa<P\alpha_{a}<P^{\prime}, we can find another 2π2b\frac{2\pi}{2^{b}}-symmetric input distribution with amplitude αb(αa,P]\alpha_{b}\in(\alpha_{a},P^{\prime}] such that 𝔼A|Θ[H(Y|U=αaejθ)]>𝔼A|Θ[H(Y|U=αbejθ)]\mathbb{E}_{A|\Theta}\left[H(Y|U=\sqrt{\alpha_{a}}e^{j\theta})\right]>\mathbb{E}_{A|\Theta}\left[H(Y|U=\sqrt{\alpha_{b}}e^{j\theta})\right]. Thus, full transmit power must be used. We formalize this result in the following proposition.

Proposition 2.

The optimum input distribution has a single amplitude level α=P\sqrt{\alpha}=\sqrt{P^{\prime}}.

The capacity expression can be simplified further to

C=\displaystyle C= binfFΘΩΘs𝔼Θ[y=02b1Wy(b)(P,θ)logWy(b)(P,θ)],\displaystyle b-\underset{F_{\Theta}\in\Omega_{\Theta}^{s}}{\inf}\mathbb{E}_{\Theta}\left[-\sum_{y=0}^{2^{b}-1}W_{y}^{(b)}(P^{\prime},\theta)\log W_{y}^{(b)}(P^{\prime},\theta)\right],

where ΩΘs\Omega_{\Theta}^{s} is the set of all circular distributions with support [π,+π][-\pi,+\pi] that are 2π2b\frac{2\pi}{2^{b}}-symmetric. That is,

FΘ(θ)FΘ((θ+2πk2b)mod2π),k.F_{\Theta}(\theta)\sim F_{\Theta}\left(\left(\theta+\frac{2\pi k}{2^{b}}\right)\mod 2\pi\right),\quad\forall k\in\mathbb{Z}.

III-C Discreteness of the Optimal Input and Location of its Mass Points

We continue with the derivation of the optimum input distribution by identifying the minimizer of the optimization problem

infFΘΩΘs𝔼Θ[y=02b1Wy(b)(P,θ)logWy(b)(P,θ)].\underset{F_{\Theta}\in\Omega_{\Theta}^{s}}{\inf}\mathbb{E}_{\Theta}\left[-\sum_{y=0}^{2^{b}-1}W_{y}^{(b)}(P^{\prime},\theta)\log W_{y}^{(b)}(P^{\prime},\theta)\right]. (10)

We present two lemmas about the objective function and feasible set of (10).

Lemma 4.

The set ΩΘs\Omega_{\Theta}^{s} is convex and weakly compact.

Proof.

See [16, Section E]. ∎

Lemma 5.

The function

w¯(FΘ)=𝔼Θ[y=02b1Wy(b)(P,θ)logWy(b)(P,θ)]\bar{w}(F_{\Theta})=\mathbb{E}_{\Theta}\left[-\sum_{y=0}^{2^{b}-1}W_{y}^{(b)}(P^{\prime},\theta)\log W_{y}^{(b)}(P^{\prime},\theta)\right] (11)

is convex and weakly differentiable on FΘF_{\Theta}.

Proof.

See [16, Section F]. ∎

The combination of Lemma 4 and Lemma 5 implies that Problem (10) is a convex optimization problem over the probability space ΩΘs\Omega_{\Theta}^{s}. An optimal solution FΘF_{\Theta}^{*} should satisfy the following inequality:

w¯FΘ(FΘ)=w¯(FΘ)w¯(FΘ)0FΘΩΘs,\bar{w}^{\prime}_{F_{\Theta}^{*}}(F_{\Theta})=\bar{w}\left(F_{\Theta}\right)-\bar{w}\left(F_{\Theta}^{*}\right)\geq 0\qquad\forall F_{\Theta}\in\Omega_{\Theta}^{s},

where w¯FΘ0(FΘ)\bar{w}^{\prime}_{F_{\Theta}^{0}}(F_{\Theta}) is the weak derivative222The notions of weak derivative and weakly differentiable functions are introduced in [16, Section F]. of w¯(FΘ)\bar{w}(F_{\Theta}) at a point FΘ0F_{\Theta}^{0}. With some manipulation, the optimality condition can be established as

w¯(FΘ)w¯(FΘ)\displaystyle\bar{w}\left(F_{\Theta}\right)-\bar{w}\left(F_{\Theta}^{*}\right)\geq 0\displaystyle 0
bw¯(FΘ)b+w¯(FΘ)\displaystyle b-\bar{w}\left(F_{\Theta}^{*}\right)-b+\bar{w}\left(F_{\Theta}\right)\geq 0\displaystyle 0
Cb+𝔼Θ[y=02b1Wy(b)(P,θ)logWy(b)(P,θ)]\displaystyle C-b+\mathbb{E}_{\Theta}\left[-\sum_{y=0}^{2^{b}-1}W_{y}^{(b)}(P^{\prime},\theta)\log W_{y}^{(b)}(P^{\prime},\theta)\right]\geq 0,\displaystyle 0,

where the third line follows from the definition of capacity. Finally, by applying the contradiction argument in [21, Theorem 4], we obtain

Cby=02b1Wy(b)(P,θ)logWy(b)(P,θ)\displaystyle C-b-\sum_{y=0}^{2^{b}-1}W_{y}^{(b)}(P^{\prime},\theta)\log W_{y}^{(b)}(P^{\prime},\theta)\geq 0,\displaystyle 0, (12)

with equality if θFΘ\theta\in F_{\Theta}^{*}. We further reduce the search space by proving that the optimal input distribution is discrete with finite number of mass points. The proof closely follows the example application of Dubin’s Theorem [22] presented in [23, Section II-C].

Lemma 6.

The support set of FΘF_{\Theta}^{*} is discrete and contains at most 2b2^{b} points.

Proof.

See [16, Section G]. ∎

Due to Proposition 1, we can limit our search of θ\theta^{*} in [0,2π2b)[0,\frac{2\pi}{2^{b}}) since if θ[0,2π2b)\theta^{*}\in[0,\frac{2\pi}{2^{b}}) is optimal, so are θ+2πk2b\theta^{*}+\frac{2\pi k}{2^{b}} for kk\in\mathbb{Z}. Moreover, the optimal distribution has a single mass point inside [0,2π2b)[0,\frac{2\pi}{2^{b}}) as a consequence of Lemma 6 and Proposition 1. Because the only way to place a nonzero number of mass points in a 2π2b\frac{2\pi}{2^{b}}-symmetric input distribution that is less than or equal to 2b2^{b} is to have exactly one mass point at every θ0+2πk2b\theta_{0}+\frac{2\pi k}{2^{b}} for kk\in\mathbb{Z} and for some θ0[0,2π2b)\theta_{0}\in\left[0,\frac{2\pi}{2^{b}}\right). A 2π2b\frac{2\pi}{2^{b}}-symmetric distribution cannot be achieved by using less than 2b2^{b} mass points. Moreover, these mass points should have equal amplitudes and are equiprobable to satisfy Proposition 1. We now utilize (12) in Proposition 3 to obtain the location of the optimal mass points.

Proposition 3.

The set containing the angles of the optimum mass points uFUu^{*}\in F_{U}^{*} is given by

θ={2π(k+0.5)2b}k=02b1.\theta^{*}=\left\{\frac{2\pi(k+0.5)}{2^{b}}\right\}_{k=0}^{2^{b}-1}. (13)
Proof.

See [16, Section H]. ∎

Simply put, Proposition 3 states that the optimal location of the mass points are at the angle bisector of the convex cones yPH\mathcal{R}_{y}^{\text{PH}}. Now that we have established the characteristics of the FUF_{U}^{*}, we formally state in the following theorem the capacity of the system.

Theorem 1.

The capacity of a complex Gaussian channel with fixed channel gain and bb-bit phase-quantized output is

C=b+y=02b1Wy(b)(P,π2b)logWy(b)(P,π2b),\displaystyle C=b+\sum_{y=0}^{2^{b}-1}W_{y}^{(b)}\left(P^{\prime},\frac{\pi}{2^{b}}\right)\log W_{y}^{(b)}\left(P^{\prime},\frac{\pi}{2^{b}}\right), (14)

and the capacity-achieving input distribution is a rotated 2b2^{b}-PSK with equiprobable symbols given by

fX={δ(x)2b|x=Pej(2π(k+0.5)2bgLoS),k[0,2b1]}.f_{X}^{*}=\left\{\frac{\delta(x)}{2^{b}}\Big{|}x=\sqrt{P}e^{j\left(\frac{2\pi(k+0.5)}{2^{b}}-\angle g_{\text{LoS}}\right)},k\in[0,2^{b}-1]\right\}.
Proof.

The proof follows from calculating (7) using FUF_{U}^{*}. The capacity-achieving input FXF_{X}^{*} follows from combining Propositions 1-3 and using the transformation X=σU/gLoSX=\sigma U/g_{\text{LoS}}. ∎

To demonstrate the optimality of the signaling scheme, Figure 2 compares the rates achieved by using 4,8,16, and \infty-PSK (a circle) with equiprobable mass points on a Gaussian channel with 3-bit phase-quantized output. Each PSK constellation is rotated by a θ\theta^{*} that maximizes the rate. The rate of Gaussian input is also included and is seen to be suboptimal compared to π4\frac{\pi}{4}-symmetric input distributions with a single amplitude. It can be observed that 8-PSK with optimal θ\theta achieves the highest rate among all modulation orders considered.

Refer to caption
Figure 2: Information rates achieved by different modulation schemes when gLoS=100g_{\text{LoS}}=1\angle 0^{0} and b=3b=3. Note that 8-PSK with optimal θ\theta is capacity-achieving.

IV Outage Probability of Rayleigh Channel with Phase-Quantized Output

We have shown that 2b2^{b}-PSK is optimal for an AWGN channel with bb-bit phase-quantized output and hh is known at the transmitter. We now ask if this continues to hold when channel information is unavailable at the transmitter. Ultimately, is 2b2^{b}-PSK still the best choice in fading environment without channel state feedback? We now consider a quasi-static Rayleigh flat fading environment. The fixed channel gain gLoSg_{\text{LoS}} in Figure 1 is replaced by a random fading gain G𝒞𝒩(0,1)G\sim\mathcal{CN}(0,1). We further assume that the fading state gg is known only at the receiver. Without loss of generality, we assume σ2=1\sigma^{2}=1. We define the function

I(𝒳M|G=g)=b𝔼B[H(Y|U=|g|2SNRej(β+g))]=br(|g|2SNR,g,𝒳M)\begin{split}I(\mathcal{X}_{M}|G=g)=&b-\mathbb{E}_{B}\left[H\left(Y|U=\sqrt{|g|^{2}SNR}e^{j(\beta+\angle g)}\right)\right]\\ =&b-r\left(|g|^{2}SNR,\angle g,\mathcal{X}_{M}\right)\end{split}

as the maximum rate of reliable communication supported by a modulation scheme 𝒳M\mathcal{X}_{M} and a fading realization gg at some SNR. Here, the symbols x𝒳Mx\in\mathcal{X}_{M} have the form x=SNRejβx=\sqrt{SNR}e^{j\beta} so that Propositions 1 and 2 are satisfied333We omit the proof that these necessary conditions for optimum 𝒳M\mathcal{X}_{M} hold even when gg is unknown at the transmitter.. If the transmitter encodes the data at a rate RR bits/channel use, then an outage occurs when I(𝒳M|G=g)<RI(\mathcal{X}_{M}|G=g)<R since the error rate cannot be made arbitrarily small whatever coding scheme is used. The function r(γ,g,𝒳M)r\left(\gamma,\angle g,\mathcal{X}_{M}\right) is a convex decreasing function of γ\gamma (Lemmas 2 and 3). Thus, it follows that its inverse function with respect to γ\gamma has one-to-one mapping and is also decreasing. The outage probability is expressed as

Pout(SNR)=\displaystyle P_{\text{out}}(SNR)= 𝔼G[{I(𝒳M|G=g)<R}]\displaystyle\mathbb{E}_{G}\left[\mathbb{P}\left\{I(\mathcal{X}_{M}|G=g)<R\right\}\right]
=\displaystyle= 𝔼G[{r1(bR,g,𝒳M)SNR<|g|2}]\displaystyle\mathbb{E}_{G}\left[\mathbb{P}\left\{\frac{r^{-1}(b-R,\angle g,\mathcal{X}_{M})}{SNR}<|g|^{2}\right\}\right]
=\displaystyle= 1ππexp(r1(bR,g,𝒳M)SNR)2πdg.\displaystyle 1-\int_{-\pi}^{\pi}\;\frac{\exp\left(-\frac{r^{-1}(b-R,\angle g,\mathcal{X}_{M})}{SNR}\right)}{2\pi}\text{d}\angle g. (15)

The third line follows by noting that |g|2|g|^{2} is exponentially-distributed for Rayleigh fading and g\angle g is uniformly-distributed. It is difficult to analytically derive the outage probability so the expression for Pout(SNR)P_{\text{out}}(SNR) is evaluated numerically to provide some more insight. In order to characterize the outage probability, we focus on the outage exponent (or diversity order) which is the asymptotic slope of the outage probability as a function of SNR. Mathematically, this is defined as

DVO=limSNRlogPout(SNR)logSNR.\displaystyle\text{DVO}=\underset{SNR\rightarrow\infty}{\lim}-\frac{\log P_{\text{out}}(SNR)}{\log SNR}. (16)

Figure 3 depicts the outage probability of Rayleigh fading channel with 3-bit phase-quantized output for different RR and 𝒳M={8-PSK, 16-PSK, -PSK}\mathcal{X}_{M}=\{\text{8-PSK, 16-PSK, $\infty$-PSK}\}. One noteworthy observation is the sudden decrease of the outage exponent when RR is increased from 2.002.00 to 2.052.05 for 8-PSK. DVO drops from 11 to 12\frac{1}{2}. This is also the case for 16-PSK when RR is increased from 2.502.50 to 2.552.55. This can be partially explained by rates of 8-PSK and 16-PSK for varying rotations (as seen in Figure 4). Since the transmitter cannot compensate the phase rotation induced by fading, choosing an RR that exceeds the worst-case rates of 8-PSK and 16-PSK in Figure 4 causes outage even with high SNR. Lastly, we note that \infty-PSK is invariant of the channel phase. As such, the choice of RR does not affect its outage exponent provided R<bR<b. However, the input distribution that achieves the best outage performance for a particular SNR and quantizer resolution still needs to be addressed by further research.

Refer to caption
Figure 3: Outage Probability PoutP_{\text{out}} vs. SNR for different rate RR and PSK modulation 𝒳M\mathcal{X}_{M} (b=3b=3).
Refer to caption
Figure 4: Rate vs. g\angle g for 𝒳M={8-PSK,16-PSK}\mathcal{X}_{M}=\{\text{8-PSK,16-PSK}\} (|g|=1|g|=1).

V Conclusion

In this work, we analyzed the capacity of channels with phase-quantized output. The first contribution of this work is a rigorous proof that a rotated 2b2^{b}-phase shift keying is optimal for static channels with bb-bit phase quantization. Using the capacity-achieving input, a channel capacity expression is established. Numerical examples were provided to demonstrate the optimality of the capacity-achieving input. For phase-quantized Rayleigh fading case, the outage performance was analyzed numerically for different MM-PSK modulation schemes and b=3b=3. Our numerical findings showed that transmitting at a rate RR that is above the information rate of MM-PSK signaling with worst-case g+β\angle g+\beta would significantly impact the robustness of the system against outage. A threshold effect in the outage exponent was observed in 8-PSK and 16-PSK when RR exceeded these values. Further research needs to be conducted to be able to generalize these results to different types of fading channels. Ergodic capacity of phase-quantized fading channel is also considered for future work.

References

  • [1] J. Liu, Z. Luo, and X. Xiong, “Low-Resolution ADCs for Wireless Communication: A Comprehensive Survey,” IEEE Access, vol. 7, pp. 91291–91324, 2019.
  • [2] S. Jacobsson, G. Durisi, M. Coldrey, U. Gustavsson, and C. Studer, “One-bit massive MIMO: Channel estimation and high-order modulations,” in 2015 IEEE International Conference on Communication Workshop (ICCW), pp. 1304–1309, June 2015.
  • [3] E. Björnson, M. Matthaiou, and M. Debbah, “Massive MIMO with Non-Ideal Arbitrary Arrays: Hardware Scaling Laws and Circuit-Aware Design,” IEEE Transactions on Wireless Communications, vol. 14, pp. 4353–4368, Aug 2015.
  • [4] O. Orhan, E. Erkip, and S. Rangan, “Low power analog-to-digital conversion in millimeter wave systems: Impact of resolution and bandwidth on performance,” in 2015 Information Theory and Applications Workshop (ITA), pp. 191–198, 2015.
  • [5] A. Mezghani and J. A. Nossek, “Capacity lower bound of MIMO channels with output quantization and correlated noise,” in 2012 IEEE International Symposium on Information Theory, 2012.
  • [6] M. N. Vu, N. H. Tran, D. G. Wijeratne, K. Pham, K. Lee, and D. H. N. Nguyen, “Optimal Signaling Schemes and Capacity of Non-Coherent Rician Fading Channels With Low-Resolution Output Quantization,” IEEE Transactions on Wireless Communications, vol. 18, no. 6, pp. 2989–3004, 2019.
  • [7] J. Singh, O. Dabeer, and U. Madhow, “On the limits of communication with low-precision analog-to-digital conversion at the receiver,” IEEE Transactions on Communications, vol. 57, pp. 3629–3639, December 2009.
  • [8] A. Mezghani and J. A. Nossek, “Analysis of Rayleigh-fading channels with 1-bit quantized output,” in 2008 IEEE International Symposium on Information Theory, pp. 260–264, 2008.
  • [9] S. Krone and G. Fettweis, “Fading channels with 1-bit output quantization: Optimal modulation, ergodic capacity and outage probability,” in 2010 IEEE Information Theory Workshop, pp. 1–5, 2010.
  • [10] M. H. Rahman, M. Ranjbar, N. H. Tran, and K. Pham, “Capacity-Achieving Signal and Capacity of Gaussian Mixture Channels with 1-bit Output Quantization,” in ICC 2020 - 2020 IEEE International Conference on Communications (ICC), pp. 1–6, 2020.
  • [11] J. Singh and U. Madhow, “Phase-quantized block noncoherent communication,” IEEE Transactions on Communications, vol. 61, no. 7, pp. 2828–2839, 2013.
  • [12] S. Gayan, R. Senanayake, H. Inaltekin, and J. Evans, “Low-resolution quantization in phase modulated systems: Optimum detectors and error rate analysis,” IEEE Open Journal of the Communications Society, vol. 1, pp. 1000–1021, 2020.
  • [13] S. Gayan, H. Inaltekin, R. Senanayake, and J. Evans, “Phase modulated communication with low-resolution adcs,” in ICC 2019 - 2019 IEEE International Conference on Communications (ICC), pp. 1–7, May 2019.
  • [14] M. R. Souryal and H. You, “Quantize-and-forward relaying with m-ary phase shift keying,” in 2008 IEEE Wireless Communications and Networking Conference, pp. 42–47, 2008.
  • [15] E. S. P. Lopes and L. T. N. Landau, “Optimal Precoding for Multiuser MIMO Systems With Phase Quantization and PSK Modulation via Branch-and-Bound,” IEEE Wireless Communications Letters, vol. 9, no. 9, pp. 1393–1397, 2020.
  • [16] N. I. Bernardo, J. Zhu, and J. Evans, “Supplementary materials - proof.” https://arxiv.org/src/2101.09896/anc/supplement_mat.pdf, 2021. [Online].
  • [17] T. Koch and A. Lapidoth, “At low snr, asymmetric quantizers are better,” IEEE Transactions on Information Theory, vol. 59, no. 9, pp. 5421–5445, 2013.
  • [18] T. Koch and A. Lapidoth, “Increased capacity per unit-cost by oversampling,” in 2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel, pp. 000684–000688, 2010.
  • [19] H. Fu and P. Y. Kam, “Exact phase noise model and its application to linear minimum variance estimation of frequency and phase of a noisy sinusoid,” in 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, pp. 1–5, 2008.
  • [20] T. M. Cover and J. A. Thomas, Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing). USA: Wiley-Interscience, 2006.
  • [21] I. C. Abou-Faycal, M. D. Trott, and S. Shamai, “The capacity of discrete-time memoryless Rayleigh-fading channels,” IEEE Transactions on Information Theory, vol. 47, no. 4, pp. 1290–1301, 2001.
  • [22] L. E. Dubins, “On extreme points of convex sets,” Journal of Mathematical Analysis and Applications, vol. 5, no. 2, pp. 237 – 244, 1962.
  • [23] H. Witsenhausen, “Some aspects of convexity useful in information theory,” IEEE Transactions on Information Theory, vol. 26, no. 3, pp. 265–271, 1980.
  • [24] L. Alaoglu, “Weak topologies of normed linear spaces,” Annals of Mathematics, vol. 41, no. 1, pp. 252–267, 1940.