Close
Home
Collections
Login
USC Login
Register
0
Selected
Invert selection
Deselect all
Deselect all
Click here to refresh results
Click here to refresh results
USC
/
Digital Library
/
Andrew J. and Erna Viterbi Family Archives
/
Viterbi: Presentations
/
Travel Information.
(USC DC Other)
Travel Information.
PDF
Download
Share
Open document
Flip pages
Contact Us
Contact Us
Copy asset link
Request this asset
Transcript (if available)
Content
Shannon Theory and Turbo Decoding Andrew J. Viterbi QUALCOMM Incorporated Shannon Day May 18,1998 Shannon Channel Coding Fundamentals K bits Encoder N symbols Channel (Includes Modem) Decoder For any memoryless channel -- such as the additive wideband Gaussian noise (AWGN) channel -- there exists a block code which encodes K bits into N symbols (Rate R=KJN bits/symbol) for which error probability is bounded by E(R) C = channel capacity I P E < exp[-NE(R)] where E(R) > 0 for all R < C I and E{R) depend only on the channel parameters L.....-----_---::::::__~~.J.._R c Central Problem of Channel Coding Theory for Past 50 Years Encoding is Eas'l: Most codes are good provided they are long enough. Average P E over all possible codes P E < exp[- NE(R)] Decoding is Hard: Exponentia,lIy increasingly with length, N. Decoder Complexity - 2 K =2 RN Some Partial Facilitators: Atgebraic Block Codes: Ease decoding, but suited primarily to hard decisions and do not nearly , approach capacity. Convolutional Codes: Performance-complexity tradeoff improved. Concatenated Codes: "Divide and Conquer" Separate encoding and decoding into two or more levels. ~ __ c_o_n_ca_t_e_n_at_e_d_C_O_d_e_S_'_'D_i_Vi_d_e_a_n_d_c_o_n_q_u_e_r'_'__ "Super Channel" : ~ , Inner I Outer --.... Channel Decoder De-IL Decoder L ~ §yf.D.QQt§ N§Y..f.D.QQt§ J Outer 1,,-' IL ' Inner "- "- , Encoder j" I , Encoder K bits • First proposed by Forney over 30 years ago. • Interleaving and De-interleaving break up errors out of Inner Decoder which tend to be Bursty. • Divide complexity between inner and outer decoding - complexity considerably reduced (Reed-Solomon outer code and convolutional inner code used by NASA, ESA, DSB.) • But performance suffers because inner decoder makes "0" or "1" (HARD) decisions, destroying information usable by outer decoder. Concatenated Code Performance Improvements Soft Decision Convolutional Decoder (Inner Decoder generates Soft-Decision Output) SOVA (Hagenauer): 1989 MAP (BJCR): 1974 MAP is superior: Soft decision is log - likelihood function for each symbol (output from inner arid input to outer decoder) 1I01l~+1 1I111~-1 Y is entire sequence of received (soft-input) values Simplified MAP Decoder Suppose Inner Code is Convolutionally Generated Block Code (Terminated to the "all-zero" state); - ...,.. l~-- .-__ S_im_P~I_if_ie_~~-ra~-h~-Cei~-edS-~---";:~I~~o_r_ith_m--- Yk r------_ S' s Trellis Nodes j < k-1 Trellis Nodes Final Node Generalized VA Forward Recursion Generalized VA Backward Recursion a j (s) =Max [a j _ 1 (s') + C j (s', s)] s' Generalized Dual-Maxima Computation "Turbo Decoding" Soft Iterative Decoding of Concatenated Codes Berrou et al (1993) Benedetto et al (1996) "Parallel Concatenated-Turbo" Codes "Serial Concatenated" Codes Decode Inner Code generating Soft-decision Outputs by MAP Algorithm. Use them as Inputs to Outer code, but also Generate Soft-decision Outputs from Outer Code; Iterate by feeding these back to Inner Decoder and repeating, typically 8 to 16 iterations. Result is almost ~uivalentto optimum (maxi~umIi~elihood) decoding of composite (overall) code! [Why?: Theory Incomplete] • Iterative Decoding Algorithm (Berrou-Benedetto) Outer Code Inner Code MAP ~.+ ~ .De-IL "'" MAP ~ ~. . -- -- .- Decoder - Decoder )~ ~ (After 1st Iteration) / - " IL ~ + --< ~ From Demodulat~ All Inputs and Outputs are Soft Decisions Error Probability Performance Union Bound For any linear block code of 2K codewords ~O'~1 • • • ~2K_1 and N symbols used over a memoryless channel (e.g. AWGN) with outputs Y1' Y2'· · YN , maximum likelihood decoder achieves where M(~j) is decoder metric for jth codeword, which is function of y. - "Uniform Error Property": error probability same no matter which codeword sent Let d j be weight of ~j (Hamming distance between ~j and ~o) [~o = + ++...+] \.. 2 K -l P E < L Zdj j=1 Suppose there are K d codewords of weight d ~ N N Then P E < L KdZ d d=d min Z=e-Es/No Define Weight Enumeration Function (WEF): Also useful Input-Output Weight Enumeration Function (IOWEF) Then T(Z) = T(1,Z) K since L T kd = K d k=1 where T kd =Num~er of codewords of output weight d and input weight k. •.. Computation of T(W,Z) and T(Z) (General) Example o o z wz w o o o WZ State Transition Matrix [C(W,2)] 1 Wz 2 0 o 2 o [~J . . . . 0 S(OO)(n) S(oo)(n -1) S(OO)(K) 1 S(01) (n) =[C(w,z)] S(01)(n -1) S(01)(K) =[C(w,z)r 0 5(10) (n) 5(10)(n -1) S(1O)(K) 0 S(11)(n) S(11)(n -1) S(11) (K) 0 00 00 00 00 00 T(W,Z) ~ S(oo)(K;W,Z) (Rather than matrix multiplication in 2 variables, can us~ recursion relations in 1 variable) • Computation of Tc(W,Z) for Concatenated Codes K L If outer code has To (W, Z') = L L A kt w k (Z')' k=1 t=1 L N and inner code has Tj(W',Z) == 2, 2, Btn(w,)'zn t=1 n=1 Then for concatenated code, averaged over ensemble of Interleavers of length L, where N Bt(Z)== 2, BtnZ n n=1 P (C) T (1 Z) =~ At (1)B t {Z) E < c' L..J () t=1 L Z=e-Es/No Union Bound e BER for Rate 1/4 Concatenated Code (16-8 tate Outer, 4-8 tate Inner Codes) lE-02 lE-03 lE-04 IE-OS lE-06 "'Q lE-07 c ::s ~ lE-08 ~ ~ lE-09 "'" § IE-IO ~ ~ IE-II IE-12 IE-13 IE-14 IE-IS lE-16 I • .\ \~~ ... t ,\~ ., :\ t "I 1\ \ - ·1\ 1\ t ~ ~ \. - \ \ ~ , ~~ ~ \ I r- l"- I-- I'-.. • ~ - \ ---. ~ '-- r- r--- I-- t---I ~ - --.~ 1\ ,jr--- r---I--- I~, - ~ ~~ t---- - r--- ~, ,~ u -- - - - r--- ~f 1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 2 2.1 2.2 2.3 2.4 2.5 2.6 2.7 2.8 2.9 3 3.1 Eb/No (dB) Interlea ver Size -+-21\10 --21\11 --.-21\12 ~21\I3 .......-21\14 • S irnuI: 21\10 But Union Bound cuts off at EJN o corresponding to "computational Cutoff Rate" R o (1.9dB) well above value of Eb/N o corresponding to Capacity (-O.8dB) ~ Improved Union Bound ~ (_G_al_la_g_er_[_19_6_3_]) _ Define "Rate-Weight" Function Ir(8) ~ {n(Kd)/NI where K d =No. of codewords of weight d I 8 ~ dIN I Normali;zed weight (or Hamming distance) d max . P E < LP(d) d min P(d) == exp[- NE(o)] E(8) = Max {- ph8)+otuh(p)~(1- 8)tug(p)]- (1- p)tu[h(p)+ g(p)]} O<p~1 '" ,~ AWGN: 3 2.5 2 1.5 FnurPmbability Bounds: 4-State Inner; 16-State OuterConcatenated Codes - -.. - -N=256:Union .. N=256: Improved . ... ... ...... - . --+ --N=512:Union , ~ -- , , , '" " \ \. ........ " ..~ . , ... -+-N=512:Improved . \ .~ ~ ~i"-..., ~Il- • J ..' I!" " --. - -N=1024:Union "- ....... " N:I024:Imp rove d "- "- ........ ... • , " \ \. "- '" """"'l ... ~, \ \ I~ ~ ~ ~ " --. - -N=2048:Union IfIo...... ... ' ~"l , __ N=2048: Approx. ~ " .. ........ \. " "' . ... .... - - - - -N=4096:Union \ . ... \ \ 'l. ~~ , , ... ~ .......' , ... N 4096: Ap p ro x. , ... "- ... ......... , '\ 'l , , ," ... . ..-......::...' \ \. r\ \ \ " ~ . ... ~... .~ ~ '\ '" --.. . \ ~ ,....." \ \. I~ \ )~ ....., ~iI. , . I~ ~ ~,.,. . , ... ~ . , . --..-- - 0Ii'.. - - l~iI. "'- -- -- ~ , --r--. ----. .. ........ . , ...... ..- - - r--- . ,,,. .. --- - ---.; ~ ................ r-- ~. ... . .. - .. -- . ... --- t-- .. ... r::--~ 1.00E-08 0.5 1.00E-Ol 1.00E-02 1.00E-07 1.00E-06 1.00E+00 1.00R-03 ~ :c ~ ..c 0 1.00E-04 ... =-. ... 0 ... ... ~ 1.00E-05 Fb/No (dB) Rate-Weight Distribution N=256 - - - N=512 N=1024 N=2048 N=4096 Random Code 1 0.9 0.8 0.7 0.6 0.5 delta 0.4 0.3 0.2 0.1 0~~~__y_--_+_t___-_t---i__--_+_--_1_--_+----\~---+_-____l 0.2 -,-------,--------r----------r---..--------.----,-----r-------,---...,--------, 0.1 -t----j-----f-----R~~-+-----t-----t--+4~------1---+------l 0.05 +----t---~r:.._r_f_--t---+-----t-----t----+~..__----1---+------l -0.05 ...L--+---I.-----ll.-.l-__---L .l.-.-__-l.-__-L-__-L__~I~--..L-------.J o . 0.15 -t----j-----f-----f---:ll!l~C-----l~---::lll,~,..----+---t-----+-------j Note that with "random coding" we replace K d by K d =2K(~!-N r(o) a ~ ~ (Kd)= ~[(K-N)~2+(~)] = -(1-R)~2 + ~(8) where ~(8) =-8~ 8 - (1-8)~ (1- 8) d and 8= - <1 N and with this f(8), E (b) > 0 for all b, provided R < C (thus achieves Shannon Capacity) Define O(b) ~ r(b)- r(b), deviation from Random Coding Distribution. 0t 0.55 0.5 0.45 0.4 0.35 0.3 - S Gi 0.25 " (; 0.2 0.15 0.1 0.05 0 Increment Above Random Code \ '\ -N=256 '\ N=512 -N=1024 , N=2048 Approx. ~ - N=4096 Approx. ......... ~ ,,~ '" ~ ~ ~ ~. ~ ~ ~ --.. r--...:: -0.05 o 0.05 0.1 0.15 0.2 0.25 delta 0.3 0.35 0.4 0.45 0.5 • To Relate Turbo Bound to Random Coding Bound can show E(8) = MaX{[Eo(P)-PR tn2]+P[btu 8 ,+(1-8)tu 1-3 -Q(8)]} 0<p~1 a(p) 1- a(p) where [ ( ) 1/1+P ()1/1+ P ]1+ P ( I t B· J E (p)= ptu2-tu[g(p)+h(p)]=-tur Po Y ,+Po -y dy' npu - mary . o -00 2 Output - Symmetric ex (p) = h(p)/[g(p) +h(p)] Capacity corresponds to Min E(8)~ 0 8 For Random Coding ') (8) = 0 ==> Min E(8) =Max [Eo (p) - pR tn2] 0<0<1 0<p~1 For Turbo, Mjn M~x { } ~ends strongly on N Low -8 "Tail" prevents obtaining general exponential bounds and causes "Error Floor" at high EJN o • Minimum Exponent: 4-State Inner; 16-State Outer Codes 0.005 0.01 0.015 0.025 0.02 0.035 0.03 0.04 0.045 0.05 o -1 -0.5 o 0.5 1 Eb/No (dB) 1.5 2 2.5 "" ---------..---,--------...--.----.-......----·--·------·------r--------- .......- .... - Random Coding -N=512 "" -N=1024 -N=2048 '\ -N=4096 '" ~ --------- r---.. "" -----..: ~ I - ~ ~ - ~ ~ ~ ~ I ~ ~ ---- 3 N" Min Exponent: N=1024 and 4096; 16- and 64-State Outer Codes - - - - - -16- . State:N=1024 - - - • - -64- State:N=1024 --16 State:N=4096 --64- State:N=4096 , 0 o 0.5 1 , .. 1.5 .....,.-----....., '-----.,~-.-- 30 --.. , , - 2 2.5 Eb/No (dB) 3 , , , , - -, 3.5 '--,.-----...,-----,.------ 4 4.5 -, - t-----t----t-----t----+-------+-=-.............,=----+-------1...--------<~_\_-_I_--__+ 15 C -'- '__ cu -- _ c - -- , 0 ", ' Co '\ ~ , , w " " C t-----t----t-----t----+-----t----+-----l----....'~'..___f--_\__+__I_--__+10:E . « Z , ' .. .. , -- -- I------f--'~--t__--_+_-_=_....~k::_--_+_---I__--_l_--~k:_--__+_--__+ 20 t------t----t-----+----t-----+----+------l----+---'.-...-\---\l-------4-5 ~::--"'--..-_+_---+__--_+_-~::::__+__--_+_---+__--_.+_---I__--_l_--__+ 25 5 Error Probability Bounds: N=1024 and 4096; 16- and 64-State Outer Codes 3 2.5 2 1.5 1 . - . ...... " --+-N-1024; 16-State " "'. " \ i. f'\.. r\. - .- N=4096; 16-State . '" '" p "'til "- \ I\. , \ • N=1024; 64-State " " " "- "- " ;. I~ ~~ - - - N=4096; 64-State ," "" " '" i\. . \ ,, . " '" \ \ ~ " \. ~ ~ " .. \ .. "" ~ , ..... r'-,L ""'ll~ ~ .. - - . .. r---.. , ... ... I ...... """""t ~ - -... - ., . ... ... " ... ~ .. .. ... . .. ... - 1.00E-02 1.00E-09 0.5 1.00E-07 1.00E-01 1.00E-08 1.00E+00 1.00E-03 ~ :s 1.00E-04 as .c 0 10. ~ 10. 1.00E-05 0 10. 10. w 1.00E-06 Eb/No (dB) Error Probability Bounds: 4-State Inner; 16-State Outer Concatenated Codes 3 2.5 2 1.5 1 ·.* .. N=256:Union • N=256: Improved - , " ....... . •.•.. N=512:Union \ I'\. '" "'" .......... . \ \. "" "' """"- , . .' • N=512:lmproved , 1 '\ .~ ~ ~~ ..... ~~ '. . "I" .' •••. - N=1 024:Union ,. " ....'. • N:1024:lmproved \. " '- r"'o.. ~ ~ \ " " "' ........... ~~, •.•.. N=2048:Union \ \ .~ '" ~ ...... ~..:' . ' .. N=2048: Approx. • , • • - •. N=4096:Union " " .." """""" . \ \ "- "'- · ... ........... ~.. \ \ II "'~ .. ... ~ ~'- N=4096: Approx. • . '. . • Simulation:N=4096 " "- . \. " " ...... · ........... \ \ I\.. "t · , ... I~ L. \ \ "- ~ b .~ ~ " ,. " ...... \. " '" .. ........... \ " I~ I . , ~J.--. \ )l "'I ~ .. · , II. ~ ~~ · · ... ........... · ... , ..... 01"-- --- ~ · ... ... ....--... .. "" ~ --- --- --.:... ... ... -,~ 11--....• ... r--- .... ........ --- ~ ., ..... r-- - ---.: .. - r--- ~ ....... ~ ....... . . ... ... . ---- ... - ...... ----10- ...... . ...... r--" .... 1.00E-01 1.00E-07 1.00E-06 1.00E-02 1.00E-08 0.5 1.00E+00 1.00E-03 ~ :c ca .Q 0 1.00E-04 ... Q. ... 0 ... ... UJ 1.00E-05 Eb/No (dB) Simplified MAP Decoder Suppose Inner Code is Convolutionally Generated Block Code (Terminated to the "all-zero" state); tn(eX+e Y ) = Max (x, y)+ In(1 + e-Iy-xl ) D. Max * (x, y ) L k = Max * M ( ) - Max * M ( ) DUAL MAXIMA RULE z P(d) ~ exp[- NE(8)] " '~ _1_rn_ p _rO_v_e_d_U_n_i_On_B_O_un_d_<G_a_ll_a_ g e_r_[_19_6_3_]}_ ~ ~ dmax P E < 'LP(d) d min E(<5) = Max {- p~(<5) +<5~h(p) + (1- (5)~g(p)]- (1- P)~[k(p)]} O<p:S;1 k(p) = h(p)+ g(p) == ~r~ ~o(ytl+P + Po(-yt 1 + P ] 1+p dy AWGN: Bound depends on "Rate-WeigM" Distri'bution and' Channel Po(y) Error Probability Bounds: 4-State Inner, 4-State Outer Concatenated Codes . -.•. - N=256:Union I . , , .. N=256:lmproved , \ ........ . \ "'" ... " 'il. ..••. N=512:Union \ \ "' ~.,: .1 \ \ " ~ ...~ -+- N=512:lmproved ~ l • -•• - N=1 024: Union • N=1024: Improved \ , .... ... 4. r\. ......... ... -.• - -N=2048:Union \ .. "- ~ Jl, \ \ 1\ ~~ ~ I ~ ~ ... • N=2048:lmp. Approx. •• .... ~~. - ••- - • N=4096: Union """"" N=4096: Imp. Approx. , I" , ..... , \ 4. \. "'- I ~, ..,..... \ \ \ " • I •• ~k... \ \ 1\ ~ ~ ~. '~ ~ ... ,...."",. ..... , r--. 1\ I\. -..... .. I --.... \ ~ -. NI. •• ""IIr---,~ \ l~ . I -.~ ~ ~. ~.... " --........ - ........ ......-. , ... - I--- ~~ - ,. - r-- ...... . ..~ h-. :-- r--; ~ .~ ~ ~ ~ ......-. - r---. - "'- r--.. I 1.aOE+OO 1.00E-01 1.00E-02 ~ :s ca .Q 0 1.00E-03 ~ Q. ~ e ~ w 1.00E-04 1.00E-05 1.00E-06 0.5 1 1.5 Eb/No (dB) 2 2.5 3 1.00E+OO 1.00E-01 l. 1.00E-02 1.00E-03 Parallel Turbo Codes: K=4, rate 1/3 i' \ 1\ \ , ~\ \ \ , \ ~~ , \ \ , - " , '\. '\. \ '" • \ \ 0 " ~ \. \.-. \\ h ....... " " ........ '"" " .,~ ...............A l \. -..- ---- \ ""lr---... ~ \ ~ ~-::~ ~~ ::::-- ----- - - - - --.. ---. --.. --- - ... - N=256:Union • N=256:lmp - .. - N=512:Union • N=512:lmp 1.00E-04 1.4 1.6 1.8 2 2.2 2.4 Eb/No (dB) 2.6 2.8 3 3.2 -- - ------------------. Error Probability Bounds: 4-State Inner, 64-State Outer Concatenated Codes 3 2.5 2 1.5 1 ............- .. ..~ ~ ~ ...__ ~•• _ n _ •• •• _ ........,.. u .... _.,_. . '" ,....- .... .... -. ... _ .........lI:.. ...I. ;,. ••••• .._.~..... ~~ ...._-................._ .... . ..... ... , ,- - - • - . N=256:Union " .... " -- .. N=256:lmproved \ " " ........ .""" .. .- \ \ l'. ~ n ••••••.•~ ~~ .. .' ·.•.. N=512:Union • N=512:lmproved .... " ~ ·.• - . N=1 024: Union ~ ~ " "'lI ~ ..' \ \ "\. "- ~ r...... '.It • N=1024: Improved ........., · . . . . N=2048:Union , " "- r-o.. -. .. \ \ '" '" ......... ---A- N=2048:lmp. Approx. \ \ i'" ''" .' ~ ~ . . . . · ..- - . N=4096: Union N=4096: Imp. Approx. , , .... .. \ \ '\. ,~ ~ \ \ " " ~ ! , , " n.... , \ , ""'- 1 .... ! \ \. ............... 0 ,~ \ " .... -- \ \ '- • ""ll~ i \ \ r---..L ~ ~ -I -, 1\ .--. -- \ ~ ~~ --. ~L i ---i ~ ..... -- --- -'"lrJ-.. ! -'-- ··h ~ : --- r--. -... ~ .. .'"':""- ~~ . - 1.00E-01 1.00E-02 1.00E-09 0.5 1.00E-07 1.00E-08 1.00E+00 1.00E-03 ~ :s 1.00E-04 ftI .a e Q. ... 1.00E-05 0 t: w 1.00E-06 Eb/No (dB) -~----~-----------------------_. r------~..,__-------~---____'!!'----~ ~~ If;~ ~O·,--C> ~ ~ AI ¥ D{t ) ~if(~2 ~t-rri~)- f1f)~- , .) "'" - ~ Ii) 7-/ ~'r.~J--f,,) ~~ ft-~ )_ f l 0) 'F (. ) ~ 1 r(D~;p) t)::: ~ +-1...' [v (4<l) ,J-' J V~,y) t)S. j),t)1 -r-a--y :J . ,---~-- I f,(et)",f. [Vto~~)~' J ~ .MJ[D(/1-o)~)-J , rrt.J ('t",..;a: _ ~tr[ '0.) v xp [v {,to.I 'i) - ~ -_.JL "'=-1 - /J('t ...}"" - l'/Bftyf . 1,(.) < w·~~ N~. I-~) f ~) J fzJti) ~ f""'[D~o }~) sa.J D0'-I/) ) < 1)~.) )r~ J ~, .-\l <L.v--[ - D{~) !J~ [V(-f O ) 'tr) - l-+,') P - ( <1- t1"LA :P(~ ,1j x f f?~Q)Y)- p(-' .~ ~ rr'>c +. 1-=-1 ./ 1'1/~ 1'1. 1:r/t,.-J ~ ~ +o./,;.¥-.o } .... , /' . / tv /' / : "'- .- , J ,;" .. J .... \It . _...---- .........----.-' ------_...---------- ------ , . -', i:111" . - ttl' ~ (~) -:: (--t) ~) J / j) tff) -r eel'L[: of) 'f; ('fi] (r-d) .' ,(~~ r(f-J)~r{rt)1: (t?)J - e.L[ p)~1 (f) r (t- ;):tr;;;;;(~ ,.....:; . - el~§~lrp)J~f{t-r)J-{:t~(J -- IlL- ['ilff)-I-i'Vi) tl) ::: -t~J - r[ cf'LO<{f} (i~d)-L[j-~~)Jj -t ~ C!'(f)1"" (f~ p)-,/j -=- 1/(1) -{r-(l.).L2. ~«:J ~)rr1)~~~~~ ~ -{}...I'- (,-I)1.C-I/-{t-fL)J.-. 1- +-. (I) L€(~I) _ +/rrdJ...~) (,-cJ)~'~ +(,- ):--"2 :_j)(1 (p$ ( :J:{- 2J(I)~) fA..' -~ '1tf ~ I'~p( W. ° • ~ \ a& =--~.£(f) -rf.i2-(/~R) ro/ f -=-f ~CD~)tr~(V~ ~f ~ ~(i) =-S -&6 (of) Vz-- 6fca0!{1 ~ .(L4~~~ ~ n1 ~{z~/N; :::. - rrJ... - cr),.. .e- £,J, 0 -::;..-/~ t-~d U~ " l .... . . IL~ flL ,\"'7 '" ::::- r;~4J~ rr ''[(J .. - t (tt) ::~..-m)(2- ... lj - f IV . -J?:rr -~-+m)X 1:'.. J.-t: 'f; fer)-:;-~ (-tt) ::;..Q .." A-) ~1J~_ ~ ~(f) ~ d'"(f) ~Q)----t(eJ r~f) f.r/ If. (-I ) +3&-8 '~0,2-S"d!8 (ii-e-; .' .) o +- f~C~) I)~ ~.CI _ (tOO F/4 ~ TaffiL -- - -- B) -F; • I .. \.. CD. _ _ _ . I If'''p cQ~(i) =- -7::- 2-~fLtfti1r--(-'--- 1------- tf i fu/~-_AFiltwv -1-)--------- r---------~------I 1/ v~ T7J =---b+ ~-- ~!if / ;\~ '~ {f(r / - -~ ___lf o '_ 0 / --rt.d~ , _ 7,.- --- ._------ ---------- fiFi:-~-~~ )-;bt~{f)~-·---- 06 I . I 7r,o- #~)--=- ~~_~ lfy)0-/~~-r-1J~ j--1r---- r---~~--"------ _.~--- --'--' -------.----.--j ---1---~-~TL-L~~-t{{9·-#--- /V AJ- L V W~t 2-flC t )' N-'~ (i~J~ ij) J; , ;: ~~ i-" fA tiJ z; f\ _ of""'" 1-'r...: -2 L I J ;I ~ -:::- z..- J Dave Forney-LUSE27, 06:59 PM 6/1/98 -, RE: Shannon Theory and Turbo D Comments: ( Received on motgate.mot.com from client pobox.mot.com, sender Dave_Forney-LUSE27 @email.mot.com ) From: Dave Forney-LUSE27 <Dave_Forney-LUSE27@email.mot.com> To: "'Deborah Casher'" <dcasher> Subject: RE: Shannon Theory and Turbo Decoding/AJ Viterbi Date: Mon, 1 Jun 1998 18:59:57 -0400 X-Mailer: Internet Mail Service (5.0.1460.8) Deborah: My PowerPoint for the Mac doesn't recognize this as a PowerPoint document, probably because it's for Windows. Could you just mail me a hard copy? Thanks very much. Sincerely, Dave Forney Dr. G. David Forney, Jr. Motorola, Inc., MS M4-10 20 Cabot Boulevard Mansfield, MA 02048-1193 (508) 261-5347 (0) (508) 261-4447 (fax) LUSE27@email.mot.com > ---------- > From: Deborah Casher > Sent: Monday, June 1, 1998 4:24 PM > To: Dave Forney-LUSE27 > Subject: Shannon Theory and Turbo Decoding/AJ Viterbi > > «File: Shannon.pptll.ppt» > Please let me know if you receive this OK. ~ not I'll send a hard copy. > > Deborah Casher > Assistant to Andrew Viterbi > > > QUALCOMM Incorporated > 6455 Lusk Blvd. > San Diego, CA 92121 Printed for Deborah Casher <dcasher@qualcomm.com> 1 Dave Forney-LUSE27, 06:59 PM 6/1/98 -, RE: Shannon Theory and Turbo D > > Voice: 619-658-4806 > FAX: 619--658-2500 > email: dcasher@qualcomm.com > Printed for Deborah Casher <dcasher@qualcomm.com> 2 Andrew Viterbi, 10:58 AM 6/1/98 -, another person to send "Shanno X-Sender: viterbi@adept.qualcomm.com X-Mailer: QUALCOMM Windows Eudora Pro Version 3.0.3 (32) Date: Mon, 01 Jun 1998 10:58:05 -0700 To:dcasher From: Andrew Viterbi <viterbi> Subject: another person to send "Shannon" to sshlomo @ee.technion.ac.il Printed for Deborah Casher <dcasher@qualcomm.com> 1 Andrew Viterbi, 11:11 PM 5/20/98 Shannon Day X-Sender: viterbi@adept.qualcomm.com X-Mailer: Windows Eudora Pro Version 3.0 (32) Date: Wed, 20 May 1998 23:11:05 -0700 To: viterbi From: Andrew Viterbi <viterbi> Subject: Shannon Day >X-Sender: viterbi@adept.qualcomm.com >Date: Wed, 20 May 1998 23:04:58 -0700 >To: viterbi >From: Andrew Viterbi <viterbi> >Subject: Shannon Day > »Date: Tue, 19 May 1998 20:38:03 -0400 »From: "Emre Telatar" <telatar@research.bell-Iabs.com> »To: viterbi »Subject: Shannon Day » »Dear Dr. Viterbi, » »1 very much appreciated your coming to the event after the »most unfortunate discontinuity in its organization. I also »apologize for my rather last-minute way of doing things. » »It was a great pleasure to hear your talk. If you have an »electronic version of it could you send it to me? If you »don't have any objections I would like to put it on the web »with all the other talks. I realize that at least one diagram »was done by cutting and pasting, but maybe I can find a way to »still display it. » »If you could also send me the receipts of your expenses in »connection with your trip (airfare, car, lodging, food, »etc.) I will get the Lucent bureaucracy to start working »towards reimbursing you. » »Please give my regards to Mrs. Viterbi. Thank you again for »coming, » »Emre » > > > Printed for Andrew Viterbi <viterbi@qualcomm.com> 1 Dan Costello, 05:42 PM 5/20/98 , Your talk at Bell Labs Date: Wed, 20 May 1998 17:42:28 -0500 To: viterbi From: Dan Costello <Daniel.J.Costello.2@nd.edu> Subject: Your talk at Bell Labs Dear Andy, A couple of my students attended the session at Bell Labs on Monday and reported that you gave a very interesting talk on serial concatenation. We have also been doing some work in this area. Would it be possible to get a copy ofyour slides? Or do you have a paper written up on this subject? Regards, Dan ( • ,. ® MOTOROLA G. David Forney Jr. PRINCETON UNIVERSITY DEPARTMENT OF ELECTRICAL ENGINEERING ENGINEERING QUADRANGLE. 8323 t U(, ••<:£f PRINCETON. NJ 08544·5263 ~ ........ HISASHI KOBAYASHI, PH.D. ~ Shetman Fairchild Univmity P1'Oftsso~ ofEltetrieal Enginuring and Computtr Serena Home: 21 Russell Road Princeton, N] 08540 Tel: (609) 683 -9372 Fax: (609) 683·0709 Printed for Andrew Viterbi <viterbi@qualcomm.com> 1 REQUESTED TRAVEL ARRANGEMENTS To: DEIORAH [ASHER Fro~: Hdrini "drdsi~hdn' Sent from: Voice Number: FAX Number: 85/15/90 18:82:85 882 Harini Narasimhan 619-678-3424 619-678-3769 Note: Airlines can change tares or cancel un-ticketed reservations. To guarantee a fare, you must purchase the ticket. Deborah, Here is a current itinerary of the trip. Please call me if you have any questions. Best regards, Harini SALES PERSON: 04 CUSTOMER NBR: QC1QUALC01 TO: ATTN DEBORAH CASHER ANDREW VITERBI QUALCOMM INC *Q FOR: VITERBI/ANDREW ITINERARY TTFBBE DELIVER 6 APR 2P DATE: 15 MAY 98 PAGE: 01 17 MAY 98 SUNDAY HOTEL NEWARK LH HEADQUARTERS PLAZA THREE HEADQUARTERS BATH L R I 2 NIGHTS 1 ROOM OUT-19MAY DOUBLE WIT MORRISTOWN NJ 07960 RATE-177.00 PER NIGHT FaNE 973-898-9100 GUARANTEED LATE ARRIVAL CONFIRMATION 231751 TO AVOID NO-SHOW CHARGES, CANCEL HOTEL 24 HRS PRIOR 19 MAY 98 TUESDAY CAR WASHINGTON NATL AVIS RENT A CAR PICK UP-lOA 1-FULL SZ AUTO AC RETURN-20MAY/5P ID-FG320H RATE IS GUARANTEED DAILY RATE-USD51.00 UNLIMITED MILEAGE EXTRA DAY-51.00 UNLIMITED MILEAGE EXTRA HOUR-17.01 UNLIMITED MILEAGE CONFIRMATION NUMBER 12932494US1CH UPGRADED SEAT IC 20 MAY 98 WEDNESDAY AIR UNITED AIRLINES FLT:215 ECONOMY LV WASHINGTON DULLES 520P AR SAN DIEGO 727P ARRIVE: TERMINAL 1 CORP ID-B555600 MULTI MEALS EQP: BOEING 757 05HR 07MIN NON-STOP OA PNR: P8T2BC Advisory Committee - Fifth meeting subcommittee agenda http://www.ccic.gov/ac-members/agenda_sub-18May98.htf , Third Meeting National Coordination Office fOrr ~. Computing, Information, and Gommunicatlons IDmIIIEBIBI_ . _ _DmII_ Presidential Advisory Committee Subcommittee agenda for fifth meeting (May 18-19, 1998) • Monday - May 18. 1998 1" Tuesday - 5/18/98 Closed Session 8:30 a.m. - 5:00 p.m. (Rooms 360, 365, 370, 380) 8:00-8:30 Coffee/Continental Breakfast for members Room 360 8:30-9:30 Subcommittee Meetings Room 360 9:30-12:00 Discussion of Draft Interim Report by Subcommittee • Research Subcommittee • Workforce Subcommittee • Vision Subcommittee • Management Subcommittee Room 360 Room 365 Room 370 Room 380 12:00-2:00 Full Committee Working Lunch Room 360 2:00-5:00 Discussion of Draft Interim Report by Subcommittee • Research Subcommittee • Workforce Subcommittee • Vision Subcommittee • Management Subcommittee Room 360 Room 365 Room 370 Room 380 6:00-8:00 Dinner Bistro Bistro Restricted Area Nat for publkclstrt&utfon~ __EB&I£IIIIII _ 1 of 1 5/13/98 11 :27 AM Advisory Committee - Fifth meeting private agenda http://www.ccic.gov/ac-members/agenda-19May98.htn , Third Meeting National Coor(linatJ,on Office for Comp"ting, Information, and Communicatio;ns III!III_~ ,_ '.IIDIII ~·t-wilttIHf~, ••• • ~~. ,". Presidential AdVisory Committee ~~:.:- Private agenda for fifth meeting (May 19, 1998) ..J,. • Tuesday - May 19,1998 1- Tuesday - 5/19/98 Public Session, 8:30 a.m. - 4:15 p.m. NSF Board Room (Room 1235) 8:00-8:30 Coffee/continental breakfast for members 8:30-9:00 Welcome and Discussion • Remarks from OSTP Joy/Kennedy Kelly 9:00-10:00 High Performance Computing in Asia • David K. Kahaner, Founding Director Asian Technology Information Program Kahaner 10:00-10:15Break 10:15-11 :45lnterim Group Status Reports Committee Co-Chairs • 10:15 - 10:45 Vision • 10:45 - 11:15 Research -- Basic • 11:15 - 11 :45 Research -- High-end Computing Adjourn for Lunch, 11 :45 a.m. - 1:00 p.m. Discussions among Members NSF, Room 1295 1:00-2:00 Interim Group Status Reports Committee Co-Chairs • 1:00 - 1:30 Research -- Software, Infrastructure • 1:30 - 2:00 Research -- Societal Impact/Research Metrics 2:00-2:15 Break 2:15-3:45 Interim Group Status Reports Committee Co-Chairs • 2:15 - 2:45 Management and Policy • 2:45 - 3:15 Workforce • 3:15 - 3:45 General Discussion 3:45-4:15 Public Comments All 4:30-5:30 Subcommittee Meetings (Not open to Public) Discussion of next steps Room 1295 5/13/98 11 :26 AM .' Thursday, Mayl4, - San Diego to Newark AT&T SHANNON DAY 1:00PM 9:05PM LV San Diego AR Newark C\.. Avis Car V Conf. No. 11689350US1CH New York Palace Hotel (in 5/14; out 5/17) $295 455 Madison Ave. at 50 th New York, NY Phone: 1-800-NY-PALACE or 212-888-7000; Fax: 212-303-6000 Conf. No.NY524423 Friday, May 15 AT&T Presentation: A constructive Approach for Migration to Wider Band Wireless Services 10:30 Deliver Talk AT&T Labs Newman Springs Lab 100 Schulz Dr. Red Bank Zoran Kostic: 732-345-3130 Sue Miller (sec.) 732-345-3126 Sunday, May 17 - Travel to Murray Hill Headquarters Plaza Hotel - $162 (2 nights in 5/17; out 5/19) 3 Headquarters Plaza Conf. No. 231751 Morristown, NJ Tel: 973-898-9100 Fax: 973-292-0112 Monday, May 18 - Shannon Symposium 3:30PM Lucent Technologies Murray Hill Auditorium 700 Mountain Ave. Murray Hill 05/06/98 11:42 AM .... Tuesday, May 19 - AT&T HQ 8:30AM AT&T, Lewis Chakrin, VP, Bus. Dev/Corporate Strategy 295 North Maple Avenue, Room. 3361D1 Basking Ridge, NJ 07920 Phone: 908-221-8800 Fax: 908-204-1727 Travel to D.C. via air shuttle from Newark - See attached. Arlington Hilton (1 night. In 5/19; Out 5/20) (Debbie reserved) Hotel ($139.00 plus tax, gov't. Rate) ( 950 N. Stafford St. Arlington, VA 22203 Phone: 703-528-6000; Fax: 703-528-4386 (Identification reference: Group Block G 8028 ) Confirmation No. 59282 Tuesday, May 19 Committee Meeting 5/18 Subcommittee mtg.; 5/19 full Committee mtg. 5/20 meeting extended~ day. National Science Foundation 4201 Wilson Blvd. Room 1235 Arlington, Virginia. Wednesday, May 20 - Continuation of Meeting. Wednesday, May 20 - Dulles to San Diego - (see attached) 05/06/98 11:42 AM AT&T SHANNON DAY Thursday, May14, - San Diego to Newark LV San Diego AR Newark Avis Car Conf. No. 09002219US2CH 1:00PM 9:05PM United #472 to be upgraded New York Palace Hotel (in 5/14; out 5/17) $295 455 Madison Ave. at 50 th New York, NY Phone: 1-800-NY-PALACE or 212-888-7000; Fax: 212-303-6000 Conf. No.NY534423 Friday, May 15 AT&T Presentation: A constructive Approach for Migration to Wider Band Wireless Services 10:30 Deliver Talk AT&T Labs Newman Springs Lab 100 Schulz Dr. Red Bank Zoran Kostic: 732-345-3130 Sunday, May 17 - Travel to Murray Hill Headquarters Plaza Hotel- $162' ight) 3 Headquarters Plaza Conf. No. 231751 Tel: 973-898-9100 Fax: 973-292-0112 Monday, May 18 - Shannon Symposium 9:00AM Lucent Technologies Murray Hill Auditorium 700 Mountain Ave. Murray Hill Travel to D.C. via air shuttle from Newark - See attached. 6/30/9711:00:47 AM -4 • dO Arlington Hilton (in 5/18; Out 5/1 ) (Debbie reserved) Hotel ($139.00 plus tax, gov't. Rate) 950 N. Stafford St. Arlington, VA 22203 Phone: 703-528-6000; Fax: 703-528-4386 (Identification reference: Group Block G 8028 ) Confirmation No. 59282 Tuesday, May 19 Committee Meeting 5/18 Subcommittee mtg.; 5/19 full Committee mtg. National Science Foundation 4201 Wilson Blvd. Room 1235 Arlington, Virginia. V\ Wednesday, May 1 - Dulles to San Diego LV Dulles 5:20PM AR San Diego 7:27PM United #215 6/30/9711:00:47 AM Shannon Day Program .. bttp://cm.bell-labs.com/cm/ms/what/shannonday/program.bt Preliminary Program for Shannon Day May 18th, 1998 Arnold Auditorium, Bell Laboratories, Murray Hill, NJ 8:15 Registration and Coffee 9:00 Welcome by Arun Netravali, vice president, Bell Labs 9:20 Jacob Ziv, Technion Entropy Has Many Faces 9:50 Robert Gallager, MIT To Be Announced 10:20 Break 10:40 Jack Wolf, UCSD Shannon Theory and the Magnetic Recording Channel 11:10 David Forney, Motorola Euclidean Space Coding 11:40 Neil Sloane, AT&T Labs Packing Spheres in N-dimensions 12:10 Lunch 2:00 Toby Berger, Cornell; Jack Wolf, UCSD; Jacob Ziv, Technion Remembering Aaron Wyner 2:30 James Massey, ETH Shannon Theory and Contemporary Cryptology 3:00 Emre Telatar, Bell Labs Current Topics in Information Theory at Bell Labs 3:30 Break 3:50 Andrew Viterbi, Qualcomm Shannon Theory and Turbo Decoding 4:20 Thomas Cover, Stanford University Shannon Theory and Investing 4:50 Robert Lucky, Bellcore To Be Announced 1 of 1 Register for Shannon Day. 4/29/98 1:59 PlY Harini Narasimhan· , 12:11 PM 5/6/98 ., Itienrary/Erna Date: 6 May 1998 12:11 :00 -0700 From: "Harini Narasimhan- Plaza/Corp" <harinin@balboa.com> Organization: Balboa Travel To: "DEBORAH CASHER" <dcasher> Subject: ttienrary/Erna Deborah, Here is a current itinerary of the trip. Please call or email me if you have any questions. I have put both records on queue for an upgrade. Best regards, Harini DATE: 06 MAY SALES PERSON: 04 ITINERARY 98 CUSTOMER NBR: P06QUALL01 TNXPCZ PAGE: 01 TO: ATTN DEBORAH CASHER ERNA VITERBI QUALCOMM INC *Q FOR: VrrERBVERNA DELIVER 6 APR 2P 14 MAY98 - THURSDAY AIR UNITED AIRLINES FLT:472 ECONOMY LUNCH LV SAN DIEGO 100P EQP: AIRBUS A320 DEPART: TERMINAL 1 AR NEWARK 905P NON-STOP ARRIVE: TERMINAL A VITERBVERNA SEAT-13F UA-00639825973 19 MAY 98 - TUESDAY AIR UNITED AIRLINES FLT:215 ECONOMY DINNER LV WASHINGTON DULLES 520P EQP: BOEING 757 AR SAN DIEGO 727P NON-STOP Printed for Deborah Casher <dcasher@qualcomm.com> 1 Harini Narasimhan- , 12:11 PM 5/6/98 -, Itienrary/Erna ARRIVE: TERMINAL 1 VITERBVERNA SEAT-19F UA-00639825973 17 AUG 98 - MONDAY OTHER SAN DIEGO BALBOA RESERVATION PROTECTION DURING BUSINESS HOURS 619-678-3760 OR 888-784-0772 FOR AFTER HOURS EMERGENCIES, CALL 800-359-8773 THANK YOU FOR CHOOSING BALBOA TRAVEL ID-CODE-U4E4-QUAL DUE TO INCREASED SECURITY, A PHOTO I.D. IS REQUIRED. THIS TICKET IS NON - REF U N DAB L E AND NON - T RAN S FER A B L E **ANY** CHANGES WILL RESULT IN ADDITIONAL COSTS VARIOUS RESTRICTIONS APPLY A FEE OF 75.00 APPLIES FOR CHANGES PLUS ANY FARE DIFFERENCE IF APPLICABLE. ATTENTION VALUED CUSTOMER- AN ADDITIONAL SERVICE FEE OF 10.00 PER TICKET WILL BE ADDED TO THIS TRANSACTION THIS WILL APPEAR AS AN INDIVIDUAL CHARGE ALL TICKETS EXCHANGED OR REFUNDED ARE SUBJECT TO A 10.00 SERVICE FEE IN ADDITION TO AIRLINE CHARGES PLEASE REVIEW ITINERARY FOR ACCURACY YOUR RESERVATION COORDINATOR IS HARINI. THANK YOU FOR CHOOSING BALBOA TRAVEL. PLEASE CALL IF YOU HAVE ANY QUESTIONS AND HAVE A PLEASANT TRIP. Printed for Deborah Casher <dcasher@qualcomm.com> 2 Harini Narasimhan- , 12:04 PM 5/6/98 -, ItineraryNiterbi 14 May Date: 6 May 1998 12:04:00 -0700 From: "Harini Narasimhan- Plaza/Corp" <harinin@balboa.com> Organization: Balboa Travel To: "DEBORAH CASHER" <dcasher> Subject: nineraryNiterbi 14 May Deborah, Here is a current itinerary of the trip. Please call or email me if you have any questions. Best regards, Harini DATE: 06 MAY SALES PERSON: 04 ITINERARY 98 CUSTOMER NBR: QC1QUALC01 TTFBBE PAGE: 01 TO: ATTN DEBORAH CASHER ANDREW VITERBI QUALCOMM INC *Q FOR: VITERBVANDREW DELIVER 6 APR 2P 14 MAY 98 - THURSDAY AIR UNITED AIRLINES FLT:472 ECONOMY LUNCH LV SAN DIEGO 100P EQP: AIRBUS A320 DEPART: TERMINAL 1 AR NEWARK 905P NON-STOP ARRIVE: TERMINAL A VITERBVANDREW SEAT- 6C UA-00086195755 CAR NEWARK AVIS RENT A CAR CORP ID-8555600 PICK UP-21 05 1-FULL SZ AUTO AC RETURN-18MAY/8P ID-FG320H RATE IS GUARANTEED DAILY RATE-USD46.99 UNLIMITED MILEAGE EXTRA DAY-69.99 UNLIMITED MILEAGE EXTRA HOUR-15.67 UNLIMITED MILEAGE Printed for Deborah Casher <dcasher@qualcomm.com> 1 Harini Narasimhan- , 12:04 PM 5/6/98·, ItineraryNiterbi 14 May CONFIRMATION NUMBER 11689350US1CH HOTEL NEW YORK CITY OUT-17MAY LEADING HOTELS 3 NIGHTS THE NEW YORK PALACE 1 ROOM C1 KALL 02CR 455 MADISON AVENUE RATE-295.00USD PER NIGHT NEW YORK NY 10022 CANCEL 02 DAYS PRIOR o ARRIVAL FONE 212-888-7000 FAX 212-303-6000 GUARANTEED LATE ARRIVAL CONFIRMATION NY524423 REQUEST NON SMOKING ROOM WITH KING BED PLEASE 2 NIGHTS OUT-19MAY 1 ROOM DOUBLE WITH BATH RATE-177.00 PER NIGHT GUARANTEED LATE ARRIVAL 17 MAY98 - SUNDAY HOTEL NEWARK L R I LH HEADQUARTERS PLAZA THREE HEADQUARTERS MORRISTOWN NJ 07960 FONE 973-898-9100 CONFIRMATION 231751 TO AVOID NO-SHOW CHARGES,CANCEL HOTEL 24 HRS PRIOR 19 MAY 98 - TUESDAY AIR UNITED AIRLINES FLT:215 ECONOMY DINNER LV WASHINGTON DULLES 520P EQP: BOEING 757 AR SAN DIEGO 727P NON-STOP ARRIVE: TERMINAL 1 VITERBVANDREW SEAT-12C UA-00086195755 17 AUG 98 - MONDAY OTHER SAN DIEGO BALBOA RESERVATION PROTECTION DURING BUSINESS HOURS 619-678-3760 OR 888-784-0772 FOR AFTER HOURS EMERGENCIES, CALL 800-359-8773 THANK YOU FOR CHOOSING BALBOA TRAVEL ID-CODE-U4E4-QUAL DUE TO INCREASED SECURITY, A PHOTO I.D. IS REQUIRED. Printed for Deborah Casher <dcasher@qualcomm.com> 2 ". AT&T SHANNON DAY Thursday, May14, - San Diego to Newark LV San Diego AR Newark Avis Car Conf. No. 09002219US2CH 1:00PM 9:05PM United #472 to be upgraded New York Palace Hotel (in 5/14; out 5/17) $295 455 Madison Ave. at 50 th New York, NY Phone: 1-800-NY-PALACE or 212-888-7000; Fax: 212-303-6000 Conf.No.~5 ~ V Friday, May 15 AT&T Presentation: A constructive Approach for Migration to Wider Band Wireless Services 10:30 Deliver Talk AT&T Labs Newman Springs Lab 100 Schulz Dr. Red Bank Zoran Kostic: 732-345-3130 Sunday, May 17 - Travel to Murray Hill Headquarters Plaza Hotel - $162 (1 night) 3 Headquarters Plaza Conf. No. 231751 Tel: 973-898-9100 Fax: 973-292-0112 Monday, May 18 - Shannon Symposium 9:00AM Lucent Technologies Murray Hill Auditorium 700 Mountain Ave. Murray Hill Travel to D.C. via air shuttle from Newark - See attached. 6/30/9711:00:47 AM , S~O Arlington Hilton (in 5/18; Out (Debbie reserved) Hotel ($139.00 plus tax, gov't. Rate) 950 N. Stafford St. Arlington, VA 22203 Phone: 703-528-6000; Fax: 703-528-4386 (Identification reference: Group Block G 8028 ) Confirmation No. 59282 Tuesday, May 19 Committee Meeting 5/18 Subcommittee mtg.; 5/19 full Committee mtg. National Science Foundation 4201 Wilson Blvd. Room 1235 Arlington, Virginia. Wednesday. May~ - Dulles to San Diego LV Dulles 5:20PM AR San Diego 7:27PM United #215 6/30/9711:00:47 AM Thursday, May14, - San Diego to Newark AT&T SHANNON DAY LV San Diego AR Newark Avis Car Cant. No. 09002219US2CH 1:00PM 9:05PM United #472 to be upgraded New York Palace Hotel (in 5/14; out 5/17) $295 455 Madison Ave. at 50 th New York, NY Phone: 1-800-NY-PALACE or 212-888-7000; Fax: 212-303-6000 Cant. No. ~Y524423, S l\~ S-S-~ Friday, May 15 AT&T Presentation: A constructive Approach for Migration to Wider Band Wireless Services 10:30 Deliver Talk AT&T Labs Newman Springs Lab 100 Schulz Dr. Red Bank Zoran Kostic: 732-345-3130 Sunday, May 17 - Travel to Murray Hill J Headquarters Plaza Hotel - $162 3 Headquarters Plaza ~\ \ t\ . Cont. No. 231751 ,,)\ . \ .) Tel: 973-898-9100 Fax: 973-292-0112 Monday, May 18 - Shannon Symposium 9:00AM Lucent Technologies Murray Hill Auditorium 700 Mountain Ave. Murray Hill 'Travel to D.C. via air shuttle from Newark - See attached. 6/30/9711:00:47 AM . • Arlington Hilton (in 5/18; Out 5/19) (Debbie reserved) Hotel ($139.00 plus tax, gov't. Rate) 950 N. Stafford St. Arlington, VA 22203 Phone: 703-528-6000; Fax: 703-528-4386 (Identification reference: Group Block G 8028 ) Confirmation No. 59282 Tuesday, May 19 Committee Meeting 5/18 Subcommittee mtg.; 5/19 full Committee mtg. National Science Foundation 4201 Wilson Blvd. Room 1235 Arlington, Virginia. Wednesday, May 19 - Dulles to San Diego LV Dulles 5:20PM AR San Diego 7:27PM United #215 6/30/9711:00:47 AM B L B o OUR MISSION AT BALBOA TRAVEL is to help our bu ine clients achieve their objectives and to fulfill the travel dream of our leisure clients TO: ATTN DEBORAH CASHER EI~NA VITEI~B I f:lUALCOMM INC *Q DELIVER 6 APR 2P 1';' MA I AIf~ 19 Mf~Y AIF~ 98 THUPSDAY U~ITED AIRLINES FLT:472 LV SAN DIEGO DEPART: EAST TERMINAL f-lR NEl1JAF~ 1< ARRIVE: TERMINAL A VITERBI/ERNA SEAT-13F 98 TUESDAY UNITED AIRLINES FLr:215 LV WASHINGTON DULLES AR 8AN DIEGO ARRIVE: EAST TERMINAL VITEPBI/ERNA S~AT-19F ECONOMY 100P 905P ECONOM I ~j2'''P ?33F' LUNCH E.(~F': A IIi:BUS A~320 1) INNEF~ E(~F': BOE ING '75'7 NDN""STOP 17 AU 98 MONDAY 01 HEf-\ SAN DlEGfJ BALBO RESERVATION PROTECTION AIf, T JeKET UA849:~1B6673 BILLED TO CA5410654145714116 SUB TOTi~L. I~E:T CC BILL.. ING TOTAL l~t10UNT DUE 75 .. 00 "J!5.00 '1~:; It ~H? 0.00 RECONFIRM RETURNING AND CONTINUING RESERVATIONS 72 HOURS IN ADVANCE FOR INTERNATIONAL FLIGHTS AND SUGGEST 48 HOURS IN ADVANCE FOR DOMESTIC FLIGHTS. CAUTION: TICKETS MAY HAVE VALUE. IF UNUSED PLEASE RETURN FOR CREDIl' OR REFUND. csn 2013711-10 A GIoINII ........... of II Woodside Travel Trust MPORTANT INFORMATION 1.) Please check your documents when you receive them. Call If you have any questions. 2.) RECO FIRMATIONS: Dome tiC' We recommen that you aeon firm all flights prior to departure a d at each poirt of stopover. This will give the alrlme the opportumty to keep you adVised of any changes which may have occurred ifl your flight International: You must reconfirm continUing or re urn reservation at least 72 hours prior to flight time at each pomt of stopover or your reservations will be automatically cancelled. 3.) CHECK-IN: We suggest the followmg check-m times. Domestic: 1 hour prior to departure. International' 2 hours prior to departure. Note: Check·in later than these times could result In denIed board ing. 4.) OVERBOOKING: Airline fhgnts may be overbooked. A person denied boarding on a flight may be entitled to a compensatory payment. The rules for denied boardIng compensation are available at all ticket counters. 5.) CHANGES OR CANCELLATIONS: To change or cancel your fl ght itinerary, caff thiS travel agency or the airline you are scheduled to take. If cancelling, retum the unused tickets to us for credit or refund Most speCial, excurSion, and discount tick ts have various travel restnctlons and may have a penalty for change or cancellation Be sure you nderstand these restnctlons If you change you plans enroute ask the airline to apply the value of your unused ticket toward the purcha e of a ew ticket If a refund IS due obtam a receipt f om the airline If you are holdl g guaranteed hotel reserva tions which you may wish to cancel, notify the hotel as soon as possible. DeposIts and prepayments are sUbject to cancellation polley 6.) I SURANCE: Airline and other travel suppliers' Insurance for bag gage have limited liability. Your personal insurance may not ad equately cover losses Incurred by cancellation, accident, illness or stolen or damaged property. We strongly urge you to purchase additional insurance offered to you. 7 ) LOST TICKETS: Lost, stolen or destroyed tickets must be paid for until refund IS obtained form the issuing airline, subject to an alrhne Imposed service charge. 8.) PREPAID TICKETS: If your travel arrangements Involve a request for prepaid airline tickets, picked up by the passenger at an airline ticket counter, please note that most earners reqUire a mandatory non-refundable service charge YOUR RIGHTS AND RESPO SIBILITIES As Ticket Holder, you are responsible for all information and notices contained WIth n thiS document packet including the ticket , folder and ItS contents. Balboa Travel Incorporated acts agent for airline, crUise tour, hotel, car rental companies and other suppliers of services as well as Tickets Holder and our liability is strictly limited In our capacity as dual agent for both travel suppliers and Ticket Holder, we retain the right and priVilege to charge and collect commiSSions, servIce fees, ticketing fees, processing fees and/or other Similar fees from one or more of these parties, however in no case is our limited liability to Ticket Holder affected by our nght to charge and collect these and other fees. WHAT YOU SHOULD KNOW ABOUT THE POSSIBILITY OF AIRLINE BANKRUPTCIES. Hopefully tliere wi I n01 be any more alrhn bankruotcles but it ha to be recognized that they might occur You should KnOW how they might affect you 1.) If an airline declares bankruptcy It IS not obligated to carry you or to refund ticket issued befor the bankruptcy. 2) Travel agents are not allowed to refund tickets on airline which have declared bankruptcy. Money given to travel agent Immed at Iy becomes the property of the airlines, and we are required by laws to comply with the airlines' orders. 3.) If an alrl ne declares bankruptcy it might contrnu ervlce, Itmlt servlce,o stop completely. Other airlines might accept passengers under limited circumstances or may refuse to accept any passen ger from the defaulted carrier. 4 ) M anwhlle there are flOe tr vel insurance plans available for pas sengers to protect themselves In case of airline bankruptCies CO SUMER 0 SCLOSURE NOTICE ThiS travel agency is acting as a mere agent for SUPPLIeRS fl sell ng travel relat d ser'/lces, or In accepting reservations or bookmgs for eMces that are not directly supplied by thiS trave' agency (such as air and ground tra sportatio 1, hotel accommodations, meals tour . crUises, etc.) ThiS agency, therefore, shall not be responSible for breach of contract or any intentional or careless actions or omiSSions on part of such suppliers, which result in any loss, damage, delay, or injury to you or your companions or group members. Unless the term "guaranteed" IS specifically stated In writing on your tickets. invoice. or reservation Itinerary, e do not guarantee a.,y such suppliers rates, bookings, reservations connections, scheduling, or handling of personal effects. Travel agent shall not be responSible fur any injuries damages, or losses caused to any traveler 10 connection with terrorist actiVities, social or labor unrest mechanical or constructIon fa.lures 0 difficulties diseases, local laws, climactIC condittons, abnormal conditions or developments, or any other actions, omiSSions 0" co ,dltIO"! cu SIde the travel agent's control Traveler assumes complete and full responsibility for, and hereby releases the agent from. any duty of checking and venfylng dny and all passport. visa vaccination, or other entry reqUirements of each destination, and all safety and secuflty condit ons of SUC"' des! nations dunng the length of the proposed travel. For information concerntng possible dangers at mternatlona de tmatlon , on act tl e f1m.el AdVISOry SectIon of the U S. State Department, (202) 647·5225. For medical information cal! the U S Center for Disease Cont 01 (404\ 332-4559 By embarkIng upon his/her travel, the traveler voluntarily assumes all risks Involved In such travel. h er c poo d r ur p.xp ct~d Tf'I agency I nut responSible for cancellation of any servICeS and/or refunds from any uppher or carr er that may cae ope. tlOI1S veler I !\I i Ywal ed of he bove sks as well S poss Ie travel industry bankruptcies and medical and climactic d sruptlons and! d ::>ed t bt n apP~op(Jdte Insurance coverage against them Traveler's retention of tickets. reservations. or bookmgs after IssuanCE: shall con tltute a con~ent to the above and an agreemen on hiS her part to convey the contents hereto to hlslher travel companions or gro p members B L B o U L 1 TO: ATTN DEBORAH CASHER ERNA VJTEf~B I nUAL.CCH1M INC *0 OUR MISSION AT BALBOA TRAVEL i to help our busine client achieve their objectives and to fulfill the travel dreams of our leisure clients DEL IVEI~ 6 APR i.?P DURING BUSINESS HOURS 619-678-3760 OR 888-784-0772 FOR AFTER HOURS EMERGENCIES~ CALL 800-359-8773 THANI< YOU FOR CH()OC~ ING BALBOA TRAVEL ID-CODE-U4E4-QUAL DUE TO INCREASED SECURITY, A PHOTO I.D. IS REQUIRED. THIS TICKET IS NON - REF U N DAB L E AND NON - T RAN S FER A B L E **ANY** CHANGES WILL RESULT IN ADDITIONAL COSTS VARIOUS RESTRICTIONS APPLY A FEE OF 7~5. 'H~ APPL TES FOF\ CHANGES 1-'I..U~3 ANY FAf'1::: DIFFERENCE IF APPLICABLE. ATTENTION VALUED CUSTOMER- AN ADDITIONAL SERVICE FEE JF 10.~0 PER TICKET WILL BE ADDED TO THIS TRANSACTION T~IS WILL APPEAR AS AN INDIVIDUAL CHARGE ALL TICKETS EXC~ANGED OR REFUN ED ARE SUBJECT TO A 10.00 SERVICE FEE IN ADDITION TO AIRLINE CHARGES PLEASE REVIEW ITINERARY FOR ACCURACY YOUR R~SERVATION COORDINATOR IS HARIHI" THANK YOU FOR CHOOSING BALBOA TRAVEL" PLEASE CALL IF YOU HAVE ANY QUESTIONS AND HAVE A PLEASANT TRIP" HU·. RECONFIRM RETURNING AND CONTINUING RESERVATIONS 72 HOURS IN ADVANCE FOR INTERNATIONAL FLIGHTS AND SUGGEST 48 HOURS IN ADVANCE FOR DOMESTIC FLIGHTS. CAUTION: TICKETS MAY HAVE VALUE. IF UNUSED PLEASE RETURN FOR CREDIT OR REFUND. CST# 2013711·10 A QIoINII Pa........ of Woodside Travel Trust IMPORTANT INFORMATION 1.) Please check your documents when you receive them. Call If you have any questions. 2.) RECONFIR ATIO S: Domestic. We recommend that you reeon firm all flights prior to departure and at each point of sto over This will give the airline the opportunity to keep you advised of any changes which may have occurred in your flight International: You must reconfirm continUing or retu n reservations at least 72 hours pnor to flight time at each pomt of stopover or your reservations will be automatically cancelled. 3.) CHECK-IN: We suggest the following chec In times. Domestic: 1 hour prior to departure International: 2 hours prior to departure. Note: Check-in later than these times could reSult In denied board ing. 4.) OVERBOOKING: Airline flights may be overbooked. A person denied boarding on a flight may be entitled to a compensatory payment. The rules for den'ed boardmg compensation are available at all ticket counters. 5.) CHANGES OR CANCELLATIONS: To change or cancel your fhght itinerary, call this travel agency or the airline you are scheduled to take. If cancelling, return the unused tickets to us for credit or refund Most special, excursion and dIScount tickets have vanous travel restrictions and may have a penalty for change or cancellat on. Be sure you understand these restrictions. If you change your plans nroute, ask the airline to apply the value of your unused ticket toward the purchase of a new ticket. If a refund is due, obtam a receipt from the atrl ne. If you are hold109 guaranteed hotel reserva tions which you may IN sh to cancel, notify the hotel as soon as pOSSible. Deposits and prepayments are subject to cancellation policy. 6.) INSURANCE: Alrhne and other travel suppliers' Insurance for bag gage have limited liability. Your personal insurance may not ad equately cover losses Incurred by cancellation, accident, illness or stolen or damaged property We strongly urge you to purchase additional Insurance offered to you. 7.) LOST TICKETS: Lost, stolen or destroyed tickets must be paid for until refund is obtained form the issuing airhne, subJect to an atrltne Imposed service charge 8.) PREPAID TICKETS: If your travel arrangements involve a request for prepaid airline tickets. picked up by the passenger at an airline ticket counter, please note that most carriers reqUire a mandatory non refundable servIce charge. YOUR RIGHTS AND RESPO SIBILITIES As Ticket Holder, you are responsible for all mformatlon and notices contamed within this document packet including the tickets, folder and Its contents. Balboa Travel Incorporated acts agent for alrlme, cruise, tour, hotel, car rental companies and other suppliers of service as well as Tfckets Holder and our liability is strictly limited In our capaci y as dual agent for both travel suppliers and Ticket Holder, we retain the right and priVilege to charge and collect commrSSlons, service fees, ticketing fees, processing fees andlor other SImilar fees from one or more of these parties, however in no case is our limited liability to Ticket Holder affected by our right to charge and collect these and other fees. WHAT YOU SHOULD KNOW ABOUT THE POSSIBILITY OF AIRLINE BANKRUPTCIES. Hopefully there Will not be any "10re alrhne ban rlJplcleS but t has to be recognized that they might occur You should know how they might affect you 1.) If an airline deelares bankruptcy, It IS not obligated to Garry you or to refund ticket Issued before the banKruptcy 2.) Travel agents are not allowed to refu d tickets on airlines which have declared bankruptcy. Money given to a travel ag nt Immed ately becomes the property of th airlines, and we are required by laws to comply with the airlines' ord rs 3 ) If .an aIrline declares bankruptcy It mIght contmue service, limit ervlce or stop completely Other airlines might accep passengers under t,mlted clrcumstan e or may refuse to accept any pa sen g r from the defaulted carner. 4 ) M anwhile the e are fine travel Insurance plans vailable for pas sengers to protect themselves In ca e of airlln bankruptcle CO SUMER DISCLO U E NOTICE This travel agency IS acting as a mere agent for SUPPLIERS In seiling travel related eNlces, or in accepting reservations or bookings for services that are not directly supplied by ths travel agency (such as a r and ground transportation. hotel accommodation, meals, tours, cruises, etc) ThiS agency therefore, shall not be responsible for breach of contract or any intentional or careless actions or omissions on part of such supphers, which result in any loss. damage, delay, or injury to you or your compMlons or group members. Unles.... the term "guaranteed'" IS speCifically stated in writing on your tickets, invoice, or reservation Itinerary we do not guarantee Clny suc suppliers' rates, bookings reservations, connections, scheduling, or handling of personal effects. Travel agent shall not be lespoll~lble for al y Irljurjp,s damages. or losses caused to any traveler in connection with terrorist activities, social or labor unrest. mechanical or construction failUreS or difficulties, diseases, local laws cliMactiC conditions, abnormal conditions or developments, or any other actions omISSions 0 co dll ons Outside t'le rav I agent s control. Traveler assumes complete and full responsibility for, and hereby releases the agent from any duty of check ng and venfylng any and all passport, visa, vaccination. or other entry requirements of each destlnallon, and all afety and secuqty conditions of such d stlnatlOns dUring he length of the proposed travel. For information concerning possible dangers at Internatlonal dest nations contac, tne Tlav AdVISOry Section of the U S State Department, (202) 647·5225. For medical informatIOn call the U S Center for Dlsea e Contro 404\ 3324559. ByernbarklO upon hls!her travel, the traveler voluntarily assumes all risks involved In such travel, whether expected r unexp cted fnls aQency not r ponslble for cancellatIOn of any services and/or refunds from any supplier or carner that may c ,ase opelatlOn Travel""r I !le, oy VI rnad of h b ve risks as well as pOSSible travel industry bankruptcies and medical and climactic disrupt ons and I dVl$ d to obta n pp opnate Insurance coverage against them. Traveler's retentIon of tickets reservatIOns or bOOKings after Issuance shall constitute a co sent to the above and an agreement on hi !her p rt to convey the contents hereto to his/her travel companions or group n-embers AT&T SHANNON DAY Thursday, Mayl4, - San Diego to Newark LV San Diego AR Newark Avis Car Conf. No. 11689350US1CH 1:00PM 9:05PM United #472 to be upgraded New York Palace Hotel (in 5/14; out 5/17) $295 455 Madison Ave. at 50 th New York, NY Phone: 1-800-NY-PALACE or 212-888-7000; Fax: 212-303-6000 Conf. No.NY524423 Friday, May 15 AT&T Presentation: A constructive Approach for Migration to Wider Band Wireless Services 10:30 Deliver Talk AT&T Labs Newman Springs Lab 100 Schulz Dr. Red Bank Zoran Kostic: 732-345-3130 Sunday, May 17 - Travel to Murray Hill Headquarters Plaza Hotel- $162 (1 night) 3 Headquarters Plaza Conf. No. 231751 Morristown, NJ Tel: 973-898-9100 Fax: 973-292-0112 Monday, May 18 - Shannon Symposium 9:00AM Lucent Technologies Murray Hill Auditorium 700 Mountain Ave. Murray Hill Travel to D.C. via air shuttle from Newark - See attached. 05/05/98 9:09 AM ...... Arlington Hilton (in 5/18; Out 5/20) (Debbie reserved) Hotel ($139.00 plus tax, gov't. Rate) 950 N. Stafford St. Arlington, VA 22203 Phone: 703-528-6000; Fax: 703-528-4386 (Identification reference: Group Block G 8028) Confirmation No. 59282 Tuesday, May 19 Committee Meeting 5/18 Subcommittee mtg.; 5/19 full Committee mtg. National Science Foundation 4201 Wilson Blvd. Room 1235 Arlington, Virginia. Wednesday, May 19 - Dulles to San Diego LV Dulles 5:20PM AR San Diego 7:27PM United #215 05/05/98 9:09 AM REQUESTED TRAVEL ARRANGEMENTS ... .To :sDEBO~II ~ASHER Fro.: Harini narasiMhanl Sent from: Voice Number: FAX Number: 85/84/90 18:81:15 882 Harini Narasimhan 619-678-3424 619-678-3769 Note: Airlines can change fares or cancel un-ticketed reservations. To guarantee a fare, you must purchase the ticket. Deborah, Here is a current itinerary of the trip. Please call me if you have any questions. Best regards, Harini SALES PERSON: 04 CUSTOMER NBR: QC1QUALCOl TO: ATTN DEBORAH CASHER ANDREW VITERBI QUALCOMM INC *Q FOR: VITERBI/ANDREW ITINERARY TTFBBE DELIVER 6 APR 2P DATE: 04 MAY 98 PAGE: 01 14 MAY 98 THURSDAY AIR UNITED AIRLINES FLT:472 ECONOMY MULTI MEALS LV SAN DIEGO lOOP EQP: AIRBUS A320 DEPART: TERMINAL 1 AR NEWARK 905P NON-STOP ARRIVE: TERMINAL A VITERBI!ANDREW SEAT- 6C UA-00086195755 CAR NEWARK AVIS RENT A CAR CORP ID-B555600 PICK UP-2105 I-FULL SZ AUTO AC RETURN-18MAY!8P ID-FG320H RATE IS GUARANTEED DAILY RATE-USD46.99 UNLIMITED MILEAGE EXTRA DAY-69.99 UNLIMITED MILEAGE EXTRA HOUR-15.67 UNLIMITED MILEAGE CONFIRMATION NUMBER 11689350US1CH HOTEL NEW YORK CITY OUT-17MAY LEADING HOTELS 3 NIGHTS THE NEW YORK PALACE 1 ROOM CIKALL 02CR 455 MADISON AVENUE RATE-295.00USD PER NIGHT NEW YORK NY 10022 CANCEL 02 DAYS PRIOR TO ARRIVAL FONE 212-888-7000 FAX 212-303-6000 GUARANTEED LATE ARRIVAL CONFIRMATION NY524423 REQUEST NON SMOKING ROOM WITH KING BED PLEASE , ,to: DEBORAH CASHER 85/84/90 18:81:40 883 17 MAY 98 SUNDAY HOTEL NEWARK LH HEADQUARTERS PLAZA THREE HEADQUARTERS MORRISTOWN NJ 07960 FONE 973-898-9100 CONFIRMATION 231751 TO AVOID NO-SHOW CHARGES, CANCEL L R I 1 NIGHT OUT-ISMAY 1 ROOM SINGLE WITH BATH RATE-162.00 PER NIGHT GUARANTEED LATE ARRIVAL HOTEL 24 HRS PRIOR 19 MAY 98 TUESDAY AIR UNITED AIRLINES FLT:215 LV WASHINGTON DULLES AR SAN DIEGO ARRIVE: TERMINAL 1 VITERBI!ANDREW SEAT-12C 17 AUG 98 MONDAY OTHER SAN DIEGO BALBOA RESERVATION PROTECTION ECONOMY 520P 727P UA-00086195755 MULTI MEALS EQP: BOEING 757 NON-STOP DURING BUSINESS HOURS 619-678-3760 OR 888-784-0772 FOR AFTER HOURS EMERGENCIES, CALL 800-359-8773 THANK YOU FOR CHOOSING BALBOA TRAVEL ID-CODE-U4E4-QUAL DUE TO INCREASED SECURITY, A PHOTO I.D. IS REQUIRED. THIS TICKET IS NON - REF UNO A B L E AND NON - T RAN S FER A B L E **ANY** CHANGES WILL RESULT IN ADDITIONAL COSTS VARIOUS RESTRICTIONS APPLY A FEE OF 75.00 APPLIES FOR CHANGES PLUS ANY FARE DIFFERENCE IF APPLICABLE. PLEASE REVIEW ITINERARY FOR ACCURACY YOUR RESERVATION COORDINATOR IS HARINI. THANK YOU FOR CHOOSING BALBOA TRAVEL. PLEASE CALL IF YOU HAVE ANY QUESTIONS AND HAVE A PLEASANT TRIP. Janice Medina, 03:20 PM 5/5/98 ., AT&T Mtg 5.19.98 X-Sender: jmedina@mage.qualcomm.com X-Mailer: QUALCOMM Windows Eudora Pro Version 3.0.3 (32) Date: Tue, 05 May 1998 15:20:11 -0700 To: "Casher, Debbie" <dcasher> From: Janice Medina <jmedina> Subject: AT&T Mtg 5.19.98 Cc: jmedina Debbie, what follows is the information I have at this time regarding the AT&T meeting on Tues, May 19. Idon't know yet who from QC is attending besides Doug and Dr. Viterbi. Mr. Lewis Chakrin Vice President Bus Dev/Corporate Strategy Room 336101 295 North Maple Avenue Basking Ridge NJ 07920 ph 908-221-8800 fax 908-204-1727 Asst: Polly Below is the flight information I have selected for Doug, pending his concurrence. Townecar upon arrival to hotel. Hotel: AT&T Learning Center 300 N. Maple Avenue breakfast/lunch, etc. - rates inclusive 18 MAY98 - MONDAY AIR UNITED AIRLINES LV SAN DIEGO AR NEWARK ARRIVE: TERMINAL A 19 MAY98 - TUESDAY FLT:472 ECONOMY LUNCH 100P EQP: AIRBUS A320 905P NON-STOP Printed for Deborah Casher <dcasher@qualcomm.com> 1 Janice Medina, 03:20 PM 5/5/98 ., AT&T Mtg 5.19.98 AIR UNITED AIRLINES LV NEWARK ARDENVER AIR UNITED AIRLINES LV DENVER ARSAN DIEGO ARRIVE: TERMINAL 1 FLT:793 515P 724P FLT:1567 830P 943P ECONOMY DINNER EQP: BOEING 757 NON-STOP ECONOMY EQP: BOEING 757 NON-STOP Printed for Deborah Casher <dcasher@qualcomm.com> 2 To: DEBORAH CASHER Fro.: Harini ftarasi.hanl 85/15/90 18:83:89 884 SALES PERSON: 04 CUSTOMER NBR: P06QUALL01 ITINERARY TNXPCZ DATE: 15 MAY 98 PAGE: 01 TO: ATTN DEBORAH CASHER ERNA VITERBI QUALCOMM INC *Q FOR: VITERBI/ERNA DELIVER 6 APR 2P 20 MAY 98 WEDNESDAY AIR UNITED AIRLINES FLT:215 ECONOMY LV WASHINGTON DULLES 520P AR SAN DIEGO 727P ARRIVE: TERMINAL 1 VITERBI/ERNA SEAT- 10 UA-00639825973 UPGRADED SEAT ID 17 AUG 98 MONDAY OTHER SAN DIEGO BALBOA RESERVATION PROTECTION DURING BUSINESS HOURS 619-678-3760 OR 888-784-0772 FOR AFTER HOURS EMERGENCIES, CALL 800-359-8773 THANK YOU FOR CHOOSING BALBOA TRAVEL ID-CODE-U4E4-QUAL DUE TO INCREASED SECURITY, A PHOTO 1.0. IS REQUIRED. THIS TICKET IS NON - REF UNO A B L E AND NON - T RAN S FER A B L E **ANY** CHANGES WILL RESULT IN ADDITIONAL COSTS VARIOUS RESTRICTIONS APPLY A FEE OF 75.00 APPLIES FOR CHANGES PLUS ANY FARE DIFFERENCE IF APPLICABLE. ATTENTION VALUED CUSTOMER- AN ADDITIONAL SERVICE FEE OF 10.00 PER TICKET WILL BE ADDED TO THIS TRANSACTION THIS WILL APPEAR AS AN INDIVIDUAL CHARGE ALL TICKETS EXCHANGED OR REFUNDED ARE SUBJECT TO A 10.00 SERVICE FEE IN ADDITION TO AIRLINE CHARGES PLEASE REVIEW ITINERARY FOR ACCURACY YOUR RESERVATION COORDINATOR IS HARINI. THANK YOU FOR CHOOSING BALBOA TRAVEL. PLEASE CALL IF YOU HAVE ANY QUESTIONS AND HAVE A PLEASANT TRIP. END OF SCROLL DINNER EQP: BOEING 757 05HR 0 MIN NON-STOP OA PNR: PBJK2E Mary Quihuis, 11 :04 AM 5/5/98 -, Re: ATT - Calls Back X-Sender: mquihuis@maiI1.qualcomm.com X-Mailer: Windows Eudora Pro Version 3.0 (32) Date: Tue, 05 May 1998 11 :04:30 -0700 To:dcasher From: Mary Quihuis <mquihuis> Subject: Re: ATT - Calls Back Cc: jmajor, jmedina, dough Debbie, This is the only thing I have regarding an ATT meeting with Dr. Viterbi. Janice Median sent it to me. Per John's email to me this morning, he said he would not be attending the ATT meeting. If there1s another meeting that Dr. Viterbi wants John to attend, please let me know. Otherwise, I'll have to assume that it's the ATT meeting which John has already said he would not be attending, as much as he'd like to help Thank you, ladies. »» X-Sender: jmedina@mage.qualcomm.com Date: Mon, 04 May 1998 12:08:40 -0700 To: Mary Quihuis <mquihuis> From: Janice Medina <jmedina> Subject: Re: ATT - Calls Back Ihave requested a room for John the eve of May 18 at AT&T Learning Center, assuming when Doug returns he confirms they want to stay there. Ihave also requested flights. More later. At 10:11 AM 5/4/98 -0700, you wrote: > >1 spoke to Doug1s assistant regarding this meeting. As soon as she has all >the details, she will call me back. Right now the meeting is set up for >Monday, May 19 beginning at 8:30 a.m. and running until 4:00 or 4:30. So, >you'll be flying out Monday, May 18, and returning Tuesday, May 19 on a 6 >or 7 p.m. flight back to SO. I'm assuming you both want to fly together, >so Janice is going to get flight information also, and get back to me so >that Ican book it the same way. Iasked her where you'd be staying and >she said that she has a rooms on hold with the AT&T Learning Center. She's Printed for Deborah Casher <dcasher@qualcomm.com> 1 Mary Quihuis, 11 :04 AM 5/5/98 ., Re: ATT • Calls Back >holding one for you unless you prefer to stay someplace else. Doug is >staying at the learning center. I donlt know anything about this place, >but I will check with Harini to see if she's heard about it. 1 1 11 keep you >posted on arrangements. > >Just for your information, you do have the CCl Alumni dinner that evening >starting at 6:30. ~IS the one Michelle Fleck has invited you to which is >being held at the Center for Creative leadership. Iguess I should tell >her that you won't be attending. > > >At 01 :01 AM 5/4/98 -0700, you wrote: »>To: Doug Hutcheson <dough>, Andrew Viterbi <viterbi>, Doug Hutcheson »<dough>, jmajor, dales, aviterbi, hwhite, ijacobs, tthomley, »saltman, tbernard »>From: John Major <jmajor@qualcomm.com> »>Subject: Re: ATT - Calls Back »>Cc: williamsjp@earthlink.net, jdavis@geopartners.com (John Davis), Ibrittain »>In-Reply-To: <3.0.3.32.199804301 03523.007014bO@fantasia.qualcomm.com> »>References: <3.0.3.32.19980428151935.00bede18@adept.qualcomm.com> »<3.0.3.32.199804281431 06.006f5cfc@fantasia.qualcomm.com> »> »>With all you've done to make this happen, a few misspellings are just fine. »> »>1 1 11 be able to come along for the meeting. When you have a chance, let's »talk logistics. »> »> »> »> »> »>At 10:35 AM 4/30/98 -0700, Doug Hutcheson wrote: »»1 promise to never mis-spell lewis name again. John Davis also pointed this »»out. The meeting has been set for the 19 May. Janice Medina (x13574) will »»have the details. 1 1 11 be out of the office until 11 May and will arrange a »»discussion early that week (janice?). »» »» Thanks for your support and I will follow up shortly. »» »»Doug »» »»At 03:19 PM 4/28/98 -0700, Andrew Viterbi wrote: »»>ounds promising. Printed for Deborah Casher <dcasher@qualcomm.com> 2 Mary Quihuis, 11 :04 AM 5/5/98 -, Re: ATT - Calls Back »»> »»>At 02:31 PM 4/28/98 -0700, Doug Hutcheson wrote: »»»1 talked today a length with Lou Chachren »»> »»> »»>it's Lewis Chakrin »»> »»>at ATT about the PCPhone. The »»»idea has been now run up through M. Armstrong and we have a go ahead to »»»develop the concept the next round. Lou has ask that we bring a small >team »»»to meet with his team in Basking Ridge on the week of 18 May. »»> »»>By coincidence I'll be in NJ on 5/18--speaking at Bell Labs (for the »»>Shannon semi-centennial) and at ATT labs on 5/15, speaking on next »»>gereration COMA. »»>I'm supposed to be in Washington on 5/19, but I could spend a few hours at »»>baskin Ridge that morning. »»> »»> »»>Andy »»> »»> The purpose »»»of this meeting will be develop a cross - elastic offer that will target »»»PCPhone at the local loop and minimize the cannalibization of the ATT »»»Wireless offer. Wwe go back to the Zeglis meeting this facilitates the »»»ubiquitous offer that he was discussing. They would like to make this »»»effort somewhat cooperative by bring the experiences they have gained in »»»their other local loop efforts to bear on these discussions. »»» »»»At this point internal knowledge has been limited to ATT Corporate and »they »»»have not discussed this with Kirkland. tt is not clear to me how much Lou »»»was covering up his poor phone practices but he did state that we have »»»caused a lot of intensive internal discussions inside ATT. Iraise this »»»because we may have a more active ATT then we expected. »»» »»» They expect that these discussions are sometime away. I will provide more »»»info in the near future. »»» »»» »»> »»> Printed for Deborah Casher <dcasher@qualcomm.com> 3 Mary Quihuis, 11 :04 AM 5/5/98 -, Re: ATT - Calls Back »» »» » » > > Janice Medina Executive Secretary QUALCOMM 619.651.3574 619.651.5336 fax email: jmedina@qualcomm.com Bldg. /-215/ «« Printed for Deborah Casher <dcasher@qualcomm.com> 4 To: DEBORAH CASHER Fron: Harini Harasinhanl 85/84/98 89:33:29 882 REQUESTED TRAVEL ARRANGEMENTS Sent from: Voice Number: FAX Number: Harini Narasimhan 619-678-3424 619-678-3769 Note .. Airlines can change fares or cancel un-ticketed reservations. To guarantee a fare, you must purchase the ticket. Deborah, Here is a current itinerary of the trip. Please call me if you have any questions. Best regards, Harini SALES PERSON: 04 CUSTOMER NBR: QC1QUALC01 ITINERARY TTFBBE DATE: 04 MAY 98 PAGE: 01 TO: ATTN DEBORAH CASHER ANDREW VITERBI QUALCOMM INC *Q DELIVER 6 APR 2P FOR: VITERBI/ANDREW DRP CHG-.OO NON-STOP LUNCH EQP: AIRBUS A320 .30 PER MI/KM CORP ID-B555600 ECONOMY lOOP 905P KING BED PLEASE o FREE MI/KM o FREE MI/KM o FREE MI/KM 090 a2 <1 ,?IIS 2Q:h OUT..:'17MAY 3 NIGHTS 1 ROOM C1KALL 02C RATE-295.00USD PER NIGHT CANCEL 02 DAYS PRIOR TO ARRIVAL FLT:472 A SEAT- 6C UA-00086195755 AVIS RENT A CAR 1-FULL S2 AUTO AC TO-WASHINGTON DULLES " ID-FG320H 14 MAY 98 THURSDAY AIR UNITED AIRLINES LV SAN DIEGO DEPART: TERMINAL 1 AR NEWARK ARRIVE: TERMINAL VITERBI/ANDREW CAR NEWARK PICK UP-2105 \~ RETURN-~Y/1720 RATE IS GUARANTEED DAILY RATE-USD54.00 EXTRA DAY-54. QO \t.\\~ EXTRA HOUR-18.01 CONFIRMATION NUMBER HOTEL NEW YORK CITY LEADING HOTELS THE NEW YORK PALACE 455 MADISON AVENUE NEW YORK NY 10022 FONE 212-888-7000 FAX 212-303-6000 GUARANTEED LATE ARRIVAL CONFIRMATION NY524423 REQUEST NON SMOKING ROOM WITH To: DEBORAH CASHER Fron: Harini ftarasinhanl 85/84/98 89:34:83 883 17 MAY 98 SUNDAY HOTEL NEWARK LH HEADQUARTERS PLAZA THREE HEADQUARTERS MORRISTOWN NJ 07960 FONE 973-898-9100 CONFIRMATION 231751 TO AVOID NO-SHOW CHARGES, CANCEL L R I 1 NIGHT OUT-18MAY 1 ROOM SINGLE WITH BATH RATE-162.00 PER NIGHT GUARANTEED LATE ARRIVAL HOTEL 24 HRS PRIOR 19 MAY 98 TUESDAY AIR UNITED AIRLINES FLT:215 LV WASHINGTON DULLES AR SAN DIEGO ARRIVE: TERMINAL 1 VITERBI!ANDREW SEAT-12C 17 AUG 98 MONDAY OTHER SAN DIEGO BALBOA RESERVATION PROTECTION ECONOMY 520P 727P UA-00086195755 DINNER EQP: BOEING 757 NON-STOP DURING BUSINESS HOURS 619-678-3760 OR 888-784-0772 FOR AFTER HOURS EMERGENCIES, CALL 800-359-8773 THANK YOU FOR CHOOSING BALBOA TRAVEL ID-CODE-U4E4-QUAL DUE TO INCREASED SECURITY, A PHOTO I.D. IS REQUIRED. THIS TICKET IS NON - REF U N DAB L E AND NON - T RAN S FER A B L E **ANY** CHANGES WILL RESULT IN ADDITIONAL COSTS VARIOUS RESTRICTIONS APPLY A FEE OF 75.00 APPLIES FOR CHANGES PLUS ANY FARE DIFFERENCE IF APPLICABLE. PLEASE REVIEW ITINERARY FOR ACCURACY YOUR RESERVATION COORDINATOR IS HARINI. THANK YOU FOR CHOOSING BALBOA TRAVEL. PLEASE CALL IF YOU HAVE ANY QUESTIONS AND HAVE A PLEASANT TRIP. Shannon Day Program http://cm.bell-labs.com/cm/ms/wbatlshannonday/program.ht Preliminary Program for Shannon Day May 18th, 1998 Arnold Auditorium, Bell Laboratories, Murray Hill, NJ 8:15 Registration and Coffee 9:00 Welcome by Arun Netravali, vice president, Bell Labs 9:20 Jacob Ziv, Technion Entropy Has Many Faces 9:50 Robert Gallager, MIT To Be Announced 10:20 Break 10:40 Jack Wolf, UCSD Shannon Theory and the Magnetic Recording Channel 11:10 David Forney, Motorola Euclidean Space Coding 11:40 Neil Sloane,AT&T Labs Packing Spheres in N-dimensions 12:10 Lunch 2:00 Toby Berger, Cornell; Jack Wolf, UCSD; Jacob Ziv, Technion Remembering Aaron Wyner 2:30 James Massey, ETH Shannon Theory and Contemporary Cryptology 3:00 Emre Telatar, Bell Labs Current Topics in Information Theory at Bell Labs 3:30 Break 3:50 Andrew Viterbi, Qualcomm Shannon Theory and Turbo Decoding 4:20 Thomas Cover, Stanford University Shannon Theory and Investing 4:50 Robert Lucky, Bellcore To Be Announced 1 of 1 Register for Shannon Day. 4/29/98 1:35 PN To: DEBORAH CASHER Fron: Hdrini ftdrd~ i~hdn' 84/13/9B 17:43:14 882 REQU STED TRAVEL ARRANGEMENTS ~Travel DMI __ Sent from: Voice Nu ber: FAX Num er: Harini Narasimhan 619-678-3424 619-678-3769 Note: Airlines can change fares or cancel un-ticketed re ervations. To guarantee a fare, you must purchase the ticket. Deborah, Best regards, Here is a current itinerary of the t.:·ip. DATE: 13 APR 98 PAGE: 01 TTFBBE DELIVER 6 APR 2P ITI lERARY TO: ATTN DEBORAH CASHER ANDREW VITERBI QUALCOMM INC *Q FOR: VITERBI/ANDREW Please call me if you have any questions. Harini SALES PERSON: 04 CUSTOMER NBR: QCIQUALCOl NON-STOP DRP CHG-.OO LUNCH EQP: AIRBUS A320 .30 PER MI/KM CORP ID-B555600 ECONOMY lOOP 905P KING BED PLEASE o FHEE MI/KM o FP.EE MI/KM o FLEE MI/KM 090CJ2219US2CH OUT-17MAY 3 NIGHTS 1 ROOM C1KALL 02C RATE-295.00USD PER NIGHT CANCEL 02 DAYS PRIOR TO ARRIVAL FLT:472 A SEAT- 6C UA-00086195755 AVIS RENT A CAR 1-F['LL S2 AUTO AC TO-1:ASHINGTON DULLES ID-}'G320H RETURN-19MAY/1720 RATE IS GUARANTEED DAILY RATE-USD54.00 EXTRA DAY-54.00 EXTRA HOUR-18.01 CONFIRMATION NUMBER NEW YORK CITY LEADING HOTELS THE NEW YORK PALACE 455 MADISON AVENUE NEW YORK NY 10022 FONE 212-888-7000 FAX 212-303-6000 GUARANTEED LATE ARRIVAL CONFIRMATION NY524423 REQUEST NON SMOKING ROOM WITH 98 THURSDAY UNITED AIRLINES LV SAN DIEGO DEPART: EAST TERMINAL AR NEWARK ARRIVE: TERMINAL VITERBI/ANDREW NEWARK PICK UP-2105 HOTEL CAR 14 MAY AIR To: DEBORAH CASHER " 'II •• FrOM: Harini nara i~hanl 84/13/90 17:43:40 883 17 MAY 98 SUNDAY HOTEL NEWARK LH HEADQUARTERS PLAZA THREE HEADQUARTERS MORRISTOWN NJ 07960 FONE 973-898-9100 CONFIRMATION 231751 TO AVOID NO-SHOW CHARGES,CAtlCEL L R I 1 NIGHT OUT-ISMAY 1 ROOM SINGLE WITH BATH RATE-162.00 PER NIGHT GUARANTEED LATE ARRIVAL HOTEL 24 HRS PRIOR 17 MAY 98 SUNDAY HOTEL NEWARK L R I GOVERNOR MO IS INN 2 WHIPPANY D MORRISTOWN NJ 07960 FONE 973 39-7300 FAX 9 -984-1036 GUA TEED LATE ARRIVAL CONFIRMATION 85131335 REQUEST NON SMOKING ROOM WP.'H OUT-18MAY 1 NIGHT 1 ROOM SUPERIOR 1 KING BED RATE-I04.00USD PER NIGHT CANCEL 24 HOURS PRIOR TO ARRIVAL WEEKEND RATE KING BED PLEASE 19 MAY 98 TUESDAY AIR UNITED AIRLINES FLT: 21=, LV WASHINGTON DULLES AR SAN DIEGO ARRIVE: EAST TERMINAL VITERBI/ANDREW SEAT-12C ECONOMY 520P 727P UA-00086195755 DINNER EQP: BOEING 757 NON-STOP 17 AUG 98 MONDAY OTHER SAN DIEGO BALBOA RESERVATION PROTECTH.lN DURING BUSINESS HOURS 619-678-3760 C'R 888-784-0772 FOR AFTER HOURS EMERGENCIES, CALL 8ClO-359-8773 THANK YOU FOR CHOOSING BALBOA TRAVEl, ID-CODE-U4E4-QUAL DUE TO INCREASED SECURITY, A PHOTO I.D. IS REQUIRED. THIS TICKET IS NON - REF U N DAB L E AND NON - T RAN S FER A B L E **ANY** CHANGES WILL RESULT IN ADDITIONAL COSTS VARIOUS RESTRICTIONS APPLY A FEE OF 75.00 APPLIES FOR CHAJ'fGES PLUS ANY FARE DIFFERENCE IF APPLICABLE. PLEASE REVIEW ITINERARY FOR ACCURACY YOUR RESERVATION COORDINATOR IS HARH'iI. THANK YOU FOR CHOOSING BALBOA TRAVEL. PLEASE CALL IF YOU HAVE ANY QUESTIONS AND HAVE A PLEASANT TRIP. Jack Keil Wo1f, 09:19 AM 4/13/98 , Re: S annon Day X-Sender: ir629@sdcc3.ucsd.edu ·Date: Mon, 13 Apr 1998 09:19:42 -OBOO To: viterbi From: jwolf@ucsd.edu (Jack Keil Wolf) Subject: Re: Shannon Day Andy, The following was received from Emre regarding Sha·non Day. The most important news is the 30 minute duration of the presentations (which we guessed. ) Jack >Sender: telatar@research.bell-labs.com >Date: Fri, 10 Apr 1998 18:52:19 -0400 >From: Emre Telatar <telatar@research.bell-labs.coI > >Organization: Lucent ! Bell Labs, USA >MlME-Version: 1.0 >To: Jack Keil Wolf <jwolf@ucsd.edu> >SUbject: Re: Shannon Day >Status: RO > >Dear Professor Wolf, > >1 mn very sorry for my late response. The presentation >order has not been settled yet, but it is more or less >certain that the presentation length will be 30 minutes. >We will st~rt at gam and go until late afternoon. > >1f you do have a preference for a particular time you >would like to speak, do tell me, and I'll do my h.st to >accomodate. > >Thank you very much for inviting me to brunch on >Sunday. I would very much like to come, but I suspect >there might be last minute emergencies that will demand >my attention. I'll accept the invitation if you would >understand if I have to back out later. > >May I call you next week to arrange logistics for your >trip? > >Very best regards, > >Emre *****************************************************************.* II I" .. Jack Keil Wolf • CMRR-0401 * University of California, San Diego * 9500 Gilman Drive • La Jolla, CA 92093-0401 * * * * • * * flo. ..... ".' .. h * phone: (619) 534 6218 * * fax: (619) 534 2720 * * email: jwolf@ucsd.edu * .. Web page: http://cmrr-wolf04.ucsd.edu/wolf2 .. ****************************************************************••• Printed for Andrew Viterbi <viterbi@qualc mm.com> 1 Fro... : Flodterl B4/B9/98 12:1B:B9 BB1 IIJ lIt II REQUESTED TRAVEL ARRANGEMENTS Sent from: Sarah Durdin Voice Number:678-3414 FAX Number: 678-3599 Note: Airlines can change fares or cancel un-ticketed reservations. To guarantee a fare, you must purchase the ticket. SALES PERSON: 04 CUSTOMER NBR: QC1QUALC01 TO: ATTN DEBORAH CASHER ANDREW VITERBI QUALCOMM INC *Q ITINERARY TTFBBE DELIVER 6 APR 2P DATE: 09 APR 98 PAGE: 01 FOR: VITERBI/ANDREW NON-STOP LUNCH EQP: AIRBUS A320 .30 PER MI/KM DRP CHG-.OO CORP ID-B555600 ECONOMY lOOP 905P KING BED PLEASE o FREE MI/KM o FREE MI/KM o FREE MI/KM 09002219US2CH OUT-17MAY 3 NIGHTS 1 ROOM CIKALL 02C RATE-295.00USD PER NIGHT CANCEL 02 DAYS PRIOR TO ARRIVAL FLT: 472 A SEAT- 6C UA-00086195755 AVIS RENT A CAR I-FULL SZ AUTO AC TO-WASHINGTON DULLES ID-FG320H RETURN-19MAY/1720 RATE IS GUARANTEED DAILY RATE-USD54.00 EXTRA DAY-54.00 EXTRA HOUR-18.01 CONFIRMATION NUMBER NEW YORK CITY LEADING HOTELS THE NEW YORK PALACE 455 MADISON AVENUE NEW YORK NY 10022 FONE 212-888-7000 FAX 212-303-6000 GUARANTEED LATE ARRIVAL CONFIRMATION NY524423 REQUEST NON SMOKING ROOM WITH 98 THURSDAY UNITED AIRLINES LV SAN DIEGO DEPART: EAST TERMINAL AR NEWARK ARRIVE: TERMINAL VITERBI/ANDREW NEWARK PICK UP-2105 HOTEL CAR 14 MAY AIR 19 MAY 98 TUESDAY AIR UNITED AIRLINES FLT:215 LV WASHINGTON DULLES AR SAN DIEGO ARRIVE: EAST TERMINAL VITERBI/ANDREW SEAT-12C ECONOMY 520P 727P UA-00086195755 DINNER EQP: BOEING 757 NON-STOP 17 AUG 98 MONDAY OTHER SAN DIEGO BALBOA RESERVATION PROTECTION Fro... : Floater' 84/89/98 12:18:43 882 SALES PERSON: 04 CUSTOMER NBR: QCIQUALC01 CONTINUED ON PAGE 2 ITINERARY TTFBBE DATE: 09 APR 98 PAGE: 02 TO: ATTN DEBORAH CASHER ANDREW VITERBI QUALCOMM INC *Q FOR: VITERBI/ANDREW DELIVER 6 APR 2P DURING BUSINESS HOURS 619-678-3760 OR 888-784-0772 FOR AFTER HOURS EMERGENCIES, CALL 800-359-8773 THANK YOU FOR CHOOSING BALBOA TRAVEL ID-CODE-U4E4-QUAL DUE TO INCREASED SECURITY, A PHOTO I.D. IS REQUIRED. THIS TICKET IS NON - REF U N DAB L E AND NON - T RAN S FER A B L E **ANY** CHANGES WILL RESULT IN ADDITIONAL COSTS VARIOUS RESTRICTIONS APPLY A FEE OF 75.00 APPLIES FOR CHANGES PLUS ANY FARE DIFFERENCE IF APPLICABLE. PLEASE REVIEW ITINERARY FOR ACCURACY YOUR RESERVATION COORDINATOR IS HARINI. THANK YOU FOR CHOOSING BALBOA TRAVEL. PLEASE CALL IF YOU HAVE ANY QUESTIONS AND HAVE A PLEASANT TRIP. Zoran Kostic, 01 :56 PM 4n/98 ., Re: Viterbi/Hotels From: Zoran Kostic <kostic@research.att.com> Date: Tue, 7 Apr 1998 13:56:25 -0400 (EDT) To:dcasher Subject: Re: Viterbi/Hotels Cc: kostic @research.att.com Hello, Newark is 50 minutes away from us and Ithink that it would be better if Dr. Viterbi stays in one of the following: * Courtyard by Marriot (accross our facility-strongly suggested) 245 Half Mile Road Red Bank, NJ 07701 732-530-5552 * Oyster Point Red Bank 732-530-8200 * Molly Pitcher Inn Red Bank 732-747-2500 Thanks, Zoran Kostic 732-345-3130 > From dcasher@qualcomm.com Mon Apr 6 16:23 EDT 1998 > X-Sender: dcasher@apprentice.qualcomm.com > X-Mailer: QUALCOMM Windows Eudora Pro Version 4.0 > Date: Mon, 06 Apr 1998 13:21 :06 -0700 > To: kostic@research.att.com > From: Deborah Casher <dcasher@qualcomm.com> > Subject: Viterbi/Hotels > Mime-Version: 1.0 > Content-Type> : > textlhtml> ; > charset=lIus-asciill> > Content-Length: 292 > > <html>1 am arranging Dr. Viterbi's travel and would like to know which area > hotels are recommended. Our travel agency has provided us with the Printed for Deborah Casher <dcasher@qualcomm.com> 1 Zoran Kostic, 01 :56 PM 4n/98 -, Re: Viterbi/Hotels > Hotel Newark, Courtyard by Marriott facility. > <BR> > > <font face="Brush Script Mr' size=6 color="#OOOOFF'><i>Debbie<br> ><br> > <lfont><li><lhtml> > > Printed for Deborah Casher <dcasher@qualcomm.com> 2 B L B o SALES PEF.:SON: 04 CUSTOMER NBR: P06QUALL01 TO: ATTN DEBORAH CASHER EI:::NA VITEF,B I QUALCDriri INC *0 FOR: VITERBI/ERNA OUR MISSION AT BALBOA TRAVEL is to help our business clients achieve their objectives and to fulfill the travel dream of our leisure clients IT INERAF~Y TNXPCZ DEL IVEF~ 6 APF: 2P DATE: e6 APE: 9 PAGE: 01 lA· MAY AIR :1.9 ,"HllY AIR 98 THURSDAY UNITED AIRLINES FLT:472 LV BAN DIEGO DEPART: EAST TERMINAL At, NElAJARK ARRIVE: TERMINAL A VITERBI/ERNA SEAT-13F 98 TUESDAY UNITED AIRLINES FLT:215 LV WASHINGTON DULLES (.lR S(.,N DIEGO ARRIVE: EAST TERMINAL VITERBI/ERNA SEAT-19F ECONOMY 100P 905P ECONOMY 520P 73:3P UA-·006:i98259") 3 LUNCH [(at=': A II~E(US A:320 NON-·STOP DINNEr, E(~P: BOE ING ']5'1 NON-STOP 17 AUG 98 MONDAY OTHER S(.,N DIEGO BALBOA RESERVATION PROTECTION RECONFIRM RETURNING AND CONTINUING RESERVATIONS 72 HOURS IN ADVANCE FOR INTERNATIONAL FLIGHTS AND CAUTION: TICKE~~~~~~:~~ ~~~~ :~ ~~~~~~Ep~~:S~O~E~~T~~ ~~~~:E~~t~1F:JJ~~ U EDON PAGE .. CST# 2013711-10 IMPORTANT INFORMATION li restrictions and may have a penalty for change or cancellation. Be sure you understand these restrictions. If you change your plans enroute, ask the airline to apply the value of your unused ticket toward the purchase of a new ticket. If a refund IS due, obtain a receipt from the airline. If you are holding guaranteed hotel reserva~ tions which you may wish to cancel, notify the hotel as soon as possible. Deposits and prepayments are sUbject to cancellation policy. ~ .. 8.) PREPAID TICKETS: If your travel arra~gem~Clts involve a re~uest for prepaid airline tickets. picked up by the passenger at an airline ticket counter, please note that most carriers require a mandatory non-refundable service charge. 6.} INSURANCE: Airline and other-.travel suppliers' ihslJ'rimce for bag~ gage have limited liability. Your personal insurance may not ad· equately cover IQ~ses incurred.bY5.anGella~iD~.accjdent, illness or stolen or damagea property. We .str9rgly ~rge you to purchase additional insurance offered to you. 1 'j • I ,,' J '.'... 7.) LOST TICKETS: Lost, stolen or destroyed tickets must be paid for until refund IS obtained form the issuing airline, subject to an airline imposed service charge. 4.) OVERBOOKING: Airline flights may be overbooked. A person denied boarding on a flight may be entitled to a compensatory payment. The rUles for denIed boarding compensation are available at all ticket counters. 5.) CHANGES OR CANCELLATIONS; To change or cancel your fhght itinerary, cart this travel agency or the airline you are scheduled to take. If cancelling, return the unused tickets to us for credIt or refund. Most special, excursion, and discount tickets have vanous travel 2.) RECONFIRMATIONS: Domestic: We recommend that you recon~ firm all flights prior to departure and at each point of stopover. This will give the airline the opportunity to keep you adVIsed of any changes which may have occurred in your flight. International: You, must reconfirm continuing or return reserv~tiQns .at le~t 72 ~Qurs prior to flight time at each point of stopover or ybur reservations will be automatically cancelleo. 3.) CHECK*IN: We suggest the folloWIflQ ch~ck*in times. Do~estA 1 hour prior to departure. International: 2 hours prior to departure. Note: Check~in later than these times could result In demed board~ ing. 1.) Please check your documents when you receive them. Call if you have any questions. I. ' YOUR RIGHTS AND RESPONSIBILITIES As Ticket Holder, you are responsible for all information and notices contained within this'documeAt ~acket including :t1.~' fibkels, folder and its 'contents. Balboa Travel h)corpoJ!at~d acts agent for airline, cruise, (aUf, hotel, car rental companies and other suppliers of :services as well as TiCkets Holder and our liability js striCtly limited. In our capacity as dual agent for both travel suppliers and Tic~~t. HokJer, we retain.the {\GRt and privilege to charge and collect commiSSions. s~rvice fees. tick£lti{lgfees, processjng fees and/or other~~imilar fees from o,n~'or more of lhe$e.p~rties, however in no case is our limited liability to Ticket HolGet affecte(j by oUf i'lght to charge and collect these and other feeS. ' . ~, •. .. ( 'I WHAT YOU SROULD KNOW ABOU1='THE POS8fBlLrrv OF AIRLINE BANK~l!JPTeIES:'~ Hopefull}hhere win not be any mdre ail hne bankruptCies. but It'1~S. to be recognized that they might &our. vb'J should know how they might affect you. 1.) If an airline declares bankruptcy,l;t is not obligated to carry Ybu'~r to refund tickets issued before the bankruptcy. .; J t 2 ) Travel agents are not allowed to refund tickets on airlines which have declared bankruptcy. Money gIven tC' a travel agent H'l)mediately becomes the property of thr <l rline" 8nd we are required by laws to comply with the airlines' orders. CONSUMER DISCLOSURE NOTICE This travel agency b acting as a rrGre aqent for SLJPPb.lERS In selling travel-related services, or in accepting reservations or bookings for services that are not directly suppl,ed by ttl S t avel ageflcy (such as • .m and ground transportation, hotel accommodations. meals, tours, crUises, etc,) This agency therefore, shali not be respol1~lble for brE,<:lch of contract or any Intentional or careless actions or omiSSions on part of such suppliers, which result In any loss. damage, delay or InlL.ry to you or your companions or group members. Unless the term "guaranteed" is specifically stated in writing on your tIckets, invoice, or reservatIon ltlr'terary, we do not guarantee an~ such suppliers' rates, bookings. reservations, connections, scheduling, or handling of personal effects. Travel agent shall nol be responsible for any injuries, damages, or losses caused to any traveler in connection with terronst actIVIties. soclall,)" I bor unrest, mechanical or const, uction failures or difficulties, diseases, locallawsj climactic conditions, abnormal conditions or developments, or anv other actions, omissions or conditions outside l'le travel agent's control. Traveler assumes complete and full responSibIlity for and hereby rele lses the agent from. any duty of checking and venfymg any and all passport, visa, vaccination. or other entry reqUIrements of each destmatlon and all <;afety and secunty conditions of such destinations, during the length of the proposed travel. For information concerning possiblf.! da'igers at tntf'rnational destinations. contact tile Travel Advisory Section of the U. S. State Department, (202) 647-5225. For medical mformaflOr "'all the l R Center for Disease Conllol, (404\ 332-4559. By embarking upon his/her travel, the traveler voluntarily assumes all nsks invol\lc 1 ( % h 'faV I, whether expected or ur,expAetocl This agency is Mt responsible for cancellation of any services andror refunds from any JJoplier or Ct'Wle r trat may cease opel8tiollS, 1raVeli3r is !lcieby warned of t l 18 dbove risks as well as pOSSible travel industry bankruptCIes and medical and ClimactIC dIsruptions. and [s advised to oillam appropriate insurance coverage against them. Traveler's retentton of tickets, reservatlor.!';, or bookl"Jq~ afte" issuance shall constitute a consent 10 the above and an agreement on his/her part to convey the contents hereto to his/her troveI CO'T'pal i()n~ or group members • B A L B o A OUR MISSION AT BALBOA TRAVEL is to help our business clients achieve their objectives and to fulfill the travel dreams of our leisure clients SALES PERSON: 04 ITINERARY/INVOICE NO. 0003303 CUSTOMER NBR: QC1QUALC01 TTFBBE DATE: 03 APR 9 PAGE: 01 TO: ATTN DEBORAH CASHER ANDliEW VITERB I (;lU(.\LCOMM INC *0 FOR: VITERBI/ANDREW 14 MAY 98 THURSDAY AIR UNITED AIRLINES FLT:472 LV SAN DIEGO DEPART: EAST TERMINAL. AR NE~JARK ARRIVE: TERMINAL A VITERBI/ANDREW SEAT- 6C DEL. IVEF~ 6 APR 2P ECONOMY 100P UA---000B6195755 L.UNCH E~lP: AIRBUS A320 NON--STOP I- MAY 98 FRIDAY HOTEL NEW YORK CITY LEADING HOTELS THE NEW YORK PALACE 455 MADISON AVENUE NEW YORK NY 10022 FONE 212-888-7000 FAX 212-303-6000 GUARANTEED LATE ARRIVAL CONFIRMATION NY524423 REQUEST NON SMOKING ROOM OUT - :J. rJfvlAY 2 NIGHTS 1 ROOM C1KALL 02CR RATE-295.00USD PER NIGHT CANCEL 02 DAYS PRIOR TO ARRIVAL WITH KING BED PLEASE 19 MAY 98 TUESDAY AIR UNITED AIRLINES FLT:215 ECONOMY LV WASHINGTON DULLES 520P AR SAN DIEGO 727P ARRIVE: EAST TERMINAL VITERBI/ANDREW SEAT-12e UA-00086195755 17 AUG 98 MONDAY OTHER SAN DIEGO BALBOA RESERVATION PROTECTION DINNER EOP: BOEING '757 NON--STOP AIR TICKET UA 114-615752~i VITEf~B I ANDREW EXCHANGE UA1131027478 BILLED TO CA5410654145714116 SUB TOTAL NET CC BILLING T()T(~L AMOUNT DUE rJ5.00 75.00 7~5 It 00 0 .. 00 RECONFIRM RETURNING AND CONTINUING RESERVATIONS 72 HOURS IN ADVANCE FOR INTERNATIONAL FLIGHTS AND CAUTION: TICKE;~~~~~:~~~~~i :~~~~~~~Ep~~S~O:~~T~~~~~~T~E~~l~t1lM U EDON PAGE 2 CST# 2013711-10 A Global ...rt..... of lI Woods1d8 Travel Trust IMPORTA T INFORMATION 1.) Please check your documents when you receive them. Call,f you have any questions. 2.) RECONFIRMATIONS: Domestic: We recommend that you recon firm all flights prior to departure and at each point of stopover. ThiS will give the airline the opportunity to keep you adVIsed of any changes which may have occurred In your flight International: YQU must reconfirm continuin or rB urn reservations at least 72 Iiours prior to flight time at each potnrof stopover or your re ervations wilt be automatically cancen d. 3.) CHEC~·IN: We suggest the fol~owl~g check~in tir:ues..pof9~stip:. hour prior to departure. International. 2 hours pnor"\o depa ure Note: Check·in later than these times could result In denied board ing. 4.) OVERBOOKING: Airline flights may be overbooked. A person denied boarding on a flight may be entitled to a compensatory payment. The rules for denied boarding compensation are available at all ticket counters. 5.) CHANGES OR CANCEL ATiONS: To change or cancel your flight itinerary, call this travel agency or the airline you are scheduled to take. If cancelling, return the unused tickets to us for credIt or refund Most special, excurSion, and discount tickets have vanous travel restrictions and may have a penalty for change or cancellation. Be sure you understand these restrictions. If you change your plans enroute, ask the airline to apply the value of your unused tIcket to ard the purchase of a new ticket. If a refund I due obtain a receipt from he airline. If you are holding guaranteed hotel reserva tion which you may wish to cancel, notify the hotel as soon a po sIble. Deposits and prepayments are subject to cancellation po icy 6.) I SURANCE: Airline and other travel suppliers insurance for bag gage have limIted liability. Your personal insurance may not ad equately cov.er ~os~e incurred qy qmcellatio~1 acciden , \IIness or staten or damaged prQ'~ert . W!J. /strongly urge you"to purchase additional Insurance offer (:j t ~OlJ.· . I .'I '1 0" , 7.) LOST TICKETS: Lost, stolen or destroyed tickets,:must be paid for until refund is obtained form the issuing airhne, Subject to an airline Imposed servIce charge. 8.) PREPAID TICKETS: If your travel rrangements involve a r.eguest for prepaid airline tickets. picked up'by the passenger at an airline ticket counter, please note that most carriers reqUire a mandatory non-refundable service charge. , j WHAT YOU SHOULD KNOW'A . 2.) Travel agents are not allowed to refund tiC ets on airlines which have declared bankruptcy. Money gIVen to a travel gent Immediately becomes the property of the airlines, and we are reqUIred by laws to comply With the airlines' orders .. ! I\-" .. CON U ER DISCLOSURE NOTICE To: DEBORAH CASHER Fro~: Harini "arasi~han' B4/B6/98 12:5B:52 BB2 REQUESTED TRAVEL ARRANGEMENTS ~Travel Bl1MJ __~ Sent from: Voice Number: FAX Number: Harini Narasimhan 619-678-3424 619-678-3769 Note: Airlines can change fares or cancel un-ticketed reservations. To guarantee a fare, you must purchase the ticket. Deborah, Here is a current itinerary of the trip. Please call me if you have any questions. Best regards, Harini SALES PERSON: 04 CUSTOMER NBR: QCIQUALCOl ITINERARY TTFBBE DATE: 06 APR 98 PAGE: 01 TO: ATTN DEBORAH CASHER ANDREW VITERBI QUALCOMM INC *Q DELIVER 6 APR 2P FOR: VITERBI/ANDREW .30 PER MI/KM NON-STOP DRP CHG-.OO CORP ID-B555600 LUNCH EQP: AIRBUS A320 ID-0058920 905P ECONOMY lOOP o FREE MI/KM o FREE MI/KM o FREE MI/KM 09002219US2CH OUT-15MAY 1 NIGHT FLT: 472 A SEAT- 6C UA-00086195755 AVIS RENT A CAR I-FULL SZ AUTO AC TO-WASHINGTON DULLES ID-FG320H RETURN-19MAY/1720 RATE IS GUARANTEED DAILY RATE-USD54.00 EXTRA DAY-54.00 EXTRA HOUR-18.01 CONFIRMATION NUMBER NEWARK COURTYARD BY MARRIOTT 98 THURSDAY UNITED AIRLINES LV SAN DIEGO DEPART: EAST TERMINAL AR NEWARK ARRIVE: TERMINAL VITERBI/ANDREW NEWARK PICK UP-2105 HOTEL CAR 14 MAY AIR 6 CY LINCROFT RED BANK 245 HALF MILE ROAD RED BANK NJ 07701 FONE 732-530-5552 FAX 732-530-5756 GUARANTEED LATE ARRIVAL CONFIRMATION 81579955 1 ROOM REGULAR RATE RATE-125.00USD PER NIGHT CANCEL BY 06P DAY OF ARRIVAL , To: rDEBOEAH [ASHER 84/86/98 12:51:25 883 REQUEST NON SMOKING ROOM WITH KING BED PLEASE 15 MAY 98 FRIDAY HOTEL NEW YORK CITY OUT-17MAY LEADING HOTELS 2 NIGHTS THE NEW YORK PALACE 1 ROOM ClKALL 02CR 455 lYlf\UJ.,)UN AV t;Nut; KA'l't,-Z35 .OOU:::iU l:"t;K N.lG1i'l' NEW YORK NY 10022 CANCEL 02 DAYS PRIOR TO ARRIVAL FONE 212-888-7000 FAX 212-303-6000 GUARANTEED LATE ARRIVAL CONFIRMATION NY524423 REQUEST NON SMOKING ROOM WITH KING BED PLEASE • • ~I I 19 MAY 98 TUESDAY AIR UNITED AIRLINES FLT:215 LV WASHINGTON DULLES AR SAN DIEGO ARRIVE: EAST TERMINAL VITERBI!ANDREW SEAT-12C ECONOMY 520P 733P UA-00086195755 DINNER EQP: BOEING 757 NON-STOP 17 AUG 98 MONDAY OTHER SAN DIEGO BALBOA RESERVATION PROTECTION DURING BUSINESS HOURS 619-678-3760 OR 888-784-0772 FOR AFTER HOURS EMERGENCIES, CALL 800-359-8773 THANK YOU FOR CHOOSING BALBOA TRAVEL ID-CODE-U4E4-QUAL DUE TO INCREASED SECURITY, A PHOTO 1.0. IS REQUIRED. THIS TICKET IS NON - REF UNO A B L E AND NON - T RAN S FER A B L E **ANY** CHANGES WILL RESULT IN ADDITIONAL COSTS VARIOUS RESTRICTIONS APPLY A FEE OF 75.00 APPLIES FOR CHANGES PLUS ANY FARE DIFFERENCE IF APPLICABLE. PLEASE REVIEW ITINERARY FOR ACCURACY YOUR RESERVATION COORDINATOR IS HARINI. THANK YOU FOR CHOOSING BALBOA TRAVEL. PLEASE CALL IF YOU HAVE ANY QUESTIONS AND HAVE A PLEASANT TRIP. END 0 F SCROLL • To : "DEBORaH CASHER Fron: Harini ftarasinhanl 84/86/98 12:58:27 881 B DATE TIME TO FAX FROM MESSAGE 04/06/98 12:49:56 DEBORAH CASHER 658-2500 Harini Narasimhan L B o To·.. DEBORaH CASHER FrOM: Harini NarasiMhanl 84/83/98 18:59:38 882 REQUESTED TRAVEL ARRANGEMENTS Sent from: Voice Number: FAX Number: Harini Narasimhan 619-678-3424 619-678-3769 ,,, .1., Note: Airlines can change fares or cancel un-ticketed reservations. To guarantee a fare, you must purchase the ticket. Deborah, Here is a current itinerary of the trip. 14 MAY 98 THURSDAY AIR UNITED AIRLINES FLT:472 ECONOMY MULTI MEALS LV SAN DIEGO lOOP EQP: AIRBUS A320 DEPART: EAST TERMINAL AR NEWARK 905P NON-STOP ARRIVE: TERMINAL A VITERBI/ANDREW SEAT- 6C UA-00086195755 19 MAY 98 TUESDAY AIR UNITED AIRLINES FLT: 215 ECONOMY DINNER LV WASHINGTON DULLES 520P EQP: BOEING 757 AR SAN DIEGO 727P NON-STOP ARRIVE: EAST TERMINAL VITERBI/ANDREW SEAT-12C UA-00086195755 Best regards, Please call me if you have any questions. DATE: 03 APR 98 PAGE: 01 TTFBBE ITINERARY TO: ATTN DEBORAH CASHER ANDREW VITERBI QUALCOMM INC *Q DURING BUSINESS HOURS 619-678-3760 OR 888-784-0772 FOR AFTER HOURS EMERGENCIES, CALL 800-359-8773 THANK YOU FOR CHOOSING BALBOA TRAVEL ID-CODE-U4E4-QUAL DUE TO INCREASED SECURITY, A PHOTO 1.0. IS REQUIRED. THIS TICKET IS NON - REF UNO A B L E AND NON - T RAN S FER A B L E **ANY** CHANGES WILL RESULT IN ADDITIONAL COSTS VARIOUS RESTRICTIONS APPLY A FEE OF 75.00 APPLIES FOR CHANGES PLUS ANY FARE DIFFERENCE IF APPLICABLE. FOR: VITERBI/ANDREW SALES PERSON: 04 CUSTOMER NBR: QC1QUALC01 Harini I .,' To' DEBORAH CASHER Fro.: Hdrini ndrdsi~hdn' 84/83/98 11:88:31 884 SALES PERSON: 04 CUSTOMER NBR: P06QUALL01 TO: ATTN DEBORAH CASHER ERNA VITERBI QUALCOMM INC *Q FOR: VITERBI!ERNA ITINERARY TNXPCZ DATE: 03 APR 98 PAGE: 01 14 MAY 98 THURSDAY AIR UNITED AIRLINES FLT: 472 ECONOMY LUNCH LV SAN DIEGO lOOP EQP: AIRBUS A320 DEPART: EAST TERMINAL AR NEWARK 905P NON-STOP ARRIVE: TERMINAL A VITERBI!ERNA SEAT-13F UA-00639825973 19 MAY 98 TUESDAY AIR UNITED AIRLINES FLT:215 ECONOMY DINNER LV WASHINGTON DULLES 520P EQP: BOEING 757 AR SAN DIEGO 727P NON-STOP ARRIVE: EAST TERMINAL VITERBI!ERNA SEAT-19F UA-00639825973 DURING BUSINESS HOURS 619-678-3760 OR 888-784-0772 FOR AFTER HOURS EMERGENCIES, CALL 800-359-8773 THANK YOU FOR CHOOSING BALBOA TRAVEL ID-CODE-U4E4-QUAL DUE TO INCREASED SECURITY, A PHOTO I.D. IS REQUIRED. THIS TICKET IS NON - REF U N DAB L E AND NON - T RAN S FER A B L E **ANY** CHANGES WILL RESULT IN ADDITIONAL COSTS VARIOUS RESTRICTIONS APPLY A FEE OF 75.00 APPLIES FOR CHANGES PLUS ANY FARE DIFFERENCE IF APPLICABLE. PLEASE REVIEW ITINERARY FOR ACCURACY YOUR RESERVATION COORDINATOR IS HARINI. THANK YOU FOR CHOOSING BALBOA TRAVEL. PLEASE CALL IF YOU HAVE ANY QUESTIONS AND HAVE A PLEASANT TRIP. Andrew Viterbi, 02:06 PM 4/1/98 ., May Meeting X-Sender: viterbi @adept.qualcomm.com X-Mailer: QUALCOMM Windows Eudora Pro Version 3.0.3 (32) Date: Wed, 01 Apr 1998 14:06:46 -0800 To:dcasher From: Andrew Viterbi <viterbi> Subject: May Meeting I'll be going from NJ where I am on 5/18--just for 5/19. we need to plan travel--possibly using one of the old tickets! ~\ \,\ - \-\~I)\\::.. ~\\~ \~ $\\~ \)~ - > > > > >Elizabeth Kraighman >National Coordination Office for CIC >Support Contractor > >kraighma @ccic.gov > > > > >X-Sender: kraighma@ 128.150.250.11 >To: ac-meetings@hpcc.gov >From: Elizabeth Kraighman <kraighma@ccic.gov> >Subject: May Meeting > >Please mark you calendars... \ > ,>The dates for the May Advisory Committee Meeting are May 18 and 19, 1998. > >May 18 will be subcommittee meetings. May 19 will be a full Committee meeting. > >1 will send a follow-up email with the hotel information as soon as the >contract is signed. > >Liz Printed for Deborah Casher <dcasher@qualcomm.com> 1 Andrew Viterbi, 05:43 PM 3/30/98 , Re: COMA presentation X-Sender: viterbi @adept.qualcomm.com X-Mailer: QUALCOMM Windows Eudora Pro Version 3.0.3 (32) Date: Mon, 30 Mar 1998 17:43:14 -0800 To:dcasher From: Andrew Viterbi <viterbi> Subject: Re: CDMA presentation >Date: Mon, 30 Mar 1998 17:42:38 -0800 >To: Zoran Kostic <kostic@research.att.com> >From: Andrew Viterbi <viterbi @qualcomm.com> >Subject: Re: CDMA presentation >In-Reply-To: <199803112016.PAA00238@beanstalk.research.att.com> > ~ . ostic, > >Here's the Title of my talk: > >11 A Constructive Approach for Migration to Wider Band Wireless Services" > >Abstract: > >Much activity in the standards bodies throughout the world is currently concentrated on high speed data services. This talk presents an evolutionary path based on spread spectrum technology. > > At 03:16 PM 3/11/98 -0500, you wrote: » » » Thanks, » » Iam scheduling your talk for Friday May 15th >~ at 10:30 am. I expect that you would be interested » in seeing what we do here, and several people » would want to meet with you. I will reserve the time » after lunch for this activity, unless you request » differently. » » When you have a chance, please send me the outline » of the talk. » » For directions please consult » http://www.research.att.com/directions » Printed for Deborah Casher <dcasher@qualcomm.com> 1 Andrew Viterbi, 05:43 PM 3/30/98 , Re: COMA presentation » PLEASE NOTE THAT WE ARE IN THE NEWMAN SPRINGS LAB, » NOT FLORHAM PARK. The two are quite far away from » each other. » » loran Kostic » AT&T Labs-Research » NEWMAN SPRINGS LAB » 100 Schulz Drive » Red Bank, NJ 07701 » » 732-345-3130 » » »> From viterbi@qualcomm.com Mon Mar 923:17 EST 1998 »> X-Sender: viterbi @adept.qualcomm.com »> X-Mailer: QUALCOMM Windows Eudora Pro Version 3.0.3 (32) »> Date: Mon, 09 Mar 1998 19:40:04 -0800 »> To: loran Kostic <kostic@research.att.com> »> From: Andrew Viterbi <viterbi @qualcomm.com> »> Subject: Re: COMA presentation »> Cc: dcasher@qualcomm.com »> Mime-Version: 1.0 »> Content-Type> : > text/plain> ; > charset="us-ascii"> »> Content-Length: 2682 »> »> At 03:53 PM 3/9/98 -0500, you wrote: »» »> > 0 r. Viterbi, »» »> > In regards to the AT&T Labs presentation. »> > Ijust noticed a problem. »> > The week of May 19th is VTC, so people will not »> > be here. »» »> > Thus your suggestion for Friday May 15th is much better. »> > If you wish we can make it in the afternoon. »> »> That's fine. Late morning or early afternoon is best. »> »> Andrew Viterbi »> > »»> loran Kostic »»> Wireless Systems Research Dept. Printed for Deborah Casher <dcasher@qualcomm.com> 2 Andrew Viterbi, 05:43 PM 3/30/98 , Re: COMA presentation »»> AT&T Labs Research »»> room 4-144 »»> 100 Schulz Drive »»> Red Bank, NJ 07701 »»> »»> 732-345-3130 »»> kostic @research.att.com »»> »»> »» »» »» »» »> » From viterbi @qualcomm.com Tue Mar 3 11 :35 EST 1998 »> » X-Sender: viterbi@adept.qualcomm.com »»> X-Mailer: Windows Eudora Pro Version 3.0 (32) »> » Date: Tue, 03 Mar 1998 08:27:53 -0800 »»> To: Zoran Kostic <kostic@research.att.com> »> » From: Andrew Viterbi <viterbi @qualcomm.com> »> » Subject: Re: CDMA presentation »> »Cc: dcasher@qualcomm.com, rpadovani@qualcomm.com, kleing@qualcomm.com, »»> viterbi@qualcomm.com »> » Mime-Version: 1.0 »> » Content-Type> : > text/plain> ; > charset=lIus-asciill> »> » Content-Length: 1397 »»> »»> »»> »»> Dr. Viterbi, »> » »»> Tuesday, May 19th would be good. I suggest 10 am. »»> This talk would be given in the Newman Springs Labs in »»> Red Bank, New Jersey, »»> but it would be broadcasted to Florham Park location »»> of AT&T Labs Research as well. »»> »»> Could you send me the outline of your talk. »»> »»> Regards, Zoran »»> »»> »> » Mr. Kostic, »»> Printed for Deborah Casher <dcasher@qualcomm.com> 3 Andrew Viterbi, 05:43 PM 3/30/98 , Re: COMA presentation »> » I'm scheduled to be in NJ at Bell Labs on May 18th (I believe it's a »> » Monday). I could come to ATT Labs on the preceding Friday or on Tuesday. »> » I'm travelling this week but leave me e-mail if this fits your needs. »»> »> » Andrew Viterbi »»> »> » At 10:28 AM 3/3/98 -0500, you wrote: »»> > »>»> Dear Dr. Viterbi, »»> > »>»> We have briefly talked at the Wireless trade show and »>»> I sat at your presentation at the COMA workshop. »»> > »>»> In AT&T Labs-Research people would be interested in hearing »>»> your presentation on the 3-rd generation COMA »>»> evolution. We would make your presentation a part of our »>»> research seminar series. »»> > »>»> The part of presentation which talks about high data rates »>»> in limited amount of spectrum (1.25MHz) is particularly »>»> appealing to us. Thoughts on how IS-136 could evolve into »>»> this are of interest as well. »»> > »>»> Please let me know if you could come to visit us. »»> > »>»> Regards, »»> > »>»> Zoran Kostic »>»> Wireless Systems Research Dept. »> » > AT&T Labs Research »>»> room 4-144 »>»> 100 Schulz 0 rive »>»> Red Bank, NJ 07701 »»> > »»> > 732-345-3130 »>»> kostic @ research.att.com »»> > »»> > »»> > »»> > »»> > »»> Printed for Deborah Casher <dcasher@qualcomm.com> 4 Andrew Viterbi, 05:43 PM 3/30/98 , Re: COMA presentation »» »» »> » » Printed for Deborah Casher <dcasher@qualcomm.com> 5 Emre Telatar, 12:16 PM 10/16/97, Re: Shannon Day at Bell Labs Date: Thu, 16 Oct 97 12:16 EDT From: telatar@research.bell-labs.com (Ernre Telatar) To: viterbi Subject: Re: Shannon Day at Bell Labs Dear Dr. Viterbi, Indeed, this was very much Aaron's initiative. We will do something on Aaron during the seminar, but have not decided exactly what. Some were even suggesting the change the name of the meeting, but I find that a little tacky. On the other hand we can use Aaron's time slot for some talks about him and his work. Dedicating the conference to his memory is an excellent idea. The meeting is on May 18th. Best regards, Ernre Printed for Andrew Viterbi <viterbi@qualcomm.com> L- _ 1 AT&T SHANNON DAY Thursday, May14, - San Diego to Newark LV San Diego AR Newark Avis Car Conf. No. 09002219US2CH 1:00PM 9:05PM United #472 to be upgraded New York Palace Hotel (in 5/14; out 5/17) $295 455 Madison Ave. at 50 th New York, NY Phone: 1-800-NY-PALACE or 212-888-7000; Fax: 212-303-6000 Conf. No.NY534423 Friday, May 15 AT&T Presentation: A constructive Approach for Migration to Wider Band Wireless Services 10:30 Deliver Talk AT&T Labs Newman Springs Lab 100 Schulz Dr. Red Bank Zoran Kostic: 732-345-3130 Sunday, May 17 - Travel to Murray Hill Headquarters Plaza Hotel - $162 (1 night) 3 Headquarters Plaza Conf. No. 231751 leI: 973-898-9100 Fax: 973-292-0112 Monday, May 18 - Shannon Symposium 9:00AM Lucent Technologies Murray Hill Auditorium 700 Mountain Ave. Murray Hill Travel to D.C. via air shuttle from Newark - See attached. 6/30/9711:00:47 AM Arlington Hilton (in 5/18; Out 5/20) (Debbie reserved) Hotel ($139.00 plus tax, gov't. Rate) 950 N. Stafford St. Arlington, VA 22203 Phone: 703-528-6000; Fax: 703-528-4386 (Identification reference: Group Block G 8028 ) Confirmation No. 59282 Tuesday, May 19 Committee Meeting 5/18 Subcommittee mtg.; 5/19 full Committee mtg. National Science Foundation 4201 Wilson Blvd. Room 1235 Arlington, Virginia. Wednesday, May 19 - Dulles to San Diego LV Dulles 5:20PM AR San Diego 7:27PM United #215 6/30/9711:00:47 AM Aaron D. Wyner,6/7/97 2:12 PM,Shannon Day at Bell Labs Date: Sat, 7 Jun 97 17:12 EDT From: adw@research.bell-Iabs.com (Aaron D. Wyner) To: Dave_Forney-LUSE27@email.mot.com. cover@ isl.stanford.edu, gallager@lids.mit.edu, jwolf@ucsd.edu, jz@ee.technion.ac.il, massey@isLee.ethz.ch, njas@research.att.com, rlucky@bellcore.com, viterbi Subject: Shannon Day at Bell Labs Thanks for accepting our invitation to speak at the Bell Labs Symposium in Commemoration of Information Theory. We are honored and delighted that all of our invitees accepted. Here is the list of speakers: Thomas Cover - Stanford University G. David Forney - Motorola Robert G. Gallager - MIT Robert W. Lucky - Bellcore James L. Massey - ETH, Zurich Neil J. A. Sloane - AT&T Labs Andrew Viterbi - Qualcomm Jack K. Wolf - UCSD Aaron D. Wyner - Bell Labs Jacob Ziv - Technion The philosophy of the committee in choosing the speakers was to concentrate on the technical areas directly inspired by ShannonIS 1948 paper (the anniversary of which we are celebrating) - Le. information theory and its applications. We considered another alternative of making a list of the many areas that were inspired by the entire corpus of Shannon's work (which would include subjects as diverse as sampling theory and computer chess), and inviting a speaker to talk about each. But after a great deal of thought we felt that the direction that we chose will result is the most technically worthwhile symposium. It's also a "senior citizen" group of speakers. We felt that the symposium will benefit from the prospective of speakers who have been working in the area for most of the post-Shannon era. It's not too early to give some thought to what you would like to talk about. 1 1 11 be getting back to you in a month or two. Feel free of course to discuss the matter with other speakers, or anyone else for that matter. Oh yes. The date of the symposiumi~ay, May~ It will be held in the Murray Hill Auditorium. Best regards and thanks again, Aaron Printed for "Andrew J. Viterbi" <viterbi@qualcomm.com> 1 ~. 1 Aaron D. Wyner,6/7/97 2:12 PM,Shannon Day at Bell Labs 2 Aaron D. Wyner Room 2C-365 Lucent Technologies, Bell Labs Murray Hill, NJ 07974 FAX: e-mail: adw@bell-Iabs.com telephone: 908-582-2916 908-582-3340 Home: 973-763-1073 Printed for "Andrew J. Viterbi" <viterbi@qualcomm.com> 2 An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes Andrew Viterbi, QUALCOMM Incorporated ABSTRACT: An intuitive shortcut to understanding the MAP decoder is presented based on an approximation. This is shown to correspond to a dual maxima computation combined with forward and backward recursions of Viterbi algorithm computations. This result is shown to correspond to the logarithmic version of the MAP algorithm after the same approximation is applied. A correction term for recovering the exact form from the approximation is presented, as well as the specific expressions for the metrics on the AWON channel. It is also shown how the MAP decoder memory can be drastically reduced at the cost of increasing the processing speed by one-third. Finally. the implications for turbo codes are briefly discussed. 1. Introduction The Maximum A Posteriori (MAP) decoding algorithm for convolutional codes was proposed over two decades ago by Bahl et al [1974] but until recently received very little attention because of its increased complexity over alternative convolutional decoders for a minimal advantage in bit error rate performance. Recently, however, the MAP decoder has enjoyed renewed and greatly increased attention as a soft-output decoder for the class of "turbo" codes discovered by Berrou et al [1993]. Its use to generate soft-output metrics for successive iterations of the turbo decoder provides a noticeable improvement in required EJNo. on the order of O.7dB, over alternative decoders such as the soft-output Viterbi algorithm (SOVA) proposed by Hagenauer am Hoeher [1989]. In the next section we derive intuitively an approximation to the MAP algorithm. We then proceed to justify this heuristic approach by presenting a simplified derivation of the MAP decoder, based on recent work of Hagenauer et al [1996]. In the last section, we consider implementation complexity and show that the MAP decoder can be implemented with no more than four times the complexity of a Viterbi decoder for the same code. 2. An Intuitive Approximate Approach to the MAP Algorithm Let us fust consider briefly the MAP soft-output decoder for a block code. If u is the information bit sequence and y is the sequence of received channel output symbols, then the a posteriori probability ratio for the kth bit is just (1) In preference to using A k as the soft-decision output, its logarithm, has the advantage that for a memoryless channel the overall metric can be formed as sums, rather than products, of independent components or metrics. Thus defining (2) for the soft-output metric, and M(u,y) ~ In p(u,y) =In P(u) + In p(Ylu) it follows from (1) through (3) that L k ! In L eM(u,y) -In L eM(u,y) u:Ut =+1 u:Ut =-1 (3) (4) Exponentiation enhances the differences between individual metrics M (u,y). Hence, typically one term will dominate each sum, which suggests the approximation InL j which when applied to (4), yields L k == Max M(u,y)- Max M(u,y). U:Ut_+1 U:Ut__1 This metric has been termed the "Dual-Maxima" rule for block codes [Viterbi, 1995]. (5) We now proceed to apply the same approach to a block code generated as a convolutional code which is truncated by forcing the encoder to a known (e.g. 0) state (Figure 1). While (4) and (5) still apply, they involve an inordinately complex computation involving 2 N terms, where N is the length of the information bit sequence. We proceed to simplify (5) by recognizing that the maximum metric for a given state of the convolutional code's trellis can be obtained from the conventional Viterbi algorithm. Suppose then that we seek the logarithm of the MAP ratio for the kth bit, when the~ is. memOIyless. For simplicity, let the code trellis be binary, so that one branch corresponds to a single bit (this can be easily generalized to treat multiple bits per branch). Of course, as noted, in order to proceed the channel must be memoryless. Then we may argue intuitively as follows, referring to Figure 1. Let us generate all the state metrics at the (k-l)th node by applying the Viterbi algorithm from the initial node to this point. For each state the metric corresponds to the maximum metric ratio over all paths up to that node. Let us denote these state metrics as ~_I(S/) where S' is the generic state of the (k-l)th node. Similarly, we may apply the Viterbi algorithm backward, starting at the last node am proceeding to obtain the state metrics at the kth node, each of which is the maximum metric over all paths from the final node to this point. We denote these state metrics ht(s), where s is the generic state at the kth node. Finally, we denote the branch metrics for the kth branch connecting state S' at the (k-l)th node to state s at the kth node by (6) Note that in a binary trellis each state has only two branches emanating from it or entering it. For two states s' and s, for which a branch transition does not exist, the metric is negative infinity, as seen from (6). Finally combining the forward state metrics at node k-l, the backward state metrics at node k and the metrics for branches connecting the two sets, we conjecture that the approximate metric of (5) can be computed as (7) 2 We show in the next two sections that this result can be reached by a detailed and better justified derivation. kth branch received symbols Yk s' s ,.....---.... o initial node Trellis j < k .... (k-1) th k th node node Trellis j > k ...... o final node Fig. 1 MAP Framework Generalized VA Forward Recursion Generalized Dual-Maxima Computation Generalized VA Backward Recursion ~--- 2. The MAP Algorithm, Concisely Stated and Justified Referring to Fig. I, the trellis diagram of a blocked (or tailed off) convolutional code which starts aM tenninates in the zero state, we concentrate on the kth branch and define: Uk = bits associated with kth branch s = generic state for the kth node (after kth branch) s' = generic state for the (k.-I)th node (before kth branch) Yk = vector of received symbols for kth branch Yjd: = vector of received symbols for all branches before kth Yj>k = vector of received symbols for all branches after kth Y =Y j<k , Yk ,Yj>k = vector of all received symbols over entire trellis. Then using the independence of symbols Y on successive received branches and the Markov property of the trellis, (state s and branch Yk depend only on state s'), we have 3 (8) where We note from these expressions the recursions (9) (10) (11) (lk (S) =L(lk-l (S') rds' ,S) 5' (forward) (backward) (12) (13) with initial and final conditions ~(O)=l=~N(0). With these preliminaries, we can establish the measure of interest, the soft output for the kth branch. For the sake of simplicity, we consider a binary trellis which pertains to a single bit for each branch, which we denote u (the generalization to a several bit branch -as for trellis coded modulation- will be straightforward). Then the likelihood ratio of Uk given y is L (lk_l(S')'Yk(s' ,S)~k(S) _ S',s:uk=+l - L(lk-l(S')rk(S' ,S)~k(S) s',s:uk=-l (14) The summations of numerator and denominator are over those pairs of states for which u k =+ 1 and uk=-l, respectively, and the conditional probabilities of the first ratio are replaced by joint probabilities according to Bayes rule and cancellation of the common term p(y) in numerator and denominator. The MAP algorithm consists of the operation (14) coupled with the recursions (12) and (13) which employ the branch likelihood (11). Note that because (14) is a ratio, the (l and ~ state metrics can be normalized at any node, which keeps all of them from overflowing. All this has been known for over twenty years and generally ignored because: a) with hard decision outputs, performance is almost the same as for the VA; b) complexity is much greater because of the multiplication operation required and the additional backward recursion. With the incentive provided by turbo codes and their improved performance employing MAP, interest was rekindled and it was recognized that simplification can be effected without compromising performance, as described next 4 ---~---~~~~~~~~~~~~~~~~~~~~~~~~~~~~~-~----------------- 3. LOG·MAP, A Dual Generalized VA Taking logarithms of all parameters we define each as the Latin symbol equivalent of the Greek symbol, a = ina., b =in~, c =iny and L =inA. Thus (11) through (14) become the branch metric (11') ak(s) =in L exp [ak_1(s')+Ck(s' ,s)] s' (12') (13') bk_1(S') = in L exp [cds' ,s) + bk(s)] L k = in L exp (ak-l + Ck + b k ) -in L exp (a k - 1 + ck + bit) . (14') s',s:uk=+l S',s:uks_l Note that for a binary trellis the summations in (12') and (13') are over just two terms, while in (14') each is over half the connected state-pairs of which there are in all 2 m in each subset where m is the number of memory elements of the convolutional encoder. Note also that since the a. and ~ metrics could be normalized by a common factor at each node, so the a and b metrics can be reduced by a common amount at each node. The first revelation comes about as a result of the approximation (15) with the approximation improving as the values Xi diverge. With this approximation, (12') and (13') become exactly the VA recursions, respectively forward and backward, where the latter begins with the final node. Similarly (14') becomes the dual-maxima procedure [Viterbi, 1995, 1996]. Hence we arrive at a forward aId backward VA, coupled together at each node by a dual-maxima computation, just as in (7) which we obtained by an intuitive ar2ument. Necessarily the approximation (15) produces some degradation. This can be avoided by using the second revelation, the identity In (ex +e Y ) =Max (x,y)+In(1+e- 1x - Y1 ) ~ g(x,y) . (16) The second term can be viewed as a "correction" and implemented using a table look-up ROM driven by Ix-yl, while sign (x-y) is required to determine Max(x,y). To obtain a precise form of (15) when there are more than two terms in the sum, we nest the operations g( ) to obtain I InL e Xj = g(XI ,g(XI-l' ......g(X3'g(X2'xd)···) i=l (17) 5 which is required for (14'), as well as for (12') and (13') when the trellis structure is non-binary. But the conclusion is the same: with the correction (second tenn of (16)) providing for the exact fonn, the log-MAP algorithm is implemented as two 2eneralized VA al20rithms coupled by a 2eneralized dual-maxima procedure where the generalization involves adding the correction tenn to the max (x,y) function to obtain the function g(x,y) of (16). 4. Branch Metric for the AWGN Channel Since the branch metric (11') determines all successive parameters (12') to (14') through recursion aM other computations, let us consider its fonn for the example of a systematic binary trellis code and an AWON channel. Then since s' and s determine the bit Uk which caused the transition as well as the code symbols xu... X ltn associated with the rest of the branch, we may rewrite (II') as But with Uk and x kj taking on values ± 1, we have 2E ( n ) = - UkYkl + LXkj Ykj + tenns independent of Uk and x k No j=2 while with the definition P(Uk = +1) in ----'-:--~-- 1- P(Uk = +1) = in I-P(u k =-1) p( Uk =-1) it follows that = L..u .. /2 + tenns independent of Uk so that, removing constant tenns, (18) (19) where A=2F1N o . This expression for c k should be used in (12') and (13'). Substituting in (14'), we obtain a relation between L k , the log likelihood ratio function for the kth branch after decoding, and L k , the function before decoding, (or after decoding the previous iteration for the turbo decoder), to be 6 L k =In [""~••' exp(i. k /2 + AYk') ex p (a H + b k +A~ XkjYkj)] -In [...'~,_, exp-(i. k /2+AYk') ex{a H + bk+A~ XkjYkj)] where L k ~ In :L exp(ak_1 + b k + <\) -In :L exp(ak_1 + b le + <\J s' ,S:Uk =+1 s' ,S:Uk =-1 aIX1 n - (f ) 2E ~ Ck S,S =- £..i XkjYj' No j=2 (20) (21) (22) In the turbo code literature, Lie is called the extrinsic likelihood [Hagenauer et ai, 1996]. This is all that needs to be calculated and output by the generalized dual maxima computer, since Lie and Ykl were inputs. In fact, Lie becomes the log-likelihood function in place of L k for the next turbo decoding iteration. Thus (14') and (19) can be replaced by (20) through (22). 5. Implementation for Memory Reduction The obvious remaining drawback of the LOG-MAP algorithm is the excessive memory required. As described, the entire state metric history must be stored, out to the end of trellis, at which point the backward algorithm begins and decisions can be output starting with the last branch, without need to store any but the last set of state metrics computed backward. This storage requirement is obviously excessive; for a 16-state code, assuming 6-bit state metrics, it would require 96 bits of storage per branch, for a total of 96,000 bits for a 1,000 bit block, judged to be minimal for turbo code performance. We now describe a technique which reduces the memory requirement for a 16-state code to just a few thousand bits, independent of the block length. It can best be described by referring to the timing diagram of Figure 2, which indicates the bit processing times for one forward processor and two backward processors operating in synchronism with the received branch symbols, i.e., computing one set of state metrics during each received branch time (bit time for a binary trellis). 7 Nodes Forward Processor Timing ISL ISL 1st Backward Processor ....... -----..,.......... - - ....... I~,...---..,,....... _ - - -= Timing 1 4L - - _13L 2L SL 1fiJ. _ -4r I SL - - -~- - 2nd Backward Processor Timing l ~sL- - 1.... - _ 4L - - -~- SL I~ -=- -=-~ 7L - - Decoder Output Timing i!O:--L-~3~L ....... I ....... 5t-L--4-:-L......r~1L--S .... L ....I~~~L----sL--.1 Fig. 2 Processor's Timing The basis for this approach is the fact that the VA can start cold in any state at any time; initially the state metrics generated are nearly worthless, but after a few constraint lengths, the set of state metrics are as reliable as if the process had been started at the initial (or final) node. Let this "learning" period consist of L branches. (For a 16-state code, L=32 should be more than sufficient, amounting to over 6 constraint lengths of the convolutional code.) This applies equally to the backward as well as the forward algorithm and assumes that all state metrics are normalized by subtracting at every node an equal amount from each. Let the received branch symbols be delayed by 2L branch times. Then the forward algorithm processor starts at the initial note at branch time 2L, computing all state metrics for each node every branch time am storing these in memory. The first backward processor starts at the same time but processes backward from the 2Lth node, setting every initial state metric to the same value, not storing anything until branch time 3L, at which point it has built up reliable state metrics and it encounters the last of the first set of L forward computed metrics. (On Figure 2, unreliable metric branch computations are shown as dashed lines.) At this point the generalized dual-maxima process is performed according to (7'), the Lth branch soft decisions are output, and the backward processor proceeds until it reaches the initial node at time 4L. Meanwhile starting at time 3L, the second backward processor begins processing with equal metrics at node 3L, discarding all metrics until time 4L, when it encounters the forward algorithm having computed the state metrics for the 2Lth node. The generalized dual-maxima process is then turned on until time 5L, at which point all soft decision outputs from the 2Lth to the Lth node will have been output. The two backward processors hop forward 4L branches every time they have generated backward 2L sets of state metrics and they time-share the output processor, since one generates useless metrics while the other generates the useful metrics which are combined with those of the forward algorithm. Note that nothing needs to be stored for the backward algorithms except for the metric set of the last node and these only when reliable metrics are being generated. The forward algorithm only needs to store 2L 8 sets of state metrics· since after its first 2L computations (performed by time 4L), its first set of metrics will be discarded and the emptied storage can then be filled starting with the forward-computed metrics for the (2L+l)th node (at branch time 4L+l). Thus the storage requirements for a 16-state code using 6-bit state metrics is just 192L bits in all, which for L=32 amounts to approximately 6,000 bits. (Note that a conventional K=7 Viterbi decoder with 64 states and a 32-bit path memory requires about 2,000 bits of memory, while a K=9 decoder requires at least a 40-bit path memory resulting in over 10,000 bits of storage). We conclude that the LOG MAP storage requirements are no greater than those of a conventional VA. As for processing requirements, it would appear that the VA load is thus tripled; furthermore, the complexity of the generalized dual-maxima process is no greater than that of the forward or backward VA processor, so that overall the complexity is not more than quadrupled, - also the chain-back procedure is avoided. Further, since the code is shorter, the number of states is reduced by a factor of 4 or 16 for the K=7 am 9 examples given. Since the MAP decoder (with short constraint length) is only justified for turbo codes, we must also account for the required number of iterations, which are of the order of 4 to 8. Thus a 16-state serial turbo decoder performing 8 iterations imposes double the processing load of a K=9 Viterbi decoder and 8 times that of a K=7 decoder. Minimum decoding delay is set by the length of the block or its corresponding interleaver. If the processors described above operate at just the speed of the received branches, it is necessary to pipeline the successive iterations and hence multiply the minimum delay by the number of iterations. If, on the other hand, the processors can operate at a much higher speed, then additional delay can be much reduced. 6. Concluding Remarks Since turbo codes represent the most important application of soft-output decoding, we summarize the current state of understanding of this class of codes in terms of four basic issues: a) the soft output decoding algorithm; b) the choice of good codes; c) the size and nature of the interleaver; d) the explanation of the superior performance of the iterative turbo decoder. as demonstrated through simulations. The level of understanding diminishes in the above order from being virtually complete for (a) to being almost totally empirical for (d). First, as this paper has attempted to show, the MAP soft-output algorithm is not nearly as complicated and unintuitive as it originally seemed. In fact, it is no more than two generalized Viterbi decoders coupled together by a generalized dual-maxima computation. We have shown that its processing complexity (per iteration) is no greater than 4 times that of a Viterbi decoder for the same (convolutional) code constraint length. Finally, inasmuch as turbo codes can use much shorter constraint lengths, the processing load per iteration may actually be quite modest, though with multiple iterations, the load still exceeds that of conventional decoders by a moderate multiple. Much progress has been achieved in the choice of turbo codes (b), particularly by Divsilar and Pollara [1995], and Benedetto and Montorsi [1996] using free distance arguments. While these techniques really apply only to the EJNo range where union bounds are valid, they produce nevertheless codes which yield good performance to within less than IdB of the Shannon limit. Regarding (c), Benedetto and Montorsi[1996] have demonstrated that error probability is inversely proportional to the size of the interleaver, when it is properly chosen from the ensemble of all interleavers of a given size. This result is very important not only to Actually storage for L sets of state metrics would suffice if the storage process were to proceed alternately forward and backward every L branches, but with some added complexity in the process and its description. 9 understand turbo codes, but also to guarantee their low "error floor." The size of the interleaver also establishes the minimum delay requirement for a given level of performance. All the results for (b) and (c), however, pertain to turbo, or parallel concatenated, convolutional codes which are optimally decoded. While the MAP algorithm does provide for the optimum computation of metric, or likelihood, for each iteration, it is by no means clear that the iterative procedure leads to an optimal overall decoder. On the other hand, empirical results for (d), based on extensive simulations by numerous groups of researchers, establish the remarkably good performance of iteratively decoded turbo codes. This then is the surprising conclusion and the major contribution of Berrou et al [1993]. It is possible that a full understanding of this topic will defy analytical attacks for the indefinite future. Information theorists can find comfort in the fact that the process breaks down prior to the Shannon limit, but at a greatly diminished distance from it than was previously deemed practically achievable. Reference List Bahl LR, Cocke J, Jelinek F and Raviv 1. (1974) "Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate," IEEE Trans. Information Theory, 20: 284-287. Benedetto S, Montorsi G. (1996) "Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes," IEEE Trans. on Information Theory, 42:409-428. Berrou C, Glavieux A and Thitimajshima P. (1993) "Near Shannon Limit Error-Correcting Coding: Turbo Codes," IEEE International Conference on Communications, Geneva, Switzerland, pp. 1064-1070. Divsilar D and Pollara F. (1995) "On the Design of Turbo Codes," TDA Progress Report, Jet Propulsion Laboratory, Pasadena, California, pp. 42-123. Hagenauer J and Hoeher P. (1989) "A Viterbi Algorithm with Soft-Decision Outputs and its Applications, "IEEE Globecom, Dallas, Texas, pp.47. 1. 1-47.1.7. Hagenauer J, Offer E and Papke L. (1996) "Iterative Decoding of Binary Block and Convolutional Codes," IEEE Trans. on Information Theory, 42:429-445. Viterbi AI. (1995) CDMA: Principles of Spread Spectrum Communications, Chapter 4, Addison-Wesley, Reading, Massachusetts pp. 77-121. 10 Log Map (1) The LOG-MAP Algorithm Simplified: Theory and Implementation Andrew Viterbi Introduction The overwhelming success of turbo codes in approaching to within less than IdB of the Shannon limit has refocused attention on soft decision output decoders: both the Hagenauer [ ] soft output Viterbi algorithm (SOVA) and the Bahl et al [ ] soft output maximum a posteriori probability (MAP) decoders. Simulations have shown that turbo code performance of the MAP algorithm is superior, by about O.7dB, to that of the SOYA decoder. On the other hand, it has been widely accepted that the SOYA implementation is simpler and faster than that of the MAP. In this note we show otherwise. Based on the so-called LOG-MAP approach [1 which need not degrade the performance of the MAP, we show quite simply that its implementation is equivalent to two generalized Viterbi algorithms, one operating forward and the other backward, coupled together by a generalized dual-maxima algorithm. Our conclusion is that the resulting decoder is simpler than the SOYA decoder in processing load and regularity, and possibly even in memory requirements. None of the ideas presented here are new, various elements having been proposed in papers of Hagenauer et al [ ], Benedetto and Montorsi [ ] and Divsilar and Pollara [ ]. However, the present exposition appears to be more concise and lucid (to the author, at least) as well as providing a unified perspective. The MAP Algorithm, Concisely Stated and Justified Referring to Figure I, the trellis diagram of a blocked (or tailed off) convolutional code which starts and terminates in the zero state, we concentrate on the kth branch and define: = bits associated with kth branch s = generic state for the kth node (after kth branch) s' = generic state for the (k-l)th node (before kth branch) Yk = vector of received symbols for kth branch Yj<k = vector of received symbols for all branches before kth Yj>k = vector of received symbols for all branches after kth Y =Yj<k , Yk , Yj>k = vector of all received symbols over entire trellis. Then using the independence of symbols Y on successive received branches and the Markov property of the trellis, (state s and branch Yk depend only on state s'), we have 2 (1) where We note from these expressions the recursions ak(s) = Iak_1(S') 'Yk(S' ,s) (forward) s' ~k-l(S') = I 'Yk(S' ,s) ~k(S) (backward) S with initial and final conditions ao(s)=l=~N' (2) (3) (4) (5) (6) With these preliminaries, we can establish the measure of interest, the soft output for the kth branch. For the sake of simplicity, we consider a binary trellis which pertains to a single bit for each branch, which we denote u (the generalization to a several bit branch -as for trellis coded modulation- will be straightforward). Then the likelihood ratio of Uk given y is I p{s' ,s, y) Iak_1(s')Yk(S' ,S)~k(S) = S',S:Uk=+l _ ......:S·,~S:~Uk~=_+l _ I p{s' ,s,y) - Iak-1(s')'Yk(S' ,S)~k(S) S',S:Uk=-l s',S:Uk=-l (7) where the summations of numerator and denominator are over those pairs of states for which u k =+1 and uk=-l, respectively and the conditional probabilities of the first 3 ratio are replaced by joint probabilities according to Bayes rule and cancellation of the common term p(y) in numerator and denominator. The MAP algorithm consists of the operation (7) coupled with the recursions (5) and (6) which employ the branch likelihood (4). Note that because (7) is a ratio, the a and ~ state metrics can be normalized at any node, which keeps all of them from overflowing. All this has been known for over twenty years and generally ignored because a) with hard decision outputs, performance is almost the same as for the VA; b) complexity is much greater because of the multiplication operation required and the additional backward recursion. With the incentive provided by turbo codes and their improved performance employing MAP, interest was rekindled and it was recognized that simplification can be effected without compromising performance, as described next. LOG-MAP, A Dual Generalized V A Taking logarithms of all parameters we define each as the Latin symbol equivalent of the Greek symbol, a =Ina, b =In~, c =Iny and L =InA Thus (4) through (7) become ck(s' ,s) =In p(Ykls,s') + In p(sls') the branch metric (4') ak(s) =In L exp [a k _ 1 (s')+C k (s' ,s)] 5' b k _ 1 (S') =In L exp [ck(s' ,s) + bk(s)] 5 (5') (6') 4 L k = In L exp (a k - 1 + c k +b k ) -In L exp (a k '-1 + c k + b k ) , s',S:Uk=+l S',S:Uk=-l (7') Note that for a binary tree the summations in (5') and (6') are over just two terms, while in (7') each is over half the connected state-pairs of which there are in all 2 m in each subset where m is the number of memory elements of the convolutional encoder. Note also that since the a and ~ metrics could be normalized by a common factor at each node, so the a and b metrics can be reduced by a common amount at each node. The first revelation comes about as a result of the approximation (8) (9) with the approximation improving as the values Xi diverge. Then (5') and (6') become exactly the VA recursions respectively forward and backward, where the latter begins with the final node. Similarly (7') becomes the dual-maxima procedure [ ]. Hence we arrive at a forward and backward VA, coupled together at each node by a dual-maxima computation. Necessarily the approximation (8) produces some degradation. This can be avoided by using the second revelation, the identity In (ex + e Y ) =Max (x, y) + In (1 + e-Ix-yl ) 4 g(x,y) . The second term can be viewed as a "correction" and implemented using a table look-up ROM driven by Ix-y I while sign (x-y) is required to determine Max(x,y). To obtain a precise form of (8) when there are more than two terms in the sum, we nest the operations g( ) to obtain In.± e Xi = g(x 1 , g(X I - 1 , .... "g(X 3 ,g(X 2 ,X 1 ))"') (10) 1=1 5 which is required for (7'), as well as for (5') and (6') when the trellis structure is non binary. But the conclusion is the same: with the correction (second term of (9)) providing for the exact form, the log-MAP algorithm is implemented as two generalized V A algorithms coupled by a generalized dual-maxima procedure where the generalization involves adding the correction term to the max (x,y) function of (8) to obtain the function g(x,y) of (9). Branch Metric for the AWGN Channel Since the branch metric (4') determines all successive parameters (5') to (7') through recursion and other computations, let us consider its form for the example of a systematic binary trellis code and an AWGN channel. Then since s' and s determine the bit Uk which caused the transition as well as the code symbols X k2 . . . x kn associated with the rest of the branch, we may rewrite (4') as But with Uk and x kj taking on values ±1, we have In p(Ykluk'Xk) =-E [(Ykl - u k / + ~(Ykj - Xkjr] + cons tan t term No J=2 2E ( n ) . = - ukykl + .L xkj Y kj + terms Independent of Uk and x k No J=2 while with the definition L k ~ In p(uk = +1) = In p(uk = +1) p(u k =-1) 1-P(u k =+1) 6 = In 1- p(Uk = -1) p(u k =-1) it follows that (11) =L k Uk /2 + terms independent of Uk ---I I so that ck(s' ,s) =Lkuk/2 + A(UkYkl + jt,XkjYkjJ (12) where A=2E/N o ' This expression for C k should be used in (5') and (6'). Substituting in (7'), we obtain a relation between L k , the log likelihood ratio function for the kth branch after decoding, and L k , the function before decoding, (or after decoding the previous iteration for the turbo decoder), to be L k = In [""~=+1 exp(L k /2 + AYkl) exp(ak _ 1 + bk+ A jt, XkjYkjJ] -In [""~=_Iexp- (Lk/2 + AYkl) exp(ak_ 1 +bk+ A jt, XkjYkj J] "4E - =L k + - Ykl + L k No where L k ~ In L exp(a k - 1 + b k + <\) -In L exp(a k - 1 + b k + <\) S',S:Uk=+l S',S:Uk=-l and 7 (13) (14) (15) In the turbo code literature, L k is called the extrinsic likelihood [ ]. This is all that needs to be calculated and output by the generalized dual maxima computer, since L k and ykl were inputs. In fact, L k becomes the likelihood ratio function in place of L k for the next turbo decoding iteration. Thus (7') and (12) can be replaced by (14) and (15). Implementation for Memory Reduction The obvious remaining drawback of the LOG-MAP algorithm is the excessive memory required. As described, the entire state metric history must be stored, out to the end of trellis, at which point the backward algorithm begins and decisions can be output starting with the last branch, without need to store any but the last set of state metrics computed backward. This storage requirement is obviously excessive; for a 16-state code, assuming 6-bit state metrics, it would require 96 bits of storage per branch, for a total of 96,000 bits for a 1,000 bit block, judged to be minimal for turbo code performance. We now describe a technique which reduces the memory requirement for a 16-state code to just a few thousand bits, independent of the block length. It can best be described by referring to the timing diagram of Figure 2, which indicates the bit processing times for one forward processor and two backward processors operating in synchronism with the received branch symbols, i.e., computing one set of state metrics during each received branch time (bit time for a binary trellis). The basis for this approach is the fact that the VA can start cold in any state at any time; initially the state metrics generated are nearly worthless, but after a few constraint lengths, the set of state metrics are as reliable as if the process had been started at the initial (or final) node. Let this "learning" period consist of L branches. (For a 16-state code, L=32 should be more than sufficient, amounting to over 6 constraint lengths of the convolutional code.) This applies equally to the backward as well as the forward algorithm and assumes that all state metrics are normalized by subtracting at every node an equal amount from each. 8 Let the received branch symbols be delayed by 2L branch times. Then the forward algorithm processor starts at the initial note at branch time 2L, computing all state metrics for each node every branch time and storing these in memory. The first backward processor starts at the same time but processes backward from the 2Lth node, setting every initial state metric to the same value, not storing anything until branch time 3L, at which point it has built up reliable state metrics and it encounters the last of the first set of L forward computed metrics. (On Figure 2, unreliable metric branch computations are shown as dashed lines.) At this point the generalized dual-maxima process is performed according to (7'), the Lth branch soft decisions are output, and the backward processor proceeds until it reaches the initial node at time 4L. Meanwhile starting at time 3L, the second backward processor begins processing with equal metrics at node 3L, discarding all metrics until time 4L, when it encounters the forward algorithm having computed the state metrics for the 2Lth node. The generalized dual maxima process is then turned on until time 5L, at which point all soft decision outputs from the 2Lth to the Lth node will have been output. The two backward processors hop forward 4L branches every time they have generated backward 2L sets of state metrics and they time-share the output processor, since one generates useless metrics while the other generates the useful metrics which are combined with those of the forward algorithm. Note that nothing needs to be stored for the backward algorithms except for the metric set of the last node and these only when reliable metrics are being generated. The forward algorithm only needs to store 2L sets of state metrics" since after its first 2L computations (performed by time 4L), its first set of metrics will be discarded and the emptied storage can then be filled starting with the forward-computed metrics for the (2L+l)th node (at branch time 4L+l). Thus the storage requirements for a 16-state code using 6-bit state metrics is just 192L bits in all, which for L=32 amounts to ... Actually storage for L sets of state metrics would suffice if the storage process were to proceed alternately forward and backward every L branches, but with some added complexity in the process and its description. 9 approximately 6,000 bits. (Note that a conventional K=7 Viterbi decoder with 64 states and a 32-bit path memory requires about 2,000 bits of memory, while a K=9 decoder requires at least a 40-bit path memory resulting in over 10,000 bits of storage). We conclude that the LOG-MAP storage requirements are no greater than those of a conventional VA. As for processing requirements, it would appear that the VA load is thus tripled; furthermore, the complexity of the generalized dual-maxima process is no greater than that of the forward or backward VA processor, so that overall the complexity is not more than quadrupled, - also the chain-back procedure is avoided. Further, since the code is shorter, the number of states is reduced by a factor of 4 or 16 for the K=7 and 9 examples given. Since the MAP decoder (with short constraint length) is only justified for turbo codes, we must also account for the required number of iterations, which are of the order of 4 to 8. Thus a 16-state serial turbo decoder performing 8 iterations imposes double the processing load of a K=9 Viterbi decoder and 8 times that of a K=7 decoder. Minimum decoding delay is set by the length of the block or its corresponding interleaver. If the processors described above operate at just the speed of the received branches, it is necessary to pipeline the successive iterations and hence multiply the minimum delay by the number of iterations. If, on the other hand, the processors can operate at a much higher speed, then additional delay can be much reduced. 10 a final node Nodes Forward Processor Timing kth branch received symbols Y k s' s 0 Trellis Trellis j < k (k-1) th k th j > k node node t ~ Generalized .... Forward Dual-Maxima Backward Recursion Computation Recursion Figure 1: LOG-MAP Framework ISL ~17L 1st Backward Processor • Timing 1 4L - - .... 13L - - - 2iTt .... --.= I.§l.. _ - 4~16L - -...- - - 2nd Backward Processor I'L- _I~- -3L I'L 6L I.... :: ::::Jrl 7L Timing - - - - - - -~ - Decoder Output r1L 3L 11L 4L r1L SL I~L 6L I Timing Figure 2: Processors' Timing 11 < Page 1> OAG FlightDisk - Worldwide Edition Effective 3/1/98 thru 4/14/98 Direct Flights Outbound Date: From: Newark IntI Airport 5/19/98 To: Washington National Airport Time: Airlines: All 6:00a Days Flight Depart Arrive Class Equip Stop Dur xSaSu CO 301 7:00a EWR 8:12a DCA AFYHK 733 0 01:12 Daily CO 303 8:00a EWR 9:23a DCA AFYHK M80 0 01:23 Daily CO 305 9:30a EWR 10:38a DCA AFYHK M80 0 01:08 xSa CO 309 11:30a EWR 12:34p DCA AFYHK 733 0 01:04 xSa CO 311 12:30p EWR 1:35p DCA AFYHK 737 0 01:05 Daily CO 317 2:00p EWR 3:12p DCA AFYHK 73S 0 01:12 xSa CO 319 3:00p EWR 4:09p DCA AFYHK 733 0 01:09 Daily CO 321 4:00p EWR 5:11p DCA AFYHK M80 0 01:11 xSaSu CO 323 5:30p EWR 6:43p DCA AFYHK 735 0 01:13 xSa CO 325 7:00p EWR 8:11p DCA AFYHK M80 0 01:11 xSa CO*3357 8:00p EWR 9:25p DCA YHKBV ATR 0 01:25 xSa CO 329 9:45p EWR 11:03p DCA AFYHK M80 0 01:18 < Page 1> OAG FlightDisk - Worldwide Edition Effective 3/1/98 thru 4/14/98 Direct Flights Outbound Date: From: Newark IntI Airport 5/18/98 To: Washington - Dulles IntI Time: Airlines: All 6:00a Days Flight Depart Arrive Class Equip Stop Dur xSu UA*6543 6:45a EWR 8:04a lAD YBMHQ J41 0 01:19 xSaSu CO*3487 6:45a EWR 8:15a lAD YHKBV ATR 0 01:30 xSaSu CO*3483 7:45a EWR 9:03a lAD YHKBV ATR 0 01:18 xSu UA*6371 7:45a EWR 9:03a lAD YBMHQ J41 0 01:18 xSa UA*6422 9:00a EWR 10:17a lAD YBMHQ J41 0 01:17 Daily CO*3485 9:30a EWR 10:50a lAD YHKBV ATR 0 01:20 Daily UA*6450 10:00a EWR 11:20a lAD YBMHQ J31 0 01:20 xSaSu CO*3523 11:00a EWR 12:20p lAD YHKBV ATR 0 01:20 xSaSu UA*6579 11:00a EWR 12:20p lAD YBMHQ J31 0 01:20 xSaSu UA*6555 12:30p EWR 1:45p lAD YBMHQ J41 0 01:15 Daily CO*3491 12:30p EWR 1:50p lAD YHKBV ATR 0 01:20 Daily UA*6481 2:00p EWR 3:17p lAD YBMHQ J41 0 01:17 xSaSu CO*3493 2:00p EWR 3:20p lAD YHKBV ATR 0 01:20 xSa UA*6535 2:45p EWR 4:10p lAD YBMHQ J41 0 01:25 Daily CO*3527 3:00p EWR 4:25p lAD YHKBV ATR 0 01:25 Daily UA*6451 3:30p EWR 4:55p lAD YBMHQ J31 0 01:25 xSa CO*3541 4:00p EWR 5:25p lAD YHKBV ATR 0 01:25 Daily UA*6590 4:15p EWR 5: 35p lAD YBMHQ J41 0 01:20 Daily CO*3497 5:30p EWR 6:51p lAD YHKBV ATR 0 01:21 xSa UA*6457 6:00p EWR 7:25p lAD YBMHQ J41 0 01:25 xSa CO*3499 6:30p EWR 7:55p lAD YHKBV ATR 0 01:25 xSa UA*6324 7:00p EWR 8:20p lAD YBMHQ J41 0 01:20 xSa UA*6461 8:00p EWR 9:20p lAD YBMHQ J31 0 01:20 Daily CO*3481 8:00p EWR 9:25p lAD YHKBV ATR 0 01:25 xSa UA*6311 9:10p EWR 10:29p lAD YBMHQ J31 0 01:19 < Page 1> OAG FlightDisk - Worldwide Edition Effective 3/1/98 thru 4/14/98 Direct Flights Outbound Date: From: Newark IntI Airport 5/18/98 To: Washington National Airport Time: Airlines: All 6:00a Days Flight Depart Arrive Class Equip Stop Dur xSaSu CO 301 7:00a EWR 8:12a DCA AFYHK 733 0 01:12 Daily CO 303 8:00a EWR 9:23a DCA AFYHK M80 0 01:23 Daily CO 305 9:30a EWR 10:38a DCA AFYHK M80 0 01:08 xSa CO 309 11:30a EWR 12:34p DCA AFYHK 733 0 01:04 xSa CO 311 12:30p EWR 1: 35p DCA AFYHK 737 0 01:05 Daily CO 317 2:00p EWR 3:12p DCA AFYHK 73S 0 01:12 xSa CO 319 3:00p EWR 4:09p DCA AFYHK 733 0 01:09 Daily CO 321 4:00p EWR 5:11p DCA AFYHK M80 0 01:11 xSaSu CO 323 5:30p EWR 6:43p DCA AFYHK 735 0 01:13 xSa CO 325 7:00p EWR 8:11p DCA AFYHK M80 0 01:11 xSa CO*3357 8:00p EWR 9:25p DCA YHKBV ATR 0 01:25 xSa CO 329 9:45p EWR 11:03p DCA AFYHK M80 0 01:18 < Page 1>
Abstract (if available)
Linked assets
Viterbi: Presentations
Conceptually similar
PDF
Preliminary Program for Shannon Day, May 18, 1998, Bell Laboratories, Murray Hill, NJ.
PDF
Email, Dan Costello to Andrew J. Viterbi, May 20, 1998
PDF
Andrew J. Viterbi, "The LOG-MAP Algorithm Simplified: Theory and Implementation."
PDF
Email, Andrew J. Viterbi to Deborah Casher, April 1, 1998
PDF
Email, Andrew J. Viterbi to Zoran Kostic, March 30, 1998
PDF
Email, Aaron D. Wyner to Andrew J. Viterbi, et al, June 7, 1997
PDF
Email, Andrew J. Viterbi to Jack Wolf, April 13, 1998
PDF
Andrew J. Viterbi, "An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes."
PDF
Email, Mary Quihuis to Deborah Casher, May 5, 1998
PDF
Travel Information.
PDF
Travel Information.
PDF
Travel Information.
PDF
Travel Information.
PDF
Travel Information.
PDF
Travel Information.
PDF
Travel Information.
PDF
Travel Information.
PDF
Travel Information.
PDF
Travel Information.
PDF
Travel Information.
Asset Metadata
Core Title
Travel Information.
Publisher
University of Southern California. Libraries
(digital)
Tag
OAI-PMH Harvest
Permanent Link (DOI)
https://doi.org/10.25549/vit-m3779
Unique identifier
UC1960430
Identifier
VIT-001520 (filename),Bell Laboratories, Shannon Day (folder),Box 32, Folder 558 (identifying number),vit-m1 (legacy collection record id),vit-m3779 (legacy record id),vit-c117-1869 (legacy record id),Presentations (series)
Legacy Identifier
VIT-001520-8.pdf
Dmrecord
1869
Rights
There are materials within the archives that are marked confidential or proprietary, or that contain information that is obviously confidential. Examples of the latter include letters of references and recommendations for employment, promotions, and awards; nominations for awards and honors; resumes of colleagues of Dr. Viterbi; and grade reports of students in Dr. Viterbi's classes at the University of California, Los Angeles, and the University of California, San Diego.; These restricted items were not scanned and, therefore, are not included in the USC Digital Archive.; Researchers wishing to see any of the restricted materials should consult with the USC Libraries Special Collections staff.
Source
Andrew J. and Erna Viterbi Family Archives
(collection),
University of Southern California
(contributing entity),
Viterbi: Presentations
(subcollection)
Access Conditions
There are materials within the archives that are marked confidential or proprietary, or that contain information that is obviously confidential. Examples of the latter include letters of referenc...
Repository Name
USC Libraries Special Collections
Repository Location
Doheny Memorial Library 206, 3550 Trousdale Parkway, Los Angeles, California,90089-0189, 213-740-4035, specol@usc.edu
Inherited Values
Title
Viterbi: Presentations