3GPP TS V ( )

Size: px
Start display at page:

Download "3GPP TS V ( )"

Transcription

1 TS 6.9 V.. (-9) Techncal Specfcaton 3rd Generaton Partnershp Project; Techncal Specfcaton Group Servces and System Aspects; Speech codec speech processng functons; Adaptve Mult-Rate - Wdeband (AMR-WB) speech codec; Transcodng functons (Release ) The present document has been developed wthn the 3 rd Generaton Partnershp Project ( TM ) and may be further elaborated for the purposes of. The present document has not been subject to any approval process by the Organzatonal Partners and shall not be mplemented. Ths Specfcaton s provded for future development work wthn only. The Organzatonal Partners accept no lablty for any use of ths Specfcaton. Specfcatons and reports for mplementaton of the TM system should be obtaned va the Organzatonal Partners' Publcatons Offces.

2 TS 6.9 V.. (-9) Keywords UMTS, GSM, codec, LTE Postal address support offce address 65 Route des Lucoles - Sopha Antpols Valbonne - FRANCE Tel.: Fax: Internet Copyrght Notfcaton No part may be reproduced except as authorzed by wrtten permsson. The copyrght and the foregong restrcton extend to reproducton n all meda., Organzatonal Partners (ARIB, ATIS, CCSA, ETSI, TTA, TTC). All rghts reserved. UMTS s a Trade Mark of ETSI regstered for the beneft of ts members s a Trade Mark of ETSI regstered for the beneft of ts Members and of the Organzatonal Partners LTE s a Trade Mark of ETSI currently beng regstered for the beneft of ts Members and of the Organzatonal Partners GSM and the GSM logo are regstered and owned by the GSM Assocaton

3 3 TS 6.9 V.. (-9) Contents Foreword... 5 Scope... 6 Normatve references Defntons, symbols and abbrevatons Defntons Symbols Abbrevatons... 4 Outlne descrpton Functonal descrpton of audo parts Preparaton of speech samples Prncples of the adaptve mult-rate wdeband speech encoder Prncples of the adaptve mult-rate speech decoder Sequence and subjectve mportance of encoded parameters Functonal descrpton of the encoder Pre-processng Lnear predcton analyss and quantzaton Wndowng and auto-correlaton computaton Levnson-Durbn algorthm LP to ISP converson ISP to LP converson Quantzaton of the ISP coeffcents Interpolaton of the ISPs Perceptual weghtng Open-loop ptch analyss kbt/s mode ,.65, 4.5, 5.85, 8.5, 9.85, 3.5 and 3.85 kbt/s modes Impulse response computaton Target sgnal computaton Adaptve codebook Algebrac codebook Codebook structure and 3.5 kbt/s mode kbt/s mode kbt/s mode kbt/s mode kbt/s mode kbt/s mode kbt/s mode kbt/s mode Pulse ndexng Codebook search Quantzaton of the adaptve and fxed codebook gans Memory update Hgh-band gan generaton Functonal descrpton of the decoder Decodng and speech synthess Hgh-pass flterng, up-scalng and nterpolaton Hgh frequency band Generaton of hgh-band exctaton LP flter for the hgh frequency band kbt/s mode ,.65, 4.5, 5.85, 8.5, 9.85, 3.5 or 3.85 kbt/s modes Hgh band synthess... 4

4 4 TS 6.9 V.. (-9) 7 Detaled bt allocaton of the adaptve mult-rate wdeband codec Homng sequences Functonal descrpton Defntons Encoder homng Decoder homng Bblography... 5 Annex A (nformatve): Change hstory... 5

5 5 TS 6.9 V.. (-9) Foreword The present document descrbes the detaled mappng of the wdeband telephony speech servce employng the Adaptve Mult-Rate (AMR-WB) speech coder wthn the system. The contents of the present document are subject to contnung work wthn the TSG and may change followng formal TSG approval. Should the TSG modfy the contents of ths TS, t wll be re-released by the TSG wth an dentfyng change of release date and an ncrease n verson number as follows: Verson x.y.z where: x the frst dgt: presented to TSG for nformaton; presented to TSG for approval; 3 Indcates TSG approved document under change control. y the second dgt s ncremented for all changes of substance,.e. techncal enhancements, correctons, updates, etc. z the thrd dgt s ncremented when edtoral only changes have been ncorporated n the specfcaton;

6 6 TS 6.9 V.. (-9) Scope Ths Telecommuncaton Standard (TS) descrbes the detaled mappng from nput blocks of 3 speech samples n 6-bt unform PCM format to encoded blocks of 3, 77, 53, 85, 37, 365, 397, 46 and 477 bts and from encoded blocks of 3, 77, 53, 85, 37, 365, 397, 46 and 477 bts to output blocks of 3 reconstructed speech samples. The samplng rate s 6 samples/s leadng to a bt rate for the encoded bt stream of 6.6, 8.85,.65, 4.5, 5.85, 8.5, 9.85, 3.5 or 3.85 kbt/s. The codng scheme for the mult-rate codng modes s the so-called Algebrac Code Excted Lnear Predcton Coder, hereafter referred to as ACELP. The mult-rate wdeband ACELP coder s referred to as MRWB-ACELP. Normatve references Ths TS ncorporates by dated and undated reference, provsons from other publcatons. These normatve references are cted n the approprate places n the text and the publcatons are lsted hereafter. For dated references, subsequent amendments to or revsons of any of these publcatons apply to ths TS only when ncorporated n t by amendment or revson. For undated references, the latest edton of the publcaton referred to apples. [] GSM 3.5: " Dgtal cellular telecommuncatons system (Phase ); Transmsson plannng aspects of the speech servce n the GSM Publc Land Moble Network (PLMN) system" [] TS 6. : "AMR wdeband speech codec; Frame structure". [3] TS 6.94: "AMR wdeband speech codec; Voce Actvty Detecton (VAD)". [4] TS 6.73: "AMR wdeband speech codec; ANSI-C code". [5] TS 6.74: "AMR wdeband speech codec; Test sequences". [6] ITU-T Recommendaton G.7 (988): "Codng of analogue sgnals by pulse code modulaton Pulse code modulaton (PCM) of voce frequences". 3 Defntons, symbols and abbrevatons 3. Defntons For the purposes of ths TS, the followng defntons apply: adaptve codebook: The adaptve codebook contans exctaton vectors that are adapted for every subframe. The adaptve codebook s derved from the long-term flter state. The lag value can be vewed as an ndex nto the adaptve codebook. algebrac codebook: A fxed codebook where algebrac code s used to populate the exctaton vectors (nnovaton vectors). The exctaton contans a small number of nonzero pulses wth predefned nterlaced sets of potental postons. The ampltudes and postons of the pulses of the k th exctaton codevector can be derved from ts ndex k through a rule requrng no or mnmal physcal storage, n contrast wth stochastc codebooks whereby the path from the ndex to the assocated codevector nvolves look-up tables. ant-sparseness processng: An adaptve post-processng procedure appled to the fxed codebook vector n order to reduce perceptual artfacts from a sparse fxed codebook vector. closed-loop ptch analyss: Ths s the adaptve codebook search,.e., a process of estmatng the ptch (lag) value from the weghted nput speech and the long term flter state. In the closed-loop search, the lag s searched usng error mnmzaton loop (analyss-by-synthess). In the adaptve mult-rate wdeband codec, closed-loop ptch search s performed for every subframe. drect form coeffcents: One of the formats for storng the short term flter parameters. In the adaptve mult-rate wdeband codec, all flters whch are used to modfy speech samples use drect form coeffcents.

7 7 TS 6.9 V.. (-9) fxed codebook: The fxed codebook contans exctaton vectors for speech synthess flters. The contents of the codebook are non-adaptve (.e., fxed). In the adaptve mult-rate wdeband codec, the fxed codebook s mplemented usng an algebrac codebook. fractonal lags: A set of lag values havng sub-sample resoluton. In the adaptve mult-rate wdeband codec a sub-sample resoluton of /4th or /nd of a sample s used. frame: A tme nterval equal to ms (3 samples at an 6 khz samplng rate). Immttance Spectral Frequences: (see Immttance Spectral Par) Immttance Spectral Par: Transformaton of LPC parameters. Immttance Spectral Pars are obtaned by decomposng the nverse flter transfer functon A(z) to a set of two transfer functons, one havng even symmetry and the other havng odd symmetry. The Immttance Spectral Pars (also called as Immttance Spectral Frequences) are the roots of these polynomals on the z-unt crcle. nteger lags: A set of lag values havng whole sample resoluton. nterpolatng flter: An FIR flter used to produce an estmate of sub-sample resoluton samples, gven an nput sampled wth nteger sample resoluton. In ths mplementaton, the nterpolatng flter has low pass flter characterstcs. Thus the adaptve codebook conssts of the low-pass fltered nterpolated past exctaton. nverse flter: Ths flter removes the short term correlaton from the speech sgnal. The flter models an nverse frequency response of the vocal tract. lag: The long term flter delay. Ths s typcally the true ptch perod, or ts multple or sub-multple. LP analyss wndow: For each frame, the short term flter coeffcents are computed usng the hgh pass fltered speech samples wthn the analyss wndow. In the adaptve mult-rate wdeband codec, the length of the analyss wndow s always 384 samples. For all the modes, a sngle asymmetrc wndow s used to generate a sngle set of LP coeffcents. The 5 ms look-ahead s used n the analyss. LP coeffcents: Lnear Predcton (LP) coeffcents (also referred as Lnear Predctve Codng (LPC) coeffcents) s a generc descrptve term for the short term flter coeffcents. mode: When used alone, refers to the source codec mode,.e., to one of the source codecs employed n the AMR-WB codec. open-loop ptch search: A process of estmatng the near optmal lag drectly from the weghted speech nput. Ths s done to smplfy the ptch analyss and confne the closed-loop ptch search to a small number of lags around the open-loop estmated lags. In the adaptve mult-rate wdeband codec, an open-loop ptch search s performed n every other subframe. resdual: The output sgnal resultng from an nverse flterng operaton. short term synthess flter: Ths flter ntroduces, nto the exctaton sgnal, short term correlaton whch models the mpulse response of the vocal tract. perceptual weghtng flter: Ths flter s employed n the analyss-by-synthess search of the codebooks. The flter explots the nose maskng propertes of the formants (vocal tract resonances) by weghtng the error less n regons near the formant frequences and more n regons away from them. subframe: A tme nterval equal to 5 ms (8 samples at 6 khz samplng rate). vector quantzaton: A method of groupng several parameters nto a vector and quantzng them smultaneously. zero nput response: The output of a flter due to past nputs,.e. due to the present state of the flter, gven that an nput of zeros s appled. zero state response: The output of a flter due to the present nput, gven that no past nputs have been appled,.e., gven that the state nformaton n the flter s all zeroes. 3. Symbols For the purposes of ths TS, the followng symbols apply:

8 A( z) A ( z) ( ) H z = A z ( ) 8 The nverse flter wth unquantzed coeffcents The nverse flter wth quantzed coeffcents The speech synthess flter wth quantzed coeffcents TS 6.9 V.. (-9) a a m W( z) γ T β The unquantzed lnear predcton parameters (drect form coeffcents) The quantfed lnear predcton parameters The order of the LP model The perceptual weghtng flter (unquantzed coeffcents) The perceptual weghtng factor The nteger ptch lag nearest to the closed-loop fractonal ptch lag of the subframe The adaptve pre-flter coeffcent (the quantfed ptch ga Hh ( z) Pre-processng hgh-pass flter w ( LP analyss wndow L Length of the frst part of the LP analyss wndow w ( L Length of the second part of the LP analyss wndow w ( r (k) The auto-correlatons of the wndowed speech s'( wlag ( ) Lag wndow for the auto-correlatons (6 Hz bandwdth expanso f f s The bandwdth expanson n Hz The samplng frequency n Hz r '( k) The modfed (bandwdth expanded) auto-correlatons E ( ) The predcton error n the th teraton of the Levnson algorthm k ( ) a j The th reflecton coeffcent The jth drect form coeffcent n the th teraton of the Levnson algorthm F ( z) F ( z) Symmetrc ISF polynomal Antsymmetrc ISF polynomal F ( z) Polynomal F ( z) F ( z) Polynomal F ( z) wth roots z = and = z elmnated

9 9 TS 6.9 V.. (-9) q q ( n q ) The mmttance spectral pars (ISPs) n the cosne doman An ISP vector n the cosne doman The quantfed ISP vector at the th subframe of the frame n ω T ( m x ) The mmttance spectral frequences (ISFs) A mth order Chebyshev polynomal f( ), f( ) The coeffcents of the polynomals F ( z ) and F ( z) ' ' f ( ), f ( ) The coeffcents of the polynomals F ( z) and F ( z) f ( ) The coeffcents of ether F ( z) or F ( z) ( ) C x x Sum polynomal of the Chebyshev polynomals Cosne of angular frequency ω λ k Recurson coeffcents for the Chebyshev polynomal evaluaton f t [ f f ] f6 The mmttance spectral frequences (ISFs) n Hz f = The vector representaton of the ISFs n Hz z ( The mean-removed ISF vector at frame n r ( The ISF predcton resdual vector at frame n p( n ) ( n ) The predcted ISF vector at frame n r ˆ The quantfed resdual vector at the past frame k rˆ The quantfed ISF subvector at quantzaton ndex k d The dstance between the mmttance spectral frequences f + and f ( ) h n The mpulse response of the weghted synthess flter H ( z) W ( z) The weghted synthess flter T s'( The nteger nearest to the fractonal ptch lag of the prevous (st or 3rd) subframe The wndowed speech sgnal sw ( The weghted speech sgnal s ( n ) ( ) x n Reconstructed speech sgnal The target sgnal for adaptve codebook search x (, x t The target sgnal for algebrac codebook search

10 TS 6.9 V.. (-9) reslp ( n ) ( ) c n ( ) v n The LP resdual sgnal The fxed codebook vector The adaptve codebook vector y( = v( h( The fltered adaptve codebook vector yk ( The past fltered exctaton ( ) u n The exctaton sgnal u '( n ) T op t mn t max The gan-scaled emphaszed exctaton sgnal The best open-loop lag Mnmum lag search value Maxmum lag search value R( k) Correlaton term to be maxmzed n the adaptve codebook search R( k R ) ( k) t The nterpolated value of for the nteger delay k and fracton t A k C k Correlaton term to be maxmzed n the algebrac codebook search at ndex k The correlaton n the numerator of A k at ndex k E D k The energy n the denomnator of A k at ndex k t d = H x The correlaton between the target sgnal x ( n ) and the mpulse response h ( fltered target,.e., backward H The lower trangular Toeplz convoluton matrx wth dagonal h ( ) and lower dagonals h( ),, h( 63) = h( The matrx of correlatons of Φ H t H d( The elements of the vector d φ(, j ) c k The elements of the symmetrc matrx Φ The nnovaton vector C The correlaton n the numerator of A k m ϑ N p The poston of the th pulse The ampltude of the th pulse The number of pulses n the fxed codebook exctaton

11 TS 6.9 V.. (-9) E D The energy n the denomnator of A k ( resltp The normalzed long-term predcton resdual ( ) b n The sgnal used for presettng the sgns n algebrac codebook search sb ( The sgn sgnal for the algebrac codebook search d ( n ) Sgn extended backward fltered target φ ' (, j ) The modfed elements of the matrx Φ, ncludng sgn nformaton z t, z( n ) The fxed codebook vector convolved wth h( n ) ( ) E n E ~ E( n ) The mean-removed nnovaton energy (n db) The mean of the nnovaton energy The predcted energy [ b b b3 b4 ] The MA predcton coeffcents R ( k ) E I The quantfed predcton error at subframe k The mean nnovaton energy R( The predcton error of the fxed-codebook gan quantzaton E Q The quantzaton error of the fxed-codebook gan quantzaton e( The states of the synthess flter A ( z ) ew ( The perceptually weghted error of the analyss-by-synthess search η g c g c g c g p The gan scalng factor for the emphaszed exctaton The fxed-codebook gan The predcted fxed-codebook gan The quantfed fxed codebook gan The adaptve codebook gan g p The quantfed adaptve codebook gan = g g A correcton factor between the gan g c and the estmated one γ gc c c g c γ gc The optmum value for γ gc γ sc Gan scalng factor

12 TS 6.9 V.. (-9) 3.3 Abbrevatons For the purposes of ths TS, the followng abbrevatons apply. ACELP Algebrac Code Excted Lnear Predcton AGC Adaptve Gan Control AMR Adaptve Mult-Rate AMR-WB Adaptve Mult-Rate Wdeband CELP Code Excted Lnear Predcton FIR Fnte Impulse Response ISF Immttance Spectral Frequency ISP Immttance Spectral Par ISPP Interleaved Sngle-Pulse Permutaton LP Lnear Predcton LPC Lnear Predctve Codng LTP Long Term Predctor (or Long Term Predcto MA Movng Average MRWB-ACELP Wdeband Mult-Rate ACELP S-MSVQ Splt-MultStage Vector Quantzaton WB Wdeband 4 Outlne descrpton Ths TS s structured as follows: Secton 4. contans a functonal descrpton of the audo parts ncludng the A/D and D/A functons. Secton 4. descrbes nput format for the AMR-WB encoder and the output format for the AMR-WB decoder. Sectons 4.3 and 4.4 present a smplfed descrpton of the prncples of the AMR-WB codec encodng and decodng process respectvely. In subclause 4.5, the sequence and subjectve mportance of encoded parameters are gven. Secton 5 presents the functonal descrpton of the AMR-WB codec encodng, whereas clause 6 descrbes the decodng procedures. In secton 7, the detaled bt allocaton of the AMR-WB codec s tabulated. Secton 8 descrbes the homng operaton. 4. Functonal descrpton of audo parts The analogue-to-dgtal and dgtal-to-analogue converson wll n prncple comprse the followng elements: ) Analogue to unform dgtal PCM - mcrophone; - nput level adjustment devce; - nput ant-alasng flter; - sample-hold devce samplng at 6 khz; - analogue-to-unform dgtal converson to 4-bt representaton. The unform format shall be represented n two's complement. ) Unform dgtal PCM to analogue - converson from 4-bt/6 khz unform PCM to analogue; - a hold devce; - reconstructon flter ncludng x/sn( x ) correcton; - output level adjustment devce;

13 3 TS 6.9 V.. (-9) - earphone or loudspeaker. In the termnal equpment, the A/D functon may be acheved - by drect converson to 4-bt unform PCM format; For the D/A operaton, the nverse operatons take place. 4. Preparaton of speech samples The encoder s fed wth data comprsng of samples wth a resoluton of 4 bts left justfed n a 6-bt word. The decoder outputs data n the same format. Outsde the speech codec further processng must be appled f the traffc data occurs n a dfferent representaton. 4.3 Prncples of the adaptve mult-rate wdeband speech encoder The AMR-WB codec conssts of nne source codecs wth bt-rates of , 9.85, 8.5, 5.85, 4.5,.65, 8.85 and 6.6 kbt/s. The codec s based on the code-excted lnear predctve (CELP) codng model. The nput sgnal s pre-emphaszed usng the flter H pre-emph (z)= µz. The CELP model s then appled to the pre-emphaszed sgnal. A 6th order lnear predcton (LP), or short-term, synthess flter s used whch s gven by: H( z) = A = ( z) m + a z =, ( ) where â,=,,m are the (quantzed) lnear predcton (LP) parameters, and m = 6 s the predctor order. The long-term, or ptch, synthess flter s usually gven by: = B( z) T g pz, ( ) where T s the ptch delay and g p s the ptch gan. The ptch synthess flter s mplemented usng the so-called adaptve codebook approach. The CELP speech synthess model s shown n Fgure. In ths model, the exctaton sgnal at the nput of the short-term LP synthess flter s constructed by addng two exctaton vectors from adaptve and fxed (nnovatve) codebooks. The speech s syntheszed by feedng the two properly chosen vectors from these codebooks through the short-term synthess flter. The optmum exctaton sequence n a codebook s chosen usng an analyss-by-synthess search procedure n whch the error between the orgnal and syntheszed speech s mnmzed accordng to a perceptually weghted dstorton measure. The perceptual weghtng flter used n the analyss-by-synthess search technque s gven by: where A(z) s the unquantzed LP flter, H de emph =.68z weghtng flter uses the unquantzed LP parameters. W ( z) = A( z / γ ) H ( z), ( 3 ) de emph, and γ =.9 s the perceptual weghtng factor. The The encoder performs the analyss of the LPC, LTP and fxed codebook parameters at.8 khz samplng rate. The coder operates on speech frames of ms. At each frame, the speech sgnal s analysed to extract the parameters of the CELP model (LP flter coeffcents, adaptve and fxed codebooks' ndces and gans). In addton to these parameters, hgh-band gan ndces are computed n 3.85 kbt/s mode. These parameters are encoded and transmtted. At the decoder, these parameters are decoded and speech s syntheszed by flterng the reconstructed exctaton sgnal through the LP synthess flter.

14 4 TS 6.9 V.. (-9) The sgnal flow at the encoder s shown n Fgure. After decmaton, hgh-pass and pre-emphass flterng s performed. LP analyss s performed once per frame. The set of LP parameters s converted to mmttance spectrum pars (ISP) and vector quantzed usng splt-multstage vector quantzaton (S-MSVQ). The speech frame s dvded nto 4 subframes of 5 ms each (64 samples at.8 khz samplng rate). The adaptve and fxed codebook parameters are transmtted every subframe. The quantzed and unquantzed LP parameters or ther nterpolated versons are used dependng on the subframe. An open-loop ptch lag s estmated n every other subframe or once per frame based on the perceptually weghted speech sgnal. Then the followng operatons are repeated for each subframe: - The target sgnal x( s computed by flterng the LP resdual through the weghted synthess flter W ( z) H ( z) wth the ntal states of the flters havng been updated by flterng the error between LP resdual and exctaton (ths s equvalent to the common approach of subtractng the zero nput response of the weghted synthess flter from the weghted speech sgnal). - The mpulse response, h( of the weghted synthess flter s computed. - Closed-loop ptch analyss s then performed (to fnd the ptch lag and ga, usng the target x( and mpulse response h(, by searchng around the open-loop ptch lag. Fractonal ptch wth /4th or /nd of a sample resoluton (dependng on the mode and the ptch lag value) s used. The nterpolatng flter n fractonal ptch search has low pass frequency response. Further, there are two potental low-pass characterstcs n the the adaptve codebook and ths nformaton s encoded wth bt. - The target sgnal x( s updated by removng the adaptve codebook contrbuton (fltered adaptve codevector), and ths new target, x (, s used n the fxed algebrac codebook search (to fnd the optmum nnovato. - The gans of the adaptve and fxed codebook are vector quantfed wth 6or 7 bts (wth movng average (MA) predcton appled to the fxed codebook ga. - Fnally, the flter memores are updated (usng the determned exctaton sgnal) for fndng the target sgnal n the next subframe. The bt allocaton of the AMR-WB codec modes s shown n Table. In each ms speech frame, 3, 77, 53, 85, 37, 365, 397, 46 and 477 bts are produced, correspondng to a bt-rate of 6.6, 8.85,.65, 4.5, 5.85, 8.5, 9.85, 3.5 or 3.85 kbt/s. More detaled bt allocaton among the codec parameters s gven n tables a-. Note that the most sgnfcant bts (MSB) are always sent frst.

15 5 TS 6.9 V.. (-9) Table : Bt allocaton of the AMR-WB codng algorthm for ms frame Mode Parameter st subframe nd subframe 3rd subframe 4th subframe total per frame VAD-flag 3.85 kbt/s ISP 46 LTP-flterng 4 Ptch delay Algebrac code Codebook gan HB-energy Total 477 VAD-flag 3.5 kbt/s ISP 46 LTP-flterng 4 Ptch delay Algebrac code Gans Total 46 VAD-flag 9.85 kbt/s ISP 46 LTP-flterng 4 Ptch delay Algebrac code Codebook gan Total 397 VAD-flag 8.5 kbt/s ISP 46 LTP-flterng 4 Ptch delay Algebrac code Gans Total 365 VAD-flag 5.85 kbt/s ISP 46 LTP-flterng 4 Ptch delay Algebrac code Gans Total 37 VAD-flag 4.5 kbt/s ISP 46 LTP-flterng 4 Ptch delay Algebrac code Gans Total 85 VAD-flag.65 kbt/s ISP 46 LTP-flterng 4 Ptch delay Algebrac code Gans Total 53 VAD-flag 8.85 kbt/s ISP 46 Ptch delay Algebrac code 8 Gans Total 77 VAD-flag 6.6 kbt/s ISP 36 Ptch delay Algebrac code 48 Gans Total 3

16 6 TS 6.9 V.. (-9) 4.4 Prncples of the adaptve mult-rate speech decoder The sgnal flow at the decoder s shown n Fgure 3. At the decoder, the transmtted ndces are extracted from the receved btstream. The ndces are decoded to obtan the coder parameters at each transmsson frame. These parameters are the ISP vector, the 4 fractonal ptch lags, the 4 LTP flterng parameters, the 4 nnovatve codevectors, and the 4 sets of vector quantzed ptch and nnovatve gans. In 3.85 kbt/s mode, also hgh-band gan ndex s decoded. The ISP vector s converted to the LP flter coeffcents and nterpolated to obtan LP flters at each subframe. Then, at each 64-sample subframe: - The exctaton s constructed by addng the adaptve and nnovatve codevectors scaled by ther respectve gans. - The.8 khz speech s reconstructed by flterng the exctaton through the LP synthess flter. - The reconstructed speech s de-emphaszed. Fnally, the reconstructed speech s upsampled to 6 khz and hgh-band speech sgnal s added to the frequency band from 6 khz to 7 khz. 4.5 Sequence and subjectve mportance of encoded parameters The encoder wll produce the output nformaton n a unque sequence and format, and the decoder must receve the same nformaton n the same way. In table a-, the sequence of output bts and the bt allocaton for each parameter s shown. The dfferent parameters of the encoded speech and ther ndvdual bts have unequal mportance wth respect to subjectve qualty. The output and nput frame formats for the AMR wdeband speech codec are gven n [], where a reorderng of bts take place. 5 Functonal descrpton of the encoder In ths clause, the dfferent functons of the encoder represented n Fgure are descrbed. 5. Pre-processng The encoder performs the analyss of the LPC, LTP and fxed codebook parameters at.8 khz samplng rate. Therefore, the nput sgnal has to be decmated from 6 khz to.8 khz. The decmaton s performed by frst upsamplng by 4, then flterng the output through lowpass FIR flter H decm (z) that has the cut off frequency at 6.4 khz. Then, the sgnal s downsampled by 5. The flterng delay s compensated by addng zeroes nto the end of the nput vector. After the decmaton, two pre-processng functons are appled to the sgnal pror to the encodng process: hgh-pass flterng and pre-emphaszng (and sgnal down-scalng). (Down-scalng conssts of dvdng the nput by a factor of to reduce the possblty of overflows n the fxed-pont mplementaton.) The hgh-pass flter serves as a precauton aganst undesred low frequency components. A flter at a cut off frequency of 5 Hz s used, and t s gven by z z H h ( z) =. ( 4 ).97888z z (Both down-scalng and hgh-pass flterng are combned by dvdng the coeffcents at the numerator of H h (z) by.) In the pre-emphass, a frst order hgh-pass flter s used to emphasze hgher frequences, and t s gven by emph ( z) =.68z H pre ( 5 )

17 7 TS 6.9 V.. (-9) 5. Lnear predcton analyss and quantzaton Short-term predcton, or LP, analyss s performed once per speech frame usng the autocorrelaton approach wth 3 ms asymmetrc wndows. An overhead of 5 ms s used n the autocorrelaton computaton. The frame structure s depcted below. wndowng frame n- wndowng frame n frame n (4 x 5 ms) The autocorrelatons of wndowed speech are converted to the LP coeffcents usng the Levnson-Durbn algorthm. Then the LP coeffcents are transformed to the ISP doman for quantzaton and nterpolaton purposes. The nterpolated quantzed and unquantzed flters are converted back to the LP flter coeffcents (to construct the synthess and weghtng flters at each subframe). 5.. Wndowng and auto-correlaton computaton LP analyss s performed once per frame usng an asymmetrc wndow. The wndow has ts weght concentrated at the fourth subframe and t conssts of two parts: the frst part s a half of a Hammng wndow and the second part s a quarter of a Hammng-cosne functon cycle. The wndow s gven by: πn w( = cos, L π ( n L ) = cos, 4 L n =,, L n = L,, L + L, ( 6 ) where the values L =56 and L =8 are used. The autocorrelatons of the wndowed speech s'(,n=,,383 are computed by 383 r( k) = = n k s' ( s'( n k), k =,,6, ( 7 ) and a 6 Hz bandwdth expanson s used by lag wndowng the autocorrelatons usng the wndow [] w lag πf ( ) = exp, =, 6, f s ( 8 ) where f =6 Hz s the bandwdth expanson and f s =8 Hz s the samplng frequency. Further, r() s multpled by the whte nose correcton factor. whch s equvalent to addng a nose floor at -4 db. 5.. Levnson-Durbn algorthm The modfed autocorrelatons r '() =.r() and r '( k) = r( k) w lag ( k), k =, 6, are used to obtan the LP flter coeffcents a k,k=,,6 by solvng the set of equatons. 6 k = ( k ) = r' ( ), =,,6. ak r' ( 9 ) The set of equatons n (9) s solved usng the Levnson-Durbn algorthm []. Ths algorthm uses the followng recurson:

18 8 TS 6.9 V.. (-9) The fnal soluton s gven as E() = r' () For = to 6 do k = r' ( ) + a ( ) For = k E( ) = j = to do a ( ) j = a ( ) j j = a ( k ) E( ) (6) a j = a j,j=,,6. j + k a r' ( j) / E( ) ( ) j The LP flter coeffcents are converted to the ISP representaton [4] for quantzaton and nterpolaton purposes. The conversons to the ISP doman and back to the LP flter doman are descrbed n the next two sectons LP to ISP converson The LP flter coeffcents a k, k=,,6, are converted to the ISP representaton for quantzaton and nterpolaton purposes. For a 6th order LP flter, the ISPs are defned as the roots of the sum and dfference polynomals and ' 6 f ( z) = A( z) + z A( z ) ( ) ' 6 f ( z) = A( z) z A( z ) ( ) respectvely. (The polynomals f' (z) and f' (z) are symmetrc and antsymmetrc, respectvely). It can be proven that all roots of these polynomals are on the unt crcle and they alternate each other [5]. f' (z) has two roots at z = (ω=) and z = - (ω = π). To elmnate these two roots, we defne the new polynomals and ' z f ( z) = f ( ) ( ) ' f ( z) = f ( z) /( z ± Polynomals f (z) and f (z) have 8 and 7 conjugate roots on the unt crcle ( e j ω ) polynomals can be wrtten as ( [ ]) ( + a 6 q z + z ) ). ( 3 ) respectvely. Therefore, the F = ( 4 ) ( z) =,,...,4 and ( [ ]) ( a 6 q z + z ) F ( z) = ( 5 ) =,3,...,3 where q =cos(ω ) wth ω beng the mmttance spectral frequences (ISF) and a[6] s the last predctor coeffcent. ISFs satsfy the orderng property ω < ω < < ω < π. We refer to q as the ISPs n the cosne doman. < 6 Snce both polynomals f (z) and f (z) are symmetrc only the frst 8 and 7 coeffcents of each polynomal, respectvely, and the last predctor coeffcent need to be computed. The coeffcents of these polynomals are found by the recursve relatons for = to 7

19 9 TS 6.9 V.. (-9) f ( ) = f ( ) = a a + a a m m, + f ( ). ( 6 ) f ( 8) = a where m=6 s the predctor order, and f ) = f ( ). ( = 8 The ISPs are found by evaluatng the polynomals F (z) and F (z) at ponts equally spaced between and π and checkng for sgn changes. A sgn change sgnfes the exstence of a root and the sgn change nterval s then dvded 4 tmes to better track the root. The Chebyshev polynomals are used to evaluate F (z) and F (z) [6]. In ths method the roots are found drectly n the cosne doman {q }. The polynomals F (z) and F (z) evaluated at z = e jω can be wrtten as wth 7 j8ω ( x j7ω ( x F ω) = e C ( ) and F ω) = e C ( ) ( 7 ) C( x) = f( ) T8 ( x) + f(8)/, and C( x) = f( ) T8 ( x) f(7)/, = + ( 8 ) = where T m =cos(mω) s the mth order Chebyshev polynomal, f() are the coeffcents of ether F (z) or F (z), computed usng the equatons n (6). The polynomal C(x) s evaluated at a certan value of x = cos(ω) usng the recursve relaton: for k = n b k = xb end C( x) = xb f - down to k + b b k + + f ( n + f ( n f f 6 ) /, k) where n f =8 n case of C (x) and n f =7 n case of C (x), wth ntal values b nf =f() and b nf+ =. The detals of the Chebyshev polynomal evaluaton method are found n [6] ISP to LP converson Once the ISPs are quantzed and nterpolated, they are converted back to the LP coeffcent doman { a k }. The converson to the LP doman s done as follows. The coeffcents of F (z) and F (z) are found by expandng Equatons (4) and (5) knowng the quantzed and nterpolated ISPs q =,=,,m-, where m=6. The followng recursve relaton s used to compute f (z) for = to m / end f ( ) = q for j = down to f( j) = f( j) q end f () = f () q f ( ) + f ( ) f ( j ) + f ( j ) wth ntal values f ()= and f ()=-q. The coeffcents f () are computed smlarly by replacng q - by q - and m/ by m/-, and wth ntal condtons f ()= and f ()=-q. Once the coeffcents f (z) and f (z) are found, F (z) s multpled by -z -, to obtan F' (z); that s ' f ( ) ' = f ( ) f f ( ) = f ( ) ( ), =,, m /, =,, m / ( 9 )

20 TS 6.9 V.. (-9) Then F' (z) and F' (z) are multpled by +q m- and -q m-, respectvely. That s ' f ( ) = (- q ' f ( ) = (+ q m- m- ) f ' ( ), ) f ' ( ) =,, m /, =,, m / Fnally the LP coeffcents are found by a =.5 f ( ) +.5 f ( ),.5 f ( ).5 f ( ),.5 f ( m / ), q ' ', m ' ' ' =,, m /, = m / +,, m, = m /, = m. ( ) ' Ths s drectly derved from the relaton A ( z) = ( F ( z) + F ( z)) /, and consderng the fact that F' (z) and F' (z) are symmetrc and antsymmetrc polynomals, respectvely Quantzaton of the ISP coeffcents The LP flter coeffcents are quantzed usng the ISP representaton n the frequency doman; that s ' f S f = arccos( q ), π f S = arccos( q ), 4π =, 4, = 5, ( ) where f are the ISFs n Hz [,64] and f s =8 s the samplng frequency. The ISF vector s gven by [f f,,f 5 ], wth t denotng transpose. t f = A st order MA predcton s appled, and the resdual ISF vector s quantfed usng a combnaton of splt vector quantzaton (SVQ) and mult-stage vector quantzaton (MSVQ). The predcton and quantzaton are performed as z n denote the mean-removed ISF vector at frame n. The predcton resdual vector r( s gven by: follows. Let ( ) r ( z( p( = ( ) where p( s the predcted LSF vector at frame n. Frst order movng-average (MA) predcton s used where: where ˆ( n ) r s the quantzed resdual vector at the past frame. p ( = rˆ ( n ), ( 3 ) 3 The ISF resdual vector r s quantzed usng splt-multstage vector quantzaton S-MSVQ. The vector s splt nto subvectors r ( and r ( of dmensons 9 and 7, respectvely. The subvectors are quantzed n two stages. In the frst stage r ( s quantzed wth 8 bts and r ( wth 8 bts. For 8.85,.65, 4.5, 5.85, 8.5, 9.85, 3.5 or 3.85 kbt/s modes, the quantzaton error vectors () r = r rˆ, =, are splt n the next stage nto 3 and subvectors, respectvely. The subvectors are quantzed usng the bt-rates descrbed n Table.

21 TS 6.9 V.. (-9) Table. Quantzaton of ISP vector for the 8.85,.65, 4.5, 5.85, 8.5, 9.85, 3.5 or 3.85 kbt/s modes. UNQUANTIZED 6-ELEMENT-LONG ISP VECTOR. STAGE ( r ) 8 bts. STAGE ( r ) 8 bts 3. STAGE r ) () (, 6 bts 3. STAGE r ) () (,3 5 7 bts 3. STAGE r ) () (,6 8 7 bts 3. STAGE r ) () (, 5 bts 3. STAGE r ) () (,3 6 () For 6.6 kbt/s mode, the quantzaton error vectors r = r rˆ, =, are splt n the next stage nto and subvectors, respectvely. The subvectors are quantzed usng the bt-rates descrbed n Table 3. 5 bts Table 3. Quantzaton of ISP vector for the 6.6 kbt/s mode. UNQUANTIZED 6-ELEMENT-LONG ISP VECTOR. STAGE ( r ) 8 bts. STAGE ( r ) 8 bts 3. STAGE r ) () (, 4 7 bts 3. STAGE r ) () (,5 8 7 bts 3. STAGE r ) () (, 6 A squared error ISP dstorton measure s used n the quantzaton process. In general, for an nput ISP or error resdual k subvector r,=, and a quantzed vector at ndex k, rˆ, the quantzaton s performed by fndng the ndex k whch mnmzes n [ ] k r rˆ = m where m and n are the frst and last elements of the subvector Interpolaton of the ISPs 6 bts E =, ( 4 ) The set of quantzed (and unquantzed) LP parameters s used for the fourth subframe whereas the frst, second, and thrd subframes use a lnear nterpolaton of the parameters n the adjacent frames. The nterpolaton s performed on the ( ) ISPs n the q doman. Let ˆ n ( n ) q 4 be the ISP vector at the 4th subframe of the frame, and q ˆ 4 the ISP vector at the 4th subframe of the past frame n-. The nterpolated ISP vectors at the st, nd, and 3rd subframes are gven by qˆ qˆ qˆ ( ( ( 3 =.55ˆ q4 ( n =.qˆ 4 ( =.4qˆ ( n ) ) n ) 4 ( +.45ˆ q4 ( +.8ˆ q4, ( +.96ˆ q The same formula s used for nterpolaton of the unquantzed ISPs. The nterpolated ISP vectors are used to compute a dfferent LP flter at each subframe (both quantzed and unquantzed) usng the ISP to LP converson method descrbed n Secton Perceptual weghtng The tradtonal perceptual weghtng flter W ( z) = A( z / γ ) / A( z / γ ) has nherent lmtatons n modellng the formant structure and the requred spectral tlt concurrently. The spectral tlt s more pronounced n wdeband sgnals due to the wde dynamc range between low and hgh frequences. A soluton to ths problem s to ntroduce the preemphass flter at the nput, compute the LP flter A(z) based on the preemphaszed speech s(, and use a modfed flter W(z) by fxng ts denomnator. Ths structure substantally decouples the formant weghtng from the tlt., 4.

22 TS 6.9 V.. (-9) A weghtng flter of the form W ( z) = A( z / γ ) H ( z) s used, where de emph H de emph = β z and β =.68. Because A(z) s computed based on the preemphaszed speech sgnal s(, the tlt of the flter /A(z/γ ) s less pronounced compared to the case when A(z) s computed based on the orgnal speech. Snce deemphass s performed at the decoder end, t can be shown that the quantzaton error spectrum s shaped by a flter havng a transfer functon W - (z)h de-emph (z)=/a(z/γ ). Thus, the spectrum of the quantzaton error s shaped by a flter whose transfer functon s /A(z/γ ), wth A(z) computed based on the preemphaszed speech sgnal. 5.4 Open-loop ptch analyss Dependng on the mode, open-loop ptch analyss s performed once per frame (each ms) or twce per frame (each ms) to fnd two estmates of the ptch lag n each frame. Ths s done n order to smplfy the ptch analyss and confne the closed loop ptch search to a small number of lags around the open-loop estmated lags. Open-loop ptch estmaton s based on the weghted speech sgnal sw ( whch s obtaned by flterng the nput speech sgnal through the weghtng flter W ( z) = A( z / γ ) H de emph ( z), where H de emph = and β =.68. βz That s, n a subframe of sze L, the weghted speech s gven by s 6 w( = = s( + aγ s( n ) + β sw( n ), n =,..., L. ( 5 ) The open-loop ptch analyss s performed to a sgnal decmated by two. The decmated sgnal s obtaned by flterng sw ( through a fourth order FIR flter H decm ( z ) and then downsamplng the output by two to obtan the sgnal s wd ( kbt/s mode Open-loop ptch analyss s performed once per frame (every ms) to fnd an estmate of the ptch lag n each frame. The open-loop ptch analyss s performed as follows. Frst, the correlaton of decmated weghted speech s determned for each ptch lag value d by: C 8 ( d ) s ( s ( n d ) w( d ), d = 7,, 5 = n= wd wd, ( 6 ) where w(d) s a weghtng functon. The estmated ptch-lag s the delay that maxmses the weghted correlaton functon C(d). The weghtng emphasses lower ptch lag values reducng the lkelhood of selectng a multple of the correct delay. The weghtng functon conssts of two parts: a low ptch lag emphass functon, w l (d), and a prevous frame lag neghbourng emphass functon, w n (d): The low ptch lag emphass functon s a gven by: w ( d ) w ( d ) w ( d ) =. ( 7 ) l n ( d ) cw( d ) w l = ( 8 ) where cw(d) s defned by a table n the fxed pont computatonal descrpton. The prevous frame lag neghbourng emphass functon depends on the ptch lag of prevous speech frames: ( T d + ), cw old 98 v >.8, wn ( d ) = ( 9 )., otherwse,

23 3 TS 6.9 V.. (-9) where T old s the medan fltered ptch lag of 5 prevous voced speech half-frames and v s an adaptve parameter. If the frame s classfed as voced by havng the open-loop gan g>.6, then the v-value s set to. for the next frame. Otherwse, the v-value s updated by v=.9v. The open loop gan s gven by: 7 wd n= n= ( s ( n d ) g = ( 3 ) 7 s s wd 7 wd max ( s ( n d ) wd n= where d max s the ptch delay that maxmzes C(d). The medan flter s updated only durng voced speech frames. The weghtng depends on the relablty of the old ptch lags. If prevous frames have contaned unvoced speech or slence, the weghtng s attenuated through the parameter v ,.65, 4.5, 5.85, 8.5, 9.85, 3.5 and 3.85 kbt/s modes Open-loop ptch analyss s performed twce per frame (every ms) to fnd two estmates of the ptch lag n each frame. The open-loop ptch analyss s performed as follows. Frst, the correlaton of decmated weghted speech s determned for each ptch lag value d by: C 63 max ( d ) s ( s ( n d ) w( d ), d = 7,, 5 = n= wd wd, ( 3 ) where w(d) s a weghtng functon. The estmated ptch-lag s the delay that maxmses the weghted correlaton functon C(d). The weghtng emphasses lower ptch lag values reducng the lkelhood of selectng a multple of the correct delay. The weghtng functon conssts of two parts: a low ptch lag emphass functon, w l (d), and a prevous frame lag neghbourng emphass functon, w n (d): w ( d ) w ( d ) w ( d ) The low ptch lag emphass functon s gven by: =. ( 3 ) ( d ) cw( d ) l n w l = ( 33 ) where cw(d) s defned by a table n the fxed pont computatonal descrpton. The prevous frame lag neghbourng emphass functon depends on the ptch lag of prevous speech frames: ( T d + ), cw old 98 v >.8, wn ( d ) = ( 34)., otherwse, where T old s the medan fltered ptch lag of 5 prevous voced speech half-frames and v s an adaptve parameter. If the frame s classfed as voced by havng the open-loop gan g>.6, then the v-value s set to. for the next frame. Otherwse, the v-value s updated by v=.9v. The open loop gan s gven by: n= ( s ( n d ) g = ( 35) wd n= s s wd 63 wd max ( s ( n d ) wd n= where d max s the ptch delay that maxmzes C(d). The medan flter s updated only durng voced speech frames. The weghtng depends on the relablty of the old ptch lags. If prevous frames have contaned unvoced speech or slence, the weghtng s attenuated through the parameter v. max

24 4 TS 6.9 V.. (-9) 5.5 Impulse response computaton = γ ˆ( s computed each The mpulse response, h(, of the weghted synthess flter H ( z) W ( z) A( z / ) H ( z) / A z) de emph subframe. Ths mpulse response s needed for the search of adaptve and fxed codebooks. The mpulse response h( s computed by flterng the vector of coeffcents of the flter A(z/γ ) extended by zeros through the two flters / ˆ( z) H z A and ( ) de emph. 5.6 Target sgnal computaton The target sgnal for adaptve codebook search s usually computed by subtractng the zero-nput response of the weghted synthess flter H ( z) W ( z) = A( z / γ ) Hde emph ( z) / Aˆ( z) from the weghted speech sgnal s w (. Ths s performed on a subframe bass. An equvalent procedure for computng the target sgnal, whch s used n ths codec, s the flterng of the LP resdual sgnal r( through the combnaton of synthess flter / A ˆ( z) and the weghtng flter A( z / γ ) H de emph ( z). After determnng the exctaton for the subframe, the ntal states of these flters are updated by flterng the dfference between the LP resdual and exctaton. The memory update of these flters s explaned n Secton 5.. The resdual sgnal r( whch s needed for fndng the target vector s also used n the adaptve codebook search to extend the past exctaton buffer. Ths smplfes the adaptve codebook search procedure for delays less than the subframe sze of 64 as wll be explaned n the next secton. The LP resdual s gven by 5.7 Adaptve codebook 6 r( = s( + aˆ s( n ), n =,...,63. ( 36 ) = Adaptve codebook search s performed on a subframe bass. It conssts of performng closed loop ptch search, and then computng the adaptve codevector by nterpolatng the past exctaton at the selected fractonal ptch lag. The adaptve codebook parameters (or ptch parameters) are the delay and gan of the ptch flter. In the search stage, the exctaton s extended by the LP resdual to smplfy the closed-loop search. In.65, 4.5, 5.85, 8.5, 9.85, 3.5 or 3.85 kbt/s modes, n the frst and thrd subframes, a fractonal ptch delay s used wth resolutons /4 n the range[34, ], resolutons / n the range [8, 59 ], and ntegers only n the range [6, 3]. For the second and fourth subframes, a ptch resoluton of /4 s always used n the range [T - 8, T ], where T s nearest nteger to the fractonal ptch lag of the prevous (st or 3rd) subframe. In 8.85 kbt/s mode, n the frst and thrd subframes, a fractonal ptch delay s used wth resolutons / n the range [34, 9 ], and ntegers only n the range [9, 3]. For the second and fourth subframes, a ptch resoluton of / s always used n the range [T -8, T +7 ], where T s nearest nteger to the fractonal ptch lag of the prevous (st or 3rd) subframe. In 6.6 kbt/s mode, n the frst subframe, a fractonal ptch delay s used wth resolutons / n the range [34,9 ], and ntegers only n the range [9, 3]. For the second, thrd and fourth subframes, a ptch resoluton of / s always used n the range [T -8, T +7 ], where T s nearest nteger to the fractonal ptch lag of the frst subframe. Closed-loop ptch analyss s performed around the open-loop ptch estmates on a subframe bass. In 8.85,.65, 4.5, 5.85, 8.5, 9.85, 3.5 or 3.85 kbt/s modes, n the frst (and thrd) subframe the range T op ±7, bounded by ,

25 5 TS 6.9 V.. (-9) s searched. In 6.6 kbt/s mode, n the frst subframe the range T op ±7, bounded by , s searched. For all the modes, for the other subframes, closed-loop ptch analyss s performed around the nteger ptch selected n the prevous subframe, as descrbed above. In.65, 4.5, 5.85, 8.5, 9.85, 3.5 or 3.85 kbt/s modes, the ptch delay s encoded wth 9 bts n the frst and thrd subframes and the relatve delay of the other subframes s encoded wth 6 bts. In 8.85 kbt/s mode, the ptch delay s encoded wth 8 bts n the frst and thrd subframes and the relatve delay of the other subframes s encoded wth 5 bts. In 6.6 kbt/s mode, the ptch delay s encoded wth 8 bts n the frst subframe and the relatve delay of the other subframes s encoded wth 5 bts. The closed loop ptch search s performed by mnmzng the mean-square weghted error between the orgnal and syntheszed speech. Ths s acheved by maxmzng the term 63 x( y ( ) n= k n T k =, ( 37 ) 63 y ( y ( n= k where x( s the target sgnal and y k ( s the past fltered exctaton at delay k (past exctaton convolved wth h(). Note that the search range s lmted around the open-loop ptch as explaned earler. The convoluton y k ( s computed for the frst delay n the searched range, and for the other delays, t s updated usng the recursve relaton k y ( = y ( n ) + u( k) h( ( 38 ) k k where u(,n= (3+7),,63, s the exctaton buffer. Note that n search stage, the samples u (, n =,, 63, are not known, and they are needed for ptch delays less than 64. To smplfy the search, the LP resdual s coped to u( n order to make the relaton n Equaton (38) vald for all delays. Once the optmum nteger ptch delay s determned, the fractons from to 4 wth a step of around that 4 nteger are tested. The fractonal ptch search s performed by nterpolatng the normalzed correlaton n Equaton (37) and searchng for ts maxmum. Once the fractonal ptch lag s determned, v'( s computed by nterpolatng the past exctaton sgnal u( at the gven phase (fracto. (The nterpolaton s performed usng two FIR flters (Hammng wndowed snc functons); one for nterpolatng the term n Equaton (34) wth the snc truncated at ±7 and the other for nterpolatng the past exctaton wth the snc truncated at ±63). The flters have ther cut-off frequency (-3 db) at 6 Hz n the oversampled doman, whch means that the nterpolaton flters exhbt low-pass frequency response Thus, even when the ptch delay s an nteger value, the adaptve codebook exctaton conssts of a low-pass fltered verson of the past exctaton at the gven delay and not a drect copy thereof. Further, for delays smaller than the subframe sze, the adaptve codebook exctaton s completed based on the low-pass fltered nterpolated past exctaton and not by repeatng the past exctaton. In order to enhance the ptch predcton performance n wdeband sgnals, a frequency-dependant ptch predctor s used. Ths s mportant n wdeband sgnals snce the perodcty doesn t necessarly extend over the whole spectrum. In ths algorthm, there are two sgnal paths assocated to respectve sets of ptch codebook parameters, wheren each sgnal path comprses a ptch predcton error calculatng devce for calculatng a ptch predcton error of a ptch codevector from a ptch codebook search devce. One of these two paths comprses a low-pass flter for flterng the ptch codevector and the ptch predcton error s calculated for these two sgnal paths. The sgnal path havng the lowest calculated ptch predcton error s selected, along wth the assocated ptch gan. The low pass flter used n the second path s n the form B LP (z)=.8z z -. Note that bt s used to encode the chosen path. Thus, for.65, 4.5, 5.85, 8.5, 9.85, 3.5 or 3.85 kbt/s modes, there are two possbltes to generate the adaptve codebook v(, v ( = v ( n the frst path, or v( = b ( + ) LP v ( n + ) n the second path, where b LP =[.8,.64,.8]. The path whch results n mnmum energy of the target sgnal x ( defned n Equaton (4) s selected for the fltered adaptve codebook vector. For 6.6 and 8.85 kbt/s modes, v( s always = = v ( = b ( + ) v ( n + ). LP

26 6 TS 6.9 V.. (-9) The adaptve codebook gan s then found by 63 x( y( n= g p, bounded by g., 63 p ( 39 ) y( y( = n= where y( = v( h( s the fltered adaptve codebook vector (zero-state response of H ( z) W ( z) to v (). To nsure stablty, the adaptve codebook gan g p s bounded by.95, f the adaptve codebook gans of the prevous subframes have been small and the LP flters of the prevous subframes have been close to beng unstable. 5.8 Algebrac codebook 5.8. Codebook structure The codebook structure s based on nterleaved sngle-pulse permutaton (ISPP) desgn. The 64 postons n the codevector are dvded nto 4 tracks of nterleaved postons, wth 6 postons n each track. The dfferent codebooks at the dfferent rates are constructed by placng a certan number of sgned pulses n the tracks (from to 6 pulses per track). The codebook ndex, or codeword, represents the pulse postons and sgns n each track. Thus, no codebook storage s needed, snce the exctaton vector at the decoder can be constructed through the nformaton contaned n the ndex tself (no lookup tables). An mportant feature of the used codebook s that t s a dynamc codebook consstng of an algebrac codebook followed by an adaptve preflter F(z) whch enhances specal spectral components n order to mprove the synthess speech qualty. A preflter relevant to wdeband sgnals s used whereby F(z) conssts of two parts: a perodcty enhancement part /(-.85z -T ) and a tlt part ( β z - ), where T s the nteger part of the ptch lag and β s related to the vocng of the prevous subframe and s bounded by [.,.5]. The codebook search s performed n the algebrac doman by combnng the flter F(z) wth the weghed synthess flter pror to the coddedbook search. Thus, the mpulse response h( must be modfed to nclude the preflter F(z). That s, h( h( * f (. The codebook structures of dfferent bt rates are gven below and 3.5 kbt/s mode In ths codebook, the nnovaton vector contans 4 non-zero pulses. All pulses can have the ampltudes + or -. The 64 postons n a subframe are dvded nto 4 tracks, where each track contans sx pulses, as shown n Table 4. Table 4. Potental postons of ndvdual pulses n the algebrac codebook, 3.85 and 3.5 kbt/s Track Pulse Postons, 4, 8,, 6,, 4, 8,, 6,, 4, 8, 3 36, 4, 44, 48, 5, 56, 6, 5, 9, 3, 7,, 5, 9, 3, 7,, 5, 9, 33, 37, 4, 45, 49, 53, 57, 6 3, 6,, 4, 8,, 6,, 4, 8,, 6, 3, 34, 38, 4, 46, 5, 54, 58, 6 4 3, 7,, 5, 9, 3 3, 7,, 5, 9, 3, 7, 3, 35, 39, 43, 47, 5, 55, 59, 63 The sx pulses n one track are encoded wth bts. Ths gves a total of 88 bts (+++) for the algebrac code kbt/s mode In ths codebook, the nnovaton vector contans 8 non-zero pulses. All pulses can have the ampltudes + or -. The 64 postons n a subframe are dvded nto 4 tracks, where each of the frst two tracks contans fve pulses and each of the other tracks contans four pulses, as shown n Table 5.

3GPP TS V6.1.1 ( )

3GPP TS V6.1.1 ( ) Technical Specification 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Speech codec speech processing functions; Adaptive Multi-Rate - Wideband (AMR-WB)

More information

Pulse Coded Modulation

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 information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 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 information

both covariance and autocorrelation methods use two step solutions 1. computation of a matrix of correlation values

both covariance and autocorrelation methods use two step solutions 1. computation of a matrix of correlation values Dgtal Speech Processng Lecture 4 Lnear Predctve Codng (LPC)-Lattce Lattce Methods, Applcatons Lattce Formulatons of LP both covarance and autocorrelaton methods use two step solutons. computaton of a matrx

More information

ETSI TS V7.0.0 ( )

ETSI TS V7.0.0 ( ) TS 6 9 V7.. (7-6) Technical Specification Digital cellular telecommunications system (Phase +); Universal Mobile Telecommunications System (UMTS); Speech codec speech processing functions; Adaptive Multi-Rate

More information

WARPED LINEAR PREDICTION FOR IMPROVED PERCEPTUAL QUALITY IN THE SCELP LOW DELAY AUDIO CODEC (W-SCELP)

WARPED LINEAR PREDICTION FOR IMPROVED PERCEPTUAL QUALITY IN THE SCELP LOW DELAY AUDIO CODEC (W-SCELP) ARPED LINEAR PREDICION FOR IMPROVED PERCEPUAL QUALIY IN HE SCELP LO DELAY AUDIO CODEC (-SCELP) Hauke Krüger and Peter Vary Insttute of Communcaton Systems and Data Processng RH Aachen Unversty, D-5256

More information

VQ widely used in coding speech, image, and video

VQ 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 information

Pop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing

Pop-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 information

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Lossy 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 information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 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 information

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, according to the name, is a four-dimensional variational method. 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The

More information

CSE4210 Architecture and Hardware for DSP

CSE4210 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 information

Digital Signal Processing

Digital Signal Processing Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over

More information

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl

Suppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty 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 information

Tracking with Kalman Filter

Tracking with Kalman Filter Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,

More information

Time-Varying Systems and Computations Lecture 6

Time-Varying Systems and Computations Lecture 6 Tme-Varyng Systems and Computatons Lecture 6 Klaus Depold 14. Januar 2014 The Kalman Flter The Kalman estmaton flter attempts to estmate the actual state of an unknown dscrete dynamcal system, gven nosy

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

Tutorial 2. COMP4134 Biometrics Authentication. February 9, Jun Xu, Teaching Asistant

Tutorial 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 information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

Chapter 13: Multiple Regression

Chapter 13: Multiple Regression Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to

More information

Lecture 10 Support Vector Machines II

Lecture 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 information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure 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 information

Kernel Methods and SVMs Extension

Kernel 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 information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

TOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION

TOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION 1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers:

More information

NON-LINEAR CONVOLUTION: A NEW APPROACH FOR THE AURALIZATION OF DISTORTING SYSTEMS

NON-LINEAR CONVOLUTION: A NEW APPROACH FOR THE AURALIZATION OF DISTORTING SYSTEMS NON-LINEAR CONVOLUTION: A NEW APPROAC FOR TE AURALIZATION OF DISTORTING SYSTEMS Angelo Farna, Alberto Belln and Enrco Armellon Industral Engneerng Dept., Unversty of Parma, Va delle Scenze 8/A Parma, 00

More information

Formulas for the Determinant

Formulas for the Determinant page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES COMPUTATIONAL FLUID DYNAMICS: FDM: Appromaton of Second Order Dervatves Lecture APPROXIMATION OF SECOMD ORDER DERIVATIVES. APPROXIMATION OF SECOND ORDER DERIVATIVES Second order dervatves appear n dffusve

More information

Negative Binomial Regression

Negative Binomial Regression STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...

More information

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system. Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and

More information

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry Workshop: Approxmatng energes and wave functons Quantum aspects of physcal chemstry http://quantum.bu.edu/pltl/6/6.pdf Last updated Thursday, November 7, 25 7:9:5-5: Copyrght 25 Dan Dll (dan@bu.edu) Department

More information

Lecture Notes on Linear Regression

Lecture 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 information

Lecture 5 Decoding Binary BCH Codes

Lecture 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 information

Problem Set 9 Solutions

Problem 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 information

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances

Annexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

3.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

3.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 information

1 Derivation of Point-to-Plane Minimization

1 Derivation of Point-to-Plane Minimization 1 Dervaton of Pont-to-Plane Mnmzaton Consder the Chen-Medon (pont-to-plane) framework for ICP. Assume we have a collecton of ponts (p, q ) wth normals n. We want to determne the optmal rotaton and translaton

More information

INTERNATIONAL TELECOMMUNICATION UNION. Wideband coding of speech at around 16 kbit/s using Adaptive Multi-Rate Wideband (AMR-WB)

INTERNATIONAL TELECOMMUNICATION UNION. Wideband coding of speech at around 16 kbit/s using Adaptive Multi-Rate Wideband (AMR-WB) INTERNATIONAL TELECOMMUNICATION UNION ITU-T TELECOMMUNICATION STANDARDIZATION SECTOR OF ITU G.722.2 (07/2003) SERIES G: TRANSMISSION SYSTEMS AND MEDIA, DIGITAL SYSTEMS AND NETWORKS Digital terminal equipments

More information

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1 C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned

More information

November 5, 2002 SE 180: Earthquake Engineering SE 180. Final Project

November 5, 2002 SE 180: Earthquake Engineering SE 180. Final Project SE 8 Fnal Project Story Shear Frame u m Gven: u m L L m L L EI ω ω Solve for m Story Bendng Beam u u m L m L Gven: m L L EI ω ω Solve for m 3 3 Story Shear Frame u 3 m 3 Gven: L 3 m m L L L 3 EI ω ω ω

More information

White Noise Reduction of Audio Signal using Wavelets Transform with Modified Universal Threshold

White Noise Reduction of Audio Signal using Wavelets Transform with Modified Universal Threshold Whte Nose Reducton of Audo Sgnal usng Wavelets Transform wth Modfed Unversal Threshold MATKO SARIC, LUKI BILICIC, HRVOJE DUJMIC Unversty of Splt R.Boskovca b.b, HR 1000 Splt CROATIA Abstract: - Ths paper

More information

Numerical Heat and Mass Transfer

Numerical 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 information

HMMT February 2016 February 20, 2016

HMMT February 2016 February 20, 2016 HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,

More information

ETSI TS V5.0.0 ( )

ETSI TS V5.0.0 ( ) Technical Specification Universal Mobile Telecommunications System (UMTS); AMR speech Codec; Transcoding Functions () 1 Reference RTS/TSGS-046090v500 Keywords UMTS 650 Route des Lucioles F-0691 Sophia

More information

Lecture 12: Discrete Laplacian

Lecture 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 information

CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER. In real environmental conditions the speech signal may be

CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER. In real environmental conditions the speech signal may be 55 CHAPTER 4 SPEECH ENHANCEMENT USING MULTI-BAND WIENER FILTER 4.1 Introducton In real envronmental condtons the speech sgnal may be supermposed by the envronmental nterference. In general, the spectrum

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

Appendix B: Resampling Algorithms

Appendix B: Resampling Algorithms 407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles

More information

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers

Psychology 282 Lecture #24 Outline Regression Diagnostics: Outliers Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.

More information

MACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression

MACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression 11 MACHINE APPLIED MACHINE LEARNING LEARNING MACHINE LEARNING Gaussan Mture Regresson 22 MACHINE APPLIED MACHINE LEARNING LEARNING Bref summary of last week s lecture 33 MACHINE APPLIED MACHINE LEARNING

More information

COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION. Erdem Bala, Dept. of Electrical and Computer Engineering,

COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION. Erdem Bala, Dept. of Electrical and Computer Engineering, COMPUTATIONALLY EFFICIENT WAVELET AFFINE INVARIANT FUNCTIONS FOR SHAPE RECOGNITION Erdem Bala, Dept. of Electrcal and Computer Engneerng, Unversty of Delaware, 40 Evans Hall, Newar, DE, 976 A. Ens Cetn,

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

( ) = ( ) + ( 0) ) ( )

( ) = ( ) + ( 0) ) ( ) EETOMAGNETI OMPATIBIITY HANDBOOK 1 hapter 9: Transent Behavor n the Tme Doman 9.1 Desgn a crcut usng reasonable values for the components that s capable of provdng a tme delay of 100 ms to a dgtal sgnal.

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor

Copyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data

More information

A Robust Method for Calculating the Correlation Coefficient

A Robust Method for Calculating the Correlation Coefficient A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal

More information

ETSI TS V ( )

ETSI TS V ( ) TS 146 060 V14.0.0 (2017-04) TECHNICAL SPECIFICATION Digital cellular telecommunications system (Phase 2+) (GSM); Enhanced Full Rate (EFR) speech transcoding (3GPP TS 46.060 version 14.0.0 Release 14)

More information

Entropy Coding. A complete entropy codec, which is an encoder/decoder. pair, consists of the process of encoding or

Entropy 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 information

Feb 14: Spatial analysis of data fields

Feb 14: Spatial analysis of data fields Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

Internet Engineering. Jacek Mazurkiewicz, PhD Softcomputing. Part 3: Recurrent Artificial Neural Networks Self-Organising Artificial Neural Networks

Internet Engineering. Jacek Mazurkiewicz, PhD Softcomputing. Part 3: Recurrent Artificial Neural Networks Self-Organising Artificial Neural Networks Internet Engneerng Jacek Mazurkewcz, PhD Softcomputng Part 3: Recurrent Artfcal Neural Networks Self-Organsng Artfcal Neural Networks Recurrent Artfcal Neural Networks Feedback sgnals between neurons Dynamc

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance 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 information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

More information

Lecture 3: Shannon s Theorem

Lecture 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 information

Common loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:

Common loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule: 15-745 Lecture 6 Data Dependence n Loops Copyrght Seth Goldsten, 2008 Based on sldes from Allen&Kennedy Lecture 6 15-745 2005-8 1 Common loop optmzatons Hostng of loop-nvarant computatons pre-compute before

More information

Composite Hypotheses testing

Composite 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 information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

Research Article Green s Theorem for Sign Data

Research 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 information

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem

Speeding 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 information

Asymptotic Quantization: A Method for Determining Zador s Constant

Asymptotic 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 information

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k)

Hongyi Miao, College of Science, Nanjing Forestry University, Nanjing ,China. (Received 20 June 2013, accepted 11 March 2014) I)ϕ (k) ISSN 1749-3889 (prnt), 1749-3897 (onlne) Internatonal Journal of Nonlnear Scence Vol.17(2014) No.2,pp.188-192 Modfed Block Jacob-Davdson Method for Solvng Large Sparse Egenproblems Hongy Mao, College of

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, 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 information

Estimating the Fundamental Matrix by Transforming Image Points in Projective Space 1

Estimating the Fundamental Matrix by Transforming Image Points in Projective Space 1 Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com

More information

12. The Hamilton-Jacobi Equation Michael Fowler

12. The Hamilton-Jacobi Equation Michael Fowler 1. The Hamlton-Jacob Equaton Mchael Fowler Back to Confguraton Space We ve establshed that the acton, regarded as a functon of ts coordnate endponts and tme, satsfes ( ) ( ) S q, t / t+ H qpt,, = 0, and

More information

Consider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder.

Consider 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 information

Chapter 6. Supplemental Text Material

Chapter 6. Supplemental Text Material Chapter 6. Supplemental Text Materal S6-. actor Effect Estmates are Least Squares Estmates We have gven heurstc or ntutve explanatons of how the estmates of the factor effects are obtaned n the textboo.

More information

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:

More information

Exercises. 18 Algorithms

Exercises. 18 Algorithms 18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)

More information

The internal structure of natural numbers and one method for the definition of large prime numbers

The internal structure of natural numbers and one method for the definition of large prime numbers The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract

More information

Error Probability for M Signals

Error 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 information

Originated from experimental optimization where measurements are very noisy Approximation can be actually more accurate than

Originated from experimental optimization where measurements are very noisy Approximation can be actually more accurate than Surrogate (approxmatons) Orgnated from expermental optmzaton where measurements are ver nos Approxmaton can be actuall more accurate than data! Great nterest now n applng these technques to computer smulatons

More information

An Algorithm to Solve the Inverse Kinematics Problem of a Robotic Manipulator Based on Rotation Vectors

An Algorithm to Solve the Inverse Kinematics Problem of a Robotic Manipulator Based on Rotation Vectors An Algorthm to Solve the Inverse Knematcs Problem of a Robotc Manpulator Based on Rotaton Vectors Mohamad Z. Al-az*, Mazn Z. Othman**, and Baker B. Al-Bahr* *AL-Nahran Unversty, Computer Eng. Dep., Baghdad,

More information

Boostrapaggregating (Bagging)

Boostrapaggregating (Bagging) Boostrapaggregatng (Baggng) An ensemble meta-algorthm desgned to mprove the stablty and accuracy of machne learnng algorthms Can be used n both regresson and classfcaton Reduces varance and helps to avod

More information

International Journal of Pure and Applied Sciences and Technology

International Journal of Pure and Applied Sciences and Technology Int. J. Pure Appl. Sc. Technol., 4() (03), pp. 5-30 Internatonal Journal of Pure and Appled Scences and Technology ISSN 9-607 Avalable onlne at www.jopaasat.n Research Paper Schrödnger State Space Matrx

More information

2016 Wiley. Study Session 2: Ethical and Professional Standards Application

2016 Wiley. Study Session 2: Ethical and Professional Standards Application 6 Wley Study Sesson : Ethcal and Professonal Standards Applcaton LESSON : CORRECTION ANALYSIS Readng 9: Correlaton and Regresson LOS 9a: Calculate and nterpret a sample covarance and a sample correlaton

More information

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013 ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E 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 information

What would be a reasonable choice of the quantization step Δ?

What 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 information

Transform Coding. Transform Coding Principle

Transform 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 information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

Flexible Quantization

Flexible 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 information

Chapter - 2. Distribution System Power Flow Analysis

Chapter - 2. Distribution System Power Flow Analysis Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load

More information