Receiver Energy Efficiency and Transmission Latency Analysis of Outage-Constrained Differential PSK With a Finite Resolution ADC
Sherief Helwa, Naofal Al-Dhahir
IEEE Access · 2021
doi:10.1109/access.2021.3061899 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
We consider a power constrained downlink communication scenario where energy efficiency, reliability, and latency take precedence over rate, as in some Internet of Things (IoT) applications. To reduce its receiver power consumption and complexity, we assume that the IoT device has a single RF chain and investigate the finite-resolution analog-to-digital converter (ADC) operation with differential Phase Shift Keying (PSK) modulation. A lower ADC resolution leads to an exponential decrease in power consumption, while adopting differential PSK enables the use of a low-cost detector with no channel state information (CSI) or carrier phase recovery circuitry. Our main goal in this article is to compare, both analytically and numerically using representative IoT system design parameters, the receiver energy efficiency of the proposed differential PSK system with a coherent PSK system that uses estimated CSI under reliability and latency constraints in Rayleigh slow-fading and ADC quantization distortion conditions. To mitigate the ADC finite-resolution effects without requiring CSI at the receiver or transmitter, we propose and analyze a PSK differentially-modulated Alamouti space-time block transmission scheme with only two RF chains at the transmitter while still restricting the IoT device to have a single RF chain. Our results demonstrate that in the considered low-rate, and outage and latency-constrained scenario with stringent power consumption requirements, differentially-modulated Alamouti transmissions to a single RF-chain IoT device with a low-resolution ADC is an attractive choice in terms of receiver energy efficiency, reliability, and transmission latency.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.