Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 49 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 19 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 172 tok/s Pro
GPT OSS 120B 472 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

On the Capacity of Decode-and-Forward Relaying over Rician Fading Channels (1407.1112v1)

Published 4 Jul 2014 in cs.IT and math.IT

Abstract: In this letter, we derive the probability density function (PDF) and cumulative distribution function (CDF) of the minimum of two non-central Chi-square random variables with two degrees of freedom in terms of power series. With the help of the derived PDF and CDF, we obtain the exact ergodic capacity of the following adaptive protocols in a decode-and-forward (DF) cooperative system over dissimilar Rician fading channels: (i) constant power with optimal rate adaptation; (ii) optimal simultaneous power and rate adaptation; (iii) channel inversion with fixed rate. By using the analytical expressions of the capacity, it is observed that the optimal power and rate adaptation provides better capacity than the optimal rate adaptation with constant power from low to moderate signal-to-noise ratio values over dissimilar Rician fading channels. Despite low complexity, the channel inversion based adaptive transmission is shown to suffer from significant loss in capacity as compared to the other adaptive transmission based techniques over DF Rician channels.

Citations (125)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)