The design of digital all-pass filters using second-order cone programming (SOCP)

This brief proposes a new method for designing digital all-pass filters with a minimax design criterion using second-order cone programming (SOCP). Unlike other all-pass filter design methods, additional linear constraints can be readily incorporated. The overall design problem can be solved through a series of linear programming subproblems and the bisection search algorithm. The convergence of the algorithm is guaranteed. Nonlinear constraints such as the pole radius constraint of the filters can be formulated as additional SOCP constraints using Rouche's theorem. It was found that the pole radius constraint allows an additional tradeoff between the approximation error and the stability margin. The effectiveness of the proposed method is demonstrated by several design examples and comparison with conventional methods. © 2005 IEEE.published_or_final_versio

A new method for designing causal stable IIR variable fractional delay digital filters

This paper studies the design of causal stable Farrow-based infinite-impulse response (IIR) variable fractional delay digital filters (VFDDFs), whose subfilters have a common denominator. This structure has the advantages of reduced implementation complexity and avoiding undesirable transient response when tuning the spectral parameter in the Farrow structure. The design of such IIR VFDDFs is based on a new model reduction technique which is able to incorporate prescribed flatness and peak error constraints to the IIR VFDDF under the second order cone programming framework. Design example is given to demonstrate the effectiveness of the proposed approach. © 2007 IEEE.published_or_final_versio

IIR Digital Filter Design Using Convex Optimization

Digital filters play an important role in digital signal processing and communication. From the 1960s, a considerable number of design algorithms have been proposed for finite-duration impulse response (FIR) digital filters and infinite-duration impulse response (IIR) digital filters. Compared with FIR digital filters, IIR digital filters have better approximation capabilities under the same specifications. Nevertheless, due to the presence of the denominator in its rational transfer function, an IIR filter design problem cannot be easily formulated as an equivalent convex optimization problem. Furthermore, for stability, all the poles of an IIR digital filter must be constrained within a stability domain, which, however, is generally nonconvex. Therefore, in practical designs, optimal solutions cannot be definitely attained. In this dissertation, we focus on IIR filter design problems under the weighted least-squares (WLS) and minimax criteria. Convex optimization will be utilized as the major mathematical tool to formulate and analyze such IIR filter design problems. Since the original IIR filter design problem is essentially nonconvex, some approximation and convex relaxation techniques have to be deployed to achieve convex formulations of such design problems. We first consider the stability issue. A sufficient and necessary stability condition is derived from the argument principle. Although the original stability condition is in a nonconvex form, it can be appropriately approximated by a quadratic constraint and readily combined with sequential WLS design procedures. Based on the sufficient and necessary stability condition, this approximate stability constraint can achieve an improved description of the nonconvex stability domain. We also address the nonconvexity issue of minimax design of IIR digital filters. Convex relaxation techniques are applied to obtain relaxed design problems, which are formulated, respectively, as second-order cone programming (SOCP) and semidefinite programming (SDP) problems. By solving these relaxed design problems, we can estimate lower bounds of minimum approximation errors, which are useful in subsequent design procedures to achieve real minimax solutions. Since the relaxed design problems are independent of local information, compared with many prevalent design methods which employ local search, the proposed design methods using the convex relaxation techniques have an increased chance to obtain an optimal design

Design and multiplierless realization of digital synthesis filters for hybrid-filter-bank A/D converters

This paper studies the optimal least squares and minimax design and realization of digital synthesis filters for hybrid-filter-bank analog-to-digltal converters (HFB ADCs) to meet a given spurious-free dynamic range (SFDR). The problem for designing finite-impulse-response synthesis filters is formulated as a second-order cone-programming problem, which is convex and allows linear and quadratic constraints such as peak aliasing error to be incorporated. The fixed coefficients of the designed synthesis filters are efficiently implemented using sum-of-power-of-two (SOPOT) coefficients, while the internal word length used for each intermediate data is minimized using geometric programming. The main sources of error are analyzed, and a new formula of SFDR in terms of these errors is derived. The effects of component variations of analog analysis filters on the HFB ADC are also addressed by means of two new robust HFB ADC design algorithms based on stochastic uncertainty and worst case uncertainty models. Design results show that the proposed approach offers more flexibility and better performance than conventional methods in achieving a given SFDR and that the robust design algorithms are more robust to parameter uncertainties than the nominal design in which the uncertainties are not taken into account. © 2009 IEEE.published_or_final_versio

Design of FIR digital filters with prescribed flatness and peak error constraints using second-order cone programming

This paper studies the design of digital finite impulse response (FIR) filters with prescribed flatness and peak design error constraints using second-order cone programming (SOCP). SOCP is a powerful convex optimization method, where linear and convex quadratic inequality constraints can readily be incorporated. It is utilized in this study for the optimal minimax and least squares design of linear-phase and low-delay (LD) FIR filters with prescribed magnitude flatness and peak design error. The proposed approach offers more flexibility than traditional maximally-flat approach for the tradeoff between the approximation error and the degree of design freedom. Using these results, new LD specialized filters such as digital differentiators, Hilbert Transformers, Mth band filters and variable digital filters with prescribed magnitude flatness constraints can also be derived. © 2005 IEEE.published_or_final_versio

Design of complex-valued variable digital filters and its application to the realization of arbitrary sampling rate conversion for complex signals

The 47th Midwest Symposium on Circuits and Systems Conference, Salt Lake City, Utah, USA, 25-28 July 2004This paper studies the design of complex-valued variable digital filters (CVDFs) and their applications to the efficient arbitrary sample rate conversion for complex signals in software radio receivers. The design of CVDFs using either the minimax or least squares criteria is formulated as a convex optimization problem and solved using the second order cone programming (SOCP) or semidefmite programming (SDP). In addition, linear and convex quadratic inequality constraints can be readily incorporated. Design examples are given to demonstrate the effectiveness of the proposed approach.published_or_final_versio

A minimax approach for the joint design of acoustic crosstalk cancellation filters

Journal ArticleAbstract-This paper presents a method for jointly designing immersive audio rendering filters for a single listener using loudspeakers. The filters for crosstalk cancellation are assumed to have finite impulse responses and are designed using the minimax criterion. In addition to the traditional Atal-Schroeder crosstalk canceler structure, this paper explores an alternate topology that requires the approximation of a single filter. In general, the minimax approach provides improved low-frequency performance leading to a better overall separation of the direct-path and cross-path transfer functions than least-squares designs. The performance of the single-filter structure is better than that of the traditional crosstalk cancellation structure

Pattern synthesis of narrowband conformal arrays using iterative second-order cone programming

A new design method is proposed for the power or shaped beam pattern synthesis problem of narrowband conformal arrays, where only the magnitude response is specified. The proposed method iteratively linearizes the non-convex power pattern function to obtain a convex subproblem in the design variables, which can be solved optimally using second-order cone programming (SOCP). In addition, a wide variety of magnitude constraints such as non-convex lower bound magnitude constraints can be incorporated. An efficient technique for determining a reasonably good initial guess to the problem is also proposed to further improve the reliability of the method. Computer simulations show that the initial guesses so obtained converge to satisfactory solutions while satisfying various prescribed magnitude constraints. Design results show that the performance of the proposed method is comparable to the optimal solution previously obtained for uniform linear arrays with isotropic elements. Moreover, we show by means of examples that the proposed method is also applicable to general non-convex power pattern synthesis problems involving arbitrary array geometries, arbitrary polarization characteristics and mutual coupling effect. © 2010 IEEE.published_or_final_versio