Shuche Wang

Shuche Wang

Auto-generated profile, based on publicly available information

Shuche Wang

Institute of Operations Research and Analytics, National University of Singapore, Queenstown, Singapore

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 January 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
SWShuche Wang
Shuche Wang
ZHZhiqiang He
Zhiqiang He
Kai NiuKai Niu
Kai Niu
PCPeng Chen
Peng Chen
Yue RongYue Rong
Yue Rong
Impulsive noise can greatly affect the performance of underwater acoustic (UA) orthogonal frequency-division multiplexing (OFDM) systems. In this paper, by utilizing the sparsity of the UA channel impulse response and impulsive noise, we first propose a novel sparse Bayesian learning (SBL) based expectation maximization (EM) algorithm for joint channel estimation and impulsive noise mitigation in UA OFDM systems. Secondly, considering that the UA channel and impulsive noise are fast time-varying, we develop a new approach which combines the SBL with the forward-backward Kalman filtering to track the UA channel and impulsive noise. To further improve the system performance, we utilize the information available on data subcarriers for joint time-varying channel estimation and data detection, based on the SBL algorithm and the Kalman filter. The performance of our proposed algorithms is verified through both numerical simulations and by data collected during a UA communication experiment conducted in the estuary of the Swan River, Perth, Australia. The results demonstrate that compared with existing approaches, the proposed algorithms achieve a better system bit-error-rate and frame-error-rate performance.

7 December 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SWShuche Wang
Shuche Wang
YTYuanyuan Tang
Yuanyuan Tang
Jin SimaJin Sima
Jin Sima
RGRyan Gabrys
Ryan Gabrys
FFFarzad Farnoud
Farzad Farnoud
The problem of correcting deletions has received significant attention, partly because of the prevalence of these errors in DNA data storage. In this paper, we study the problem of correcting a consecutive burst of at most $t$ deletions in non-binary sequences. When the alphabet size $q$ is even, we first propose a non-binary code correcting a burst of at most 2 deletions for $q$ -ary alphabets. Afterwards, we extend this result to the case where the length of the burst can be at most $t$ where $t$ is a constant. Finally, we consider the setup where the sequences that are transmitted are permutations. The proposed codes are the largest known for their respective parameter regimes.

2 January 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
YTYuanyuan Tang
Yuanyuan Tang
SWShuche Wang
Shuche Wang
HLHao Lou
Hao Lou
RGRyan Gabrys
Ryan Gabrys
FFFarzad Farnoud
Farzad Farnoud
Due to its higher data density, longevity, energy efficiency, and ease of generating copies, DNA is considered a promising technology for satisfying future storage needs. However, a diverse set of errors including deletions, insertions, duplications, and substitutions may arise in DNA at different stages of data storage and retrieval. The current paper constructs error-correcting codes for simultaneously correcting short (tandem) duplications and at most p edits, where a short duplication generates a copy of a substring with length ≤ 3 and inserts the copy following the original substring, and an edit is a substitution, deletion, or insertion. Compared to the state-of-the-art codes for duplications only, the proposed codes correct up to p edits (in addition to duplications) at the additional cost of roughly 8 p (log q n )(1 + o (1)) symbols of redundancy, thus achieving the same asymptotic rate, where q ≥ 4 is the alphabet size and p is a constant. Furthermore, the time complexities of both the encoding and decoding processes are polynomial when p is a constant with respect to the code length.

12 April 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
SWShuche Wang
Shuche Wang
ZHZhiqiang He
Zhiqiang He
Yue RongYue Rong
Yue Rong
In this article, we investigate a two-hop decode-and-forward (DF) multicasting multiple-input multiple-output (MIMO) wireless relay communication system. Different to conventional systems, the radio frequency (RF) energy from the source node is harvested at the relay node and used for forwarding signals to a group of receivers. Considering the structure of the energy harvesting (EH) relay node, we present a power splitting (PS) based protocol and a novel time switching (TS) based protocol by introducing two additional TS factors. For both protocols, we maximize the system mutual information (MI) of the multicasting MIMO relay system by jointly optimizing the source and relay covariance matrices under the constraints of the source energy and the relay harvested energy. In addition, a practical nonlinear EH model is adopted, where the energy harvested by the relay node is bounded as the incident RF signal power increases, and the harvested power is zero when the input power is below the minimum power for harvesting. For the TS based protocol, we also consider peak transmission power constraints at both the source and relay nodes. The performance of the proposed algorithms is verified via numerical simulations. The results demonstrate that the novel TS based protocol achieves a larger MI than the conventional TS protocol. The PS and TS based protocols achieve tradeoffs at different source power levels. In particular, compared with the PS based protocol, the proposed novel TS based protocol can reach a higher system MI when the EH bound is not reached, while the former protocol reaches a higher MI when the EH circuit is saturated. We show that the peak harvested energy constraint plays an important role in selecting the optimal location of the relay node.

5 July 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
YTYuanyuan Tang
Yuanyuan Tang
SMSarvin Motamen
Sarvin Motamen
HLHao Lou
Hao Lou
KWKallie Whritenour
Kallie Whritenour
SWShuche Wang
Shuche Wang
FFFarzad Farnoud
Farzad Farnoud
Localized errors, which occur in windows with bounded lengths, are common in a range of applications. Such errors can be modeled as k-substring edits , which replace one substring with another string, both with lengths upper bounded by k . This generalizes errors such as localized deletions or burst substitutions studied in the literature. In this paper, we show through statistical analysis of real data that substring edits better describe differences between related documents compared to independent edits, and thus commonly arise in problems related to data synchronization. We also show that for the dataset under study, assuming codes exist that can achieve the Gilbert-Varshamov (GV) bound, substring-edit-correcting codes can synchronize two documents with much lower overhead compared to general indel/substitution-correcting codes. Furthermore, given a constant k , we construct binary codes of length n for correcting a single k -substring edit that achieves the GV bound and subsequently has redundancy of asymptotically 2 log n , compared to 4 k log n , the lowest redundancy achievable by an existing code for this problem. The time complexities of both encoding and decoding are polynomial with respect to n .

7 February 2025 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SWShuche Wang
Shuche Wang
VTVincent Tan
Vincent Tan
Distributed gradient descent algorithms have come to the fore in modern machine learning, especially in parallelizing the handling of large datasets that are distributed across several workers. However, scant attention has been paid to analyzing the behavior of distributed gradient descent algorithms in the presence of adversarial corruptions instead of random noise. In this paper, we formulate a novel problem in which adversarial corruptions are present in a distributed learning system. We show how to use ideas from (lazy) mirror descent to design a corruption-tolerant distributed optimization algorithm. Extensive convergence analysis for (strongly) convex loss functions is provided for different choices of the stepsize. We carefully optimize the stepsize schedule to accelerate the convergence of the algorithm, while at the same time amortizing the effect of the corruption over time. Experiments based on linear regression, support vector classification, and softmax classification on the MNIST dataset corroborate our theoretical findings.