x(n) x(n) H (f) y(n) Z -1 Z -1 x(n) ^
|
|
- Barbra Wright
- 6 years ago
- Views:
Transcription
1 SOE FUNDAENTAL POPETIES OF SE FILTE BANKS. Kvanc hcak, Pierre oulin, Kannan amchandran University of Illinois at Urbana-Chamaign Beckman Institute and ECE Deartment 405 N. athews Ave., Urbana, IL ihai Anitescu Argonne National Laboratories Argonne, IL ABSTACT We design lter banks that are best matched to inut signal statistics in -channel subband coders, using a broad class of rate{distortion criteria. We resent fundamental roerties and analytical exressions for minimum mean-squared error (SE) lter banks, without constraints on lter length, under otimal bit allocation requirements. We also investigate a constrained{length version of this roblem, which is alicable to ractical coding scenarios. While the otimal lter banks are nearly erfect-reconstruction at high rates, we show that SE FI lter banks enjoy a signicant advantage (in the SE sense) over otimal erfect{reconstruction FI lter banks at all rates.. INTODUCTION We consider {channel subband coders with analysis lters fh i(f); 0 i < g and synthesis lters f Hi(f); 0 i < g. Fig. shows an equivalent reresentation of the codec in terms of the analysis and synthesis olyhase matrices H(f) and H(f). The roblem of interest here is to design the lters so as to otimize the rate{distortion erformance of subband coders that use uniform scalar quantizers in each channel. The distortion measure is mean{squared reconstruction error. We exlore fundamental roerties of SE lter banks (for which the erfect{reconstruction (P) is not imosed a riori []). We also resent analytical exressions for the resulting otimal lter banks in terms of bit rate and second-order inut signal statistics... Basic odel for Signal and uantization Noise The inut to the subband coder is assumed to be real{ valued and wide{sense stationary with zero mean and sectral density S(f). Throughout, we assume that S(f) is bounded away from zero. The total bit budget is bits er samle, to be allocated to the quantizers in each channel. uantizer i in channel i oerates on a signal y i(n) with variance P i, is scalar and uniform, and is allocated i bits, where i =. We make the assumtion that the quantization noise is additive, white and indeendent of the signal; and that the quantization noise sources in dierent channels are mutually indeendent. This is a standard model which is valid at high bit rates, but not at low Work suorted by NSF grant IP and DOE contract W-3-09-Eng-38. bit rates. Each quantizer is assumed to have a distortion{ rate function i D( i), where in this context distortion is quantization noise variance. The following roerties are required : D(:) is strictly ositive, strictly monotonic decreasing, and strictly convex. For Theorems. and. to hold, we also require lnd(:) to be concave. The standard exonential model D( i) = i i for the rate{distortion function satises all of the assumtions above. We rst state the design criterion for P lter banks in Sec.. and extend it to SE lter banks in Sec Design Criterion for P Systems Under the assumtions above, the reconstruction error ^ is a cyclostationary rocess with eriod. For P systems, the goal is to minimize the exected mean{squared error (SE) [] Ej^ j = n=0 D( i) i jj h ijj () where jj h ijj reresents the amlication factor for white noise assed through synthesis lter h i. In order to nd the otimal bit allocation given the lter banks, the otimization roblem () with bit rate constraints is transformed into the Lagrange otimization roblem inimize P D(i) i jj h ijj P i where is the Lagrange multilier. The solution satises the condition, i jj h ijj dd() d i = ; 0 i < : () Hence, for otimal bit allocation, the sloe of the distortion{ rate function D(i) i jj hijj at the encoder's oerating oint must be the same for all i. It has been assumed here that is large enough so that the ositivity constraints i 0 are all inactive. Due to the strict convexity of D(:), the otimal bit allocation roblem has a unique solution. Let S(f) be the sectral density matrix for the olyhase vector, inut to H(f) in Fig.. We have i = 0:5 0:5 (HSH y ) ii df; jj h ijj = 0:5 0:5 ( H y H) ii df:
2 - H (f) -.3. Design Criterion for SE Filter Banks In the SE lter bank aroach, the P constraints are relaxed so as to trade o systematic reconstruction errors (due to lack of P) against quantization noise. The solution is nearly identical to the P solution at high bit rates (low quantization noise), but notable imrovements over P designs have been obtained using numerical simulations at lower bit rates []. Here, we seek analytical exressions for the lters and bit allocation f ig that jointly minimize the SE. Using the model in Sec.., signal and quantization noise are assumed to be indeendent, so the SE is the sum of the noise term () and a signal term. The SE is E = P D( i) (HSH y ) ii ( H y H) ii T r ( HH I ) S ( HH I ) y ; (3) to be minimized over H; H, and f ig. allocation condition is still given by (). The otimal bit - ^ H (f) - - y(n) Figure : Polyhase reresentation of {channel subband coder and decoder using analysis lters H i(f) and synthesis lters Hi(f). The olyhase comonents of H i(f) (res. Hi(f)) are contained in row (res. column) i of the olyhase matrix H(f) (res. H(f).). FUNDAENTAL POPETIES OF SE FILTE BANKS We have recently roven that otimal (in the sense ()) P lter banks enjoy two fundamental roerties: total decorrelation of subband channels, and sectral majorization [, 3]. These roerties were reviously known to aly only to araunitary lter banks, in which case the solution is a rincial{comonent lter bank (PCFB) [4, 5, 6]. We now show that these fundamental roerties hold even if the P conditions are relaxed, and the cost function (3) is used. The roof of the two theorems below uses variational techniques and arallels the roof of Theorem.3 and Lemma.6 in []. Theorem. (Total Decorrelation is Necessary for Otimality.) The system H; H, f ig minimizes (3) only if the matrices HSH y and H y H are diagonal, and f ig satises (). Theorem. (Sectral ajorization is Necessary for Otimality.) Let H; H, f ig be a minimizer of (3), and = H y H. Without loss of generality, assume that 0. The normalized sectral densities w i i S y;ii(f) for the subband signals satisfy the sectral majorization roerty: w 0 0 S y;00(f) S y;;(f); 8f; w where w i 4 = D( i). Likewise, the normalized quantities w i jj h i jj ii(f) satisfy the sectral majorization roerty w 0jj h 00(f) 0jj w jj h ;(f); 8f: jj The articular lter bank structure shown in Fig. was shown to be otimal in the P class [, 3], in which case G i(f) = =G i(f). The rst block in this structure, U(f), is a PCFB. While at this oint we are not able to ascertain
3 - - U(f) z(n) 0 - y(n) G 0(f) G (f) - U(f) ^ Figure : Cascade of a rincial{comonent lter bank U(f) and a set of relters G i(f) and ostlters Gi(f) around each quantizer. This system satises the total decorrelation and sectral majorization roerties. whether the structure in Fig. is also otimal for SE lter banks, we are able to comute the best lters G i(f) and Gi(f). We then rove some imortant roerties of the resulting lter bank. We can write the cost function (3) in terms of the re{ and ostlters G i(f) and Gi(f) as E = P D(i) jg i Sij j Gij P j GiG i j S i; (4) where S i(f) is the sectral density for the signal z i(n) in Fig.. Analytical exressions for the otimal lters G i(f), G i(f) deend on the bit rates f ig. Theorem.3 For any f ig, the lters that minimize the SE (3) for the system in Fig. are jg i(f)j = c i Pi(f)S =4 i (f); j Gi(f)j = c i Pi(f)S =4 i (f) (5) where c i are arbitrary ositive scaling factors, and the roduct lters P i(f) = G i(f) Gi(f), 0 i <, are given by P i(f) = max 0; D(i) D( i) The SE for these lters is given by E(H; H) = n f j S i(f) > D( i) D( i ) Si(f) df Si(f) : (6) Si(f) df D( i) D( i) S i(f) df; (7) where means integration over the (unique) set F i that o satises F i = Si, and means integration over the comlementary set. Outline of the Proof : By the Cauchy-Schwartz inequality, P (4) is lower bounded by E LB = P D(i) G i Gi Si Gi Gi S i, with equality i G i Si = Since the class of lters considered in Fig. contains the otimal P lter bank, the solution is clearly guaranteed to be at least as good as the otimal P lter bank. At high bit rates, F i =. As our numerical results have shown, F i = at all bit rates for A() rocesses. c i G i. Additionally, c i > 0 and P i(f) 0 (see []). The functional E LB is strictly convex in P i, and its unique minimizer is given by (6). Substituting into E LB, we obtain (7). The otimal SE (7) is uer{bounded by the otimal value E = P D(i) 0:5 0:5 Si(f) df for the II biorthogonal case [], and tends to this limit as. The erformance of FI SE lter banks converges to (7) as the lter length tends to innity. As discussed in [, 3], P lter banks do not enjoy a similar roerty: FI lter banks of arbitrary length must satisfy the constraint det H(f), and the erformance of these lters does not converge to that of II lter banks (for which the constraint det H(f) is not alicable). Even at high bit rates, FI SE lter banks of sucient length can vastly outerform FI biorthogonal lter banks of arbitrary length. While conditions (5),(6) for otimality of the lter bank aly for arbitrary f ig, the otimal f ig do satisfy (). 3. IPOTANT SPECIAL CASES Consider the classical model D( i) = i for the rate{ distortion function with otimal bit allocation. Then () yields the closed{form solution i / i k h ik. (Just before going to ress, we discovered the aer [7] which derives the otimal set of re{ and ostlters for a single{channel roblem. However, their framework aarently does not lend itself to joint otimization of lter banks and bit allocation [7,. 04].) The resulting distortions i k hik D( i) are identical for all channels. The exected SE (3) is then E(H; H) = (HSH y ) ii ( H y H) ii = T r ( HH I ) S ( HH I ) y : (8) For the exonential D( i) model and otimal bit allocation, the general exressions (6),(7) are secialized in Theorem 3. below. Analytical exressions for the otimal lters are given in terms of constants fi g which are solutions to a nonlinear system. If it is known that F i =, then the only constant to be solved for is E q. Theorem 3. The lters that minimize the SE (8) for the system in Fig. are given by (5) with roduct lters Here i = P i(f) = max 0; Eq= i Si(f) ; 0 i < : (9) s Si(f) df Si(f) df E qjf i j; (0) are the normalized variances of the subband signals (using c i = ), Y = E q = i ; () and F i = n f j S i(f) > Eq i o. The SE for these lters
4 is given by E(H; H) = E q Eq i jf i j S i(f) df: () Note that according to (0), there exist two ossible candidates for the solution i in each channel. Each of these solutions is a local extremum for (8). The otimal solution is the one that minimizes (8). For bit rates that are high enough, each sign in (0) must be ositive. {Channel Case Substantial simlications arise if the number of channels is =. The roduct lters are given by P 0(f) = max 0; S0(f) P (f) = max 0; 0 S(f) ; : (3) The otimal lters are again given by (5). Here the normalized variances of the subband signals are (using c i = ) 0 = = S0(f) df jf 0 j S(f) df ( ) jf 0 jjf j S(f) df jf j S0(f) df ( : (4) ) jf 0 jjf j The SE corresonding to these lters is given by E = 0 ( ) (jf 0 j 4 0jF j 4 ) ; S i(f) df: (5) (4) is a nonlinear system in 0;. But if it is known that F =F = 0, (4) (5) no longer contains unknowns. 4. SIULATION ESULTS An A() rocess with correlation coecient r = 0:8 in the two{band case has been considered to illustrate the analysis above. In this case, the PCFB is the traditional lter bank with ideal low and high ass lters. The otimization roblem (8) for the re{ and ostlters has been solved for various rates and the results have been comared with otimal II biorthogonal lter banks and otimal unconstrained{length FI biorthogonal lter banks [, 3]. At all bit rates, F i =. For = :76, the bit rate in the high{ass channel becomes zero, in which case the criterion (8) becomes clearly invalid. The erformance of the otimal unconstrained{length SE lter banks is very close to otimal II biorthogonal lter banks at very high rates, but imrovements become quite signicant as decreases (Fig. 3). At very high rates, the otimal lter banks are close to the (P) II biorthogonal solution. At lower bit rates, the lters dier signicantly from those otimal P lters. Frequency resonses are shown in Fig. 4 for an A() rocess with correlation coecient r = 0:8, and rate = :9. The scaling factors c 0 and c for all three lter banks have been chosen so that the frequency resonses are the same at f = 0 and at f = 0:5. The remarks at the end of Sec. motivated us to investigate the constrained{length version of this design. A simle rectangular windowing technique was used to design constrained{length FI{SE lterbanks from the otimum unconstrained{length solution. As shown in Fig. 5, the results are excellent at medium bit rates. At = :9, the length{63 FI{SE lter bank outerforms otimal FI biorthogonal lter banks of arbitrary length, and the length{03 FI{SE lter bank outerforms otimal II biorthogonal lter banks. Similar advantages hold at arbitrarily high bit rates, but longer FI lters are needed to break the erformance bounds for FI and II biorthogonal lters. enements in the FI{SE lter design method are likely to yield further imrovements. 5. EFEENCES [] K. Gosse and P. Duhamel, \Perfect{econstruction versus SE Filter Banks in Source Coding," IEEE Trans. SP, Vol. 45, No. 9,. 88 0, Se [] P. oulin,. Anitescu and K. amchandran, \Theory of ate{distortion{otimal, Constrained Filter Banks{Alication to II and FI Biorthogonal Designs," submitted to IEEE Trans. Sig. Proc., 998. [3] P. oulin, K. amchandran and. Anitescu, \Asymtotic Performance of Subband Coders Using Constrained, Signal{Adated FI Filter Banks," Proc. 3nd CISS Conference, Princeton, NJ, arch 998. [4]. Unser, \An Extension of the Karhunen-Loeve Transform for Wavelets and Perfect{econstruction Filterbanks," SPIE Vol. 034, , 993. [5]. K. Tsatsanis and G. B. Giannakis, \Princial Comonent Filter Banks for Otimal ultiresolution Analysis," IEEE SP, Vol. 43, , Aug [6] P.P. Vaidyanathan, \Theory of Otimal Orthonormal Subband Coders," IEEE Trans. Sig. Proc., Vol. 46, No. 6, , June 998. [7] J. Tuqan and P.P. Vaidyanathan, \Statistically Otimum Pre{ and Postltering in uantization," IEEE CAS II, Vol. 44, No., , Dec ean Squared Error (db) Bit rate Figure 3: A() rocess with correlation coecient r = 0:8: Otimum values of SE as a function of overall bit rate for dierent lter design methods. Solid line: II biorthogonal (half-whitening) lters [],[3]; Dotted line: FI biorthogonal lters [],[3]; Dashed line: SE lters.
5 Analysis lowass, A rocess, r = Analysis highass, A rocess, r = magnitude magnitude frequency frequency Figure 4: Frequency resonses of otimal, unconstrained length analysis lters in two-band case, for A() rocess at bit rate = :9. Solid line: II biorthogonal (halfwhitening) lters [],[3]; Dotted line: FI biorthogonal lters [],[3]; Dashed line: SE lters. 3 ean Squared Error (db) FI SE filter length Figure 5: A() rocess, = :9: Convergence of SE (solid curve) for FI{SE lterbanks to -7. db limit (dashed line) for unconstrained{length SE lter banks. Comare with SEs for II biorthogonal lter banks (dash{dotted line, db), and unconstrained{length FI biorthogonal lter banks (dotted line, -6.6 db).
Generalized Coiflets: A New Family of Orthonormal Wavelets
Generalized Coiflets A New Family of Orthonormal Wavelets Dong Wei, Alan C Bovik, and Brian L Evans Laboratory for Image and Video Engineering Deartment of Electrical and Comuter Engineering The University
More informationECE 534 Information Theory - Midterm 2
ECE 534 Information Theory - Midterm Nov.4, 009. 3:30-4:45 in LH03. You will be given the full class time: 75 minutes. Use it wisely! Many of the roblems have short answers; try to find shortcuts. You
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationImproved Capacity Bounds for the Binary Energy Harvesting Channel
Imroved Caacity Bounds for the Binary Energy Harvesting Channel Kaya Tutuncuoglu 1, Omur Ozel 2, Aylin Yener 1, and Sennur Ulukus 2 1 Deartment of Electrical Engineering, The Pennsylvania State University,
More informationFor q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i
Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:
More informationThe analysis and representation of random signals
The analysis and reresentation of random signals Bruno TOÉSNI Bruno.Torresani@cmi.univ-mrs.fr B. Torrésani LTP Université de Provence.1/30 Outline 1. andom signals Introduction The Karhunen-Loève Basis
More informationCorrespondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R.
1 Corresondence Between Fractal-Wavelet Transforms and Iterated Function Systems With Grey Level Mas F. Mendivil and E.R. Vrscay Deartment of Alied Mathematics Faculty of Mathematics University of Waterloo
More informationCoding Along Hermite Polynomials for Gaussian Noise Channels
Coding Along Hermite olynomials for Gaussian Noise Channels Emmanuel A. Abbe IG, EFL Lausanne, 1015 CH Email: emmanuel.abbe@efl.ch Lizhong Zheng LIDS, MIT Cambridge, MA 0139 Email: lizhong@mit.edu Abstract
More informationCOMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS
NCCI 1 -National Conference on Comutational Instrumentation CSIO Chandigarh, INDIA, 19- March 1 COMPARISON OF VARIOUS OPIMIZAION ECHNIQUES FOR DESIGN FIR DIGIAL FILERS Amanjeet Panghal 1, Nitin Mittal,Devender
More informationConvolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code.
Convolutional Codes Goals Lecture Be able to encode using a convolutional code Be able to decode a convolutional code received over a binary symmetric channel or an additive white Gaussian channel Convolutional
More informationSampling and Distortion Tradeoffs for Bandlimited Periodic Signals
Samling and Distortion radeoffs for Bandlimited Periodic Signals Elaheh ohammadi and Farokh arvasti Advanced Communications Research Institute ACRI Deartment of Electrical Engineering Sharif University
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More informationAI*IA 2003 Fusion of Multiple Pattern Classifiers PART III
AI*IA 23 Fusion of Multile Pattern Classifiers PART III AI*IA 23 Tutorial on Fusion of Multile Pattern Classifiers by F. Roli 49 Methods for fusing multile classifiers Methods for fusing multile classifiers
More informationConvex Optimization methods for Computing Channel Capacity
Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem
More informationA Simple Weight Decay Can Improve. Abstract. It has been observed in numerical simulations that a weight decay can improve
In Advances in Neural Information Processing Systems 4, J.E. Moody, S.J. Hanson and R.P. Limann, eds. Morgan Kaumann Publishers, San Mateo CA, 1995,. 950{957. A Simle Weight Decay Can Imrove Generalization
More informationAn Analysis of Reliable Classifiers through ROC Isometrics
An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit
More informationEstimation of the large covariance matrix with two-step monotone missing data
Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo
More informationGenetic Algorithms, Selection Schemes, and the Varying Eects of Noise. IlliGAL Report No November Department of General Engineering
Genetic Algorithms, Selection Schemes, and the Varying Eects of Noise Brad L. Miller Det. of Comuter Science University of Illinois at Urbana-Chamaign David E. Goldberg Det. of General Engineering University
More informationState Estimation with ARMarkov Models
Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,
More informationMinimax Design of Nonnegative Finite Impulse Response Filters
Minimax Design of Nonnegative Finite Imulse Resonse Filters Xiaoing Lai, Anke Xue Institute of Information and Control Hangzhou Dianzi University Hangzhou, 3118 China e-mail: laix@hdu.edu.cn; akxue@hdu.edu.cn
More informationMULTIRATE SYSTEMS AND FILTER BANKS
T. Saramäki and R. Bregovi, ultirate Systems and Filter Banks, Chater in ultirate Systems: Design T. Saramäki and R. Bregovi, ultirate Systems and Filter Banks, Chater in ultirate Systems: Design ULTIRATE
More informationThe non-stochastic multi-armed bandit problem
Submitted for journal ublication. The non-stochastic multi-armed bandit roblem Peter Auer Institute for Theoretical Comuter Science Graz University of Technology A-8010 Graz (Austria) auer@igi.tu-graz.ac.at
More informationIterative Methods for Designing Orthogonal and Biorthogonal Two-channel FIR Filter Banks with Regularities
R. Bregović and T. Saramäi, Iterative methods for designing orthogonal and biorthogonal two-channel FIR filter bans with regularities, Proc. Of Int. Worsho on Sectral Transforms and Logic Design for Future
More informationUncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning
TNN-2009-P-1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment
More informationAdditive results for the generalized Drazin inverse in a Banach algebra
Additive results for the generalized Drazin inverse in a Banach algebra Dragana S. Cvetković-Ilić Dragan S. Djordjević and Yimin Wei* Abstract In this aer we investigate additive roerties of the generalized
More information1 1 c (a) 1 (b) 1 Figure 1: (a) First ath followed by salesman in the stris method. (b) Alternative ath. 4. D = distance travelled closing the loo. Th
18.415/6.854 Advanced Algorithms ovember 7, 1996 Euclidean TSP (art I) Lecturer: Michel X. Goemans MIT These notes are based on scribe notes by Marios Paaefthymiou and Mike Klugerman. 1 Euclidean TSP Consider
More informationLinear diophantine equations for discrete tomography
Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,
More informationPositive Definite Uncertain Homogeneous Matrix Polynomials: Analysis and Application
BULGARIA ACADEMY OF SCIECES CYBEREICS AD IFORMAIO ECHOLOGIES Volume 9 o 3 Sofia 009 Positive Definite Uncertain Homogeneous Matrix Polynomials: Analysis and Alication Svetoslav Savov Institute of Information
More informationPositive decomposition of transfer functions with multiple poles
Positive decomosition of transfer functions with multile oles Béla Nagy 1, Máté Matolcsi 2, and Márta Szilvási 1 Deartment of Analysis, Technical University of Budaest (BME), H-1111, Budaest, Egry J. u.
More informationIntroduction Consider a set of jobs that are created in an on-line fashion and should be assigned to disks. Each job has a weight which is the frequen
Ancient and new algorithms for load balancing in the L norm Adi Avidor Yossi Azar y Jir Sgall z July 7, 997 Abstract We consider the on-line load balancing roblem where there are m identical machines (servers)
More informationPrincipal Components Analysis and Unsupervised Hebbian Learning
Princial Comonents Analysis and Unsuervised Hebbian Learning Robert Jacobs Deartment of Brain & Cognitive Sciences University of Rochester Rochester, NY 1467, USA August 8, 008 Reference: Much of the material
More information2 K. ENTACHER 2 Generalized Haar function systems In the following we x an arbitrary integer base b 2. For the notations and denitions of generalized
BIT 38 :2 (998), 283{292. QUASI-MONTE CARLO METHODS FOR NUMERICAL INTEGRATION OF MULTIVARIATE HAAR SERIES II KARL ENTACHER y Deartment of Mathematics, University of Salzburg, Hellbrunnerstr. 34 A-52 Salzburg,
More informationResearch of power plant parameter based on the Principal Component Analysis method
Research of ower lant arameter based on the Princial Comonent Analysis method Yang Yang *a, Di Zhang b a b School of Engineering, Bohai University, Liaoning Jinzhou, 3; Liaoning Datang international Jinzhou
More informationsubstantial literature on emirical likelihood indicating that it is widely viewed as a desirable and natural aroach to statistical inference in a vari
Condence tubes for multile quantile lots via emirical likelihood John H.J. Einmahl Eindhoven University of Technology Ian W. McKeague Florida State University May 7, 998 Abstract The nonarametric emirical
More informationMODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL
Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management
More informationFilterbank Optimization with Convex Objectives and the Optimality of Principal Component Forms
100 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 49, NO. 1, JANUARY 2001 Filterbank Optimization with Convex Objectives and the Optimality of Principal Component Forms Sony Akkarakaran, Student Member,
More informationSupplementary Materials for Robust Estimation of the False Discovery Rate
Sulementary Materials for Robust Estimation of the False Discovery Rate Stan Pounds and Cheng Cheng This sulemental contains roofs regarding theoretical roerties of the roosed method (Section S1), rovides
More informationElements of Asymptotic Theory. James L. Powell Department of Economics University of California, Berkeley
Elements of Asymtotic Theory James L. Powell Deartment of Economics University of California, Berkeley Objectives of Asymtotic Theory While exact results are available for, say, the distribution of the
More informationUniversal Finite Memory Coding of Binary Sequences
Deartment of Electrical Engineering Systems Universal Finite Memory Coding of Binary Sequences Thesis submitted towards the degree of Master of Science in Electrical and Electronic Engineering in Tel-Aviv
More informationTraining sequence optimization for frequency selective channels with MAP equalization
532 ISCCSP 2008, Malta, 12-14 March 2008 raining sequence otimization for frequency selective channels with MAP equalization Imed Hadj Kacem, Noura Sellami Laboratoire LEI ENIS, Route Sokra km 35 BP 3038
More informationThe Noise Power Ratio - Theory and ADC Testing
The Noise Power Ratio - Theory and ADC Testing FH Irons, KJ Riley, and DM Hummels Abstract This aer develos theory behind the noise ower ratio (NPR) testing of ADCs. A mid-riser formulation is used for
More informationElements of Asymptotic Theory. James L. Powell Department of Economics University of California, Berkeley
Elements of Asymtotic Theory James L. Powell Deartment of Economics University of California, Berkeley Objectives of Asymtotic Theory While exact results are available for, say, the distribution of the
More informations v 0 q 0 v 1 q 1 v 2 (q 2) v 3 q 3 v 4
Discrete Adative Transmission for Fading Channels Lang Lin Λ, Roy D. Yates, Predrag Sasojevic WINLAB, Rutgers University 7 Brett Rd., NJ- fllin, ryates, sasojevg@winlab.rutgers.edu Abstract In this work
More informationTowards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK
Towards understanding the Lorenz curve using the Uniform distribution Chris J. Stehens Newcastle City Council, Newcastle uon Tyne, UK (For the Gini-Lorenz Conference, University of Siena, Italy, May 2005)
More informationCombining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)
Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment
More informationOn Doob s Maximal Inequality for Brownian Motion
Stochastic Process. Al. Vol. 69, No., 997, (-5) Research Reort No. 337, 995, Det. Theoret. Statist. Aarhus On Doob s Maximal Inequality for Brownian Motion S. E. GRAVERSEN and G. PESKIR If B = (B t ) t
More informationDistributed Rule-Based Inference in the Presence of Redundant Information
istribution Statement : roved for ublic release; distribution is unlimited. istributed Rule-ased Inference in the Presence of Redundant Information June 8, 004 William J. Farrell III Lockheed Martin dvanced
More informationNumerical Linear Algebra
Numerical Linear Algebra Numerous alications in statistics, articularly in the fitting of linear models. Notation and conventions: Elements of a matrix A are denoted by a ij, where i indexes the rows and
More informationQuick Detection of Changes in Trac Statistics: Ivy Hsu and Jean Walrand 2. Department of EECS, University of California, Berkeley, CA 94720
Quic Detection of Changes in Trac Statistics: Alication to Variable Rate Comression Ivy Hsu and Jean Walrand 2 Deartment of EECS, University of California, Bereley, CA 94720 resented at the 32nd Annual
More informationResearch Article An iterative Algorithm for Hemicontractive Mappings in Banach Spaces
Abstract and Alied Analysis Volume 2012, Article ID 264103, 11 ages doi:10.1155/2012/264103 Research Article An iterative Algorithm for Hemicontractive Maings in Banach Saces Youli Yu, 1 Zhitao Wu, 2 and
More informationNONLINEAR OPTIMIZATION WITH CONVEX CONSTRAINTS. The Goldstein-Levitin-Polyak algorithm
- (23) NLP - NONLINEAR OPTIMIZATION WITH CONVEX CONSTRAINTS The Goldstein-Levitin-Polya algorithm We consider an algorithm for solving the otimization roblem under convex constraints. Although the convexity
More informationOn Code Design for Simultaneous Energy and Information Transfer
On Code Design for Simultaneous Energy and Information Transfer Anshoo Tandon Electrical and Comuter Engineering National University of Singaore Email: anshoo@nus.edu.sg Mehul Motani Electrical and Comuter
More informationThe Properties of Pure Diagonal Bilinear Models
American Journal of Mathematics and Statistics 016, 6(4): 139-144 DOI: 10.593/j.ajms.0160604.01 The roerties of ure Diagonal Bilinear Models C. O. Omekara Deartment of Statistics, Michael Okara University
More informationUse of Transformations and the Repeated Statement in PROC GLM in SAS Ed Stanek
Use of Transformations and the Reeated Statement in PROC GLM in SAS Ed Stanek Introduction We describe how the Reeated Statement in PROC GLM in SAS transforms the data to rovide tests of hyotheses of interest.
More information2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S.
-D Analysis for Iterative Learning Controller for Discrete-ime Systems With Variable Initial Conditions Yong FANG, and ommy W. S. Chow Abstract In this aer, an iterative learning controller alying to linear
More informationGeneral Linear Model Introduction, Classes of Linear models and Estimation
Stat 740 General Linear Model Introduction, Classes of Linear models and Estimation An aim of scientific enquiry: To describe or to discover relationshis among events (variables) in the controlled (laboratory)
More informationRecursive Estimation of the Preisach Density function for a Smart Actuator
Recursive Estimation of the Preisach Density function for a Smart Actuator Ram V. Iyer Deartment of Mathematics and Statistics, Texas Tech University, Lubbock, TX 7949-142. ABSTRACT The Preisach oerator
More informationOn Wald-Type Optimal Stopping for Brownian Motion
J Al Probab Vol 34, No 1, 1997, (66-73) Prerint Ser No 1, 1994, Math Inst Aarhus On Wald-Tye Otimal Stoing for Brownian Motion S RAVRSN and PSKIR The solution is resented to all otimal stoing roblems of
More informationSpectral Clustering based on the graph p-laplacian
Sectral Clustering based on the grah -Lalacian Thomas Bühler tb@cs.uni-sb.de Matthias Hein hein@cs.uni-sb.de Saarland University Comuter Science Deartment Camus E 663 Saarbrücken Germany Abstract We resent
More informationParticipation Factors. However, it does not give the influence of each state on the mode.
Particiation Factors he mode shae, as indicated by the right eigenvector, gives the relative hase of each state in a articular mode. However, it does not give the influence of each state on the mode. We
More informationRecovering preferences in the household production framework: The case of averting behavior
Udo Ebert Recovering references in the household roduction framework: The case of averting behavior February 2002 * Address: Deartment of Economics, University of Oldenburg, D-26 Oldenburg, ermany Tel.:
More informationFrequency-Domain Design of Overcomplete. Rational-Dilation Wavelet Transforms
Frequency-Domain Design of Overcomlete 1 Rational-Dilation Wavelet Transforms İlker Bayram and Ivan W. Selesnick Polytechnic Institute of New York University Brooklyn, NY 1121 ibayra1@students.oly.edu,
More informationRandomly Weighted Series of Contractions in Hilbert Spaces
Math. Scand. Vol. 79, o. 2, 996, (263-282) Prerint Ser. o. 5, 994, Math. Inst. Aarhus. Introduction Randomly Weighted Series of Contractions in Hilbert Saces G. PESKIR, D. SCHEIDER, M. WEBER Conditions
More informationFeedback-error control
Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller
More informationMaxisets for μ-thresholding rules
Test 008 7: 33 349 DOI 0.007/s749-006-0035-5 ORIGINAL PAPER Maxisets for μ-thresholding rules Florent Autin Received: 3 January 005 / Acceted: 8 June 006 / Published online: March 007 Sociedad de Estadística
More information44 CHAPTER 5. PERFORMACE OF SMALL SIGAL SETS In digital communications, we usually focus entirely on the code, and do not care what encoding ma is use
Performance of small signal sets Chater 5 In this chater, we show how to estimate the erformance of small-to-moderate-sized signal constellations on the discrete-time AWG channel. With equirobable signal
More informationShadow Computing: An Energy-Aware Fault Tolerant Computing Model
Shadow Comuting: An Energy-Aware Fault Tolerant Comuting Model Bryan Mills, Taieb Znati, Rami Melhem Deartment of Comuter Science University of Pittsburgh (bmills, znati, melhem)@cs.itt.edu Index Terms
More informationE-companion to A risk- and ambiguity-averse extension of the max-min newsvendor order formula
e-comanion to Han Du and Zuluaga: Etension of Scarf s ma-min order formula ec E-comanion to A risk- and ambiguity-averse etension of the ma-min newsvendor order formula Qiaoming Han School of Mathematics
More informationA Qualitative Event-based Approach to Multiple Fault Diagnosis in Continuous Systems using Structural Model Decomposition
A Qualitative Event-based Aroach to Multile Fault Diagnosis in Continuous Systems using Structural Model Decomosition Matthew J. Daigle a,,, Anibal Bregon b,, Xenofon Koutsoukos c, Gautam Biswas c, Belarmino
More informationAsymptotically Optimal Simulation Allocation under Dependent Sampling
Asymtotically Otimal Simulation Allocation under Deendent Samling Xiaoing Xiong The Robert H. Smith School of Business, University of Maryland, College Park, MD 20742-1815, USA, xiaoingx@yahoo.com Sandee
More informationBeyond Worst-Case Reconstruction in Deterministic Compressed Sensing
Beyond Worst-Case Reconstruction in Deterministic Comressed Sensing Sina Jafarour, ember, IEEE, arco F Duarte, ember, IEEE, and Robert Calderbank, Fellow, IEEE Abstract The role of random measurement in
More informationUniformly best wavenumber approximations by spatial central difference operators: An initial investigation
Uniformly best wavenumber aroximations by satial central difference oerators: An initial investigation Vitor Linders and Jan Nordström Abstract A characterisation theorem for best uniform wavenumber aroximations
More informationEvaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models
Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu
More informationMean Square Stability Analysis of Sampled-Data Supervisory Control Systems
17th IEEE International Conference on Control Alications Part of 28 IEEE Multi-conference on Systems and Control San Antonio, Texas, USA, Setember 3-5, 28 WeA21 Mean Square Stability Analysis of Samled-Data
More informationA Note on Guaranteed Sparse Recovery via l 1 -Minimization
A Note on Guaranteed Sarse Recovery via l -Minimization Simon Foucart, Université Pierre et Marie Curie Abstract It is roved that every s-sarse vector x C N can be recovered from the measurement vector
More informationGOOD MODELS FOR CUBIC SURFACES. 1. Introduction
GOOD MODELS FOR CUBIC SURFACES ANDREAS-STEPHAN ELSENHANS Abstract. This article describes an algorithm for finding a model of a hyersurface with small coefficients. It is shown that the aroach works in
More informationA Social Welfare Optimal Sequential Allocation Procedure
A Social Welfare Otimal Sequential Allocation Procedure Thomas Kalinowsi Universität Rostoc, Germany Nina Narodytsa and Toby Walsh NICTA and UNSW, Australia May 2, 201 Abstract We consider a simle sequential
More informationOn the capacity of the general trapdoor channel with feedback
On the caacity of the general tradoor channel with feedback Jui Wu and Achilleas Anastasooulos Electrical Engineering and Comuter Science Deartment University of Michigan Ann Arbor, MI, 48109-1 email:
More informationWolfgang POESSNECKER and Ulrich GROSS*
Proceedings of the Asian Thermohysical Proerties onference -4 August, 007, Fukuoka, Jaan Paer No. 0 A QUASI-STEADY YLINDER METHOD FOR THE SIMULTANEOUS DETERMINATION OF HEAT APAITY, THERMAL ONDUTIVITY AND
More informationIntroduction to MVC. least common denominator of all non-identical-zero minors of all order of G(s). Example: The minor of order 2: 1 2 ( s 1)
Introduction to MVC Definition---Proerness and strictly roerness A system G(s) is roer if all its elements { gij ( s)} are roer, and strictly roer if all its elements are strictly roer. Definition---Causal
More informationCSC165H, Mathematical expression and reasoning for computer science week 12
CSC165H, Mathematical exression and reasoning for comuter science week 1 nd December 005 Gary Baumgartner and Danny Hea hea@cs.toronto.edu SF4306A 416-978-5899 htt//www.cs.toronto.edu/~hea/165/s005/index.shtml
More informationSome Unitary Space Time Codes From Sphere Packing Theory With Optimal Diversity Product of Code Size
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 5, NO., DECEMBER 4 336 Some Unitary Sace Time Codes From Shere Packing Theory With Otimal Diversity Product of Code Size Haiquan Wang, Genyuan Wang, and Xiang-Gen
More informationMicroeconomics Fall 2017 Problem set 1: Possible answers
Microeconomics Fall 07 Problem set Possible answers Each answer resents only one way of solving the roblem. Other right answers are ossible and welcome. Exercise For each of the following roerties, draw
More informationAn Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem
An Ant Colony Otimization Aroach to the Probabilistic Traveling Salesman Problem Leonora Bianchi 1, Luca Maria Gambardella 1, and Marco Dorigo 2 1 IDSIA, Strada Cantonale Galleria 2, CH-6928 Manno, Switzerland
More informationFrequency-Weighted Robust Fault Reconstruction Using a Sliding Mode Observer
Frequency-Weighted Robust Fault Reconstruction Using a Sliding Mode Observer C.P. an + F. Crusca # M. Aldeen * + School of Engineering, Monash University Malaysia, 2 Jalan Kolej, Bandar Sunway, 4650 Petaling,
More informationCharacterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations
Characterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations PINAR KORKMAZ, BILGE E. S. AKGUL and KRISHNA V. PALEM Georgia Institute of
More informationA Dual-Tree Rational-Dilation Complex Wavelet Transform
1 A Dual-Tree Rational-Dilation Comlex Wavelet Transform İlker Bayram and Ivan W. Selesnick Abstract In this corresondence, we introduce a dual-tree rational-dilation comlex wavelet transform for oscillatory
More informationInterpolatory And Orthonormal Trigonometric. Wavelets. Jurgen Prestin. and Kathi Selig
Interolatory And Orthonormal Trigonometric Wavelets Jurgen Prestin and Kathi Selig Abstract. The aim of this aer is the detailed investigation of trigonometric olynomial saces as a tool for aroximation
More informationAN ALGORITHM FOR MATRIX EXTENSION AND WAVELET CONSTRUCTION W. LAWTON, S. L. LEE AND ZUOWEI SHEN Abstract. This paper gives a practical method of exten
AN ALGORITHM FOR MATRIX EXTENSION AND WAVELET ONSTRUTION W. LAWTON, S. L. LEE AND ZUOWEI SHEN Abstract. This aer gives a ractical method of extending an nr matrix P (z), r n, with Laurent olynomial entries
More informationAutoregressive (AR) Modelling
Autoregressive (AR) Modelling A. Uses of AR Modelling () Alications (a) Seech recognition and coding (storage) (b) System identification (c) Modelling and recognition of sonar, radar, geohysical signals
More informationCONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. III Stability Theory - Peter C. Müller
STABILITY THEORY Peter C. Müller University of Wuertal, Germany Keywords: Asymtotic stability, Eonential stability, Linearization, Linear systems, Lyaunov equation, Lyaunov function, Lyaunov stability,
More informationInteractive Hypothesis Testing Against Independence
013 IEEE International Symosium on Information Theory Interactive Hyothesis Testing Against Indeendence Yu Xiang and Young-Han Kim Deartment of Electrical and Comuter Engineering University of California,
More informationCOMMUNICATION BETWEEN SHAREHOLDERS 1
COMMUNICATION BTWN SHARHOLDRS 1 A B. O A : A D Lemma B.1. U to µ Z r 2 σ2 Z + σ2 X 2r ω 2 an additive constant that does not deend on a or θ, the agents ayoffs can be written as: 2r rθa ω2 + θ µ Y rcov
More informationOn the asymptotic sizes of subset Anderson-Rubin and Lagrange multiplier tests in linear instrumental variables regression
On the asymtotic sizes of subset Anderson-Rubin and Lagrange multilier tests in linear instrumental variables regression Patrik Guggenberger Frank Kleibergeny Sohocles Mavroeidisz Linchun Chen\ June 22
More informationA Spectral-Factorization Combinatorial-Search Algorithm Unifying the Systematized Collection of Daubechies Wavelets. Abstract.
A Sectral-Factorization Combinatorial-Search Algorithm Unifying the Systematized Collection of Daubechies Wavelets Carl Taswell UCSD School of Medicine, La Jolla, CA 92093-0603 Comutational Toolsmiths,
More informationKeywords: Vocal Tract; Lattice model; Reflection coefficients; Linear Prediction; Levinson algorithm.
Volume 3, Issue 6, June 213 ISSN: 2277 128X International Journal of Advanced Research in Comuter Science and Software Engineering Research Paer Available online at: www.ijarcsse.com Lattice Filter Model
More informationStatics and dynamics: some elementary concepts
1 Statics and dynamics: some elementary concets Dynamics is the study of the movement through time of variables such as heartbeat, temerature, secies oulation, voltage, roduction, emloyment, rices and
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationNotes on duality in second order and -order cone otimization E. D. Andersen Λ, C. Roos y, and T. Terlaky z Aril 6, 000 Abstract Recently, the so-calle
McMaster University Advanced Otimization Laboratory Title: Notes on duality in second order and -order cone otimization Author: Erling D. Andersen, Cornelis Roos and Tamás Terlaky AdvOl-Reort No. 000/8
More informationA generalization of Amdahl's law and relative conditions of parallelism
A generalization of Amdahl's law and relative conditions of arallelism Author: Gianluca Argentini, New Technologies and Models, Riello Grou, Legnago (VR), Italy. E-mail: gianluca.argentini@riellogrou.com
More information