A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels

TL;DR

This paper introduces a precise lower bound for the outage probability in discrete-input Nakagami-m block-fading channels, aiding system design by enabling efficient numerical evaluation and analyzing the rate-diversity trade-off.

Contribution

It presents a novel tight lower bound for outage probability and derives the optimal rate-diversity trade-off for Nakagami-m block-fading channels.

Findings

Efficient numerical evaluation method for the outage probability bound

Derived the optimal rate-diversity trade-off

Provided a tight upper bound for the coding gain constant

Abstract

In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity trade-off for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.