Kernel adaptive filters (KAFs) are a class of nonlinear adaptive filters developed in the reproducing kernel Hilbert space, and are particularly suitable for addressing signalprocessing issues involving data streams ...
详细信息
Kernel adaptive filters (KAFs) are a class of nonlinear adaptive filters developed in the reproducing kernel Hilbert space, and are particularly suitable for addressing signalprocessing issues involving data streams and unknown nonlinearities. However, KAFs endure the issue of network structure growth as the number of training samples increases. To this end, a novel structural sparsification method for KAFs, i.e., Gauss Hermite Fourier features (GHFF) method, is first proposed by combining Gauss Hermite quadrature integration rule and Fourier transform. Subsequently, the GHFF method is integrated with the maximum correntropy criterion in filter design, leading to the development of two new adaptive filtering algorithms, i.e., GHFF maximum correntropy (GHFFMC) algorithm and stochastic batch GHFFMC (SB-GHFFMC) algorithm. The proposed GHFFMC and SB-GHFFMC algorithms are expected to exhibit excellent capabilities in characterizing the unknown nonlinear relationships within the data, along with robustness to outliers. Meanwhile, SB-GHFFMC is anticipated to exhibit superior filtering performance in comparison with GHFFMC, as it leverages a general and flexible batch gradient descent method for model optimization. Simulations on nonlinear system identification and time-series prediction of Chua's circuits confirm the performance superiorities of the proposed algorithms compared to other robust KAFs and RFF-based filters.
In wireless communications and vehicle communications, it is useful to use adaptive filtering techniques for channel estimation, beamforming and echo cancellation. In this paper, we propose a general constrained adapt...
详细信息
In wireless communications and vehicle communications, it is useful to use adaptive filtering techniques for channel estimation, beamforming and echo cancellation. In this paper, we propose a general constrained adaptive filtering (GCAF) algorithm for single channel estimation and beamforming, which is obtained by integrating a general and adaptive loss function into the constrained adaptive filtering (CAF) framework. By selecting the parameter in the GCAF, it can approximate to several popular CAF algorithms. Then, the convergence, stability boundary and the stability analysis of the mean squared-deviation have been analyzed and presented in detail. Additionally, The complexity of the GCAF is presented and compared with the existing algorithms. The proposed GCAF is used for single-input and single-output (SISO) channel estimation and beamforming under different noises, and the tracking performance of the GCAF is also analyzed. The simulation results demonstrate that the GCAF algorithm outperforms the typically adaptive filtering algorithms and can effectively approxiamte the similar algorithms under heavy-tailed noises, which makes the proposed GCAF more robust and general.
Conventionally, in a differentially private additive noise mechanism, independent and identically distributed (i.i.d.) noise samples are added to each coordinate of the response. In this work, we formally present the ...
详细信息
Conventionally, in a differentially private additive noise mechanism, independent and identically distributed (i.i.d.) noise samples are added to each coordinate of the response. In this work, we formally present the addition of noise that is independent but not identically distributed (i.n.i.d.) across the coordinates to achieve tighter privacy-accuracy trade-off by exploiting coordinate-wise disparity in privacy leakage. In particular, we study the i.n.i.d. Gaussian and Laplace mechanisms and obtain the conditions under which these mechanisms guarantee privacy. The optimal choice of parameters that ensure these conditions are derived considering (weighted) mean squared and l(p)(p)-errors as measures of accuracy. Theoretical analyses and numerical simulations demonstrate that the i.n.i.d. mechanisms achieve higher utility for the given privacy requirements compared to their i.i.d. counterparts. One of the interesting observations is that the Laplace mechanism outperforms Gaussian even in high dimensions, as opposed to the popular belief, if the irregularity in coordinate-wise sensitivities is exploited. We also demonstrate how the i.n.i.d. noise can improve the performance in private (a) coordinate descent, (b) principal component analysis, and (c) deep learning with group clipping.
The article focuses on the problem of searching for voids under the road surface using ground penetrating radar (GPR). Early detection of such voids allows for the prediction of road collapses and prevents the occurre...
详细信息
ISBN:
(数字)9798331518752
ISBN:
(纸本)9798331518769
The article focuses on the problem of searching for voids under the road surface using ground penetrating radar (GPR). Early detection of such voids allows for the prediction of road collapses and prevents the occurrence of hazards. The main emphasis is on a review of signal processing algorithms used for this purpose. First, basic signalprocessing steps common to all GPR applications are considered. Then some advanced GPR signalprocessing methods are discussed. Next, the techniques used specifically for cave-in prediction are highlighted. Finally, an experimental study is described. The article is a review and introduces an important area of research and development.
Neural prosthetic systems provide promising solutions for restoring motor functions in individuals with disabilities. However, optimizing the control systems that decode neural signals remains a key challenge due to t...
详细信息
ISBN:
(数字)9798331509828
ISBN:
(纸本)9798331509835
Neural prosthetic systems provide promising solutions for restoring motor functions in individuals with disabilities. However, optimizing the control systems that decode neural signals remains a key challenge due to the dynamic nature of neural activity. This paper proposes a novel approach using a Genetic Algorithm (GA) to optimize the parameters of adaptive signal processing algorithms in neural prosthetic systems. The GA enables continuous calibration and adjustment, improving the accuracy of neural signal decoding and control over time. Simulation results show significant improvements in the efficiency of signal decoding from EEG/EMG data, leading to smoother control of prosthetic devices. The proposed methodology offers an adaptive and user-specific solution, contributing to enhanced prosthetic functionality and user experience.
The physical layer in a cellular network base station typically runs on a field programmable gate array (FPGA) to enable reconfigurability and adaptability to meet future demands of the network with sufficient computa...
详细信息
The physical layer in a cellular network base station typically runs on a field programmable gate array (FPGA) to enable reconfigurability and adaptability to meet future demands of the network with sufficient computational power. This work proposes a novel architecture and algorithms for the FPGA implementation of the fifth-generation (5G) new radio (NR) physical downlink control channel (PDCCH) using the 3GPP procedures for downlink control information (DCI) processing, including sub-block interleaver, bit selection, scrambling, golden sequence generation, and modulation. The proposed algorithms are optimized to meet 5G-NR frame timings for DCI processing with minimum power consumption and hardware resource utilization. We perform rigorous testing including all corner cases to benchmark our designs in i) standalone mode, and ii) integrated fashion for the end-to-end PDCCH processing. The PDCCH implementation, with maximum DCI payload, using the proposed architecture and algorithms achieves 1.5 mu s latency, 1.98% hardware resource utilization, 1.2$ Gbps throughput and 10 Gbps/W power efficiency. With a subcarrier spacing Delta f=30 KHz, it can multiplex DCI to schedule up to 20 and 40 users for one orthogonal frequency division multiplexing (OFDM) and two OFDM symbols long PDCCH respectively.
The Automatic Identification System (AIS), as a standard communication and navigation device for ships, plays a significant role in ensuring the safety and efficiency of maritime traffic. The accuracy of the AIS recei...
详细信息
ISBN:
(数字)9791188428137
ISBN:
(纸本)9798331507602
The Automatic Identification System (AIS), as a standard communication and navigation device for ships, plays a significant role in ensuring the safety and efficiency of maritime traffic. The accuracy of the AIS receiver’s signalprocessing directly affects the bit error rate (BER) and packet error rate (PER) of the AIS system, drawing considerable attention to AIS signal reception and processing technologies. Current research on AIS reception signals mainly focuses on custom implementations using hardware platforms like FPGAs; however, the high cost of hardware implementation has become a limiting factor in the development of AIS signalprocessing technologies. Therefore, this paper designs an AIS reception signalprocessing system based on GNU Radio, developing demodulation algorithm and NRZI decoding modules, and testing them with typical demodulation algorithms. Experimental results demonstrate the feasibility and effectiveness of the designed reception signalprocessing system.
We study blind deconvolution of signals defined on the nodes of an undirected graph. Although observations are bilinear functions of both unknowns, namely the forward convolutional filter coefficients and the graph si...
详细信息
We study blind deconvolution of signals defined on the nodes of an undirected graph. Although observations are bilinear functions of both unknowns, namely the forward convolutional filter coefficients and the graph signal input, a filter invertibility requirement along with input sparsity allow for an efficient linear programming reformulation. Unlike prior art that relied on perfect knowledge of the graph eigenbasis, here we derive stable recovery conditions in the presence of small graph perturbations. We also contribute a provably convergent robust algorithm, which alternates between blind deconvolution of graph signals and eigenbasis denoising in the Stiefel manifold. Reproducible numerical tests showcase the algorithm's robustness under several graph eigenbasis perturbation models.
High-quality sleep is a fundamental guarantee for human physical health. Sleep monitoring is crucial for understanding sleep quality and structure, but traditional sleep monitoring methods often require specialized la...
详细信息
High-quality sleep is a fundamental guarantee for human physical health. Sleep monitoring is crucial for understanding sleep quality and structure, but traditional sleep monitoring methods often require specialized lab environments and uncomfortable sensors. This article proposes a noncontact sleep monitoring method based on millimeter-wave radar, which accurately measures breathing and heartbeat rates during sleep by preprocessing reflected signals and using variational mode extraction (VME) algorithm and simultaneously detects snoring events. In order to improve the accuracy of snoring detection, a sliding window algorithm based on data density and amplitude is introduced, effectively filtering out low-amplitude noise and accurately identifying snoring segments. Experimental results show that this method can detect snoring events with an average error of 0.10 s, and the accuracy of breathing rate and heart rate (HR) detection is approximately 0.72 and 2.56 bpm, respectively. This method demonstrates high real-time performance and reliability and is expected to find broad applications in the diagnosis of clinical sleep disorders and home health monitoring.
This paper presents a novel method to obtain non-power-of-two (NP2) fast Fourier transform (FFT) flow graphs based on a new prime factor algorithm (PFA). The FFT flow graph is crucial for designing FFT architectures b...
详细信息
This paper presents a novel method to obtain non-power-of-two (NP2) fast Fourier transform (FFT) flow graphs based on a new prime factor algorithm (PFA). The FFT flow graph is crucial for designing FFT architectures but previous works only provide systematic approaches to build flow graphs for power-of-two sizes (P2). Thus, the derivation of NP2 flow graphs is an important step towards the design of efficient NP2 FFT architectures. The proposed approach consists of two independent parts. On the one hand, it obtains all the possible index mappings that lead to a flow graph with no rotations between butterflies. On the other hand, it determines the permutations between butterflies in the flow graph. By combining these two parts, the order of the inputs and outputs is derived. As a result, the entire flow graph is obtained systematically. Additionally, the proposed approach generates all the possible flow graphs for a given factorization of the FFT size. The reduction in operations for NP2 FFTs using the proposed approach leads to a significant reduction in area and power consumption concerning P2 FFTs with similar sizes after implementing the proposed flow graphs directly in hardware. Particularly, there is a significant improvement between the proposed 30-point and 60-point FFT and previous efficient P2 FFTs. This remarkable fact sets NP2 at the forefront of FFT research after being in second place behind P2 FFTs for decades.
暂无评论