Pith. sign in

REVIEW 3 minor 29 references

Capacity Bounds and High-SNR Characterization for MIMO-OWC Channels Under Average-Power Constraint

T0 review · 0 major / 3 minor · reviewed 2026-06-30 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read MIMO-OWC capacity equals an equivalent expression over image vectors whose lower and upper bounds become identical at high SNR.

desk verdict The paper gives tighter computable bounds for MIMO-OWC capacity under average power via an exact NN-BP reformulation and proves high-SNR asymptotic tightness. read the letter →

arxiv 2606.29332 v1 pith:N7HN2V5Y submitted 2026-06-28 cs.IT math.IT

Sufang Yang , Liang Xia , Longguang Li , Jintao Wang , Tao Jiang , Yuxin Wang , Ya Li , Hongjun He
show 2 more authors
Qixing Wang Guangyi Liu
This is my paper · ORCID
classification cs.ITmath.IT
keywords MIMOopticalwirelesscommunicationchannelcapacityaveragepowerconstrainthighSNRnonnegativebasispursuitbounds
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper shows that multiple nonnegative input vectors can produce the same output distribution in MIMO optical wireless channels under average power, so it solves a nonnegative basis pursuit problem to select the minimum-l1-norm input for each image vector. This yields an equivalent capacity formula written solely in terms of the distribution over image vectors. From that formula the authors derive explicit, computable lower and upper bounds that apply separately when the number of transmit antennas is larger or smaller than the number of receive antennas. They then prove the two bounds coincide asymptotically as SNR tends to infinity.

What carries the argument

The nonnegative basis pursuit (NN-BP) problem, which selects the minimum-l1-norm nonnegative input that produces a given image vector and thereby reduces the original capacity optimization to a search over distributions on image vectors.

What would settle it

A numerical check in which the gap between the proposed lower and upper bounds remains bounded away from zero as SNR is driven to arbitrarily large values would falsify the asymptotic-tightness claim.

Watch

Extended reading notes

Core claim

By formulating a nonnegative basis pursuit problem to identify the minimum-l1-norm input vector for each image vector, the channel capacity is equivalently expressed in terms of the image-vector distribution; this permits derivation of computable lower and upper bounds for both nT >= nR and nT < nR cases that are asymptotically tight in the high-SNR regime.

Load-bearing premise

The nonnegative basis pursuit problem correctly identifies the minimum-l1-norm input vector for every image vector that induces the same output distribution.

Editorial extensions

If this is right

  • The capacity expression depends only on the distribution over image vectors rather than the full input alphabet.
  • Explicit, numerically solvable lower and upper bounds exist for both the nT >= nR and nT < nR antenna configurations.
  • The bounds coincide in the limit of infinite SNR, closing any constant gap that remains at finite SNR.
  • Numerical evaluation in indoor and outdoor scenarios shows the new bounds improve on prior expressions.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same NN-BP reduction may apply to other nonnegativity-constrained channels whose output distributions are determined by linear images of the input.
  • If the high-SNR tightness holds, the limiting capacity per dimension is governed by the geometry of the image set rather than the precise noise statistics.
  • The method supplies a concrete way to test whether capacity-achieving distributions concentrate on a finite number of image vectors.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The paper claims to derive an equivalent capacity expression for MIMO-OWC channels under average power constraint by solving a nonnegative basis pursuit problem for each image vector to find the min-l1-norm input. It then provides computable lower and upper bounds for the cases when the number of transmitters is at least or less than the number of receivers, and proves these bounds are asymptotically tight at high SNR. Numerical results are provided for indoor and outdoor scenarios showing improvement over prior bounds.

Significance. If the asymptotic tightness holds, this work offers a practical way to characterize the high-SNR capacity of MIMO optical wireless channels, closing the constant gap that previous bounds left. The NN-BP reformulation is a key contribution as it exactly reduces the problem to optimization over image distributions without sacrificing optimality, enabling the subsequent bound derivations.

minor comments (3)
  1. [Abstract] The claim that the bounds 'close the constant gap in the high-SNR regime' would be strengthened by a brief mention of the gap size or the previous bounds' behavior.
  2. Notation for nT and nR should be defined at first use in the introduction.
  3. [Numerical results] It would be useful to include the specific SNR values or ranges used in the simulations for reproducibility.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of the manuscript, the recognition of the NN-BP reformulation as a key contribution, and the recommendation for minor revision. No major comments were listed in the report.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity identified

full rationale

The paper reformulates capacity via an explicit NN-BP convex program that returns the minimum-l1-norm input for each image vector; this yields an exact equivalent optimization over image distributions because any feasible input can be replaced by its NN-BP solution without changing the output distribution while weakly lowering average power. Subsequent lower/upper bounds and the high-SNR asymptotic tightness proof rest on standard mutual-information bounding techniques applied to the resulting effective cost function. No steps reduce by construction to fitted parameters, self-citations, or ansatzes imported from prior work; the central claim therefore remains independent of its own inputs.

Assumptions & free parameters 0 free parameters · 0 assumptions · 0 invented entities

Abstract-only review; no explicit free parameters, axioms, or invented entities are stated. The NN-BP formulation itself may implicitly introduce an optimization assumption whose validity is not independently verified in the provided text.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Capacity Bounds and High-SNR Characterization for MIMO-OWC Channels Under Average-Power Constraint." pith.science (2026). https://pith.science/paper/N7HN2V5Y

@misc{pith2026260629332,
  author       = {Pith},
  title        = {Pith review of: Capacity Bounds and High-SNR Characterization for MIMO-OWC Channels Under Average-Power Constraint},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/N7HN2V5Y}},
  note         = {Machine review of arXiv:2606.29332}
}
read the original abstract

This paper investigates the capacity of multipleinput multiple-output (MIMO) optical wireless communication (OWC) channels under a total average-power constraint. Since different nonnegative input vectors can be mapped to the same image vector and thus induce the same output distribution, we formulate a nonnegative basis pursuit (NN-BP) problem to identify the minimum-l1-norm input vector for each image vector. Based on the NN-BP characterization, we derive an equivalent expression for the channel capacity in terms of the image-vector distribution. We then establish computable lower and upper capacity bounds for both nT >= nR and nT < nR cases, and prove that the proposed bounds are asymptotically tight in the high signal-to-noise ratio (SNR) regime. Numerical results for indoor and outdoor OWC scenarios demonstrate that the proposed bounds improve upon existing ones and close the constant gap in the high-SNR regime.

Figures

Figures reproduced from arXiv: 2606.29332 by the authors.

Figure 1
Figure 1. The cone S(H) when H = (2, 1, 1; 1, 1, 2) and its partition into subcone S(H{1,3}). For I = {i1, · · · , ir} ∈ R(M), we define the submatrix: MI = (mi1 , mi2 , · · · , mir ). (8) III. NONNEGATIVE BASIS PURSUIT This section proposes the NN-BP scheme for the case nT ≥ nR. We first rewrite the channel model in (1) as Y = X¯ + Z, (9) with the image vector X¯ defined by X¯ = HX. (10) Applying (6) to the channel matrix H,… view at source ↗
Figure 3
Figure 3. The cone S(H) when H = (2, 1.5, 1; 1, 1.5, 2) and its partitions. If x¯ ∈ S(H{1,2}), then the feasible points in R3 + satisfy ∥x {1,2} ∥1 = ∥x {1,3} ∥1 = ∥x {1,2,3} ∥1. (30) If x¯ ∈ S(H{2,3}), then the feasible points in R3 + satisfy ∥x {2,3} ∥1 = ∥x {1,3} ∥1 = ∥x {1,2,3} ∥1. (31) On the one hand, Fig. 3a illustrates the partition of S(H) by the subcone S(H{1,3}). (30) and (31) show that the NN￾BP solution x ⋆ can b… view at source ↗
Figure 4
Figure 4. Capacity bounds of a 2×4 VLC channel with H = Ha. with [(HTH) −1 ]l,l denoting the (l, l)-th entry of (HTH) −1 . At high SNR, the asymptotic capacity is given by lim E σ →+∞  C − nT log E σ  = 1 2 log(| det(H TH)|) + nT 2 log e 2πn2 T  . (70) VI. NUMERICAL RESULTS This section provides numerical examples to illustrate the proposed channel capacity bounds. We first consider an indoor VLC scenario, followed by a… view at source ↗
Figures from the paper (4 more)
Figure 6
Figure 6. Figure 6: High-SNR capacity for 1 × 4 VLC channels. the gap between the upper and lower bounds in [18] does not necessarily decrease monotonically with the SNR. For [PITH_FULL_IMAGE:figures/full_fig_p007_6.png]
Figure 9
Figure 9. Figure 9: Ergodic capacity bounds of a 2 × 4 FSO channel. 45 50 55 60 65 70 75 80 SNR [dB] 0 2 4 6 8 10 12 14 Ergodic Capacity [nats per channel use] Upper Bound [18, Thm.1, (16)] Upper Bound (67) Upper Bound (68) Lower Bound [18, Prop. 2] Lower Bound (66) [PITH_FULL_IMAGE:figu…
Figure 10
Figure 10. Figure 10: Ergodic capacity bounds of a 4 × 2 FSO channel. atmospheric-turbulence fading coefficient ha, and the random pointing-error fading coefficient hp. Specifically, ha follows a log-normal distribution, whereas hp follows a bounded power-law distribution characterized by …
Figure 11
Figure 11. Figure 11: Geometry of Sunit(H{1,3}) and Sunit(H{2,4}). We use the following example to provide an intuitive illustration of the above proof. Consider a 2 × 4 channel H = (h1, h2, h3, h4), where S (H) = {I = {1, 3},J = {2, 4}}. Assume that Vol2  Sunit(H{1,3}) ∩ Sunit(H{2,4}) […

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

29 extracted references

  1. [1]

    Optical communication in space: Chal- lenges and mitigation techniques,

    H. Kaushal and G. Kaddoum, “Optical communication in space: Chal- lenges and mitigation techniques,” IEEE Commun. Surv. Tutor ., vol. 19, no. 1, pp. 57-96, Firstquarter 2017

    2017

  2. [2]

    Visible light commu- nication, networking, and sensing: A survey, potential and challenges,

    P . H. Pathak, X. Feng, P . Hu and P . Mohapatra, “Visible light commu- nication, networking, and sensing: A survey, potential and challenges,” IEEE Commun. Surv. Tutor ., vol. 17, no. 4, pp. 2047-2077, Fourthquarter 2015. 3Alternatively, by setting µ = E nR and substituting it into ( 56), we can also complete the converse proof of Theorem 3

  3. [3]

    Survey on free space optical commu- nication: A communication theory perspective,

    M. A. Khalighi and M. Uysal, “Survey on free space optical commu- nication: A communication theory perspective,” IEEE Commun. Surv. Tutor ., vol. 16, no. 4, pp. 2231-2258, Fourthquarter 2014

    2014

  4. [4]

    LED based indoor visible light communications: State of the art,

    D. Karunatilaka, F. Zafar, V . Kalavally, and R. Parthiban, “LED based indoor visible light communications: State of the art,” IEEE Commun. Surv. Tutor ., vol. 17, no. 3, pp. 16491678, 3rd Quart., 2015

    2015

  5. [5]

    Free-space optical communication through atmospheric turbulence channels,

    X. Zhu and J. M. Kahn, “Free-space optical communication through atmospheric turbulence channels,” IEEE Trans. Commun. , vol. 50, no. 8, pp. 12931300, Aug. 2002

    2002

  6. [6]

    Bandlimited intensity modulation,

    M. Tavan, E. Agrell, and J. Karout, “Bandlimited intensity modulation,” IEEE Trans. Commun. , vol. 60, no. 11, pp. 34293439, Nov. 2012

    2012

  7. [7]

    Adaptive coded modulation for IM/DD free-space optical backhauling: A probabilistic shaping approach,

    A. Elzanaty and M.-S. Alouini, “Adaptive coded modulation for IM/DD free-space optical backhauling: A probabilistic shaping approach,” IEEE Trans. Commun., vol. 68, no. 10, pp. 63886402, Oct. 2020

    2020

  8. [8]

    Communication in the presence of noise,

    C. E. Shannon, “Communication in the presence of noise,” Proc. IRE , vol. 37, no. 1, pp. 10-21, Jan. 1949

    1949

Show all 29 references
  1. [9]

    On the capacity of free- space optical intensity channels,

    A. Lapidoth, S. M. Moser and M. A. Wigger, “On the capacity of free- space optical intensity channels,” IEEE Trans. Inf. Theory , vol. 55, no. 10, pp. 4449-4461, Oct. 2009

    2009

  2. [10]

    Low-SNR asymptotic capacity of two types of optical wireless channels under average-intensity constraints,

    L. Li, “Low-SNR asymptotic capacity of two types of optical wireless channels under average-intensity constraints,” IEEE Trans. Inf. Theory , vol. 71, no. 10, pp. 7504-7517, Oct. 2025

    2025

  3. [11]

    On the capacity of optical wireless channels based on IM-DD,

    L. Jiang and L. Li, “On the capacity of optical wireless channels based on IM-DD,” J. Beijing Univ. Post. Telecommun. , vol. 47, pp. 137-142, 2024

    2024

  4. [12]

    Capacity bounds for power- and band-limited optical intensity channels corrupted by Gaussian noise,

    S. Hranilovic and F. R. Kschischang, “Capacity bounds for power- and band-limited optical intensity channels corrupted by Gaussian noise,” IEEE Trans. Inf. Theory , vol. 50, no. 5, pp. 784795, May 2004

    2004

  5. [13]

    Capacity bounds for wireless optical intensity channels with Gaussian noise,

    A. A. Farid and S. Hranilovic, “Capacity bounds for wireless optical intensity channels with Gaussian noise,” IEEE Trans. Inf. Theory , vol. 56, no. 12, pp. 6066-6077, Dec. 2010

    2010

  6. [14]

    Tight bounds on channel capacity for dimmable visible light communications,

    J. -B. Wang, Q. -S. Hu, J. Wang, M. Chen and J. -Y . Wang, “Tight bounds on channel capacity for dimmable visible light communications,” J. Light. Technol. , vol. 31, no. 23, pp. 3771-3779, Dec. 2013

    2013

  7. [15]

    Free-space optical communications: Capacity bounds, approximations, and a new sphere- packing perspective,

    A. Chaaban, J.-M. Morvan, and M.-S. Alouini, “Free-space optical communications: Capacity bounds, approximations, and a new sphere- packing perspective,” IEEE Trans. Commun. , vol. 64, no. 3, pp. 1176- 1191, Mar. 2016

    2016

  8. [16]

    A tight upper bound on channel capacity for visible light communications,

    R. Jiang, Z. Wang, Q. Wang and L. Dai, “A tight upper bound on channel capacity for visible light communications,” IEEE Commun. Lett. , vol. 20, no. 1, pp. 97-100, Jan. 2016

    2016

  9. [17]

    Asymptotic capacity results for MIMO wireless optical communication,

    S. M. Moser, M. Mylonakis, L. Wang and M. Wigger, “Asymptotic capacity results for MIMO wireless optical communication,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Aachen, Germany, 2017, pp. 536- 540

    2017

  10. [18]

    Capacity bounds and high- SNR capacity of MIMO intensity-modulation optical channels,

    A. Chaaban, Z. Rezki and M. -S. Alouini, “Capacity bounds and high- SNR capacity of MIMO intensity-modulation optical channels,” IEEE Trans. Wireless Commun. , vol. 17, no. 5, pp. 3003-3017, May 2018

    2018

  11. [19]

    On the capacity of MIMO optical wireless channels,

    L. Li, S. M. Moser, L. Wang and M. Wigger, “On the capacity of MIMO optical wireless channels,” IEEE Trans. Inf. Theory , vol. 66, no. 9, pp. 5660-5682, Sept. 2020

    2020

  12. [20]

    On the capacity of bandlimited optical intensity channels with Gaussian noise,

    J. Zhou and W. Zhang, “On the capacity of bandlimited optical intensity channels with Gaussian noise,” IEEE Trans. Commun. , vol. 65, no. 6, pp. 24812493, Jun. 2017

    2017

  13. [21]

    Fundamental limits of paral- lel optical wireless channels: Capacity results and outage formulation,

    A. Chaaban, Z. Rezki, and M.-S. Alouini, “Fundamental limits of paral- lel optical wireless channels: Capacity results and outage formulation,” IEEE Trans. Commun. , vol. 65, no. 1, pp. 296311, Jan. 2017

    2017

  14. [22]

    T. M. Cover and J. A. Thomas, Elements of Information Theory , 2nd ed. New Y ork, NY , USA: Wiley, 2006

    2006

  15. [23]

    Atomic decomposition by basis pursuit,

    S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM J. Sci. Comput. , vol. 20, no. 1, pp. 3361, 1998

    1998

  16. [24]

    A sparse recovery method for initial uplink synchronization in OFDMA systems,

    M. M. Hyder and K. Mahata, “A sparse recovery method for initial uplink synchronization in OFDMA systems,” IEEE Trans. Commun. , vol. 64, no. 1, pp. 377386, Jan. 2016

    2016

  17. [25]

    Performance comparison of MIMO techniques for optical wireless communications in indoor environments,

    T. Fath and H. Haas, “Performance comparison of MIMO techniques for optical wireless communications in indoor environments,” IEEE Trans. Commun., vol. 61, no. 2, pp. 733-742, Feb. 2013

    2013

  18. [26]

    Outage capacity optimization for free- space optical links with pointing errors,

    A. A. Farid and S. Hranilovic, “Outage capacity optimization for free- space optical links with pointing errors,” J. Lightw. Technol. , vol. 25, no. 7, pp. 1702-1710, Jul. 2007

    2007

  19. [27]

    Berge, Topological Spaces: Including a Treatment Multi-V alued Functions, V ector Spaces, Convexity

    C. Berge, Topological Spaces: Including a Treatment Multi-V alued Functions, V ector Spaces, Convexity . Chelmsford, MA, USA: Courier Corporation, 1997

    1997

  20. [28]

    A mathematical theory of communication,

    C. E. Shannon, “A mathematical theory of communication,” Bell System Tech. J., vol. 27, no. 3, pp. 379-423, Jul. 1948

    1948

  21. [29]

    Duality-based bounds on channel capacity,

    S. M. Moser, “Duality-based bounds on channel capacity,” Ph. D. dissertation, ETH Zurich, Zurich, Switzerland, 2004

    2004

Pith tools

Reviewed June 30, 2026 · model on record in the stance chip above.