Pith. sign in

REVIEW

Information Theoretic Analysis of Concurrent Information Transfer and Power Gain

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1404.4984 v1 pith:XTEO24WN submitted 2014-04-19 cs.IT math.IT

Information Theoretic Analysis of Concurrent Information Transfer and Power Gain

classification cs.IT math.IT
keywords informationpoweradmittancesanalysiscircuitfixedframeworkgain
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

In this paper, we analyze the fundamental trade-off between information transfer and power gain by means of an information-theoretic framework in communications circuits. This analysis is of interest as many of today's applications require that maximum information and maximum signal power are extracted (or transferred) through the circuit at the same time for further processing so that a compromise concerning the signal spectral shape as well as the matching network has to be found. To this end, the optimization framework is applied to a two-port circuit, which is used as an abstraction for a broadband amplifier. Thereby, we characterize the involved Pareto bound by considering different optimization problems. The first one aims at optimizing the input power spectral density (PSD) as well as the source and load admittances, whereas the second approach assumes the PSD to be fixed and uniformly distributed within a fixed bandwidth and optimizes the source and load admittances only. Moreover, we will show that additional matching networks may help to improve the trade-off.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.