Performance Analysis of Multiple-Antenna Ambient Backscatter Systems at Finite Blocklengths

This article analyzes the maximal achievable rate for a given blocklength and maximal error probability over a multiple-antenna ambient backscatter channel. The result consists of a finite blocklength channel coding achievability bound and a converse bound for the legacy system with finite alphabet constraints and multiple-input-multiple-output based on the Neyman–Pearson test, the Berry–Esseen theorem, and the Mellin transform. Then, we derive the closed-form expression of the mutual information and the information variance to reduce the complexity of the computation. By applying the low-complexity maximum-likelihood detection, the relation between the maximal error probability of the RF source signal and the average error probability of the tag symbol with respect to the blocklength is proposed. Finally, numerical evaluation of these bounds shows fast convergence to the maximal achievable rate as the blocklength increases and also proves that the information variance is an accurate measure of the backoff from the maximal achievable rate due to finite blocklength.