Information Theoretic Optimal Broadband Matching for Communication Systems

We present an information theoretic perspective on optimal broadband matching. Most of the broadband matching and communication theory literature assumes a frequency-flat reflection coefficient. We derive the optimal capacity and matching network characteristic for a broadband system from an information theoretic view point while incorporating the broadband matching limitations. We also propose an iterative algorithm to arrive at the optimal solution. We illustrate by an example that a white characteristic for a matching network is often sub- optimal for a system with a non-white transfer function.