Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 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

A Double Maximization Approach for Optimizing the LM Rate of Mismatched Decoding (2405.00545v1)

Published 1 May 2024 in cs.IT, cs.NA, math.IT, and math.NA

Abstract: An approach is established for maximizing the Lower bound on the Mismatch capacity (hereafter abbreviated as LM rate), a key performance bound in mismatched decoding, by optimizing the channel input probability distribution. Under a fixed channel input probability distribution, the computation of the corresponding LM rate is a convex optimization problem. When optimizing the channel input probability distribution, however, the corresponding optimization problem adopts a max-min formulation, which is generally non-convex and is intractable with standard approaches. To solve this problem, a novel dual form of the LM rate is proposed, thereby transforming the max-min formulation into an equivalent double maximization formulation. This new formulation leads to a maximization problem setup wherein each individual optimization direction is convex. Consequently, an alternating maximization algorithm is established to solve the resultant maximization problem setup. Each step of the algorithm only involves a closed-form iteration, which is efficiently implemented with standard optimization procedures. Numerical experiments show the proposed approach for optimizing the LM rate leads to noticeable rate gains.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (16)
  1. J. Omura and B. Levitt, “Coded error probability evaluation for antijam communication systems,” IEEE Transactions on Communications, vol. 30, no. 5, pp. 896–903, 1982.
  2. A. Lapidoth and S. Shamai, “Fading channels: How perfect need ‘perfect side information’ be?” IEEE Transactions on Information Theory, vol. 48, no. 5, pp. 1118–1134, 2002.
  3. W. Zhang, “A general framework for transmission with transceiver distortion and some applications,” IEEE Transactions on Communications, vol. 60, no. 2, pp. 384–399, Feb. 2012.
  4. J. Salz and E. Zehavi, “Decoding under integer metrics constraints,” IEEE Transactions on Communications, vol. 43, no. 2/3/4, pp. 307–317, Feb./Mar./Apr. 1995.
  5. N. Merhav, G. Kaplan, A. Lapidoth, and S. Shamai (Shitz), “On information rates for mismatched decoders,” IEEE Transactions on Information Theory, vol. 40, no. 6, pp. 1953–1967, Nov. 1994.
  6. A. Lapidoth and P. Narayan, “Reliable communication under channel uncertainty,” IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2148–2177, Oct. 1998.
  7. A. Lapidoth, “Mismatched decoding and the multiple-access channel,” IEEE Transactions on Information Theory, vol. 42, no. 5, pp. 1439–1452, 1996.
  8. A. Ganti, A. Lapidoth, and I. E. Telatar, “Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit,” IEEE Transactions on Information Theory, vol. 46, no. 7, pp. 2315–2328, Nov. 2000.
  9. J. Scarlett, A. Guillèn i Fábregas, A. Somekh-Baruch, and A. Martinez, “Information-theoretic foundations of mismatched decoding,” Foundations and Trends® in Communications and Information Theory, vol. 17, no. 2-3, pp. 149–400, 2020.
  10. I. Csiszár and P. Narayan, “Channel capacity for a given decoding metric,” IEEE Transactions on Information Theory, vol. 41, no. 1, pp. 35–43, Jan. 1995.
  11. G. Kaplan and S. Shamai (Shitz), “Information rates and error exponents of compound channels with application to antipodal signaling in a fading environment,” AEU-International Journal of Electronics and Communications, vol. 47, no. 4, pp. 228–239, Jul. 1993.
  12. I. Csiszár and J. Körner, “Graph decomposition: A new key to coding theorems,” IEEE Transactions on Information Theory, vol. 27, no. 1, pp. 5–12, Jan. 1981.
  13. W. Ye, H. Wu, S. Wu, Y. Wang, W. Zhang, H. Wu, and B. Bai, “An optimal transport approach to the computation of the LM rate,” in Proc. 2022 IEEE Global Communications Conference (GLOBECOM), Rio de Janeiro, Brazil, Dec. 2022, pp. 239–244.
  14. S. Wu, W. Ye, H. Wu, H. Wu, W. Zhang, and B. Bai, “A communication optimal transport approach to the computation of rate distortion functions,” in Proc. 2023 IEEE Information Theory Workshop (ITW), Saint-Malo, France, Apr. 2023, pp. 92–96.
  15. M. Cuturi, “Sinkhorn distances: Lightspeed computation of optimal transport,” in Proc. Advances in Neural Information Processing Systems (NeurIPS), vol. 26, Lake Tahoe, Nevada, US, Dec. 2013, pp. 2292–2300.
  16. Y. Xu and W. Yin, “A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion,” SIAM Journal on Imaging Sciences, vol. 6, no. 3, pp. 1758–1789, 2013.
Citations (1)

Summary

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