Shi-Yuan Wang

Accepted

1. S.-Y. Wang, M.-C. Chang, and M. R. Bloch, “Covert Joint Communication and Sensing Under Variational Distance Constraint.” accepted to 58th Annual Conference on Information Sciences and Systems, Jan. 2024.

   @misc{Wang2024Covert, author = {Wang, Shi-Yuan and Chang, Meng-Che and Bloch, Matthieu R.}, howpublished = {accepted to \emph{58th Annual Conference on Information Sciences and Systems}}, month = jan, title = {Covert Joint Communication and Sensing Under Variational Distance Constraint}, year = {2024}, groups = {NSF1910859, NSF2148400} }

Articles

1. M.-C. Chang, S.-Y. Wang, T. Erdoğan, and M. R. Bloch, “Rate and Detection-Error Exponent Tradeoff for Joint Communication and Sensing of Fixed Channel States,” IEEE Journal on Selected Areas in Information Theory, vol. 4, pp. 245–259, May 2023.

   We study the information-theoretic limits of joint communication and sensing when the sensing task is modeled as the estimation of a discrete channel state fixed during the transmission of an entire codeword. This setting captures scenarios in which the time scale over which sensing happens is significantly slower than the time scale over which symbol transmission occurs. The tradeoff between communication and sensing then takes the form of a tradeoff region between the rate of reliable communication and the state detection-error exponent. We investigate such tradeoffs for both mono-static and bi-static scenarios, in which the sensing task is performed at the transmitter or receiver, respectively. In the mono-static case, we develop an exact characterization of the tradeoff in open-loop, when the sensing is not used to assist the communication. We also show the strict improvement brought by a closed-loop operation, in which the sensing informs the communication. In the bi-static case, we develop an achievable tradeoff region that highlights the fundamentally different nature of the bi-static scenario. Specifically, the rate of communication plays a key role in the characterization of the tradeoff and we show how joint strategies, which simultaneously estimate message and state, outperform successive strategies, which only estimate the state after decoding the transmitted message.

   @article{Chang2022Ratea, author = {Chang, Meng-Che and Wang, Shi-Yuan and Erdo\u{g}an, Tuna and Bloch, Matthieu R.}, journal = {IEEE Journal on Selected Areas in Information Theory}, title = {Rate and Detection-Error Exponent Tradeoff for Joint Communication and Sensing of Fixed Channel States}, year = {2023}, month = may, pages = {245-259}, volume = {4}, doi = {10.1109/JSAIT.2023.3275877}, eprint = {2210.07963}, groups = {NSF2148400, NSF1955401}, howpublished = {accepted to \emph{IEEE Journal on Selected Areas in Information Theory}} }

2. S.-Y. Wang and M. R. Bloch, “Covert MIMO Communications under Variational Distance Constraint,” IEEE Transactions on Information Forensics and Security, vol. 16, pp. 4605–4620, Sep. 2021.

   The problem of covert communication over Multiple-Input Multiple-Output (MIMO) Additive White Gaussian Noise (AWGN) channels is investigated, in which a transmitter attempts to reliably communicate with a legitimate receiver while avoiding detection by a passive adversary. The covert capacity of the MIMO AWGN channel is characterized under a variational distance covertness constraint when the MIMO channel matrices are static and known. The characterization of the covert capacity is also extended to a class of channels in which the legitimate channel matrix is known but the adversary’s channel matrix is only known up to a rank and a spectral norm constraint.

   @article{Wang2021, author = {Wang, Shi-Yuan and Bloch, Matthieu R}, journal = {IEEE Transactions on Information Forensics and Security}, title = {Covert MIMO Communications under Variational Distance Constraint}, year = {2021}, month = sep, pages = {4605 - 4620}, volume = {16}, doi = {10.1109/TIFS.2021.3110048}, eprint = {2102.11336}, file = {:2021-Wang-IEEETransIFS-Covert MIMO Communications under Variational Distance Constraint.pdf:PDF}, groups = {NSF1910859}, howpublished = {accepted to \emph{IEEE Transactions on Information Forensics and Security}} }

Conference proceedings

1. M.-C. Chang, S.-Y. Wang, and M. R. Bloch, “Sequential Joint Communication and Sensing of Fixed Channel States,” in Proc. of IEEE Information Theory Workshop, Saint-Malo, France, Apr. 2023, pp. 462–467.

   We consider a communication model in which a transmitter attempts to communicate with a receiver over a state-dependent channel and simultaneously estimates the state using strictly causal noisy state observations. The state is assumed to remain constant over the duration of the transmission. We analyze the trade-off between the state-error exponent and the communication rate in the sequential setting, in which the transmitter determines what and how many symbols to transmit in an online manner.

   @inproceedings{Chang2023Sequential, author = {Chang, Meng-Che and Wang, Shi-Yuan and Bloch, Matthieu R.}, booktitle = {Proc. of IEEE Information Theory Workshop}, title = {Sequential Joint Communication and Sensing of Fixed Channel States}, year = {2023}, address = {Saint-Malo, France}, month = apr, pages = {462--467}, doi = {10.1109/ITW55543.2023.10161688}, file = {:2023-Chang-ITW-Sequential Joint Communication and Sensing of Fixed Channel States.pdf:PDF}, groups = {NSF2148400}, howpublished = {accepted to \emph{IEEE Information Theory Workshop}} }

2. M.-C. Chang, S.-Y. Wang, and M. R. Bloch, “Controlled Sensing with Corrupted Commands,” in Proc. of 58th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sep. 2022.

   We consider a non-adaptive controlled sensing sce-nario in which the actions of the decision maker are corrupted by an adversary. The objective of the decision maker is to either detect the presence of the corruption or make a correct decision. Accordingly, the performance of a controlled sensing strategy is measured in terms of the error probability when there is no adversary, denoted PE,0 , and the error probability when an adversary is present, denoted PE,1 . Our main result is Stein-lemma like characterization of the optimal achievable error exponent of PE,0 subject to a constraint on PE,1 . We also illustrate the result with numerical examples.

   @inproceedings{Chang2022Controlled, author = {Chang, Meng-Che and Wang, Shi-Yuan and Bloch, Matthieu R.}, booktitle = {Proc. of 58th Annual Allerton Conference on Communication, Control, and Computing}, title = {Controlled Sensing with Corrupted Commands}, year = {2022}, address = {Monticello, IL}, month = sep, doi = {10.1109/Allerton49937.2022.9929364}, file = {:2022-Chang-Allerton-Controlled Sensing with Corrupted Commands.pdf:PDF}, groups = {NSF1955401, NSF1910859}, howpublished = {accepted to \emph{Allerton conference}} }

3. S.-Y. Wang, T. Erdoğan, U. Pereg, and M. R. Bloch, “Joint Quantum Communication and Sensing,” in Proc. of IEEE Information Theory Workshop, Aug. 2022, pp. 506–511.

   @inproceedings{Wang2022Joint, author = {Wang, Shi-Yuan and Erdo\u{g}an, Tuna and Pereg, Uzi and Bloch, Matthieu R}, booktitle = {Proc. of IEEE Information Theory Workshop}, title = {Joint Quantum Communication and Sensing}, year = {2022}, month = aug, pages = {506-511}, doi = {10.1109/ITW54588.2022.9965810}, file = {:2022-Wang-ITW-Joint Quantum Communication and Sensing.pdf:PDF}, groups = {NSF1910859}, howpublished = {accepted to \emph{IEEE Information Theory Workshop}} }

4. S.-Y. Wang, T. Erdoğan, and M. R. Bloch, “Towards a Characterization of the Covert Capacity of Bosonic Channels under Trace Distance,” in Proc. of IEEE International Symposium on Information Theory, Helsinki, Finland, Jun. 2022, pp. 354–359.

   @inproceedings{Wang2022Towards, author = {Wang, Shi-Yuan and Erdo\u{g}an, Tuna and Bloch, Matthieu R.}, booktitle = {Proc. of IEEE International Symposium on Information Theory}, title = {Towards a Characterization of the Covert Capacity of Bosonic Channels under Trace Distance}, year = {2022}, address = {Helsinki, Finland}, month = jun, pages = {354--359}, doi = {10.1109/ISIT50566.2022.9834394}, file = {:2022-Wang-ISIT-Towards a Characterization of the Covert Capacity of Bosonic Channels under Trace Distance.pdf:PDF}, groups = {NSF1910859}, howpublished = {accepted to \emph{IEEE International Symposium on Information Theory}} }

5. M.-C. Chang, T. Erdoğan, S.-Y. Wang, and M. R. Bloch, “Rate and Detection Error-Exponent Tradeoffs of Joint Communication and Sensing,” in Proc. of IEEE International Symposium on Joint Communications & Sensing, Vienna, Austria, Mar. 2022, pp. 1–6.

   We consider a communication model in which a transmitter attempts to communicate with a receiver over a state-dependent channel and simultaneously estimate the state using strictly causal noisy state observations. Motivated by joint communication and sensing scenarios in which the physical phenomenon of interest for sensing evolves at a much slower rate than the rate of communication, the state is assumed to remain constant over the duration of the transmission. We derive a complete characterization of the optimal asymptotic trade-off between communication rate and detection-error exponent when coding strategies are open loop. We also show that closed-loop strategies result in strict improvements of the trade-offs.

   @inproceedings{Chang2022Rate, author = {Chang, Meng-Che and Erdo\u{g}an, Tuna and Wang, Shi-Yuan and Bloch, Matthieu R.}, booktitle = {Proc. of IEEE International Symposium on Joint Communications \& Sensing}, title = {Rate and Detection Error-Exponent Tradeoffs of Joint Communication and Sensing}, year = {2022}, address = {Vienna, Austria}, month = mar, pages = {1--6}, doi = {10.1109/JCS54387.2022.9743498}, file = {:2022-Chang-ISJCS-Rate and Detection Error-Exponent Tradeoffs of Joint Communication and Sensing.pdf:PDF}, groups = {Joint communication and sensing, NSF1955401, NSF1910859}, howpublished = {accepted to the \emph{IEEE International Hybrid Symposium on Joint Communications \& Sensing}} }

6. S.-Y. Wang and M. R. Bloch, “Explicit Design of Provably Covert Channel Codes,” in Proc. of IEEE International Symposium on Information Theory, Jul. 2021, pp. 190–195.

   @inproceedings{Wang2021a, author = {Wang, Shi-Yuan and Bloch, Matthieu R.}, booktitle = {Proc. of IEEE International Symposium on Information Theory}, title = {Explicit Design of Provably Covert Channel Codes}, year = {2021}, month = jul, pages = {190-195}, doi = {10.1109/ISIT45174.2021.9517930}, file = {:2021-Wang-ISIT-Explicit Design of Provably Covert Channel Codes.pdf:PDF}, groups = {NSF1910859}, howpublished = {accepted to \emph{IEEE International Symposium on Information Theory}} }

7. S.-Y. Wang and M. R. Bloch, “Covert MIMO Communications under Variational Distance Constraint,” in Proc. of IEEE International Symposium on Information Theory, Los Angeles, CA, Jun. 2020, pp. 828–833.

   We consider the problem of covert communication over Multiple-Input Multiple-Output (MIMO) Additive White Gaussian Noise (AWGN) channels, in which a transmitter attempts to reliably communicate with a legitimate receiver while ensuring a low probability of detection by an adversary. We exactly characterize the covert capacity under a variational distance covertness constraint when MIMO channel matrices are static and known to all parties. We also characterize the covert capacity for a class of channels in which the legitimate channel matrix is known but the adversary’s channel matrix is only known to satisfy a rank and a spectral norm constraint.

   @inproceedings{Wang2020, author = {Wang, Shi-Yuan and Bloch, Matthieu R.}, booktitle = {Proc. of IEEE International Symposium on Information Theory}, title = {Covert {MIMO} Communications under Variational Distance Constraint}, year = {2020}, address = {Los Angeles, CA}, month = jun, pages = {828-833}, doi = {10.1109/ISIT44484.2020.9174387}, howpublished = {accepted to \emph{IEEE International Sympsoium on Information Theory}} }