On the Channel Estimation Effort for Analog Computation over Wireless Multiple-Access Channels

This letter studies a multiple-access transmission scheme that exploits interference for an efficient function computation in sensor networks. The central question is how much channel knowledge is generally needed and how the channel estimation effort can significantly be reduced. It is first shown that the channel magnitude at the transmitters is sufficient to achieve the same performance as with full channel state information. It is further shown that for a wide range of fading distributions, no channel state information is needed at the transmitters, provided that the receiver has access to some statistical channel knowledge and is equipped with multiple antennas.

[1]  Andreas Spanias,et al.  On the Effectiveness of Multiple Antennas in Distributed Detection over Fading MACs , 2012, IEEE Transactions on Wireless Communications.

[2]  A. Shiryaev,et al.  Probability (2nd ed.) , 1995, Technometrics.

[3]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[4]  Peter Schatte On Sums Modulo 2π of Independent Random Variables , 1983 .

[5]  Christina Fragouli,et al.  Function Computation over Linear Channels , 2010, 2010 IEEE International Symposium on Network Coding (NetCod).

[6]  Slawomir Stanczak,et al.  Computing functions via simo multiple-access channels: How much channel knowledge is needed? , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[7]  Slawomir Stanczak,et al.  Harnessing Interference for Analog Function Computation in Wireless Sensor Networks , 2013, IEEE Transactions on Signal Processing.

[8]  Michael Gastpar,et al.  Computation Over Multiple-Access Channels , 2007, IEEE Transactions on Information Theory.

[9]  Slawomir Stanczak,et al.  Robust Analog Function Computation via Wireless Multiple-Access Channels , 2012, IEEE Transactions on Communications.