Search

Linear phase is an important characteristic of digital filters in many signal processing applications. In this paper, two iterative reweighted minimax phase error algorithms are proposed to design nearly linear-phase infinite impulse response (IIR) digital filters with prescribed or simultaneously minimized magnitude errors and preset transition-band gain. In each iteration of the algorithms, a weighted minimax phase error problem with a fixed weight function is firstly solved using a modified Gauss-Newton method with a variable step length, and the weight function of the phase error is then updated using the square root of a modified envelope of the group-delay error of the filter. With the proposed methods, both very small phase error and group-delay error have been obtained while meeting the requirements on the passband and stopband magnitude errors and the transition-band gain. Design examples demonstrate the effectiveness of the proposed methods and the excellent performance of the designed filters. [ABSTRACT FROM PUBLISHER]

In Part I of the study of the tensor deflation for CANDECOMP/PARAFAC, we have shown that the rank-1 tensor deflation is applicable under some conditions. Part II of the study presents several initialization algorithms suitable for the algorithm proposed in Part I. In addition, Part II contains an algorithm for the case when one or more factor matrices in the estimated model is constrained to be orthogonal. Finally, Part II provides an error analysis of the tensor deflation algorithm, which shows that there is a marginal loss of accuracy of the deflation algorithm compared to the ordinary CP decomposition. [ABSTRACT FROM PUBLISHER]

We present a method for real-time computation of clothoid coordinates that guarantees bounded approximation error over a wide range of clothoid parameters provided that the clothoid’s orientation change and length are bounded. It is shown that coordinates of clothoid with any parameters can be computed from those of a single clothoid (with fixed parameters), using appropriate geometrical transformations. A comprehensive analysis is given on how to determine a required set of clothoids and, based on this, how to sample a clothoid in a lookup table in order to achieve required approximation precision. The algorithm is computationally very efficient and therefore suitable for real-time path planning, as well as for other applications that benefit from fast clothoid computation. [ABSTRACT FROM PUBLISHER]

Mixed-scaling-rotation (MSR) coordinate rotation digital computer (CORDIC) is an attractive approach to synthesizing complex rotators. This paper presents the fixed-point error analysis and parameter selections of MSR-CORDIC with applications to the fast Fourier transform (FFT). First, the fixed-point mean squared error of the MSR-CORDIC is analyzed by considering both the angle approximation error and signal round-off error incurred in the finite precision arithmetic. The signal to quantization noise ratio (SQNR) of the output of the FFT synthesized using MSR-CORDIC is thereafter estimated. Based on these analyses, two different parameter selection algorithms of MSR-CORDIC are proposed for general and dedicated MSR-CORDIC structures. The proposed algorithms minimize the number of adders and word-length when the SQNR of the FFT output is constrained. Design examples show that the FFT designed by the proposed method exhibits a lower hardware complexity than existing methods. [ABSTRACT FROM PUBLISHER]

In practical finite-impulse-response (FIR) digital filter applications, it is often necessary to represent the filter coefficients with a finite number of bits. The finite wordlength restriction increases the filter deviation. This increase can be reduced substantially if the optimal finite wordlength coefficients are used. The time needed to compute these coefficients is greatly reduced with the help of a lower bound on the deviation increase. Derivation of an improved lower bound that uses the well-known LLL algorithm is presented in this correspondence. [ABSTRACT FROM PUBLISHER]