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 91 tok/s
Gemini 2.5 Pro 54 tok/s Pro
GPT-5 Medium 16 tok/s Pro
GPT-5 High 20 tok/s Pro
GPT-4o 108 tok/s Pro
Kimi K2 212 tok/s Pro
GPT OSS 120B 471 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Achievable Rates over Doubly Selective Rician-Fading Channels under Peak-Power Constraint (1011.3380v4)

Published 15 Nov 2010 in cs.IT and math.IT

Abstract: The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are finite and the peak-power limitation is applied in the time domain. Expression for this rate is based on a lower bound on mutual information that assume independent and identically distributed input data symbols. The lower bound is expressed as a difference of two terms. The first term is the information rate of the coherent channel with a weighted signal-to-noise ratio that results from the peak-power limitation. The second term is a penalty term, explicit in the Doppler spectrum of the channel, that captures the effect of the channel uncertainty induced by the noncoherent setting. Impact of channel parameters, such as delay and Doppler spread, on the information rate are discussed and numerical applications on an experimental Rician channel surveyed in an acoustic underwater environment are also provided.

Citations (17)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

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