Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Polar Decomposition of Mutual Information over Complex-Valued Channels (1304.0260v1)

Published 31 Mar 2013 in cs.IT and math.IT

Abstract: A polar decomposition of mutual information between a complex-valued channel's input and output is proposed for a input whose amplitude and phase are independent of each other. The mutual information is symmetrically decomposed into three terms: an amplitude term, a phase term, and a cross term, whereby the cross term is negligible at high signal-to-noise ratio. Theoretical bounds of the amplitude and phase terms are derived for additive white Gaussian noise channels with Gaussian inputs. This decomposition is then applied to the recently proposed amplitude phase shift keying with product constellation (product-APSK) inputs. It shows from an information theoretical perspective that coded modulation schemes using product-APSK are able to outperform those using conventional quadrature amplitude modulation (QAM), meanwhile maintain a low complexity.

Citations (5)

Summary

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