Efficient Filter Banks And Interpolators
|
|
- Martha Gilbert
- 5 years ago
- Views:
Transcription
1 Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical design techniques have been shown to reduce the coplexity of individual ultipliers or structures that use several products of a single ultiplicand, such as FIR filters. The latter uses ultiplier blocks, which in this paper are shown to further reduce the coplexity of filter banks. We design an interpolating filter using the Farrow structure, and also use ultiplier blocks in the design of the extra delay circuitry that this structure requires. Applying ultiplier blocks to whole filter banks proves ore efficient than using separate filters, and applying ultiplier blocks to the Farrow structure akes it ore efficient than using the ore recognised Lagrange interpolator filters for low orders of Lagrange interpolation. Key Words: - Multiplication, Multiplier blocks, Interpolation, Lagrange interpolation, Farrow structure 1. Introduction 1.1 Multiplier Blocks The proble of reducing the nuber of adders used in a shift-and-add ultiplication process has been widely exained. For a single ultiplication, we have introduced a ethod that guarantees the iniu nuber of adders for short wordlengths [1] and algoriths that are the ost efficient available for longer wordlengths [2, 3]. In any structure where several products of a single ultiplicand are required, such as the transposed direct for FIR filter, ultiplier blocks can be utilised to exploit redundancy between the different ultipliers, resulting in efficient designs [4, 5, 6] requiring far fewer adders than other leading techniques [7]. Several IIR structures are also suitable for ultiplier block use and significant savings can be ade [8, 9, 1, 11]. In a recent paper, we exained the savings that can be ade if banks of FIR filters use ultiplier blocks to perfor their coefficient ultiplication operations [12]. Here we extend this work to deterine when the Farrow structure is best. 1.2 Filter Banks and the Farrow Structure Filter banks (parallel connections of digital filters) are used in any signal processing applications including design of analysis and synthesis filters for ultirate signal processing, tie-frequency analysis, wavelets and for fractional delay filter design. This latter application uses the Farrow structure [13], which can be explained as follows. To design a fractional delay filter (i.e. a filter which delays an incoing sapled signal by a non-integral nuber of saples, say D) is to produce a filter with frequency response jω jωd H( e ) = e (1) or ipulse response h( n) = sinc( n D) for all n (2) which is non-causal and so ust approxiated. A popular and effective ethod of approxiating this ipulse response is to use an FIR filter perforing Lagrange interpolation, which has coefficients [14]: N D k h( n) = for n =, 1, 2, N (3) n k k= k n This works well for constant delay D, but the coefficients ust be recalculated each tie D changes.
2 The ai of Farrow's ethod [13] is to avoid this recalculation. If d is the fractional part of D (ie D = l d for integer l, and d < 1), then a polynoial of order P in d is used to approxiate each coefficient in equation: h ( n) = c ( n) d d P = (4) which leads to transfer function N N P P n n H d ( z) = hd ( n) z = c ( n) d z = C ( z) d (5) n= n= = = where C ( z) = c ( n) z N n= n. This structure can be ipleented as in Figure 1, i.e. a filter bank. Iportantly, the coefficients of the filters are constant, regardless of the delay d. Figure 1, the constant ultipliers and saple delay registers, needs to be replicated M ties, once for each delay value. However, only one Farrow filter bank is required. Such a structure is shown in Figure 2. Although the d i delays are fixed, there are several of the, and the extra coputations required by the Farrow structure are effectively aortised across the range of delays. C P (z) C P-1 (z) C 1 (z) C (z) d d d y (n) C P(z) C P-1(z) C 1(z) C (z) d 1 d 1 d 1 y 1 (n) d d d y(n) d M d M d M y M (n) Figure 1 Farrow structure for polynoial approxiation of filter coefficients The Farrow structure can be used to replace singlefilter interpolators such as the Lagrange interpolator. In fact, because the Lagrange interpolator itself uses a polynoial ethod of approxiation, the Farrow structure can exactly replicate the single Lagrange interpolator filter with N = P [15]. Typically, the Farrow structure, which is a filter bank, is only a useful replaceent for a single filter where the fractional delay is different each tie an output saple is calculated [14], because its fixed coefficients save coputation coplexity. Obviously, for a constant delay, one filter requires less effort than P filters, so the Farrow structure is less attractive. However, another useful application of the Farrow structure that we propose here is that of a regular interpolator, i.e. a structure that produces interpolated outputs at several (fixed) delay intervals. In ultirate signal processing applications, where a signal is being upsapled by a factor M, a regular interpolator or expander is used to reconstruct signals. In such a structure, the lower part of Figure 2 A Farrow structure used to generate several constant delays, as in a regular upsapler or expander. 2. Filter Bank Structures Using Multiplier Blocks Multiplier blocks are useful in structures where several products of a single ultiplicand are required. In [12], we show how network anipulations can be used so that, starting with a bank of parallel FIR filters, all of the filter coefficients could be incorporated into a single block. This structure has NP delays (for P order N filters), but another structure can be defined which is canonic in delays (ie N delays only), but has a separate ultiplier block for each individual filter in the bank. 3. Farrow Structures Using Multiplier Blocks Typically the Farrow structure is drawn as in
3 Figure 1, i.e. a filter bank with separate identical ultipliers separated by delays. The ai of the work presented here is to iniise the nuber of nuerical operations perfored in such structures, and the ethod in the previous section can be used to iniise the operations in the filter bank section of the structure. Previous authors have used siilar siplifications for specific siple exaples of Farrow filter banks [15, 16]. If the Farrow structure is used to ipleent a regular grid of delay points, a structure such as that in Figure 2 is ore appropriate. It can be seen fro that figure that a ultiplier block could replace the M products of the output of C P (z). However, even greater siplifications can be ade with soe network anipulation. In [12], we describe how the Farrow interpolator bank can be configured as in Figure 3, which we call Farrow block I and Figure 4 which we call Farrow block II. C P(z) C P-1(z) C 1(z) C (z) y (n) y 1(n) y (n) Figure 4 The Farrow structure of Figure 2 odified by transposing each single delay filter, ipleenting the coefficients in a ultiplier block, then retransposing the whole filter bank (Farrow block II) C P (z) C P-1 (z) C 1 (z) C (z) d M P P P d 1 d d 1 P-1 d M P-1 d P-1 d M d 1 d Figure 3 The Farrow structure for several constant delay outputs. Note the outputs of each bank filter are then ultiplied by several coefficients, which can be gathered into ultiplier blocks. The highest-order coefficient block is shown dotted. (Farrow block I) y (n) y 1 (n) y M (n 4. Varying Design Paraeters Our previous work [12] showed that ipleentations with all coefficients in the bank in a single block are less costly. For both the Lagrange and Farrow structures, gains ade by including all coefficients in a single block outweigh the penalty of using a few ore delay eleents, consistent with earlier results [5, 7, 8, 9, 1]. In that paper, the exaple Lagrange bank filter was the cheapest. However, despite the extra circuitry required by the Farrow structure, it is not far behind. There is reason to believe that the Farrow structure ay in soe circustances be better. 4.1 Varying the Lagrange order The above experient was repeated for wordlength w =12, upsapling rate M = 16 and Lagrange orders between 2 and 1. For each of these specifications, four different filter structures were designed: i) individual Lagrange filters, each designed as in [5] (see also [17]), ii) a Lagrange bank (all coefficients in a single block, as discussed in section 2 and Figure 3c of [12]), iii) a Farrow structure with individual filters blocked (the canonic design discussed in section 2 and Figure 4 of [12]), and iv) a Farrow block (either Figure 3 or Figure 4b, whichever was ore efficient). The results are shown in Figure 5. For Lagrange filters, as in [12], it is ore efficient to block all of the coefficients in the
4 bank. For the Farrow structure, due to the extra structural coponents, this advantage is not established. In fact, for soe orders, there is a very slight advantage if the individual filters are used. The interesting point to note fro these results, however, is that for orders 4 and below, the Farrow structure gives the ost efficient solution, and for orders 5 and above, the Lagrange filters give the ost efficient solution. precision (a siilar phenoenon was noted in [5] where as the nuber of coefficients increased, total cost saturated as no new coefficients were introduced). The individual filter ipleentation of Lagrange quickly becoes expensive. The Farrow structure is ore efficient than Lagrange for high wordlengths Lagrange ind Farrow ind Lagrange bank Farrow bank adder cost adder cost Lagrange ind Farrow ind Lagrange bank Farrow bank upsapling rate Lagrange order Figure 5 Costs of the different filter configurations for different Lagrange orders 4.2 Varying the upsapling rate A siilar experient was run, with Lagrange order N = 5, wordlength w = 12, with upsapling rate varying fro 2 to 32. The results are shown in Figure 6. For both the Farrow and Lagrange structures, the bank ethod is ost efficient throughout. The nononotonic behaviour for low upsapling rates is due to the rate of 4 producing cheap powers-of-two type coefficients, aking it ore efficient than a rate of 3. Note that for higher upsapling rates (above 18), the Farrow structure is superior. 4.3 Varying the wordlength Wordlength w was varied fro 4 to 32 bits for the case Lagrange order N = 5, upsapling rate M = 16. These results are shown in Figure 7. Each of the cost curves saturates because, due to the way the coefficients are generated, we find that extra wordlength gives no ore Figure 6 Costs of the different filter configurations for different upsapling rates adder cost Lagrange ind Farrow ind Lagrange bank Farrow bank wordlength Figure 7 Costs of the different filter configurations for different wordlengths 4.4 When to use the Farrow structure For three wordlengths, w = 12, 16, 24, the order was varied fro 2 to 1 in search of the lowest order where
5 the Farrow structure was not superior to the standard Lagrange ethod, i.e. the transition fro where a Farrow design is prefered to Lagrange. These results are shown in Figure 8, and again a nuber of interesting observations can be ade: Certain upsapling rates (e.g. 15 and 25) have a low transition order, indicating that the Lagrange ethod is ore preferable than for neighbouring values of upsapling rate. Siilarly, there are rates (e.g. 16, 24 and 3) where the Farrow structure is ore preferable. At wordlength w = 12 in particular, for upsapling rates of 24 and 3, the Farrow structure is prefered for all orders up to 15. 1) As upsapling rate increases, the transition order increases. In other words, the Farrow structure becoes ore attractive, i.e. it is ore efficient for ore Lagrange orders. This growth in the transition order is greater for the shorter wordlengths. 2) In general, wordlength w = 16 sees to have a lower transition order than either w = 12 or 24, although it could also be said that there is not a great variation in the results with wordlength. transition order w=12 w=16 w= upsapling rate Figure 8 The iniu order at which the cost of the Lagrange ethod is less than that using the Farrow structure (both with all coefficients in the filter bank in a single block) 5. Conclusions It has been shown that there are significant savings to be ade if ultiplier blocks are used for all the coefficients in a filter bank. In the case of upsapling interpolators, the Farrow structure becoes cost copetitive with low-order standard Lagrange designs if ultiplier blocks are used. References [1] A G Depster and M D Macleod, Constant integer ultiplication using iniu adders, IEE Proc E: CD&S, vol 141, no 5, pp47-413, Oct 1994 [2] A G Depster and M D Macleod, General algoriths for reduced-adder integer ultiplier design, Electronics Letters, vol 31, no 21, pp18-182, Oct 1995 [3] A G Depster and M D Macleod, Coents on Miniu nuber of adders for ipleenting a ultiplier and its application to the design of ultiplierless digital filters, IEEE Trans C&S II, vol. 45, no. 2, pp , Feb 1998 [4] D R Bull and D H Horrocks, Priitive operator digital filters, IEE Proc. G, vol 138, no 3, pp41-412, Jun 1991 [5] A G Depster and M D Macleod, Use of iniu-adder ultiplier blocks in FIR digital filters IEEE Trans C&S II, vol 42, no 9, pp , Sept 1995 [6] A G Depster and M D Macleod, Use of ultiplier blocks to reduce filter coplexity, ISCAS94, London [7] A G Depster and M D Macleod, Coparison of fixed point FIR filter design techniques, IEEE Trans C&S II, vol. 44, no. 7, pp , July 1997 [8] A G Depster and M D Macleod, Multiplier blocks and the coplexity of IIR structures, Electronics Letters, vol 3, no 22, pp , Oct 1994 [9] A G Depster and M D Macleod, Coparison of IIR filter structure coplexities using ultiplier blocks, Proc ISCAS95, vol 2, pp , IEEE, Apr-May 1995 [1] A G Depster, The Cost of Liit-Cycle Eliination in IIR Digital Filters Using Multiplier Blocks ISCAS97, vol 4, pp , June 1997 [11] A G Depster and M D Macleod, IIR Digital Filter Design Using Miniu-adder Multiplier
6 Blocks, IEEE Trans C&S II, vol. 45, no. 6, pp , June [12] A G Depster and N P Murphy, Efficient Interpolators and Filter Banks using Multiplier Blocks, accepted for publication in IEEE Trans Signal Processing [13] C W Farrow, A Continuously Variable Digital Delay Eleent, ISCAS88, pp [14] T I Laakso et al, Splitting the Unit Delay, IEEE Signal Processing Magazine, vol 13 no 1, pp3-6, Jan 1996 [15] V Valiaki, A New Filter Ipleentation Strategy for Lagrange Interpolation, Proc International Syposiu on Circuits and Systes (ISCAS95), pp [16] Ewa Heranowicz, Weighted Lagrangian Interpolating FIR Filter, Signal Processing VIII, Proceedings of EUSIPCO-96, pp , 1996 [17] A G Depster and N P Murphy, Lagrange Interpolators and Binoial Windows, Signal Processing, vol. 76, no. 1, pp , July, 1999
Complexity reduction in low-delay Farrowstructure-based. filters utilizing linear-phase subfilters
Coplexity reduction in low-delay Farrowstructure-based variable fractional delay FIR filters utilizing linear-phase subfilters Air Eghbali and Håkan Johansson Linköping University Post Print N.B.: When
More informationStructures for Interpolation, Decimation, and Nonuniform Sampling Based on Newton s Interpolation Formula
Structures for Interpolation, Deciation, and Nonunifor Sapling Based on Newton s Interpolation Forula Vesa Lehtinen, arkku Renfors To cite this version: Vesa Lehtinen, arkku Renfors. Structures for Interpolation,
More informationFast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials
Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter
More informationA New Algorithm for Reactive Electric Power Measurement
A. Abiyev, GAU J. Soc. & Appl. Sci., 2(4), 7-25, 27 A ew Algorith for Reactive Electric Power Measureent Adalet Abiyev Girne Aerican University, Departernt of Electrical Electronics Engineering, Mersin,
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationLow complexity bit parallel multiplier for GF(2 m ) generated by equally-spaced trinomials
Inforation Processing Letters 107 008 11 15 www.elsevier.co/locate/ipl Low coplexity bit parallel ultiplier for GF generated by equally-spaced trinoials Haibin Shen a,, Yier Jin a,b a Institute of VLSI
More informationMulti-Scale/Multi-Resolution: Wavelet Transform
Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationGenetic Algorithm Search for Stent Design Improvements
Genetic Algorith Search for Stent Design Iproveents K. Tesch, M.A. Atherton & M.W. Collins, South Bank University, London, UK Abstract This paper presents an optiisation process for finding iproved stent
More informationSymbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm
Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationAnalysis of Polynomial & Rational Functions ( summary )
Analysis of Polynoial & Rational Functions ( suary ) The standard for of a polynoial function is ( ) where each of the nubers are called the coefficients. The polynoial of is said to have degree n, where
More informationN-Point. DFTs of Two Length-N Real Sequences
Coputation of the DFT of In ost practical applications, sequences of interest are real In such cases, the syetry properties of the DFT given in Table 5. can be exploited to ake the DFT coputations ore
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationHIGH RESOLUTION NEAR-FIELD MULTIPLE TARGET DETECTION AND LOCALIZATION USING SUPPORT VECTOR MACHINES
ICONIC 2007 St. Louis, O, USA June 27-29, 2007 HIGH RESOLUTION NEAR-FIELD ULTIPLE TARGET DETECTION AND LOCALIZATION USING SUPPORT VECTOR ACHINES A. Randazzo,. A. Abou-Khousa 2,.Pastorino, and R. Zoughi
More informationRESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS
BIT Nuerical Matheatics 43: 459 466, 2003. 2003 Kluwer Acadeic Publishers. Printed in The Netherlands 459 RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS V. SIMONCINI Dipartiento di
More informationElliptic Curve Scalar Point Multiplication Algorithm Using Radix-4 Booth s Algorithm
Elliptic Curve Scalar Multiplication Algorith Using Radix-4 Booth s Algorith Elliptic Curve Scalar Multiplication Algorith Using Radix-4 Booth s Algorith Sangook Moon, Non-eber ABSTRACT The ain back-bone
More informationCombining Classifiers
Cobining Classifiers Generic ethods of generating and cobining ultiple classifiers Bagging Boosting References: Duda, Hart & Stork, pg 475-480. Hastie, Tibsharini, Friedan, pg 246-256 and Chapter 10. http://www.boosting.org/
More informationŞtefan ŞTEFĂNESCU * is the minimum global value for the function h (x)
7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not
More informationVulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links
Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Tie-Varying Jaing Links Jun Kurihara KDDI R&D Laboratories, Inc 2 5 Ohara, Fujiino, Saitaa, 356 8502 Japan Eail: kurihara@kddilabsjp
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationarxiv: v1 [cs.ds] 3 Feb 2014
arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/
More informationCHAPTER 19: Single-Loop IMC Control
When I coplete this chapter, I want to be able to do the following. Recognize that other feedback algoriths are possible Understand the IMC structure and how it provides the essential control features
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016/2017 Lessons 9 11 Jan 2017 Outline Artificial Neural networks Notation...2 Convolutional Neural Networks...3
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationA Note on the Applied Use of MDL Approximations
A Note on the Applied Use of MDL Approxiations Daniel J. Navarro Departent of Psychology Ohio State University Abstract An applied proble is discussed in which two nested psychological odels of retention
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationPolynomial Division By Convolution
Applied Matheatics E-Notes, (0), 9 c ISSN 0-0 Available free at irror sites of http://wwwathnthuedutw/aen/ Polynoial Division By Convolution Feng Cheng Chang y Received 9 March 0 Abstract The division
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More informationINTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN
INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN V.A. Koarov 1, S.A. Piyavskiy 2 1 Saara National Research University, Saara, Russia 2 Saara State Architectural University, Saara, Russia Abstract. This article
More informationConvolutional Codes. Lecture Notes 8: Trellis Codes. Example: K=3,M=2, rate 1/2 code. Figure 95: Convolutional Encoder
Convolutional Codes Lecture Notes 8: Trellis Codes In this lecture we discuss construction of signals via a trellis. That is, signals are constructed by labeling the branches of an infinite trellis with
More information1 Proof of learning bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a
More informationDesign of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding
IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED PAPER) 1 Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding Lai Wei, Student Meber, IEEE, David G. M. Mitchell, Meber, IEEE, Thoas
More informationInfluence lines for statically indeterminate structures. I. Basic concepts about the application of method of forces.
Influence lines for statically indeterinate structures I. Basic concepts about the application of ethod of forces. The plane frae structure given in Fig. is statically indeterinate or redundant with degree
More informationPhysically Based Modeling CS Notes Spring 1997 Particle Collision and Contact
Physically Based Modeling CS 15-863 Notes Spring 1997 Particle Collision and Contact 1 Collisions with Springs Suppose we wanted to ipleent a particle siulator with a floor : a solid horizontal plane which
More informationHomework 3 Solutions CSE 101 Summer 2017
Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationTime-of-flight Identification of Ions in CESR and ERL
Tie-of-flight Identification of Ions in CESR and ERL Eric Edwards Departent of Physics, University of Alabaa, Tuscaloosa, AL, 35486 (Dated: August 8, 2008) The accuulation of ion densities in the bea pipe
More informationA Generalized Permanent Estimator and its Application in Computing Multi- Homogeneous Bézout Number
Research Journal of Applied Sciences, Engineering and Technology 4(23): 5206-52, 202 ISSN: 2040-7467 Maxwell Scientific Organization, 202 Subitted: April 25, 202 Accepted: May 3, 202 Published: Deceber
More informationFourier Series Summary (From Salivahanan et al, 2002)
Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t
More informationUsing a De-Convolution Window for Operating Modal Analysis
Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis
More informationTime-frequency plane behavioural studies of harmonic and chirp functions with fractional Fourier transform (FRFT)
Maejo International Journal of Science and Technology Full Paper ISSN 95-7873 Available online at www.ijst.ju.ac.th Tie-frequency plane behavioural studies of haronic and chirp functions with fractional
More informationExtension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels
Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationECS455: Chapter 5 OFDM
ECS455: Chapter 5 OFDM 5.4 Cyclic Prefix (CP) 1 Dr.Prapun Suksopong prapun.co/ecs455 Office Hours: BKD 3601-7 Tuesday 9:30-10:30 Friday 14:00-16:00 Three steps towards odern OFDM 1. Mitigate Multipath
More informationGenetic Quantum Algorithm and its Application to Combinatorial Optimization Problem
Genetic Quantu Algorith and its Application to Cobinatorial Optiization Proble Kuk-Hyun Han Dept. of Electrical Engineering, KAIST, 373-, Kusong-dong Yusong-gu Taejon, 305-70, Republic of Korea khhan@vivaldi.kaist.ac.kr
More informationOBJECTIVES INTRODUCTION
M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and
More informationCompressive Distilled Sensing: Sparse Recovery Using Adaptivity in Compressive Measurements
1 Copressive Distilled Sensing: Sparse Recovery Using Adaptivity in Copressive Measureents Jarvis D. Haupt 1 Richard G. Baraniuk 1 Rui M. Castro 2 and Robert D. Nowak 3 1 Dept. of Electrical and Coputer
More informationNUMERICAL MODELLING OF THE TYRE/ROAD CONTACT
NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT PACS REFERENCE: 43.5.LJ Krister Larsson Departent of Applied Acoustics Chalers University of Technology SE-412 96 Sweden Tel: +46 ()31 772 22 Fax: +46 ()31
More informationSome Perspective. Forces and Newton s Laws
Soe Perspective The language of Kineatics provides us with an efficient ethod for describing the otion of aterial objects, and we ll continue to ake refineents to it as we introduce additional types of
More informationGeneralized Queries on Probabilistic Context-Free Grammars
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 1, JANUARY 1998 1 Generalized Queries on Probabilistic Context-Free Graars David V. Pynadath and Michael P. Wellan Abstract
More informationA MESHSIZE BOOSTING ALGORITHM IN KERNEL DENSITY ESTIMATION
A eshsize boosting algorith in kernel density estiation A MESHSIZE BOOSTING ALGORITHM IN KERNEL DENSITY ESTIMATION C.C. Ishiekwene, S.M. Ogbonwan and J.E. Osewenkhae Departent of Matheatics, University
More informationFigure 1: Equivalent electric (RC) circuit of a neurons membrane
Exercise: Leaky integrate and fire odel of neural spike generation This exercise investigates a siplified odel of how neurons spike in response to current inputs, one of the ost fundaental properties of
More informationA High-Speed Processor for Digital Sine/Cosine Generation and Angle Rotation*
Copyright IEEE 998: Published the proceedgs of the nd Asiloar Conference on Signals, Systes and Coputers, Nov -4, 998, at Asiloar, California, USA A High-Speed Processor for Digital Se/Cose Generation
More informationTHE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT
THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and
More informationMSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE
Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL
More informationOn the Mixed Discretization of the Time Domain Magnetic Field Integral Equation
On the Mixed Discretization of the Tie Doain Magnetic Field Integral Equation H. A. Ülkü 1 I. Bogaert K. Cools 3 F. P. Andriulli 4 H. Bağ 1 Abstract Tie doain agnetic field integral equation (MFIE) is
More informationPattern Classification using Simplified Neural Networks with Pruning Algorithm
Pattern Classification using Siplified Neural Networks with Pruning Algorith S. M. Karuzzaan 1 Ahed Ryadh Hasan 2 Abstract: In recent years, any neural network odels have been proposed for pattern classification,
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationAnalyzing Simulation Results
Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient
More informationNecessity of low effective dimension
Necessity of low effective diension Art B. Owen Stanford University October 2002, Orig: July 2002 Abstract Practitioners have long noticed that quasi-monte Carlo ethods work very well on functions that
More informationWhen Short Runs Beat Long Runs
When Short Runs Beat Long Runs Sean Luke George Mason University http://www.cs.gu.edu/ sean/ Abstract What will yield the best results: doing one run n generations long or doing runs n/ generations long
More informationLogLog-Beta and More: A New Algorithm for Cardinality Estimation Based on LogLog Counting
LogLog-Beta and More: A New Algorith for Cardinality Estiation Based on LogLog Counting Jason Qin, Denys Ki, Yuei Tung The AOLP Core Data Service, AOL, 22000 AOL Way Dulles, VA 20163 E-ail: jasonqin@teaaolco
More informationEstimation of the Mean of the Exponential Distribution Using Maximum Ranked Set Sampling with Unequal Samples
Open Journal of Statistics, 4, 4, 64-649 Published Online Septeber 4 in SciRes http//wwwscirporg/ournal/os http//ddoiorg/436/os4486 Estiation of the Mean of the Eponential Distribution Using Maiu Ranked
More informationC na (1) a=l. c = CO + Clm + CZ TWO-STAGE SAMPLE DESIGN WITH SMALL CLUSTERS. 1. Introduction
TWO-STGE SMPLE DESIGN WITH SMLL CLUSTERS Robert G. Clark and David G. Steel School of Matheatics and pplied Statistics, University of Wollongong, NSW 5 ustralia. (robert.clark@abs.gov.au) Key Words: saple
More informationma x = -bv x + F rod.
Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informationComparison of Stability of Selected Numerical Methods for Solving Stiff Semi- Linear Differential Equations
International Journal of Applied Science and Technology Vol. 7, No. 3, Septeber 217 Coparison of Stability of Selected Nuerical Methods for Solving Stiff Sei- Linear Differential Equations Kwaku Darkwah
More informationHysteresis model for magnetic materials using the Jiles-Atherton model
Hysteresis odel for agnetic aterials using the Jiles-Atherton odel Predrag Petrovic Technical faculty Svetog Save 65 32 Cacak, pegi@ei.yu Nebojsa itrovic Technical faculty Svetog Save 65 32 Cacak, itar@tfc.tfc.kg.ac.yu
More informationArithmetic Unit for Complex Number Processing
Abstract Arithetic Unit or Coplex Nuber Processing Dr. Soloon Khelnik, Dr. Sergey Selyutin, Alexandr Viduetsky, Inna Doubson, Seion Khelnik This paper presents developent o a coplex nuber arithetic unit
More informationEE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng
EE59 Spring Parallel LSI AD Algoriths Lecture I interconnect odeling ethods Zhuo Feng. Z. Feng MTU EE59 So far we ve considered only tie doain analyses We ll soon see that it is soeties preferable to odel
More informationtime time δ jobs jobs
Approxiating Total Flow Tie on Parallel Machines Stefano Leonardi Danny Raz y Abstract We consider the proble of optiizing the total ow tie of a strea of jobs that are released over tie in a ultiprocessor
More informationA VARIABLE STEP-SIZE FREQUENCY-DOMAIN ADAPTIVE FILTERING ALGORITHM FOR STEREOPHONIC ACOUSTIC ECHO CANCELLATION
18th European Signal Processing Conference EUSIPCO-2010 Aalborg, Denark, August 23-27, 2010 A VARIABLE STEP-SIZE FREQUENCY-DOMAIN ADAPTIVE FILTERING ALGORITHM FOR STEREOPHONIC ACOUSTIC ECHO CANCELLATION
More informationA Division Algorithm Using Bisection Method in Residue Number System
International Journal of Coputer, Consuer and Control IJ3C), Vol., No. 03) 59 A Division Algorith Using Bisection Method in Residue Nuber Syste * Chin-Chen Chang and Jen-Ho Yang Abstract. Introduction
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More information+ -d-t-' )=1. = vpi. Aportaciones Matematicas Comunicaciones 17 (1996) 5-10.
Aportaciones Mateaticas Counicaciones 17 (1996) 5-10. 1. A suary of the proble Much of the processing that is used in the petroleu industry requires the consideration of a large nuber of cheical reactions.
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationTopic 5a Introduction to Curve Fitting & Linear Regression
/7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline
More informationResearch Article Rapidly-Converging Series Representations of a Mutual-Information Integral
International Scholarly Research Network ISRN Counications and Networking Volue 11, Article ID 5465, 6 pages doi:1.54/11/5465 Research Article Rapidly-Converging Series Representations of a Mutual-Inforation
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More informationProc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES
Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co
More informationLeast squares fitting with elliptic paraboloids
MATHEMATICAL COMMUNICATIONS 409 Math. Coun. 18(013), 409 415 Least squares fitting with elliptic paraboloids Heluth Späth 1, 1 Departent of Matheatics, University of Oldenburg, Postfach 503, D-6 111 Oldenburg,
More informationAn Improved Particle Filter with Applications in Ballistic Target Tracking
Sensors & ransducers Vol. 72 Issue 6 June 204 pp. 96-20 Sensors & ransducers 204 by IFSA Publishing S. L. http://www.sensorsportal.co An Iproved Particle Filter with Applications in Ballistic arget racing
More informationCompression and Predictive Distributions for Large Alphabet i.i.d and Markov models
2014 IEEE International Syposiu on Inforation Theory Copression and Predictive Distributions for Large Alphabet i.i.d and Markov odels Xiao Yang Departent of Statistics Yale University New Haven, CT, 06511
More informationESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics
ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents
More informationSampling How Big a Sample?
C. G. G. Aitken, 1 Ph.D. Sapling How Big a Saple? REFERENCE: Aitken CGG. Sapling how big a saple? J Forensic Sci 1999;44(4):750 760. ABSTRACT: It is thought that, in a consignent of discrete units, a certain
More informationASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical
IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul
More informationThe accelerated expansion of the universe is explained by quantum field theory.
The accelerated expansion of the universe is explained by quantu field theory. Abstract. Forulas describing interactions, in fact, use the liiting speed of inforation transfer, and not the speed of light.
More informationGeneralized Sampling Theorem for Bandpass Signals
Hindawi Publishing Corporation EURASIP Journal on Applied Signal Processing Volue 26, Article ID 59587, Pages 6 DOI 55/ASP/26/59587 Generalized Sapling Theore for Bandpass Signals Ales Prokes Departent
More informationIN modern society that various systems have become more
Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto
More informations = (Y Q Y P)/(X Q - X P)
Elliptic Curves and their Applications in Cryptography Preeti Shara M.Tech Student Mody University of Science and Technology, Lakshangarh Abstract This paper gives an introduction to elliptic curves. The
More informationThe Methods of Solution for Constrained Nonlinear Programming
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained
More informationA Model for the Selection of Internet Service Providers
ISSN 0146-4116, Autoatic Control and Coputer Sciences, 2008, Vol. 42, No. 5, pp. 249 254. Allerton Press, Inc., 2008. Original Russian Text I.M. Aliev, 2008, published in Avtoatika i Vychislitel naya Tekhnika,
More informationNBN Algorithm Introduction Computational Fundamentals. Bogdan M. Wilamoswki Auburn University. Hao Yu Auburn University
NBN Algorith Bogdan M. Wilaoswki Auburn University Hao Yu Auburn University Nicholas Cotton Auburn University. Introduction. -. Coputational Fundaentals - Definition of Basic Concepts in Neural Network
More information