Switched Quasi-Logarithmic Quantizer with Golomb Rice Coding
|
|
- June Shanna Lester
- 5 years ago
- Views:
Transcription
1 Swtched Quas-Logarthmc Quantzer wth Golomb Rce Codng Nkola Vucc 1, Zoran Perc 1, Mlan Dncc 1 1 Faculty of Electronc Engneerng, Unversty of Ns, Aleksandar Medvedev St. 14, Ns, Serba zoran.perc@elfak.n.ac.rs 1 Abstract Ths paper proposes a model of swtched quaslogarthmc quantzer for speech sgnal based on G.711 standard wth usage of Golomb-Rce (GR) codng. In order to acheve better performances a method wth swtched quantzer s appled. Varance range s splt nto quantzers and for each of them a separate quantzer s desgned,.e. the support regon s determned. Optmzaton of the support regon and choce of the parameter μ s done n order to obtan a quantzer that obeys G.71 standard and gves mnmal average bt rate. Every quantzer wthn the varance range has own model wth a two-stage coder. Two stages are ntroduced wth purpose to reduce the bt rate, whereby GR code plays ts role as Varable Length Code (VLC). The frst stage uses a GR coder for codng segments of the quantzer s support regon, whereas the second stage apples the codng method wth fxed code lengths for codng cells wthn a segment. GR has smpler and cheaper hardware realzaton than other VLC codes, Huffman s for nstance, wth very satsfyng results regardng qualty of quantzed sgnal. Index Terms Quantzaton; speech processng; speech codng; sgnal to nose rato; Golomb-Rce codng. I. INTRODUCTION The G.711 standard (G.711 quantzer) defnes fxed length codng that provdes hgh qualty of reconstructed sgnal for fxed bt rates [1]. The G standard defnes the G.711 quantzer wth varable length codes (VLC) and assumes the usage of one of many codng technques whereby the choce s made upon the nput sgnal s characterstcs []. Ths standard does not examne swtched quantzers, and therefore our motvaton s to desgn a swtched quantzer wth some VLC. Golomb-Rce (GR) codng method [3], [4], as well as Huffman s, belongs to the group of VLC technques. Some VLC scalar quantzers wth Huffman s code and smlar ones are analysed n [5] [9], whereby [8] studes VLC for lossless compresson. GR codng s smpler than Huffman, although the latter s by custom used for smaller code books. We examne here a code book wth N = 56 levels, thus GR code s better soluton for our model. The G.71 standard gves a lower lmt for the sgnal to quantzaton nose rato (SQNR) of the transmtted speech Manuscrpt receved 14 December, 016; accepted 6 Aprl, 017. Ths work was supported by the Mnstry of Educaton, Scence and Technologcal Development of the Republc of Serba under the project TR sgnal dependng on nput varances [10], [11]. Paper [1] proposes fxed quas-logarthmc quantzer wth GR codng. In paper [13] swtched quantzers are examned and adaptve quantzers n [14]. Our motvaton s to make an analyss of dfferent swtched quantzers wth -law of compresson and GR codng, as well as to determne swtched quantzer whch satsfes G.71 standard and has the lowest possble average bt rate. II. SWITCHED QUASI LOGARITHMIC QUANTIZER WITH GOLOMB RICE CODING A. Swtched Quas Logarthmc Quantzer As analysed n [13] the swtched quantzer provdes better performances than the quantzer desgned accordng to the G.711 standard. The dea of ntroducng swtched quantzer for speech sgnal transmsson brngs dvson of observed varance range L from 0 db to 0 db nto Ng equally wde quantzers. Sgnal s varance σ s defned as [ ] 10log db ref, whereby σ ref = 1. Each quantzer s labelled wth ndex, whereby = 1,..., Ng. Wth known sgnal s varance σ the matchng quantzer s unambguously determned. For every quantzer wthn the L range we try to fnd the parameters that lead to the achevement of optmal results. Addtonal nformaton about the quantzer, for a frame of sze M, s transmtted to the recever va log N g bts per frame wth M samples, where M = 10,180,40. Compresson characterstc of proposed model has a pecewse lnear approxmaton of the μ-law characterstc, where + 1 marks a rato between the bggest and the smallest quant for non-lnear logarthmc quantzer [10], whereby apples 1, (1) where N. The compresson functon wth -law of compresson [10] s max ln 1 x x c x xmax sgn x. ln 1 It s very mportant to notce that parameters and Ng are () 81
2 gven for the entre range L, whereas support regon s dfferent for every quantzer and therefore we ntroduce the notaton x max. The support regon [x max, x max ] of ths symmetrc quantzer s dvded nto l = 16 segments whose thresholds x are defned as / L xmax x 1 1, where 0,..., l. The symmetry of proposed quantzer allows us to develop further examnaton only on segments from postve part of support regon. Insde the segment quantzaton s unform and the step sze of quantzaton Δ s x1 x / l / l xmax (3) 1, (4) t t 0,..., l 1. Step szes of consecutve segments have the followng rato 1 / l l 1. Decson levels x,j whch are equally dstanced wthn -th segment can be calculated n ths way, j, (5) x x j (6) where 0,..., l 1, j 1,..., t 1. The borderlne cases are defned as well: x x,0 x,, t x1. All the samples between x,j-1 and x,j are represented wth the representaton level y,j where 0,..., l 1, j 1,..., t. (7) j 1 y, j x, (8) Parameters that have an nfluence to performances are: the parameter of the - compresson law [10], the number of swtched quantzers Ng, as well as the support regons x max. Our goal s actually to determne each x max, for = 1,..., Ng and wth the gven values of and Ng, wthn the range L. All support regons x max wll nfluence quantzer s performances, among whch for us the most mportant are: SQNR and the average bt rate R. The desgn of the quantzer often requres smultaneous fulflment of two opposng crtera: maxmal qualty of sgnal (SQNR) and mnmal average bt rate. Hereby we decded to develop a quantzer whose performances fulfl the G.71 standard [11] along wth as small as possble R when usng the VLC codng. Our goal s to mnmze the average bt rate, snce the dfference between the acheved bt rate and the one proposed by G.711 standard presents an mportant savng n sgnal transfer. The lower lmt of SQNR s condtoned by G.71 standard, and therefore we try to fnd the value of x max whch satsfes ths standard and gves mnmal possble value of R. B. Two-Stage Coder Havng n mnd that the support regon s splt nto l = 16 segments and each segment s splt nto t=16 cells, we need to fnd an effcent way to code ths nformaton. The G.711 coder as shown n Fg. 1 codes as follows: the whole regon s symmetrcally splt nto two parts, postve and negatve; therefore the poston of the segment s coded wth one bt ( 0 or 1 ). Then each of l=8 segments s coded wth 3 bts (from 000 to 111 ) and each of t=16 cells s coded wth 4 bts (from 0000 to 1111 ). Accordngly, G.711 coder always requres 8 bts, classfyng t to the group of coders wth fxed length code words [1]. Therefore the average bt rate s always equal to 8 bts per sample. Our goal s to fnd a soluton that requres lower bt rate than G.711 quantzer s. Therefore we propose the coder depcted n Fg. whch s mplemented as a two stages coder. In frst stage we splt whole support regon nto l = 16 segments and try to code them wth code words of varable length. The segments are labeled from left to rght on the axs one after the another wth numeral =1,,l where =1 marks the furthest segment to the left on the axs,.e. the segment boundng x max, and =16 marks the furthest segment to the rght on axs,.e. segment next to the x max. In ths way wth a proper technque we could acheve better bt usage than the G.711 standard. Here we use a Golomb-Rce coder where values of n from 0 to 15 are coded wth code words of varous lengths, as seen n Table I. In order to have the most effcent results we must try to desgnate shorter codes to the segments wth hgher probablty of appearance and longer codes to the segments wth lower probablty of appearance. Therefore we developed a rule for ths desgnaton, as shown n the last column of Table I. In ths way we conclude the frst stage of proposed coder. In second stage we code each of t=16 cells naturally wth 4 bts (from 0000 to 1111 ). +/- segment codng (values 0 7) Fg. 1. G.711 speech sgnal codng scheme. I stage segment codng wth varable codeword lengths (values 0 15) Golomb Rce coder cell codng (values 0 15) Fg.. Proposed two-stage speech sgnal codng scheme. C. The Golomb Rce Codng Technque II stage cell codng wth fxed codeword lengths (values 0 15) The Golomb-Rce (GR) codng technque uses code words of varable length and was created by combnng Golomb s (Solomon W. Golomb) and Rce s (Robert F. Rce) codng technques [3], [4]. Golomb s codng assumes 8
3 that number n s decomposed wth dvsor m nto nteger quotent q and a remander r, whereby stays n qm r, n, m, q, r N. (9) Golomb-Rce codng has an addtonal requrement: k m, k N 0. (10) The number n s coded as follows: frst the quotent q s coded unary,.e. we wrte an array of q ones, then we put a zero n order to provde correct decodng, and n the end the remander r s bnary coded on k bts. Therefore, dependng on the parameter k, the GR codng can be done n varous ways. In our research we examned all varants and came to the concluson that the best results for ths model are acheved for k=1. In Table I s gven an overvew of GR code for k=1, n=0,,15 where S represents code and l ts length, whereas marks the coder s segment whch s gong to be coded wth ths partcular code [3], [4]. Decodng s done n the followng way: we count ones before the frst zero,.e. decmal pont. The number of counted ones s quotent q. Then we dentfy k bts after the zero and they represent bnary record of remander r. Snce k, q and r are known, the number s calculated wth formulae (9) and (10). Startng from the (k+1)-th bt after decmal pont we contnue countng ones up to the next zero and the decodng process contnues [3], [4]. TABLE I. GOLOMB RICE CODE, K = 1, M = ; DESIGNATING SEGMENTS I= 1,, L WITH PROPER CODES N= 0,,15. n S l III. PERFORMANCES AND NUMERICAL RESULTS We assume that quantzer s nput speech sgnal can be descrbed wth the Laplacan probablty densty functon 1 x px, exp. (11) The measure of sgnal s qualty s dstorton. It s conssted from granular D g and overload D ov dstorton whose sum s total dstorton D=D g+d ov. Sgnal to Quantzaton Nose Rato (SQNR) s defned as D SQNR 10log /. (1) Granular dstorton D g s the dstorton for fnte cell wdths,.e. wthn the support regon [x max, x max ]. The overload dstorton D ov measures out of that regon,.e. on (, x max ) (x max, ). Thus, granular dstorton for pecewse lnear quantzaton and hgh bt rate (asymptotc quantzaton) s [10] Dg xmax x, p x, dx, (13) 1 xmax where Δ(x,σ) represents cell wdth defned n (4). We can further derve t as n [10] 1 l1 D g P, (14) 1 0 whereas P s probablty of -th segment x1, P p x dx x x x 1 exp exp. On the other sde, overload dstorton s calculated as [10] ov x y px, xmax l1, t (15) D dx, (16) whereas y l-1,t s defned accordng to (8). Therefore, the exact expresson s D ov x max exp xmax yl1, t A. Sgnal to Quantzaton Nose Rato SQNR. (17) ] 10 On the range L, whereby [ db 10 s, we calculate the average SQNR n a large number of ponts p as followng s 1 p av s (18) p s 1 SQNR SQNR. The values for SQNR av are shown n Table II. For the felds marked wth slash (/) t s not possble to desgn a quantzer whch respects G.71 standard wth current parameters Ng and μ. 83
4 TABLE II. AVERAGE SIGNAL TO QUANTIZATION NOISE RATIO SQNR [db] CALCULATED DEPENDING ON THE NUMBER OF QUANTIZERS Ng AND PARAMETER μ. SQNRav μ=15 μ=31 μ=63 μ=17 μ=55 Ng=1 / / / Ng= / / Ng= Ng= Ng= Ng= B. Bt Rate Snce the SQNR depends on sgnal varance and not on code word lengths, the crucal parameter for the code choce wll be the average bt rate. Hereby we try to get wth the descrbed two-stage codng method a lower average bt rate than the G.711 standard's coder, whch has a constant value of 8 bt/sample. The frst stage s average bt rate for a partcular standard devaton σ s equal to ths case a savng of bt rate equal to bt/sample s made, whereby the SQNR av s 3.305dB. SQNR(σ) s calculated on the entre varance range L and shown n Fg. 3. Further, we can get support regons as a set of values x max[] = [ ], for =1,...,3. Segments are coded as descrbed n Table I. whereby code lengths are l[]= [ ], =1,,8. For the varance values σ 1 [db]=0.65db and σ [db]= dB the most mportant quantzer s parameters are gven n Table IV. R I l, (19) 1 l P whereas l s the code word s length, defned n Table I, and P s defned n (15). We calculate the average bt rate of the frst stage on the varance range L n a large number of ponts p as The bt rate of second stage s constant 1 p RI RI s. (0) p s1 RII log. (1) t The total average bt rate of the proposed quas-logarthmc quantzer, wth addtonal nformaton about quantzer, s: log Ng R RI RII. () M Values for R are shown n Table III, where the frame sze s M=40. The values under the double lne are lower than 8 bt/sample and belong to the area of our specal nterest n ths research. TABLE III. AVERAGE BIT RATE R [bt/sample] CALCULATED DEPENDING ON THE NUMBER OF QUANTIZERS Ng AND PARAMETER μ. R μ=15 μ=31 μ=63 μ=17 μ=55 Ng=1 / / / Ng= / / Ng= Ng= Ng= Ng= C. Numercal Results As can be seen n Table III, the mnmal R s obtaned for Ng=3 and μ=55. These parameters are the best choce for our model and wll be used to compute the performances. In Fg. 3. SQNR(σ) on the varance range L. TABLE IV. NUMERICAL RESULTS FOR PARTICULAR VALUES OF SIGNAL VARIANCE σ [db]. σ1 [db]=0.65db, =17 σ [db]= dB, =1 x Δ P x Δ P SQNRav = db R = bt/sample SQNRav = db R = bt/sample In comparson wth non-adaptve fxed quantzer wth GR code descrbed n [1] where the quantzer fulfllng G.71 standard for =55 has an average bt rate bt/sample, ths model has a bt rate savng of around 1.3 bt/sample. Comparng wth an adaptve quantzer [14] where the bt rate s R log N log N / g M our model s average bt rate () s sgnfcantly lower. IV. CONCLUSIONS We calculated the performances for swtched quantzers that satsfy G.71 standard and for dfferent values of : 15, 31, 63, 17, 55. Opposte to the expectaton that better performances would have been obtaned for the lowest value of parameter, actually the lowest average bt rate s reached wth the usage of the swtched quantzer for maxmal value =55. Comparng to the non-adaptve 84
5 logarthmc G.711 quantzer, the proposed quantzer acheves an average bt rate s decrease of 1.43 bt/sample. The recommended VLC Golomb-Rce code s smpler than Huffman s code, whch s another advantage of proposed soluton. We are lookng forward to seeng ths quantzaton method beng appled for codng and compresson of other sgnal types. REFERENCES [1] Recommendaton G.711, Pulse code modulaton of voce frequences, ITU-T, 197. [Onlne]. Avalable: [] Recommendaton G.711.0, Lossless compresson of G.711 pulse code modulaton, ITU-T, 009. [Onlne]. Avalable: [3] S. W. Golomb, Run-length encodngs, IEEE Transactons on Informaton Theory, IT-1(3), pp , [Onlne]. Avalable: [4] D. Solomon, A concse ntroducton to data compresson, Sprnger- Verlag, London, 008, pp [Onlne]. Avalable: [5] M. Dnčć, Z. Perć, D. Denć, Unform polar quantzer wth threestage herarchcal varable-length codng for measurement sgnals wth Gaussan dstrbuton, Measurment, vol. 88, pp. 14, 016. [Onlne]. Avalable: artcle/p/s [6] Z. Perć, J. Nkolć, J. Lukć, D. Denć: Two-stage quantzer wth Huffman codng based on G.711 standard, Przeglad Elektrotechnczny (Electrcal Revew), ISSN , vol. 88, no. 09a, pp , 01. [Onlne]. Avalable: artcles/01/9a/65.pdf [7] Z. Perć, M. Dnčć, D. Denć, A. Jocć, Forward adaptve logarthmc quantzer wth new lossless codng method for Laplacan source, Wreless Personal Communcatons, vol. 59, no. 4, pp , 011. [Onlne]. Avalable: [8] O. Ordentlch, U. Erez, Performance analyss and optmal flter desgn for sgma-delta modulaton va dualty wth DPCM, n Proc. IEEE Int. Symp. on Informaton Theory, Hong Kong, 015, pp [Onlne]. Avalable: [9] N. Vučć, Z. Perć, N. Smć, Two-stage quantzer wth Golomb- Rce codng, 3 rd Internatonal Conference TAKTONS, Nov Sad, Serba, 015, pp [10] N. S. Jayant, P. Noll, Dgtal codng of waveforms, prncples and applcatons to speech and vdeo, Prentce Hall, New Jersey, 1984, pp [11] Recommendaton G.71, Transmsson performance characterstcs of pulse code modulaton, ITU-T, 199. [Onlne]. Avalable: [1] N. Vučć, Z. Perć, Quas-logarthmc quantzer wth Golomb-Rce codng, XIII Internatonal Conference Systems, Automatc Control and Measurements- SAUM, Nš, Serba, 016, pp [13] Z. Perc, J. Nkolc, An adaptve waveform codng algorthm and ts applcaton n speech codng, Dgtal Sgnal Processng, vol., no. 1, pp , 01. [Onlne]. Avalable: /j.dsp [14] L. Velmrovć, S. Marć, New Adaptve Compandor for LTE Sgnal Compresson Based on Splne Approxmatons, ETRI Journal, vol. 38, no. 3, pp , 016. [Onlne]. Avalable: /etrj
Pulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationError Probability for M Signals
Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationChapter 8 SCALAR QUANTIZATION
Outlne Chapter 8 SCALAR QUANTIZATION Yeuan-Kuen Lee [ CU, CSIE ] 8.1 Overvew 8. Introducton 8.4 Unform Quantzer 8.5 Adaptve Quantzaton 8.6 Nonunform Quantzaton 8.7 Entropy-Coded Quantzaton Ch 8 Scalar
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationEGR 544 Communication Theory
EGR 544 Communcaton Theory. Informaton Sources Z. Alyazcoglu Electrcal and Computer Engneerng Department Cal Poly Pomona Introducton Informaton Source x n Informaton sources Analog sources Dscrete sources
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationChapter 7 Channel Capacity and Coding
Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models
More informationIntroduction to Information Theory, Data Compression,
Introducton to Informaton Theory, Data Compresson, Codng Mehd Ibm Brahm, Laura Mnkova Aprl 5, 208 Ths s the augmented transcrpt of a lecture gven by Luc Devroye on the 3th of March 208 for a Data Structures
More informationChapter 7 Channel Capacity and Coding
Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationResearch Article Green s Theorem for Sign Data
Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of
More informationAn Improved multiple fractal algorithm
Advanced Scence and Technology Letters Vol.31 (MulGraB 213), pp.184-188 http://dx.do.org/1.1427/astl.213.31.41 An Improved multple fractal algorthm Yun Ln, Xaochu Xu, Jnfeng Pang College of Informaton
More informationLossless Compression Performance of a Simple Counter- Based Entropy Coder
ITB J. ICT, Vol. 5, No. 3, 20, 73-84 73 Lossless Compresson Performance of a Smple Counter- Based Entropy Coder Armen Z. R. Lang,2 ITB Research Center on Informaton and Communcaton Technology 2 Informaton
More informationAsymptotic Quantization: A Method for Determining Zador s Constant
Asymptotc Quantzaton: A Method for Determnng Zador s Constant Joyce Shh Because of the fnte capacty of modern communcaton systems better methods of encodng data are requred. Quantzaton refers to the methods
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationCSE4210 Architecture and Hardware for DSP
4210 Archtecture and Hardware for DSP Lecture 1 Introducton & Number systems Admnstratve Stuff 4210 Archtecture and Hardware for DSP Text: VLSI Dgtal Sgnal Processng Systems: Desgn and Implementaton. K.
More informationScroll Generation with Inductorless Chua s Circuit and Wien Bridge Oscillator
Latest Trends on Crcuts, Systems and Sgnals Scroll Generaton wth Inductorless Chua s Crcut and Wen Brdge Oscllator Watcharn Jantanate, Peter A. Chayasena, and Sarawut Sutorn * Abstract An nductorless Chua
More informationEntropy Coding. A complete entropy codec, which is an encoder/decoder. pair, consists of the process of encoding or
Sgnal Compresson Sgnal Compresson Entropy Codng Entropy codng s also known as zero-error codng, data compresson or lossless compresson. Entropy codng s wdely used n vrtually all popular nternatonal multmeda
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More informationLecture 3: Shannon s Theorem
CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationWhat would be a reasonable choice of the quantization step Δ?
CE 108 HOMEWORK 4 EXERCISE 1. Suppose you are samplng the output of a sensor at 10 KHz and quantze t wth a unform quantzer at 10 ts per sample. Assume that the margnal pdf of the sgnal s Gaussan wth mean
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationDepartment of Electrical & Electronic Engineeing Imperial College London. E4.20 Digital IC Design. Median Filter Project Specification
Desgn Project Specfcaton Medan Flter Department of Electrcal & Electronc Engneeng Imperal College London E4.20 Dgtal IC Desgn Medan Flter Project Specfcaton A medan flter s used to remove nose from a sampled
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationConsider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder.
PASSBAND DIGITAL MODULATION TECHNIQUES Consder the followng passband dgtal communcaton system model. cos( ω + φ ) c t message source m sgnal encoder s modulator s () t communcaton xt () channel t r a n
More informationUNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours
UNIVERSITY OF TORONTO Faculty of Arts and Scence December 005 Examnatons STA47HF/STA005HF Duraton - hours AIDS ALLOWED: (to be suppled by the student) Non-programmable calculator One handwrtten 8.5'' x
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationFlexible Quantization
wb 06/02/21 1 Flexble Quantzaton Bastaan Klejn KTH School of Electrcal Engneerng Stocholm wb 06/02/21 2 Overvew Motvaton for codng technologes Basc quantzaton and codng Hgh-rate quantzaton theory wb 06/02/21
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationApplication of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work
More informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006)
ECE 534: Elements of Informaton Theory Solutons to Mdterm Eam (Sprng 6) Problem [ pts.] A dscrete memoryless source has an alphabet of three letters,, =,, 3, wth probabltes.4,.4, and., respectvely. (a)
More informationChapter 3 Describing Data Using Numerical Measures
Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationBOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu
BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS M. Krshna Reddy, B. Naveen Kumar and Y. Ramu Department of Statstcs, Osmana Unversty, Hyderabad -500 007, Inda. nanbyrozu@gmal.com, ramu0@gmal.com
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationNice plotting of proteins II
Nce plottng of protens II Fnal remark regardng effcency: It s possble to wrte the Newton representaton n a way that can be computed effcently, usng smlar bracketng that we made for the frst representaton
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
More informationMicrowave Diversity Imaging Compression Using Bioinspired
Mcrowave Dversty Imagng Compresson Usng Bonspred Neural Networks Youwe Yuan 1, Yong L 1, Wele Xu 1, Janghong Yu * 1 School of Computer Scence and Technology, Hangzhou Danz Unversty, Hangzhou, Zhejang,
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationIntroduction to information theory and data compression
Introducton to nformaton theory and data compresson Adel Magra, Emma Gouné, Irène Woo March 8, 207 Ths s the augmented transcrpt of a lecture gven by Luc Devroye on March 9th 207 for a Data Structures
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationTransform Coding. Transform Coding Principle
Transform Codng Prncple of block-wse transform codng Propertes of orthonormal transforms Dscrete cosne transform (DCT) Bt allocaton for transform coeffcents Entropy codng of transform coeffcents Typcal
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationSignal space Review on vector space Linear independence Metric space and norm Inner product
Sgnal space.... Revew on vector space.... Lnear ndependence... 3.3 Metrc space and norm... 4.4 Inner product... 5.5 Orthonormal bass... 7.6 Waveform communcaton system... 9.7 Some examples... 6 Sgnal space
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
More informationStatistics Chapter 4
Statstcs Chapter 4 "There are three knds of les: les, damned les, and statstcs." Benjamn Dsrael, 1895 (Brtsh statesman) Gaussan Dstrbuton, 4-1 If a measurement s repeated many tmes a statstcal treatment
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora
prnceton unv. F 13 cos 521: Advanced Algorthm Desgn Lecture 3: Large devatons bounds and applcatons Lecturer: Sanjeev Arora Scrbe: Today s topc s devaton bounds: what s the probablty that a random varable
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationChat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980
MT07: Multvarate Statstcal Methods Mke Tso: emal mke.tso@manchester.ac.uk Webpage for notes: http://www.maths.manchester.ac.uk/~mkt/new_teachng.htm. Introducton to multvarate data. Books Chat eld, C. and
More informationAn Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationEigenvalues of Random Graphs
Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the
More informationThe Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD
he Gaussan classfer Nuno Vasconcelos ECE Department, UCSD Bayesan decson theory recall that we have state of the world X observatons g decson functon L[g,y] loss of predctng y wth g Bayes decson rule s
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationAn Application of Fuzzy Hypotheses Testing in Radar Detection
Proceedngs of the th WSES Internatonal Conference on FUZZY SYSEMS n pplcaton of Fuy Hypotheses estng n Radar Detecton.K.ELSHERIF, F.M.BBDY, G.M.BDELHMID Department of Mathematcs Mltary echncal Collage
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationFirst Year Examination Department of Statistics, University of Florida
Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationCONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION
CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING N. Phanthuna 1,2, F. Cheevasuvt 2 and S. Chtwong 2 1 Department of Electrcal Engneerng, Faculty of Engneerng Rajamangala
More informationAverage Decision Threshold of CA CFAR and excision CFAR Detectors in the Presence of Strong Pulse Jamming 1
Average Decson hreshold of CA CFAR and excson CFAR Detectors n the Presence of Strong Pulse Jammng Ivan G. Garvanov and Chrsto A. Kabachev Insttute of Informaton echnologes Bulgaran Academy of Scences
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationPredictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore
Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationComplex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)
Complex Numbers If you have not yet encountered complex numbers, you wll soon do so n the process of solvng quadratc equatons. The general quadratc equaton Ax + Bx + C 0 has solutons x B + B 4AC A For
More informationTutorial 2. COMP4134 Biometrics Authentication. February 9, Jun Xu, Teaching Asistant
Tutoral 2 COMP434 ometrcs uthentcaton Jun Xu, Teachng sstant csjunxu@comp.polyu.edu.hk February 9, 207 Table of Contents Problems Problem : nswer the questons Problem 2: Power law functon Problem 3: Convoluton
More informationDC-Free Turbo Coding Scheme Using MAP/SOVA Algorithms
Proceedngs of the 5th WSEAS Internatonal Conference on Telecommuncatons and Informatcs, Istanbul, Turkey, May 27-29, 26 (pp192-197 DC-Free Turbo Codng Scheme Usng MAP/SOVA Algorthms Prof. Dr. M. Amr Mokhtar
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationAsymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation
Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton
More informationNUMERICAL RESULTS QUALITY IN DEPENDENCE ON ABAQUS PLANE STRESS ELEMENTS TYPE IN BIG DISPLACEMENTS COMPRESSION TEST
Appled Computer Scence, vol. 13, no. 4, pp. 56 64 do: 10.23743/acs-2017-29 Submtted: 2017-10-30 Revsed: 2017-11-15 Accepted: 2017-12-06 Abaqus Fnte Elements, Plane Stress, Orthotropc Materal Bartosz KAWECKI
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
More informationLecture 14 (03/27/18). Channels. Decoding. Preview of the Capacity Theorem.
Lecture 14 (03/27/18). Channels. Decodng. Prevew of the Capacty Theorem. A. Barg The concept of a communcaton channel n nformaton theory s an abstracton for transmttng dgtal (and analog) nformaton from
More informationModeling curves. Graphs: y = ax+b, y = sin(x) Implicit ax + by + c = 0, x 2 +y 2 =r 2 Parametric:
Modelng curves Types of Curves Graphs: y = ax+b, y = sn(x) Implct ax + by + c = 0, x 2 +y 2 =r 2 Parametrc: x = ax + bxt x = cos t y = ay + byt y = snt Parametrc are the most common mplct are also used,
More informationOn balancing multiple video streams with distributed QoS control in mobile communications
On balancng multple vdeo streams wth dstrbuted QoS control n moble communcatons Arjen van der Schaaf, José Angel Lso Arellano, and R. (Inald) L. Lagendjk TU Delft, Mekelweg 4, 68 CD Delft, The Netherlands
More information