EURASIP Journal on Advances in Signal Processing最新文献

This paper analyzes the fundamental trade-offs that occur in the co-design of pilot resource allocations in orthogonal frequency-division multiplexing signals for both ranging (via time-of-arrival estimation) and communications. These trade-offs are quantified through the Shannon capacity bound, probability of outage, and the Ziv–Zakai bound on range estimation variance. Bounds are derived for signals experiencing frequency-selective Rayleigh block fading, accounting for the impact of limited channel knowledge and multi-antenna reception. Uncompensated carrier frequency offset and phase errors are also factored into the capacity bounds. Analysis based on the derived bounds demonstrates how Pareto-optimal design choices can be made to optimize the communication throughput, probability of outage, and ranging variance. Different pilot resource allocation strategies are then analyzed, showing how Pareto-optimal design choices change depending on the channel.

This paper proposes a classification method for financial time series that addresses the significant issue of noise. The proposed method combines improved complete ensemble empirical mode decomposition with adaptive noise (ICEEMDAN) and wavelet threshold de-noising. The method begins by employing ICEEMDAN to decompose the time series into modal components and residuals. Using the noise component verification approach introduced in this paper, these components are categorized into noisy and de-noised elements. The noisy components are then de-noised using the Wavelet Threshold technique, which separates the non-noise and noise elements. The final de-noised output is produced by merging the non-noise elements with the de-noised components, and the 1-NN (nearest neighbor) algorithm is applied for time series classification. Highlighting its practical value in finance, this paper introduces a two-step stock classification prediction method that combines time series classification with a BP (Backpropagation) neural network. The method first classifies stocks into portfolios with high internal similarity using time series classification. It then employs a BP neural network to predict the classification of stock price movements within these portfolios. Backtesting confirms that this approach can enhance the accuracy of predicting stock price fluctuations.

Cell-free massive multiple-input multiple-output (CF-mMIMO) has attracted considerable attention due to its potential for delivering high data rates and energy efficiency (EE). In this paper, we investigate the resource allocation of downlink in CF-mMIMO systems. A hierarchical depth deterministic strategy gradient (H-DDPG) framework is proposed to jointly optimize the access point (AP) clustering and power allocation. The framework uses two-layer control networks operating on different timescales to enhance EE of downlinks in CF-mMIMO systems by cooperatively optimizing AP clustering and power allocation. In this framework, the high-level processing of system-level problems, namely AP clustering, enhances the wireless network configuration by utilizing DDPG on the large timescale while meeting the minimum spectral efficiency (SE) constraints for each user. The low layer solves the link-level sub-problem, that is, power allocation, and reduces interference between APs and improves transmission performance by utilizing DDPG on a small timescale while meeting the maximum transmit power constraint of each AP. Two corresponding DDPG agents are trained separately, allowing them to learn from the environment and gradually improve their policies to maximize the system EE. Numerical results validate the effectiveness of the proposed algorithm in term of its convergence speed, SE, and EE.

Electrocardiogram (ECG) prediction is highly important for detecting and storing heart signals and identifying potential health hazards. To improve the duration and accuracy of ECG prediction on the basis of noise filtering, a new algorithm based on variational mode decomposition (VMD) and a convolutional gated recurrent unit (ConvGRU) was proposed, named VMD-ConvGRU. VMD can directly remove noise, such as baseline drift noise, without manual intervention, greatly improving the model usability, and its combination with ConvGRU improves the prediction time and accuracy. The proposed algorithm was compared with three related algorithms (PSR-NN, VMD-NN and TS fuzzy) on MIT-BIH, an internationally recognized arrhythmia database. The experiments showed that the VMD-ConvGRU algorithm not only achieves better prediction accuracy than that of the other three algorithms but also has a considerable advantage in terms of prediction time. In addition, prediction experiments on both the MIT-BIH and European ST-T databases have shown that the VMD-ConvGRU algorithm has better generalizability than the other methods.

Nonparametric estimation of the covariance function and the power spectral density of uniformly spaced data from stationary stochastic processes with missing samples is investigated. Several common methods are tested for their systematic and random errors under the condition of variations in the distribution of the missing samples. In addition to random and independent outliers, the influence of longer and hence correlated data gaps on the performance of the various estimators is also investigated. The aim is to construct a bias-free estimation routine for the covariance function and the power spectral density from stationary stochastic processes under the condition of missing samples with an optimum use of the available information in terms of low estimation variance and mean square error, and that independent of the spectral composition of the data gaps. The proposed procedure is a combination of three methods that allow bias-free estimation of the desired statistical functions with efficient use of the available information: weighted averaging over valid samples, derivation of the covariance estimate for the entire data set and restriction of the domain of the covariance function in a post-processing step, and appropriate correction of the covariance estimate after removal of the estimated mean value. The procedures abstain from interpolation of missing samples as well as block subdivision. Spectral estimates are obtained from covariance functions and vice versa using Wiener–Khinchin’s theorem.

Abstract

Global Navigation Satellite System (GNSS) is pervasively used in position, navigation, and timing (PNT) applications. As a consequence, important assets have become vulnerable to intentional attacks on GNSS, where of particular relevance is spoofing transmissions that aim at superseding legitimate signals with forged ones in order to control a receiver’s PNT computations. Detecting such attacks is therefore crucial, and this article proposes to employ an algorithm based on deep learning to achieve the task. A data-driven classifier is considered that has two components: a deep learning model that leverages parallelization to reduce its computational complexity and a clustering algorithm that estimates the number and parameters of the spoofing signals. Based on the experimental results, it can be concluded that the proposed scheme exhibits superior performance compared to the existing solutions, especially under moderate-to-high signal-to-noise ratios.

Point cloud registration is a multifaceted problem that involves a series of procedures. Many deep learning methods employ complex structured networks to achieve robust registration performance. However, these intricate structures can amplify the challenges of network learning and impede gradient propagation. To address this concern, the soft-hard correspondence (SHC) framework is introduced in the present paper to streamline the registration problem. The framework encompasses two modes: the hard correspondence mode, which transforms the registration problem into a correspondence pair search problem, and the soft correspondence mode, which addresses this new problem. The simplification of the problem provides two advantages. First, it eliminates the need for intermediate operations that lead to error fusion and counteraction, thereby improving gradient propagation. Second, a perfect solution is not necessary to solve the new problem, since accurate registration results can be achieved even in the presence of errors in the found pairs. The experimental results demonstrate that SHC successfully simplifies the registration problem. It achieves performance comparable to complex networks using a simple network and can achieve zero error on datasets with perfect correspondence pairs.

In the existing domain adaptation-based bearing fault diagnosis methods, the data difference between the source domain and the target domain is not obvious. Besides, parameters of target domain feature extractor gradually approach that of source domain feature extractor to cheat discriminator which results in similar feature distribution of source domain and target domain. These issues make it difficult for the domain adaptation-based bearing fault diagnosis methods to achieve satisfactory performance. An unsupervised domain adaptive bearing fault diagnosis method based on maximum domain discrepancy (UDA-BFD-MDD) is proposed in this paper. In UDA-BFD-MDD, maximum domain discrepancy is exploited to maximize the feature difference between the source domain and target domain, while the output feature of target domain feature extractor can cheat the discriminator. The performance of UDA-BFD-MDD is verified through comprehensive experiments using the bearing dataset of Case Western Reserve University. The experimental results demonstrate that UDA-BFD-MDD is more stable during training process and can achieve higher accuracy rate.

Although some existing sparse representation (SR) methods are robust for target detection in passive bistatic radar (PBR), they still face the challenges of high computational complexity and poor detection performance for extremely low-signal-to-clutter ratio (SCR) target. So, an average effective subcarrier (AES)-domain sparse representation approach is investigated in this paper. Firstly, the AES-based SR model is proposed to solve the problem of high computational complexity, which is established by utilizing the sparseness of the orthogonal frequency-division multiplexing (OFDM) with cyclic prefix (CP) signals in each effective subcarrier domain. Then, considering the difficulty of detecting extremely low-SCR targets, clutter cancellation is implemented by the SR-based optimization model. Two AES-S algorithms, namely AES-S-based clutter cancellation in the time domain (AES-S-T) and AES-S-based clutter cancellation in the subcarrier domain (AES-S-C), are proposed, and the computational complexity is further reduced. Finally, extensive simulation and experimental results illustrate that the proposed algorithms have good detection performance and low computational complexity in PBR detection scene.

Due to the limited transmission capabilities of terrestrial intelligent devices within the Internet of Remote Things (IoRT), this paper proposes an optimization scheme aimed at enhancing data transmission rate while ensuring communication reliability. This scheme focuses on multi-unmanned aerial vehicle (UAV)-assisted IoRT data communication within the satellite–aerial–terrestrial integrated network (SATIN), which is one of the key technologies for the sixth generation (6G) networks. To optimize the system’s data transmission rate, we introduce a multi-dimensional coverage and power optimization (CPO) algorithm, rooted in the block coordinate descent (BCD) method. This algorithm concurrently optimizes various parameters, including the number and deployment of UAVs, the correlation between IoRT devices and UAVs, and the transmission power of both devices and UAVs. To ensure comprehensive coverage of a large-scale randomly distributed array of terrestrial devices, combined with machine learning algorithm, we present the Dynamic Deployment based on K-means (DDK) algorithm. Additionally, we address the non-convexity challenge in resource allocation for transmission power through variable substitution and the successive convex approximation technique (SCA). Simulation results substantiate the remarkable efficacy of our CPO algorithm, showcasing a maximum 240% improvement in the uplink transmission rate of IoRT data compared to conventional methods.