Ultra-Reliable and Low-Latency Wireless Hierarchical Federated Learning: Performance Analysis

Abstract

Wireless hierarchical federated learning (WHFL) is an implementation of wireless federated Learning (WFL) on a cloud–edge–client hierarchical architecture that accelerates model training and achieves more favorable trade-offs between communication and computation. However, due to the broadcast nature of wireless communication, the WHFL is susceptible to eavesdropping during the training process. Apart from this, recently ultra-reliable and low-latency communication (URLLC) has received much attention since it serves as a critical communication service in current 5G and upcoming 6G, and this motivates us to study the URLLC-WHFL in the presence of physical layer security (PLS) issue. In this paper, we propose a secure finite block-length (FBL) approach for the multi-antenna URLLC-WHFL, and characterize the relationship between privacy, utility, and PLS of the proposed scheme. Simulation results show that when the eavesdropper’s CSI is perfectly known by the edge server, our proposed FBL approach not only almost achieves perfect secrecy but also does not affect learning performance, and further shows the robustness of our schemes against imperfect CSI of the eavesdropper’s channel. This paper provides a new method for the URLLC-WHFL in the presence of PLS.

1. Introduction

Wireless federated learning (WFL), which allows the training of machine learning (ML) models on a large corpus of decentralized data stored on mobile devices [1], has attracted significant research interest. Currently, WFL primarily aims to enhance communication efficiency [2,3,4,5,6], improve privacy and security [7,8,9], investigate a balance between privacy and utility [10,11,12,13,14], manage power control for wireless devices [15,16], and design effective beamforming strategies [17]. To optimize the processing power of edge and cloud servers, a hierarchical federated learning (HFL) system involving clients, edge servers, and cloud servers has been proposed in [18]. Compared to FL systems relying on a single server, HFL reduces the computational load [19,20,21], lowers user-to-cloud server communication costs [18,19,20,21,22,23], decreases FL processing time [18], and improves privacy and security in FL [22,23]. Specifically, since the convergence performance of the HFL system is theoretically proved in [18], joint user scheduling and wireless resource allocation are established to improve both communication and energy efficiency [19,20,21]. To enhance privacy in wireless hierarchical federated learning (WHFL), ref. [22] introduced a method based on local differential privacy (LDP) that involves artificial noise into the shared model parameters at two stages. Additionally, ref. [24] considered the influence of device mobility on the learning performance of WHFL systems.

The broadcast nature of wireless communication renders WFL susceptible to eavesdropping. As a result, tackling the challenge of WFL in the presence of physical layer security (PLS) is a significant issue. Different from the privacy requirement of the FL that the information leakage between users and servers does not need to be arbitrarily small due to the accuracy of data analysis, the information leakage to the eavesdropper should vanish, which is also known as the PLS requirement [25]. The current research in WFL in the presence of PLS [26,27,28,29] primarily focuses on enhancing the security of data through resource allocation and artificial jamming techniques. Specifically, reference [26] focuses on optimizing the power control of drones to enhance the security rate of the WFL system, considering constraints such as WFL training time and battery capacity of the drone. In [27], a method for achieving secrecy in WFL was proposed via using cooperative jamming, which involves the cooperative provision of jamming signals by users to counteract eavesdropping attempts and enhance security. Ref. [28] proposed the method of using conventional wireless devices to form a non-orthogonal multiple access (NOMA) transmission group with an edge device for secrecy-enhanced mobile edge computing, and the devices provide cooperative jamming to an eavesdropper while transmitting data to a cellular base station. In [29], a power allocation algorithm is proposed for WFL, where the transmitting power is divided proportionally between the transmitted signal and artificial noise to maximize the secrecy rate while satisfying the model performance requirement. Apart from this, ref. [30] proposed a PLS measure while considering the privacy-utility constraints in WFL.

Very recently, ultra-reliable and low-latency communication (URLLC) has attracted significant attention, as it serves as a critical communication service in fifth-generation (5G) and sixth-generation (6G) cellular networks. One essential technology for URLLC is short-sized packet communication [31], which indicates that the coding block length should be finite, and finite block-length (FBL) coding [32] provides an effective way for this scenario. Currently, the study of WFL combined with URLLC includes the design of a multi-level architecture to satisfy URLLC requirements [33], and the application of WFL in vehicular networks while considering URLLC constraints [34]. To the best of the authors’ knowledge, the practical FBL scheme for the WFL remains unknown. Then it is natural to ask: is there any practical FBL scheme for the WHFL in the presence of PLS, if yes, what is the relationship between PLS, privacy, and utility in WHFL systems while considering URLLC requirements?

One possible solution to the aforementioned question is a channel feedback coding scheme. The study of channel feedback scheme started from [35], where an elegant feedback coding scheme called the Schalkwijk–Kailath (SK) scheme was proposed for additive white Gaussian noise (AWGN) channel with noiseless feedback. In this scheme, the transmitter sends the original message only in the initial transmission. In the subsequent round, the receiver sends an estimate of the original message to the transmitter via a noiseless feedback channel. The transmitter sends an amplified version of the estimation error back to the receiver, and the receiver obtains an estimate of the estimation error by using the minimum mean square error (MMSE). After a predetermined number of rounds, the receiver uses the minimum distance rule to decode the message. It was shown that the SK scheme [35] is not only capacity-achieving but also its decoding error probability doubly exponentially decays to zero as the coding block length increases, which indicates that the SK scheme requires an extremely short coding block length to achieve a desired decoding error probability. Furthermore, ref. [36] showed that the SK scheme achieves perfect weak secrecy by itself, i.e., the SK scheme satisfies PLS requirement by itself. Recently, ref. [37] showed that the SK scheme [35] is almost the optimal FBL scheme for the AWGN channel with feedback, which indicates that it may be a good choice for URLLC.

However, note that the application of the SK scheme to the wireless fading channel still has a long way to go since it is based on the assumption that the feedback channel is a noiseless channel. Apart from this, in wireless communication, the channel feedback is often utilized to transmit channel state information (CSI) back to the device for each uplink transmission [17], and this allows the device to adjust its transmission parameters based on the received feedback. Then it is natural to ask: Can we utilize the channel feedback not only for CSI transmission but also for designing an FBL approach for the multi-antenna URLLC-WHFL in the presence of PLS, i.e., is it possible to extend the classical SK scheme to the multi-antenna URLLC-WHFL in the presence of PLS?

In this paper, we answer the aforementioned questions by studying the WHFL in the presence of PLS. Figure 1 illustrates the collaborative training of a learning model by users, edge servers, and cloud servers. To preserve privacy, a local differential privacy (LDP) mechanism [38] is utilized by adding Gaussian noise to each user’s gradient before aggregating all gradients to the edge servers. Furthermore, communication between each edge server and the cloud server over a quasi-static fading duplex channel, which, due to the inherent broadcast characteristics of wireless communication, is eavesdropping by an external eavesdropper. Our primary objective is to ensure that the polluted gradient data retains a certain amount of utility while minimizing privacy leakage to the cloud server and protecting the gradient data transmitted from edge servers to the cloud server from eavesdropping. A straightforward way to achieve the above goal is for the edge servers to securely encode the polluted data gradients as codewords and transmit them into wireless duplex fading channels. The cloud server can successfully decode the polluted data gradients, while the eavesdropper obtains no information about them. In this way, the PLS and the privacy of the data can simultaneously be guaranteed since the real data gradients are protected by the LDP mechanism.

Our key contributions to this paper are summarized as follows:

• We propose an FBL approach for multi-antenna WHFL in the presence of PLS. In this approach, the feedback link is not only utilized for CSI transmission but also used to send the cloud server’s MMSE about the transmitted polluted data gradient back to the edge server. The key idea of the proposed scheme is to apply the modulo-lattice operation (MLO) [39] to eliminate the impact of feedback channel noise on the performance of the SK scheme [35], and further extend the SK-type scheme to a two-dimensional situation, which performs well in the SISO fading channel. Then further applying pre-coding, beamforming, and singular value decomposition (SVD) techniques to the extended scheme for the SISO case, the FBL coding scheme for the multi-antenna WHFL is obtained.

• We derive the achievable secrecy rate of our proposed scheme and characterize the relationship between PLS, privacy, and utility of our scheme. Moreover, given fixed decoding error probability and coding block length, we establish lower and upper bounds on the LDP noise variance that ensure certain privacy, utility, and secrecy levels of PLS.

To obtain a better understanding of the contribution of this paper and the related works studied in the literature, the following Table 1 summarizes the study of WFL in the presence of privacy, utility, PLS, and URLLC in the literature.

The remainder of this paper is organized as follows. In Section 2, the definitions, system model, and main results are given. The FBL approach for the MIMO case is shown in Section 3. FBL approaches for the SIMO/MISO cases are proposed in Section 4. Simulation results are shown in Section 5. Section 6 summarizes all results in this paper and discusses future work.

2. Definitions, System Model and Main Results

2.1. WHFL System

Figure 1 illustrates a system composed of $K_{\mathrm{tot}}$ users, L edge servers indexed by ℓ and a cloud server. The disjoint user sets are denoted as ${\left\{{\mathcal{C}}_{\ell }\right\}}_{\ell =1}^L$, and $K=|{\mathcal{C}}_{\ell }|$ representing the number of users in edge server ℓ. The distributed datasets are represented by ${\left\{{\mathcal{S}}_{\ell ,k}\right\}}_{k=1}^{|{\mathcal{C}}_{\ell }|}$, where $S_{\ell ,k}=\left|{\mathcal{S}}_{\ell ,k}\right|$ is the size of ${\mathcal{S}}_{\ell ,k}$. Each dataset ${\mathcal{S}}_{\ell ,k}$ is defined as ${\left\{({\mathbf{u}}_{k,j},v_{k,j})\right\}}_{j=1}^{|{\mathcal{S}}_{\ell ,k}|}$, where ${\mathbf{u}}_{k,j}$ represents the j-th input sample and $v_{k,j}$ is the corresponding label. ${\mathcal{S}}_{\ell }$ is the aggregated dataset of edge server ℓ, and the gradients from each user are aggregated by their corresponding edge server. The global loss function $F\left(\mathbf{m}\right)$ is defined as follows:

(1)$\begin{array}{c}\hfill F\left(\mathbf{m}\right)={\displaystyle \frac{1}{S}}\sum _{\ell =1}^L\sum _{k=1}^{|{\mathcal{C}}_{\ell }|}{S}_{\ell ,k}{F}_{\ell ,k}\left(\mathbf{m}\right),\end{array}$

where model vector $\mathbf{m}\in {\mathbb{R}}^q$ and $S={\sum }_{\ell }{\sum }_k{S}_{\ell ,k}$. The local loss function is given by the following:

(2)$\begin{array}{c}\hfill F_{\ell ,k}\left(\mathbf{m}\right)={\displaystyle \frac{1}{S_{\ell ,k}}}\sum _{({\mathbf{u}}_{k,j},v_{k,j})\in {\mathcal{S}}_{\ell ,k}}f(\mathbf{m};{\mathbf{u}}_{k,j},v_{k,j}),\end{array}$

where $f(\mathbf{m};{\mathbf{u}}_{k,j},v_{k,j})$ represents the sample-wise loss function. The goal of model training is to minimize the global loss function, as follows:

(3)$\begin{array}{c}\hfill {\mathbf{m}}^{★}=arg\underset{\mathbf{m}}{min}F\left(\mathbf{m}\right).\end{array}$

To achieve this, we employ a distributed gradient descent iterative algorithm. Specifically, in the t-th ($t\in \{1,2,\dots ,T\}$) communication round, the cloud server broadcasts the current global model vector ${\mathbf{m}}_t$ to all users, and every user has perfect knowledge of ${\mathbf{m}}_t$. Each user k then computes its local gradient $\nabla F_{\ell ,k}\left({\mathbf{m}}_t\right)$ using its dataset ${\mathcal{S}}_{\ell ,k}$ and the current model ${\mathbf{m}}_t$. Once the edge server ℓ receives all the noisy local gradients from its users, which have been perturbed by Gaussian noise for LDP, it computes an estimation of the partial gradient as follows:

(4)$\begin{array}{c}\hfill \nabla F_{\ell }\left({\mathbf{m}}_t\right)={\displaystyle \frac{1}{S_{\ell }}}\sum _{k\in {\mathcal{C}}^{\ell }}{S}_{\ell ,k}\nabla F_{\ell ,k}\left({\mathbf{m}}_t\right),\end{array}$

where $S_{\ell }=\left|{\mathcal{S}}_{\ell }\right|$ denotes the size of ${\mathcal{S}}_{\ell }$. Then, the cloud server aggregates the partial gradient estimates from all edge servers to compute the estimation $\widehat{\nabla F}\left({\mathbf{m}}_t\right)$ of the global gradient, as follows:

(5)$\begin{array}{c}\hfill \nabla F\left({\mathbf{m}}_t\right)={\displaystyle \frac{1}{S}}\sum _{\ell =1}^L{S}_{\ell }\nabla F_{\ell }\left({\mathbf{m}}_t\right),\end{array}$

and updates the global model ${\mathbf{m}}_{t+1}$ by the following:

(6)$\begin{array}{c}\hfill {\mathbf{m}}_{t+1}={\mathbf{m}}_t-\mu \widehat{\nabla F}\left({\mathbf{m}}_t\right),\end{array}$

where $\mu$ denotes the learning rate.

2.2. Model Formulation

An information-theoretic model of WHFL system is shown in Figure 2. Without loss of generality, we adopt the following assumptions:

Assumption 1.

The communication of any individual edge server to the cloud server is not affected by other edge servers, and the downlink transmission from the cloud server to the edge servers is reliable [16]. Furthermore, we consider that an external eavesdropper targets the information transmitted during the uplink communication from the edge servers to the cloud server. Consequently, this paper primarily focuses on the PLS of the T rounds of uplink communication from one edge server to the cloud server.

Assumption 2.

The channels are quasi-static fading.

Assumption 3.

Following similar arguments in [3,9,16,17], we assume that the perfect CSI of the feedforward and feedback channels is known by both the cloud server and the edge server. Here note that this assumption is well-justified from a practical standpoint. For the feedforward channel, the channel training for estimating CSI at the cloud server can be achieved by transmitting pilot sequences from the edge servers, and the channel estimation is perfect when the length of the pilot sequences is sufficiently large [40]. On the other hand, when the cloud server transmits the perfectly estimated CSI to the edge server through the feedback channel, only a few feedback bits are required. By using a code with a low coding rate and high error-correcting capability, the probability of feedback error can be negligible [41] and, hence, the CSI of the feedforward channel is perfectly known by the transceiver. For the feedback channel, the perfect CSI sharing between transceivers can be realized in a similar way.

2.2.1. Privacy-Utility

In Figure 2, let ${\mathit{W}}_{t,k}={\sum }_{j=1}^{S_{\ell ,k}}\nabla f({\mathbf{m}}_t;{\mathbf{u}}_{k,j},v_{k,j})={(W_{t,k,1},\dots ,W_{t,k,q})}^{\mathcal{T}}\in {\mathbb{R}}^q$ represent the overall local gradient vector for user k ($k\in \{\mathrm{1,2},\dots ,K\}$) during the t-th ($t\in \{\mathrm{1,2},\dots ,T\}$) communication round, where $\nabla f({\mathbf{m}}_t;{\mathbf{u}}_{k,j},v_{k,j})={(\nabla f_1({\mathbf{m}}_t;{\mathbf{u}}_{k,j},v_{k,j}),\dots ,\nabla f_q({\mathbf{m}}_t;{\mathbf{u}}_{k,j},v_{k,j}))}^{\mathcal{T}}$ and $W_{t,k,i}={\sum }_{j=1}^{S_{\ell ,k}}\nabla f_i({\mathbf{m}}_t;{\mathbf{u}}_{k,j},v_{k,j})$ ($i\in \{\mathrm{1,2},\dots ,q\}$). Following [42], assume that $\nabla f({\mathbf{m}}_t;$${\mathbf{u}}_{k,j},v_{k,j})$ is independent and identically distributed (i.i.d.) and $\nabla f({\mathbf{m}}_t;$${\mathbf{u}}_{k,j},v_{k,j})\sim \mathcal{N}(0,{\sigma }_{w,t}^2\mathit{I})$, which indicates that ${\mathit{W}}_{t,k}\sim \mathcal{N}(0,S_{\ell ,k}{\sigma }_{w,t}^2\mathit{I})$. The i.i.d. generated local Gaussian noise ${\mathsf{\eta }}_{t,k}={({\eta }_{t,k,1},\dots ,{\eta }_{t,k,q})}^{\mathcal{T}}$ follows distribution $\mathcal{N}(0,{\sigma }^2\mathit{I})$ and is independent of ${\mathit{W}}_{t,k}$. The edge server aggregates the corrupted local gradient, and it is defined as follows:

(7)$\begin{array}{ccc}\hfill & & {\mathit{W}}_{t,k}^{\prime }={\mathit{W}}_{t,k}+{\mathsf{\eta }}_{t,k},\hfill \end{array}$

where ${\mathit{W}}_{t,k}^{\prime }\sim \mathcal{N}(0,(S_{\ell ,k}{\sigma }_{w,t}^2+{\sigma }^2)\mathit{I})$. The overall local gradients and noise for the t-th round are ${\mathit{W}}_t={(W_{t,1},\dots ,W_{t,q})}^{\mathcal{T}}$ and ${\mathsf{\eta }}_t={({\eta }_{t,1},\dots ,{\eta }_{t,q})}^{\mathcal{T}}$, respectively, where $W_{t,i}={\sum }_{k=1}^K{W}_{t,k,i}$, ${\eta }_{t,i}={\sum }_{k=1}^K{\eta }_{t,k,i}$ and $i\in \{\mathrm{1,2},\dots ,q\}$. Consequently, from (7), the overall corrupted local gradients for the t-th round are ${\mathit{W}}_t^{\prime }={(W_{t,1}^{\prime },\dots ,W_{t,q}^{\prime })}^{\mathcal{T}}$, where $W_{t,i}^{\prime }={\sum }_{k=1}^K{W}_{t,k,i}^{\prime }$ and $i\in \{\mathrm{1,2},\dots ,q\}$. Due to the fact that ${\mathit{W}}_{t,k}$ and ${\mathsf{\eta }}_{t,k}$ are i.i.d. and independent, the overall corrupted gradients ${\mathit{W}}_t^{\prime }$ are i.i.d. and distributed as $\mathcal{N}(0,(S_{\ell }{\sigma }_{w,t}^2+K{\sigma }^2)\mathit{I})$, where $S_{\ell }={\sum }_{k=1}^K{S}_{\ell ,k}$.

Definition 1

(Mutual information privacy [43]). For every $t\in \{1,\dots ,T\}$, if the mutual information ${\displaystyle \frac{1}{q}}I({\mathit{W}}_t;{\mathit{W}}_t^{\prime })$ during the t-th round is upper bounded by ϵ, namely, $\underset{t\in \{1,\dots ,T\}}{max}{\displaystyle \frac{1}{q}}I({\mathit{W}}_t;{\mathit{W}}_t^{\prime })\le ϵ$, the LDP mechanism is said to satisfy ϵ-mutual information privacy for $ϵ>0$.

Definition 2

(Utility [44]). The utility of ${\mathit{W}}_t^{\prime }$ is defined by the distortion between ${\mathit{W}}_t$ and ${\mathit{W}}_t^{\prime }$, and in this paper, we consider the quadratic distortion $d({\mathit{W}}_t,{\mathit{W}}_t^{\prime })=\left|\right|{\mathit{W}}_t^{\prime }-{\mathit{W}}_t{\left|\right|}^2$. If ${\displaystyle \frac{1}{qT}}{\sum }_{t=1}^{T}E\left(d\right({\mathit{W}}_t,$ ${\mathit{W}}_t^{\prime }\left)\right)\le \upsilon$, the utility of ${\mathit{W}}_t^{\prime }$ is determined by υ, where the utility and the distortion have an inverse relationship with each other, i.e., smaller υ corresponds to larger utility.

2.2.2. Gradient Compression

We employ lossy Gaussian source coding characterized by a quadratic distortion metric, defined as $d({\mathit{W}}_t^{\prime },{\widehat{\mathit{W}}}_t^{\prime })=\left|\right|{\mathit{W}}_t^{\prime }-{\widehat{\mathit{W}}}_t^{\prime }{\left|\right|}^2$ (the source encoder and decoder are respectively located at the edge server and cloud server), where ${\widehat{\mathit{W}}}_t^{\prime }$ is the output of the source decoder at the cloud server. Following [45] (Chapter 3.8, pp. 64–65), the edge server’s source encoder maps ${\mathit{W}}_t^{\prime }$ to $\{\mathrm{1,2},\dots ,2^{q{R}_t\left(D\right)}\}$ and compresses ${\mathit{W}}_t^{\prime }$ into an index $W_t^{″}$ that is uniformly distributed over ${\mathcal{W}}_t^{″}=\{1,2,\dots ,2^{q{R}_t\left(D\right)}\}$. The rate-distortion function $R_t\left(D\right)$ is defined as follows:

(8)$\begin{array}{c}\hfill R_t\left(D\right)=\left\{\begin{array}{cc}{\displaystyle \frac{1}{2}}log{\displaystyle \frac{K{\sigma }^2+S_{\ell }{\sigma }_{w,t}^2}{D}}\hfill & 0\le D<K{\sigma }^2+S_{\ell }{\sigma }_{w,t}^2\hfill \\ 0\hfill & D\ge K{\sigma }^2+S_{\ell }{\sigma }_{w,t}^2,\hfill \end{array}\right.\end{array}$

where ${\displaystyle \frac{1}{qT}}{\sum }_{t=1}^{T}E\left(d({\mathit{W}}_t^{\prime },{\widehat{\mathit{W}}}_t^{\prime })\right)\le D$. For the cloud server’s source decoder, the decoding mapping transforms the indices $\{\mathrm{1,2},\dots ,2^{q{R}_t\left(D\right)}\}$ into ${\widehat{\mathit{W}}}_t^{\prime }$. Here note that when $R_t\left(D\right)=0$, no message is transmitted, and ${\widehat{\mathit{W}}}_t^{\prime }$ is set to 0.

2.2.3. Communication Model

At the t-th round, the channel input-output relationships are expressed as follows:

(9)$\begin{array}{c}{\mathit{Y}}_i\left(t\right)=\mathit{h}{\mathit{X}}_i\left(t\right)+{\mathsf{\eta }}_{1,i}\left(t\right),1\le i\le N_t,\end{array}$

(10)$\begin{array}{c}{\tilde{\mathit{Y}}}_i\left(t\right)=\tilde{\mathit{h}}{\tilde{\mathit{X}}}_i\left(t\right)+{\mathsf{\eta }}_{2,i}\left(t\right),1\le i\le N_t-1,\end{array}$

(11)$\begin{array}{c}{\mathit{Z}}_i\left(t\right)=\mathit{g}{\mathit{X}}_i\left(t\right)+\tilde{\mathit{g}}{\tilde{\mathit{X}}}_i\left(t\right)+{\mathsf{\eta }}_{e,i}\left(t\right),1\le i\le N_t,\end{array}$

where the input and output of the feedforward channel are denoted by ${\mathit{X}}_i\left(t\right)$ and ${\mathit{Y}}_i\left(t\right)$, respectively, the feedback channel’s input and output are ${\tilde{\mathit{X}}}_i\left(t\right)$ and ${\tilde{\mathit{Y}}}_i\left(t\right)$, respectively, and the eavesdropping channel’s output is ${\mathit{Z}}_i\left(t\right)$. Note that ${\mathit{X}}_i\left(t\right),{\tilde{\mathit{Y}}}_i\left(t\right)\in {\mathbb{C}}^{A\times 1}$, ${\tilde{\mathit{X}}}_i\left(t\right),{\mathit{Y}}_i\left(t\right)\in {\mathbb{C}}^{B\times 1}$ and ${\mathit{Z}}_i\left(t\right)\in {\mathbb{C}}^{C\times 1}$. The average power constraint for the input of the edge server ${\mathit{X}}_i\left(t\right)$ is ${\displaystyle \frac{1}{N_t}}{\sum }_{i=1}^{N_t}E\left[{\mathit{X}}_i^{\mathcal{H}}\left(t\right){\mathit{X}}_i\left(t\right)\right]\le P$, the input of the cloud server ${\tilde{\mathit{X}}}_i\left(t\right)$ is constrained by ${\displaystyle \frac{1}{N_t-1}}{\sum }_{i=1}^{N_t-1}E\left[{\tilde{\mathit{X}}}_i^{\mathcal{H}}\left(t\right){\tilde{\mathit{X}}}_i\left(t\right)\right]\le \tilde{P}$. The matrices $\mathit{h}\in {\mathbb{C}}^{B\times A}$, $\tilde{\mathit{h}}\in {\mathbb{C}}^{A\times B}$, $\mathit{g}\in {\mathbb{C}}^{C\times A}$, and $\tilde{\mathit{g}}\in {\mathbb{C}}^{C\times B}$ represent the CSI of the feedforward, feedback, and eavesdropping channels, respectively. The channel noises’ elements of ${\mathsf{\eta }}_{e,i}\left(t\right)\in {\mathbb{C}}^{C\times 1}$, ${\mathsf{\eta }}_{2,i}\left(t\right)\in {\mathbb{C}}^{A\times 1}$ and ${\mathsf{\eta }}_{1,i}\left(t\right)\in {\mathbb{C}}^{B\times 1}$ are i.i.d. and distributed as $\mathcal{CN}(0,{\sigma }_e^2)$, $\mathcal{CN}(0,{\sigma }_2^2)$ and $\mathcal{CN}(0,{\sigma }_1^2)$, respectively. The input message $W_t^{″}$ of the edge server is uniformly drawn in the set ${\mathcal{W}}_t^{″}$, and it is encoded as a codeword of length $N_t$. Furthermore, the input of the edge server is defined as ${\mathit{X}}_i\left(t\right)=f_{t,i}(W_t^{″},\mathit{h},\tilde{\mathit{h}},{\tilde{\mathit{Y}}}_1^{i-1}\left(t\right))$, where $f_{t,i}(·)$ is an encoding function and ${\tilde{\mathit{Y}}}_1^{i-1}\left(t\right)=({\tilde{\mathit{Y}}}_1\left(t\right),\dots ,{\tilde{\mathit{Y}}}_{i-1}\left(t\right))$. The cloud server estimates the message ${\widehat{w}}_t^{″}=\phi (\mathit{h},\tilde{\mathit{h}},{\mathit{Y}}^{N_t})$ using the decoding function $\phi$. The input of the cloud server is defined as ${\tilde{\mathit{X}}}_i\left(t\right)={\tilde{f}}_{t,i}(\mathit{h},{\mathit{Y}}_1^i\left(t\right),\tilde{\mathit{h}})$, where ${\tilde{f}}_{t,i}(·)$ is an encoding function and ${\mathit{Y}}_1^i\left(t\right)=({\mathit{Y}}_1\left(t\right),\dots ,{\mathit{Y}}_i\left(t\right))$. The average decoding error probability $P_{e,t}$ is given by the following:

(12)$\begin{array}{c}\hfill P_{e,t}={\displaystyle \frac{1}{|{\mathcal{W}}_t^{″}|}}\sum _{w_t^{″}\in {\mathcal{W}}_t^{″}}Pr\{\phi (\mathit{h},{\mathit{Y}}^{N_t},\tilde{\mathit{h}})\ne w_t^{″}|w_t^{″}\mathrm{s}\mathrm{e}\mathrm{n}\mathrm{t}\}.\end{array}$

Definition 3.

According to [46,47], the CSIs $\mathit{g}$ and $\tilde{\mathit{g}}$ of eavesdropping channels are defined as follows:

(13) $\begin{array}{c}\hfill \mathit{g}=\widehat{\mathit{g}}+{\mathsf{\Delta }\mathit{g},\left|\right|\mathsf{\Delta }\mathit{g}\left|\right|}_F\le \omega ,\tilde{\mathit{g}}=\widehat{\tilde{\mathit{g}}}+\mathsf{\Delta }\tilde{\mathit{g}},\left|\right|\mathsf{\Delta }\tilde{\mathit{g}}{\left|\right|}_F\le \tilde{\omega },\end{array}$

where $\widehat{\mathit{g}}\in {\mathbb{C}}^{C\times A},\widehat{\tilde{\mathit{g}}}\in {\mathbb{C}}^{C\times B}$ are the estimated CSI of $\mathit{g}$ and $\tilde{\mathit{g}}$, respectively. $\mathsf{\Delta }\mathit{g}$ and $\mathsf{\Delta }\tilde{\mathit{g}}$ represent the legal parties’ estimation errors about the perfect CSI of the eavesdropper’s channel, and these errors are respectively bounded by parameters $\omega >0$ and $\tilde{\omega }>0$. Here note that $\mathsf{\Delta }\mathit{g}=\mathsf{\Delta }\tilde{\mathit{g}}=\mathbf{0}$ corresponds to the situation that the legal parties obtain perfect CSI of the eavesdropper’s channel.

Definition 4.

The secrecy level of PLS [48] (the normalized uncertainty of the eavesdropper) is given by

(14) $\mathsf{\Delta }={\displaystyle \frac{H(W_1^{″},\dots ,W_T^{″}|{\mathit{Z}}^{N_1},\dots ,{\mathit{Z}}^{N_T},\mathit{h},\tilde{\mathit{h}},\mathit{g},\tilde{\mathit{g}})}{H(W_1^{″},\dots ,W_T^{″})}},0\le \mathsf{\Delta }\le 1.$

A transmission rate R is said to be $(\tau ,N,\delta ,D,\upsilon ,ϵ)$ achievable, if for given decoding error probability τ, block length N ($N={\sum }_{t=1}^T{N}_t$), secrecy level δ, ${\displaystyle \frac{1}{qT}}{\sum }_{t=1}^{T}E\left(d({\mathit{W}}_t^{\prime },{\widehat{\mathit{W}}}_t^{\prime })\right)\le D$, $\underset{t\in \{1,\dots ,T\}}{max}{\displaystyle \frac{1}{q}}I({\mathit{W}}_t;{\mathit{W}}_t^{\prime })\le ϵ$ and ${\displaystyle \frac{1}{qT}}{\sum }_{t=1}^{T}E\left(d({\mathit{W}}_t,{\mathit{W}}_t^{\prime })\right)\le \upsilon$, there exists a channel code described above such that we have the following:

(15) ${\displaystyle \frac{H(W_1^{″},\dots ,W_T^{″})}{N}}=R,{\displaystyle \frac{1}{T}}\sum _{t=1}^T{P}_{e,t}\le \tau ,\mathsf{\Delta }\ge \delta ,$

where $\delta \in [0,1]$, and $\delta =1$ represents the perfect secrecy. For the WHFL in SISO/SIMO/MISO/MIMO cases, the achievable secrecy transmission rates are respectively denoted by $R_{siso/simo/miso/mimo}(\tau ,N,$$\delta ,D,\upsilon ,ϵ)$, the channel gains are respectively defined by $h_{siso},{\tilde{h}}_{siso},g_{siso},{\tilde{g}}_{siso},{\mathit{h}}_{simo},{\tilde{\mathit{h}}}_{simo},{\mathit{g}}_{simo},$${\tilde{\mathit{g}}}_{simo},{\mathit{h}}_{miso},{\tilde{\mathit{h}}}_{miso},{\mathit{g}}_{miso},{\tilde{\mathit{g}}}_{miso}$, ${\mathit{h}}_{mimo},{\tilde{\mathit{h}}}_{mimo},{\mathit{g}}_{mimo}$, ${\tilde{\mathit{g}}}_{mimo}$, and the CSI estimation errors are defined by $\mathsf{\Delta }{g}_{siso}$, $\mathsf{\Delta }{\tilde{g}}_{siso}$, $\mathsf{\Delta }{\mathit{g}}_{simo}$, $\mathsf{\Delta }{\tilde{\mathit{g}}}_{simo}$, $\mathsf{\Delta }{\mathit{g}}_{miso}$, $\mathsf{\Delta }{\tilde{\mathit{g}}}_{miso}$, $\mathsf{\Delta }{\mathit{g}}_{mimo}$ and $\mathsf{\Delta }{\tilde{\mathit{g}}}_{mimo}$.

2.3. Main Results

Theorem 1.

For the MIMO WHFL with K users and T iterations, given that N, τ, υ, D, ϵ, δ, and applying the FBL approach in Section 3, the relationship between PLS, privacy, utility, and the noise variance of LDP is characterized by the following:

(16) $max\left\{\underset{\mathit{Secrecy}\mathit{level}\mathit{of}\mathit{PLS}}{\underbrace{\underset{\begin{array}{c}t\in \{1,\dots ,T\},\\ \mathsf{\Delta }{\mathit{g}}_{mimo}\end{array}}{max}\left[{\displaystyle \frac{D·2^{\frac{2}{q(1-\delta )}logdet\left(\mathit{I}+\frac{{\widehat{\mathit{g}}}_{mimo}{\mathit{K}}_{x_1}{\widehat{\mathit{g}}}_{mimo}^{\mathcal{H}}}{{\sigma }_e^2}\right)}-S_{\ell }{\sigma }_{w,t}^2}{K}}\right]}},\underset{\mathit{Privacy}\mathit{term}}{\underbrace{\underset{t\in \{1,\dots ,T\}}{max}\left[{\displaystyle \frac{S_{\ell }{\sigma }_{w,t}^2}{K(2^{2ϵ}-1)}}\right]}}\right\}\le \underset{\begin{array}{c}\hfill \mathit{LDP}\mathit{noise}\mathit{variance}\end{array}}{\underbrace{{\sigma }^2}}\le \underset{\begin{array}{c}\hfill \mathit{Utility}\mathit{term}\end{array}}{\underbrace{{\displaystyle \frac{\upsilon }{K}}}},$

where ${\widehat{\mathit{g}}}_{mimo}={\mathit{g}}_{mimo}-\mathsf{\Delta }{\mathit{g}}_{mimo}$, ${\mathit{K}}_{x_1}=E\left({\mathit{X}}_1\left(t\right){\mathit{X}}_1^{\mathcal{H}}\left(t\right)\right)$. In addition, an achievable transmission rate $R_{mimo}(\tau ,N,\delta ,D,\upsilon ,ϵ)$ of our proposed FBL approach is given by the following:

(17) $R_{mimo}(\tau ,N,\delta ,D,\upsilon ,ϵ)={\displaystyle \frac{{\sum }_{t=1}^T{N}_t{R}_t}{N}},$

where

(18) $\begin{array}{c}N=\sum _{t=1}^T{N}_t,R_t=\underset{\begin{array}{c}{\sum }_{j=1}^J{P}_j=P\\ {\sum }_{j=1}^J{\tilde{P}}_j=\tilde{P}\end{array}}{max}\sum _{j=1}^J{\displaystyle \frac{1}{N_t}}log\left({\displaystyle \frac{3{\mathit{SNR}}_j{d}_j^2}{{\left[Q^{-1}\left(\frac{\tau }{8J}\right)\right]}^2}}{\left(1+{\displaystyle \frac{{\mathit{SNR}}_j{d}_j^2}{{\mathsf{\Psi }}_1{\mathsf{\Psi }}_2}}\right)}^{N_t-1}\right),\end{array}$

(19) $\begin{array}{c}{\mathsf{\Psi }}_1=1+\xi {\displaystyle \frac{d_j^2{\mathit{SNR}}_j}{{\tilde{d}}_j^2{\widetilde{\mathit{SNR}}}_j}},{\mathsf{\Psi }}_2={\left(1-{\displaystyle \frac{\xi }{{\tilde{d}}_j^2{\widetilde{\mathit{SNR}}}_j}}\right)}^{-1},\xi ={\displaystyle \frac{1}{3}}{\left[Q^{-1}\left({\displaystyle \frac{\tau }{8J(N_t-1)}}\right)\right]}^2,\end{array}$

and ${\mathit{SNR}}_j={\displaystyle \frac{P_j}{{\sigma }_1^2}}$, ${\widetilde{\mathit{SNR}}}_j={\displaystyle \frac{{\tilde{P}}_j}{{\sigma }_2^2}}$, $d_j$, ${\tilde{d}}_j$, $P_j$, and ${\tilde{P}}_j$ are defined in Section 3.

Proof of Theorem 1. 

Our FBL approach for the MIMO WHFL is an extension of the classical SK scheme for the AWGN channel with noiseless feedback. The key to this extension is composed of three parts:

• The two-dimensional message mapping method, which maps the message to a complex codeword transmitted over the fading channels.

• An SVD-based pre-coding strategy that divides the MIMO channel into several parallel SISO channels.

• The two-dimensional modulo-lattice operation (MLO) that eliminates the impact of feedback channel noise on the performance of the SK scheme.

Details about the above tools and how to combine these tools to show our FBL approach for the MIMO WHFL are given in the next section, and the formal proof of Theorem 1 is in Appendix A. □

Remark 1.

Here note that in the FBL approach for the MIMO WHFL, we apply an SVD-based pre-coding strategy to divide the MIMO channel into several parallel SISO channels, which indicates that the FBL approach for the SISO WHFL can be directly obtained since it is a special case of the approach for the MIMO WHFL. The following Corollary 1 proposes an FBL approach for the SISO WHFL and characterizes the relationship between PLS, privacy, utility, and the noise variance of LDP. Since Corollary 1 can be directly obtained from Theorem 1, we omit the detailed proof here.

Corollary 1.

For the SISO WHFL with K users and T iterations, given N, τ, υ, D, ϵ, δ, and using a similar FBL approach to that of Theorem 1, the relationship between PLS, privacy, utility, and the noise variance of LDP is characterized by the following:

(20) $max\left\{\underset{\mathit{Secrecy}\mathit{level}\mathit{of}\mathit{PLS}}{\underbrace{\underset{\begin{array}{c}t\in \{1,\dots ,T\},\\ \mathsf{\Delta }{g}_{siso}\end{array}}{max}\left[{\displaystyle \frac{D·2^{\frac{2}{q(1-\delta )}log\left(1+\frac{|{\widehat{g}}_{siso}{|}^{2}P}{{\sigma }_e^2}\right)}-S_{\ell }{\sigma }_{w,t}^2}{K}}\right]}},\underset{\mathit{Privacy}\mathit{term}}{\underbrace{\underset{t\in \{1,\dots ,T\}}{max}\left[{\displaystyle \frac{S_{\ell }{\sigma }_{w,t}^2}{K(2^{2ϵ}-1)}}\right]}}\right\}\le \underset{\begin{array}{c}\hfill \mathit{LDP}\mathit{noise}\mathit{variance}\end{array}}{\underbrace{{\sigma }^2}}\le \underset{\mathit{Utility}\mathit{term}}{\underbrace{{\displaystyle \frac{\upsilon }{K}}}},$

where ${\widehat{g}}_{siso}=g_{siso}-\mathsf{\Delta }{g}_{siso}$. Furthermore, an achievable transmission rate $R_{siso}(\tau ,N,\delta ,D,\upsilon ,ϵ)$ of our proposed FBL approach is given by the following:

(21) $\begin{array}{c}\hfill R_{siso}(\tau ,N,\delta ,D,\upsilon ,ϵ)={\displaystyle \frac{{\sum }_{t=1}^T{N}_t{R}_t}{N}},R_t={\displaystyle \frac{1}{N_t}}log\left({\displaystyle \frac{3\mathit{SNR}|h_{siso}{|}^2}{{\left[Q^{-1}\left(\frac{\tau }{8}\right)\right]}^2}}{\left(1+{\displaystyle \frac{\mathit{SNR}|h_{siso}{|}^2}{{\mathsf{\Psi }}_3{\mathsf{\Psi }}_4}}\right)}^{N_t-1}\right),\end{array}$

where $N={\sum }_{t=1}^T{N}_t$, ${\mathsf{\Psi }}_3=1+{\xi }^{★}{\displaystyle \frac{|h_{siso}{|}^2\mathit{SNR}}{|{\tilde{h}}_{siso}{|}^2\widetilde{\mathit{SNR}}}}$, ${\mathsf{\Psi }}_4={\left(1-{\displaystyle \frac{{\xi }^{★}}{|{\tilde{h}}_{siso}{|}^2\widetilde{\mathit{SNR}}}}\right)}^{-1}$, ${\xi }^{★}={\displaystyle \frac{1}{3}}{\left[Q^{-1}\left({\displaystyle \frac{\tau }{8(N_t-1)}}\right)\right]}^2$, $\mathit{SNR}={\displaystyle \frac{P}{{\sigma }_1^2}}$, $\widetilde{\mathit{SNR}}={\displaystyle \frac{\tilde{P}}{{\sigma }_2^2}}$, and $|h_{siso}|$, $|{\tilde{h}}_{siso}|$, $|{\widehat{g}}_{siso}|$ represent the modulus of $h_{siso}$, ${\tilde{h}}_{siso}$ and ${\widehat{g}}_{siso}$, respectively.

Theorem 2.

For the SIMO WHFL with K users and T iterations, given N, τ, υ, D, ϵ, δ, and using the FBL approach in Section 4, the relationship between PLS, privacy, utility, and the noise variance of LDP is characterized by the following:

(22) $\begin{array}{c}\hfill max\left\{\underset{\mathit{Secrecy}\mathit{level}\mathit{of}\mathit{PLS}}{\underbrace{\underset{\begin{array}{c}t\in \{1,\dots ,T\},\\ \mathsf{\Delta }{g}_{simo}\end{array}}{max}\left[{\displaystyle \frac{D·2^{\frac{2}{q(1-\delta )}log\left(1+\frac{\left|\right|{\widehat{\mathit{g}}}_{simo}{\left|\right|}^{2}P}{{\sigma }_e^2}\right)}-S_{\ell }{\sigma }_{w,t}^2}{K}}\right]}},\underset{\mathit{Privacy}\mathit{term}}{\underbrace{\underset{t\in \{1,\dots ,T\}}{max}\left[{\displaystyle \frac{S_{\ell }{\sigma }_{w,t}^2}{K(2^{2ϵ}-1)}}\right]}}\right\}\le \underset{\begin{array}{c}\hfill \mathit{LDP}\mathit{noise}\mathit{variance}\end{array}}{\underbrace{{\sigma }^2}}\le \underset{\mathit{Utility}\mathit{term}}{\underbrace{{\displaystyle \frac{\upsilon }{K}}}},\end{array}$

where ${\widehat{\mathit{g}}}_{simo}={\mathit{g}}_{simo}-\mathsf{\Delta }{\mathit{g}}_{simo}$. In addition, an achievable transmission rate $R_{simo}(\tau ,N,\delta ,D,\upsilon ,ϵ)$ of our proposed FBL approach is given by the following:

(23) $\begin{array}{c}\hfill R_{simo}(\tau ,N,\delta ,D,\upsilon ,ϵ)={\displaystyle \frac{{\sum }_{t=1}^T{N}_t{R}_t}{N}},R_t={\displaystyle \frac{1}{N_t}}log\left({\displaystyle \frac{3\mathit{SNR}\left|\right|{\mathit{h}}_{simo}{\left|\right|}^2}{{\left[Q^{-1}\left(\frac{\tau }{8}\right)\right]}^2}}{\left(1+{\displaystyle \frac{\mathit{SNR}\left|\right|{\mathit{h}}_{simo}{\left|\right|}^2}{{\mathsf{\Psi }}_5{\mathsf{\Psi }}_6}}\right)}^{N_t-1}\right),\end{array}$

where ${\mathsf{\Psi }}_5=1+{\xi }^{★}{\displaystyle \frac{\left|\right|{\mathit{h}}_{simo}{\left|\right|}^2\mathit{SNR}}{\left|\right|{\tilde{\mathit{h}}}_{simo}{\left|\right|}^2\widetilde{\mathit{SNR}}}}$, ${\mathsf{\Psi }}_6={\left(1-{\displaystyle \frac{{\xi }^{★}}{\left|\right|{\tilde{\mathit{h}}}_{simo}{\left|\right|}^2\widetilde{\mathit{SNR}}}}\right)}^{-1}$, SNR, $\widetilde{\mathit{SNR}}$, N, and ${\xi }^{★}$ are given in Corollary 1.

Proof of Theorem 2. 

The difference between the approaches in Theorems 1 and 2 is that for the SIMO case, we use a beamforming strategy together with a new pre-coding strategy instead of the SVD-based pre-coding strategy used for the MIMO case. Here the beamforming and new pre-coding strategies respectively transform the feedforward and feedback channels into SISO channels. Then, along the lines of the encoding-decoding procedure in Section 3.1.3, the FBL approach for the SIMO WHFL is obtained, and the detail about this approach is in Section 4. Finally, since the proof of Theorem 2 is included in that of Theorem 1, we omit the formal proof here. □

Remark 2.

Here, note that in the SIMO WHFL, a beamforming strategy transforms the SIMO feedforward channel into the SISO feedforward channel, while a new pre-coding strategy transforms the MISO feedback channel into the SISO feedback channel. Analogously, for the MISO WHFL, first, we apply the pre-coding strategy of the SIMO WHFL to transform the MISO feedforward channel into the SISO feedforward channel, and the beamforming strategy of the SIMO WHFL to transform the SIMO feedback channel into the SISO feedback channel, then along the lines of the encoding-decoding procedure in Theorem 2, the following Corollary 2 for the MISO WHFL is obtained. As the proof follows a similar way to that of Theorem 2, the detailed proof is omitted here.

Corollary 2.

For the MISO WHFL with K users and T iterations, given N, τ, υ, D, ϵ and δ, and using a similar FBL approach to that of Theorem 2, the relationship between PLS, privacy, utility, and the noise variance of LDP is characterized by the following:

(24) $\begin{array}{c}\hfill max\left\{\underset{\mathit{Secrecy}\mathit{level}\mathit{of}\mathit{PLS}}{\underbrace{\underset{\begin{array}{c}t\in \{1,\dots ,T\},\\ \mathsf{\Delta }{g}_{miso}\end{array}}{max}\left[{\displaystyle \frac{D·2^{\frac{2}{q(1-\delta )}log\left(1+\frac{\left|\right|{\widehat{\mathit{g}}}_{miso}{\left|\right|}^{2}P}{{\sigma }_e^2}\right)}-S_{\ell }{\sigma }_{w,t}^2}{K}}\right]}},\underset{\mathit{Privacy}\mathit{term}}{\underbrace{\underset{t\in \{1,\dots ,T\}}{max}\left[{\displaystyle \frac{S_{\ell }{\sigma }_{w,t}^2}{K(2^{2ϵ}-1)}}\right]}}\right\}\le \underset{\begin{array}{c}\hfill \mathit{LDP}\mathit{noise}\mathit{variance}\end{array}}{\underbrace{{\sigma }^2}}\le \underset{\mathit{Utility}\mathit{term}}{\underbrace{{\displaystyle \frac{\upsilon }{K}}}},\end{array}$

where ${\widehat{\mathit{g}}}_{miso}={\mathit{g}}_{miso}-\mathsf{\Delta }{\mathit{g}}_{miso}$. In addition, an achievable transmission rate $R_{miso}(\tau ,N,\delta ,D,\upsilon ,ϵ)$ of our proposed FBL approach is given by the following:

(25) $\begin{array}{c}\hfill R_{miso}(\tau ,N,\delta ,D,\upsilon ,ϵ)={\displaystyle \frac{{\sum }_{t=1}^T{N}_t{R}_t}{N}},R_t={\displaystyle \frac{1}{N_t}}log\left({\displaystyle \frac{3\mathit{SNR}\left|\right|{\mathit{h}}_{miso}{\left|\right|}^2}{{\left[Q^{-1}\left(\frac{\tau }{8}\right)\right]}^2}}{\left(1+{\displaystyle \frac{\mathit{SNR}\left|\right|{\mathit{h}}_{miso}{\left|\right|}^2}{{\mathsf{\Psi }}_7{\mathsf{\Psi }}_8}}\right)}^{N_t-1}\right),\end{array}$

where ${\mathsf{\Psi }}_7=1+{\xi }^{★}{\displaystyle \frac{\left|\right|{\mathit{h}}_{miso}{\left|\right|}^2\mathit{SNR}}{\left|\right|{\tilde{\mathit{h}}}_{miso}{\left|\right|}^2\widetilde{\mathit{SNR}}}}$, ${\mathsf{\Psi }}_8={\left(1-{\displaystyle \frac{{\xi }^{★}}{\left|\right|{\tilde{\mathit{h}}}_{miso}{\left|\right|}^2\widetilde{\mathit{SNR}}}}\right)}^{-1}$, SNR, $\widetilde{\mathit{SNR}}$, N and ${\xi }^{★}$ are given in Corollary 1.

3. An FBL Approach for the MIMO WHFL

For the WHFL in the MIMO case, (9)–(11) can be re-written as follows:

(26)$\begin{array}{c}{\mathit{Y}}_i\left(t\right)={\mathit{h}}_{mimo}{\mathit{X}}_i\left(t\right)+{\mathsf{\eta }}_{1,i}\left(t\right),1\le i\le N_t,\end{array}$

(27)$\begin{array}{c}{\tilde{\mathit{Y}}}_i\left(t\right)={\tilde{\mathit{h}}}_{mimo}{\tilde{\mathit{X}}}_i\left(t\right)+{\mathsf{\eta }}_{2,i}\left(t\right),1\le i\le N_t-1,\end{array}$

(28)$\begin{array}{c}{\mathit{Z}}_i\left(t\right)={\mathit{g}}_{mimo}{\mathit{X}}_i\left(t\right)+{\tilde{\mathit{g}}}_{mimo}{\tilde{\mathit{X}}}_i\left(t\right)+{\mathsf{\eta }}_{e,i}\left(t\right),1\le i\le N_t,\end{array}$

where ${\mathit{h}}_{mimo}\in {\mathbb{C}}^{B\times A}$, ${\tilde{\mathit{h}}}_{mimo}\in {\mathbb{C}}^{A\times B}$, ${\mathit{g}}_{mimo}\in {\mathbb{C}}^{C\times A}$, ${\tilde{\mathit{g}}}_{mimo}\in {\mathbb{C}}^{C\times B}$, ${\mathit{X}}_i\left(t\right)\in {\mathbb{C}}^{A\times 1}$, ${\tilde{\mathit{X}}}_i\left(t\right)\in {\mathbb{C}}^{B\times 1}$, the elements of ${\mathsf{\eta }}_{1,i}\left(t\right)\in {\mathbb{C}}^{B\times 1}$, ${\mathsf{\eta }}_{2,i}\left(t\right)\in {\mathbb{C}}^{A\times 1}$ and ${\mathsf{\eta }}_{e,i}\left(t\right)\in {\mathbb{C}}^{C\times 1}$ are i.i.d. as $\mathcal{CN}(0,{\sigma }_1^2)$, $\mathcal{CN}(0,{\sigma }_2^2)$ and $\mathcal{CN}(0,{\sigma }_e^2)$, respectively. Here note that the feedforward channel (26) and the feedback channel (27) are both MIMO channels.

In this section, for the MIMO WHFL system, an FBL approach is proposed, which combines the two-dimensional message mapping method, the two-dimensional MLO, and the SVD technique, see the following Figure 3. To facilitate a better understanding of Figure 3, we introduce the two-dimensional message mapping method and the two-dimensional MLO below.

The two-dimensional message mapping method: We first review the message mapping in the classical SK scheme [35] (see Figure 4a). Specifically, for given codeword length n, let the message $W\in \mathcal{W}=\{1,2,\dots ,2^{nR}\}$ and $\left|\mathcal{W}\right|=2^{nR}$, where R is the transmission rate. Partition the interval $[-\sqrt{3},\sqrt{3}]$ into $2^{nR}$ equal sub-intervals, with each sub-interval’s midpoint corresponding to a message in $\mathcal{W}$. Let $\theta$ denote the midpoint associated with message W, where the variance of $\theta$ is approximately 1. This one-dimensional mapping method is shown to be optimal for AWGN channels with real signals. To address the complexity of fading channels, we introduce a two-dimensional message mapping method, detailed as follows:

For given codeword length n, let message $W=(W_R,W_I)$, where W, $W_R$ and $W_I$ are uniformly distributed in $\mathcal{W}=\{1,\dots ,2^{nR}\}$, ${\mathcal{W}}_R=\{1,\dots ,2^{n{R}_R}\}$ and ${\mathcal{W}}_I=\{1,\dots ,2^{n{R}_I}\}$, respectively, and $R_R+R_I=R$. Since the message W is composed of two parts, we place the points $(W_R,W_I)$ in a complex square grid with corners located at $(\pm \sqrt{3},\pm j\sqrt{3})$ (see Figure 4b). Divide the entire square grid into $2^{n(R_R+R_I)}$ equally spaced sub-grids, and the center point of each sub-grid is mapped to a pair of values in $\mathcal{W}=({\mathcal{W}}_R,{\mathcal{W}}_I)$. Let $\theta ={\theta }_R+j{\theta }_I$ be the center point of the sub-grid with respect to (w.r.t) the message $W=(W_R,W_I)$, where ${\theta }_R$ and ${\theta }_I$ represent the real and imaginary components of $\theta$, respectively, and the variance of $\theta$ approximately equals 2.

The two-dimensional MLO: The two-dimensional MLO is given by the following:

(29)$\begin{array}{c}\hfill {\mathbb{M}}_{\mathsf{\Lambda }}\left[x\right]\stackrel{\mathrm{def}}{=}x-\mathbb{Q}\left[x\right],\end{array}$

where the two-dimensional lattice $\mathsf{\Lambda }={\mathsf{\Lambda }}_R+j{\mathsf{\Lambda }}_I$ is a complex plane with ${\mathsf{\Lambda }}_R\in [-{\displaystyle \frac{d}{2}},-{\displaystyle \frac{d}{2}}]$, ${\mathsf{\Lambda }}_I\in [-{\displaystyle \frac{d}{2}},-{\displaystyle \frac{d}{2}}]$, $d>0$, $j=\sqrt{-1}$, $\mathbb{Q}\left[x\right]$ is the nearest neighbor quantization of x w.r.t. $\mathsf{\Lambda }$, and x is a complex-valued number. Some basic properties of the two-dimensional MLO [39] are listed below.

Proposition 1. 

(1). The distributive law ${\mathbb{M}}_{\mathsf{\Lambda }}[{\mathbb{M}}_{\mathsf{\Lambda }}\left[x\right]+y]={\mathbb{M}}_{\mathsf{\Lambda }}[x+y]$.

(2). If $x+y\in \mathsf{\Lambda }$, ${\mathbb{M}}_{\mathsf{\Lambda }}[x+y]=x+y$, otherwise, a modulo-aliasing error occurred.

(3). Let the dither signal ν be uniformly distributed on Λ, then ${\mathbb{M}}_{\mathsf{\Lambda }}[x+\nu ]$ is uniformly distributed on Λ, where $\mathrm{Var}\left({\mathbb{M}}_{\mathsf{\Lambda }}[x+\nu ]\right)={\displaystyle \frac{d^2}{12}}+{\displaystyle \frac{d^2}{12}}={\displaystyle \frac{d^2}{6}}$.

The classical SK scheme does not work in the noisy feedback case, and this is because in such a case, the transmitter cannot accurately obtain the estimation error of the receiver. We show that by applying the two-dimensional MLO to both the feedforward and feedback encoders, the adverse effects of feedback channel noise on the SK scheme’s performance can be mitigated, which allows the SK-type scheme to remain effective even in the presence of noisy feedback. The following Figure 5a,b illustrate the differences between the classical SK scheme and the modified SK-type scheme utilizing two-dimensional MLO.

3.1. An FBL Approach for the MIMO WHFL

3.1.1. Channel Decomposition by SVD

Based on the SVD technique, matrices ${\mathit{h}}_{mimo}$ and ${\tilde{\mathit{h}}}_{mimo}$ can be expressed as follows:

(30)$\begin{array}{c}\hfill {\mathit{h}}_{mimo}=\mathit{U}\mathsf{\Lambda }{\mathit{V}}^{\mathcal{H}},{\tilde{\mathit{h}}}_{mimo}=\tilde{\mathit{U}}\tilde{\mathsf{\Lambda }}{\tilde{\mathit{V}}}^{\mathcal{H}},\end{array}$

where $\mathit{U},{\tilde{\mathit{V}}}^{\mathcal{H}}\in {\mathbb{C}}^{B\times B}$ and $\tilde{\mathit{U}},{\mathit{V}}^{\mathcal{H}}\in {\mathbb{C}}^{A\times A}$ are unitary matrices. The diagonal matrices $\mathsf{\Lambda }\in {\mathbb{C}}^{B\times A}$ and $\tilde{\mathsf{\Lambda }}\in {\mathbb{C}}^{A\times B}$ have non-negative real number diagonal elements ($d_1$,…,$d_J$) and (${\tilde{d}}_1$,…,${\tilde{d}}_J$) [49], respectively, and

(31)$J=min(A,B).$

According to (26) and (30), we have the following:

(32)${\mathit{U}}^{\mathcal{H}}{\mathit{Y}}_i\left(t\right)=\mathsf{\Lambda }{\mathit{V}}^{\mathcal{H}}{\mathit{X}}_i\left(t\right)+{\mathit{U}}^{\mathcal{H}}{\mathsf{\eta }}_{1,i}\left(t\right)⟹{\mathit{Y}}_i^{\prime }\left(t\right)=\mathsf{\Lambda }{\mathit{X}}_i^{\prime }\left(t\right)+{\mathsf{\eta }}_{1,i}^{\prime }\left(t\right),$

where ${\mathit{Y}}_i^{\prime }\left(t\right)={\mathit{U}}^{\mathcal{H}}{\mathit{Y}}_i\left(t\right),{\mathsf{\eta }}_{1,i}^{\prime }\left(t\right)={\mathit{U}}^{\mathcal{H}}{\mathsf{\eta }}_{1,i}\left(t\right)\in {\mathbb{C}}^{B\times 1}$ and ${\mathit{X}}_i^{\prime }\left(t\right)={\mathit{V}}^{\mathcal{H}}{\mathit{X}}_i\left(t\right)\in {\mathbb{C}}^{A\times 1}$. It is noted that $E\left({\mathit{X}}_i^{\prime \mathcal{H}}\left(t\right){\mathit{X}}_i^{\prime }\left(t\right)\right)=E\left({\mathit{X}}_i^{\mathcal{H}}\left(t\right){\mathit{X}}_i\left(t\right)\right)$ and $E\left({\mathsf{\eta }}_{1,i}^{\prime \mathcal{H}}\left(t\right){\mathsf{\eta }}_{1,i}^{\prime }\left(t\right)\right)=E\left({\mathsf{\eta }}_{1,i}^{\mathcal{H}}\left(t\right){\mathsf{\eta }}_{1,i}\left(t\right)\right)$, ensuring that the power constraint of ${\mathit{X}}_i\left(t\right)$ is equal to that of ${\mathit{X}}_i^{\prime }\left(t\right)$, and the distributions of ${\mathsf{\eta }}_{1,i}^{\prime }\left(t\right)$ and ${\mathsf{\eta }}_{1,i}\left(t\right)$ remain the same. As $\mathsf{\Lambda }$ is a diagonal matrix, (32) can be decomposed as follows:

(33)$Y_{j,i}^{\prime }\left(t\right)=d_j{X}_{j,i}^{\prime }\left(t\right)+{\eta }_{j,1,i}^{\prime }\left(t\right),1\le j\le J,1\le i\le N_t,$

where $Y_{j,i}^{\prime }\left(t\right)$, $X_{j,i}^{\prime }\left(t\right)$ and ${\eta }_{j,1,i}^{\prime }\left(t\right)$ denote the j-th components of ${\mathit{Y}}_i^{\prime }\left(t\right)$, ${\mathit{X}}_i^{\prime }\left(t\right)$ and ${\mathsf{\eta }}_{1,i}^{\prime }\left(t\right)$, respectively.

Similarly, from (27) and (30), (27) can be decomposed as follows:

(34)${\tilde{Y}}_{j,i}^{\prime }\left(t\right)={\tilde{d}}_j{\tilde{X}}_{j,i}^{\prime }\left(t\right)+{\eta }_{j,2,i}^{\prime }\left(t\right),1\le j\le J,1\le i\le N_t-1,$

where ${\tilde{Y}}_{j,i}^{\prime }\left(t\right)$, ${\tilde{X}}_{j,i}^{\prime }\left(t\right)$ and ${\eta }_{j,2,i}^{\prime }\left(t\right)$ denote the j-th components of ${\tilde{\mathit{Y}}}_i^{\prime }\left(t\right)$, ${\tilde{\mathit{X}}}_i^{\prime }\left(t\right)$ and ${\mathsf{\eta }}_{2,i}^{\prime }\left(t\right)$, respectively, and ${\tilde{\mathit{Y}}}_i^{\prime }\left(t\right)={\tilde{\mathit{U}}}^{\mathcal{H}}{\tilde{\mathit{Y}}}_i\left(t\right),{\mathsf{\eta }}_{2,i}^{\prime }\left(t\right)={\tilde{\mathit{U}}}^{\mathcal{H}}{\mathsf{\eta }}_{2,i}\left(t\right)\in {\mathbb{C}}^{A\times 1}$ and ${\tilde{\mathit{X}}}_i^{\prime }\left(t\right)={\tilde{\mathit{V}}}^{\mathcal{H}}{\tilde{\mathit{X}}}_i\left(t\right)\in {\mathbb{C}}^{B\times 1}$. As shown in (32)–(34), applying the SVD technique, the feedforward and feedback MIMO channels can be effectively transformed into J parallel SISO sub-channels.

Power allocating: The edge server assigns power $P_1,\dots ,P_J$ to the J parallel sub-channels for the feedforward channel, where ${\sum }_{j=1}^J{P}_j=P$. Similarly, the cloud server distributes power ${\tilde{P}}_1,\dots ,{\tilde{P}}_J$ across the J parallel sub-channels for the feedback channel, where ${\sum }_{j=1}^J{\tilde{P}}_j=\tilde{P}$.

3.1.2. Message Splitting

For given $\tau$, $N_t$, $\upsilon$, D and $ϵ$, we define the following:

(35)$\begin{array}{c}\hfill |{\mathcal{W}}_t^{″}|=2^{N_t{R}_t}=2^{q{R}_t\left(D\right)},R_t={\displaystyle \frac{H\left(W_t^{″}\right)}{N_t}}.\end{array}$

Next, the message $W_t^{″}$ is divided into J independent components $(W_{t,1}^{″},\dots ,W_{t,J}^{″})$, where $W_{t,j}^{″}$ is uniformly distributed over the set ${\mathcal{W}}_{t,j}^{″}=\{1,2,\dots ,2^{N_t{R}_{t,j}}\}$ and $j=1,\dots ,J$. Then, we divide each sub-message $W_{t,j}^{″}$ into $W_{t,j}^{″}=(W_{t,j,R}^{\prime \prime },W_{t,j,I}^{\prime \prime })$, where $W_{t,j,R}^{″}$ and $W_{t,j,I}^{″}$ are uniformly distributed over the sets ${\mathcal{W}}_{t,j,R}^{″}=\{1,2,\dots ,2^{N_t{R}_{t,j,R}}\}$ and ${\mathcal{W}}_{t,j,I}^{″}=\{1,2,\dots ,2^{N_t{R}_{t,j,I}}\}$, respectively. The rate for each parallel sub-channel is defined as $R_{t,j}=R_{t,j,R}+R_{t,j,I}$. Consequently, the total rate $R_t$ for all J parallel sub-channels during the t-th communication round is as follows:

(36)$R_t=\sum _{j=1}^J(R_{t,j,R}+R_{t,j,I}).$

3.1.3. An FBL Scheme of Each Parallel Sub-Channel

By using the two-dimensional message mapping method introduced in the last subsection, the message $W_{t,j}^{″}$ is mapped to the center point ${\theta }_j$ of its corresponding sub-grid.

Initialization: At time instant 1, the edge server maps the messages $W_{t,j}^{″}$ to ${\theta }_j={\theta }_{R,j}+j{\theta }_{I,j}$, and sends the following:

(37)$\begin{array}{c}\hfill X_{j,1}^{\prime }\left(t\right)=\sqrt{{\displaystyle \frac{P_j}{2}}}{\theta }_j,\end{array}$

Then, the cloud server computes the first estimation ${\widehat{\theta }}_{j,1}$ of ${\theta }_j$ by the following:

(38)$\begin{array}{c}\hfill {\widehat{\theta }}_{j,1}={\displaystyle \frac{Y_{j,1}^{\prime }\left(t\right)}{d_j\sqrt{\frac{P_j}{2}}}}={\theta }_j+{\displaystyle \frac{{\eta }_{j,1,1}^{\prime }\left(t\right)}{d_j\sqrt{\frac{P_j}{2}}}}={\theta }_j+{\epsilon }_1,\end{array}$

where ${\epsilon }_1={\epsilon }_{R,1}+j{\epsilon }_{I,1}={\widehat{\theta }}_{j,1}-{\theta }_j$ is the estimation error of the cloud server at time instant 1. Define ${\alpha }_1=\mathrm{Var}\left({\epsilon }_1\right)={\displaystyle \frac{2{\sigma }_1^2}{d_j^2{P}_j}}$, ${\alpha }_{R,1}=\mathrm{Var}\left({\epsilon }_{R,1}\right)={\displaystyle \frac{{\sigma }_1^2}{d_j^2{P}_j}}$ and ${\alpha }_{I,1}=\mathrm{Var}\left({\epsilon }_{I,1}\right)={\displaystyle \frac{{\sigma }_1^2}{d_j^2{P}_j}}$.

Iteration: First, we introduce a shared dither random i.i.d. sequence ${\nu }^{N_t-1}=({\nu }_1,\dots ,{\nu }_{N_t-1})$, which is perfectly known by both the edge server and the cloud server, and it is uniformly distributed on $\mathsf{\Lambda }$ ($\mathsf{\Lambda }={\mathsf{\Lambda }}_R+j{\mathsf{\Lambda }}_I$ is a complex plane with ${\mathsf{\Lambda }}_R\in [-{\displaystyle \frac{d}{2}},-{\displaystyle \frac{d}{2}}]$, ${\mathsf{\Lambda }}_I\in [-{\displaystyle \frac{d}{2}},-{\displaystyle \frac{d}{2}}]$), and $d=\sqrt{6{\tilde{P}}_j}$. Here ${\nu }^{N_t-1}$ is independent of all signals transmitted over channels. At time instant i ($2\le i\le N_t$), using the two-dimensional MLO shown in Section 3, the cloud server sends the following:

(39)$\begin{array}{c}\hfill {\tilde{X}}_{j,i-1}^{\prime }\left(t\right)={\mathbb{M}}_{\mathsf{\Lambda }}[{\gamma }_{i-1}{\widehat{\theta }}_{j,i-1}+{\nu }_{i-1}],\end{array}$

where ${\gamma }_{i-1}$ is a modulation coefficient. From Property (3) of Proposition 1, we have $E\left({\tilde{X}}_{j,i-1}^{\prime \mathcal{H}}\left(t\right){\tilde{X}}_{j,i-1}^{\prime }\left(t\right)\right)={\tilde{P}}_j$ (the dither signals guarantee that the codeword transmitted by the cloud server meets the power constraint). Then the edge server computes a noisy version of estimation error ${\epsilon }_{i-1}={\widehat{\theta }}_{j,i-1}-{\theta }_j$ by the following:

(40)$\begin{array}{c}\hfill {\tilde{\epsilon }}_{i-1}={\displaystyle \frac{1}{{\gamma }_{i-1}}}{\mathbb{M}}_{\mathsf{\Lambda }}[{\displaystyle \frac{{\tilde{Y}}_{j,i-1}^{\prime }\left(t\right)}{{\tilde{d}}_j}}-{\gamma }_{i-1}{\theta }_j-{\nu }_{i-1}]\stackrel{\left(a\right)}{=}{\displaystyle \frac{1}{{\gamma }_{i-1}}}{\mathbb{M}}_{\mathsf{\Lambda }}[{\gamma }_{i-1}{\epsilon }_{i-1}+{\displaystyle \frac{{\eta }_{j,2,i-1}^{\prime }\left(t\right)}{{\tilde{d}}_j}}],\end{array}$

where (a) is due to the modulo distributive law in property (1) of Proposition 1. The modulo-aliasing errors do not occur in the edge server, if ${\gamma }_{i-1}{\epsilon }_{i-1}+{\displaystyle \frac{{\eta }_{j,2,i-1}^{\prime }\left(t\right)}{{\tilde{d}}_j}}\in \mathsf{\Lambda }$. Hence, the edge server obtains ${\tilde{\epsilon }}_{i-1}={\epsilon }_{i-1}+{\displaystyle \frac{{\eta }_{j,2,i-1}^{\prime }\left(t\right)}{{\gamma }_{i-1}{\tilde{d}}_j}}$. Then, the edge server sends the following:

(41)$\begin{array}{c}\hfill X_{j,i}^{\prime }\left(t\right)={\lambda }_{i-1}{\gamma }_{i-1}{\tilde{\epsilon }}_{i-1},\end{array}$

where ${\lambda }_{i-1}$ is chosen to satisfy the transmitter’s power constraint $P_j$. Then, the cloud server updates ${\widehat{\theta }}_{j,i}$ by computing the following:

(42)$\begin{array}{c}\hfill {\widehat{\theta }}_{j,i}={\widehat{\theta }}_{j,i-1}-{\widehat{\epsilon }}_{i-1}={\widehat{\theta }}_{j,i-1}-{\beta }_i{\displaystyle \frac{Y_{j,i}^{\prime }\left(t\right)}{d_j}},\end{array}$

where ${\widehat{\epsilon }}_{i-1}={\beta }_i{\displaystyle \frac{Y_{j,i}^{\prime }\left(t\right)}{d_j}}$, and the MMSE estimation coefficient ${\beta }_i$ is given by the following:

(43)$\begin{array}{c}\hfill {\beta }_i={\displaystyle \frac{E\left(\frac{{\epsilon }_{i-1}{Y}_{j,i}^{\prime }{\left(t\right)}^{\mathcal{H}}}{d_j}\right)}{E\left(\frac{Y_{j,i}^{\prime }\left(t\right)Y_{j,i}^{\prime }{\left(t\right)}^{\mathcal{H}}}{d_j^2}\right)}},\end{array}$

which ensures that ${\epsilon }_{i-1}$ is correctly estimated from $Y_{j,i}^{\prime }\left(t\right)$. Define ${\epsilon }_i={\epsilon }_{R,i}+j{\epsilon }_{I,i}={\widehat{\theta }}_{j,i}-{\theta }_j$, (42) yields the following:

(44)$\begin{array}{c}\hfill {\epsilon }_i={\epsilon }_{i-1}-{\beta }_i{\displaystyle \frac{Y_{j,i}^{\prime }\left(t\right)}{d_j}}.\end{array}$

Further define ${\alpha }_i=\mathrm{Var}\left({\epsilon }_i\right)$, ${\alpha }_{R,i}=\mathrm{Var}\left({\epsilon }_{R,i}\right)$, ${\alpha }_{I,i}=\mathrm{Var}\left({\epsilon }_{I,i}\right)$. Since ${\epsilon }_i$ is a CSCG distribution estimation error, we conclude that ${\alpha }_{R,i}={\alpha }_{I,i}={\displaystyle \frac{{\alpha }_i}{2}}$.

Decoding: At time instant $N_t$, the final estimation obtained by the cloud server is ${\widehat{\theta }}_{j,N_t}={\theta }_j+{\epsilon }_{N_t}$, where ${\epsilon }_{N_t}={\epsilon }_{R,N_t}+j{\epsilon }_{I,N_t}$. The cloud server successfully decodes the message $W_{t,j}^{″}$ if ${\widehat{\theta }}_{j,N_t}$ is closest to the message point ${\theta }_j$, i.e., ${\epsilon }_{R,N_t}\in [-{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}},{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}})$ and ${\epsilon }_{I,N_t}\in [-{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,I}}}},{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,I}}}})$.

The formal proof of Theorem 1 is provided in Appendix A.

4. An FBL Approach for the SIMO WHFL

For the SIMO WHFL, (9)–(11) can be re-written as follows:

(45)$\begin{array}{c}{\mathit{Y}}_i\left(t\right)={\mathit{h}}_{simo}{X}_i\left(t\right)+{\mathsf{\eta }}_{1,i}\left(t\right),1\le i\le N_t,\end{array}$

(46)$\begin{array}{c}{\tilde{Y}}_i\left(t\right)={\tilde{\mathit{h}}}_{simo}{\tilde{\mathit{X}}}_i\left(t\right)+{\eta }_{2,i}\left(t\right),1\le i\le N_t-1,\end{array}$

(47)$\begin{array}{c}{\mathit{Z}}_i\left(t\right)={\mathit{g}}_{simo}{X}_i\left(t\right)+{\tilde{\mathit{g}}}_{simo}{\tilde{\mathit{X}}}_i\left(t\right)+{\mathsf{\eta }}_{e,i}\left(t\right),1\le i\le N_t,\end{array}$

where ${\mathit{h}}_{simo}\in {\mathbb{C}}^{B\times 1}$, ${\tilde{\mathit{h}}}_{simo}\in {\mathbb{C}}^{1\times B}$, ${\mathit{g}}_{simo}\in {\mathbb{C}}^{C\times 1}$, ${\tilde{\mathit{g}}}_{simo}\in {\mathbb{C}}^{C\times B}$, $X_i\left(t\right)\in {\mathbb{C}}^{1\times 1}$, ${\tilde{\mathit{X}}}_i\left(t\right)\in {\mathbb{C}}^{B\times 1}$, the elements of ${\mathsf{\eta }}_{1,i}\left(t\right)\in {\mathbb{C}}^{B\times 1}$ and ${\mathsf{\eta }}_{e,i}\left(t\right)\in {\mathbb{C}}^{C\times 1}$ are i.i.d. as $\mathcal{CN}(0,{\sigma }_1^2)$ and $\mathcal{CN}(0,{\sigma }_e^2)$, respectively, and ${\eta }_{2,i}\left(t\right)\in {\mathbb{C}}^{1\times 1}\sim \mathcal{CN}(0,{\sigma }_2^2)$. Here note that the feedforward channel (45) is a SIMO channel, while the feedback channel (46) is a MISO channel. Unlike the SVD technique used for the MIMO WHFL that decomposes the MIMO channel into several parallel SISO channels, we use a beamforming strategy to transform the feedforward SIMO channel into the SISO channel, and a new pre-coding strategy to transform the feedback MISO channel into the SISO channel, see the following Figure 6. Further applying the approach for each SISO channel (see Section 3.1.3), the FBL approach for the SIMO WHFL is obtained, and the details are given below.

Beamforming strategy: The signal received by the cloud server in (45) can proceed as follows:

(48)$\begin{array}{c}{\mathit{h}}_{simo}^{\mathcal{H}}{\mathit{Y}}_i\left(t\right)={\mathit{h}}_{simo}^{\mathcal{H}}{\mathit{h}}_{simo}{X}_i\left(t\right)+{\mathit{h}}_{simo}^{\mathcal{H}}{\mathsf{\eta }}_{1,i}\left(t\right)=\left|\right|{\mathit{h}}_{simo}{\left|\right|}^2{X}_i\left(t\right)+{\mathit{h}}_{simo}^{\mathcal{H}}{\mathsf{\eta }}_{1,i}\left(t\right),\\ ⟹{\overline{Y}}_i\left(t\right)=\left|\right|{\mathit{h}}_{simo}{\left|\right|}^2{X}_i\left(t\right)+{\overline{\eta }}_{1,i}\left(t\right),\end{array}$

where ${\overline{Y}}_i\left(t\right)={\mathit{h}}_{simo}^{\mathcal{H}}{\mathit{Y}}_i\left(t\right)\in {\mathbb{C}}^{1\times 1}$ and ${\overline{\eta }}_{1,i}\left(t\right)={\mathit{h}}_{simo}^{\mathcal{H}}{\mathsf{\eta }}_{1,i}\left(t\right)\in {\mathbb{C}}^{1\times 1}$. Applying (4), the feedforward SIMO channel is transformed into the SISO channel.

A new pre-coding strategy: For the feedback channel (46), allowing the following:

(49)$\begin{array}{c}\hfill {\tilde{\mathit{X}}}_i\left(t\right)={\displaystyle \frac{{\tilde{\mathit{h}}}_{simo}^{\mathcal{H}}}{\left|\right|{\tilde{\mathit{h}}}_{simo}\left|\right|}}{\tilde{X}}_i\left(t\right),\end{array}$

where ${\tilde{X}}_i\left(t\right)\in {\mathbb{C}}^{1\times 1}$ and $E\left({\tilde{\mathit{X}}}_i^{\mathcal{H}}\left(t\right){\tilde{\mathit{X}}}_i\left(t\right)\right)=E({\tilde{X}}_i^{\mathcal{H}}\left(t\right){\displaystyle \frac{{\tilde{\mathit{h}}}_{simo}}{\left|\right|{\tilde{\mathit{h}}}_{simo}\left|\right|}}{\displaystyle \frac{{\tilde{\mathit{h}}}_{simo}^{\mathcal{H}}}{\left|\right|{\tilde{\mathit{h}}}_{simo}\left|\right|}}{\tilde{X}}_i\left(t\right))=E\left({\tilde{X}}_i^{\mathcal{H}}\left(t\right){\tilde{X}}_i\left(t\right)\right)=\tilde{P}$, which indicates that the power constraint of ${\tilde{\mathit{X}}}_i\left(t\right)$ is equal to that of ${\tilde{X}}_i\left(t\right)$. Hence, substituting (49) into (46), we have the following:

(50)$\begin{array}{c}\hfill {\tilde{Y}}_i\left(t\right)={\tilde{\mathit{h}}}_{simo}{\displaystyle \frac{{\tilde{\mathit{h}}}_{simo}^{\mathcal{H}}}{\left|\right|{\tilde{\mathit{h}}}_{simo}\left|\right|}}{\tilde{X}}_i\left(t\right)+{\eta }_{2,i}\left(t\right)=\left|\right|{\tilde{\mathit{h}}}_{simo}\left|\right|{\tilde{X}}_i\left(t\right)+{\eta }_{2,i}\left(t\right),\end{array}$

which indicates that the feedback MISO channel is transformed into the SISO channel. Hence along the lines of the encoding-decoding procedure in Section 3.1.3, the FBL approach for the SIMO WHFL is obtained.

Since the proof of Theorem 2 is included in the proof of Theorem 1, we omit the detailed proof here.

5. Simulation Results

5.1. Experimental Settings

The simulation results are derived by averaging 2000 independent channel realizations (i.e., Monte-Carlo simulations). We consider a WHFL system consisting of 10 users, an edge server, and a cloud server, with each user having the same amount of training data. We assume that the channel matrix elements follow an i.i.d. distribution as $\mathcal{CN}(0,1)$ [5,6,17]. Following [47], the maximum normalized estimation errors of the eavesdropper’s channel are defined as $\mathsf{\Omega }={\displaystyle \frac{\omega }{{\left|\right|\mathit{g}\left|\right|}_F}}$ and $\tilde{\mathsf{\Omega }}={\displaystyle \frac{\tilde{\omega }}{\left|\right|\tilde{\mathit{g}}{\left|\right|}_F}}$, where $\omega$ and $\tilde{\omega }$ are defined in (13). The edge server employs Lempel–Ziv–Welch (LZW) source coding [50] to compress the quantized gradients, and the total transmitted data are M bits. The transmission latency for the edge server to upload data is $T_{comm}={\displaystyle \frac{M}{R_{eg}}}$ [5], where $R_{eg}$ represents the edge server’s transmission rate.

To evaluate the effectiveness of the proposed FBL scheme under real-world conditions, we train a neural network using the MNIST dataset (http://yann.lecun.com/exdb/mnist/, accessed on 20 March 2024), which contains 60,000 training samples and 10,000 test samples of 10 different handwritten digits. The network architecture includes 784 input nodes, a hidden layer containing 20 nodes, and an output layer with 10 nodes. The loss function is cross-entropy, with the hidden and output layers utilizing the ReLU and softmax activation functions, respectively. The neural network contains a total of $q=\mathrm{15,910}$ parameters, and the learning rate is set at $\mu =0.1$. In the experiments, the following three schemes are compared.

• Benchmark (Perfect HFL): The perfectly aggregated HFL system can be achieved through error-free transmission, which serves as the benchmark accuracy in ideal settings.

• Baseline 1 (Random binning coding scheme (RBCS)-based WHFL [26,28]): The gradient data from the edge servers is uploaded using the RBCS, which is based on traditional low-density parity-check (LDPC) codes with a target bit error rate of ${10}^{-6}$.

• Baseline 2 (Frequency division multiple access (FDMA)-based WHFL with artificial noise (AN) [29]): In the FDMA-based WHFL system with AN, FDMA is employed to transmit gradient data from edge servers to the cloud server, targeting a bit error ratio of ${10}^{-6}$. Additionally, AN is added to the transmitted signals to prevent eavesdroppers from obtaining the true gradient data.

5.2. Experimental Results

We show the results of test accuracy and the cross entropy versus the communication round for SISO/SIMO/MISO/MIMO cases in Figure 7 and Figure 8, respectively. From Figure 7 and Figure 8, we see that if perfect CSI of the eavesdropper’s channel is obtained by legal parties, both our proposed FBL scheme, Baseline 1 scheme, and Baseline 2 scheme almost do not affect the learning performance of HFL. This is because Baseline 1, Baseline 2, and our proposed schemes are all capable of transmitting gradient data with a sufficiently low decoding error probability. On the other hand, in our proposed FBL schemes, if imperfect CSI of the eavesdropper’s channel is obtained by legal parties, the test accuracy of HFL decreases, and the training loss of HFL increases as the maximum normalized estimation error of the eavesdropper’s channel increases. However, note that in such an imperfect CSI case, our proposed FBL schemes still provide the same level of secrecy as that of the perfect CSI case, which shows the robustness of our schemes against imperfect CSI of the eavesdropper’s channel. Furthermore, Figure 7 and Figure 8 demonstrate that the eavesdropper cannot obtain the real gradient data when applying our FBL scheme, which indicates that our FBL schemes effectively ensure the PLS of the data.

As depicted in Figure 9, the transmission latency of our FBL scheme is approximately 2 to 5 times lower than that of Baseline 1 and Baseline 2, due to the gain from introducing feedback. Additionally, the transmission latency of our scheme decreases as the number of antennas increases. Furthermore, the transmission latency of Baseline 2 is lower than that of Baseline 1, owing to the gain from introducing AN to counter eavesdropping attacks in Baseline 2. Moreover, Figure 9 shows that the transmission latency of our FBL scheme increases as the maximum normalized estimation error of the eavesdropper’s channel increases, and this is because to support the same level of performance, the worse estimation of the CSI of the eavesdropper’s channel, the more bits need to be transmitted, which leads to an increase in transmission latency.

From Table 2, we show that the achievable secrecy transmission rates of our FBL schemes increase with the number of antennas, and the achievable secrecy transmission rates of our schemes are significantly higher than those of Baseline 1 and Baseline 2, due to the gain introduced by feedback in our scheme. Additionally, due to the gain from introducing AN in Baseline 2, its achievable secrecy transmission rate is higher than that of Baseline 1. Furthermore, Table 2 shows that the achievable secrecy transmission rates of our proposed FBL scheme decrease as the maximum normalized estimation errors of the eavesdropper’s channel increase, which can be viewed as the price for the worst estimation. From Table 3, we conclude that the achievable secrecy transmission rates of FBL schemes increase as the SNR of the feedback channel increases. Moreover, Figure 10 shows that the transmission latency of FBL schemes increases as the SNR of the feedback channel decreases. Therefore, in our schemes, poorer feedback channel conditions lead to lower achievable secrecy transmission rates and increased transmission latency. However, poorer feedback channel conditions do not directly affect learning performance, as it is primarily determined by the distortion D of lossy source coding, the average decoding error probability $\tau$ of channel coding, and the variance of noise introduced by LDP mechanisms.

Figure 11 shows the relationship between PLS (measured by the secrecy level), privacy, utility, and the LDP noise variance of proposed FBL schemes. From Figure 11, we conclude that the secrecy level increases as the LDP noise variance increases, and a higher secrecy level leads to a more stringent relationship between privacy and utility (with a smaller $ϵ$ and a larger $\upsilon$). Apart from this, for a given secrecy level, increasing the maximum normalized estimation error in the eavesdropper’s channel results in an increase in the variance of LDP noise, which can be also viewed as the price for the worse estimation.

6. Conclusions and Future Work

In this paper, a practical FBL approach, which is an extension of the classical SK scheme, is proposed for the multi-antenna URLLC-WHFL systems in the presence of PLS. We characterize the relationship between PLS, privacy, and the utility of these WHFL systems, and derive achievable transmission rates of the proposed FBL approach. Simulation results demonstrate that when the edge server has perfect knowledge of the eavesdropper’s CSI, our proposed FBL approach not only almost achieves perfect secrecy but also does not affect learning performance. Additionally, simulation results demonstrate that the proposed schemes have robustness even when the edge server has an imperfect eavesdropper’s CSI. Apart from this, it has been demonstrated that the transmission latency of our proposed FBL approach is significantly lower compared to traditional RBCS.

Furthermore, this paper focuses on proposing and analyzing a theoretical scheme. The application of this approach in real-world systems still faces practical challenges, such as hardware constraints, power consumption, or synchronization issues. Future work should aim to optimize energy efficiency and address synchronization in more complex multi-antenna systems using the proposed FBL scheme. On the other hand, as the computational complexity of techniques like precoding, beamforming, and SVD increases with the number of devices and communication channels, particularly in multi-antenna systems, further research, and optimization are needed to extend our proposed approach to more complex and large-scale networks. For instance, distributed or hierarchical architectures can allocate the computational load across multiple servers or devices, reducing the burden on individual components. Additionally, low-complexity approximation methods for precoding and beamforming could help lower overall system complexity. Future work will extend our approach to more complex multi-edge scenarios, exploring the impact of interference among edge servers on the WHFL in the presence of PLS.

Author Contributions

H.Z. did the theoretical work, performed the experiments, analyzed the data and drafted the work; B.D. designed the work, performed the theoretical work, interpreted the data for the work and revised the work; and P.X. interpreted the data for the work and revised the work. All authors have read and agreed to the published version of the manuscript.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The raw data supporting the conclusions of this article will be made available by the authors on request.

Conflicts of Interest

The authors declare no conflicts of interest.

Footnotes

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Figures and Tables

Figure 1. The multi-antenna WHFL in the presence of PLS.

Figure 2. An information-theoretic model of the WHFL system, where the edge server, cloud server and eavesdroppers are equipped with A, B, and C antennas, respectively ([Forumla omitted. See PDF.]).

Figure 3. A schematic diagram of the FBL approach for the WHFL over the MIMO channel.

Figure 4. Comparison of the message mapping methods between the classical SK scheme and the scheme in this paper. (a) Message mapping of classical SK scheme. (b) Message mapping in this paper.

Figure 5. Comparing the mechanisms between the classical SK scheme and the two-dimensional MLO-based SK-type scheme, where [Forumla omitted. See PDF.] represents the estimation of the transmitted message [Forumla omitted. See PDF.] at time [Forumla omitted. See PDF.]. (a) The classical SK scheme in a certain round i. (b) The two-dimensional MLO-based SK-type scheme in a certain round i.

Figure 6. A schematic diagram of the FBL approach for the SIMO WHFL.

Figure 7. Performance comparison between the different schemes on the MNIST dataset ([Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.] dB, [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.]). (a) [Forumla omitted. See PDF.]. (b) [Forumla omitted. See PDF.]. (c) [Forumla omitted. See PDF.]. (d) [Forumla omitted. See PDF.].

Figure 8. Performance comparison between the different schemes on the MNIST dataset ([Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.] dB, [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.]). (a) [Forumla omitted. See PDF.]. (b) [Forumla omitted. See PDF.]. (c) [Forumla omitted. See PDF.]. (d) [Forumla omitted. See PDF.].

Figure 8. Performance comparison between the different schemes on the MNIST dataset ([Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.] dB, [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.]). (a) [Forumla omitted. See PDF.]. (b) [Forumla omitted. See PDF.]. (c) [Forumla omitted. See PDF.]. (d) [Forumla omitted. See PDF.].

Figure 9. Transmission latency (200 rounds) of the different schemes on the MNIST dataset ([Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.] dB, [Forumla omitted. See PDF.][Forumla omitted. See PDF.], [Forumla omitted. See PDF.]). (a) [Forumla omitted. See PDF.]. (b) [Forumla omitted. See PDF.]. (c) [Forumla omitted. See PDF.]. (d) [Forumla omitted. See PDF.].

Figure 10. Transmission latency (200 rounds) of our schemes under different feedback channel SNR and perfect CSI on the MNIST dataset ([Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.]).

Figure 11. The relationship between the PLS (secrecy level), the privacy-utility, and LDP noise variance of proposed FBL schemes on the MNIST dataset ([Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.] dB, [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.][Forumla omitted. See PDF.]). (a) [Forumla omitted. See PDF.]. (b) [Forumla omitted. See PDF.]. (c) [Forumla omitted. See PDF.]. (d) [Forumla omitted. See PDF.]. (e) [Forumla omitted. See PDF.]. (f) [Forumla omitted. See PDF.]. (g) [Forumla omitted. See PDF.]. (h) [Forumla omitted. See PDF.]. (i) [Forumla omitted. See PDF.]. (j) [Forumla omitted. See PDF.]. (k) [Forumla omitted. See PDF.]. (l) [Forumla omitted. See PDF.].

Figure 11. The relationship between the PLS (secrecy level), the privacy-utility, and LDP noise variance of proposed FBL schemes on the MNIST dataset ([Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.] dB, [Forumla omitted. See PDF.], [Forumla omitted. See PDF.], [Forumla omitted. See PDF.][Forumla omitted. See PDF.]). (a) [Forumla omitted. See PDF.]. (b) [Forumla omitted. See PDF.]. (c) [Forumla omitted. See PDF.]. (d) [Forumla omitted. See PDF.]. (e) [Forumla omitted. See PDF.]. (f) [Forumla omitted. See PDF.]. (g) [Forumla omitted. See PDF.]. (h) [Forumla omitted. See PDF.]. (i) [Forumla omitted. See PDF.]. (j) [Forumla omitted. See PDF.]. (k) [Forumla omitted. See PDF.]. (l) [Forumla omitted. See PDF.].

Table 1

Summarizing all results in WFL in the presence of privacy, utility, PLS and URLLC.

Related Work	Privacy	Utility	PLS	Relationship between PLS, Privacy, and Utility	URLLC
[7,8,9,16,23]	✓	−	−	−	−
[10,11,12,13,14,22]	✓	✓	−	Relationship between Privacy and Utility	−
[26,27,28]	−	−	✓	−	−
[29]	−	✓	✓	Relationship between PLS and Utility	−
[30]	✓	✓	✓	Relationship between PLS-Privacy-Utility	−
[33,34]	−	−	−	−	✓
This Work	✓	✓	✓	Relationship between PLS-Privacy-Utility	✓

Table 2

Achievable secrecy rates of the different schemes on the MNIST dataset ($K=10$, $S_{\ell }=\mathrm{60,000}$, $q=\mathrm{15,910}$, $\widetilde{\mathit{SNR}}=15$ dB, $P=10$, $\tau ={10}^{-6}$, $T=200$, $D={10}^{-4}$, ${\sigma }_1^2={\sigma }_2^2=1, {\sigma }_e^2=2$).

Number of Antennas	$\mathit{A}=\mathit{B}=\mathit{C}=4$ (MIMO)	$\mathit{A}=1,\mathit{B}=\mathit{C}=4$ (SIMO)	$\mathit{A}=4,\mathit{B}=\mathit{C}=1$ (MISO)	$\mathit{A}=\mathit{B}=\mathit{C}=1$ (SISO)
Our scheme(Perfect CSI)	$10.3951\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.04$, $\upsilon =3$,${\sigma }^2=0.3$, $\delta =0.99994$)	$4.9928(\mathrm{bits}/\mathrm{symbol}$)($ϵ=0.025$, $\upsilon =5$,${\sigma }^2=0.5$, $\delta =0.99997$)	$5.1346\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.018$, $\upsilon =6.5$,${\sigma }^2=0.65$, $\delta =0.99997$)	2.6718 (bits/symbol)($ϵ=0.032$, $\upsilon =4$,${\sigma }^2=0.4$, $\delta =0.99998$)
Our scheme(Imperfect CSI, $\mathsf{\Omega }=0.2$)	$10.3941\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.025$, $\upsilon =5$,${\sigma }^2=0.5$, $\delta =0.99994$)	$4.9922(\mathrm{bits}/\mathrm{symbol}$)($ϵ=0.012$, $\upsilon =10$,${\sigma }^2=1$, $\delta =0.99997$)	$5.1343\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.013$, $\upsilon =9$,${\sigma }^2=0.9$, $\delta =0.99997$)	2.6708 (bits/symbol)($ϵ=0.01$, $\upsilon =12$,${\sigma }^2=1.2$, $\delta =0.99998$)
Our scheme(Imperfect CSI, $\mathsf{\Omega }=0.4$)	$10.3898\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.0025$, $\upsilon =50$,${\sigma }^2=5$, $\delta =0.99994$)	$4.9914(\mathrm{bits}/\mathrm{symbol}$)($ϵ=0.005$, $\upsilon =24$,${\sigma }^2=2.4$, $\delta =0.99997$)	$5.1338\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.0065$, $\upsilon =18.5$,${\sigma }^2=1.85$, $\delta =0.99997$)	2.6689 (bits/symbol)($ϵ=8.2\times {10}^{-4}$, $\upsilon =150$,${\sigma }^2=15$, $\delta =0.99998$)
Baseline 1 [26,28](Perfect CSI)	$4.2827\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.04$, $\upsilon =3$, ${\sigma }^2=0.3$)	$2.1537\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.025$, $\upsilon =5$, ${\sigma }^2=0.5$)	$2.2124\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.018$, $\upsilon =6.5$,${\sigma }^2=0.65$)	$0.8046\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.032$, $\upsilon =4$, ${\sigma }^2=0.4$)
Baseline 2 [29](Perfect CSI)	$5.2228\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.04$, $\upsilon =3$, ${\sigma }^2=0.3$)	$2.6265\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.025$, $\upsilon =5$, ${\sigma }^2=0.5$)	$2.6981\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.018$, $\upsilon =6.5$,${\sigma }^2=0.65$)	$0.9812\left(\mathrm{bits}/\mathrm{symbol}\right)$($ϵ=0.032$, $\upsilon =4$, ${\sigma }^2=0.4$)

Table 3

Achievable secrecy rates of our schemes under different feedback channel SNR on the MNIST dataset ($K=10$, $S_{\ell }=\mathrm{60,000}$, $q=\mathrm{15,910}$, $P=10$, $\tau ={10}^{-6}$, $T=200$, $D={10}^{-4}$, ${\sigma }_1^2={\sigma }_2^2=1, {\sigma }_e^2=2$).

Number of Antennas	$\mathit{A}=\mathit{B}=\mathit{C}=4$ (MIMO)($\mathbf{ϵ}=\mathbf{0.04}$, $\mathbf{\upsilon }=\mathbf{3}$,${\mathbf{\sigma }}^{\mathbf{2}}=\mathbf{0.3}$, $\mathbf{\delta }=\mathbf{0.99994}$)	$\mathbf{A}=\mathbf{1},\mathbf{B}=\mathbf{C}=\mathbf{4}$  (SIMO)$(\mathbf{ϵ}=\mathbf{0.025}$, $\mathbf{\upsilon }=\mathbf{5}$,${\mathbf{\sigma }}^{\mathbf{2}}=\mathbf{0.5}$, $\mathbf{\delta }=\mathbf{0.99997})$	$\mathbf{A}=\mathbf{4},\mathbf{B}=\mathbf{C}=\mathbf{1}$  (MISO)($\mathbf{ϵ}=\mathbf{0.018}$, $\mathbf{\upsilon }=\mathbf{6.5}$,${\mathbf{\sigma }}^{\mathbf{2}}=\mathbf{0.65}$, $\mathbf{\delta }=\mathbf{0.99997}$)	$\mathbf{A}=\mathbf{B}=\mathbf{C}=\mathbf{1}$  (SISO)($\mathbf{ϵ}=\mathbf{0.032}$, $\mathbf{\upsilon }=\mathbf{4}$,${\mathbf{\sigma }}^{\mathbf{2}}=\mathbf{0.4}$, $\mathbf{\delta }=\mathbf{0.99998}$)
$\widetilde{\mathrm{SNR}}=10$ dB(Perfect CSI)	$8.0911\left(\mathrm{bits}/\mathrm{symbol}\right)$	$3.6612(\mathrm{bits}/\mathrm{symbol}$)	$3.7589\left(\mathrm{bits}/\mathrm{symbol}\right)$	$2.2885\left(\mathrm{bits}/\mathrm{symbol}\right)$
$\widetilde{\mathrm{SNR}}=15$ dB(Perfect CSI)	$10.3951\left(\mathrm{bits}/\mathrm{symbol}\right)$	$4.9928(\mathrm{bits}/\mathrm{symbol}$)	$5.1346\left(\mathrm{bits}/\mathrm{symbol}\right)$	$2.6718\left(\mathrm{bits}/\mathrm{symbol}\right)$
$\widetilde{\mathrm{SNR}}=20$ dB(Perfect CSI)	$12.5581\left(\mathrm{bits}/\mathrm{symbol}\right)$	$6.1146(\mathrm{bits}/\mathrm{symbol}$)	$6.3177\left(\mathrm{bits}/\mathrm{symbol}\right)$	$3.0622\left(\mathrm{bits}/\mathrm{symbol}\right)$

Appendix A. The Formal Proof of Theorem 1

Appendix A.1. Utility and Privacy Analysis

First, note that since ${\mathit{W}}_t$, ${\mathsf{\eta }}_t$, and ${\mathit{W}}_t^{\prime }$ are i.i.d. generated, from Definition 1, we conclude the following:(A1)$$\begin{array}{c}\hfill \underset{t\in \{1,\dots ,T\}}{max}{\displaystyle \frac{1}{q}}I({\mathit{W}}_t;{\mathit{W}}_t^{\prime })=\underset{t\in \{1,\dots ,T\}}{max}{\displaystyle \frac{1}{2}}log\left(1+{\displaystyle \frac{S_{\ell }{\sigma }_{w,t}^2}{K{\sigma }^2}}\right)\le ϵ,\end{array}$$ On the other hand, from Definition 2, we conclude the following:(A2)$$\begin{array}{c}\hfill {\displaystyle \frac{1}{qT}}\sum _{t=1}^{T}E\left(d({\mathit{W}}_t,{\mathit{W}}_t^{\prime })\right)={\displaystyle \frac{1}{qT}}\sum _{t=1}^{T}E\left(\right||{\eta }_t{\left|\right|}^2)=K{\sigma }^2\le \upsilon .\end{array}$$ From (A1) and (A2), the relationship between privacy, utility, and the noise variance of LDP is characterized by the following: (A3)$$\underset{\mathbf{Privacy}\mathbf{term}}{\underbrace{\underset{t\in \{1,\dots ,T\}}{max}{\displaystyle \frac{S_{\ell }{\sigma }_{w,t}^2}{K(2^{2ϵ}-1)}}}}\le \underset{\begin{array}{c}\hfill \mathbf{Noise}\mathbf{variance}\mathbf{of}\mathbf{LDP}\end{array}}{\underbrace{{\sigma }^2}}\le \underset{\begin{array}{c}\hfill \mathbf{Utility}\mathbf{term}\end{array}}{\underbrace{{\displaystyle \frac{\upsilon }{K}}}},$$ which indicates that by selecting an appropriate LDP noise to satisfy (A3), both privacy and utility can be ensured.

Appendix A.2. Decoding Error Probability and Convergence Analysis

First, we bound the decoding error probability $P_{e,t}$ of $W_t^{″}$ transmitted in all parallel sub-SISO channels as follows: (A4)$$\begin{array}{c}\hfill P_{e,t}\le P_{e,t}\left(1\right)+P_{e,t}\left(2\right)+\dots +P_{e,t}\left(J\right),\end{array}$$ where $P_{e,t}\left(j\right)$ ($j=1,\dots ,J$) represents the decoding error probability of message $W_{t,j}^{″}$, and J is the number of parallel sub-SISO channels, which is defined in (31). Next, we analyze the error events of message $W_{t,j}^{″}$, which consist of the following:

• (1)

  A modulo-aliasing error occurs in the edge server at time instant $i+1(1\le i\le N_t-1)$, and it is defined as follows: (A5)$$\begin{array}{c}\hfill E_i=\{{\gamma }_i{\epsilon }_i+{\displaystyle \frac{{\eta }_{j,2,i}^{\prime }(t)}{{\tilde{d}}_j}}\notin \mathsf{\Lambda }\}=\{[{\gamma }_i{\epsilon }_{R,i}+{\displaystyle \frac{{\eta }_{R,j,2,i}^{\prime }(t)}{{\tilde{d}}_j}}\notin [-{\displaystyle \frac{d}{2}},{\displaystyle \frac{d}{2}})]\cup [{\gamma }_i{\epsilon }_{I,i}+{\displaystyle \frac{{\eta }_{I,j,2,i}^{\prime }(t)}{{\tilde{d}}_j}}\notin [-{\displaystyle \frac{d}{2}},{\displaystyle \frac{d}{2}})]\},\end{array}$$ where ${\epsilon }_{R,i}$ and ${\epsilon }_{I,i}$ are the real and imaginary parts of ${\epsilon }_i$, respectively, ${\eta }_{R,j,2,i}^{\prime }\left(t\right)$ and ${\eta }_{I,j,2,i}^{\prime }\left(t\right)$ are the real and imaginary parts of ${\eta }_{j,2,i}^{\prime }\left(t\right)$, respectively.

• (2)

  A decoding error occurs in the cloud server at time instant $N_t$, and it is defined as follows: (A6)$$\begin{array}{c}\hfill E_{N_t}=\{{\epsilon }_{R,N_t}\notin [-{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}},{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}})\cup {\epsilon }_{I,N_t}\notin [-{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,I}}}},{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,I}}}})\},\end{array}$$ where ${\epsilon }_{R,N_t}$ and ${\epsilon }_{I,N_t}$ are the real and imaginary parts of ${\epsilon }_{N_t}$, respectively.

Thus, the error probability $P_{e,t}\left(j\right)$ is bounded by the following:(A7)$$\begin{array}{cc}\hfill P_{e,t}\left(j\right)& \le Pr\left(\bigcup _{i=1}^{N_t}{E}_i\right)=Pr\left(\bigcup _{i=1}^{N_t-1}{E}_i\right)+Pr\left(\bigcap _{i=1}^{N_t-1}{E}_i^c\cap E_{N_t}\right)\hfill \\ \hfill & =\sum _{i=1}^{N_t-1}Pr\left(\bigcap _{j=1}^{i-1}{E}_j^c\cap E_i\right)+Pr\left(\bigcap _{i=1}^{N_t-1}{E}_i^c\cap E_{N_t}\right)\hfill \\ \hfill & =\sum _{i=1}^{N_t-1}Pr\left({\tilde{E}}_i\right)+Pr\left({\tilde{E}}_{N_t}\right),\hfill \end{array}$$ where $E^c$ is the complement of the set E, and ${\tilde{E}}_i={\bigcap }_{j=1}^{i-1}{E}_j^c\cap E_i$. Here, note that $Pr\left({\tilde{E}}_i\right)(i\in \{1,\dots ,N_t-1\})$ is the error probability that a demodulation error occurs at time instant $i+1$, and no error occurs in all previous times. $Pr\left({\tilde{E}}_{N_t}\right)$ is the error probability of the final decoding, and no demodulation error occurs in all times. We assume that $P_{e,t}\le \tau$, which indicates that ${\displaystyle \frac{1}{T}}{\sum }_{t=1}^T{P}_{e,t}\le \tau$ is guaranteed. Then, we choose $P_{e,t}\left(j\right)\le {\displaystyle \frac{\tau }{J}}$, and we have the following:(A8)$$\begin{array}{c}\hfill Pr\left({\tilde{E}}_{N_t}\right)=\sum _{i=1}^{N_t-1}Pr\left({\tilde{E}}_i\right)={\displaystyle \frac{\tau }{2J}},\end{array}$$ for simplification, we define the following:(A9)$$\begin{array}{c}\hfill Pr\left({\tilde{E}}_1\right)=\dots =Pr\left({\tilde{E}}_{N_t-1}\right)=p_m.\end{array}$$ Substituting (A9) into (A8), we have the following:(A10)$$\begin{array}{c}\hfill p_m={\displaystyle \frac{\tau }{2J(N_t-1)}}.\end{array}$$ For the error event ${\tilde{E}}_i$, since no demodulation error occurs before time instant $i+1$, according to (43), (44), and the fact ${\eta }_{j,2,i}^{\prime }\left(t\right)$ is CSCG-distributed, we can conclude the following: ${\gamma }_i{\epsilon }_i+{\displaystyle \frac{{\eta }_{j,2,i}^{\prime }\left(t\right)}{{\tilde{d}}_j}}\sim \mathcal{CN}(0,{\gamma }_i^2{\alpha }_i+{\displaystyle \frac{{\sigma }_2^2}{{\tilde{d}}_j^2}})$. Hence, we have ${\gamma }_i{\epsilon }_{k,i}+{\displaystyle \frac{{\eta }_{k,j,2,i}^{\prime }\left(t\right)}{{\tilde{d}}_j}}\sim \mathcal{N}(0,{\gamma }_i^2{\displaystyle \frac{{\alpha }_i}{2}}+{\displaystyle \frac{{\sigma }_2^2}{2{\tilde{d}}_j^2}})$, where $k\in \{R,I\}$. From (A5) and $d=\sqrt{6{\tilde{P}}_j}$, we have the following:(A11)$$\begin{array}{cc}\hfill Pr(E_i)& =Pr(\{[{\gamma }_i{\epsilon }_{R,i}+{\displaystyle \frac{{\eta }_{R,j,2,i}^{\prime }(t)}{{\tilde{d}}_j}}\notin [-{\displaystyle \frac{d}{2}},{\displaystyle \frac{d}{2}})]\cup [{\gamma }_i{\epsilon }_{I,i}+{\displaystyle \frac{{\eta }_{I,j,2,i}^{\prime }(t)}{{\tilde{d}}_j}}\notin [-{\displaystyle \frac{d}{2}},{\displaystyle \frac{d}{2}})]\})\hfill \\ \hfill & \le Pr({\gamma }_i{\epsilon }_{R,i}+{\displaystyle \frac{{\eta }_{R,j,2,i}^{\prime }(t)}{{\tilde{d}}_j}}\notin [-{\displaystyle \frac{d}{2}},{\displaystyle \frac{d}{2}}))+Pr({\gamma }_i{\epsilon }_{I,i}+{\displaystyle \frac{{\eta }_{I,j,2,i}^{\prime }(t)}{{\tilde{d}}_j}}\notin [-{\displaystyle \frac{d}{2}},{\displaystyle \frac{d}{2}}))\hfill \\ \hfill & =2Q\left(\sqrt{{\displaystyle \frac{\frac{3{\tilde{P}}_j}{2}}{E{({\gamma }_i{\epsilon }_{R,i}+\frac{{\eta }_{R,j,2,i}^{\prime }\left(t\right)}{{\tilde{d}}_j})}^2}}}\right)+2Q\left(\sqrt{{\displaystyle \frac{\frac{3{\tilde{P}}_j}{2}}{E{({\gamma }_i{\epsilon }_{I,i}+\frac{{\eta }_{I,j,2,i}^{\prime }\left(t\right)}{{\tilde{d}}_j})}^2}}}\right)\hfill \\ \hfill & =4Q\left(\sqrt{{\displaystyle \frac{\frac{3{\tilde{P}}_j}{2}}{{\gamma }_i^2\frac{{\alpha }_i}{2}+\frac{{\sigma }_2^2}{2{\tilde{d}}_j^2}}}}\right)=p_m.\hfill \end{array}$$ For simplification, let (A12)$$\begin{array}{c}\hfill \xi ={\displaystyle \frac{1}{3}}{\left[Q^{-1}\left({\displaystyle \frac{p_m}{4}}\right)\right]}^2={\displaystyle \frac{1}{3}}{\left[Q^{-1}\left({\displaystyle \frac{\tau }{8J(N_t-1)}}\right)\right]}^2.\end{array}$$ Substituting (A11) into (A12), we have the following:(A13)$$\begin{array}{c}\hfill {\gamma }_i^2{\displaystyle \frac{{\alpha }_i}{2}}+{\displaystyle \frac{{\sigma }_2^2}{2{\tilde{d}}_j^2}}={\displaystyle \frac{{\tilde{P}}_j}{2\xi }}.\end{array}$$ From (A13), we can conclude the following:(A14)$$\begin{array}{c}\hfill {\gamma }_i=\sqrt{{\displaystyle \frac{1}{{\alpha }_i}}\left({\displaystyle \frac{{\tilde{P}}_j}{\xi }}-{\displaystyle \frac{{\sigma }_2^2}{{\tilde{d}}_j^2}}\right)},\end{array}$$ and note that $X_{j,i+1}^{\prime }\left(t\right)$ is subject to the power constraint $P_j$; hence, we have the following:(A15)$$\begin{array}{c}\hfill E\left[X_{j,i+1}^{\prime }{\left(t\right)}^{\mathcal{H}}{X}_{j,i+1}^{\prime }\left(t\right)\right]={\lambda }_i^{2}E{({\gamma }_i{\epsilon }_i+{\displaystyle \frac{{\eta }_{j,2,i}^{\prime }\left(t\right)}{{\tilde{d}}_j}})}^2=P_j.\end{array}$$ According to (A13), (A15), we conclude the following:(A16)$$\begin{array}{c}\hfill {\lambda }_i=\sqrt{\xi ·{\displaystyle \frac{P_j}{{\tilde{P}}_j}}}.\end{array}$$ From (43), (A14), and (A16), we have the following:(A17)$$\begin{array}{c}\hfill Y_{j,i+1}^{\prime }\left(t\right)=d_j{\lambda }_i({\gamma }_i{\epsilon }_i+{\displaystyle \frac{{\eta }_{j,2,i}^{\prime }\left(t\right)}{{\tilde{d}}_j}})+{\eta }_{j,1,i+1}^{\prime }\left(t\right),\end{array}$$ we have the following:(A18)$$\begin{array}{cc}\hfill {\beta }_{i+1}& ={\displaystyle \frac{{\lambda }_i{\gamma }_i{\alpha }_i}{P_j+\frac{{\sigma }_1^2}{d_j^2}}}={\displaystyle \frac{\sqrt{{\alpha }_i}}{{\sigma }_1}}{\displaystyle \frac{\sqrt{{\mathrm{SNR}}_j(1-\xi ·{\widetilde{\mathrm{SNR}}}_j^{-1}{\tilde{d}}_j^{-2})}}{{\mathrm{SNR}}_j+d_j^{-2}}}.\hfill \end{array}$$ According to (44), (A14), (A16), (A17), and (A18), we have the following:(A19)$$\begin{array}{cc}\hfill {\alpha }_{i+1}& ={\alpha }_i{\left(1+{\mathrm{SNR}}_j{d}_j^2{\displaystyle \frac{1-\xi ·{\widetilde{\mathrm{SNR}}}_j^{-1}{\tilde{d}}_j^{-2}}{1+\xi ·{\mathrm{SNR}}_j·{\widetilde{\mathrm{SNR}}}_j^{-1}{d}_j^2{\tilde{d}}_j^{-2}}}\right)}^{-1}=2d_j^{-2}{\mathrm{SNR}}_j^{-1}{\left(1+{\displaystyle \frac{{\mathrm{SNR}}_j{d}_j^2}{{\mathsf{\Psi }}_1{\mathsf{\Psi }}_2}}\right)}^{-i},\hfill \end{array}$$ where ${\mathsf{\Psi }}_1$, ${\mathsf{\Psi }}_2$, and $\xi$ are defined in (19). From (A6)–(A8), we have the following:(A20)$$\begin{array}{cc}\hfill Pr\left({\tilde{E}}_{N_t}\right)& \le Pr\{{\epsilon }_{R,N_t}\notin [-{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}},{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}})\}+Pr\{{\epsilon }_{I,N_t}\notin [-{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,I}}}},{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,I}}}})\}\le {\displaystyle \frac{\tau }{2J}},\hfill \end{array}$$ and let (A21)$$\begin{array}{c}\hfill Pr\{{\epsilon }_{R,N_t}\notin [-{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}},{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}})\}=Pr\{{\epsilon }_{I,N_t}\notin [-{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,I}}}},{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,I}}}})\}={\displaystyle \frac{\tau }{4J}}.\end{array}$$ Next, we first analyze the term $Pr\{{\epsilon }_{R,N_t}\notin [-{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}},{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}})\}={\displaystyle \frac{\tau }{4J}}$, i.e., (A22)$$\begin{array}{c}\hfill Pr\{{\epsilon }_{R,N_t}\notin [-{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}},{\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}})\}=2Q\left({\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}}·{\displaystyle \frac{1}{\sqrt{{\alpha }_{R,N_t}}}}\right)=2Q\left({\displaystyle \frac{\sqrt{3}}{2^{N_t{R}_{t,j,R}}}}·{\displaystyle \frac{1}{\sqrt{\frac{{\alpha }_{N_t}}{2}}}}\right)={\displaystyle \frac{\tau }{4J}}.\end{array}$$ Substituting (A19) into (A22), we have the following:(A23)$$\begin{array}{c}\hfill R_{t,j,R}={\displaystyle \frac{1}{2N_t}}log\left({\displaystyle \frac{3{\mathrm{SNR}}_j{d}_j^2}{{\left[Q^{-1}\left(\frac{\tau }{8J}\right)\right]}^2}}{\left(1+{\displaystyle \frac{{\mathrm{SNR}}_j{d}_j^2}{{\mathsf{\Psi }}_1{\mathsf{\Psi }}_2}}\right)}^{N_t-1}\right).\end{array}$$ Analogously, we can show that $R_{t,j,I}=R_{t,j,R}$. The transmission rate of the j-th $(j=1,\dots ,J)$ parallel sub-channel in the t-th round is given by the following:(A24)$$R_{t,j}=R_{t,j,R}+R_{t,j,I}={\displaystyle \frac{1}{N_t}}log\left({\displaystyle \frac{3{\mathrm{SNR}}_j{d}_j^2}{{\left[Q^{-1}\left(\frac{\tau }{8J}\right)\right]}^2}}{\left(1+{\displaystyle \frac{{\mathrm{SNR}}_j{d}_j^2}{{\mathsf{\Psi }}_1{\mathsf{\Psi }}_2}}\right)}^{N_t-1}\right).$$ Combining (A24) and (36), and power allocating in Section 3.1.1, (18) in Theorem 1 is obtained. Then, according to $R={\displaystyle \frac{H(W_1^{\prime \prime },\dots ,W_T^{\prime \prime })}{N}}$ in (15), the transmission rate $R_{mimo}(\tau ,N,\delta ,D,\upsilon ,ϵ)$ is given by the following:(A25)$$\begin{array}{c}\hfill R_{mimo}(\tau ,N,\delta ,D,\upsilon ,ϵ)={\displaystyle \frac{H(W_1^{″},\dots ,W_T^{″})}{N}}\stackrel{\left(b\right)}{=}{\displaystyle \frac{{\sum }_{t=1}^{T}H\left(W_t^{\prime \prime }\right)}{N}}={\displaystyle \frac{{\sum }_{t=1}^T{N}_t{R}_t}{N}},\end{array}$$ where $N={\sum }_{t=1}^T{N}_t$, and (b) is due to the fact that ${\mathit{W}}_t^{\prime }$ is mapped into the uniformly distributed index $W_t^{″}$ in each communication round, which indicates that $(W_1^{″},\dots ,W_T^{″})$ are independent of each other; hence, (17) in Theorem 1 is obtained. A brief convergence analysis of our FBL approach is given below.

Convergence analysis: Following the convergence proof in [18,22], we can prove the existence of convergence in the WHFL system with our FBL scheme when the decoding error probability of our FBL scheme is significantly small. Furthermore, from (A19) and (A22), we conclude that the variance of the estimation error in our FBL approach converges to zero with double-exponential speed, which indicates that the final estimation ${\widehat{\theta }}_{j,N_t}$ can always converge to ${\theta }_j$, and the required coding block length for achieving the desired decoding error probability is significantly short.

Appendix A.3. Security Analysis

First, note that the eavesdropper’s equivocation rate, $\mathsf{\Delta }$, can be re-written as follows:(A26)$$\begin{array}{cc}\hfill \mathsf{\Delta }& ={\displaystyle \frac{H(W_1^{″},\dots ,W_T^{″}|{\mathit{Z}}^{N_1},\dots ,{\mathit{Z}}^{N_T},{\mathit{h}}_{mimo},{\tilde{\mathit{h}}}_{mimo},{\mathit{g}}_{mimo},{\tilde{\mathit{g}}}_{mimo})}{H(W_1^{″},\dots ,W_T^{″})}}\hfill \\ \hfill & ={\displaystyle \frac{{\sum }_{t=1}^{T}H\left(W_t^{\prime \prime }\right|{\mathit{Z}}^{N_1},\dots ,{\mathit{Z}}^{N_T},{\mathit{h}}_{mimo},{\tilde{\mathit{h}}}_{mimo},{\mathit{g}}_{mimo},{\tilde{\mathit{g}}}_{mimo},W_1^{\prime \prime },\dots ,W_{t-1}^{\prime \prime })}{H(W_1^{″},\dots ,W_T^{″})}}\hfill \\ \hfill & \stackrel{\left(c\right)}{=}{\displaystyle \frac{{\sum }_{t=1}^{T}H\left(W_t^{\prime \prime }\right|{\mathit{Z}}^{N_t},{\mathit{h}}_{mimo},{\tilde{\mathit{h}}}_{mimo},{\mathit{g}}_{mimo},{\tilde{\mathit{g}}}_{mimo})}{H(W_1^{″},\dots ,W_T^{″})}}={\displaystyle \frac{{\sum }_{t=1}^{T}H\left(W_t^{\prime \prime }\right|{\mathit{Z}}^{N_t},{\mathit{h}}_{mimo},{\tilde{\mathit{h}}}_{mimo},{\mathit{g}}_{mimo},{\tilde{\mathit{g}}}_{mimo})}{{\sum }_{t=1}^{T}H\left(W_t^{\prime \prime }\right)}},\hfill \end{array}$$ where (c) follows from the Markov chain $W_t^{″}\to ({\mathit{Z}}^{N_t},{\mathit{h}}_{mimo},{\tilde{\mathit{h}}}_{mimo},{\mathit{g}}_{mimo},{\tilde{\mathit{g}}}_{mimo})\to ({\mathit{Z}}^{N_1},\dots ,$ ${\mathit{Z}}^{N_{t-1}},{\mathit{Z}}^{N_{t+1}},\dots ,{\mathit{Z}}^{N_T},W_1^{″},\dots ,W_{t-1}^{″})$. The term $H\left(W_t^{″}\right|{\mathit{Z}}^{N_t},{\mathit{h}}_{mimo},{\tilde{\mathit{h}}}_{mimo},{\mathit{g}}_{mimo},{\tilde{\mathit{g}}}_{mimo})$ in (A26) is given by the following:(A27)$$\begin{array}{cc}\hfill & H\left(W_t^{″}\right|{\mathit{Z}}^{N_t},{\mathit{h}}_{mimo},{\tilde{\mathit{h}}}_{mimo},{\mathit{g}}_{mimo},{\tilde{\mathit{g}}}_{mimo})\hfill \\ \hfill & \stackrel{\left(e\right)}{\ge }H\left(W_t^{″}\right|\underset{{\mathit{Z}}_1\left(t\right)}{\underbrace{{\mathit{g}}_{mimo}{\mathit{X}}_1\left(t\right)+{\tilde{\mathit{g}}}_{mimo}{\tilde{\mathit{X}}}_1\left(t\right)+{\mathsf{\eta }}_{e,1}\left(t\right)}},\dots ,\underset{{\mathit{Z}}_{N_t-1}\left(t\right)}{\underbrace{{\mathit{g}}_{mimo}{\mathit{X}}_{N_t-1}\left(t\right)+{\tilde{\mathit{g}}}_{mimo}{\tilde{\mathit{X}}}_{N_t-1}\left(t\right)+{\mathsf{\eta }}_{e,N_t-1}\left(t\right)}},\hfill \\ \hfill & \underset{{\mathit{Z}}_{N_t}\left(t\right)}{\underbrace{{\mathit{g}}_{mimo}{\mathit{X}}_{N_t}\left(t\right)+{\mathsf{\eta }}_{e,N_t}\left(t\right)}},{\mathsf{\eta }}_{1,1}\left(t\right),\dots ,{\mathsf{\eta }}_{1,N_t}\left(t\right),{\mathsf{\eta }}_{2,1}\left(t\right),\dots ,{\mathsf{\eta }}_{2,N_t}\left(t\right),{\mathsf{\eta }}_{e,2}\left(t\right),\dots ,{\mathsf{\eta }}_{e,N_t}\left(t\right),{\tilde{\mathit{X}}}_1^{\prime }\left(t\right),\dots ,{\tilde{\mathit{X}}}_{N_t-1}^{\prime }\left(t\right),{\mathit{h}}_{mimo},\hfill \\ \hfill & {\tilde{\mathit{h}}}_{mimo},{\mathit{g}}_{mimo},{\tilde{\mathit{g}}}_{mimo},\mathit{U},\mathsf{\Lambda },\mathit{V},\tilde{\mathit{U}},\tilde{\mathsf{\Lambda }},\tilde{\mathit{V}})\hfill \\ \hfill & \stackrel{\left(f\right)}{=}H\left(W_t^{″}\right|{\mathit{g}}_{mimo}\mathit{V}{\mathit{X}}_1^{\prime }\left(t\right)+{\mathsf{\eta }}_{e,1}\left(t\right),{\mathsf{\eta }}_{1,1}\left(t\right),\dots ,{\mathsf{\eta }}_{1,N_t}\left(t\right),{\mathsf{\eta }}_{2,1}\left(t\right),\dots ,{\mathsf{\eta }}_{2,N_t}\left(t\right),{\mathsf{\eta }}_{e,2}\left(t\right),\dots ,{\mathsf{\eta }}_{e,N_t}\left(t\right),{\tilde{\mathit{X}}}_1^{\prime }\left(t\right),\dots ,{\tilde{\mathit{X}}}_{N_t-1}^{\prime }\left(t\right),\hfill \\ \hfill & {\mathit{h}}_{mimo},{\tilde{\mathit{h}}}_{mimo},{\mathit{g}}_{mimo},{\tilde{\mathit{g}}}_{mimo},\mathit{U},\mathsf{\Lambda },\mathit{V},\tilde{\mathit{U}},\tilde{\mathsf{\Lambda }},\tilde{\mathit{V}})\hfill \\ \hfill & \stackrel{\left(g\right)}{=}H\left(W_t^{″}\right|{\mathit{g}}_{mimo}\mathit{V}{\mathit{X}}_1^{\prime }\left(t\right)+{\mathsf{\eta }}_{e,1}\left(t\right))\stackrel{\left(h\right)}{=}H\left(W_t^{″}\right)+h\left({\mathsf{\eta }}_{e,1}\left(t\right)\right)-h({\mathit{g}}_{mimo}\mathit{V}{\mathit{X}}_1^{\prime }\left(t\right)+{\mathsf{\eta }}_{e,1}\left(t\right))\hfill \\ \hfill & \stackrel{\left(i\right)}{=}H\left(W_t^{″}\right)-\underset{\mathbf{Information}\mathbf{leakage}\mathbf{at}\mathbf{time}\mathbf{1}}{\underbrace{logdet\left(\mathit{I}+{\displaystyle \frac{{\mathit{g}}_{mimo}{\mathit{K}}_{x_1}{\mathit{g}}_{mimo}^{\mathcal{H}}}{{\sigma }_e^2}}\right)}},\hfill \end{array}$$ where

(e) follows from the fact that conditioning reduces entropy, as shown in (28),

(f) follows from ${\mathit{X}}_i^{\prime }\left(t\right)={\mathit{V}}^{\mathcal{H}}{\mathit{X}}_i\left(t\right),{\tilde{\mathit{X}}}_i^{\prime }\left(t\right)={\tilde{\mathit{V}}}^{\mathcal{H}}{\tilde{\mathit{X}}}_i\left(t\right)$ and ${\mathit{X}}_i^{\prime }\left(t\right)$$(i=2,\dots ,N_t)$ is a function of ${\mathit{h}}_{mimo},{\tilde{\mathit{h}}}_{mimo},{\mathsf{\eta }}_{1,1}\left(t\right),$$\dots ,{\mathsf{\eta }}_{1,i-1}\left(t\right),{\mathsf{\eta }}_{2,1}\left(t\right),\dots ,{\mathsf{\eta }}_{2,i-1}\left(t\right)$,

(g) follows from the fact that ${\tilde{\mathit{X}}}_i^{\prime }\left(t\right)$$(i=1,\dots ,N_t-1)$ is only related to ${\nu }_i$ [39] [Chapter 4.1, pp. 61–63], and ${\mathit{h}}_{mimo}$, ${\tilde{\mathit{h}}}_{mimo}$, ${\mathit{g}}_{mimo}$, ${\tilde{\mathit{g}}}_{mimo}$, $\mathit{U}$, $\mathsf{\Lambda }$, $\mathit{V}$, $\tilde{\mathit{U}}$, $\tilde{\mathsf{\Lambda }}$, $\tilde{\mathit{V}}$, ${\mathsf{\eta }}_{1,1}\left(t\right),\dots ,{\mathsf{\eta }}_{1,N_t}\left(t\right)$, ${\mathsf{\eta }}_{2,1}\left(t\right),\dots ,{\mathsf{\eta }}_{2,N_t}\left(t\right)$, ${\mathsf{\eta }}_{e,2}\left(t\right),\dots ,{\mathsf{\eta }}_{e,N_t}\left(t\right)$, ${\nu }_1,\dots ,{\nu }_{N_t-1}$ are independent of $W_t^{″}$, ${\mathit{X}}_1^{\prime }\left(t\right)$, ${\mathsf{\eta }}_{e,1}\left(t\right)$,

(h) is due to the fact that (33) and $X_{j,1}^{\prime }\left(t\right)=\sqrt{{\displaystyle \frac{P_j}{2}}}{\theta }_j$, and $W_t^{″}=(W_{t,1}^{″},$$\dots ,W_{t,J}^{″})$ are mapped into $({\theta }_1,\dots ,{\theta }_J)$, respectively,

(i) follows from the following:(A28)$$\begin{array}{cc}\hfill h({\mathit{g}}_{mimo}\mathit{V}{\mathit{X}}_1^{\prime }\left(t\right)+{\mathsf{\eta }}_{e,1}\left(t\right))-h\left({\mathsf{\eta }}_{e,1}\left(t\right)\right)& \le logdet\left(\mathit{I}+{\displaystyle \frac{{\mathit{g}}_{mimo}\mathit{V}E\left({\mathit{X}}_1^{\prime }\left(t\right){\mathit{X}}_1^{\prime \mathcal{H}}\left(t\right)\right){\mathit{V}}^{\mathcal{H}}{\mathit{g}}_{mimo}^{\mathcal{H}}}{{\sigma }_e^2}}\right)\hfill \\ \hfill & =logdet\left(\mathit{I}+{\displaystyle \frac{{\mathit{g}}_{mimo}E\left({\mathit{X}}_1\left(t\right){\mathit{X}}_1^{\mathcal{H}}\left(t\right)\right){\mathit{g}}_{mimo}^{\mathcal{H}}}{{\sigma }_e^2}}\right),\hfill \end{array}$$ and ${\mathit{K}}_{x_1}=E\left({\mathit{X}}_1\left(t\right){\mathit{X}}_1^{\mathcal{H}}\left(t\right)\right)$. Substituting (A27) into (A26), we have the following:(A29)$$\begin{array}{cc}\hfill \mathsf{\Delta }& \ge {\displaystyle \frac{{\sum }_{t=1}^{T}H\left(W_t^{\prime \prime }\right)\left(1-\frac{logdet\left(\mathit{I}+\frac{{\mathit{g}}_{mimo}{\mathit{K}}_{x_1}{\mathit{g}}_{mimo}^{\mathcal{H}}}{{\sigma }_e^2}\right)}{H\left(W_t^{\prime \prime }\right)}\right)}{{\sum }_{t=1}^{T}H\left(W_t^{\prime \prime }\right)}}\ge \underset{t\in \{1,\dots ,T\}}{min}\left(1-{\displaystyle \frac{logdet\left(\mathit{I}+\frac{{\mathit{g}}_{mimo}{\mathit{K}}_{x_1}{\mathit{g}}_{mimo}^{\mathcal{H}}}{{\sigma }_e^2}\right)}{H\left(W_t^{\prime \prime }\right)}}\right).\hfill \end{array}$$ From (8), (35) and (A29), $\mathsf{\Delta }\ge \delta$ in (15) is guaranteed if we have the following:(A30)$$\begin{array}{c}\hfill {\sigma }^2\ge \underset{\mathbf{Secrecy}\mathbf{level}\mathbf{of}\mathbf{PLS}}{\underbrace{\underset{t\in \{1,\dots ,T\}}{max}\left[{\displaystyle \frac{D·2^{\frac{2}{q(1-\delta )}logdet\left(\mathit{I}+\frac{{\mathit{g}}_{mimo}{\mathit{K}}_{x_1}{\mathit{g}}_{mimo}^{\mathcal{H}}}{{\sigma }_e^2}\right)}-S_{\ell }{\sigma }_{w,t}^2}{K}}\right]}}.\end{array}$$ With the assumption that the edge server has an imperfect CSI of the eavesdropper’s channel, combining (A30) and Definition 3, (A30) can be re-written by the following:(A31)$$\begin{array}{c}\hfill {\sigma }^2\ge \underset{\mathbf{Secrecy}\mathbf{level}\mathbf{of}\mathbf{PLS}}{\underbrace{\underset{t\in \{1,\dots ,T\},\mathsf{\Delta }{g}_{mimo}}{max}\left[{\displaystyle \frac{D·2^{\frac{2}{q(1-\delta )}logdet\left(\mathit{I}+\frac{{\widehat{\mathit{g}}}_{mimo}{\mathit{K}}_{x_1}{\widehat{\mathit{g}}}_{mimo}^{\mathcal{H}}}{{\sigma }_e^2}\right)}-S_{\ell }{\sigma }_{w,t}^2}{K}}\right]}},\end{array}$$ where ${\widehat{\mathit{g}}}_{mimo}={\mathit{g}}_{mimo}-\mathsf{\Delta }{\mathit{g}}_{mimo}$. Then, combining (A3) and (A31), (16) in Theorem 1 is obtained.

The proof of Theorem 1 is completed.

References

1. Zhu, G.; Liu, D.; Du, Y.; You, C.; Zhang, J.; Huang, K. Toward an Intelligent Edge: Wireless Communication Meets Machine Learning. IEEE Commun. Mag.; 2020; 58, pp. 19-25. [DOI: https://dx.doi.org/10.1109/MCOM.001.1900103]

2. Yang, Z.; Chen, M.; Saad, W.; Hong, C.S.; Shikh-Bahaei, M. Energy Efficient Federated Learning Over Wireless Communication Networks. IEEE Trans. Wireless Commun.; 2021; 20, pp. 1935-1949. [DOI: https://dx.doi.org/10.1109/TWC.2020.3037554]

3. Amiri, M.M.; Gündüz, D. Federated Learning Over Wireless Fading Channels. IEEE Trans. Wireless Commun.; 2020; 19, pp. 3546-3557. [DOI: https://dx.doi.org/10.1109/TWC.2020.2974748]

4. Jin, R.; He, X.; Dai, H. Communication Efficient Federated Learning with Energy Awareness Over Wireless Networks. IEEE Trans. Wireless Commun.; 2022; 21, pp. 5204-5219. [DOI: https://dx.doi.org/10.1109/TWC.2021.3138394]

5. Zhu, G.; Wang, Y.; Huang, K. Broadband Analog Aggregation for Low-Latency Federated Edge Learning. IEEE Trans. Wireless Commun.; 2020; 19, pp. 491-506. [DOI: https://dx.doi.org/10.1109/TWC.2019.2946245]

6. Zhu, G.; Du, Y.; Gündüz, D.; Huang, K. One-Bit Over-the-Air Aggregation for Communication-Efficient Federated Edge Learning: Design and Convergence Analysis. IEEE Trans. Wireless Commun.; 2021; 20, pp. 2120-2135. [DOI: https://dx.doi.org/10.1109/TWC.2020.3039309]

7. Elgabli, A.; Park, J.; Issaid, C.B.; Bennis, M. Harnessing Wireless Channels for Scalable and Privacy-Preserving Federated Learning. IEEE Trans. Commun.; 2021; 69, pp. 5194-5208. [DOI: https://dx.doi.org/10.1109/TCOMM.2021.3078783]

8. Wen, H.; Wu, Y.; Yang, C.; Duan, H.; Yu, S. A Unified Federated Learning Framework for Wireless Communications: Towards Privacy, Efficiency, and Security. Proceedings of the 2020 IEEE INFOCOM Computer Communications Workshops (INFOCOM WKSHPS); Toronto, ON, Canada, 6–9 July 2020; pp. 653-658.

9. Seif, M.; Tandon, R.; Li, M. Wireless Federated Learning with Local Differential Privacy. Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT); Los Angeles, CA, USA, 21–26 June 2020; pp. 2604-2609.

10. Yuan, X.; Ni, W.; Ding, M.; Wei, K.; Li, J.; Poor, H.V. Amplitude-Varying Perturbation for Balancing Privacy and Utility in Federated Learning. IEEE Trans. Inf. Forensics Secur.; 2023; 18, pp. 1884-1897. [DOI: https://dx.doi.org/10.1109/TIFS.2023.3258255]

11. Kim, M.; Günlü, O.; Schaefer, R.F. Federated Learning with Local Differential Privacy: Trade-Offs Between Privacy, Utility, and Communication. Proceedings of the 2021 IEEE International Conference on Acoustics, Speech and Signal Process (ICASSP); Toronto, ON, Canada, 6–11 June 2021; pp. 2650-2654.

12. Zhou, J.; Su, Z.; Ni, J.; Wang, Y.; Pan, Y.; Xing, R. Personalized Privacy-Preserving Federated Learning: Optimized Trade-off Between Utility and Privacy. Proceedings of the 2022 IEEE Global Communications Conference (GLOBECOM); Rio de Janeiro, Brazil, 4–8 December 2022; pp. 4872-4877.

13. Guo, S.; Su, Z.; Tian, Z.; Yu, S. Utility-Aware Privacy-Preserving Federated Learning through Information Bottleneck. Proceedings of the 2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom); Wuhan, China, 9–11 December 2022; pp. 680-686.

14. Wang, B.; Chen, Y.; Jiang, H.; Zhao, Z. PPeFL: Privacy-Preserving Edge Federated Learning with Local Differential Privacy. IEEE Internet Things J.; 2023; 10, pp. 15488-15500. [DOI: https://dx.doi.org/10.1109/JIOT.2023.3264259]

15. Zhang, N.; Tao, M. Gradient Statistics Aware Power Control for Over-the-Air Federated Learning. IEEE Trans. Wireless Commun.; 2021; 20, pp. 5115-5128. [DOI: https://dx.doi.org/10.1109/TWC.2021.3065748]

16. Liu, D.; Simeone, O. Privacy for Free: Wireless Federated Learning via Uncoded Transmission with Adaptive Power Control. IEEE J. Sel. Areas Commun.; 2021; 39, pp. 170-185. [DOI: https://dx.doi.org/10.1109/JSAC.2020.3036948]

17. Yang, K.; Jiang, T.; Shi, Y.; Ding, Z. Federated Learning via Over-the-Air Computation. IEEE Trans. Wireless Commun.; 2020; 19, pp. 2022-2035. [DOI: https://dx.doi.org/10.1109/TWC.2019.2961673]

18. Liu, L.; Zhang, J.; Song, S.H.; Letaief, K.B. Client-Edge-Cloud Hierarchical Federated Learning. Proceedings of the 2020 IEEE International Conference on Communications (ICC); Dublin, Ireland, 7–11 June 2020; pp. 1-6.

19. Luo, S.; Chen, X.; Wu, Q.; Zhou, Z.; Yu, S. HFEL: Joint Edge Association and Resource Allocation for Cost-Efficient Hierarchical Federated Edge Learning. IEEE Trans. Wireless Commun.; 2020; 19, pp. 6535-6548. [DOI: https://dx.doi.org/10.1109/TWC.2020.3003744]

20. Liu, S.; Yu, G.; Chen, X.; Bennis, M. Joint User Association and Resource Allocation for Wireless Hierarchical Federated Learning with IID and Non-IID Data. IEEE Trans. Wireless Commun.; 2022; 21, pp. 7852-7866. [DOI: https://dx.doi.org/10.1109/TWC.2022.3162595]

21. Wen, W.; Chen, Z.; Yang, H.H.; Xia, W.; Quek, T.Q.S. Joint Scheduling and Resource Allocation for Hierarchical Federated Edge Learning. IEEE Trans. Wireless Commun.; 2022; 21, pp. 5857-5872. [DOI: https://dx.doi.org/10.1109/TWC.2022.3144140]

22. Shi, L.; Shu, J.; Zhang, W.; Liu, Y. HFL-DP: Hierarchical Federated Learning with Differential Privacy. Proceedings of the 2021 IEEE Global Communications Conference (GLOBECOM); Madrid, Spain, 7–11 December 2021; pp. 1-7.

23. Wainakh, A.; Guinea, A.S.; Grube, T.; Mühlhäuser, M. Enhancing Privacy via Hierarchical Federated Learning. Proceedings of the 2020 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW); Genoa, Italy, 7–11 September 2020; pp. 344-347.

24. Feng, C.; Yang, H.H.; Hu, D.; Zhao, Z.; Quek, T.Q.S.; Min, G. Mobility-Aware Cluster Federated Learning in Hierarchical Wireless Networks. IEEE Trans. Wireless Commun.; 2022; 21, pp. 8441-8458. [DOI: https://dx.doi.org/10.1109/TWC.2022.3166386]

25. Wyner, A.D. The Wire-Tap Channel. Bell Syst. Tech. J.; 1975; 54, pp. 1355-1387. [DOI: https://dx.doi.org/10.1002/j.1538-7305.1975.tb02040.x]

26. Yao, J.; Ansari, N. Secure Federated Learning by Power Control for Internet of Drones. IEEE Trans. Cognitive Commun. Netw.; 2021; 7, pp. 1021-1031. [DOI: https://dx.doi.org/10.1109/TCCN.2021.3076167]

27. Wang, T.; Li, Y.; Wu, Y.; Quek, T.Q.S. Secrecy driven Federated Learning via Cooperative Jamming: An Approach of Latency Minimization. IEEE Trans. Emerg. Topics Comput.; 2021; 10, pp. 1687-1703. [DOI: https://dx.doi.org/10.1109/TETC.2022.3159282]

28. Qian, L.; Wu, W.; Lu, W.; Wu, Y.; Lin, B.; Quek, T.Q.S. Secrecy-Based Energy-Efficient Mobile Edge Computing via Cooperative Non-Orthogonal Multiple Access Transmission. IEEE Trans. Commun.; 2021; 69, pp. 4659-4677. [DOI: https://dx.doi.org/10.1109/TCOMM.2021.3070620]

29. Yan, Z.; Li, D.; Zhang, Z.; He, J. Accuracy-Security Tradeoff with Balanced Aggregation and Artificial Noise for Wireless Federated Learning. IEEE Internet Things J.; 2023; 10, pp. 18154-18167. [DOI: https://dx.doi.org/10.1109/JIOT.2023.3277632]

30. Zhang, H.; Yang, C.; Dai, B. When Wireless Federated Learning Meets Physical Layer Security: The Fundamental Limits. Proceedings of the IEEE INFOCOM Computer Communications Workshops (INFOCOM WKSHPS); New York, NY, USA, 2–5 May 2022; pp. 1-6.

31. Durisi, G.; Koch, T.; Popovski, P. Toward Massive, Ultrareliable, and Low-Latency Wireless Communication with Short Packets. Proc. IEEE; 2016; 104, pp. 1711-1726. [DOI: https://dx.doi.org/10.1109/JPROC.2016.2537298]

32. Polyanskiy, Y.; Poor, H.V.; Verdu, S. Channel Coding Rate in the Finite Blocklength Regime. IEEE Trans. Inf. Theory; 2010; 56, pp. 2307-2359. [DOI: https://dx.doi.org/10.1109/TIT.2010.2043769]

33. She, C.; Dong, R.; Gu, Z.; Hou, Z.; Li, Y.; Hardjawana, W.; Vucetic, B.; Song, L.; Yang, C. Deep Learning for Ultra-Reliable and Low-Latency Communications in 6G Networks. IEEE Netw.; 2020; 34, pp. 219-225. [DOI: https://dx.doi.org/10.1109/MNET.011.1900630]

34. Samarakoon, S.; Bennis, M.; Saad, W.; Debbah, M. Distributed Federated Learning for Ultra-Reliable Low-Latency Vehicular Communications. IEEE Trans. Commun.; 2020; 68, pp. 1146-1159. [DOI: https://dx.doi.org/10.1109/TCOMM.2019.2956472]

35. Schalkwijk, J.; Kailath, T. A coding scheme for additive noise channels with feedback–I: No bandwidth constraint. IEEE Trans. Inf. Theory; 1966; 12, pp. 172-182. [DOI: https://dx.doi.org/10.1109/TIT.1966.1053879]

36. Gunduz, D.; Brown, D.R.; Poor, H.V. Secret communication with feedback. Proceedings of the 2008 International Symposium on Information Theory and Its Applications (ISITA); Auckland, New Zealand, 7–10 December 2008; pp. 1-6.

37. Truong, L.V.; Fong, S.L.; Tan, V.Y.F. On Gaussian Channels with Feedback Under Expected Power Constraints and with Non-Vanishing Error Probabilities. IEEE Trans. Inf. Theory; 2017; 63, pp. 1746-1765. [DOI: https://dx.doi.org/10.1109/TIT.2017.2648822]

38. Abadi, M.; Chu, A.; Goodfellow, I.; McMahan, H.B.; Mironov, I.; Talwar, K.; Zhang, L. Deep Learning with Differential Privacy. Proceedings of the ACM SIGSAC Conference on Computer and Communications Security; Vienna, Austria, 24–28 October 2016; pp. 303-318.

39. Zamir, R. Lattice Coding for Signals and Network; Cambridge University Press: Cambridge, UK, 2014.

40. Zhi, K.; Pan, C.; Ren, H.; Wang, K.; Elkashlan, M.; Di Renzo, M.; Hanzo, L.; Schober, R.; Wang, J. Two-Timescale Design for Reconfigurable Intelligent Surface-Aided Massive MIMO Systems with Imperfect CSI. IEEE Trans. Inf. Theory; 2022; 69, pp. 3001-3033. [DOI: https://dx.doi.org/10.1109/TIT.2022.3227538]

41. Schiessl, S.; Al-Zubaidy, H.; Skoglund, M.; Gross, J. Delay Performance of Wireless Communications with Imperfect CSI and Finite-Length Coding. IEEE Trans. Commun.; 2018; 66, pp. 6527-6541. [DOI: https://dx.doi.org/10.1109/TCOMM.2018.2860000]

42. Chen, Z.J.; Hernandez, E.E.; Huang, Y.C.; Rini, S. DNN gradient lossless compression: Can GenNorm be the answer?. Proceedings of the 2022 IEEE International Conference on Communications (ICC); Seoul, Republic of Korea, 16–20 May 2022; pp. 407-412.

43. Wang, W.; Ying, L.; Zhang, J. On the Relation Between Identifiability, Differential Privacy, and Mutual-Information Privacy. IEEE Trans. Inf. Theory; 2016; 62, pp. 5018-5029. [DOI: https://dx.doi.org/10.1109/TIT.2016.2584610]

44. Sankar, L.; Rajagopalan, S.R.; Poor, H.V. Utility-Privacy Tradeoffs in Databases: An Information-Theoretic Approach. IEEE Trans. Inf. Forensics Secur.; 2013; 8, pp. 838-852. [DOI: https://dx.doi.org/10.1109/TIFS.2013.2253320]

45. Gamal, A.A.E.; Kim, Y.-H. Network Information Theory; Cambridge University Press: Cambridge, UK, 2011.

46. Han, S.; Xu, X.; Fang, S.; Sun, Y.; Cao, Y.; Tao, X.; Zhang, P. Energy Efficient Secure Computation Offloading in NOMA-Based mMTC Networks for IoT. IEEE Internet Things J.; 2019; 6, pp. 5674-5690. [DOI: https://dx.doi.org/10.1109/JIOT.2019.2904741]

47. Ng, D.W.K.; Lo, E.S.; Schober, R. Robust Beamforming for Secure Communication in Systems with Wireless Information and Power Transfer. IEEE Trans. Wireless Commun.; 2014; 13, pp. 4599-4615. [DOI: https://dx.doi.org/10.1109/TWC.2014.2314654]

48. Tekin, E.; Yener, A. The Gaussian Multiple Access Wire-Tap Channel. IEEE Trans. Inf. Theory; 2008; 54, pp. 5747-5755. [DOI: https://dx.doi.org/10.1109/TIT.2008.2006422]

49. Tse, D.; Viswanath, P. Fundamentals of Wireless Communication; Cambridge University Press: Cambridge, UK, 2005.

50. Welch, T.A. A technique of high-performance data compression. IEEE Comput.; 1984; 17, pp. 8-19. [DOI: https://dx.doi.org/10.1109/MC.1984.1659158]