共查询到20条相似文献,搜索用时 0 毫秒
1.
Theoretical analysis is used to evaluate the mean and second-moment properties of recursive least squares algorithms incorporating the fast exact initialization and soft constrained initialization methods during the initialization period. It is shown that the weight vector mean and covariance produced by fast exact initialization are undefined for this period. Theoretical results are derived for soft constrained initialization that show that the weight vector mean and covariance are finite, and expressions are given for these quantities. Simulations for various cases are presented to support the accuracy of these theoretical results 相似文献
2.
A numerically stable, fast, order-recursive algorithm for solving the covariance problem in signal modeling is described. The propagation of finite arithmetic errors as well as data acquisition errors is studied in detail. First, linearization of the main algorithmic recursions is carried out. Then, a suitable transformation converts the resulting state equations of the accumulated errors into their residual form. Subsequently, bounds for the residuals are computed. The derivation of these bounds depends heavily on the Levinson type structure of the algorithm and the low displacement rank of the problem. The main result is that the algorithm is weakly numerically stable. The proposed order-recursive algorithm is subsequently utilized as a block adaptive method. Its performance is also demonstrated by long run simulations 相似文献
3.
The optimum architecture design and mapping of QRD-RLS adaptive filters can be achieved through filter architecture selections, look-ahead transformations, and hierarchical pipelining/folding transformations. In this paper, a relaxed annihilation-reordering look-ahead (RARL) architecture is proposed, and shown to be more power and area efficient than pipelined processing architecture which was considered the most area efficient. The filters with this architecture are based on relaxed weight-update through filtering approximation, where a filter tap weight is updated upon arrival of every block of input data, and are speeded up with annihilation-reordering look-ahead transformation. As a result of the computational complexity reduction, this architecture does not change the iteration bound and filter clock frequency, and leads to speed up with linear increase in power consumption, while the pipelined processing architectures result in speedup with quadratic increase in power consumption. Upon hardware mapping, this architecture is also more advantageous to achieve low area designs. Two design examples are presented to illustrate mapping optimization using above transformations. These results are important for mapping designs onto ASICs, FPGAs or parallel computing machines. The results show significant improvements in throughput, power consumption and hardware requirement. It is also interesting to show through mathematics and simulations that the RARL QRD-RLS filters have no performance degradation in terms of convergence rate. 相似文献
4.
5.
对JPEG2 0 0 0中推荐的 5 /3整数滤波器和 9/7实数滤波器进行了硬件实现时所需要的有限精度分析 ;确定了小波变换过程中各个参数的最佳数据宽度 ,还确定了整个变换系统的数据通路的数据宽度。基于lifting的小波变换的特点结合嵌入式延拓算法提出了两种小波变换———折叠结构和长流水线结构 ;对两种结构进行了分析比较。最后 ,对折叠结构和相关的其它结构在所需存储单元的数量、存储单元的访问次数、处理能力以及功耗等方面进行了分析比较 ,可以看出文中提出的结构在性能上有明显优点。 相似文献
6.
A class of new adaptive step-size control algorithms, which is applicable to most of the LMS-derived tap weight adaptation algorithms, is proposed. Analysis yields a set of difference equations for theoretically calculating the transient behavior of the filter convergence and derives an explicit formula for the steady-state excess mean-square error (EMSE). Experiments for some examples prove that the proposed algorithm is highly effective in improving the convergence rate in both transient and tracking phases. The theoretically calculated convergence is shown to be in good agreement with that obtained through simulations. Alternative formulae of the step-size adaptation for specific tap weight adaptation algorithms are also proposed 相似文献
7.
Breining C. Dreiscitel P. Hansler E. Mader A. Nitsch B. Puder H. Schertler T. Schmidt G. Tilp J. 《Signal Processing Magazine, IEEE》1999,16(4):42-69
We have discussed the application of high-order adaptive filters to the problem of acoustical echo cancellation with particular application to hands free telephone systems. We described a means to achieve robust performance. We further presented methods for reducing computational complexity that allow implementation in low-cost, fixed-point digital signal processors. Progress in technology will allow the use of more sophisticated algorithms at lower cost in the near future 相似文献
8.
This paper discusses the process of assessing the uncertainty of measurement results through error analysis. We restrict the discussion to sources of errors, measurement errors, modeling errors, and calibration errors in the context of physical experiments. 相似文献
9.
10.
Elnashar A. Elnoubi S. El-Mikati H.A. 《IEEE transactions on circuits and systems. I, Regular papers》2008,55(1):398-411
11.
Adaptive linearly constrained inverse QRD-RLS beamforming algorithm for moving jammers suppression 总被引:1,自引:0,他引:1
Shiunn-Jang Chern Chung-Yao Chang 《Antennas and Propagation, IEEE Transactions on》2002,50(8):1138-1150
A general, linearly constrained (LC) recursive least squares (RLS) array-beamforming algorithm, based on an inverse QR decomposition, is developed for suppressing moving jammers efficiently. In fact, by using the inverse QR decomposition-recursive least squares (QRD-RLS) algorithm approach, the least-squares (LS) weight vector can be computed without back substitution and is suitable for implementation using a systolic array to achieve fast convergence and good numerical properties. The merits of this new constrained algorithm are verified by evaluating the performance, in terms of the learning curve, to investigate the convergence property and numerical efficiency, and the output signal-to-interference-and-noise ratio. We show that our proposed algorithm outperforms the conventional linearly constrained LMS (LCLMS) algorithm, and the one using the fast linear constrained RLS algorithm and its modified version. 相似文献
12.
Theoretical analysis of the stability and error in the LED-logarithmic electrometer is presented. It has been shown that a resistance in series with the log element improves the response by a factor of 7 at 1pA. Error analysis of the electrometer, involving mainly device parameter sensitivity, is also presented. It has been found that variation in temperature and change in value of the device constant are more important factors than other device parameters in influencing the variation in the output voltage. An eight-decade temperature compensated LED-logarithmic electrometer is designed for the measurement of low currents from 1pA to 0.1mA and has been tested for its performance in the temperature range of –20 to 70°C. 相似文献
13.
Chih-Ming Fu Wen-Liang Hwang Chung-Lin Huang 《IEEE transactions on image processing》2007,16(4):1022-1035
We propose a new framework for multiple scalable bitstream video communications over lossy channels. The major feature of the framework is that the encoder estimates the effects of postprocessing concealment and includes those effects in the rate-distortion analysis. Based on the framework, we develop a rate-distortion optimization algorithm to generate multiple scalable bitstreams. The algorithm maximizes the expected peak signal-to-noise ratio by optimally assigning forward error control codes and transmission schemes in a constrained bandwidth. The framework is a general approach motivated by previous methods that perform concealment in the decoder, as in our special case. Simulations show that the proposed approach can be implemented efficiently and that it outperforms previous methods by more than 2 dB. 相似文献
14.
15.
16.
Signature analysis has been used widely for fault detection as a part of Built-In Self Test (BIST). In this paper we show how signature analysis can be used not only for fault detection but also for identification of multiple errors produced by faults in the circuits under test. We construct Signature Analysis Registers (SARs) to detect and identify any specified number of errors in the input polynomials by choosing proper characteristic polynomials. To detect and identifyr errors in an input bit stream ofm bits, we use a polynomialg r (x)=1cm (f 1 (x), f 3 (x), ..., f 2r?1 (x)) as the characteristic polynomial for the SAR for any polynomialf 1 (x), where lcm represents the least common multiple of polynomials al $$fi(x) = Res_t (f_1 (t),x - t^i ), i = 3,...,2r - 1,$$ Res t denotes thet-Resultant, andm is less than the order off 1 (x). Given a faulty signature produced by an SAR constructed as described, we present an algorithm for the identification of the actual error bits in the input polynomial to the SAR. We also extend the use of BCH codes for error detection and correction to include nonprimitive polynomials. 相似文献
17.
Four FD-TD extensions for the modeling of pulse propagation in Debye or Lorentz dispersive media are analyzed through studying the stability and phase error properties of the coupled difference equations corresponding to Maxwell's equations and to the equations for the dispersion. For good overall accuracy the author shows that all schemes should be run at their Courant stability limit, and that the timestep should finely resolve the medium timescales. Particularly, for Debye schemes it should be at least Δt=10-3τ, while for Lorentz schemes it should be Δt=10-2τ, where τ is a typical medium relaxation time. A numerical experiment with a Debye medium confirms this. The author has determined that two of the discretizations for Debye media are totally equivalent. In the Lorentz medium case the author establishes that the method that uses the polarization differential equation to model dispersion is stable for all wavenumbers, and that the method using the local-in-time constitutive relation is weakly unstable for modes with wavenumber k such that kΔx>π/2 相似文献
18.
Traditional error diffusion halftoning is a high quality method for producing binary images from digital grayscale images. Error diffusion shapes the quantization noise power into the high frequency regions where the human eye is the least sensitive. Error diffusion may be extended to color images by using error filters with matrix-valued coefficients to take into account the correlation among color planes. For vector color error diffusion, we propose three contributions. First, we analyze vector color error diffusion based on a new matrix gain model for the quantizer, which linearizes vector error diffusion. The model predicts the key characteristics of color error diffusion, esp. image sharpening and noise shaping. The proposed model includes linear gain models for the quantizer by Ardalan and Paulos (1987) and by Kite et al. (1997) as special cases. Second, based on our model, we optimize the noise shaping behavior of color error diffusion by designing error filters that are optimum with respect to any given linear spatially-invariant model of the human visual system. Our approach allows the error filter to have matrix-valued coefficients and diffuse quantization error across color channels in an opponent color representation. Thus, the noise is shaped into frequency regions of reduced human color sensitivity. To obtain the optimal filter, we derive a matrix version of the Yule-Walker equations which we solve by using a gradient descent algorithm. Finally, we show that the vector error filter has a parallel implementation as a polyphase filterbank. 相似文献
19.
精密两维转镜作为激光角度欺骗干扰半实物仿真试验系统中模拟弹目、弹干扰视线运动的重要设备,其控制误差是影响视线运动模拟精度的重要因素,进而影响半实物仿真试验精度。以多体系统动力学方法推导了精密两维转镜的机电分析动力学模型,采用计算力矩法设计了两维转镜的轨迹跟踪控制器,并在Matlab/Simulink环境中对建立的反映转镜动态特性的数学模型进行了仿真,转镜方位、俯仰轴对等效正弦输入信号的角位置跟踪误差分别为2.2 mrad与3.5 mrad,结果表明:模型可实现对引导输入的角位置信号的高精度跟踪控制。 相似文献
20.
A masquerade attack, in which one user impersonates another, may be one of the most serious forms of computer abuse. Automatic discovery of masqueraders is sometimes undertaken by detecting significant departures from normal user behavior, as represented by a user profile formed from system audit data. A major obstacle for this type of research is the difficulty in obtaining such system audit data, largely due to privacy concerns. An immense contribution in this regard has been made by Schonlau et al., who have made available UNIX command-line data from 50+ users collected over a number of months. Most of the research in this area has made use of this dataset, so this paper takes as its point of departure the Schonlau et al. dataset and a recent series of experiments with this data framed by the same researchers . In extending that work with a new classification algorithm, a 56% improvement in masquerade detection was achieved at a corresponding false-alarm rate of 1.3%. In addition, encouraging results were obtained at a more realistic sequence length of 10 commands (as opposed to sequences of 100 commands used by Schonlau et al.). A detailed error analysis, based on an alternative configuration of the same data, reveals a serious flaw in this type of data which hinders masquerade detection and indicates some steps that need to be taken to improve future results. The error analysis also demonstrates the insights that can be gained by inspecting decision errors, instead of concentrating only on decision successes. 相似文献