Perfect Reconstructable Decimated One-Dimensional Empirical Mode Decomposition Filter Banks

This paper introduces decimated filter banks for the one-dimensional empirical mode decomposition （1D-EMD）. These filter banks can provide perfect reconstruction and allow for an arbitrary tree structure. Since the EMD is a data driven decomposition, it is a very useful analysis instrument for non-stationary and non-linear signals. However, the traditional 1D-EMD has the disadvantage of expanding the data. Large data sets can be generated as the amount of data to be stored increases with every decomposition level. The 1D-EMD can be thought as having the structure of a single dyadic filter. However, a methodology to incorporate the decomposition into any arbitrary tree structure has not been reported yet in the literature. This paper shows how to extend the 1D-EMD into any arbitrary tree structure while maintaining the perfect reconstruction property. Furthermore, the technique allows for downsampling the decomposed signals. This paper, thus, presents a method to minimize the data-expansion drawback of the 1D-EMD by using decimation and merging the EMD coefficients. The proposed algorithm is applicable for any arbitrary tree structure including a full binary tree structure.

Hardware Architecture of Polyphase Filter Banks Performing Embedded Resampling for Software-Defined Radio Front-Ends

In this paper, we describe resourceefficient hardware architectures for softwaredefined radio （SDR） frontends. These architectures are made efficient by using a polyphase channelizer that performs arbitrary sample rate changes, frequency selection, and bandwidth control. We discuss area, time, and power optimization for field programmable gate array （FPGA） based architectures in an Mpath polyphase filter bank with modified Npath polyphase filter. Such systems allow resampling by arbitrary ratios while simultaneously performing baseband aliasing from center frequencies at Nyquist zones that are not multiples of the output sample rate. A nonmaximally decimated polyphase filter bank, where the number of data loads is not equal to the number of M subfilters, processes M subfilters in a time period that is either less than or greater than the Mdataload ＇ s time period. We present a loadprocess architecture （LPA） and a runtime architecture （RA） （based on serial polyphase structure） which have different scheduling. In LPA, Nsubfilters are loaded, and then M subfilters are processed at a clock rate that is a multiple of the input data rate. This is necessary to meet the output time constraint of the down-sampled data. In RA, Msubfilters processes are efficiently scheduled within Ndataload time while simultaneously loading N subfilters. This requires reduced clock rates compared with LPA, and potentially less power is consumed. A polyphase filter bank that uses different resampling factors for maximally decimated, underdecimated, overdecimated, and combined upand downsampled scenarios is used as a case study, and an analysis of area, time, and power for their FPGA architectures is given. For resourceoptimized SDR frontends, RA is superior for reducing operating clock rates and dynamic power consumption. RA is also superior for reducing area resources, except when indices are prestored in LUTs.

Polyphase Filter Banks for Embedded Sample Rate Changes in Digital Radio Front-Ends

This paper presents efficient processing engines for software-defined radio （SDR） front-ends. These engines, based on a polyphase channelizer, perform arbitrary sample-rate changes, frequency selection, and bandwidth control. This paper presents an M-path polyphase filter bank based on a modified N-path polyphase filter. Such a system allows resampling by arbitrary ratios while performing baseband aliasing from center frequencies at Nyquist zones that are not multiples of the output sample rate. This resampling technique is based on sliding cyclic data load interacting with cyclic-shifted coefficients. A non-maximally-decimated polyphase filterbank （where the number of data loads is not equal to the number of M subfilters） processes M subfilters in a time period that is less than or greater than the M data loads. A polyphase filter bank with five different resampling modes is used as a case study for embedded resamp/ing in SDR front-ends. These modes are （i） maximally decimated, （ii） Under-decimated, （iii） over-decimated, and combined up- and down-sampling with （iv） single stride length, and （v） multiple stride lengths. These modes can be used to obtain any required rational sampling rate change in an SDR front-end based on a polyphase channelizer. They can also be used for translation to and from arbitrary center frequencies that are unrelated to the output sample rates.

A novel DPSS filter optimization scheme to reduce the intrinsic interference of FBMC-QAM systems

In order to reduce the intrinsic interference of the filter bank multicarrier-quadrature amplitude modulation(FBMC-QAM)system,a novel filter optimization scheme based on discrete prolate spheroidal sequences(DPSS)is proposed.Firstly,a prototype filter function based on DPSS is designed,since the eigenvalue can be used as an indicator of the energy concentration of DPSS,so a threshold is set,and the sequence with the most concentrated energy is selected under the threshold,that is,the sequence with the eigenvalue higher than the threshold,and the prototype filter function is rewritten as a weighted sum function of multiple eigenvectors.Under the energy constraints of the filter,the relationship between the eigenvectors and the intrinsic interference function is established,and the function problem is transformed into an optimization problem for the weighted coefficients.Through the interior point method,the most suitable weight is found to obtain the minimum intrinsic interference result.Theoretical analysis and simulation results show that compared with the prototype filters such as Type1 and CaseC,the DPSS filter applying the proposed optimization algorithm can effectively suppress the intrinsic interference of the system and obtain a better bit error rate(BER)performance.

Joint use of time-domain and windowed method for design of modulated DFT filter banks

A novel and efficient technique to design modulated discrete Fourier transform （DFT） filter banks is introduced in this paper. The proposed method first relaxes the limits that the synthesis filters are the time-reversed version of the analysis filters and then adopts the time domain formula of the perfect reconstruction property as the solution to design the synthesis filters. The prototype filter in analysis filter banks is designed based on Fourier-Kaiser window approach. Simulation results show that the designed filter banks approximately satisfy the perfect reconstruction with controllable reconstruction errors.

Wavelet Packets Analysis Based on IIR Two-channel Bi-orthogonal Filter Banks

A framework of IIR two-channel bi-orthogonal filter banks is presented. The design of the analysis/synthesis systems reduces to the design of a single transfer function. The wavelet bases corresponding to the IIR maximally flat filters are generated. Use the wavelet bases in wavelet packets analysis, take information entropy function as information cost function, adjust the best bases dynamically, and the section of signal's spectramfits its characteristics well. A lot of audio signals are processed. Compared to that of the wavelet transform and the wavelet packet transform using the Daubechies' wavelet which has the same order with our IIR wavelet, the properties of our system are better

Time-domain modified DFT modulated filter banks for multi-carrier transceiver systems

A time domain designing method is proposed for discrete Fourier transform （DFT） modulated filter banks （DFT-FBs） for application in multi-carrier transceiver systems. Instead of using the time-reversed pair limitation between the transmitting /receiving filter pair, the receiving filters in the proposed filter banks are derived from transmitting filters in accordance with the Moore-Penrose generalized inverse matrix. It can be freely obtained to design the transmitting prototype filter, which mainly affects the level of spectral containment. Furthermore, the symbol error rate （SER） performance of the proposed filter bank based trans-multiplexer with one tap equalizer is investigated in ideal channel and multi-path channel environments respectively. Simulation shows that the proposed approach can achieve significant SER reductions when square root raised cosine （RRC） prototype filter is used for comparing with the orthogonal frequency division multiplexing （OFDM） and the general DFT-FBs based applications.

A Design of 2 L-Channel FIR Paraunitary Filter Banks with Complex Coefficients

An algorithm is proposed for the design of 2L-channel FIR paraunitary filter banks with complex coefficients to meet the requirement of processing complex signals. The filter designed with the algorithm has the property of near linear-phase. Thus, there is no more phase distortions introduced to the phase spectrum.

An Applied Method for Designing Maximally Decimating Non-uniform Filter Banks

Assembling individual line phase filters to form a multi-channel filter bank allows the synthesis filter to be similar to corresponding analysis filters, and the design calculation can be simple. The appropriate relations between synthesis filters and analysis filters eliminate most aliasing resulting from decimation in non-uniform maximally decimating filter banks, and LS algorithm and Remez algorithm are used to optimize the composite character. This design method can achieve approximate Perfect-Reconstruction. An example is given in which the general parameter filters with approximate line phase are used as units of a filter bank.

Filter Bank Networks for Few-Shot Class-Incremental Learning

Deep Convolution Neural Networks(DCNNs)can capture discriminative features from large datasets.However,how to incrementally learn new samples without forgetting old ones and recognize novel classes that arise in the dynamically changing world,e.g.,classifying newly discovered fish species,remains an open problem.We address an even more challenging and realistic setting of this problem where new class samples are insufficient,i.e.,Few-Shot Class-Incremental Learning(FSCIL).Current FSCIL methods augment the training data to alleviate the overfitting of novel classes.By contrast,we propose Filter Bank Networks(FBNs)that augment the learnable filters to capture fine-detailed features for adapting to future new classes.In the forward pass,FBNs augment each convolutional filter to a virtual filter bank containing the canonical one,i.e.,itself,and multiple transformed versions.During back-propagation,FBNs explicitly stimulate fine-detailed features to emerge and collectively align all gradients of each filter bank to learn the canonical one.FBNs capture pattern variants that do not yet exist in the pretraining session,thus making it easy to incorporate new classes in the incremental learning phase.Moreover,FBNs introduce model-level prior knowledge to efficiently utilize the limited few-shot data.Extensive experiments on MNIST,CIFAR100,CUB200,andMini-ImageNet datasets show that FBNs consistently outperformthe baseline by a significantmargin,reporting new state-of-the-art FSCIL results.In addition,we contribute a challenging FSCIL benchmark,Fishshot1K,which contains 8261 underwater images covering 1000 ocean fish species.The code is included in the supplementary materials.

Application of uniform DFT filter bank in radar jamming system

The principle of uniform DFT filter bank is presented. Exploiting poly-phase structure, radar jamming system samples the intercepted wideband radar signals through analysis filter bank by different channels and linearly modulates the intercepted radar signal according to the theory of signal and system, then synthesizes the jamming signal through the synthesis filter hank. The method merely requires lower sample frequency, reduces the computational complexity and the data quantity to be processed. The un-ideal filter＇s influence to the result of signals processing is analyzed by simulating the match filter in radar jamming system.

Faster-than-Nyquist signaling based on filter bank multicarrier modulation with joint optimization

Multi-carrier faster-than-Nyquist(MFTN)can improve the spectrum efficiency(SE).In this paper,we first analyze the benefit of time frequency packing MFTN(TFP-MFTN).Then,we propose an efficient digital implementation for TFP-MFTN based on filter bank multicarrier modulation.The time frequency packing ratio pair in our proposed implementation scheme is optimized with the SE criterion.Next,the joint optimization for the coded modulation MFTN based on extrinsic information transfer(EXIT)chart is performed.The Monte-Carlo simulations are carried out to verify performance gain of the joint inner and outer code optimization.Simulation results demonstrate that the TFPMFTN has a 0.8 dB and 0.9 dB gain comparing to time packing MFTN(TP-MFTN)and higher order Nyquist at same SE,respectively;the TFP-MFTN with optimized low density parity check(LDPC)code has a 2.9 dB gain comparing to that with digital video broadcasting(DVB)LDPC.Compared with previous work on TFP-MFTN(SE=1.55 bit/s/Hz),the SE of our work is improved by 29%and our work has a 4.1 dB gain at BER=1×10^(-5).

Vessel Extraction on Ocular Fundus Images by Using Gabor Filter Bank

Fundus diagnosis is an important part of the whole body examination that may provide rich clinical information to doctors for diagnostic reference. Manual fundus vessel extraction is helpful to quantitative measurement of diseases but obviously it is a tough work for physicians. This paper presents an automatic method by using Gabor filter bank to extract the artery and vein separately in the ocular fundus images. After preprocessing steps that include gray-scale transform, gray value inversion and contrast enhancement, the Gabor filter bank is applied to the extraction of the artery and vein in the ocular fundus images. Finally these two different width types of vessels are selected by post-processing methods such as labeling, corrosion, binarization, etc. Evaluation results show an accurate rate of 90% in vein and 82% in artery from 20 cases, that indicates the effectiveness of our proposed segmentation method.

Detection and isolation of false data injection attack via adaptive Kalman filter bank

Due to the integration of cyber–physical systems,smart grids have faced the new security risks caused by false data injection attacks(FDIAs).FDIAs can bypass the traditional bad data detection techniques by falsifying the process of state estimation.For this reason,this paper studies the detection and isolation problem of FDIAs based on the adaptive Kalman filter bank(AKFB)in smart grids.Taking the covert characteristics of FDIAs into account,a novel detection method is proposed based on the designed AKF.Moreover,the adaptive threshold is proposed to solve the detection delay caused by a priori threshold in the current detection methods.Considering the case of multiple attacked sensor nodes,the AKFB-based isolation method is developed.To reduce the number of isolation iterations,a logical decision matrix scheme is designed.Finally,the effectiveness of the proposed detection and isolation method is demonstrated on an IEEE 22-bus smart grids.

A Receiver Structure for Frequency-Flat Time-Varying Rayleigh Channels and Performance Analysis

This paper proposes a wavelet based receiver structure for frequency-flat time-varying Rayleigh channels, consisting of a receiver front-end followed by a Maximum A-Posteriori (MAP) detector. Discretization of the received continuous time signal using filter banks is an essential stage in the front-end part, where the Fast Haar Transform (FHT) is used to reduce complexity. Analysis of our receiver over slow-fading channels shows that it is optimal for certain modulation schemes. By comparison with literature, it is shown that over such channels our receiver can achieve optimal performance for Time-Orthogonal modulation. Computed and Monte-Carlo simulated performance results over fast time-varying Rayleigh fading channels show that with Minimum Shift Keying (MSK), our receiver using four basis functions (filters) lowers the error floor by more than one order of magnitude with respect to other techniques of comparable complexity. Orthogonal Frequency Shift Keying (FSK) can achieve the same performance as Time-Orthogonal modulation for the slow-fading case, but suffers some degradation over fast-fading channels where it exhibits an error floor. Compared to MSK, however, Orthogonal FSK provides better performance.

Face Recognition Based on Gabor Feature Extraction Followed by FastICA and LDA

Over the past few decades,face recognition has become the most effective biometric technique in recognizing people’s identity,as it is widely used in many areas of our daily lives.However,it is a challenging technique since facial images vary in rotations,expressions,and illuminations.To minimize the impact of these challenges,exploiting information from various feature extraction methods is recommended since one of the most critical tasks in face recognition system is the extraction of facial features.Therefore,this paper presents a new approach to face recognition based on the fusion of Gabor-based feature extraction,Fast Independent Component Analysis(FastICA),and Linear Discriminant Analysis(LDA).In the presented method,first,face images are transformed to grayscale and resized to have a uniform size.After that,facial features are extracted from the aligned face image using Gabor,FastICA,and LDA methods.Finally,the nearest distance classifier is utilized to recognize the identity of the individuals.Here,the performance of six distance classifiers,namely Euclidean,Cosine,Bray-Curtis,Mahalanobis,Correlation,and Manhattan,are investigated.Experimental results revealed that the presented method attains a higher rank-one recognition rate compared to the recent approaches in the literature on four benchmarked face datasets:ORL,GT,FEI,and Yale.Moreover,it showed that the proposed method not only helps in better extracting the features but also in improving the overall efficiency of the facial recognition system.

Mental Illness Disorder Diagnosis Using Emotion Variation Detection from Continuous English Speech

Automatic recognition of human emotions in a continuous dialog model remains challenging where a speaker’s utterance includes several sentences that may not always carry a single emotion.Limited work with standalone speech emotion recognition(SER)systems proposed for continuous speech only has been reported.In the recent decade,various effective SER systems have been proposed for discrete speech,i.e.,short speech phrases.It would be more helpful if these systems could also recognize emotions from continuous speech.However,if these systems are applied directly to test emotions from continuous speech,emotion recognition performance would not be similar to that achieved for discrete speech due to the mismatch between training data(from training speech)and testing data(from continuous speech).The problem may possibly be resolved if an existing SER system for discrete speech is enhanced.Thus,in this work the author’s existing effective SER system for multilingual and mixed-lingual discrete speech is enhanced by enriching the cepstral speech feature set with bi-spectral speech features and a unique functional set of Mel frequency cepstral coefficient features derived from a sine filter bank.Data augmentation is applied to combat skewness of the SER system toward certain emotions.Classification using random forest is performed.This enhanced SER system is used to predict emotions from continuous speech with a uniform segmentation method.Due to data scarcity,several audio samples of discrete speech from the SAVEE database that has recordings in a universal language,i.e.,English,are concatenated resulting in multi-emotional speech samples.Anger,fear,sad,and neutral emotions,which are vital during the initial investigation of mentally disordered individuals,are selected to build six categories of multi-emotional samples.Experimental results demonstrate the suitability of the proposed method for recognizing emotions from continuous speech as well as from discrete speech.

PARAMETERIZATION OF SYMMETRIC SCALING FUNCTIONS

In this paper,the factorization for filters with length Km of scaling functions into simple blocks is considered.

A correlation OPTS algorithm for reducing peak to average power ratio of FBMC-OQAM systems

A correlation overlapping partial transmit sequence(C-OPTS) algorithm is proposed to solve the issue of high complexity of overlapping partial transmit sequence(OPTS) algorithm in suppressing the peak to average power ratio(PAPR) of filter bank multicarrier-offset quadrature amplitude modulation(FBMC-OQAM) signals.The V subblocks in partial transmit sequence(PTS) are regrouped into U combinations according to the correlation coefficient p,and overlapping subblocks are allowed between adjacent groups.The search starts from the first group and sets the phase factors of the subsequent groups to 1.When the phase factors of the non-overlapping subblocks in the first group are determined,the subsequent groups are searched in turn to determine their respective phase factors.Starting from the second data block,the data overlapped with it should be taken into account when determining its optimal phase factor vector.Theoretical analysis and simulation results indicate that compared with the OPTS algorithm,the proposed algorithm can significantly reduce the computational complexity at the cost of slight deterioration of PAPR performance.Meanwhile,compared with the even-odd iterative double-layers OPTS(ID-OPTS) algorithm,it can further reduce the complexity and obtain a better PAPR suppression effect.

Construction of nonseparable orthonormal compactly supported wavelet bases for L^2(R^d)

Suppose M and N are two r×r and s×s dilation matrices,respectively.LetΓM andΓN represent the complete sets of representatives of distinct cosets of the quotient groups M-T Zr/Zr and N-T Zs/Zs,respectively.Two methods for constructing nonseparable Ω-filter banks from M-filter banks and N-filter banks are presented,where Ω is a（r＋s） ×（r＋s） dilation matrix such that one of its complete sets of representatives of distinct cosets of the quotient groups Ω-T Zr＋s/Zr＋s areΓΩ={[γT h,ζ T q] T：γh∈ΓM,ζq∈ΓN}.Specially,Ω can be [MΘ0N],whereΘis a r×s integer matrix with M-1Θbeing also an integer matrix.Moreover,if the constructed filter bank satisfies Lawton＇s condition,which can be easy to verify,then it generates an orthonormal nonseparable Ω-wavelet basis for L2（Rr＋s）.Properties,including Lawton＇s condition,vanishing moments and regularity of the new Ω-filter banks or new Ω-wavelet basis are discussed then.Finally,a class of nonseparable Ω-wavelet basis for L2（Rr＋1） are constructed and three other examples are given to illustrate the results.In particular,when M=N=2,all results obtained in this paper appeared in[1].