ARIB STD-T V Spreading and modulation (FDD) (Release 1999)

Size: px
Start display at page:

Download "ARIB STD-T63-25.213 V3.9.0. Spreading and modulation (FDD) (Release 1999)"

Transcription

1 ARIB STD-T V3.9.0 Spreadig ad modulatio (FDD) (Release 1999) Refer to "Idustrial Property Rights (IPR)" i the preface of ARIB STD-T63 for Related Idustrial Property Rights. Refer to "Notice" i the preface of ARIB STD-T63 for Copyrights.

2 TS 5.13 V3.9.0 (003-1) Techical Specificatio 3rd Geeratio Partership Project; Techical Specificatio Group Radio Access Network; Spreadig ad modulatio (FDD) (Release 1999) The preset documet has bee developed withi the 3 rd Geeratio Partership Project ( TM ) ad may be further elaborated for the purposes of. The preset documet has ot bee subject to ay approval process by the Orgaisatioal Parters ad shall ot be implemeted. This Specificatio is provided for future developmet work withi oly. The Orgaisatioal Parters accept o liability for ay use of this Specificatio. Specificatios ad reports for implemetatio of the TM system should be obtaied via the Orgaisatioal Parters' Publicatios Offices.

3 TS 5.13 V3.9.0 (003-1) Keywords UMTS, radio, modulatio, layer 1 Postal address support office address 650 Route des Lucioles - Sophia Atipolis Valboe - FRANCE Tel.: Fax: Iteret Copyright Notificatio No part may be reproduced except as authorized by writte permissio. The copyright ad the foregoig restrictio exted to reproductio i all media. 004, Orgaizatioal Parters (ARIB, CCSA, ETSI, T1, TTA, TTC). All rights reserved.

4 3 TS 5.13 V3.9.0 (003-1) Cotets Foreword Scope...7 Refereces Symbols ad abbreviatios Symbols Abbreviatios Uplik spreadig ad modulatio Overview Spreadig DPCCH/DPDCH PRACH PRACH preamble part PRACH message part PCPCH PCPCH preamble part PCPCH message part Code geeratio ad allocatio Chaelizatio codes Code defiitio Code allocatio for DPCCH/DPDCH Code allocatio for PRACH message part Code allocatio for PCPCH message part Chaelisatio code for PCPCH power cotrol preamble Scramblig codes Geeral Log scramblig sequece Short scramblig sequece DPCCH/DPDCH scramblig code PRACH message part scramblig code PCPCH message part scramblig code PCPCH power cotrol preamble scramblig code PRACH preamble codes Preamble code costructio Preamble scramblig code Preamble sigature PCPCH preamble codes Access preamble Access preamble code costructio Access preamble scramblig code Access preamble sigature CD preamble CD preamble code costructio CD preamble scramblig code CD preamble sigature Modulatio Modulatig chip rate Modulatio Dowlik spreadig ad modulatio Spreadig Code geeratio ad allocatio Chaelizatio codes Scramblig code Sychroisatio codes Code geeratio...

5 4 TS 5.13 V3.9.0 (003-1) Code allocatio of SSC Modulatio Modulatig chip rate Modulatio... 5 Aex A (iformative): Geeralised Hierarchical Golay Sequeces...6 A.1 Alterative geeratio...6 Aex B (iformative): Chage history...7

6 5 TS 5.13 V3.9.0 (003-1) Foreword This Techical Specificatio (TS) has bee produced by the 3 rd Geeratio Partership Project (). The cotets of the preset documet are subject to cotiuig work withi the TSG ad may chage followig formal TSG approval. Should the TSG modify the cotets of the preset documet, it will be re-released by the TSG with a idetifyig chage of release date ad a icrease i versio umber as follows: Versio x.y.z where: x the first digit: 1 preseted to TSG for iformatio; preseted to TSG for approval; 3 or greater idicates TSG approved documet uder chage cotrol. y the secod digit is icremeted for all chages of substace, i.e. techical ehacemets, correctios, updates, etc. z the third digit is icremeted whe editorial oly chages have bee icorporated i the documet.

7 6 TS 5.13 V3.9.0 (003-1) 1 Scope The preset documet describes spreadig ad modulatio for UTRA Physical Layer FDD mode. Refereces The followig documets cotai provisios which, through referece i this text, costitute provisios of the preset documet. Refereces are either specific (idetified by date of publicatio, editio umber, versio umber, etc.) or o-specific. For a specific referece, subsequet revisios do ot apply. For a o-specific referece, the latest versio applies. I the case of a referece to a documet (icludig a GSM documet), a o-specific referece implicitly refers to the latest versio of that documet i the same Release as the preset documet. [1] 3G TS 5.01: "Physical layer - geeral descriptio". [] 3G TS 5.11: "Physical chaels ad mappig of trasport chaels oto physical chaels (FDD)." [3] 3G TS 5.101: "UE Radio trasmissio ad Receptio (FDD)". [4] 3G TS 5.104: "UTRA (BS) FDD; Radio trasmissio ad Receptio". 3 Symbols ad abbreviatios 3.1 Symbols For the purposes of the preset documet, the followig symbols apply: C ch,sf, : C pre,,s : C c-acc,,s : C c-cd,,s : C sig,s : S dpch, : S r-pre, : S r-msg, : S c-acc : S c-cd : S c-msg, : S dl, : C psc : C ssc, : :th chaelisatio code with spreadig factor SF PRACH preamble code for :th preamble scramblig code ad sigature s PCPCH access preamble code for :th preamble scramblig code ad sigature s PCPCH CD preamble code for :th preamble scramblig code ad sigature s PRACH/PCPCH sigature code for sigature s :th DPCCH/DPDCH uplik scramblig code :th PRACH preamble scramblig code :th PRACH message scramblig code :th PCPCH access preamble scramblig code :th PCPCH CD preamble scramblig code :th PCPCH message scramblig code DL scramblig code PSC code :th SSC code 3. Abbreviatios For the purposes of the preset documet, the followig abbreviatios apply: AICH AP Acquisitio Idicator Chael Access Preamble

8 7 TS 5.13 V3.9.0 (003-1) BCH CCPCH CD CPCH CPICH DCH DPCH DPCCH DPDCH FDD Mcps OVSF PDSCH PICH PRACH PSC RACH SCH SSC SF UE Broadcast Cotrol Chael Commo Cotrol Physical Chael Collisio Detectio Commo Packet Chael Commo Pilot Chael Dedicated Chael Dedicated Physical Chael Dedicated Physical Cotrol Chael Dedicated Physical Data Chael Frequecy Divisio Duplex Mega Chip Per Secod Orthogoal Variable Spreadig Factor (codes) Physical Dedicated Shared Chael Page Idicatio Chael Physical Radom Access Chael Primary Sychroisatio Code Radom Access Chael Sychroisatio Chael Secodary Sychroisatio Code Spreadig Factor User Equipmet 4 Uplik spreadig ad modulatio 4.1 Overview Spreadig is applied to the physical chaels. It cosists of two operatios. The first is the chaelizatio operatio, which trasforms every data symbol ito a umber of chips, thus icreasig the badwidth of the sigal. The umber of chips per data symbol is called the Spreadig Factor (SF). The secod operatio is the scramblig operatio, where a scramblig code is applied to the spread sigal. With the chaelizatio, data symbols o so-called I- ad Q-braches are idepedetly multiplied with a OVSF code. With the scramblig operatio, the resultat sigals o the I- ad Q-braches are further multiplied by complex-valued scramblig code, where I ad Q deote real ad imagiary parts, respectively. 4. Spreadig 4..1 DPCCH/DPDCH Figure 1 illustrates the priciple of the uplik spreadig of DPCCH ad DPDCHs. The biary DPCCH ad DPDCHs to be spread are represeted by real-valued sequeces, i.e. the biary value "0" is mapped to the real value +1, while the biary value "1" is mapped to the real value 1. The DPCCH is spread to the chip rate by the chaelizatio code c c, while the :th DPDCH called DPDCH is spread to the chip rate by the chaelizatio code c d,. Oe DPCCH ad up to six parallel DPDCHs ca be trasmitted simultaeously, i.e. 1 6.

9 8 TS 5.13 V3.9.0 (003-1) c d,1 β d DPDCH 1 c d,3 β d DPDCH 3 Σ I c d,5 β d DPDCH 5 S dpch, I+jQ c d, β d S DPDCH c d,4 β d DPDCH 4 DPDCH 6 c d,6 β d Σ Q c c β c j DPCCH Figure 1: Spreadig for uplik DPCCH ad DPDCHs After chaelizatio, the real-valued spread sigals are weighted by gai factors, β c for DPCCH ad β d for all DPDCHs. At every istat i time, at least oe of the values β c ad β d has the amplitude 1.0. The β-values are quatized ito 4 bit words. The quatizatio steps are give i table 1. Table 1: The quatizatio of the gai parameters Sigallig values for β c ad β d / /15 1 1/ / /15 9 9/15 8 8/15 7 7/15 6 6/15 5 5/15 4 4/15 3 3/15 /15 1 1/15 0 Switch off Quatized amplitude ratios β c ad β d

10 9 TS 5.13 V3.9.0 (003-1) After the weightig, the stream of real-valued chips o the I- ad Q-braches are the summed ad treated as a complex-valued stream of chips. This complex-valued sigal is the scrambled by the complex-valued scramblig code S dpch,. The scramblig code is applied aliged with the radio frames, i.e. the first scramblig chip correspods to the begiig of a radio frame. 4.. PRACH PRACH preamble part The PRACH preamble part cosists of a complex-valued code, described i sectio PRACH message part Figure illustrates the priciple of the spreadig ad scramblig of the PRACH message part, cosistig of data ad cotrol parts. The biary cotrol ad data parts to be spread are represeted by real-valued sequeces, i.e. the biary value "0" is mapped to the real value +1, while the biary value "1" is mapped to the real value 1. The cotrol part is spread to the chip rate by the chaelizatio code c c, while the data part is spread to the chip rate by the chaelizatio code c d. c d β d PRACH message data part I I+jQ S r-msg, PRACH message cotrol part Q S c c β c j Figure : Spreadig of PRACH message part After chaelizatio, the real-valued spread sigals are weighted by gai factors, β c for the cotrol part ad β d for the data part. At every istat i time, at least oe of the values β c ad β d has the amplitude 1.0. The β-values are quatized ito 4 bit words. The quatizatio steps are give i sectio After the weightig, the stream of real-valued chips o the I- ad Q-braches are treated as a complex-valued stream of chips. This complex-valued sigal is the scrambled by the complex-valued scramblig code S r-msg,. The 10 ms scramblig code is applied aliged with the 10 ms message part radio frames, i.e. the first scramblig chip correspods to the begiig of a message part radio frame PCPCH PCPCH preamble part The PCPCH preamble part cosists of a complex-valued code, described i sectio PCPCH message part Figure 3 illustrates the priciple of the spreadig of the PCPCH message part, cosistig of data ad cotrol parts. The biary cotrol ad data parts to be spread are represeted by real-valued sequeces, i.e. the biary value "0" is mapped to the real value +1, while the biary value "1" is mapped to the real value 1. The cotrol part is spread to the chip rate by the chaelizatio code c c, while the data part is spread to the chip rate by the chaelizatio code c d.

11 10 TS 5.13 V3.9.0 (003-1) c d β d PCPCH message data part I I+jQ S c-msg, PCPCH message cotrol part Q S c c β c j Figure 3: Spreadig of PCPCH message part After chaelizatio, the real-valued spread sigals are weighted by gai factors, β c for the cotrol part ad β d for the data part. At every istat i time, at least oe of the values β c ad β d has the amplitude 1.0. The β-values are quatized ito 4 bit words. The quatizatio steps are give i sectio After the weightig, the stream of real-valued chips o the I- ad Q-braches are treated as a complex-valued stream of chips. This complex-valued sigal is the scrambled by the complex-valued scramblig code S c-msg,. The 10 ms scramblig code is applied aliged with the 10 ms message part radio frames, i.e. the first scramblig chip correspods to the begiig of a message part radio frame. 4.3 Code geeratio ad allocatio Chaelizatio codes Code defiitio The chaelizatio codes of figure 1 are Orthogoal Variable Spreadig Factor (OVSF) codes that preserve the orthogoality betwee a user s differet physical chaels. The OVSF codes ca be defied usig the code tree of figure 4. C ch,1,0 = (1) C ch,,0 = (1,1) C ch,,1 = (1,-1) C ch,4,0 =(1,1,1,1) C ch,4,1 = (1,1,-1,-1) C ch,4, = (1,-1,1,-1) C ch,4,3 = (1,-1,-1,1) SF = 1 SF = SF = 4 Figure 4: Code-tree for geeratio of Orthogoal Variable Spreadig Factor (OVSF) codes I figure 4, the chaelizatio codes are uiquely described as C ch,sf,k, where SF is the spreadig factor of the code ad k is the code umber, 0 k SF-1.

12 11 TS 5.13 V3.9.0 (003-1) Each level i the code tree defies chaelizatio codes of legth SF, correspodig to a spreadig factor of SF i figure 4. The geeratio method for the chaelizatio code is defied as: C ch,1,0 = 1, C C ch,,0 ch,,1 C = C ch,1,0 ch,1,0 C C ch,1,0 ch,1,0 1 = C C C C C C ch, ( + 1),0 ch, ( + 1),1 ch, ( + 1), ch, ( + 1),3 : ch, ( + 1), ( + 1) ch, ( + 1), ( + 1) 1 C ch, C ch, C ch, = C ch, : C ch,, C ch,,,0,0,1,1 1 1 C C C C C C ch,,0 ch,,0 ch,,1 ch,,1 : ch,, 1 ch,, 1 The leftmost value i each chaelizatio code word correspods to the chip trasmitted first i time Code allocatio for DPCCH/DPDCH For the DPCCH ad DPDCHs the followig applies: - The DPCCH is always spread by code c c = C ch,56,0. - Whe oly oe DPDCH is to be trasmitted, DPDCH 1 is spread by code c d,1 = C ch,sf,k where SF is the spreadig factor of DPDCH 1 ad k= SF / 4. - Whe more tha oe DPDCH is to be trasmitted, all DPDCHs have spreadig factors equal to 4. DPDCH is spread by the the code c d, = C ch,4,k, where k = 1 if {1, }, k = 3 if {3, 4}, ad k = if {5, 6}. If a power cotrol preamble is used to iitialise a DCH, the chaelisatio code for the DPCCH durig the power cotrol preamble shall be the same as that to be used afterwards Code allocatio for PRACH message part The preamble sigature s, 0 s 15, poits to oe of the 16 odes i the code-tree that correspods to chaelizatio codes of legth 16. The sub-tree below the specified ode is used for spreadig of the message part. The cotrol part is spread with the chaelizatio code c c (as show i sectio 4...) of spreadig factor 56 i the lowest brach of the sub-tree, i.e. c c = C ch,56,m where m = 16 s The data part uses ay of the chaelizatio codes from spreadig factor 3 to 56 i the upper-most brach of the sub-tree. To be exact, the data part is spread by chaelizatio code c d = C ch,sf,m ad SF is the spreadig factor used for the data part ad m = SF s/ Code allocatio for PCPCH message part For the cotrol part ad data part the followig applies: - The cotrol part is always spread by code c c =C ch,56,0. - The data part is spread by code c d =C ch,sf,k where SF is the spreadig factor of the data part ad k=sf/4. The data part may use the code from spreadig factor 4 to 56. A UE is allowed to icrease SF durig the message trasmissio o a frame by frame basis.

13 1 TS 5.13 V3.9.0 (003-1) Chaelisatio code for PCPCH power cotrol preamble The chaelisatio code for the PCPCH power cotrol preamble is the same as that used for the cotrol part of the message part, as described i sectio above Scramblig codes Geeral All uplik physical chaels are subjected to scramblig with a complex-valued scramblig code. The DPCCH/DPDCH may be scrambled by either log or short scramblig codes, defied i sectio The PRACH message part is scrambled with a log scramblig code, defied i sectio Also the PCPCH message part is scrambled with a log scramblig code, defied i sectio There are 4 log ad 4 short uplik scramblig codes. Uplik scramblig codes are assiged by higher layers. The log scramblig code is built from costituet log sequeces defied i sectio 4.3.., while the costituet short sequeces used to build the short scramblig code are defied i sectio Log scramblig sequece The log scramblig sequeces c log,1, ad c log,, are costructed from positio wise modulo sum of chip segmets of two biary m-sequeces geerated by meas of two geerator polyomials of degree 5. Let x, ad y be the two m-sequeces respectively. The x sequece is costructed usig the primitive (over GF()) polyomial X 5 +X The y sequece is costructed usig the polyomial X 5 +X 3 +X +X+1. The resultig sequeces thus costitute segmets of a set of Gold sequeces. The sequece c log,, is a chip shifted versio of the sequece c log,1,. Let 3 0 be the 4 bit biary represetatio of the scramblig sequece umber with 0 beig the least sigificat bit. The x sequece depeds o the chose scramblig sequece umber ad is deoted x, i the sequel. Furthermore, let x (i) ad y(i) deote the i:th symbol of the sequece x ad y, respectively. The m-sequeces x ad y are costructed as: Iitial coditios: - x (0)= 0, x (1)= 1, =x ()=,x (3)= 3, x (4)=1. - y(0)=y(1)= =y(3)= y(4)=1. Recursive defiitio of subsequet symbols: - x (i+5) =x (i+3) + x (i) modulo, i=0,, y(i+5) = y(i+3)+y(i+) +y(i+1) +y(i) modulo, i=0,, 5-7. Defie the biary Gold sequece z by: - z (i) = x (i) + y(i) modulo, i = 0, 1,,, 5 -. The real valued Gold sequece Z is defied by: Z + 1 if z ( i) = 0 ( i) = for i = 0,1, K, 1 if z ( i) = 1 Now, the real-valued log scramblig sequeces c log,1, ad c log,, are defied as follows: c log,1, (i) = Z (i), i = 0, 1,,, 5 ad 5 c log,, (i) = Z ((i ) modulo ( 5 1)), i = 0, 1,,, 5. Fially, the complex-valued log scramblig sequece C log,, is defied as:.

14 C 13 ( + j ) i ( 1) clog, ( / ) ( i) = clog,1, ( i) 1, log, i TS 5.13 V3.9.0 (003-1) where i = 0, 1,, 5 ad deotes roudig to earest lower iteger. c log,1, MSB LSB c log,, Figure 5: Cofiguratio of uplik scramblig sequece geerator Short scramblig sequece The short scramblig sequeces c short,1, (i) ad c short,, (i) are defied from a sequece from the family of periodically exteded S() codes. Let 3 0 be the 4 bit biary represetatio of the code umber. The :th quaterary S() sequece z (i), , is obtaied by modulo 4 additio of three sequeces, a quaterary sequece a(i) ad two biary sequeces b(i) ad d(i), where the iitial loadig of the three sequeces is determied from the code umber. The sequece z (i) of legth 55 is geerated accordig to the followig relatio: - z (i) = a(i) + b(i) + d(i) modulo 4, i = 0, 1,, 54; where the quaterary sequece a(i) is geerated recursively by the polyomial g 0 (x)= x 8 +x 5 +3x 3 +x +x+1 as: - a(0) = modulo 4; - a(i) = i modulo 4, i = 1,,, 7; - a(i) = 3a(i-3) + a(i-5) + 3a(i-6) + a(i-7) + 3a(i-8) modulo 4, i = 8, 9,, 54; ad the biary sequece b(i) is geerated recursively by the polyomial g 1 (x)= x 8 +x 7 +x 5 +x+1 as b(i) = 8+i modulo, i = 0, 1,, 7, b(i) = b(i-1) + b(i-3) + b(i-7) + b(i-8) modulo, i = 8, 9,, 54, ad the biary sequece d(i) is geerated recursively by the polyomial g (x)= x 8 +x 7 +x 5 +x 4 +1 as: d(i) = 16+i modulo, i = 0, 1,, 7; d(i) = d(i-1) + d(i-3) + d(i-4) + d(i-8) modulo, i = 8, 9,, 54. The sequece z (i) is exteded to legth 56 chips by settig z (55) = z (0). The mappig from z (i) to the real-valued biary sequeces c short,1, (i) ad c short,, (i),, i = 0, 1,, 55 is defied i Table.

15 14 TS 5.13 V3.9.0 (003-1) Table : Mappig from z (i) to c short,1, (i) ad c short,, (i), i = 0, 1,, 55 z (i) c short,1,(i) c short,,(i) Fially, the complex-valued short scramblig sequece C short,, is defied as: C ( i) = cshort,1, ( i mod 56) 1, ( + j ) i ( 1) cshort, ( ( mod 56) / ) short, i where i = 0, 1,, ad deotes roudig to earest lower iteger. A implemetatio of the short scramblig sequece geerator for the 55 chip sequece to be exteded by oe chip is show i Figure d(i) mod + mod additio multiplicatio mod 1 0 b(i) mod 4 + z (i) Mapper cshort,1,(i) cshort,,(i) a(i) mod Figure 6: Uplik short scramblig sequece geerator for 55 chip sequece DPCCH/DPDCH scramblig code The code used for scramblig of the uplik DPCCH/DPDCH may be of either log or short type. Whe the scramblig code is formed, differet cosituet codes are used for the log ad short type as defied below. The :th uplik scramblig code for DPCCH/DPDCH, deoted S dpch,, is defied as: S dpch, (i) = C log, (i), i = 0, 1,, 38399, whe usig log scramblig codes; where the lowest idex correspods to the chip trasmitted first i time ad C log, is defied i sectio The :th uplik scramblig code for DPCCH/DPDCH, deoted S dpch,, is defied as: S dpch, (i) = C short, (i), i = 0, 1,, 38399, whe usig short scramblig codes; where the lowest idex correspods to the chip trasmitted first i time ad C short, is defied i sectio PRACH message part scramblig code The scramblig code used for the PRACH message part is 10 ms log, ad there are 819 differet PRACH scramblig codes defied.

16 15 TS 5.13 V3.9.0 (003-1) The :th PRACH message part scramblig code, deoted S r-msg,, where = 0, 1,, 8191, is based o the log scramblig sequece ad is defied as: S r-msg, (i) = C log, (i ), i = 0, 1,, where the lowest idex correspods to the chip trasmitted first i time ad C log, is defied i sectio The message part scramblig code has a oe-to-oe correspodece to the scramblig code used for the preamble part. For oe PRACH, the same code umber is used for both scramblig codes, i.e. if the PRACH preamble scramblig code used is S r-pre,m the the PRACH message part scramblig code is S r-msg,m, where the umber m is the same for both codes PCPCH message part scramblig code The set of scramblig codes used for the PCPCH message part are 10 ms log, cell-specific, ad each scramblig code has a oe-to-oe correspodece to the sigature sequece ad the access sub-chael used by the access preamble part. Both log or short scramblig codes ca be used to scramble the CPCH message part. There are 64 uplik scramblig codes defied per cell ad 3768 differet PCPCH scramblig codes defied i the system. The :th PCPCH message part scramblig code, deoted S c-msg,,, where =819,8193,,40959 scramblig sequece ad is defied as: is based o the I the case whe the log scramblig codes are used: S c-msg, (i) = C log, (i ), i = 0, 1,, where the lowest idex correspods to the chip trasmitted first i time ad C log, is defied i sectio I the case the short scramblig codes are used: S c-msg, (i) = C short, (i), i = 0, 1,, The 3768 PCPCH scramblig codes are divided ito 51 groups with 64 codes i each group. There is a oe-to-oe correspodece betwee the group of PCPCH preamble scramblig codes i a cell ad the primary scramblig code used i the dowlik of the cell. The k:th PCPCH scramblig code withi the cell with dowlik primary scramblig code m, k =16,17,, 79 ad m = 0, 1,,, 511, is S c-msg, as defied above with = 64 m + k PCPCH power cotrol preamble scramblig code The scramblig code for the PCPCH power cotrol preamble is the same as for the PCPCH message part, as described i sectio above. The phase of the scramblig code shall be such that the ed of the code is aliged with the frame boudary at the ed of the power cotrol preamble PRACH preamble codes Preamble code costructio The radom access preamble code C pre,, is a complex valued sequece. It is built from a preamble scramblig code S r-pre, ad a preamble sigature C sig,s as follows: - C pre,,s (k) = S r-pre, (k) C sig,s (k) e ( π π j + ) 4 k, k = 0, 1,, 3,, 4095; where k=0 correspods to the chip trasmitted first i time ad S r-pre, ad C sig,s are defied i ad below respectively Preamble scramblig code The scramblig code for the PRACH preamble part is costructed from the log scramblig sequeces. There are 819 PRACH preamble scramblig codes i total. The :th preamble scramblig code, = 0, 1,, 8191, is defied as:

17 16 TS 5.13 V3.9.0 (003-1) S r-pre, (i) = c log,1, (i), i = 0, 1,, 4095; where the sequece c log,1, is defied i sectio The 819 PRACH preamble scramblig codes are divided ito 51 groups with 16 codes i each group. There is a oeto-oe correspodece betwee the group of PRACH preamble scramblig codes i a cell ad the primary scramblig code used i the dowlik of the cell. The k:th PRACH preamble scramblig code withi the cell with dowlik primary scramblig code m, k = 0, 1,,, 15 ad m = 0, 1,,, 511, is S r-pre, (i) as defied above with = 16 m + k Preamble sigature The preamble sigature correspodig to a sigature s cosists of 56 repetitios of a legth 16 sigature P s (), =0 15. This is defied as follows: - C sig,s (i) = P s (i modulo 16), i = 0, 1,, The sigature P s () is from the set of 16 Hadamard codes of legth 16. These are listed i table 3. Table 3: Preamble sigatures Preamble Value of sigature P 0() P 1() P () P 3() P 4() P 5() P 6() P 7() P 8() P 9() P 10() P 11() P 1() P 13() P 14() P 15() PCPCH preamble codes Access preamble Access preamble code costructio Similar to PRACH access preamble codes, the PCPCH access preamble codes C c-acc,,s, are complex valued sequeces. The PCPCH access preamble codes are built from the preamble scramblig codes S c-acc, ad a preamble sigature C sig,s as follows: - C c-acc,,s (k) = S c-acc, (k) C sig,s (k) e ( π π j + ) 4 k, k = 0, 1,, 3,, 4095; - where S c-acc, ad C sig,s are defied i sectio ad below respectively Access preamble scramblig code The scramblig code for the PCPCH preamble part is costructed from the log scramblig sequeces. There are PCPCH access preamble scramblig codes i total. The :th PCPCH access preamble scramblig code, where = 0,..., is defied as:

18 17 TS 5.13 V3.9.0 (003-1) - S c-acc, (i) = c log,1, (i), i = 0, 1,, 4095; where the sequece c log,1, is defied i sectio The PCPCH access preamble scramblig codes are divided ito 51 groups with 80 codes i each group. There is a oe-to-oe correspodece betwee the group of PCPCH access preamble scramblig codes i a cell ad the primary scramblig code used i the dowlik of the cell. The k:th PCPCH scramblig code withi the cell with dowlik primary scramblig code m, for k = 0,..., 79 ad m = 0, 1,,, 511, is S c-acc, as defied above with =16 m+k for k=0,...,15 ad = 64 m + (k-16)+819 for k=16,..., 79. The idex k = 0,...,15 may oly be used as a PCPCH access preamble part scramblig code if the same code is also used for a PRACH. The idex k=16,..., 79 correspod to PCPCH access preamble scramblig codes which are ot shared together with a PRACH. This leads to 3768 PCPCH specific preamble scramblig codes divided ito 51 groups with 64 elemets Access preamble sigature The access preamble part of the CPCH-access burst carries oe of the sixtee differet orthogoal complex sigatures idetical to the oes used by the preamble part of the radom-access burst CD preamble CD preamble code costructio Similar to PRACH access preamble codes, the PCPCH CD preamble codes C c-cd,,s are complex valued sequeces. The PCPCH CD preamble codes are built from the preamble scramblig codes Sc-cd, ad a preamble sigature C sig,s as follows: - C c-cd,,s (k) = S c-cd, (k) C sig,s (k) e ( π π j + ) 4 k, k = 0, 1,, 3,, 4095; where S c-cd, ad C sig,s are defied i sectios ad below respectively CD preamble scramblig code There are PCPCH-CD preamble scramblig codes i total. The :th PCPCH CD access preamble scramblig code, where = 0,..., 40959, is defied as: - S c-cd, (i) = c log,1, (i), i = 0, 1,, 4095; where the sequece c log,1, is defied i sectio The PCPCH scramblig codes are divided ito 51 groups with 80 codes i each group. There is a oe-to-oe correspodece betwee the group of PCPCH CD preamble scramblig codes i a cell ad the primary scramblig code used i the dowlik of the cell. The k:th PCPCH scramblig code withi the cell with dowlik primary scramblig code m, k = 0,1,, 79 ad m = 0, 1,,, 511, is S c-cd, as defied above with =16 m+k for k = 0,...,15 ad = 64 m + (k-16)+819 for k=16,...,79. The idex k=0,...,15 may oly be used as a PCPCH CD preamble part scramblig code if the same code is also used for a PRACH. The idex k=16,..., 79 correspod to PCPCH CD preamble scramblig codes which are ot shared together with a PRACH. This leads to 3768 PCPCH specific preamble scramblig codes divided ito 51 groups with 64 elemets CD preamble sigature The CD-preamble part of the CPCH-access burst carries oe of sixtee differet orthogoal complex sigatures idetical to the oes used by the preamble part of the radom-access burst.

19 18 TS 5.13 V3.9.0 (003-1) 4.4 Modulatio Modulatig chip rate The modulatig chip rate is 3.84 Mcps Modulatio I the uplik, the complex-valued chip sequece geerated by the spreadig process is QPSK modulated as show i Figure 7 below: cos(ωt) Complex-valued chip sequece from spreadig operatios S Split real & imag. parts Re{S} Im{S} Pulseshapig Pulseshapig -si(ωt) The pulse-shapig characteristics are described i [3]. Figure 7: Uplik modulatio 5 Dowlik spreadig ad modulatio 5.1 Spreadig Figure 8 illustrates the spreadig operatio for all dowlik physical chaels except SCH, i.e. for P-CCPCH, S- CCPCH, CPICH, AICH, AP-AICH, CD/CA-ICH, PICH, CSICH, PDSCH, ad dowlik DPCH. The o-spread physical chaels except SCH, AICH, AP-AICH ad CD/CA-ICH cosist of a sequece of 3-valued digits takig the values 0, 1, "DTX". Note that "DTX" is oly applicable to those dowlik physical chaels that support DTX trasmissio. Before the spreadig operatio, these are mapped to real-valued symbols as follows: the biary value "0" is mapped to the real value +1, the biary value "1" is mapped to the real value 1 ad "DTX" is mapped to the real value 0. For the idicator chaels usig sigatures (AICH, AP-AICH ad CD/CA-ICH), the real-valued symbols deped o the exact combiatio of the idicators to be trasmitted, compare [] sectios , ad Each pair of two cosecutive real-valued symbols is first serial-to-parallel coverted ad mapped to a I ad Q brach. The mappig is such that eve ad odd umbered symbols are mapped to the I ad Q brach respectively. For all chaels except the idicator chaels usig sigatures, symbol umber zero is defied as the first symbol i each frame. For the idicator chaels usig sigatures, symbol umber zero is defied as the first symbol i each access slot. The I ad Q braches are the both spread to the chip rate by the same real-valued chaelizatio code C ch,sf,m. The chaelizatio code sequece shall be aliged i time with the symbol boudary. The sequeces of real-valued chips o the I ad Q brach are the treated as a sigle complex-valued sequece of chips. This sequece of chips is scrambled (complex chip-wise multiplicatio) by a complex-valued scramblig code S dl,. I case of P-CCPCH, the scramblig code is applied aliged with the P-CCPCH frame boudary, i.e. the first complex chip of the spread P-CCPCH frame is multiplied with chip umber zero of the scramblig code. I case of other dowlik chaels, the scramblig code is applied aliged with the scramblig code applied to the P-CCPCH. I this case, the scramblig code is thus ot ecessarily applied aliged with the frame boudary of the physical chael to be scrambled.

20 19 TS 5.13 V3.9.0 (003-1) Ay dowlik physical chael except SCH S P C ch,sf,m I Q I+jQ S dl, S j Figure 8: Spreadig for all dowlik physical chaels except SCH Figure 9 illustrates how differet dowlik chaels are combied. Each complex-valued spread chael, correspodig to poit S i Figure 8, is separately weighted by a weight factor G i. The complex-valued P-SCH ad S- SCH, as described i [], sectio , are separately weighted by weight factors G p ad G s. All dowlik physical chaels are the combied usig complex additio. Differet dowlik Physical chaels (poit S i Figure 8) G 1 G Σ P-SCH G P Σ (poit T i Figure 11) S-SCH G S Figure 9: Combiig of dowlik physical chaels 5. Code geeratio ad allocatio 5..1 Chaelizatio codes The chaelizatio codes of figure 8 are the same codes as used i the uplik, amely Orthogoal Variable Spreadig Factor (OVSF) codes that preserve the orthogoality betwee dowlik chaels of differet rates ad spreadig factors. The OVSF codes are defied i figure 4 i sectio The chaelizatio code for the Primary CPICH is fixed to C ch,56,0 ad the chaelizatio code for the Primary CCPCH is fixed to C ch,56,1.the chaelizatio codes for all other physical chaels are assiged by UTRAN. With the spreadig factor 51 a specific restrictio is applied. Whe the code word C ch,51,, with =0,,4.510, is used i soft hadover, the the code word C ch,51,+1 is ot allocated i the cells where timig adjustmet is to be used. Respectively if C ch,51,, with =1,3,5.511 is used, the the code word C ch,51,-1 is ot allocated i the cells where timig adjustmet is to be used. This restrictio shall ot apply i cases where timig adjustmets i soft hadover are ot used with spreadig factor 51.

21 0 TS 5.13 V3.9.0 (003-1) Whe compressed mode is implemeted by reducig the spreadig factor by, the OVSF code used for compressed frames is: - C ch,sf/, / if ordiary scramblig code is used. - C ch,sf/, mod SF/ if alterative scramblig code is used (see sectio 5..); where C ch,sf, is the chaelizatio code used for o-compressed frames. I case the OVSF code o the PDSCH varies from frame to frame, the OVSF codes shall be allocated i such a way that the OVSF code(s) below the smallest spreadig factor will be from the brach of the code tree poited by the code with smallest spreadig factor used for the coectio which is called PDSCH root chaelisatio code. This meas that all the codes for this UE for the PDSCH coectio ca be geerated accordig to the OVSF code geeratio priciple from the PDSCH root chaelisatio code i.e. the code with smallest spreadig factor used by the UE o PDSCH. I case of mappig the DSCH to multiple parallel PDSCHs, the same rule applies, but all of the braches idetified by the multiple codes, correspodig to the smallest spreadig factor, may be used for higher spreadig factor allocatio i.e. the multiple codes with smallest spreadig factor ca be cosidered as PDSCH root chaelisatio codes. 5.. Scramblig code A total of 18-1 = 6,143 scramblig codes, umbered 0 6,14 ca be geerated. However ot all the scramblig codes are used. The scramblig codes are divided ito 51 sets each of a primary scramblig code ad 15 secodary scramblig codes. The primary scramblig codes cosist of scramblig codes =16*i where i= The i:th set of secodary scramblig codes cosists of scramblig codes 16*i+k, where k=1 15. There is a oe-to-oe mappig betwee each primary scramblig code ad 15 secodary scramblig codes i a set such that i:th primary scramblig code correspods to i:th set of secodary scramblig codes. Hece, accordig to the above, scramblig codes k = 0, 1,, 8191 are used. Each of these codes are associated with a left alterative scramblig code ad a right alterative scramblig code, that may be used for compressed frames. The left alterative scramblig code correspodig to scramblig code k is scramblig code umber k + 819, while the right alterative scramblig code correspodig to scramblig code k is scramblig code umber k The alterative scramblig codes ca be used for compressed frames. I this case, the left alterative scramblig code is used if <SF/ ad the right alterative scramblig code is used if SF/, where c ch,sf, is the chaelizatio code used for o-compressed frames. The usage of alterative scramblig code for compressed frames is sigalled by higher layers for each physical chael respectively. The set of primary scramblig codes is further divided ito 64 scramblig code groups, each cosistig of 8 primary scramblig codes. The j:th scramblig code group cosists of primary scramblig codes 16*8*j+16*k, where j=0..63 ad k=0..7. Each cell is allocated oe ad oly oe primary scramblig code. The primary CCPCH, primary CPICH, PICH, AICH, AP-AICH, CD/CA-ICH, CSICH ad S-CCPCH carryig PCH are always trasmitted usig the primary scramblig code. The other dowlik physical chaels ca be trasmitted with either the primary scramblig code or a secodary scramblig code from the set associated with the primary scramblig code of the cell. The mixture of primary scramblig code ad o more tha oe secodary scramblig code for oe CCTrCH is allowable. I compressed mode durig compressed frames, these ca be chaged to the associated left or right scramblig codes as described above, i.e. i these frames, the total umber of differet scramblig codes may exceed two. I the case of the CCTrCH of type DSCH, all the PDSCH chaelisatio codes that a sigle UE may receive shall be uder a sigle scramblig code (either the primary or a secodary scramblig code). The scramblig code sequeces are costructed by combiig two real sequeces ito a complex sequece. Each of the two real sequeces are costructed as the positio wise modulo sum of chip segmets of two biary m- sequeces geerated by meas of two geerator polyomials of degree 18. The resultig sequeces thus costitute segmets of a set of Gold sequeces. The scramblig codes are repeated for every 10 ms radio frame. Let x ad y be the two sequeces respectively. The x sequece is costructed usig the primitive (over GF()) polyomial 1+X 7 +X 18. The y sequece is costructed usig the polyomial 1+X 5 +X 7 + X 10 +X 18.

22 1 TS 5.13 V3.9.0 (003-1) The sequece depedig o the chose scramblig code umber is deoted z, i the sequel. Furthermore, let x(i), y(i) ad z (i) deote the i:th symbol of the sequece x, y, ad z, respectively. The m-sequeces xad y are costructed as: Iitial coditios: - x is costructed with x (0)=1, x(1)= x()=...= x (16)= x (17)=0. - y(0)=y(1)= =y(16)= y(17)=1. Recursive defiitio of subsequet symbols: - x(i+18) =x(i+7) + x(i) modulo, i=0,, y(i+18) = y(i+10)+y(i+7)+y(i+5)+y(i) modulo, i=0,, The :th Gold code sequece z, =0,1,,, 18 -, is the defied as: - z (i) = x((i+) modulo ( 18-1)) + y(i) modulo, i=0,, These biary sequeces are coverted to real valued sequeces Z by the followig trasformatio: Z + 1 if z ( i) = 0 ( i) = for i = 0,1, K, 1 if z ( i) = 1 Fially, the :th complex scramblig code sequece S dl, is defied as: - S dl, (i) = Z (i) + j Z ((i+13107) modulo ( 18-1)), i=0,1,, Note that the patter from phase 0 up to the phase of is repeated I Q Figure 10: Cofiguratio of dowlik scramblig code geerator 5..3 Sychroisatio codes Code geeratio The primary sychroisatio code (PSC), C psc is costructed as a so-called geeralised hierarchical Golay sequece. The PSC is furthermore chose to have good aperiodic auto correlatio properties.

23 TS 5.13 V3.9.0 (003-1) Defie: - a = <x 1, x, x 3,, x 16 > = <1, 1, 1, 1, 1, 1, -1, -1, 1, -1, 1, -1, 1, -1, -1, 1> The PSC is geerated by repeatig the sequece a modulated by a Golay complemetary sequece, ad creatig a complex-valued sequece with idetical real ad imagiary compoets. The PSC C psc is defied as: - C psc = (1 + j) <a, a, a, -a, -a, a, -a, -a, a, a, a, -a, a, -a, a, a>; where the leftmost chip i the sequece correspods to the chip trasmitted first i time. The 16 secodary sychroizatio codes (SSCs), {C ssc,1,,c ssc,16}, are complex-valued with idetical real ad imagiary compoets, ad are costructed from positio wise multiplicatioof a Hadamard sequece ad a sequece z, defied as: - z = <b, b, b, -b, b, b, -b, -b, b, -b, b, -b, -b, -b, -b, -b>, where - b = <x 1, x, x 3, x 4, x 5, x 6, x 7, x 8, -x 9, -x 10, -x 11, -x 1, -x 13, -x 14, -x 15, -x 16 > ad x 1, x,, x 15, x 16, are same as i the defiitio of the sequece a above. The Hadamard sequeces are obtaied as the rows i a matrix H 8 costructed recursively by: H k H = H H k 1 k 1 0 = (1) H H k 1 k 1, k 1 The rows are umbered from the top startig with row 0 (the all oes sequece). Deote the :th Hadamard sequece as a row of H 8 umbered from the top, = 0, 1,,, 55, i the sequel. Furthermore, let h (i) ad z(i) deote the i:th symbol of the sequece h ad z, respectively where i = 0, 1,,, 55 ad i = 0 correspods to the leftmost symbol. The k:th SSC, C ssc,k, k = 1,, 3,, 16 is the defied as: - C ssc,k = (1 + j) <h m (0) z(0), h m (1) z(1), h m () z(),, h m (55) z(55)>; where m = 16 (k 1) ad the leftmost chip i the sequece correspods to the chip trasmitted first i time Code allocatio of SSC The 64 secodary SCH sequeces are costructed such that their cyclic-shifts are uique, i.e., a o-zero cyclic shift less tha 15 of ay of the 64 sequeces is ot equivalet to some cyclic shift of ay other of the 64 sequeces. Also, a o-zero cyclic shift less tha 15 of ay of the sequeces is ot equivalet to itself with ay other cyclic shift less tha 15. Table 4 describes the sequeces of SSCs used to ecode the 64 differet scramblig code groups. The etries i table 4 deote what SSC to use i the differet slots for the differet scramblig code groups, e.g. the etry "7" meas that SSC C ssc,7 shall be used for the correspodig scramblig code group ad slot.

24 3 TS 5.13 V3.9.0 (003-1) Table 4: Allocatio of SSCs for secodary SCH Scramblig slot umber Code Group #0 #1 # #3 #4 #5 #6 #7 #8 #9 #10 #11 #1 #13 #14 Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group Group

25 4 TS 5.13 V3.9.0 (003-1) Scramblig slot umber Code Group #0 #1 # #3 #4 #5 #6 #7 #8 #9 #10 #11 #1 #13 #14 Group Group Group Group Group Group Group Group Group Group Group Group Group Group Modulatio Modulatig chip rate The modulatig chip rate is 3.84 Mcps Modulatio I the dowlik, the complex-valued chip sequece geerated by the spreadig process is QPSK modulated as show i Figure 11 below. cos(ωt) Complex-valued chip sequece from summig operatios T Split real & imag. parts Re{T} Im{T} Pulseshapig Pulseshapig -si(ωt) The pulse-shapig characteristics are described i [4]. Figure 11: Dowlik modulatio

26 5 TS 5.13 V3.9.0 (003-1) Aex A (iformative): Geeralised Hierarchical Golay Sequeces A.1 Alterative geeratio The geeralised hierarchical Golay sequeces for the PSC described i may be also viewed as geerated (i real valued represetatio) by the followig methods: Method 1. The sequece y is costructed from two costituet sequeces x 1 ad x of legth 1 ad respectively usig the followig formula: - y(i) = x (i mod ) * x 1 (i div ), i = 0... ( 1 * ) - 1. The costituet sequeces x 1 ad x are chose to be the followig legth 16 (i.e. 1 = =16) sequeces: - x 1 is defied to be the legth 16 (N (1) =4) Golay complemetary sequece obtaied by the delay matrix D (1) = [8, 4, 1,] ad weight matrix W (1) = [1, -1, 1,1]. - x is a geeralised hierarchical sequece usig the followig formula, selectig s= ad usig the two Golay complemetary sequeces x 3 ad x 4 as costituet sequeces. The legth of the sequece x 3 ad x 4 is called 3 respectively 4. - x (i) = x 4 (i mod s + s*(i div s 3 )) * x 3 ((i div s) mod 3 ), i = 0... ( 3 * 4 ) x 3 ad x 4 are defied to be idetical ad the legth 4 (N (3) = N (4) =) Golay complemetary sequece obtaied by the delay matrix D (3) = D (4) = [1, ] ad weight matrix W (3) = W (4) = [1, 1]. The Golay complemetary sequeces x 1,x 3 ad x 4 are defied usig the followig recursive relatio: a 0 (k) = δ(k) ad b 0 (k) = δ(k); a (k) = a -1 (k) + W (j) b -1 (k-d (j) ); b (k) = a -1 (k) - W (j) b -1 (k-d (j) ); k = 0, 1,,, **N (j) -1; = 1,,, N (j). The wated Golay complemetary sequece x j is defied by a described by δ, k,j ad are itegers. assumig =N (j). The Kroecker delta fuctio is Method The sequece y ca be viewed as a prued Golay complemetary sequece ad geerated usig the followig parameters which apply to the geerator equatios for a ad b above: (a) Let j = 0, N (0) = 8. (b) [D 1 0,D 0,D 3 0,D 4 0,D 5 0,D 6 0,D 7 0,D 8 0 ] = [18, 64, 16, 3, 8, 1, 4, ]. (c) [W 1 0,W 0,W 3 0,W 4 0,W 5 0,W 6 0,W 7 0,W 8 0 ] = [1, -1, 1, 1, 1, 1, 1, 1]. (d) For = 4, 6, set b 4 (k) = a 4 (k), b 6 (k) = a 6 (k).

27 6 TS 5.13 V3.9.0 (003-1) Aex B (iformative): Chage history Chage history Date TSG # TSG Doc. CR Rev Subject/Commet Old New 14/01/00 RAN_05 RP Approved at TSG RAN #5 ad placed uder Chage Cotrol 14/01/00 RAN_06 RP Harmoizatio of otatios for dowlik scramblig codes /01/00 RAN_06 RP Update of dowlik spreadig descriptio /01/00 RAN_06 RP Update of TS 5.13 uplik parts /01/00 RAN_06 RP Updated modulatio descriptio /01/00 RAN_06 RP Restrictio for spreadig factor 51 allocatio i the UTRA FDD Dowlik 14/01/00 RAN_06 RP CPCH codes i power cotrol preamble /01/00 RAN_06 RP Support of short codes for CPCH /01/00 RAN_06 RP Editorial Chage /01/00 RAN_06 RP Chaelizatio Code Allocatio for USTS /01/00 RAN_06 RP Correctio (Editorial Chage) /01/00 RAN_06 RP Correctio to code allocatio for compressed mode /01/ Chage history was added by the editor /03/00 RAN_07 RP Cosistet umberig of scramblig code groups /03/00 RAN_07 RP Dowlik sigal flow correctios /03/00 RAN_07 RP Uplik sigal flow correctios /03/00 RAN_07 RP Number of RACH scramblig codes /03/00 RAN_07 RP Editorial chages to /03/00 RAN_07 RP Number of PCPCH scramblig codes per cell /03/00 RAN_07 RP A typo correctio for 5.. ad clarificatio for of TS V /03/00 RAN_07 RP Chaelizatio code allocatio method for PCPCH message part 31/03/00 RAN_07 RP Clarificatios to DSCH scramblig ad modulatio i /03/00 RAN_07 RP Clea up of USTS related specificatios /06/00 RAN_08 RP Clarificatios to power cotrol preamble sectios /06/00 RAN_08 RP Numberig of the PCPCH access preamble ad collisio detectio preamble scramblig codes 6/06/00 RAN_08 RP DPDCH/DPCCH gai factors /1/00 RAN_10 RP Proposed removal of the optio of secodary scramblig code for some dowlik commo chaels 16/03/01 RAN_11 RP Clarificatio of chaelizatio codes whe SF= /03/01 RAN_11 RP Clarificatio of the scramblig code of a power cotrol preamble /06/01 RAN_1 RP Clarificatio of DL chaelizatio code aligmet /06/01 RAN_1 RP Clarificatio of PDSCH root chaelisatio code defiitio /1/01 RAN_14 RP Correctio of sectio umber referece /06/0 RAN_16 RP Dowlik bit mappig /01/04 RAN_ RP Restrictio of DL secodary scramblig codes per CCTrCH

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows: Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

More information

CHAPTER 3 DIGITAL CODING OF SIGNALS

CHAPTER 3 DIGITAL CODING OF SIGNALS CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity

More information

ETSI TS 136 213 V8.8.0 (2009-10) Technical Specification

ETSI TS 136 213 V8.8.0 (2009-10) Technical Specification TS 136 213 V8.8.0 (2009-10) Techical Specificatio LTE; Evolved Uiversal Terrestrial Radio Access (E-UTRA); Physical layer procedures (3GPP TS 36.213 versio 8.8.0 Release 8) 1 TS 136 213 V8.8.0 (2009-10)

More information

Engineering Data Management

Engineering Data Management BaaERP 5.0c Maufacturig Egieerig Data Maagemet Module Procedure UP128A US Documetiformatio Documet Documet code : UP128A US Documet group : User Documetatio Documet title : Egieerig Data Maagemet Applicatio/Package

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

ARIB STD-T63-26.412 V7.0.0. Source code for 3GP file format (Release 7)

ARIB STD-T63-26.412 V7.0.0. Source code for 3GP file format (Release 7) ARIB STD-T63-26.412 V7.0.0 Source code for 3GP file format (Release 7) Refer to Industrial Property Rights (IPR) in the preface of ARIB STD-T63 for Related Industrial Property Rights. Refer to Notice in

More information

A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design

A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design A Combied Cotiuous/Biary Geetic Algorithm for Microstrip Atea Desig Rady L. Haupt The Pesylvaia State Uiversity Applied Research Laboratory P. O. Box 30 State College, PA 16804-0030 haupt@ieee.org Abstract:

More information

Baan Service Master Data Management

Baan Service Master Data Management Baa Service Master Data Maagemet Module Procedure UP069A US Documetiformatio Documet Documet code : UP069A US Documet group : User Documetatio Documet title : Master Data Maagemet Applicatio/Package :

More information

CS 8803 - Cellular and Mobile Network Security: CDMA/UMTS Air Interface

CS 8803 - Cellular and Mobile Network Security: CDMA/UMTS Air Interface CS 8803 - Cellular and Mobile Network Security: CDMA/UMTS Air Interface Hank Carter Professor Patrick Traynor 10/4/2012 UMTS and CDMA 3G technology - major change from GSM (TDMA) Based on techniques originally

More information

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

More information

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee

More information

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean 1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

Escola Federal de Engenharia de Itajubá

Escola Federal de Engenharia de Itajubá Escola Federal de Egeharia de Itajubá Departameto de Egeharia Mecâica Pós-Graduação em Egeharia Mecâica MPF04 ANÁLISE DE SINAIS E AQUISÇÃO DE DADOS SINAIS E SISTEMAS Trabalho 02 (MATLAB) Prof. Dr. José

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

5 Boolean Decision Trees (February 11)

5 Boolean Decision Trees (February 11) 5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

More information

Infinite Sequences and Series

Infinite Sequences and Series CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...

More information

Overview on S-Box Design Principles

Overview on S-Box Design Principles Overview o S-Box Desig Priciples Debdeep Mukhopadhyay Assistat Professor Departmet of Computer Sciece ad Egieerig Idia Istitute of Techology Kharagpur INDIA -721302 What is a S-Box? S-Boxes are Boolea

More information

Chair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics

Chair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics Chair for Network Architectures ad Services Istitute of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.4 Radom Number Geeratio for Cryptographic Protocols Motivatio It is crucial to

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

Domain 1 - Describe Cisco VoIP Implementations

Domain 1 - Describe Cisco VoIP Implementations Maual ONT (642-8) 1-800-418-6789 Domai 1 - Describe Cisco VoIP Implemetatios Advatages of VoIP Over Traditioal Switches Voice over IP etworks have may advatages over traditioal circuit switched voice etworks.

More information

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction THE ARITHMETIC OF INTEGERS - multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,

More information

How To Solve The Homewor Problem Beautifully

How To Solve The Homewor Problem Beautifully Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log

More information

Chapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity

More information

Chapter 6 WCDMA. Chapter 6

Chapter 6 WCDMA. Chapter 6 Chapter 6 WCDMA Chapter 6 6.1 INTRODUCTION This chapter presents the WCDMA air interface, referred also as UMTS terrestrial radio access (UTRA), developed by the third-generation partnership project (3GPP).

More information

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is 0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values

More information

Domain 1: Designing a SQL Server Instance and a Database Solution

Domain 1: Designing a SQL Server Instance and a Database Solution Maual SQL Server 2008 Desig, Optimize ad Maitai (70-450) 1-800-418-6789 Domai 1: Desigig a SQL Server Istace ad a Database Solutio Desigig for CPU, Memory ad Storage Capacity Requiremets Whe desigig a

More information

How to read A Mutual Fund shareholder report

How to read A Mutual Fund shareholder report Ivestor BulletI How to read A Mutual Fud shareholder report The SEC s Office of Ivestor Educatio ad Advocacy is issuig this Ivestor Bulleti to educate idividual ivestors about mutual fud shareholder reports.

More information

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5

More information

On the Capacity of Hybrid Wireless Networks

On the Capacity of Hybrid Wireless Networks O the Capacity of Hybrid ireless Networks Beyua Liu,ZheLiu +,DoTowsley Departmet of Computer Sciece Uiversity of Massachusetts Amherst, MA 0002 + IBM T.J. atso Research Ceter P.O. Box 704 Yorktow Heights,

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

Theorems About Power Series

Theorems About Power Series Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius

More information

Integer Factorization Algorithms

Integer Factorization Algorithms Iteger Factorizatio Algorithms Coelly Bares Departmet of Physics, Orego State Uiversity December 7, 004 This documet has bee placed i the public domai. Cotets I. Itroductio 3 1. Termiology 3. Fudametal

More information

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here). BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly

More information

CS103X: Discrete Structures Homework 4 Solutions

CS103X: Discrete Structures Homework 4 Solutions CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least

More information

THE ABRACADABRA PROBLEM

THE ABRACADABRA PROBLEM THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

More information

How To Understand The Power Of A Cell Phone Network

How To Understand The Power Of A Cell Phone Network TS 25.225 V3.12.0 (2003-06) Technical Specification 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Physical layer Measurements (TDD) (Release 1999) The present

More information

CS100: Introduction to Computer Science

CS100: Introduction to Computer Science Review: History of Computers CS100: Itroductio to Computer Sciece Maiframes Miicomputers Lecture 2: Data Storage -- Bits, their storage ad mai memory Persoal Computers & Workstatios Review: The Role of

More information

BaanERP 5.0c. EDI User Guide

BaanERP 5.0c. EDI User Guide BaaERP 5.0c A publicatio of: Baa Developmet B.V. P.O.Box 143 3770 AC Bareveld The Netherlads Prited i the Netherlads Baa Developmet B.V. 1999. All rights reserved. The iformatio i this documet is subject

More information

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation HP 1C Statistics - average ad stadard deviatio Average ad stadard deviatio cocepts HP1C average ad stadard deviatio Practice calculatig averages ad stadard deviatios with oe or two variables HP 1C Statistics

More information

Chapter 10 Computer Design Basics

Chapter 10 Computer Design Basics Logic ad Computer Desig Fudametals Chapter 10 Computer Desig Basics Part 1 Datapaths Charles Kime & Thomas Kamiski 2004 Pearso Educatio, Ic. Terms of Use (Hyperliks are active i View Show mode) Overview

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive

More information

3GPP TS 05.15 V8.1.0 (2006-01)

3GPP TS 05.15 V8.1.0 (2006-01) TS 05.15 V8.1.0 (2006-01) Technical Specification 3rd Generation Partnership Project; Technical Specification Group GSM/EDGE Radio Access Network; Release independent Downlink Advanced Receiver Performance

More information

ARIB STD-T63-26.451 V12.0.0. Codec for Enhanced Voice Services (EVS); Voice Activity Detection (VAD) (Release 12)

ARIB STD-T63-26.451 V12.0.0. Codec for Enhanced Voice Services (EVS); Voice Activity Detection (VAD) (Release 12) ARIB STD-T63-26.451 V12.0.0 Codec for Enhanced Voice Services (EVS); Voice Activity Detection (VAD) (Release 12) Refer to Industrial Property Rights (IPR) in the preface of ARIB STD-T63 for Related Industrial

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 49-60 A Faster Clause-Shorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece

More information

Floating Codes for Joint Information Storage in Write Asymmetric Memories

Floating Codes for Joint Information Storage in Write Asymmetric Memories Floatig Codes for Joit Iformatio Storage i Write Asymmetric Memories Axiao (Adrew Jiag Computer Sciece Departmet Texas A&M Uiversity College Statio, TX 77843-311 ajiag@cs.tamu.edu Vaske Bohossia Electrical

More information

SEQUENCES AND SERIES

SEQUENCES AND SERIES Chapter 9 SEQUENCES AND SERIES Natural umbers are the product of huma spirit. DEDEKIND 9.1 Itroductio I mathematics, the word, sequece is used i much the same way as it is i ordiary Eglish. Whe we say

More information

INVESTMENT PERFORMANCE COUNCIL (IPC)

INVESTMENT PERFORMANCE COUNCIL (IPC) INVESTMENT PEFOMANCE COUNCIL (IPC) INVITATION TO COMMENT: Global Ivestmet Performace Stadards (GIPS ) Guidace Statemet o Calculatio Methodology The Associatio for Ivestmet Maagemet ad esearch (AIM) seeks

More information

Universal coding for classes of sources

Universal coding for classes of sources Coexios module: m46228 Uiversal codig for classes of sources Dever Greee This work is produced by The Coexios Project ad licesed uder the Creative Commos Attributio Licese We have discussed several parametric

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may

More information

1. MATHEMATICAL INDUCTION

1. MATHEMATICAL INDUCTION 1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1

More information

Subject CT5 Contingencies Core Technical Syllabus

Subject CT5 Contingencies Core Technical Syllabus Subject CT5 Cotigecies Core Techical Syllabus for the 2015 exams 1 Jue 2014 Aim The aim of the Cotigecies subject is to provide a groudig i the mathematical techiques which ca be used to model ad value

More information

Institute of Actuaries of India Subject CT1 Financial Mathematics

Institute of Actuaries of India Subject CT1 Financial Mathematics Istitute of Actuaries of Idia Subject CT1 Fiacial Mathematics For 2014 Examiatios Subject CT1 Fiacial Mathematics Core Techical Aim The aim of the Fiacial Mathematics subject is to provide a groudig i

More information

Analyzing Longitudinal Data from Complex Surveys Using SUDAAN

Analyzing Longitudinal Data from Complex Surveys Using SUDAAN Aalyzig Logitudial Data from Complex Surveys Usig SUDAAN Darryl Creel Statistics ad Epidemiology, RTI Iteratioal, 312 Trotter Farm Drive, Rockville, MD, 20850 Abstract SUDAAN: Software for the Statistical

More information

Multiplexers and Demultiplexers

Multiplexers and Demultiplexers I this lesso, you will lear about: Multiplexers ad Demultiplexers 1. Multiplexers 2. Combiatioal circuit implemetatio with multiplexers 3. Demultiplexers 4. Some examples Multiplexer A Multiplexer (see

More information

Estimating Probability Distributions by Observing Betting Practices

Estimating Probability Distributions by Observing Betting Practices 5th Iteratioal Symposium o Imprecise Probability: Theories ad Applicatios, Prague, Czech Republic, 007 Estimatig Probability Distributios by Observig Bettig Practices Dr C Lych Natioal Uiversity of Irelad,

More information

ODBC. Getting Started With Sage Timberline Office ODBC

ODBC. Getting Started With Sage Timberline Office ODBC ODBC Gettig Started With Sage Timberlie Office ODBC NOTICE This documet ad the Sage Timberlie Office software may be used oly i accordace with the accompayig Sage Timberlie Office Ed User Licese Agreemet.

More information

Solutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork

Solutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork Solutios to Selected Problems I: Patter Classificatio by Duda, Hart, Stork Joh L. Weatherwax February 4, 008 Problem Solutios Chapter Bayesia Decisio Theory Problem radomized rules Part a: Let Rx be the

More information

CHAPTER 3 THE TIME VALUE OF MONEY

CHAPTER 3 THE TIME VALUE OF MONEY CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all

More information

Notes on exponential generating functions and structures.

Notes on exponential generating functions and structures. Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a -elemet set, (2) to fid for each the

More information

Yu.M. Tulyakov, D.Ye. Shakarov, A.A. Kalashnikov. Keywords: Data broadcasting, cellular mobile systems, WCDMA, GSM.

Yu.M. Tulyakov, D.Ye. Shakarov, A.A. Kalashnikov. Keywords: Data broadcasting, cellular mobile systems, WCDMA, GSM. Аnalysis of data broadcasting in modern cellular mobile systems of ground radio communications Yu.M. Tulyakov, D.Ye. Shakarov, A.A. Kalashnikov At the analysis of channel formation in WCDMA networks the

More information

Permutations, the Parity Theorem, and Determinants

Permutations, the Parity Theorem, and Determinants 1 Permutatios, the Parity Theorem, ad Determiats Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 What is a Permutatio 1 2 Cycles 2 2.1 Traspositios 4 3 Orbits

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10 FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10 [C] Commuicatio Measuremet A1. Solve problems that ivolve liear measuremet, usig: SI ad imperial uits of measure estimatio strategies measuremet strategies.

More information

PUBLIC RELATIONS PROJECT 2016

PUBLIC RELATIONS PROJECT 2016 PUBLIC RELATIONS PROJECT 2016 The purpose of the Public Relatios Project is to provide a opportuity for the chapter members to demostrate the kowledge ad skills eeded i plaig, orgaizig, implemetig ad evaluatig

More information

5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?

5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized? 5.4 Amortizatio Questio 1: How do you fid the preset value of a auity? Questio 2: How is a loa amortized? Questio 3: How do you make a amortizatio table? Oe of the most commo fiacial istrumets a perso

More information

Sequences and Series Using the TI-89 Calculator

Sequences and Series Using the TI-89 Calculator RIT Calculator Site Sequeces ad Series Usig the TI-89 Calculator Norecursively Defied Sequeces A orecursively defied sequece is oe i which the formula for the terms of the sequece is give explicitly. For

More information

1 Correlation and Regression Analysis

1 Correlation and Regression Analysis 1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio

More information

Multi-server Optimal Bandwidth Monitoring for QoS based Multimedia Delivery Anup Basu, Irene Cheng and Yinzhe Yu

Multi-server Optimal Bandwidth Monitoring for QoS based Multimedia Delivery Anup Basu, Irene Cheng and Yinzhe Yu Multi-server Optimal Badwidth Moitorig for QoS based Multimedia Delivery Aup Basu, Iree Cheg ad Yizhe Yu Departmet of Computig Sciece U. of Alberta Architecture Applicatio Layer Request receptio -coectio

More information

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio

More information

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009) 18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the

More information

INVESTMENT PERFORMANCE COUNCIL (IPC) Guidance Statement on Calculation Methodology

INVESTMENT PERFORMANCE COUNCIL (IPC) Guidance Statement on Calculation Methodology Adoptio Date: 4 March 2004 Effective Date: 1 Jue 2004 Retroactive Applicatio: No Public Commet Period: Aug Nov 2002 INVESTMENT PERFORMANCE COUNCIL (IPC) Preface Guidace Statemet o Calculatio Methodology

More information

Routine for 8-Bit Binary to BCD Conversion

Routine for 8-Bit Binary to BCD Conversion Algorithm - Fast ad Compact Usiged Biary to BCD Coversio Applicatio Note Abstract AN2338 Author: Eugee Miyushkovich, Ryshtu Adrij Associated Project: Yes Associated Part Family: CY8C24x23A, CY8C24x94,

More information

1. Introduction. Scheduling Theory

1. Introduction. Scheduling Theory . Itroductio. Itroductio As a idepedet brach of Operatioal Research, Schedulig Theory appeared i the begiig of the 50s. I additio to computer systems ad maufacturig, schedulig theory ca be applied to may

More information

The Role of Latin Square in Cipher Systems: A Matrix Approach to Model Encryption Modes of Operation

The Role of Latin Square in Cipher Systems: A Matrix Approach to Model Encryption Modes of Operation UCLA COPUTR SCINC DPARTNT TCHNICAL RPORT 030038 1 The Role of Lati Square i Cipher Systems: A atrix Approach to odel cryptio odes of Operatio Jieju og Computer Sciece Departmet Uiversity of Califoria,

More information

MARTINGALES AND A BASIC APPLICATION

MARTINGALES AND A BASIC APPLICATION MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measure-theoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this

More information

Measures of Spread and Boxplots Discrete Math, Section 9.4

Measures of Spread and Boxplots Discrete Math, Section 9.4 Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,

More information

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The

More information

Class Meeting # 16: The Fourier Transform on R n

Class Meeting # 16: The Fourier Transform on R n MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,

More information

MATH 083 Final Exam Review

MATH 083 Final Exam Review MATH 08 Fial Eam Review Completig the problems i this review will greatly prepare you for the fial eam Calculator use is ot required, but you are permitted to use a calculator durig the fial eam period

More information

Unicenter TCPaccess FTP Server

Unicenter TCPaccess FTP Server Uiceter TCPaccess FTP Server Release Summary r6.1 SP2 K02213-2E This documetatio ad related computer software program (hereiafter referred to as the Documetatio ) is for the ed user s iformatioal purposes

More information

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature. Itegrated Productio ad Ivetory Cotrol System MRP ad MRP II Framework of Maufacturig System Ivetory cotrol, productio schedulig, capacity plaig ad fiacial ad busiess decisios i a productio system are iterrelated.

More information

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL. Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory

More information

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

Entropy of bi-capacities

Entropy of bi-capacities Etropy of bi-capacities Iva Kojadiovic LINA CNRS FRE 2729 Site école polytechique de l uiv. de Nates Rue Christia Pauc 44306 Nates, Frace iva.kojadiovic@uiv-ates.fr Jea-Luc Marichal Applied Mathematics

More information

BaanERP. BaanERP Windows Client Installation Guide

BaanERP. BaanERP Windows Client Installation Guide BaaERP A publicatio of: Baa Developmet B.V. P.O.Box 143 3770 AC Bareveld The Netherlads Prited i the Netherlads Baa Developmet B.V. 1999. All rights reserved. The iformatio i this documet is subject to

More information

Modified Line Search Method for Global Optimization

Modified Line Search Method for Global Optimization Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

1 The Gaussian channel

1 The Gaussian channel ECE 77 Lecture 0 The Gaussia chael Objective: I this lecture we will lear about commuicatio over a chael of practical iterest, i which the trasmitted sigal is subjected to additive white Gaussia oise.

More information

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find 1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.

More information

Fast Fourier Transform

Fast Fourier Transform 18.310 lecture otes November 18, 2013 Fast Fourier Trasform Lecturer: Michel Goemas I these otes we defie the Discrete Fourier Trasform, ad give a method for computig it fast: the Fast Fourier Trasform.

More information

ARIB TR-T12-33.918 V7.0.0

ARIB TR-T12-33.918 V7.0.0 ARIB TR-T12-33.918 V7.0.0 Generic Authentication Architecture (GAA); Early implementation of Hypertext Transfer Protocol over Transport Layer Security (HTTPS) connection between a Universal Integrated

More information

Basic Elements of Arithmetic Sequences and Series

Basic Elements of Arithmetic Sequences and Series MA40S PRE-CALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic

More information