arXiv subjects

Behrooz Makki

Publications and source records attributed to Behrooz Makki.

95 records · Page 6Linked to original sources

arXiv2014

Finite Block-length Analysis of the Incremental Redundancy HARQ

This letter studies the power-limited throughput of a communication system utilizing incremental redundancy (INR) hybrid automatic repeat request (HARQ). We use some recent results on the achievable rates of finite-length codes to analyze the system performance. With codewords of finite length, we derive closed-form expressions for the outage probabilities of INR HARQ and study the throughput in the cases with variable-length coding. Moreover, we evaluate the effect of feedback delay on the throughput and derive sufficient conditions for the usefulness of the HARQ protocols, in terms of power-limited throughput. The results show that, for a large range of HARQ feedback delays, the throughput is increased by finite-length coding INR HARQ, if the sub-codeword lengths are properly adapted.

cs.IT↗

arXiv2014

Reinforcement-based data transmission in temporally-correlated fading channels: Partial CSIT scenario

Reinforcement algorithms refer to the schemes where the results of the previous trials and a reward-punishment rule are used for parameter setting in the next steps. In this paper, we use the concept of reinforcement algorithms to develop different data transmission models in wireless networks. Considering temporally-correlated fading channels, the results are presented for the cases with partial channel state information at the transmitter (CSIT). As demonstrated, the implementation of reinforcement algorithms improves the performance of communication setups remarkably, with the same feedback load/complexity as in the state-of-the-art schemes.

cs.IT↗

arXiv2013

HARQ Feedback in Spectrum Sharing Networks

This letter studies the throughput and the outage probability of spectrum sharing networks utilizing hybrid automatic repeat request (HARQ) feedback. We focus on the repetition time diversity and the incremental redundancy HARQ protocols where the results are obtained for both continuous and bursting communication models. The channel data transmission efficiency is investigated in the presence of both secondary user peak transmission power and primary user received interference power constraints. Finally, we evaluate the effect of secondary-primary channel state information imperfection on the performance of the secondary channel. Simulation results show that, while the throughput is not necessarily increased by HARQ, substantial outage probability reduction is achieved in all conditions.

cs.IT↗

arXiv2013

Green Communication via Power-optimized HARQ Protocols

Recently, efficient use of energy has become an essential research topic for green communication. This paper studies the effect of optimal power controllers on the performance of delay-sensitive communication setups utilizing hybrid automatic repeat request (HARQ). The results are obtained for repetition time diversity (RTD) and incremental redundancy (INR) HARQ protocols. In all cases, the optimal power allocation, minimizing the outage-limited average transmission power, is obtained under both continuous and bursting communication models. Also, we investigate the system throughput in different conditions. The results indicate that the power efficiency is increased substantially, if adaptive power allocation is utilized. For instance, assume Rayleigh-fading channel, a maximum of two (re)transmission rounds with rates $\{1,\frac{1}{2}\}$ nats-per-channel-use and an outage probability constraint ${10}^{-3}$. Then, compared to uniform power allocation, optimal power allocation in RTD reduces the average power by 9 and 11 dB in the bursting and continuous communication models, respectively. In INR, these values are obtained to be 8 and 9 dB, respectively.

cs.IT↗

arXiv2013

On Noisy ARQ in Block-Fading Channels

Assuming noisy feedback channels, this paper investigates the data transmission efficiency and robustness of different automatic repeat request (ARQ) schemes using adaptive power allocation. Considering different block-fading channel assumptions, the long-term throughput, the delay-limited throughput, the outage probability and the feedback load of different ARQ protocols are studied. A closed-form expression for the power-limited throughput optimization problem is obtained which is valid for different ARQ protocols and feedback channel conditions. Furthermore, the paper presents numerical investigations on the robustness of different ARQ protocols to feedback errors. It is shown that many analytical assertions about the ARQ protocols are valid both when the channel remains fixed during all retransmission rounds and when it changes in each round (in)dependently. As demonstrated, optimal power allocation is crucial for the performance of noisy ARQ schemes when the goal is to minimize the outage probability.

cs.IT↗