LCLei Cao

Lei Cao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Lei Cao has a total of 34 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Observation-Transformed Distributed Detection (TDD) Under Reporting Noise and Power Constraint

    by Lei Cao, Ramanarayanan Viswanathan

    In distributed detection (DD), sensors typically report their sensed information to a fusion center (FC) either in its raw form or in a compressed form, where a final decision is made regarding the true hypothesis generating the data. In this paper, we focus on the scenario where the sensor reporting process is power-constrained, and the reporting channels are corrupted by additive noise. We propose an observation-transformed DD (TDD) framework, where the sensed data are transformed before being reported to the FC using the same power as the DD system without any observation transform. We demonstrate that the Bhattacharyya distance between the distributions of received signals under different hypotheses can be increased with proper design of the transforms. We then show that finding the optimal transform leads to a functional optimization problem, which can be solved using sequential quadratic programming (SQP). Suboptimal transforms are presented for maximizing the Bhattacharyya distance, as well as for maximizing the Kullback-Leibler divergence, and minimizing the Bayes error probability of detection for a single-sensor scenario. The results demonstrate that the proposed framework enhances detection performance and provides insights into the fundamental limits of power-constrained distributed detection in noisy environments.

  • Open Access

    SOVA-Decoded Serially Concatenated Continuous Phase Modulation System With Markov and Hidden Markov Sources

    by Zhijie Guo, Lei Cao

    We design low-complexity bi-directional (forward and backward) modified Soft-Output Viterbi Algorithm (SOVA) decoders to exploit source memory from binary Markov and hidden Markov model (HMM) sources, respectively, for decoding in serially concatenated continuous phase modulation (SCCPM) systems. The SCCPM system consists of a recursive systematic convolutional (RSC) code serially concatenated with an M-ary continuous phase modulation (CPM) signal, forming an iterative decoding structure where SOVA serves as the soft-input soft-output (SISO) decoder for both the CPM and RSC code components. The modified RSC SOVA decoders integrate soft information derived from source statistics (Markov or HMM characteristics) with the extrinsic information from the CPM SOVA, and the integrated soft information is used as refined a priori information for the RSC SOVA. The updated extrinsic information from the modified RSC SOVA is then exchanged with the CPM SOVA in subsequent iterations. Simulation results demonstrate that the proposed methods can effectively exploit the source statistics, thereby significantly enhancing error performance and accelerating decoding convergence in iterative decoding.

  • Performance of SOVA Decoded SCCPM with SNR Mismatch

    by Zhijie Guo, Lei Cao, Ramanarayanan Viswanathan


  • Open Access

    Correction to “Energy Efficient Signal Detection Using SPRT and Ordered Transmissions in Wireless Sensor Networks”

    by Shailee Yagnik, Ramanarayanan Viswanathan, Lei Cao

    In [1, p. 1124], a footnote is needed on (13) as shown below: \begin{equation*}\qquad\qquad\quad{{\alpha }^\# } < \left( {1 - {{c}_1}} \right)\alpha + \left( {1 - \left( {1 - {{c}_1}} \right)\alpha } \right)\alpha\qquad\qquad\quad \hbox{(13)$^{1}$} \end{equation*}

  • Optimal Sensor Decision Rules for Quantized-but-Uncoded Distributed Detection

    by Lei Cao, Ramanarayanan Viswanathan

    In conventional codeword-based distributed detection (CDD), sensors quantize their observations and report codewords to the fusion center (FC) where a final decision is made regarding the truthfulness of the hypotheses. Recently, quantized-but-uncoded DD (QDD) has been proposed, where sensors, after quantization, transmit summarized values instead of codewords to the FC. QDD can adapt well to the power constraint and offers better detection performance than CDD. However, the added degree of freedom in parameter selection in QDD comes with high complexity in optimal system design. The contribution of this letter is a proof showing that in QDD, the optimal sensor decision rules for binary decisions are likelihood-ratio-quantizers (LRQ), regardless of the reporting channel conditions, provided that the sensor observations are conditionally independent given the hypotheses. This property largely simplifies the design of QDD. Performance comparison is presented for CDD, QDD, and a benchmark system that reports original sensor observations, when both sensing and reporting channel noise exist.


  • Open Access

    Energy Efficient Signal Detection Using SPRT and Ordered Transmissions in Wireless Sensor Networks

    by Shailee Yagnik, Ramanarayanan Viswanathan, Lei Cao

    In a distributed detection system with multiple sensors, the ordered transmission scheme (OTS) proposed by Blum and Sadler requires a fewer number of transmissions in comparison with a fixed sample size test with the same probability of error performance. In this work, we propose an ordered transmission scheme using a truncated sequential probability ratio test (SPRT), termed as OSPRT. With a suitable choice of two design parameters, the probability of error of the OSPRT can be upper bounded by no more than a certain percentage above the probability of error of OTS, yet achieving significant savings in both the average number of samples needed to arrive at a decision, and the average energy in signal transmission. The superiority of ordered transmissions over unordered transmissions is quantified in terms of Kullback-Leibler information. Simulation analysis for the detection of a constant signal of moderate strength in Gaussian noise shows that the probability of error of OSPRT, which is substantially below the theoretical upper bound, is only negligibly larger than the OTS error. Analysis also shows that OSPRT is more energy efficient than the original OTS.


  • Open Access

    Quantized-but-uncoded Distributed Detection (QDD) with Unreliable Reporting Channels

    by Lei Cao, Ramanarayanan Viswanathan

    Distributed detection primarily centers around two approaches: Unquantized Distributed Detection (UDD), where each sensor reports its complete observation to the fusion center (FC), and quantized-and-Coded DD (CDD), where each sensor first partitions the observation space and then reports to the FC a codeword. In this paper, we introduce Quantized-but-uncoded DD (QDD), where each sensor, after quantization, transmits a summarized value, instead of a codeword, to the FC. We show that QDD well adapts to the constraint of transmission power when compared to CDD, albeit with increased complexity in parameter selection. Moreover, we establish that, in the presence of independent observations, QDD upholds a necessary condition inherent in CDD. Specifically, the optimal sensor decision rules are the likelihood ratio quantizers (LRQ), irrelevant to the channel conditions. In the context of a single-sensor scenario involving binary decision at the sensor, we find that the optimal sensor rule in QDD is in general no longer ``channel blind", a feature presented in CDD. In addition, we compare these systems numerically under the same transmission power and bandwidth, while assuming additive white Gaussian noise (AWGN) in both sensing and reporting stages. Finally, we present some potential directions for future research.

  • Average Operation Time of Bundle Protocol in Delay/Disruption-Tolerant Networks

    by Lei Cao, Ramanarayanan Viswanathan

    Performance analysis of the Bundle Protocol (BP) in Delay/ disruption-Tolerant Networks (DTN) has gained much interest. The analytic work of the average operation time (AOT) in BP, for different channel conditions and system parameters, though critical to understanding performance and designing system, is still incomplete. Existing results, such as the average file delivery time (AFDT), provide reasonably close estimates in some cases but exhibit large discrepancies in other cases. In this paper, we provide a holistic probabilistic analysis of the BP process, particularly in the number of error bundles and the position of the last error bundle in each and the last rounds of transmission. We provide, for the first time, an exact solution for the AOT of the BP process. The derivation works for both symmetric and asymmetric channels and is in general for any given maximum number of transmissions rounds. When the unlimited number of transmission rounds is considered, AOT becomes AFDT. The results are further utilized to select the optimal bundle size that gives the minimum file delivery time. Validation via simulations and comparison with existing work are also provided.


  • Open Access

    Performance of XOR Rule for Decentralized Detection of Deterministic Signals in Bivariate Gaussian Noise

    by Xingjian Sun, Shailee Yagnik, Ramanarayanan Viswanathan, Lei Cao

    In this paper, we consider the performance of exclusive-OR (XOR) rule in detecting the presence or absence of a deterministic signal in bivariate Gaussian noise. Signals, when present at the two sensors, are assumed unequal, whereas the noise components have identical marginal distribution but are correlated. The sensors send their one-bit quantized data to a fusion center, which then employs the XOR rule to arrive at the final decision. Here we prove that, in the limit as the correlation coefficient $r$ approaches 1, the optimum fusion rule for both parallel and tandem topologies is XOR with identical, alternating partitions (XORAP) of the observations at the sensors. We further quantify the asymptotic decrease of the Bayes error of XORAP towards zero as a constant multiplied by $\sqrt {1-r}$ , as $r$ approaches 1. When compared to the asymptotic Bayes error of CLRT, which decreases to zero exponentially fast, as a function of $1/(1-r)$ , the Bayes error of XORAP decreases to zero much slower.


  • Exact File Delivery Time of Bundle Protocol in Delay/disruption-Tolerant Networks

    by Lei Cao, Ramanarayanan Viswanathan

    As the data delivery protocol in the Delay/ disruption-Tolerant Networks (DTN), the Bundle Protocol (BP) has gained much interest in its performance analysis. Existing analytic results in terms of the average file delivery time (AFDT) are mainly approximations, which provide reasonably close estimates in some cases but exhibit large discrepancies in other cases. In this paper, we point out a fallacy used in existing work, and, for the first time, provide an exact mathematical solution of the AFDT of the bundle protocol. This result works for both symmetric and asymmetric channel conditions, with either unlimited or limited total number of transmission rounds. Validation via simulation is also provided.