Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Simple Capacity Lower Bound for Communication with Superimposed Pilots (1804.07114v1)

Published 19 Apr 2018 in cs.IT and math.IT

Abstract: We present a novel closed-form lower bound on the Gaussian-input mutual information for noncoherent communication (i.e., in which neither transmitter nor receiver are cognizant of the fading state) over a frequency-flat fading channel with additive noise. Our bound yields positive (non-trivial) values even in the most challenging case of zero-mean fast fading, a regime in which the conventional approach of orthogonal time-multiplexed pilots is unavailing and for which, to the best of the author's knowledge, no simple analytical bound is known. Its derivation relies on endowing the transmit signal with a non-zero mean, which can be interpreted as a pilot symbol that is additively superimposed onto the information-bearing Gaussian signal. The optimal fraction of transmit power that one should dedicate to this pilot is computed in closed form and shown to tend to one half at low SNR and to a limit above $2-\sqrt{2} \approx 0.586$ at high SNR. We further show how one can refine the bound for the general case of non-zero mean fading. Finally, we state an extension of our bound to the MIMO setting and apply it to compare superimposed vs. orthogonal pilots on the SISO Rayleigh block fading channel.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (1)
  1. Adriano Pastore (18 papers)
Citations (1)

Summary

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