- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper explores an alphabet design for structured light communications utilizing receiver distribution. It tackles the receiver-distribution alphabet design problem within a specific coefficient space and candidate pool size. The solution involves training an encoder, converting the pooled distinguishability matrix and employing a multistart greedy search to select the most suitable alphabet.
Critical strengths
-
This paper considers a physics-related problem related to free-space optical communications, and provides a mathematically rigorous foundation to support their claims.
-
The authors effectively bridge traditional optimization methods with modern learning-based techniques. The authors also provide their code, ensuring the proposed methods are transparent and easily reproducible.
Critical weaknesses
-
The introduction lacks conviction and fails to adequately emphasize the significance of the problem. It raises questions about the practicality of the proposed methods and highlights the shortcomings of existing approaches. In addition, I do not see significant innovations in the first and second contribution points as what makes the work better in contrast with the state-of-the-art is not reflected clearly.
-
This work uses strong assumptions, therefore, the generalizability might be a question. For example: 1) this work only considers a single fix beam, 2) this work fixes the discrete power with normalization, 3) this work uses only a single setting of Laguerre-Gaussian basis (how about others? Additionally, it appears that the authors repeat this information many times), 4) this work considers only limited selected alphabet size and candidate-pool size. Furthermore, this work has no comparison against state-of-the-art, hence, it is difficult to assess the performance gain.
Questions for authors
-
When the authors mentioned random medium, could it be mathematically modelled using a statistical distribution? Additionally, what happens if we have multiple mediums?
-
Is there any modification to the one-channel ResNet-18 classifier? If it is only the training procedure, how is the performance on the other networks? Why would the author choose to use this learning-based solution over conventional statistical approaches? This raises the importance of an ablation study.
-
How is the computational complexity of the proposed framework? It seems that the Big-O notation in line 340 only applies for the multistart greedy search. How about the ResNet-18 inference?
-
How is the performance of the proposed framework with different number of alphabets? This is important to assess the generalizability of the work.