Lifting scheme of symmetric tight wavelets frames

This paper proposes a method to realize the lifting scheme of tight frame wavelet filters. As for 4-channel tight frame wavelet filter, the tight frame transforms＇ matrix is 2×4, but the lifting scheme transforms＇ matrix must be 4×4. And in the case of 3-channel tight frame wavelet filter, the transforms＇ matrix is 2×3, but the lifting scheme transforms＇ matrix must be 3×3. In order to solve this problem, we introduce two concepts： transferred polyphase matrix for 4-channel filters and transferred unitary matrix for 3-channel filters. The transferred polyphase matrix is symmetric/antisymmetric. Thus, we use this advantage to realize the lifting scheme.     

Minimum-energy wavelet frame on the interval

The construction and properties of interval minimum-energy wavelet frame are systematically studied in this paper. They are as follows： 1） give the definition of interval minimum-energy wavelet frame; 2） give the necessary and sufficient conditions for the minimum-energy frames for L^2[0,1]; 3） present the construction algorithm for minimum-energy wavelet frame associated with refinable functions on the interval with any support y; 4） give the decomposition and reconstruction formulas of the minimum-energy frame on the interval [0,1],     

Construction of compactly supported orthonormal wavelets with beautiful structure

In this paper, a new method of constructing symmetric (antisymmetric) scal-ing and wavelet filters is introduced, and we get a new type of wavelet system that hasvery beautiful structure. Using this kind of wavelet system, we can achieve filters withthe properties: rational, symmetric or antisymmetric, the lengths of the filters are shorterand the corresponding functions have higher smoothness, so they have good prospect inapplications.     

On Robust H2 Estimation

The problem of state estimation for uncertain systems has attracted a recurring interest in the past decade. In this paper, we shall give an overview on some of the recent development in the area by focusing on the robust H2 (Kalman) filtering of uncertain discrete-time systems. The robust H2 estimation is concerned with the design of a fixed estimator for a family of plants under consideration such that the estimation error covariance is of a minimal upper bound. The uncertainty under consideration includes norm-bounded uncertainty and polytopic uncertainty. In the finite horizon case, we shall discuss a parameterized difference Riccati equation approach for systems with norm-bounded uncertainty and pinpoint the difference of state estimation between systems without uncertainty and those with uncertainty. In the infinite horizon case, we shall deal with both the norm-bounded and polytopic uncertainties using a linear matrix inequality (LMI) approach. In particular, we shall demonstrate how the conservatism of design can be improved using a slack variable technique. We also propose an iterative algorithm to refine a designed estimator. An example will be given to compare estimators designed using various techniques.     

Explicit-form complex orthogonal design for space-time block codes

In this paper,we present a construction of complex orthogonal design for space-time block codes in any number of antennas.Our construction achieves both the maximal rate and minimal delay.So far as we know,our construction is the first explicit-form construction,which has asymptotically optimal time complexity and space complexity.And new representation of complex orthogonal design might bring advantages in analyzing some properties.In addition,when the number of antennas n ≡ 1,2,3(mod 4),our construction satisfies transceiver signal linearization property,which allows for design of low complexity channel equalizers and interference suppressing filters.     

Theory and verification of operator design methodology

Non-recurring-engineering(NRE)and time-to-market play an increasingly important role in the field of IC design.Meanwhile,with the continuous development of IC manufacturing technology,it is necessary to propose a novel design methodology to shorten design cycle and enhance design efficiency.In this paper,operator design methodology(ODM)is presented and an H.264 encoder is implemented as a verification.According to the flow of ODM,the register transfer level(RTL)design of H.264 encoder has been accomplished with 15 man-months,which is lower than the average 19 man-months in the field of traditional application specific integrated circuit(ASIC)design.Moreover,with the advantage of operator design library,the design has a comparable performance with other ASIC implementations.The obtained design can support a real-time video encoding of 720p at 60 frames per second or 1080p at 30 frames per second,working at 167 MHz with SMIC 0.13 μm CMOS technology.These results provide good evidence for the practicability and efficiency of ODM.     

Per-layer transmit and receive filters design for Tomlinson-Harashima precoding in multiuser MIMO systems

In this paper,the per-layer design for Tomlinson-Harashima precoding (THP) in the downlink of multiuser multiple-input multiple-output (MIMO) systems is investigated.In these systems,the number of the receivers is equal to that of the transmit antennas.Based on the criterion of maximum system sum-capacity,we study two per-layer joint transmit and receive filters design schemes with receive antenna beamforming (RAB) and receive antenna selection (RAS),respectively.Moreover,the differences of the equivalent channel gains and capacities between these two schemes are analyzed theoretically.Simulation results show that by these per-layer schemes,the system sum-rate is improved significantly with respect to the per-user processing scheme.     

Construction of a new adaptive wavelet network and its learning algorithm

A new adaptive learning algorithm for constructing and training wavelet networks is proposed based on the time-frequency localization properties of wavelet frames and the adaptive projection algorithm. The exponential convergence of the adaptive projection algorithm in finite-dimensional Hilbert spaces is constructively proved, with exponential decay ratios given with high accuracy. The learning algorithm can sufficiently utilize the time-frequency information contained in the training data, iteratively determines the number of the hidden layer nodes and the weights of wavelet networks, and solves the problem of structure optimization of wavelet networks. The algorithm is simple and efficient, as illustrated by examples of signal representation and denoising.     

An Orthogonal Least Squares based approach to FIR designs

This paper is concerned with the application of forward Orthogonal Least Squares (OLS) algorithm to the design of Finite Impulse Response (FIR) filters. The focus of this study is a new FIR filter design procedure and to compare this with traditional methods known as the fir2() routine provided by MATLAB.     

A trinomial type of σ-LFSR oriented toward software implementation

In this paper, we introduce a new type of feedback shift register based on words, called σ-linear feedback shift register (σ-LFSR) which can make full use of the instructions of modern CPUs so that we can find good σ-LFSR with simple structure and fast software implementation. After analysis, we find a class of simple σ-LFSR with maximal period and give an algorithm of searching for those σ-LFSRs. As a result, we provide a new optional fast component in the design of modern word-based stream ciphers.     

Construction and properties of spline dyadic wavelet filters

This paper focuses on the construction and properties of spline dyadic wavelet that equals its reconstruction wavelet. A general construction method of finite spline dyadic low-pass and high-pass filters is given. It proves that finite spline dyadic low-pass filters are symmetric about 0 or 1/2, but there are no finite spline high-pass filters possessing symmetry with respect to 0 or 1/2. It further shows that there exist infinite spline high-pass filters possessing symmetry with respect to 0 or 1/2, which can be constructed. Their energy is concentrated and so finite symmetric spline dyadic wavelet filter that equals its reconstruction filter can be obtained approximately. Construction examples for quadratic and cubic spline dyadic wavelet filters are given.     

有中断时间代价的一致并行机抢先调度问题

提出了一种具有中断时间代价的抢先调度问题(P|ptmn(δ)|C_max):在抢先调度中,一个任务发生一次中断,其总的执行时间会增加一个δ.该问题在工程任务分配、分布式计算和网络通信等实际问题中有着广泛的应用背景.证明了这是一个NP-hard问题,给出了一个时间复杂度为O(nlogn+m)的脱线近似算法LPT-Wrap,其近似比小于等于1.40825,并分析了P|ptmn(δ)|C_max的在线特性,给出一个线性时间复杂度的在线近似算法,其竞争比为2.     

Energy optimized orthonormal wavelet filter bank with prescribed sharpness

Optimization with respect to some energy measure such as compaction energy is a widely used criterion for designing wavelet filter banks. The filter bank can be adapted to the signal that it is analyzing to achieve good performance. The frequency selectivity property of a traditional low-pass filter is however not ensured using this criterion. Frequency selectivity is important to ensure the effects on aliasing is minimized in the subband and to give a regular equivalent wavelet function. In this work the design of energy optimized filters with a prescribed sharpness in the frequency response is presented. The sharpness, which determines the degree of selectivity, is achieved by the zero-pinning technique on the Bernstein polynomial. The design technique can be cast as a Semidefinite Programming (SDP) problem which can be solved with efficient interior point algorithms.     

Efficient hardware architecture of 2D-scan-based wavelet watermarking for image and video

This paper describes an efficient hardware architecture of 2D-Scan-based-Wavelet watermarking for image and video. The potential application for this architecture includes broadcast monitoring of video sequences for High Definition Television (HDTV) and DVD protection and access control. The proposed 2D design allows even distribution of the processing load onto a set of filters, with each set performing the calculation for one dimension according to the scan-based process. The video protection is achieved by the insertion of watermarks bank within the middle frequency of wavelet coefficients related to video frames by their selective quantization. The 2-D DWT is applied for both video stream and watermark in order to make the watermarking scheme robust and perceptually invisible. The proposed architecture has a very simple control part, since the data are operated in a row-column-slice fashion. This organization reduces the requirement of on-chip memory. In addition, the control unit selects which coefficient to pass to the low-pass and high-pass filters. The on-chip memory will be small as compared to the input size since it depends solely on the filter sizes. Due to the pipelining, all filters are utilized for 100% of the time except during the start-up and wind-down times. The major contribution of this research is towards the selection of appropriate real time watermarking scheme and performing a trade-off between the algorithmic aspects of our proposed watermarking scheme and the hardware implementation technique. The hardware architecture is designed, as a watermarking based IP core with the Avalon interface related to NIOS embedded processor, and tested in order to evaluate the performance of our proposed watermarking algorithm. This architecture has been implemented on the Altera Stratix-II Field Programmable Gate Array (FPGA) prototyping board. Experimental results are presented to demonstrate the capability of the proposed watermarking system for real time applications and its robustness against malicious attacks.     

Filtering for texture classification: a comparative study

In this paper, we review most major filtering approaches to texture feature extraction and perform a comparative study. Filtering approaches included are Laws masks (1980), ring/wedge filters, dyadic Gabor filter banks, wavelet transforms, wavelet packets and wavelet frames, quadrature mirror filters, discrete cosine transform, eigenfilters, optimized Gabor filters, linear predictors, and optimized finite impulse response filters. The features are computed as the local energy of the filter responses. The effect of the filtering is highlighted, keeping the local energy function and the classification algorithm identical for most approaches. For reference, comparisons with two classical nonfiltering approaches, co-occurrence (statistical) and autoregressive (model based) features, are given. We present a ranking of the tested approaches based on extensive experiments     

Wavelet domain-based video noise reduction using temporal discrete cosine transform and hierarchically adapted thresholding

A novel spatio-temporal filter for video denoising, which operates entirely in the wavelet domain, is proposed. For effective noise reduction, the spatial and temporal redundancies that exist in the wavelet domain representation of a video signal are exploited. First, a 2D discrete wavelet transform is applied to the input noisy frames. This is followed by a discrete cosine transform (DCT), which is applied to the temporal subband coefficients to minimise the redundancy among the consecutive frames. The DCT transformed, noise-free coefficients in the different wavelet domain subbands for the original image sequence are modelled using a prior having a generalised Gaussian distribution. On the basis of this prior, filtering of the noisy wavelet coefficients in each subband is carried out using a new, low-complexity wavelet shrinkage method, which utilises the correlation that exists between subsequent resolution levels. Experimental results show that the proposed scheme outperforms several state-of-the-art spatio-temporal filters in terms of both the peak signal-to-noise ratio and the visual quality     

Time–frequency localized three-band biorthogonal wavelet filter bank using semidefinite relaxation and nonlinear least squares with epileptic seizure EEG signal classification

In this paper, we design time–frequency localized three-band biorthogonal linear phase wavelet filter bank for epileptic seizure electroencephalograph (EEG) signal classification. Time–frequency localized analysis and synthesis low-pass filters (LPF) are designed using convex semidefinite programming (SDP) by transforming a nonconvex problem into a convex SDP using semidefinite relaxation technique. Three-band parameterized lattice biorthogonal linear phase perfect reconstruction filter bank (BOLPPRFB) is chosen and nonlinear least squares algorithm is used to determine its parameters values that generate the designed analysis and synthesis LPF such that the band-pass and high-pass filters are also well localized in time and frequency domain. The designed analysis and synthesis three-band wavelet filter banks are compared with the standard two-band filter banks like Daubechies maximally regular filter banks, Cohen–Daubechies–Feauveau (CDF) biorthogonal filter banks and orthogonal time–frequency localized filter banks. Kruskal–Wallis statistical test is employed to measure the statistical significance of the subband features obtained from the various two and three-band filter banks for epileptic seizure EEG signal classification. The results show that the designed three-band analysis and synthesis filter banks both outperform two-band filter banks in the classification of seizure and seizure-free EEG signals. The designed three-band filter banks and multi-layer perceptron neural network (MLPNN) are further used together to implement a signal classifier that provides classification accuracy better than the recently reported results for epileptic seizure EEG signal classification.     

Texture classification using rotated wavelet filters

We propose an approach to the texture classification problem using a set of two-dimensional (2-D) wavelet filters that are nonseparable and oriented for improved characterization of diagonally oriented textures. Channel energies are estimated at the output of both the new filter bank and a standard discrete wavelet frames (DWF) filter bank. Classification results obtained using each individual method and in combination are presented. The results show that the oriented filter set results in finer discrimination providing complementary texture information to the DWF by making use of its orientation selectivity. As a result, a combination of the features from the output of two filter banks improved the classification accuracy significantly with a smaller number of features     

Reply to `Comments on the robust stability analysis of adaptivecontrollers using normalizations'

The author addresses a statement in the above-titled paper by P.P. Khargonekar and R. Ortega (see ibid., vol.34, no.4, p.478, April (1989)) that the proofs in four earlier papers, including two of which he is a coauthor, failed to establish that the proposed adaptive controllers provide a nonvanishing robustness margin for the considered class of unmodeled dynamics. He shows that the results in those papers are correct and that the above statement and its implications are misleading. He also rebuts an incorrect statement that μ* is inversely proportional to the initial condition |η(0)| of the unmodeled dynamics, leading the reader to the conclusion that the results of the four papers cannot be global with respect to |η(0)|