94 research outputs found

    Computer-Aided Design of Switched-Capacitor Filters

    Get PDF
    This thesis describes a series of computer methods for the design of switched-capacitor filters. Current software is greatly restricted in the types of transfer function that can be designed and in the range of filter structures by which they can be implemented. To solve the former problem, several new filter approximation algorithms are derived from Newton's method, yielding the Remez algortithm as a special case (confirming its convergency properties). Amplitude responses with arbitrary passband shaping and stopband notch positions are computed. Points of a specified degree of tangency to attenuation boundaries (touch points) can be placed in the response, whereby a family of transfer functions between Butterworth and elliptic can be derived, offering a continuous trade-off in group delay and passive sensitivity properties. The approximation algorithms have also been applied to arbitrary group delay correction by all-pass functions. Touch points form a direct link to an iterative passive ladder design method, which bypasses the need for Hurwitz factorisation. The combination of iterative and classical synthesis methods is suggested as the best compromise between accuracy and speed. It is shown that passive ladder prototypes of a minimum-node form can be efficiently simulated by SC networks without additional op-amps. A special technique is introduced for canonic realisation of SC ladder networks from transfer functions with finite transmission at high frequency, solving instability and synthesis difficulties. SC ladder structures are further simplified by synthesising the zeros at +/-2fs which are introduced into the transfer function by bilinear transformation. They cause cancellation of feedthrough branches and yield simplified LDI-type SC filter structures, although based solely on the bilinear transform. Matrix methods are used to design the SC filter simulations. They are shown to be a very convenient and flexible vehicle for computer processing of the linear equations involved in analogue filter design. A wide variety of filter structures can be expressed in a unified form. Scaling and analysis can readily be performed on the system matrices with great efficiency. Finally, the techniques are assembled in a filter compiler for SC filters called PANDDA. The application of the above techniques to practical design problems is then examined. Exact correction of sinc(x), LDI termination error, pre-filter and local loop telephone line weightings are illustrated. An optimisation algorithm is described, which uses the arbitrary passband weighting to predistort the transfer function for response distortions. Compensation of finite amplifier gain-bandwidth and switch resistance effects in SC filters is demonstrated. Two commercial filter specifications which pose major difficulties for traditional design methods are chosen as examples to illustrate PANDDA's full capabilities. Significant reductions in order and total area are achieved. Finally, test results of several SC filters designed using PANDDA for a dual-channel speech-processing ASIC are presented. The speed with which high-quality, standard SC filters can be produced is thus proven

    Design and multiplier-less implementation of a class of two-channel PR FIR filterbanks and wavelets with low system delay

    Get PDF
    In this paper, a new method for designing two-channel PR FIR filterbanks with low system delay is proposed. It is based on the generalization of the structure previously proposed by Phoong et al. Such structurally PR filterbanks are parameterized by two functions (β(z) and α(z)) that can be chosen as linear-phase FIR or allpass functions to construct FIR/IIR filterbanks with good frequency characteristics. The case of using identical β(z) and α(z) was considered by Phoong et al. with the delay parameter M chosen as 2N - 1. In this paper, the more general case of using different nonlinear-phase FIR functions for β(z) and α(z) is studied. As the linear-phase constraint is relaxed, the lengths of β(z) and α(z) are no longer restricted by the delay parameters of the filterbanks. Hence, higher stopband attenuation can still be achieved at low system delay. The design of the proposed low-delay filterbanks is formulated as a complex polynomial approximation problem, which can be solved by the Remez exchange algorithm or analytic formula with very low complexity. In addition, the orders and delay parameters can be estimated from the given filter specifications using a simple empirical formula. Therefore, low-delay two-channel PR filterbanks with flexible stopband attenuation and cutoff frequencies can be designed using existing filter design algorithms. The generalization of the present approach to the design of a class of wavelet bases associated with these low-delay filterbanks and its multiplier-less implementation using the sum of powers-of-two coefficients are also studied.published_or_final_versio

    Rational hybrid Monte Carlo algorithm

    Get PDF

    Conditionals in Homomorphic Encryption and Machine Learning Applications

    Get PDF
    Homomorphic encryption aims at allowing computations on encrypted data without decryption other than that of the final result. This could provide an elegant solution to the issue of privacy preservation in data-based applications, such as those using machine learning, but several open issues hamper this plan. In this work we assess the possibility for homomorphic encryption to fully implement its program without relying on other techniques, such as multiparty computation (SMPC), which may be impossible in many use cases (for instance due to the high level of communication required). We proceed in two steps: i) on the basis of the structured program theorem (Bohm-Jacopini theorem) we identify the relevant minimal set of operations homomorphic encryption must be able to perform to implement any algorithm; and ii) we analyse the possibility to solve -- and propose an implementation for -- the most fundamentally relevant issue as it emerges from our analysis, that is, the implementation of conditionals (requiring comparison and selection/jump operations). We show how this issue clashes with the fundamental requirements of homomorphic encryption and could represent a drawback for its use as a complete solution for privacy preservation in data-based applications, in particular machine learning ones. Our approach for comparisons is novel and entirely embedded in homomorphic encryption, while previous studies relied on other techniques, such as SMPC, demanding high level of communication among parties, and decryption of intermediate results from data-owners. Our protocol is also provably safe (sharing the same safety as the homomorphic encryption schemes), differently from other techniques such as Order-Preserving/Revealing-Encryption (OPE/ORE).Comment: 14 pages, 1 figure, corrected typos, added introductory pedagogical section on polynomial approximatio

    Numerical study of lattice index theorem usingimproved cooling and overlap fermions

    Get PDF
    We investigate topological charge and the index theorem on finite lattices numerically. Using mean field improved gauge field configurations we calculate the topological charge Q using the gluon field definition with O(a4){\cal O}(a^4)-improved cooling and an O(a4){\cal O}(a^4)-improved field strength tensor FμνF_{\mu\nu}. We also calculate the index of the massless overlap fermion operator by directly measuring the differences of the numbers of zero modes with left- and right--handed chiralities. For sufficiently smooth field configurations we find that the gluon field definition of the topological charge is integer to better than 1% and furthermore that this agrees with the index of the overlap Dirac operator, i.e., the Atiyah-Singer index theorem is satisfied. This establishes a benchmark for reliability when calculating lattice quantities which are very sensitive to topology.Comment: 15 pages, 1 figure

    DSP compensation for distortion in RF filters

    Get PDF
    There is a growing demand for the high quality TV programs such as High Definition TV (HDTV). The CATV network is often a suitable solution to address this demand using a CATV modem delivering high data rate digital signals in a cost effective manner, thereby, utilizing a complex digital modulation scheme is inevitable. Exploiting complex modulation schemes, entails a more sophisticated modulator and distribution system with much tighter tolerances. However, there are always distortions introduced to the modulated signal in the modulator degrading signal quality. In this research, the effect of distortions introduced by the RF band pass filter in the modulator will be considered which cause degradations on the quality of the output Quadrature Amplitude Modulated (QAM) signal. Since the RF filter's amplitude/group delay distortions are not symmetrical in the frequency domain, once translated into the base band they have a complex effect on the QAM signal. Using Matlab, the degradation effects of these distortions on the QAM signal such as Bit Error Rate (BER) is investigated. In order to compensate for the effects of the RF filter distortions, two different methods are proposed. In the first method, a complex base band compensation filter is placed after the pulse shaping filter (SRRC). The coefficients of this complex filter are determined using an optimization algorithm developed during this research. The second approach, uses a pre-equalizer in the form of a Feed Forward FIR structure placed before the pulse shaping filter (SRRC). The coefficients of this pre-equalizer are determined using the equalization algorithm employed in a test receiver, with its tap weights generating the inverse response of the RF filter. The compensation of RF filter distortions in base band, in turn, improves the QAM signal parameters such as Modulation Error Ratio (MER). Finally, the MER of the modulated QAM signal before and after the base band compensation is compared between the two methods, showing a significant enhancement in the RF modulator performance

    Approximations for Performance Analysis in Wireless Communications and Applications to Reconfigurable Intelligent Surfaces

    Get PDF
    In the last few decades, the field of wireless communications has witnessed significant technological advancements to meet the needs of today’s modern world. The rapidly emerging technologies, however, are becoming increasingly sophisticated, and the process of investigating their performance and assessing their applicability in the real world is becoming more challenging. That has aroused a relatively wide range of solutions in the literature to study the performance of the different communication systems or even draw new results that were difficult to obtain. These solutions include field measurements, computer simulations, and theoretical solutions such as alternative representations, approximations, or bounds of classic functions that commonly appear in performance analyses. Field measurements and computer simulations have significantly improved performance evaluation in communication theory. However, more advanced theoretical solutions can be further developed in order to avoid using the ex- pensive and time-consuming wireless communications measurements, replace the numerical simulations, which can sometimes be unreliable and suffer from failures in numerical evaluation, and achieve analytically simpler results with much higher accuracy levels than the existing theoretical ones. To this end, this thesis firstly focuses on developing new approximations and bounds using unified approaches and algorithms that can efficiently and accurately guide researchers through the design of their adopted wireless systems and facilitate the conducted performance analyses in the various communication systems. Two performance measures are of primary interest in this study, namely the average error probability and the ergodic capacity, due to their valuable role in conducting a better understanding of the systems’ behavior and thus enabling systems engineers to quickly detect and resolve design issues that might arise. In particular, several parametric expressions of different analytical forms are developed to approximate or bound the Gaussian Q-function, which occurs in the error probability analysis. Additionally, any generic function of the Q-function is approximated or bounded using a tractable exponential expression. Moreover, a unified logarithmic expression is proposed to approximate or bound the capacity integrals that occur in the capacity analysis. A novel systematic methodology and a modified version of the classical Remez algorithm are developed to acquire optimal coefficients for the accompanying parametric approximation or bound in the minimax sense. Furthermore, the quasi-Newton algorithm is implemented to acquire optimal coefficients in terms of the total error. The average symbol error probability and ergodic capacity are evaluated for various applications using the developed tools. Secondly, this thesis analyzes a couple of communication systems assisted with reconfigurable intelligent surfaces (RISs). RIS has been gaining significant attention lately due to its ability to control propagation environments. In particular, two communication systems are considered; one with a single RIS and correlated Rayleigh fading channels, and the other with multiple RISs and non-identical generic fading channels. Both systems are analyzed in terms of outage probability, average symbol error probability, and ergodic capacity, which are derived using the proposed tools. These performance measures reveal that better performance is achieved when assisting the communication system with RISs, increasing the number of reflecting elements equipped on the RISs, or locating the RISs nearer to either communication node. In conclusion, the developed approximations and bounds, together with the optimized coefficients, provide more efficient tools than those available in the literature, with richer capabilities reflected by the more robust closed-form performance analysis, significant increase in accuracy levels, and considerable reduction in analytical complexity which in turns can offer more understanding into the systems’ behavior and the effect of the different parameters on their performance. Therefore, they are expected to lay the groundwork for the investigation of the latest communication technologies, such as RIS technology, whose performance has been studied for some system models in this thesis using the developed tools

    On the design and multiplierless realization of perfect reconstruction triplet-based FIR filter banks and wavelet bases

    Get PDF
    This paper proposes new methods for the efficient design and realization of perfect reconstruction (PR) two-channel finite-impulse response (FIR) triplet filter banks (FBs) and wavelet bases. It extends the linear-phase FIR triplet FBs of Ansari et al. to include FIR triplet FBs with lower system delay and a prescribed order of K regularity. The design problem using either the minimax error or least-squares criteria is formulated as a semidefinite programming problem, which is a very flexible framework to incorporate linear and convex quadratic constraints. The K regularity conditions are also expressed as a set of linear equality constraints in the variables to be optimized and they are structurally imposed into the design problem by eliminating the redundant variables. The design method is applicable to linear-phase as well as low-delay triplet FBs. Design examples are given to demonstrate the effectiveness of the proposed method. Furthermore, it was found that the analysis and synthesis filters of the triplet FB have a more symmetric frequency responses. This property is exploited to construct a class of PR M-channel uniform FBs and wavelets with M = 2 L, where L is a positive integer, using a particular tree structure. The filter lengths of the two-channel FBs down the tree are approximately reduced by a factor of two at each level or stage, while the transition bandwidths are successively increased by the same factor. Because of the downsampling operations, the frequency responses of the final analysis filters closely resemble those in a uniform FB with identical transition bandwidth. This triplet-based uniform M-channel FB has very low design complexity and the PR condition and K regularity conditions are structurally imposed. Furthermore, it has considerably lower arithmetic complexity and system delay than conventional tree structure using identical FB at all levels. The multiplierless realization of these FBs using sum-of-power-of-two (SOPOT) coefficients and multiplier block is also studied. © 2004 IEEE.published_or_final_versio

    IIR Digital Filter Design Using Convex Optimization

    Get PDF
    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
    corecore