Over-the-Air Computation via Broadband Channels
Abstract
††The authors are with School of Electrical and Information Engineering, the University of Sydney, Australia. Emails: {tianrui.qin, wanchun.liu, branka.vucetic, yonghui.li}@sydney.edu.au. (Wanchun Liu is the corresponding author.)Over-the-air computation (AirComp) has been recognized as a low-latency solution for wireless sensor data fusion, where multiple sensors send their measurement signals to a receiver simultaneously for computation. Most existing work only considered performing AirComp over a single frequency channel. However, for a sensor network with a massive number of nodes, a single frequency channel may not be sufficient to accommodate the large number of sensors, and the AirComp performance will be very limited. So it is highly desirable to have more frequency channels for large-scale AirComp systems to benefit from multi-channel diversity. In this letter, we propose an -frequency AirComp system, where each sensor selects a subset of the frequencies and broadcasts its signal over these channels under a certain power constraint. We derive the optimal sensors’ transmission and receiver’s signal processing methods separately, and develop an algorithm for joint design to achieve the best AirComp performance. Numerical results show that increasing one frequency channel can improve the AirComp performance by threefold compared to the single-frequency case.
Index Terms:
Over-the-air computation, wireless sensor networks, multiple-access channel, mean-squared error.I Introduction
During the past few years, over-the-air computation (AirComp) has emerged as a low-latency solution for large-scale wireless data fusion in many applications including Internet of Things [1, 2, 3, 4, 5, 6], wireless distributed machine learning [7, 8, 9], and over-the-air consensus [10]. Normally, an AirComp system consists of multiple sensors and a fusion center computing the sum of the sensor measurements. Multiple sensors send their measurement-carrying signals simultaneously to the fusion center over a multiple-access channel (MAC). The fusion center receives the superimposed signal of multiple sensors, and then estimates the sum of the sensors’ measurements (see e.g. [2] for more details).
Many existing research focuses on optimal transmitter and receiver policy design of AirComp systems for achieving the minimum computation mean-square error (MSE) of the sum sensor signals [1, 2, 3, 4, 5, 6]. In [1], the computation MSE under imperfect channel state information was investigated. In [2] and [3], the optimal transmitter (Tx) and receiver (Rx) scaling factor design of a single-antenna AirComp system under individual and sum power constraints were obtained, respectively. In particular, a comprehensive comparison study of the AirComp design problem and the conventional minimum mean-square error (MMSE) problem was included in [2], showing that the problem solutions are different. In [4], the optimal AirComp design with spatial and temporal correlated sensor signals was investigated. In [5] and [6], the transmitting and receiving beamforming design problems of multi-antenna AirComp systems were considered.
In addition to [1, 2, 3, 4, 5, 6] that considers AirComp design over a single frequency channel, recently a broadband AirComp system with frequency channels was proposed in [9] for distributed machine learning, where AirComp tasks were performed over frequency channels separately. In other words, each frequency channel is dedicated to one AirComp task, which is the same as the single-frequency AirComp in [1, 2, 3, 4, 5, 6]. For a large-scale sensor network, the performance of AirComp over a single frequency is quite limited as many sensors may have poor conditions in that channel. Thus, it is desirable to provide more frequency channels for large-scale AirComp systems to benefit from channel diversity.
In this work, we consider an -frequency AirComp system and investigate the optimal Tx and Rx policy design. Compared with the conventional single-frequency scenario, one needs to 1) determine the sensors’ transmission policy at the -frequency channel to optimally utilize the channel diversity for signal aggregation, noting that each sensor has access to any subset of the frequencies; and 2) design the fusion center’s policy to optimally recover the sum of the sensor signals based on the output of the -frequency channel. The system introduces an additional dimension for design compared to the single-frequency one and thus imposes the challenge. To the best of our knowledge, such a problem has not been discussed in the open literature of AirComp. The main contributions are summarized as follows.
-
•
We propose an -frequency AirComp system, where each sensor decides to send its signal over a subset of the frequencies under a certain power constraint. The fusion center receives aggregated sensor signals at the parallel channels and then estimates the sum of the sensor signals.
-
•
We formulate the computation MSE minimization problem of the -frequency AirComp system, separately derive the optimal Tx and Rx policies in a closed-form, and adopt an alternating minimization approach for joint design. Our numerical results show that in the high-SNR scenario, the optimized two-frequency AirComp system can reduce the computation MSE to compared to the single-frequency case.
-
•
After investigating the structure of the optimization problem, we obtain the property of the optimal AirComp system where the received sensor signals should be aligned onto a one-dimensional signal space at each complex (two-dimensional) frequency channel. By leveraging the property, we significantly reduce the computation complex of optimization. Furthermore, our analysis show that the real number operation based fusion center performs better than the complex number operation based one in AirComp, though the latter is commonly adopted in the literature [2, 3, 5, 6].
Notations: and denotes the set of real and complex numbers, respectively. denotes the Euclidean norm of vector x. is the expectation operation. and are the real and imaginary parts of the scalar .
II AirComp System over Multiple Frequency Channels
We focus on a single-antenna AirComp system consisting of sensors, frequency channels (sub-carriers) and a fusion center (FC) as shown in Fig. 1, where . The channel coefficient between sensor and the FC at frequency is .222Note that the signaling cost for channel estimation grows linearly with the increasing number of frequencies. Sensor ’s measurement signal is , where . It is assumed that has zero mean and normalized variance [2, 3, 4, 5].333Note that our AirComp framework of the scenario with zero-mean-normalized-variance sensor measurements can be applied to a generalized scenario with non-zero mean and non-normalized variance. Assume that sensor measurement has mean and variance . The normalized measurement is , and is sent to the fusion center based on the AirComp protocol. Then, it is easy to have Since , and are constant, the optimal estimation of can be obtained by the optimal estimation of in the mean-square sense. Thus, in the following, we only consider the scenario with zero mean and normalized variance.

In the multi-frequency AirComp system, each sensor can simultaneously broadcast its measurement via the frequency channels under a certain power constraint, and the FC estimates the sum signal based on the received aggregated signal at the frequencies. Let and denote the Tx scaling factor and the transmitted signal of sensor at frequency , respectively. Certainly, indicates that sensor does not select frequency for AirComp. Assuming an average sensor power constraint , we have
(1) |
The FC’s received signal is
(2) |
where is the additive complex white Gaussian noise at frequency .
As we consider complex channels, can be denoted as a two dimensional real vector , and thus the FC receives real signals in total. Then, (2) is rewritten as
(3) |
where
(4) | ||||
Note that and are real zero-mean Gaussian signals with variance .
Let denote the Rx scaling factor at frequency . The linear computation output of the FC is
(5) |
and the computation MSE of the AirComp system is [5]
(6) |
We note that a smaller indicates a better computation accuracy. Substituting (3) into (5) and then into (6), we have
(7) | ||||
After some mathematical manipulations, (7) can be simplified as
(8) |
where 1 is a length- all-ones vector, , and
(9) |
It is clear that the objective function of (10) is non-convex due to the coupling of the Rx and Tx scaling factors g and , and there is no general approach to find the joint optimal solution. In what follows, we will separately derive the optimal Rx and Tx scaling factors, and then adopt an alternating minimization approach for joint design.
III AirComp Optimization
It is easy to prove that problem (10) is bi-convex in terms of g and . So we can alternately solve (10) for and g, respectively, while fixing the other, and then iterate until the convergence. From [11] and references therein, the alternating minimization algorithm provides low-complexity solution of bi-convex problems. We will evaluate the effectiveness of the algorithm in solving the AirComp optimal design problem in Section V. In the following, we will derive the optimal solution of the Rx and Tx scaling factors, respectively.
III-A Optimal Design of the Rx Scaling Factor
Once the Tx scaling factors are given, (10) degrades to a quadratic problem without constraint. The unique solution can be obtained by solving the equation below:
(11) |
which is simplified as
(12) |
It is clear that is positive definite and thus reversible. Then, we have the following result.
Proposition 1.
We see that a larger receiver noise leads to a smaller Rx scaling factor.
III-B Optimal Design of the Tx-Scaling Factors
Once the Rx scaling factor g is given, problem (10) is decoupled into independent convex problems, where the th problem is formulated as:
(14) | ||||
where . The Karush–Kuhn–Tucker (KKT) condition of problem (14) can be obtained as
(15) |
After simplification, the first equation in (15) is rewritten as
(16) |
where
(17) |
To find the solution satisfying the KKT condition above, we consider the scenarios with and .
1) If , (16) has infinite solutions as , which is less than the dimension of [12]. By introducing the Moore-Penrose inverse operator [13, Corollary 1], a general solution of (16) can be written as
(18) |
where w can be any vector taken from .
Next we will find the minimum-norm solution of in terms of w and see if it satisfies the power constraint in (15) or not. We define a special solution to (16) with in (18) as
(19) |
where . From (18), we have
(20) |
Using the properties of , and , it can be obtained that
(21) | ||||
Taking (21) into (20), it is straightforward to have
(22) |
Therefore, is the minimum-norm solution of . If , we have found an optimal solution of problem (10); otherwise, we consider the scenario below.
2) If , is invertible and (16) has a unique solution:
(23) |
It is easy to see that the real symmetric matrix has all positive eigenvalues and increases with , and it has linear independent eigenvectors that are invariant with . Due to the fact that an inverted matrix has invariant eigenvectors but has reciprocal of the eigenvalues of the original matrix, it can be proved that of (23) monotonically decreases with . Using the monotonicity, the solution of satisfying the KKT condition can be easily obtained by solving the power constraint with a linear search approach. Then, the optimal can be obtained by (23).
Therefore, the optimal solution of is summarized as below.
Proposition 2.
Given the Rx scaling factor g, the optimized Tx scaling factor , is
(24) |
where is the unique solution of , and is defined in (17).
We see that the optimal Tx scaling factor is a complex function of the channel coefficients , and the Rx scaling factor g. Numerical results will be presented in Section V to show insights on power allocation in different frequency channels.
IV Computational Complexity Reduction
In the previous section, an alternating minimization algorithm has been proposed to solve the AirComp design problem (10) over multiple frequencies. Next, we will further investigate the property of the objective function of (10) to reduce its computation complexity.
First, using the Cauchy–Schwarz inequality, we have
(25) |
where the equality holds once the angle between vectors and is zero. From the definition of in (4), it is easy to show that the angle of vector can be any value by properly designing without changing its norm. So the equality (25) can hold for any given and .
Second, observing the design target function (7) and using the inequality (25), we have the inequality below with the same power constraint on :
(26) |
This is because the optimal design of the right hand side and the left hand side of (26) in terms of satisfy and , respectively. Otherwise, one can always find smaller leading to smaller target functions in (26). Then, from the discussions under (25), the equality in (26) holds if we design such that the angle between vectors and is zero.
Last, taking (26) into (7), the target function of problem (10) is equivalent to
(27) |
which depends on the norms of vectors and instead of the angles. Thus, without loss of optimality, it is safe to assume that the second elements of and are zero, i.e.,
(28) |
In other words, only the real part of the received signal carries information in each frequency channel. Therefore, in problem (10), by removing these zero elements, the sizes of g and S are reduced to half, which significantly reduces the computation complexity. Based on the computational complexity of matrix operations [14], it is easy to obtain that the computational complexity of the optimized Rx and Tx scaling factors in Propositions 1 and 2 are and , respectively.
Remark 1.
For the optimal -frequency AirComp system, the received signals from sensors are aligned onto a one-dimensional signal space at each (complex) frequency channel. To fully utilize the two-dimensional complex signal space, one can perform two independent AirComp tasks of the sensors over the frequencies at the same time.
IV-A AirComp with Real or Complex Number Operations?
So far we have adopted the real number operation (RNO) on the received signals (5), treating real and imaginary part signals as individuals and linearly scaling each of them. As mentioned earlier, many existing work of AirComp systems adopted complex number operation (CNO) on the received complex signal(s) at the FC [2, 3, 5, 6], treating the received complex signal as a wholes and linearly scaling it by a complex number. Clearly, these two types of operations are different and the RNO is more powerful as it can process each part of the two-dimensional (complex) signal separately. In the following, we will discuss the CNO-based multi-frequency AirComp and compare it with the RNO-based one.
By adopting the CNO method, the linear computation output of the FC of the multi-frequency AirComp system is
(29) |
where is the complex scaling factor at frequency . After simplification and by following the similar steps in Section IV, the computation MSE defined in (6) is equivalent to
(30) |
The only difference in the target function between RNO-based AirComp (27) and CNO-based one (30) is the coefficient of noise-power term. In the RNO-based case, the noise power is halved, and thus leads to a smaller computation MSE and provides a dB SNR gain compared with the CNO-based case.
Remark 2.
When adopting the CNO-based AirComp in (29), both real and imaginary parts of the receiver noise contained in are involved in the computation. However, as discussed in Remark 1, the optimal design should align the received signals onto a one-dimensional signal space per frequency channel. Therefore, the CNO-based AirComp has a higher computation MSE than the RNO-based one due to the effect of the additional noise, and the latter should be recommended.
V Numerical Results
In this section, we numerically evaluate the computation MSE of the -sensor--frequency AirComp system with different , and power constraint , where the Rx and Tx scaling factors are obtained by the low-complexity alternating minimization algorithm in Sections III and IV with iteration rounds. Note that our experiment results (not included due to the space limitation) show that the algorithm usually converges within 20 iteration rounds under a CMSE tolerance level of . Unless otherwise stated, we set , the noise power [2, 3], the number of sensors . We adopt normalized Rayleigh fading channels for evaluating the computation MSE that averages over random channel realizations.
In Fig. 2, we demonstrate the effectiveness of the proposed alternating minimization method. Although the optimal joint Rx and Tx scaling factor design for a general -frequency AirComp is unknown, the optimal single-frequency AirComp has been well investigated in [2]. We compare the AirComp performance achieved by the proposed algorithm and the benchmark optimal algorithm [2] for the single-frequency case with different and . We see that the proposed algorithm achieves exactly the optimal performance.

In Fig. 3, we plot with different number of frequency channels . We see that decreases with the increasing due to the increasing chance of having good channels for AirComp. It is interesting to see that when the transmit power is high (e.g., ), increasing cannot reduce much when ; while for the lower power scenario (e.g., ), increasing frequency channels is a good way to improve the AirComp performance. In particular, when , the optimized two-frequency AirComp system can reduce the computation MSE by compared to the conventional single-frequency case. We also present of two baseline policies: 1) the Rx scaling factors are fixed and are equal to one, and the Tx scaling factors are obtained by Proposition 2; 2) the Tx scaling factors are fixed and unified, i.e., the transmit power of sensor at frequency is equal to , and the Rx scaling factors are obtained by Proposition 1. It is clear that the proposed alternating minimization method provides significant performance gain compared to the the baseline policies. In particular, baseline 1 leads to an increased CMSE when more frequencies are available, showing the importance of Rx scaling factor design.

In Fig. 4, we plot the optimized Tx scaling factors and the randomly generated channel coefficients at different frequencies for sensors 1 and 2 in sub-figures (1) and (2), respectively, with , and in sub-figures (3) and (4) with . We see that for sensor 1, a larger channel coefficient leads to a higher Tx scaling factor in some frequencies, but it does not holds for some other cases. This is because as stated in Proposition 2, the optimized Tx scaling factors for one sensor depends on both its channel coefficients and the Rx scaling factors. Thus, the Tx scaling factors are not proportional to the channel coefficients. Comparing sub-figures (3) and (4) with (1) and (2), it is interesting to see that in the case with a large number of frequencies (e.g., ), only half of the frequencies are utilized for AirComp as the allocated transmit power is zero in the other frequencies. It is because that the optimized AirComp system smartly chooses a subset of good channels for signal aggregation, instead of allocating transmit power to all frequency channels and suffering from more noise in a broader bandwidth.

VI Conclusions
We have proposed a novel -frequency AirComp system, where each sensor broadcasts its signal over any a subset of the frequencies under a certain power constraint. We have derived the optimal Tx and Rx scaling factors separately in closed-form, adopted an alternating minimization approach for joint design, and further reduced the complexity of the design problem to half of it. The numerical results have shown that in the high-SNR scenario, the optimized two-frequency AirComp system can reduce the computation MSE by compared to the conventional single-frequency case. For future work, we will take into account the sensor signal correlation and the channel correlation at different frequencies, and study the optimal AirComp policy.
References
- [1] M. Goldenbaum and S. Stanczak, “On the channel estimation effort for analog computation over wireless multiple-access channels,” IEEE Wireless Commun. Lett., vol. 3, no. 3, pp. 261–264, June 2014.
- [2] W. Liu, X. Zang, Y. Li, and B. Vucetic, “Over-the-air computation systems: Optimization, analysis and scaling laws,” IEEE Trans. Wireless Commun., vol. 19, no. 8, pp. 5488–5502, Aug. 2020.
- [3] X. Zang, W. Liu, Y. Li, and B. Vucetic, “Over-the-air computation systems: Optimal design with sum-power constraint,” IEEE Wireless Commun. Lett., vol. 9, no. 9, pp. 1524–1528, Sep. 2020.
- [4] W. Liu, X. Zang, B. Vucetic, and Y. Li, “Over-the-air computation with spatial-and-temporal correlated signals,” Accepted by IEEE Wireless Commun. Lett., 2021.
- [5] G. Zhu and K. Huang, “MIMO over-the-air computation for high-mobility multimodal sensing,” IEEE Internet Things J., vol. 6, no. 4, pp. 6089–6103, Aug 2019.
- [6] D. Wen, G. Zhu, and K. Huang, “Reduced-dimension design of mimo over-the-air computing for data aggregation in clustered iot networks,” IEEE Trans. Wireless Commun., vol. 18, no. 11, pp. 5255–5268, 2019.
- [7] M. Mohammadi Amiri and D. Gündüz, “Machine learning at the wireless edge: Distributed stochastic gradient descent over-the-air,” IEEE Trans. Signal Process., vol. 68, pp. 2155–2169, 2020.
- [8] J. Ahn, O. Simeone, and J. Kang, “Wireless federated distillation for distributed edge learning with heterogeneous data,” in Proc. IEEE PIMRC, 2019, pp. 1–6.
- [9] G. Zhu, Y. Wang, and K. Huang, “Broadband analog aggregation for low-latency federated edge learning,” IEEE Trans. Wireless Commun., vol. 19, no. 1, pp. 491–506, 2020.
- [10] F. Molinari, S. Stanczak, and J. Raisch, “Exploiting the superposition property of wireless communication for average consensus problems in multi-agent systems,” in Proc. ECC, 2018, pp. 1766–1772.
- [11] Q. Li, Z. Zhu, and G. Tang, “Alternating minimizations converge to second-order optimal solutions,” in Proc. ICML, 2019, pp. 3935–3943.
- [12] H. Anton and C. Rorres, Elementary linear algebra: applications version. John Wiley & Sons, 2013.
- [13] R. Penrose, “A generalized inverse for matrices,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 51, no. 3, p. 406–413, 1955.
- [14] S. Boyd and L. Vandenberghe, Introduction to applied linear algebra: vectors, matrices, and least squares. Cambridge university press, 2018.