Next Article in Journal
Isospectral Twirling and Quantum Chaos
Previous Article in Journal
Mathematical Models to Measure the Variability of Nodes and Networks in Team Sports
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Low-Resolution ADCs for Two-Hop Massive MIMO Relay System under Rician Channels

1
College of Electronic and Optical Engineering & College of Microelectronics, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
2
Institute of Data Science, The Fu Foundation School of Engineering and Applied Science, Columbia University, New York, NY 10027, USA
*
Author to whom correspondence should be addressed.
Submission received: 19 June 2021 / Revised: 12 August 2021 / Accepted: 14 August 2021 / Published: 19 August 2021

Abstract

:
This paper works on building an effective massive multi-input multi-output (MIMO) relay system by increasing the achievable sum rate and energy efficiency. First, we design a two-hop massive MIMO relay system instead of a one-hop system to shorten the distance and create a Line-of-Sight (LOS) path between relays. Second, we apply Rician channels between relays in this system. Third, we apply low-resolution Analog-to-Digital Converters (ADCs) at both relays to quantize signals, and apply Amplify-and-Forward (AF) and Maximum Ratio Combining (MRC) to the processed signal at relay R 1 and relay R 2 correspondingly. Fourth, we use higher-order statistics to derive the closed-form expression of the achievable sum rate. Fifth, we derive the power scaling law and achieve the asymptotic expressions under different power scales. Last, we validate the correctness of theoretical analysis with numerical simulation results and show the superiority of the two-hop relay system over the one-hop relay system. From both closed-form expressions and simulation results, we discover that the two-hop system has a higher achievable sum rate than the one-hop system. Besides, the energy efficiency in the two-hop system is higher than the one-hop system. Moreover, in the two-hop system, when quantization bits q   =   4 , the achievable sum rate converges. Therefore, deploying low-resolution ADCs can improve the energy efficiency and achieve a fairly considerable achievable sum rate.

1. Introduction

In the field of wireless communication, multi-input multi-output (MIMO) systems have been widely used for their superior performance like increasing channel capacity and improving user anti-interference performance [1]. However, MIMO systems also have the following disadvantages. First, when the distances between users and targets are large, the signal cannot reach the targets directly due to the heavy shadow and path loss [2,3,4,5]. Therefore, there is no Line-of-Sight (LOS) between users and targets and only Rayleigh channels can be applied between [6,7]. Second, when a large number of transmitting and receiving antennas are equipped with high-resolution Analog-to-Digital Converters (ADCs), the system will consume tremendous amounts of energy. To be specific, if a high-resolution ADC is with b-bit precision and the sampling frequency is f s , f s 2 b conversions will be required per second, which means the energy consumption of the system increases exponentially with the quantization accuracy [2].
With the development of multi-hop communication, we can decrease the distances between relays so that LOS can appear. Then we can apply Rician channels instead of Rayleigh channels to reduce the achievable sum rate. Besides, using low-resolution ADCs instead of high-resolution ADCs can alleviate the energy consumption burden of the MIMO system and achieve a fairly considerable achievable sum rate at the same time.

1.1. Related Works

The authors of [8,9] applied Rician channels to MIMO systems. However, the study only concentrated on the one-hop scenario. Therefore, it can only cover a limited communication distance in real problems. In order to reduce the power consumption of ADCs, scholars have made plenty of attempts with the idea of using low-resolution ADCs. The authors of [10] studied the hybrid ADCs/DACs relay system and proposed the power scaling law. This law revealed that the transmission power could be reduced inversely proportional to the number of relay antennas, and an effective power allocation scheme was further proposed based on this law. The authors of [11] studied the one-bit low-resolution ADCs relay system for the MIMO system, which is a special case of low-resolution ADCs, and proved one-bit low-resolution ADCs is effective for reducing energy consumption. The authors of [12,13] applied low-resolution ADCs to the Rician channels relay system. However, they only considered the one-hop relay system scenario, so the communication distance was limited. Since it is very important for the MIMO system to increase the achievable sum rate, reduce the energy consumption and maintain long-distance communication, we consider the uplink of a two-hop low-resolution ADCs massive MIMO relaying system over the Rician channel in our paper.

1.2. Contributions

Our work considers the uplink of a two-hop low-resolution ADCs massive MIMO relay system over Rician channels. Firstly, we derive the closed-form expression of the achievable sum rate of the uplink of the low-resolution ADCs massive MIMO relay system over two-hop Rician channels and one-hop Rayleigh channels based on the higher-order statistics of perfect channel state information (CSI). Secondly, we derive the asymptotic closed-form expressions when the number of antennas tends to infinity. Next, we further achieve the law of power scaling and asymptotic values under different power scales, and conclude that the transmission power scaled down inversely proportional to the number of antennas at relays. Finally, we compare the achievable sum rates of the two-hop Rician system and the one-hop Rayleigh system, and validate the correctness of the theoretical analysis with numerical simulation results.
More specifically, the contributions of this work are summarised as follows:
1. We design a two-hop Rician channel system, which guarantees the LOS between users, relays and targets, and takes the advantage of Rician channels to increase the achievable sum rate while maintaining long-distance communication.
2. We use both mathematical approaches and simulation results to prove the superiority of achievable sum rate of our two-hop Rician channel system over the one-hop Rayleigh channel system, which is more widely applied to MIMO systems.
3. We apply low-resolution ADCs to our two-hop Rician system to reduce the energy consumption, and use mathematical analysis and simulation results to find that when quantization bits q   =   4 , the system achieves a fairly considerable achievable sum rate while greatly reduces the energy consumption.

1.3. Notations

Notation: The superscripts ( · ) T , ( · ) H , t r ( · ) and d i a g ( · ) represent the transpose, Hermitian transpose, trace of the matrix, and diagonal matrix, respectively. | | · | | represents the Euclidean norm. C N ( , σ 2 ) represents the complex Gaussian distribution with the mean of ∗ and the variance of σ 2 . E [ · ] represents the expectation. I N denotes an N × N identify matrix. X i j or [ X ] i j represents the ( i , j ) t h entry of X .

2. System Model and Signal Processing

2.1. One-Hop Rayleigh Channel System

Figure 1 shows the system model of the uplink of a one-hop massive MIMO relay with low-resolution ADCs under Rayleigh channels. This system contains relay R 1 with N R 1 antennas, and K users with single antenna. The system works under Rayleigh channels because the distances between users and the relay are very large and there is no LOS between users and the relay.
We use G R 1 C N R 1 × K to denote the MIMO channel matrix. According to [9], G R 1 can be represented as
G R 1   =   H R 1 D R 1 1 / 2
where D R 1 is a K × K diagonal matrix representing the large-scale fading between K users and K different randomly selected antennas from N R 1 antennas in relay R 1 with the probability of 1 / N R 1 , and [ D R 1 ] k k   =   α k . α k   =   ( d r e f d u _ R 1 ) v , where d r e f represents the reference distance, d i _ j represents the distance from node i to node j, v is the power exponent coefficient.
H R 1 C N R 1 × K denotes the fast-fading matrix of the Rayleigh channels. Every column of H R 1 follows C N ( 0 , 1 2 ) .
Assume that the signal transmitted by K user antennas is x S   =   [ x 1 , x 2 , , x K ] T , where E [ x S x S T ]   =   I K . After one time slot, the signal received by relay R 1 can be expressed as
y R 1   =   P u G R 1 x S   +   n R 1
where P u is the transmission power of each user, n R 1 is the white noise follows i.i.d complex Gaussian distribution at relay R 1 , n R 1 C N ( 0 , σ R 1 2 ) .
y R 1 is then quantized by low-resolution ADCs at R 1 . Based on Additive Quantization Noise Model (AQNM) [14,15], the quantized signal can be represented as
y ˜ R 1   =   Q [ y R 1 ]   =   m y R 1   +   n ˜ R 1
where n ˜ R 1 denotes the additive quantization noise vector and is independent from the received signal y R 1 , m denotes the linear quantization gain. According to [10,16,17], m satisfies the following equation m   =   1 ρ , where ρ represents the quantization distortion factor and equals the ratio of the quantizer error variance over received signal variance. For relay R 1 , ρ   =   E [ | y R 1 y ˜ R 1 | 2 ] E [ | y R 1 | 2 ] . When the number of quantization bits q 5 , the values of ρ is shown in Table 1. When q > 5 , ρ π 3 2 · 2 2 q .
According to [18], the covariance matrix of the quantization noise can be expressed as
R n ˜ R 1   =   m ρ d i a g ( P u G R 1 G R 1 H   +   σ R 1 2 I N R 1 )
Because Maximum Ratio Combining (MRC) has low-complexity and is able to achieve the optimal reception performance, we use MRC to linear process the quantized signal y ˜ R 1 , where the MRC matrix W R 1 H   =   G R 1 H . Therefore, the processed signal x R 1 can be written as
x R 1   =   W R 1 H y ˜ R 1   =   m P u G R 1 H G R 1 x S   +   m G R 1 H n R 1   +   G R 1 H n ˜ R 1
Noticing that the signal of the k t h user and the other users in (5) are uncorrelated, the received signal of the k t h user at relay R 1 can be written as
x R 1 , k   =   m P u g R 1 , k H G R 1 x S , k desired signal   +   m P u Σ j k K g R 1 , j H G R 1 x S , j interference   +   m g R 1 , k H n R 1   +   g R 1 , k H n ˜ R 1 noise

2.2. Two-Hop Rician Channel

In order to increase the achievable sum rate, we convert the one-hop MIMO system to two-hop MIMO system, so that the distance between users and relays can be reduced. As a result, LOS will appear between users and relays and Rician channels can be applied to increase the achievable sum rate.
Figure 2 shows the system model of the uplink of a two-hop massive MIMO system with low-resolution ADCs under Rician channels. This system contains relay R 1 with N R 1 antennas, relay R 2 with N R 2 antennas and K users with a single antenna. The system works under Rician channels because LOS exists between users and R 1 and between R 1 and R 2 .
We use G R 1 C N R 1 × K to denote the MIMO channel matrix between users, G R 2 C N R 2 × K to denote the MIMO channel matrix between R 1 and R 2 . G R 1 can be represented as
G R 1   =   H R 1 D R 1 1 / 2
G R 2 can be represented as
G R 2   =   H R 2 D R 2 1 / 2
where D R 1 is a diagonal matrice representing the large-scale fading between K users and the K different randomly selected antennas from N R 1 antennas with the probability of 1 / N R 1 at relay R 1 , and [ D R 1 ] k k   =   α k . D R 2 is a diagonal matrice representing the large-scale fading between K users and K different randomly selected antennas from N R 2 antennas at relay R 2 with the probability of 1 / N R 2 , and [ D R 2 ] k k   =   β k . α k   =   ( d r e f d u _ R 1 ) v , β k   =   ( d r e f d R 1 _ R 2 ) v , where d r e f represents the reference distance, d i _ j represents the distance from node i to node j, v is power exponent coefficient.
H R 1 C N R 1 × K and H R 2 C N R 2 × K denote the fast-fading matrix of Rician channels. According to [19], H R 1 and H R 2 can be represented as:
H R 1   =   H R 1 [ Ω R 1 ( Ω R 1   +   I K ) 1 ] 1 / 2   +   H R 1 [ ( Ω R 2   +   I K ) 1 ] 1 / 2
G R 2   =   H R 2 D R 2 1 / 2
Same as the previous chapter, we can get the quantized signal y ˜ R 1 at R 1 as
y ˜ R 1   =   Q [ y R 1 ]   =   m y R 1   +   n ˜ R 1
From (4), we can get the covariance matrix of the quantization noise R n ˜ R 1 at R 1 as
R n ˜ R 1   =   m 1 ρ 1 d i a g ( P u G R 1 G R 1 H   +   σ R 1 2 I N R 1 )
where m 1 denotes the linear quantization gain at R 1 , ρ 1 denotes the quantization distortion factor at R 1 .
The processed signal x R 1 can be expressed as
x R 1   =   W R 1 H y ˜ R 1   =   m P u G R 1 H G R 1 x S   +   m G R 1 H n R 1   +   G R 1 H n ˜ R 1
Then, we apply the technique of Amplify-and-Forward (AF) to signal x R 1 and transmit the processed signals to R 2 with K randomly selected antennas. The signal y R 2 received at relay R 2 can be denoted as
y R 2   =   γ G R 2 x R 1   +   n R 1
where G R 2 is the Rayleigh fading channel between relay R 1 and R 2 , n R 2 C N ( 0 , σ R 2 2 ) , which is the white noise follows i.i.d complex Gaussian distribution at relay R 2 . γ is an amplification factor at relay R 1 , which satisfies the power constraint E [ γ x R 1 2 ]   =   P R . Therefore, γ can be expressed as
γ   =   p R E [ x R 1 2 ]
where P R represents the transmit power at relay R 1 ,
E [ x R 1 2 ]   =   m 1 2 [ p u t r ( E [ G R 1 H G R 1 G R 1 H G R 1 ] )   +   σ R 1 2 t r ( E [ G R 1 H G R 1 ] ) ]   +   t r ( E [ G R 1 H R n ˜ R 1 G R 1 ] ) .
To simplify the expression, we make the following definitions.
Δ R 1 , k   =   2 μ k   +   1 ( μ k   +   1 ) 2 Φ R 1 , k i   =   s i n N R 1 π ( s i n θ R 1 s i n θ R 1 , i ) / 2 s i n π ( s i n θ R 1 , k s i n θ R 1 , i ) / 2 Q k i   =   μ k μ i Φ k i 2 N R 1   +   μ k   +   μ i   +   1 ( μ k   +   1 ) ( μ i   +   1 )
Δ R 2 , k   =   2 ε k   +   1 ( ε k   +   1 ) 2 Φ R 2 , k i   =   s i n N R 2 π ( s i n θ R 2 s i n θ R 2 , i ) / 2 s i n π ( s i n θ R 2 , k s i n θ R 2 , i ) / 2 R k i   =   ε k ε i Φ k i 2 N R 2   +   ε k   +   ε i   +   1 ( ε k   +   1 ) ( ε i   +   1 )
Therefore, γ can be expressed as follows, the proof is attached in Appendix A.
γ   =   P R m 1 2 ( P u S 1   +   N R 1 σ R 1 2 Σ i   =   1 K α i )   +   m 1 ρ 1 S 2 S 1   =   N R 1 Σ i   =   1 K α i 2 ( N R 1   +   Δ R 1 , i )   +   N R 1 Σ i   =   1 K α i Σ l   =   1 K α l Q i l S 2   =   p u N R 1 Σ n   =   1 K α n ( α n   +   Σ i   =   1 K α i )   +   N R 1 σ R 1 2 Σ n   =   1 K α n
Similar to the quantization at relay R 1 , the quantized signal y ˜ R 2 at relay R 2 can be modeled as
y ˜ R 2   =   Q [ y R 2 ]   =   m 1 y R 2   +   n ˜ R 2
The covariance matrix of the quantization noise n ˜ R 1 can be written as
R n ˜ R 2   =   m 2 ρ 2 d i a g ( γ 2 R y R 2   +   σ R 2 2 I N R 2 )
where m 2 denotes the linear quantization gain at R 2 , ρ 2 denotes the quantization distortion factor at R 2 , R y R 2   =   G R 2 G R 1 H R y R 1 G R 1 G R 2 H , R y ˜ R 2   =   m 1 2 ( P u G R 1 G R 1 H   +   σ R 1 2 I N R 1 )   +   m 1 ρ 1 d i a g ( P u G R 1 G R 1 H   +   σ R 1 2 I N R 1 ) .
Same as MRC processing at relay R 1 , we also use MRC to process signals at R 2 , where the MRC matrix W R 2 H   =   G R 2 H . Therefore, the processed signal x R 2 can be written as
x R 2   =   W R 2 H y ˜ R 2   =   γ m 1 m 2 P u G R 2 H G R 2 G R 1 H G R 1 x S   +   γ m 1 m 2 G R 2 H G R 2 G R 1 H n R 1   +   γ m 2 G R 2 H G R 2 G R 1 H n ˜ R 1   +   m 2 G R 2 H n R 2   +   G R 2 H n ˜ R 1
Noticing that the signal of the k t h user and the other users in (15) are uncorrelated, the received signal of the k t h user at relay R 2 can be written as
x R 2 , k   =   γ m 1 m 2 P u g R 2 , k H G R 2 G R 1 H g R 1 , k x S , k desired signal   +   γ m 1 m 2 P u Σ j k K g R 2 , k H G R 2 G R 1 H g R 1 , j x S , j interference   +   γ m 1 m 2 g R 2 , k H G R 2 G R 1 H n R 1   +   γ m 2 g R 2 , k H G R 2 G R 1 H n ˜ R 1   +   m 2 g R 2 , k H n R 2   +   g R 2 , k H n ˜ R 1 noise

3. System Achievable Rate Analysis

3.1. One-Hop Rayleigh Channel

3.1.1. Closed-Form Expression

Supposing that the CSI is perfect, based on Shannon Entropy and according to (6), we can get the rate of the k t h user in one-hop low-precision ADCs MIMO relay system over Rayleigh channels as
R k R a y l e i g h   =   1 2 E [ l o g 2 ( 1   +   P k R a y l e i g h N k R a y l e i g h ) ]
P k R a y l e i g h   =   m 2 P u | g R 1 , k H G R 1 | 2
N k R a y l e i g h   =   m 2 P u Σ j k K | g R 1 , j H G R 1 | 2   +   m 2 σ R 1 2 | g R 1 , k H | 2   +   | g R 1 , k H R n ˜ R 1 g R 1 , k |
where P k R a y l e i g h represents the power of desired signal of the k t h user, N k R a y l e i g h represents the power of interference signal and the noise of the k t h user.
According to [20], the rate of k t h user can also be denoted as
R k R a y l e i g h   =   1 2 l o g 2 ( 1   +   S N R k )
where S N R k represents the Signal-to-noise Ratio (SNR) of the k t h user at the receiving end R 1 .
S N R k   =   P k R a y l e i g h N k R a y l e i g h
Based of (20) and (21), we can derive the closed-form expression for the achievable sum rate of the k t h user in the one-hop low-precision ADCs MIMO relay system over Rayleigh channels is
R k R a y l e i g h   =   1 2 l o g 2 ( 1   +   P k R a y l e i g h N k R a y l e i g h )
In Formula (22), P k R a y l e i g h and N k R a y l e i g h can be represented as follows, the proof is attached in Appendix B.
P k R a y l e i g h   =   m 2 P u E [ | g R 1 , k H G R 1 | 2 ]   =   m 2 P u α k 2 N R 1 ( N R 1   +   1 )
N k R a y l e i g h   =   m 2 P u Σ j k K E [ | g R 1 , j H G R 1 | 2 ]   +   m 2 σ R 1 2 E [ | g R 1 , k H | 2 ]   +   E [ | g R 1 , k H R n ˜ R 1 g R 1 , k | ]   =   m 2 P u N R 1 Σ j k K α k α j   +   m 2 σ R 1 2 N R 1 α k   +   m ρ α n N R 1 ( P u Σ i   =   1 K α i   +   P u α n   +   σ R 1 2 )

3.1.2. Power Scaling Laws and Asymptotic Analysis

Based on the closed-form expression over Rayleigh channels given by (22), we further analyze their performances and derive the law of energy scaling in different conditions.
Suppose that the transmit power at the user end is P u   =   E u N R 1 a , a is the power scaling constant. When the number of antennas tends to infinity, the limit of S N R k in (21) can be represented as
lim N R 1 S N R k   =   lim N R 1 α k 2 m 2 E u N R 1 2 a α k m 2 σ R 1 2 N R 1   +   Σ n   =   1 K α n m ρ σ R 1 2 N R 1   =   lim N R 1 α k 2 m E u N R 1 1 a α k m σ R 1 2   +   Σ n   =   1 K α n ρ σ R 1 2
When a takes different values, we can obtain the following power scaling law
lim N R 1 S N R k     =   a < 1 α k 2 m E u α k m σ R 1 2   +   Σ n   =   1 K α n ρ σ R 1 2 a   =   1 0 a 1
As can be seen from (26), when N R 1 tends to infinity, the transmit power at the user end can be scaled down by 1 N R 1 a . When the scale index a satisfies a   =   1 , the achievable rate remains stable. Based on (21), (22) and (26), when the prefect CSI exists from users to R 1 , we assume that N R 1 K 1 , the large-scale fading between users and R 1 satisfies α 1   =   α 2   =     =   α k   =   α , the user transmit power P u σ R 1 2 , S N R k can be approximated as
S N R k m N R 1 K
The proof is attached in Appendix C.
The uplink achievable sum rate can be approximated as
R s u m R a y l e i g h   =   K 2 l o g 2 ( 1   +   m N R 1 K )

3.2. Two-Hop Rician Channels

3.2.1. Closed-Form Expression

Similar to (17), the achievable rate of the k t h user in two-hop low-precision ADCs MIMO relay system over Rician channels can be represented as
R k R i c i a n   =   1 2 E [ l o g 2 ( 1   +   P k R i c i a n N k R i c i a n ) ]
where P k R i c i a n represents the power of desired signal of the k t h user, and N k R i c i a n represents the power of interference signal and the of noise of the k t h user.
The detailed formula of P k R i c i a n and N k R i c i a n can also be represented as
P k R i c i a n   =   γ 2 m 1 2 m 2 2 P u | g R 2 , k H G R 2 G R 1 H g R 1 , k | 2
N k R i c i a n   =   γ 2 m 1 2 m 2 2 P u Σ j k K | g R 2 , k H G R 2 G R 1 H g R 1 , j | 2   +   γ 2 m 1 2 m 2 2 σ R 1 2 | g R 2 , k H G R 2 G R 1 H | 2   +   γ 2 m 2 2 | g R 2 , k H G R 2 G R 1 H R n ˜ R 1 G R 1 G R 2 T g R 2 , k | 2   +   m 2 2 σ R 2 2 | g R 2 , k | 2   +   | g R 2 , k H R n ˜ R 2 g R 2 , k | 2
Similar to (20), the rate of k t h user can be denoted as
R k R i c i a n   =   1 2 l o g 2 ( 1   +   S N R k )
where S N R k represents the SNR of the k t h user at the receiving end R 2 .
S N R k   =   P k R i c i a n N k R i c i a n
Based of (32) and (33), we can derive the closed-form expression for the achievable sum rate of the two-hop low-precision ADCs MIMO relay system over Rician channels is
R k R i c i a n   =   1 2 l o g 2 ( 1   +   P k R i c i a n N k R i c i a n )
In Formula (34), P k R a y l e i g h and N k R a y l e i g h can be represented as follows, the proof is attached in Appendix D.
P k R i c i a n   =   γ 2 m 1 2 m 2 2 P u E [ | g R 2 , k H G R 2 G R 1 H g R 1 , k | 2 ]   =   γ 2 m 1 2 m 2 2 P u α k β k N R 1 N R 2 [ α k β k ( N R 1   +   Δ R 1 , k ) ( N R 2   +   Δ R 2 , k )   +   Σ i k K α i β i Q k i , R k i ]
N k R i c i a n   =   A k R i c i a n   +   B k R i c i a n   +   C k R i c i a n   +   D k R i c i a n   +   E k R i c i a n A k R i c i a n   =   γ 2 m 1 2 m 2 2 P u Σ j k K E [ | g R 2 , k H G R 2 G R 1 H g R 1 , j | 2 ]   =   γ 2 m 1 2 m 2 2 P u β k N R 1 N R 2 Σ j k K α j [ α k β k Q k j ( N R 2   +   Δ R 2 , k )   +   α j β j R k j ( N R 1   +   Δ R 1 , j )   +   Σ i k K α i β i R k i Q i j ] B k R i c i a n   =   γ 2 m 1 2 m 2 2 σ R 1 2 E [ | g R 2 , k H G R 2 G R 1 H | 2 ]   =   γ 2 m 1 2 m 2 2 σ R 1 2 β k N R 1 N R 2 [ α k β k ( N R 2   +   Δ R 2 , k )   +   Σ i k K α i β j R k i ] C k R i c i a n   =   γ 2 m 2 2 E [ g R 2 , k H G R 2 G R 1 H R n ˜ R 1 G R 1 G R 2 H g R 2 , k ]   =   γ 2 m 1 ρ 1 m 2 2 β k N R 1 N R 2 [ P u ( ( N R 2   +   Δ R 2 , k ) α k β k ( α k   +   Σ l i K α l )   +   Σ i k K α i β i R k i ( α i   +   Σ l i K α l ) )   +   σ R 1 2 α k β k ( N R 2   +   Δ R 2 , k )   +   Σ i k K α i β i R k i ] D k R i c i a n   =   m 2 2 σ R 2 2 E [ | g R 2 , k | 2 ]   =   m 2 2 σ R 2 2 N R 2 β k E k R i c i a n   =   E [ g R 2 , k H R n ˜ R 1 g R 2 , k ]   =   γ 2 m 1 m 2 ρ 2 N R 1 N R 2 β k ( α k β k Δ R 2 , k ( P u Σ i   =   1 K α i   +   m 1 N R 1 P u α k   +   ρ 1 P u α k   +   σ R 1 2 )   +   Σ n   =   1 K α n β n ( p u Σ i   =   1 K α i   +   m 1 N R 1 P u α n   +   ρ 1 p u α n   +   σ R 1 2 ) )   +   m 2 ρ 2 σ R 2 2 N R 2 β k

3.2.2. Power Scaling Laws and Asymptotic Analysis

Based on the closed-form expressions over Rician channel given by (33) and (34), we further analyze their performances and derive the law of energy scaling in different conditions.
Suppose that the transmit power at the user end is P u   =   E u N R 1 a , the transmit power at relay R 1 is P R   =   E u N R 2 b , a and b are power scaling constants, λ   =   N R 2 N R 1 < . When the N R 1 and N R 2 tend to infinity, the limit of S N R k in (33) can be represented as
lim N R 1 S N R k   =   lim N R 1 m 1 2 m 2 γ 2 P u N R 1 2 N R 2 α k 2 β k m 1 m 2 γ 2 N R 1 N R 2 α k β k σ R 1 2   +   σ R 2 2   =   lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 m 2 λ σ R 1 2   +   σ R 2 2 γ 2 α k β k N R 1 2
When a and b take different values, we can obtain the following power scaling law, the proof is attached in Appendix E.
lim N R 1 S N R k   =     a , b < 1 m 2 E R α k 2 β k σ R 2 2 Σ i   =   1 K α i 2 a < b   =   1 m 1 E u α k σ R 1 2 b < a   =   1 m 1 m 2 E U E R α k 2 β k τ a   =   b   =   1 0 a > 1 o r b > 1
where τ   =   m 2 E R α k β k σ R 1 2   +   σ R 2 2 ( m 1 E u Σ i   =   1 K α i 2   +   σ R 1 2 Σ i   =   1 K α i ) . As can be seen from (38), when N R 1 tends to infinity, the transmit power at the user end can be scaled down by 1 N R 1 a and 1 N R 2 b . When the scale index a and b satisfy a < b   =   1 , b < a   =   1 or a   =   b   =   1 , the achievable rate remains stable.
Based on (38) and according to [13], when the prefect CSI exists from users to R 1 and from R 1 to R 2 , we assume that N R 2 > N R 1 K 1 , the large-scale fading between users and R 1 satisfies α 1   =   α 2   =     =   α k   =   α , the fading between R 1 and R 2 satisfies β 1   =   β 2   =     =   β k   =   β , the user transmit power p u σ R 1 2 , R 1 transmit power p R σ R 2 2 , λ   =   N R 2 N R 1 < , S N R k can be approximated as
S N R k m 1 N R 1 K
Therefore, no matter the system is under Rayleigh channel or Rician channel, we can derive the approximate uplink achievable sum rate as
R s u m R i c i a n   =   K 2 l o g 2 ( 1   +   m 1 N R 1 K )
The proof is attached in Appendix F.

4. Results

In this section, we use system 1 to represent the one-hop Rayleigh system, system 2 to represent the two-hop Rician system. We set different experiments and visualize the 1000-time Monte Carlo simulation results and the achievable sum rate calculated from the closed-form expressions. Then we compare the results of system 1 and system 2 to verify the correctness of theoretical analysis. In our experiments, we set the number of users K   =   10 , the transmission power of users P u   =   20 d B , the transmission energy P R   =   25 d B , the noise energy at R 1 and R 2 as σ R 1 2   =   1 d B , σ R 2 2   =   1 d B respectively. We assume N R 2   =   4 N R 1 , the large-scale fading coefficient α k   =   ( d r e f d u _ R 1 ) v , β k   =   ( d r e f d R 1 _ R 2 ) v , where d r e f represents the reference distance, d i _ j represents the distance from node i to node j, v is the power exponent coefficient. During the simulation, we set d r e f   =   100 m , d R 1 _ R 2   =   150 m , v   =   2.4 . In system 1, we set d u _ R 1   =   [ 700 , 1136 , 1096 , 694 , 285 , 872 , 531 , 489 , 440 , 356 ] m . In system 2, we set d R 1 _ R 2   =   [ 550 , 986 , 946 , 544 , 135 , 722 , 381 , 339 , 290 , 206 ] m . We use θ R 1 , i to represent the arrival angle from users to R 1 , θ R 2 , j to represent the arrival angle from R 1 to R 2 , θ R 2 , i and θ R 2 , j obeys the uniform distribution on [ π 2 , π 2 ] .

4.1. Experiment 1: Achievable Sum Rates with Different N R 1

Figure 3 shows the variation curve of the achievable sum rate in systems 1 and 2 with the variation of N R 1 . The asterisks indicate the experimental result obtained through 1000 times Monte Carlo simulations, and the circles indicate the simulation result of the achievable sum rate calculated by the closed-form expression (22) and (34). As is shown in Figure 3, the curve of the Monte Carlo simulations perfectly matches the curve derived from the closed-form expressions, which proves the correctness of the derived closed-form expressions (22) and (34). Obviously, when the simulation parameters are the same, the achievable sum rate of the two-hop Rican system is higher than the achievable sum rate of the one-hop Rayleigh system. This result proves that converting one-hop Rayleigh system to two-hop Rician system can improve the achievable sum rate. It is in consistent with the actual communication process where there is LOS signal, and the communication quality under Rician channel is better.

4.2. Experiment 2: Achievable Sum Rates with Different q

Figure 4 shows the variation curve of the achievable sum rate in systems 1 and 2 with the variation of q when N R 1   =   200 , 400 , 800 . Apart from previous findings, we can also discover that the low-resolution quantization brings performance loss. This is because when the quantization occurs, it reduces the SNR and causes performance degradation. We can also discover that when the number of quantization bits q 4 , the achievable sum rate can persist at a stable rate.

4.3. Experiment 3: ADC Energy Efficiency with Different q

Figure 5 shows the variation curve of the ADC Energy Efficiency in systems 1 and 2 with the variation of q when N R 1   =   200 , 400 , 800 . In Figure 5, the ADC energy efficiency can be obtained by E E   =   R P , where R represents the achievable sum rate, P represents the energy loss. According to [20,21], P   =   c 0 N R 1 2 q   +   c 1 , c 0   =   0.0001 W , c 1   =   0.02 W . The result shows that in both systems, the energy efficiency of the ADC shows a logarithmic downtrend when q increases, which denotes that the low-resolution ADC can improve the energy efficiency and reduce the energy consumption during signal transmission. Besides, we can clearly find that when q is small, system 2 has a higher ADC energy efficiency compared with system 1, which proves the superiority of system 2.

4.4. Experiment 4: Asymptotic Achievable Sum Rates in Two Systems

Figure 6 shows the variation curve of achievable sum rates when N R 1 increases with different scaling indexes and the corresponding asymptotic values. When N R 1 is relatively small, the results of the 1000-time Monte Carlo simulation do not match with the analytical results precisely. However, as the number of antennas continues to increase, the 1000-time Monte Carlo simulation results can perfectly match the analytical results. It is because the law of power scaling is derived when N R 1 is large enough.
Besides, Figure 6 shows that in system 1, P u can be scaled down inversely proportional to N R 1 when scaling index a   =   1 while maintain a desirable achievable sum rate when N R 1 grows large. In system 2, P u and P R can be scaled down inversely proportional to N R 1 and N R 2 when a   =   0 , b   =   1 , or a   =   1 , b   =   0 , or a   =   1 , b   =   1 and maintain desirable achievable sum rates when N R 1 grows large. The results shown in Figure 6 are consistent with the theoretical analysis given by Equations (26) and (38).

5. Conclusions

In this paper, we investigate the uplink of a two-hop low-resolution ADCs massive MIMO relaying system over Rician channels and compare its superiority of the achievable sum rate with the one-hop Rayleigh channel system. Firstly, we use the higher-order statistics to derive the closed-form expression of achievable sum rate. From the simulation results, we discover that converting a one-hop Rayleigh channel system into a two-hop Rician channel system can increase the achievable sum rate. Besides, the use of low-resolution ADCs only causes limited loss of achievable sum rate, but greatly improves the energy efficiency. Secondly, we discover that as the number of relay antennas continues to increase, the achievable sum rate eventually reaches a stable state. Finally, the power scaling law shows that when the number of antennas at the relay grows large, both P u and P R can be scaled down inversely proportional to N R 1 and N R 2 , while maintaining a desirable achievable sum rate.

Author Contributions

S.Y. and Y.Z. are the instructors of this project. They guided and determined the direction of this project, and put forward opinions and amendments to the simulation experiments. They also help polish the manuscript. X.L. participates in formula derivation and is in charge of drawing simulation diagrams and organize the manuscript. J.C. participates in formula derivation and experiment designing. All authors have read and agreed to the published version of the manuscript.

Funding

The research was funded by the National Natural Science Foundation of China under Grant 61771257.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

1. The data in Table 1 is from paper [10,16,17]. 2. The data of energy loss formula is from [20,21]. 3. The data in simulation experiments is generated randomly by Matlab.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
MIMOMulti-input Multi-output
LOSLight of Sight
ADCsAnalog-to-Digital Converters
CSIChannel State Information
AQNMAdditive Quantization Noise Model
SNRSignal-to-noise Ratio
MRCMaximum Ratio Combining
AFAmplify-and-Forward

Appendix A

According to [20], we can get the higher-order statistics
E [ | | g R 1 , k | | 2 ]   =   α k N R 1 E [ | | g R 2 , k | | 2 ]   =   β k N R 2 E [ | g R 1 , k , g R 1 , i | 2 ]   =     α k 2 N R 1 ( N R 1   +   Δ R 1 , k ) i   =   k α k α i N R 1 Q k i i k E [ | g R 2 , k , g R 2 , i | 2 ]   =     β k 2 N R 2 ( N R 2   +   1 ) i   =   k β k β i N R 2 R k i i k
Substitute higher-order statistics into (11), the first term in the denominator
t r ( E [ G R 1 H G R 1 G R 1 H G R 1 ] ) can be represented as
t r ( E [ G R 1 H G R 1 G R 1 H G R 1 ] )   =   t r ( E [ | g R 1 , i H , g R 1 , i | 2 ]   +   E [ Σ i l K | g R 1 , i H , g R 1 , l | 2 ] )   =   Σ l   =   1 K α i 2 N R 1 ( N R 1   +   Δ R 1 , i )   +   Σ i   =   1 K Σ l i K α i α l N R 1 Q i l = Δ S 1
The second term in the denominator σ R 1 2 t r ( E [ G R 1 H G R 1 ] ) ] can be represented as
σ R 1 2 t r ( E [ G R 1 H G R 1 ] ) ]   =   Σ l   =   1 K E [ g R 1 , l H , g R 1 , l ]   =   N R 1 Σ l   =   1 K α l
The simplification process of the third term in the denominator t r ( E [ G R 1 H R n ˜ R 1 G R 1 ] ) is as follows
t r ( E [ G R 1 H R n ˜ R 1 G R 1 ] )   =   k ρ t r E [ G R 1 H d i a g ( P u G R 1 G R 1 H   +   σ R 1 2 I N R 1 ) G R 1 ]   =   k ρ t r E [ Σ m   =   1 N R 1 | g m i | 2 ( σ R 1 2   +   P u Σ i n K | g m i | 2   +   P u | g m n | 2 ] ) w h e n σ R 1 2   =   1 t r ( E [ G R 1 H R n ˜ R 1 G R 1 ] )   =   Σ m   =   1 N R 1 E [ | g m n | 2 ]   +   Σ m   =   1 N R 1 Σ i n K E [ | g m n | 2 ] E [ | g m i | 2 ]   +   P u Σ m   =   1 N R 1 E [ | g m n | 4 ]
According to [13], we can get the higher-order statistics
E [ | g R 1 , m n | 2 ]   =   α n E [ | g R 1 , m n | 4 ]   =   2 α n 2
Substitute the higher-order statistics back to the previous calculation, we can get
t r ( E [ G R 1 H R n ˜ R 1 G R 1 ] )   =   t r N R 1 ( σ R 1 2 α n   +   P u α n Σ i   =   1 K α i   +   P u α n 2 )   =   P u N R 1 Σ n   =   1 K α n ( α n   +   Σ i   =   1 K α i )   +   N R 1 σ R 1 2 Σ n = 1 K α n = Δ S 2
Therefore, we can get the amplication factor γ as
γ   =   p R m 1 2 ( p u S 1   +   N R 1 σ R 1 2 Σ i   =   1 K α i )   +   m 1 ρ 1 S 2

Appendix B

According to [17,20,22], we can get the higher-order statistics
E [ | | g R 1 , k | | 2 ]   =   α k N R 1 E [ | g R 1 , k , g R 1 , i | 2 ]   =     α k 2 N R 1 ( N R 1   +   1 ) i   =   k α k α i N R 1 i k
Substitute high-order statistics into (18) and (19), we can get
P k R a y l e i g h   =   m 2 P u E [ | g R 1 , k H G R 1 | 2 ]   =   m 2 P u α k 2 N R 1 ( N R 1   +   1 ) N k R a y l e i g h   =   m 2 P u Σ j k K E [ | g R 1 , j H G R 1 | 2 ]   +   m 2 σ R 1 2 E [ | g R 1 , k H | 2 ]   +   E [ | g R 1 , k H R n ˜ R 1 g R 1 , k | ]   =   m 2 P u N R 1 Σ j k K α k α j   +   m 2 σ R 1 2 N R 1 α k   +   m ρ 1 Σ n   =   1 K α n N R 1 ( P u Σ i   =   1 K α i   +   P u α n   +   σ R 1 2 )

Appendix C

S N R k   =   m 2 P u α k 2 N R 1 ( N R 1   +   1 ) m 2 P u N R 1 Σ j k K α k α j   +   m 2 σ R 1 2 N R 1 α k   +   m 1 ρ 1 Σ n   =   1 K α n N R 1 ( P u Σ i   =   1 K α i   +   P u α n   +   σ R 1 2 )   =   m 2 P u α 2 N R 1 2 m 2 P u α 2 K N R 1   +   m ( 1 m ) P u α 2 K N R 1   =   m 2 P u α 2 N R 1 2 m P u α 2 K N R 1   =   m N R 1 K

Appendix D

Formula (35) represents the power of the desired signal of the k t h user, the calculation process is as follows
P k R i c i a n   =   γ 2 m 1 2 m 2 2 P u E [ | g R 2 , k H G R 2 G R 1 H g R 1 , k | 2 ]   =   E [ | Σ i   =   1 K g R 2 , k H g R 2 , i g R 1 , i H g R 1 , k | 2 ]   =   Σ i   =   1 K E [ | g R 2 , k H g R 2 , i g R 1 , i H g R 1 , k | 2 ]   +   Σ i   =   1 K Σ l i K E [ g R 2 , k H g R 2 , i g R 2 , l H g R 2 , k ] E [ g R 2 , i H g R 2 , k g R 2 , k H g R 2 , l ] 0   =   E [ | g R 2 , k H g R 2 , k | 2 ] E [ g R 1 , k H g R 1 , k | ]   +   Σ i k K E [ | g R 2 , k H g R 2 , i | 2 ] E [ | g R 1 , i H g R 1 , k | 2 ]
Substitute the higher-order statistics back to the previous calculation, we can get
P k R a y l e i g h   =   γ 2 m 1 2 m 2 2 P u α k β k N R 1 N R 2 [ α k β k ( N R 1   +   Δ R 1 , k ) ( N R 2   +   Δ R 2 , k )   +   Σ i k K α i β i Q k i R k i ]
Formula N k R i c i a n in (36) represents the power of interference signal and the power of noise of the k t h user and it contains four terms. The calculation process is as follows
(1)
A k R i c i a n
Substitute higher-order statistics into A k R i c i a n , we can get the power of interference
A k R i c i a n   =   γ 2 m 1 2 m 2 2 p u β k N R 1 N R 2 Σ j k K α j [ β k α k Q k j ( N R 2   +   Δ R 2 , k ) ]
(2)
B k R i c i a n
Substitute higher-order statistics into B k R i c i a n , we can get the power of gaussian white noise at R 1
B k R i c i a n   =   γ 2 m 1 2 m 2 2 σ R 1 2 β k N R 1 N R 2 [ α k β k ( N R 2   +   Δ R 2 , k )   +   Σ i k K α i β j R k i ]
(3)
C k R i c i a n
C k R i c i a n   =   m 1 ρ 1 E [ g R 2 , k H G R 2 G R 1 H d i a g ( P u G R 1 G R 1 H   +   σ R 1 2 I N R 1 ) G R 1 G R 2 H g R 2 , k ]   =   m 1 ρ 1 P u E [ g R 2 , k H G R 2 G R 1 H d i a g ( G R 1 G R 1 H ) G R 1 G R 2 H g R 2 , k ]   +   m 1 ρ 1 σ R 1 2 E [ g R 2 , k H G R 2 G R 1 H G R 1 G R 2 H g R 2 , k ]
We use E [ S 1 ] to represent the first term in C k R i c i a n , E [ S 2 ] to represent the second term in C k R i c i a n . Substitute higher-order statistics into C k R i c i a n , we can get the power of quantization noise at R 1 .
The calculation process is as follows
E [ S 1 ]   =   E [ g R 2 , k H G R 2 G R 1 H d i a g ( G R 1 G R 1 H ) G R 1 G R 2 H g R 2 , k ]   =   Σ m   =   1 N R 1 Σ i k K E [ | g R 2 , k H g R 2 , i | 2 ] E [ | g R 1 , m i | 4 ]   +   Σ i   =   1 K Σ l i K E [ | g R 2 , k H g R 2 , i | ] E [ | g R 1 , m i | 2 | g R 1 , m l | 2 ]   =   Σ m   =   1 N R 1 ( Σ i k K E [ | g R 2 , k H g R 2 , i | 2 ] E [ | g R 1 , m i | 4 ]   +   E [ | g R 2 , k | 4 ] E [ | g R 1 , k | 4 ]   +   Σ i k K Σ l i K E [ | g R 2 , k H , g R 2 , i | 2 ] E [ | g R 2 , m i | 2 | g R 2 , m l | 2 ]   +   Σ l i K E [ | g R 2 , k | 4 ] E [ | g R 1 , m k | 2 | g R 1 , m l | 2 ] )   =   β k N R 1 N R 2 ( N R 2   +   Δ R 2 , k ) α k β k ( α k   +   Σ l i K α l )   +   Σ i k K α i β i R k i ( α i   +   Σ l i K α l ) E [ S 2 ]   =   E [ g R 2 , k H G R 2 G R 1 H G R 1 G R 2 H g R 2 , k ]   =   E [ | g R 2 , k G R 2 G R 1 H | 2 ]   =   β k N R 1 N R 2 σ R 1 2 α k β k ( N R 2   +   Δ R 2 , k )   +   Σ i k K α i β i R k i C k R i c i a n   =   γ 2 m 1 ρ 1 m 2 2 β k N R 1 N R 2 [ P u ( N R 2   +   Δ R 2 , k ) α k β k ( α k   +   Σ l i K α l )   +   Σ i k K α i β i R k i ( α i   +   Σ l i K α l )   +   σ R 1 2 α k β k ( N R 2   +   Δ R 2 , k )   +   Σ i k K α i β i R k i ]
(4)
D k R i c i a n
Substitute higher-order statistic into D k R i c i a n , we can get
D k R i c i a n   =   m 2 2 σ R 2 2 E [ | g R 2 , k | 2 ]   =   m 2 2 σ R 2 2 N R 2 β k
(5)
E k R i c i a n
Combine (14) and higher-order statistics, we can get
m 1 2 E [ g R 1 , n H ( P u G R 1 G R 1 H   +   σ R 1 2 I N R 1 ) g R 1 , n ]   =   m 1 2 α n N R 1 ( P u Σ i   =   1 K α i   +   N R 1 P u α n   +   σ R 1 2 ) m 1 ρ 1 E [ g R 1 , n H d i a g ( P u G R 1 G R 1 H   +   σ R 1 2 I N R 1 ) g R 1 , n ]   =   P u ( Σ m   =   1 N R 1 E [ | g R 1 , m n | 4 ]   +   Σ m   =   1 N R 1 Σ i k K E [ | g R 1 , m i | 2 ] )   +   σ R 1 2 Σ n   =   1 K E [ | g R 1 , m n | 2 ]   =   m 1 ρ 1 α n N R 1 ( P u Σ i   =   1 K α i   +   P u α n   +   σ R 1 2 )
Combine the two items together, we can get
E [ g R 1 , n H m 1 2 ( P u G R 1 G R 1 H   +   σ R 1 2 I N R 1 )   +   m 1 ρ 1 d i a g ( P u G R 1 G R 1 H   +   σ R 1 2 I N R 1 ) g R 1 , n ]   =   m 1 α n N R 1 ( P u Σ i   =   1 K α i   +   m 1 N R 1 P u α n   +   ρ 1 P u α n   +   σ R 1 2 )
According to [21], we can get the higher-order statistics Σ m   =   1 N R 2 E [ | g R 2 , m k | 4 ]   =   β k 2 N R 2 ( 1   +   Δ R 2 , k ) , Σ m   =   1 N R 2 E [ | g R 2 , m k | 4 ]   =   N R 2 β k . Assume that n   =   m 1 α n N R 1 ( P u Σ i   =   1 K α i   +   m 1 N R 1 P u α n   +   ρ 1 P u α n   +   σ R 1 2 ) , we can get
E k R i c i a n   =   E [ g R 2 , k H R n ˜ R 1 g R 2 , k ]   =   m 2 ρ 2 σ R 2 2 E [ | g R 2 , k | 2 ]   +   m 2 ρ 2 Σ m   =   1 N R 2 E [ | g R 2 , m k | 4 ] k   +   m 2 ρ 2 Σ m   =   1 N R 2 Σ n k K E [ | g R 2 , m k | 2 ] E [ | g R 2 , m n | 2 ] n
Therefore, the quantization noise power D k R i c i a n at R 2 can be represented as
E k R i c i a n   =   E [ g R 2 , k H R n ˜ R 1 g R 2 , k ]   =   γ 2 m 1 m 2 ρ 2 N R 1 N R 2 β k ( α k β k Δ R 2 , k ( p u Σ i   =   1 K α i   +   m 1 N R 1 p u α k   +   ρ 1 p u α k   +   σ R 1 2 )   +   Σ n   =   1 K α n β n ( p u Σ i   =   1 K α i   +   m 1 N R 1 p u α n   +   ρ 1 p u α n   +   σ R 1 2 ) )   +   m 2 ρ 2 σ R 2 2 N R 2 β k

Appendix E

Substitute γ into (37), the second term in the denominator can be expressed as
σ R 2 2 γ 2 α k β k N R 1 2   =   m 1 λ b σ R 2 2 N R 1 b 2 × m 1 ( Δ 1   +   Δ 2   +   Δ 3 )   +   ( 1 m 1 ) ( Δ 3   +   Δ 4 ) E R α k β k
where Δ 1   =   E u N R 1 2 a Σ i   =   1 K α i 2 , Δ 2   =   E u N R 1 a ( Σ i   =   1 K α i ) 2 , Δ 3   =   N R 1 σ R 1 2 Σ i   =   1 K α i , Δ 4   =   E u N R 1 a Σ i   =   1 K α i ( α i   +   Σ l   =   1 K α l ) . When the value of a and b are different, the limit values are different.
(1)
a < 1 , b < 1 lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 m 2 λ σ R 1 2   +   σ R 2 2 γ 2 α k β k N R 1 2   =   lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 m 2 λ σ R 1 2   +   m 1 2 λ b σ R 2 2 E R α k β k N R 1 b 1 Δ 1   =  
(2)
b   =   1 , a < b lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 m 2 λ σ R 1 2   +   σ R 2 2 γ 2 α k β k N R 1 2   =   lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 2 λ σ R 2 2 E R α k β k Δ 1   =   m 2 E R α k 2 β k σ R 2 2 Σ i   =   1 K α i 2
(3)
a   =   1 , a > b lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 m 2 λ σ R 1 2   +   σ R 2 2 γ 2 α k β k N R 1 2   =   lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 m 2 λ R 1 2   =   m 1 E u α k σ R 1 2
(4)
a   =   b   =   1 lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 m 2 λ σ R 1 2   +   σ R 2 2 γ 2 α k β k N R 1 2   =   lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 m 2 λ σ R 1 2   +   m 1 2 λ σ R 2 2 ( m 1 Δ 1   +   Δ 3 ) E R α k β k   =   m 1 m 2 E U E R α k 2 β k τ where τ   =   m 2 E R α k β k σ R 1 2   +   σ R 2 2 ( m 1 E u Σ i   =   1 K α i 2   +   σ R 1 2 Σ i   =   1 K α i )
(5)
a > 1 lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 m 2 λ σ R 1 2   +   σ R 2 2 γ 2 α k β k N R 1 2   =   lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 m 2 λ σ R 1 2   +   λ b σ R 2 2 N R 1 b 1 O ( 1 )   =   0
(6)
a 1 < b lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 m 2 λ σ R 1 2   +   σ R 2 2 γ 2 α k β k N R 1 2   =   lim N R 1 m 1 2 m 2 λ E u α k N R 1 1 a m 1 λ b σ R 2 2 N R 1 b 1 O ( N R 1 1 a )   =   0

Appendix F

Supposing that we have the prefect CSI, N R 1 > N R 2 K 1 , α 1   =   α 2   =     =   α k   =   α , β 1   =   β 2   =     =   β k   =   β , P u σ R 1 2 , P R σ R 2 2 , S N R k can be approximated as follows
S N R k m 1 2 m 2 P u α 2 β N R 1 N R 2 m 1 2 m 2 N R 1 N R 2 α β σ R 2 2   +   m 1 ( 1 m 1 ) K 2 N R 1 N R 2 σ R 1 2 α β m 1 N R 1 K
Therefore, we derive the asymptotic expression as
R s u m K 2 l o g 2 ( 1   +   m 1 N R 1 K )

References

  1. Louie, R.H.Y.; Li, Y.; Vucetic, B. Practical physical layer network coding for two-way relay channels: Performance analysis and comparison. IEEE Trans. Wirel. Commun. 2010, 9, 764–777. [Google Scholar] [CrossRef]
  2. Kong, C.; Zhong, C.; Matthaiou, M.; Björnson, E.; Zhang, Z. Spectral Efficiency of Multipair Massive MIMO Two-Way Relaying with Imperfect CSI. IEEE Trans. Veh. Technol. 2019, 68, 6593–6607. [Google Scholar] [CrossRef] [Green Version]
  3. Dai, J.; Liu, J.; Wang, J.; Zhao, J.; Cheng, C.; Wang, J. Achievable Rates for Full-Duplex Massive MIMO Systems with Low-Resolution ADCs/DACs. IEEE Access 2019, 7, 24343–24353. [Google Scholar] [CrossRef]
  4. Kong, C.; Zhong, C.; Matthaiou, M.; Björnson, E.; Zhang, Z. Multipair Two-Way Half-Duplex DF Relaying with Massive Arrays and Imperfect CSI. IEEE Trans. Wirel. Commun. 2018, 17, 3269–3283. [Google Scholar] [CrossRef] [Green Version]
  5. Liu, J.; Dai, J.; Wang, J.; Zhao, J.; Cheng, C. Achievable Rates for Full-Duplex Massive MIMO Systems Over Rician Fading Channels. IEEE Access 2018, 6, 30208–30216. [Google Scholar] [CrossRef]
  6. Dai, Y.; Dong, X. Power Allocation for Multi-Pair Massive MIMO Two-Way AF Relaying with Linear Processing. IEEE Trans. Wirel. Commun. 2016, 15, 5932–5946. [Google Scholar] [CrossRef] [Green Version]
  7. Feng, J.; Ma, S.; Yang, G.; Xia, B. Power Scaling of Full-Duplex Two-Way Massive MIMO Relay Systems with Correlated Antennas and MRC/MRT Processing. IEEE Trans. Wirel. Commun. 2017, 16, 4738–4753. [Google Scholar] [CrossRef]
  8. Sun, X.; Xu, K.; Ma, W.; Xu, Y. Multi-pair two-way massive MIMO AF full-duplex relaying with ZFR/ZFT and imperfect CSI. In Proceedings of the 2016 16th International Symposium on Communications and Information Technologies (ISCIT), Qingdao, China, 26–28 September 2016; pp. 27–32. [Google Scholar] [CrossRef]
  9. Marzetta, T.L. Noncooperative Cellular Wireless with Unlimited Numbers of Base Station Antennas. IEEE Trans. Wirel. Commun. 2010, 9, 3590–3600. [Google Scholar] [CrossRef]
  10. Zhang, J.; Dai, L.; Sun, S.; Wang, Z. On the Spectral Efficiency of Massive MIMO Systems with Low-Resolution ADCs. IEEE Commun. Lett. 2016, 20, 842–845. [Google Scholar] [CrossRef] [Green Version]
  11. Kong, C.; Mezghani, A.; Zhong, C.; Swindlehurs, A.L.; Zhang, Z. Channel Estimation and Rate Analysis for Multipair Massive MIMO Relaying with One-Bit Quantization. In Proceedings of the GLOBECOM 2017-2017 IEEE Global Communications Conference, Singapore, 4–8 December 2017; pp. 1–6. [Google Scholar] [CrossRef]
  12. Yu, C.; Dai, X.; Yin, H.; Jiang, F. Full-duplex massive MIMO relaying systems with low-resolution ADCs over Rician fading channels. IET Commun. 2019, 13, 3088–3096. [Google Scholar] [CrossRef]
  13. Dong, P.; Zhang, H.; Xu, W.; You, X. Efficient Low-Resolution ADC Relaying for Multiuser Massive MIMO System. IEEE Trans. Veh. Technol. 2017, 66, 11039–11056. [Google Scholar] [CrossRef]
  14. Mo, J.; Alkhateeb, A.; Abu-Surra, S.; Heath, R.W. Hybrid Architectures with Few-Bit ADC Receivers: Achievable Rates and Energy-Rate Tradeoffs. IEEE Trans. Wirel. Commun. 2017, 16, 2274–2287. [Google Scholar] [CrossRef]
  15. Qiao, D.; Tan, W.; Zhao, Y.; Wen, C.; Jin, S. Spectral efficiency for massive MIMO zero-forcing receiver with low-resolution ADC. In Proceedings of the 2016 8th International Conference on Wireless Communications & Signal Processing (WCSP), Yangzhou, China, 13–15 October 2016; pp. 1–6. [Google Scholar] [CrossRef]
  16. Mezghani, A.; Nossek, J.A. Capacity lower bound of MIMO channels with output quantization and correlated noise. In Proceedings of the 2012 IEEE International Symposium on Information Theory, Cambridge, MA, USA, 1–6 July 2012. [Google Scholar] [CrossRef]
  17. Fletcher, A.K.; Rangan, S.; Goya, V.K.; Ramchandran, K. Robust Predictive Quantization: Analysis and Design Via Convex Optimization. IEEE J. Sel. Top. Signal Process. 2007, 1, 618–632. [Google Scholar] [CrossRef] [Green Version]
  18. Fan, L.; Jin, S.; Wen, C.; Zhang, H. Uplink Achievable Rate for Massive MIMO Systems with Low-Resolution ADC. IEEE Commun. Lett. 2015, 19, 2186–2189. [Google Scholar] [CrossRef] [Green Version]
  19. Proakis, J.G. Digital Communications, 4th ed.; McGraw-Hill: New York, NY, USA, 2001; pp. 759–769. [Google Scholar]
  20. Zhang, Q.; Jin, S.; Wong, K.; Zhu, H.; Matthaiou, M. Power Scaling of Uplink Massive MIMO Systems with Arbitrary-Rank Channel Means. IEEE J. Sel. Top. Signal Process. 2014, 8, 966–981. [Google Scholar] [CrossRef] [Green Version]
  21. Zhang, J.; Dai, L.; He, Z.; Jin, S.; Li, X. Performance Analysis of Mixed-ADC Massive MIMO Systems Over Rician Fading Channels. IEEE J. Sel. Areas Commun. 2017, 35, 1327–1338. [Google Scholar] [CrossRef] [Green Version]
  22. Ravindran, N.; Jindal, N.; Huang, H.C. Beamforming with Finite Rate Feedback for LOS MIMO Downlink Channels. In Proceedings of the IEEE GLOBECOM 2007—IEEE Global Telecommunications Conference, Washington, DC, USA, 26–30 November 2007; pp. 4200–4204. [Google Scholar] [CrossRef] [Green Version]
Figure 1. System model of a one-hop MIMO system under Rayleigh channels.
Figure 1. System model of a one-hop MIMO system under Rayleigh channels.
Entropy 23 01074 g001
Figure 2. System model of a two-hop MIMO system under Rician channels.
Figure 2. System model of a two-hop MIMO system under Rician channels.
Entropy 23 01074 g002
Figure 3. Achievable sum rate with different N R 1 .
Figure 3. Achievable sum rate with different N R 1 .
Entropy 23 01074 g003
Figure 4. Achievable sum rate with different Quantization Bits q.
Figure 4. Achievable sum rate with different Quantization Bits q.
Entropy 23 01074 g004
Figure 5. ADC Energy Efficiency with different Quantization Bits q.
Figure 5. ADC Energy Efficiency with different Quantization Bits q.
Entropy 23 01074 g005
Figure 6. Asymptotic achievable sum rates with Different Scaling Indexes.
Figure 6. Asymptotic achievable sum rates with Different Scaling Indexes.
Entropy 23 01074 g006
Table 1. Quantization distortion factor ρ under Different ADC quantization bits q. According to [10,16,17], the values of ρ ( ρ 1 , ρ 2 ) when the number of quantization bits q 5 is as follows.
Table 1. Quantization distortion factor ρ under Different ADC quantization bits q. According to [10,16,17], the values of ρ ( ρ 1 , ρ 2 ) when the number of quantization bits q 5 is as follows.
q12345
ρ , ρ 1 , ρ 2 0.36340.11750.034540.0094970.002499
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Yu, S.; Liu, X.; Cao, J.; Zhang, Y. Low-Resolution ADCs for Two-Hop Massive MIMO Relay System under Rician Channels. Entropy 2021, 23, 1074. https://0-doi-org.brum.beds.ac.uk/10.3390/e23081074

AMA Style

Yu S, Liu X, Cao J, Zhang Y. Low-Resolution ADCs for Two-Hop Massive MIMO Relay System under Rician Channels. Entropy. 2021; 23(8):1074. https://0-doi-org.brum.beds.ac.uk/10.3390/e23081074

Chicago/Turabian Style

Yu, Shujuan, Xinyi Liu, Jian Cao, and Yun Zhang. 2021. "Low-Resolution ADCs for Two-Hop Massive MIMO Relay System under Rician Channels" Entropy 23, no. 8: 1074. https://0-doi-org.brum.beds.ac.uk/10.3390/e23081074

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop