29 July 2010 in IEEE Transactions on Wireless Communications
This paper addresses the bit error rate performance of diversity combining schemes for a single-user communication system operating over Rayleigh flat fading channels subject to impulsive alpha-stable noise, which is known to arise due to network interference from a Poisson field of interference sources. Under this setting, a theoretical benchmark receiver is analyzed, the maximum possible diversity order attainable is derived to be Lα/2, where L is the number of antennas and α is the characteristic exponent of the noise. Moreover, trade-offs between the diversity gain and the array gain have been identified. The conventional linear matched filter receiver (also known as maximum ratio combining in the Gaussian case) has been shown to have a diversity order of α/2, thereby not benefiting from spatial diversity. Closed form expressions for the diversity gain and array gain of post-detection combining have been derived. As an improvement to conventional combining schemes, the optimum maximum likelihood detector is derived. A simpler high SNR approximation of the detector is shown to not depend on the noise parameters, and is compared to the generalized Cauchy detector under stable noise. Monte-Carlo simulations are used to supplement our analytical results and compare the performance of the detectors.
30 August 2021 in IEEE Access
Automatic detection of solar array faults reduces maintenance costs and increases efficiency. In this paper, we address the problem of fault detection, localization, and classification in utility-scale photovoltaic (PV) arrays using machine learning methods. More specifically, we develop a series of customized neural networks for detection and classification of solar array faults. We evaluate fault detection and classification using metrics such as accuracy, confusion matrices, and the Risk Priority Number (RPN). We examine and assess the use of customized neural networks with dropout regularizers. We develop and evaluate neural network pruning strategies and illustrate the trade-off between fault classification model accuracy and algorithm complexity. Our approach promises to elevate the performance and robustness of PV arrays and compares favorably against existing methods.
26 February 2007 in IEEE Transactions on Wireless Communications
Impulsive, non-Gaussian noise is prevalent in wireless environments. We adopt an impulsive noise model over multi-input-multi-output (MIMO) channels and discuss receiver and code design over fading channels with impulsive noise. We derive code design criteria for the so-called genie-aided, and minimum distance receivers, both of which yield criteria identical to the nonimpulsive, Gaussian noise case. We also study the performance of certain space-time block codes (STBCs) and space-time trellis codes (STTC) over impulsive noise channels with the genie-aided receiver (GAR) and minimum distance receiver (MDR). The performance loss incurred by the impulsive nature of the noise is shown to increase with the diversity order for the MDR. To approximate the good performance of the practically unrealistic GAR, we propose a maximum a posteriori (MAP) receiver, whose performance can be tightly lower bounded by the GAR. We simplify the optimal MAP receiver by an approximation and show that for alt cases of practical interest, only 2 terms in the approximation are sufficient to get a near-MAP performance. Simulations corroborate our analytical findings
4 October 2019 in IEEE Transactions on Signal and Information Processing over Networks
A novel distributed algorithm for estimating the maximum of the node initial state values in a network, in the presence of additive communication noise is proposed. Conventionally, the maximum is estimated locally at each node by updating the node state value with the largest received measurements in every iteration. However, due to the additive channel noise, the estimate of the maximum at each node drifts at each iteration and this results in nodes diverging from the true max value. Max-plus algebra is used as a tool to study this ergodic process. The subadditive ergodic theorem is invoked to establish a constant growth rate for the state values due to noise, which is studied by analyzing the max-plus Lyapunov exponent of the product of noise matrices in a max-plus semiring. The growth rate of the state values is upper bounded by a constant which depends on the spectral radius of the network and the noise variance. Upper and lower bounds are derived for both fixed and random graphs. Finally, a two-run algorithm robust to additive noise in the network is proposed and its variance is analyzed using concentration inequalities. Simulation results supporting the theory are also presented.
15 December 2016 in IEEE Sensors Journal
Distributed node counting in wireless sensor networks can be important in various applications, such as network maintenance and information aggregation. In this paper, a distributed consensus algorithm for estimating the number of nodes in a wireless sensor network in the presence of communication noise is introduced. In networks with a fusion center, counting the number of nodes can easily be done by letting each node to transmit a fixed constant value to the fusion center. In a network without a fusion center, where nodes do not know the graph structure, estimating the number of nodes is not straightforward. The proposed algorithm is based on distributed average consensus and norm estimation. Different sources of error are explicitly discussed; the Fisher information and the distribution of the final estimate are derived. Several design parameters and how they affect the performance of the algorithm are studied, which provide guidelines toward making the estimation error smaller. Simulation results corroborating the theory are also provided.
17 December 2020 in IEEE Transactions on Signal Processing
It is well-known that time-varying channels can provide time diversity and improve error rate performance compared to time-invariant fading channels. However, exploiting time diversity requires very accurate channel estimates at the receiver. In order to reduce the number of unknown channel coefficients while estimating the time-varying channel, basis expansion models can be used along with long transmission frames that contain multiple orthogonal frequency division multiplexing (OFDM) symbols that experience the channel variation. The design of these OFDM frames need to judiciously incorporate training and data insertions in the transmitted signal while maintaining orthogonality. In this work, we propose an inter channel interference (ICI)-free training model depending on pilot symbols only and provide a corresponding time-varying channel estimation method. This scheme relies on an algorithm to determine the number of OFDM symbols per frame and the number of basis functions per path with minimal information about the Doppler bandwidth. As a performance benchmark, Bayesian Cramér Rao lower bound (CRLB) and the corresponding MSE bound are derived analytically for the proposed training model. Theoretical MSE expressions of the proposed estimation scheme are also derived as well as the MSE expressions in the presence of Doppler frequency mismatch. Simulations exhibit substantial MSE improvement and the corresponding Symbol Error Rate (SER) performances of the low complexity estimation scheme. They also corroborate that, unlike the common results in the literature, an OFDM system can perform better as the Doppler frequency increases with judicious design of training and channel estimation schemes.