Abstract
This paper 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 ML 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
