From 5c126f0a5421a02bb5904a32ead646fbdbc0afee Mon Sep 17 00:00:00 2001
From: Steven Franke <s.j.franke@icloud.com>
Date: Tue, 1 Dec 2015 02:48:48 +0000
Subject: [PATCH] Add Psuccess figure to the document and commit gnuplot script
 and data files that produced it.

git-svn-id: svn+ssh://svn.code.sf.net/p/wsjt/wsjt/branches/wsjtx@6207 ab8295b8-cf94-4d9e-aec4-7959e3be5d79
---
 lib/sfrsd2/sfrsd_paper/bmdata.dat           |    8 +
 lib/sfrsd2/sfrsd_paper/fig_psuccess.gnuplot |   16 +
 lib/sfrsd2/sfrsd_paper/fig_psuccess.pdf     |  Bin 0 -> 23174 bytes
 lib/sfrsd2/sfrsd_paper/ftdata.dat           |   10 +
 lib/sfrsd2/sfrsd_paper/sfrsd.lyx            | 1949 ++++++++++---------
 5 files changed, 1027 insertions(+), 956 deletions(-)
 create mode 100644 lib/sfrsd2/sfrsd_paper/bmdata.dat
 create mode 100644 lib/sfrsd2/sfrsd_paper/fig_psuccess.gnuplot
 create mode 100644 lib/sfrsd2/sfrsd_paper/fig_psuccess.pdf
 create mode 100644 lib/sfrsd2/sfrsd_paper/ftdata.dat

diff --git a/lib/sfrsd2/sfrsd_paper/bmdata.dat b/lib/sfrsd2/sfrsd_paper/bmdata.dat
new file mode 100644
index 000000000..5ea0fd452
--- /dev/null
+++ b/lib/sfrsd2/sfrsd_paper/bmdata.dat
@@ -0,0 +1,8 @@
+-24.5 0.000
+-24.0 0.006
+-23.5 0.046
+-23.0 0.250
+-22.5 0.631
+-22.0 0.900
+-21.5 0.992
+-21.0 1.000
diff --git a/lib/sfrsd2/sfrsd_paper/fig_psuccess.gnuplot b/lib/sfrsd2/sfrsd_paper/fig_psuccess.gnuplot
new file mode 100644
index 000000000..1fc341690
--- /dev/null
+++ b/lib/sfrsd2/sfrsd_paper/fig_psuccess.gnuplot
@@ -0,0 +1,16 @@
+# gnuplot script for "Percent copy" figure
+# run: gnuplot fig_psuccess.gnuplot
+# then: pdflatex fig_psuccess.tex
+#
+set term epslatex standalone size 12cm,8cm
+set output "fig_psuccess.tex"
+set xlabel "SNR in 2500 Hz BW (dB)"
+set ylabel "Percent copy"
+set style func linespoints
+set key on top outside nobox
+set tics in
+set mxtics 2
+set mytics 2
+set grid
+plot "ftdata.dat" using 1:2 with linespoints pt 5 title 'FT', \
+     "bmdata.dat" using 1:2 with linespoints pt 7 title 'BM'
diff --git a/lib/sfrsd2/sfrsd_paper/fig_psuccess.pdf b/lib/sfrsd2/sfrsd_paper/fig_psuccess.pdf
new file mode 100644
index 0000000000000000000000000000000000000000..daab27079f419f8865f4abd461f53cb11a23c8ad
GIT binary patch
literal 23174
zcmagFQ?M>P&@Q-a>}A`wZQC~YyKLLGZQHiFmu=f#^UZ(GnVO5Knp~v1(@8qj{nV3-
zbjTD%#p#&n*<i@#mqylLSP2;k?ToDnd3j+NWX)_XoGl4i7}*H_SA$^?w*okuITA96
z1B{%_M9oa>OwC~U`C*)#9nFkvVB9xS61(Jw1>wX#y+fvo)3r7qZAmook;5fOVe%*G
z!;RgvL_rPWC{RGO#e`Wis!XO{V_Bf){Oy(Z-COlqG!r3(a~P4F6%3`u_WJ8vCxqGp
zKe4mMZg5qXRzw-)y|P9FPYQw|mu8g(WDW)W%;R!d4Xc8Rl~I$-dDKzE#3kVhz11T`
zJ0jMlGAbrfa8A_6^u!Xu0*1Lj8kQm8pR%kC%*v(FSl(?_J5;`{bF^}&SAmn@NUsyA
z0_w11pFe60>~IjCy^5j>I(K`_zwRZnFa6dj7(SyKTavx+dwaSke0BR+Rqdio!!(7n
zebE<pQXYZvq<1UPnCPqp#NzA3pVqw{T8TI}q<S+jakCK;0v0ChiV{uNQ#6Jf^9eDq
z9K4v`_6CMfcNsXr;w)gyY)$`n?EaJfi#rU{|118g9`<I044MkY)@CNoFbpa##?JpU
zB5vns^It0d>;Gp46AXi*s+cDIf4MP}H?lD!q@-ssx3Vy>cXBZ?F>`XFv$8dzGqZQ1
zGqJOEHFI<}Go^F3qqjFTr~2Ou6^$&+<Xvox|4Z!u*-OgS+)mWW#F>!uzw;==FbE6V
zxfALz{-?08G7>T~v+KbyD4RLixj6pk;eWuQ=xAr6V&+V!L&)$Sq6q)9i@7^Xs5t+J
zlmD?Ra}aX<&tClhwf_fOOw3H||G%ipj?v&sCE<XZxkPmV$@p{xkwD<Zo6RZ*C>Vpc
z26gl{1eH)#Jab$6f)Kos3e`W&;oCYOzES+feZEYk_4@tVeRi($g?{76{xpo}RDQ<M
z?T-FzivN738MI}d=KkHd)v+e~cXxXYnl39WzNXQ(F;o+orxcG@G*jd@a|Zd-((fle
zsHkFH!O$8f(?e0h2WKRV2{E@+Npq>T8)BKc99qrPX*Jrw=&t?r@P%V-Vo9DlI@cUY
zB7>%2k)hb|ha{yNP$y_sp#+xoj5k9jwreb;;8N8@sd1Zfd9f@#jUHGfkx$EB?%3L0
z)b(mq>F}k>!V_uy;+$G#2Fqk_bE(gwnu@K~puIbvZA{<08kl>|ZlP|wL$kV+XY5lb
zT-#FicJy;-Y04wDDn@9Ue%m0)(0<wOV$8@KJIE=p%01eg&+A+8YGJYLUFb==D2EX(
z#f!QO7EOGHH)H=8c>d>3_&KHPg1;%vvbuZtLKe6(w}1t$uO*PXD0F0><{7cJ)O%kG
zRef8>X&FS7P2`lySLT^^0hGnP<ZEzyDQ``NRU3Hx`~zfBaS7#4XW|U+m}<sU8LV5;
z_qcX)?urbXhJjQq9YmE+#Dd!QFZiXzz-8~tne`-rCpMAtw^0rhIgImpfXv6M0^{D^
zSgJYX={$v!ll5CGEI$Xi4eUUjdyG}j-y(Vqnv;c|?8A8WIy0;jlaApqX2E---`*B3
zTRh~`P@J@i6=H^iI-4iiQT4OkbtszLajGUgEfwO$@o!@LX{SQA6a2dI77f!8V46P0
zSLuKC3Ez{vDr8R4&%_+KXlT&sW8gePot*Ad7$<dxch*IZF-<wM8h0i*#pFwip7LZE
z0>%7kQ`j=MzE)oetBVTz1&sH+CKJuf*Ij|y?JZIUyvM0$>ie@^8W7I@ZkBg+wd!01
zht#3tVLAGth#k0$=uRD>tjr|Q(;myzmC=`(h`inC?b()PH?akZ#MBk(ID7e)%@w?%
zvS>F3t~eM8EZ{0fLy@!^Z%BdC!FrSg5+_U_j_M5+<Yu|7|ETLxNcs1=iW1#9c+4Tj
z-2|-z76O*HjW}i|TW)j*{=C;`DdrzoafIM_K$1ExeJ6BVqp6L$%ru8;onJWW?Z6{y
z(q5kiZ&?vAsj$);3&sCE0h6Ad)L86@=6W&GXpI}-nY`jJ=Q#s63f@UxuP*%8UUd^>
z%PU%xdHXapvFBgxo^fYD%ObUEZ*SO!+19Pu;en|^B+Abo1}`;gvti!}?3~(dt)@1p
z$NG=hanGbl!8^;+y%LBBAz!}CGAD?rSO(M&(ADEa2fIlqCgGMtsi`!25(-$r!p}0p
z=&~|-(c+;ii=Lj6e}bLb@AsjL$1_--&e`e(sw}2)G1P5Z9WNsR1O?=P57s4g<6wMv
zYa6qOx=qx$s*zubanKbn4=h}R3Q^>b2xW(^0~^f@(!K&9;;Vsa7*>|JI_=SvuS_1H
z%keaW8sEv1*5Kx~n5)!WpkIqW^UD-GoB1r+1L)B72UySJ!@8>?d|P06`|(;WX<dD#
zVrt?G2{xIL?%ow$Q`|HP|8K9gt|(JiNiRXU*1x@8A2~0dF9POl*}4B8B+vZ+V)_4d
z%Q6viF#kus|4U&eWa8xFV*WoW3nAnG5eb>N*f{>zb^QNJn;U>mC;K`%bT;fwSKo#h
zl+9L~P5uU(O-=_#<Nsuyj@xN(7K3e_wp>5<m0EqT=i1t`s?2D~>77}zk$(fp5wQ`u
z39$LJrKD5C;}Z~u#TEfXBq*-TY|ahMZ7596OvfPQS(!k|a(F<p(?I6p;^dgj{`EaU
zWl1F+A+Y|7=@+{~{+Tfa5hXPxD1tLPqdPN;YasoHCnw~4Cs)$9N0So23JHxBRQ)4^
zsD|cNCNO_eHRh9(Q6Lo~rz${(<*sFO;B0_kYQ@=8M}e?pOjLL*RH*$kdQkdL1Q7by
zc4mhk46?J&f93jTXO<?835?C<Us{2*l+c8jJh;&O%Nc_r8T;pF!3at26*_XFSXKor
zRZJ*0{ahqq?cejvOx^^h&iqz>8|CqT8_tZ<(}Dh@ZF(RQ6(<=U%uv5`aw`jSM8jW&
zwc+Lcz6w7muHPX<!S}dORUj0VCcpVwc6P_m)>0s8BQG6D4Ga|u|LUHIiX=S2iJg`C
zn?6br9T}XtUxTe*A<0h6pQ51roOgjqrXLE^b6WFrBkMxL^M|-4^HBC*$*0@)&U3#P
zv6ZFa#pM@)=hEM^`?=W6was<+pFFZ(tHWJb=5ZL9igK%kFFT;09P}2JR*r^d7D&pj
zucDHIq={dUUwIl#?H>!zADNTBe_)0meZAEMQAs6`f>{Ya28RQ0b+>(~H@{-g(Cc3A
z|Ck)?fzCA3v4CZ(s{ugr>gKz@7<wie6cj2vX@0Oj3Jkx`zkHIVrTC?zjDM$IMz;pk
zt>_BSd<(^zQubJz{y|i-PRaJusBCj=jHd>nlYfM1aK2J=zTeotvGm2byD_+t-eyI>
zAIk2>Qjix#47#K_=*vh_&wN|A?V!Q#Tns(e4lLE%#2okA65r@DudITgl~ZUnInMnp
z!JTqX7|AGvpZt9ZAh8*%qvzd-P&rr5H?{T|%DDNrL^z`zjH-`w-*;0J5PS@IJ-8ij
zbg6@?{^iOE_s`p~2ynQi1t{xEA(VqD5CJ}Y0K04uNs>oU5FrgMnuLeqU}q^3a}W`-
zM=tX~g97y77kC0cWMNZlV8TmqbIet6kBEXMvgjRZ&RuoR$<L~G0(Vejh;fiFs1-NM
z7`|gsIWz78oAoj$Ul@4XMd771S^3!w${fJj!b*PPkS|SW#)dL+=oc3vw$xF}O~@xL
zWPVbKM#yc^L#V&Mo|hEb_|>G-#UADc{m6-NlR|Qz=wqsy&%1bbK^no18p0uubR`UM
z6envR!Kn+{)Ku(;$t(`}KM1<vR3y>=0$+yh#8-G)QN|b{spejs%J?q;r;o+bWA<?_
z0oGal8e>);x1^v#Bs$<J;z3j{8~N{D?HOF8s>(WsolM0{bq@2(8SU|h(ufVzFTF9Y
zo(KomC^BPXT0v*797;e|2>OykoZh`_l3ma$n~5P;nj&o?_mWGi1_-jM2!2MkFyJ^~
zXZ@|E3Z)6DJ<&egea)Sx`@l3Jh>EtmrVkfil?P-Bk?Kes<2=;NWji~QRFUF^a9i8^
zcmqvCl02BH`IElUlr0DO<o0vXmSr?#9<$nRgPG9lV%MClk3+`hy}&%8@W$!)u?>`z
zDU};LSx;j8U+8)6;TN30_bNZbTzH>}r5e+|)cf=rq4l}`JS7M!St5_JC_F`jpQ*30
zbPKvRqObY%^6Avf&{De}j6Cp@lkC`AQZYjypNW+|8<NzQ3}?7XL74_0ASFm+26^ep
z?9M*p$folf6_+;PmzxiS30B9mO<4-iuIQ2$F_30_w~54i(!mMhEwE`ey2ar97K3|7
z#!`cAQ?c6rbbt#`#vLVQ**TF7Jhw!Ne<k7{83hyV>u`y*wN?XgO+qH%y;R1`4~-^~
zVtFeR)L%l)XAJ16s59bFyXtP*V+Ci5@Sbm^w_-WSo)qz8ZrQ!fRnKkUd%F@{{kR>)
z$NkU)t&r<({YMU~(?<(q#!d%Jl2kcP6V<Aj=4z1Z9n|SzSS3$hqWZZBMT2<`M#)ao
z+|#5GoeZ8O39<k~@+)_zD`f8>>=-{!fez7slGY+~GYgG)Zs~_8aJU;jAOV2vvnTXm
zo4_UmSEcWUlp7+c?_O-hcC<@+7id)5z*&p<bnxs5iMz!QEg24gM3FLi(rZ3LL+;+g
z_SW0-lz8|NIeR^u4@7UpP)Wd;lCKEaN2f(8u*|<Lp#m5`ZJ0@=W5tbrWbASUJU#SM
z$0Qd;?$vlTE)IhkIuUm6fUjEQ;S2zRe0f3U_3@h1Fe{Uv1$$;sVAeMxqWcFF!V(vv
z5ZH!f#dbQp<WlJ8rGu&hH^ZnT^a({=pYmlQf97DXWBhBV_eWd&NM$r@BJs*{60Y}r
zYy+z&@-l~S&)LsC`qt3Rg8W5%(k^wT=3`YrelTTJA_fvkHFK!!R)QcgnD`Pt6k}d4
z6>(4_-JerMngXV26kA5vj43rlzLWrIrYqhCjPpd)2JYxUpjdSJZhUbeGz7NFt+mk-
z|9u~}imdiQ$T+a3SZdG>=Qh6!vI81C=q4|t44`i(t#1j?GTn9Wvrs0Ydz&PpC_U;2
zQJyE{v#=Ct$yQQKHr^#=9)XamlIOsfYow1E(ONTeYXy^HbY7diFKBaUQ6W$I)QAOY
zdm3lCmbul+J;dd+JQlU?72}~obBwI>aZuEt5c|Hx<k`|V_vbaDlQ?c13ZQx~B}%<T
z@fD@%Zn$tB?|UNa5hW{EFv7oJSto>#pNQo)F$jr8TQjL@ZfAkqXghGi`m=<q3!EWT
z5fF9K-*S$EGb5_S!BrFxLCVhl=_xd0^=`r(czPzq{*0N~Nnq=~(-1~}6QwBG4<SY6
z+7RqbAuR<dKyg*O5IKJIRa9!k%R9X8cjIk9Th7$EnK-_ofrfi@evq|Ya8Y?;fR!UT
zHUDLx2u!dDI5ucAV97zcTumlRsAw>uDugdbWOVii!bp}XM_aGiTDGgBAXZVMJ(D?(
z54oPu7LXs+I>Q2<pr+SUlFs46R8K-}<F}1tjmXS`$HBeBmxR$oybA)}F4UTJQa10%
z<S6%DNw4nB6@;khkn2VHErSCqhk6`X;_rbdgDhoi*sF7B%edGyjU5`y-aH`wv)hAx
zp0qkj?iTrSD`CQfg_+ugEabP8vd$UKY;GC^1B%G1?v&F0o%Xtg<r#(dT<=s3NMh=k
zTib6cPv>$G_?)m|RQdtK2xZ$mY=aXu>kppx@8pgJ$TOb=#(3EVwghl;iYJ4$+3@dd
zJ73D@+XbU6_E_PRuGdLhM?$O%jhL#H5ICgT*R?<e@!r7$>){Kh;9b;NQ{5u+QO}JB
zb7YblT&!~!#z1ojG%;1th=12YeHDgCZu4aY#`q>KWT`I58|cwdcUHEJvIct+zpSmt
zc-Df%4a;4qUs&maRWq!(^qu<1`Lf|hNAr1Gto~F-Xi3^-v5dncMd5!=u<s^RksJN>
z+6p=`t4uY=@@|j!PLIf!W42=SNGge}gF3eNd+9eFc3;Unr^)+t^A(ek<zG|_K{M3b
zv*L5BI7bE-r@mXR#2Qp2Zmo_uG6AhV*siSp#C5iz!+ZC1<~ZiLdN{6q%X>tOi``vI
z*o@}Q&5OXGNN@fksh&CoHEwVSi`}S&qL}rg0|zh5lVL1stE1%6La5wBI&z_S^3Uv>
zN7E&(a!~yJQRnJ)kv-&W_=NT}pH=Cq1TJ%Iq*q>u!yt$U#%8nx@Mf<LoTt=XjJy-M
z>zM)03FDBvx!QSdPjF{x1sr=J5-n3W*m)rMxd`q5pj?%%CX^=<lsnKK8`U`N&y4ut
z`OqbAvaQHXfs{7DlIeH<?(NG7Xk>WY_1fBtsyCZ9U50zm4hK~;Sdu+Db=A66ntahR
zn-Bosq5#Ydc?`W3rB^EjhiPP<$2e&0P5jA_+la{DR0g1LK>ps9^Gc#Ap?{48c03?2
zyku>C@RNuO&N|8YG-F4@LiR|q2GEPO60-wZ$@wp}P8B@ciKV(ex;l5l9{56!<e>c|
z-<yx0wKI!WT3!lMmKm%=JrpDSIjqh`j5LF&<&X^Ak3UD`a;H*%=%csQLA2rkMkam@
zF68?Oj-<EFwzzn=yz*MI;jiw+HfeV%0<~o|t;y6B>z{GOAJEpf=(VbDvdKvuvb6=~
z1U+S>)jZ2sW^*h|TvIi)^Z5RkmNow-!k*~-tNu8DJ+$Ev<8}UGxMyv@b7ja9?wIM2
zNE}u)EOmf%xojzu&w^uDUT#3=RyqbmmnLSscAI$Qly;Z*p`pg*2Zs2J;fT?DTWL^+
zXFj?h7fb8I+1sDUbak&HvSAyeMG+3Pchj9$Qo8K6hheRfRQ}oE-Ux-_U)|=iS(^<M
zb8K0|y5nj6q6s9vNp=r_CnsH9W1b;a#t7^OtTA4Hd9+0Su{6OYmoY_R@em$oQ7lxr
zmkvaAX3)2Xi^!ruywLS)Vd7-9+jOr(<n@iu+X*%c0u2eSj5-0IJ~LQv;3?Hq=vW3g
z1nAyV)_@Sub*H*c)G7**W{DSa$aOdBP<|g@S(kzwwQvfKUPm<f#N7~UxEE;OaoYog
z5=T^CGmhv{L7zLmD96wSLsJul(pOhl$QRK%!@Qjm_b$=Y)Kk7Ce?y6-r&!ei{wQU>
z>;z?>dc!&5{fyU~k8}Ep>TkKlaPRNRq|qdA$m*Wyb51+LQLR2qvmCCY9VrfB++yfk
z&x02n0@W97xwLT6R+=m`+!<6n&P=ebahy+$ilA-`M<^&<8+AHyv{s057%wQ$(lMKZ
zBYiL$sWdVuU=Iv`T)z+bEwwA$Bcnra>1aKa4lLV853fzaU)yTpqqPq8Ua^q2;yNiZ
zu(#(p{$hVx@16lu9dxGbYkvLx^plK|l>Qj;kI=ie5Bu4AS1_ZnwOUEOD86+NcD1a<
zAHi5GBUMCNb87GAtF3U%vKs9`QCF25*KJgg|0BI@_}%k{>#QzmS6gEee)UGO){SR$
zJ4eB9{EeQj#&ZZi+FOqN{m({e^2<FjW~}YDf@@KC7!B}ksQ)Z8b}gNyq!Yw5G%CCE
zYgNz{+<o`G0z|T=s8%0X_^*Pr=-kuWW6K_=fo;$cPnY5I`Y=w~bEPY2&Dx)wj?Fto
zIM+E}Oh_-;Ce-DI@C;9sqkvoj4q3HtgfS~fHIX#dXvSpCGUmLHV?52QpCfI_qrj=x
zAP<U6$Ig~;bBU9Mic5L;pH}V-Q;-zxU2gKK)c{8sj7{hd?oVo(cokHeD$`;6bBb6M
zwc_TX8)N5GUW+{8z*RdmwkQP01<X_1`V4;}xnDvvZCd|)(iY!r0h36dl8vF1xrf>_
z)L4+OrY#!=>~I)BAd1;so!4rpEHzk%i!3YN=(%HG@AI$rm;lY$me4TuPjCPiOQV;3
z()~I*JxXYASPSmY8*}=DSU~}DOT_n8uR&xbf77RAVn;lGYFw6YzJWerT&WXVW5JA4
z4DBAoi&^i_{Lhw~yt1O^@tT$E7I&__sbDk-^M#WW9z0u%h=!;!?e;p_cfB~rf=-%F
z-pKp~5tOX1z~bC$uWW5jT6_Wh`p=REgza+N#mz~`qdLPRNb)LQ`|7+DY(p6$fpIFr
zb!k%#E*Ln6eJNF?0WwCkCG#YBe<&RHfTUfVPvB??xdi~WwD>UH5zFAQ-{Zq1fR*qC
z>$IiPML@K~sryu5{m8zZ8i*%4mdUs`u|=KrsjoZ6k5pMcpX)VtHHg2`kn1BTAIIeF
zu1C$?x{m?%xyldv44wvlcXxHtf@f)m+!NHt(%0ui>-E!Eq=^Z|*O8sd0geG8qg&Y?
zOc%O3&I!?c6*?kPA-MOG-o`hnDuRz7bw5fL5{GeaVOOjdYQXgozaUcTnUr|=i_3Q9
zuW6a1I~E<96EsUx?=tw#xxcJ-KIRY+IiIWN2^&GQ;$P8$5k#;GGhz+)-Gl6kYxA0q
zoa2JKN~M1L3JICi`rdCh`I4>#8{$!_bq@F6WQHCxvF$NIaH!V47AjQ~H7jYqVb)*<
zQswX0?@r7qSQ#X&zZ+1#8+!ZrnQ9A|%6W_O3XU5ATT<*@cD*thY4o=JnssHu4K$*N
z^{vtOLhi0%1ZnYObBf2d$^G*c9*BBhd7fNMs3IxF`TOa&RUSDazbADfxfem;wNFwU
z$#g-xsnu@|1pKL-wXn|4Ce*pDvRy=QP>Cf+rnLwRWXZt?p?)jPSf-9PEZ3Wc6~0~x
z&w+qE_We`ZR2vBohkv|F%N?sUah;`IVK3FqQ^?pxdHq&sI_=J5anO`oeK1#rash~$
zyVf-~Xg|RrJ##=sAc{`&MUAimxL5X+v~D5<kMK?^ssTYgiYsYlBJ_C}lWKDCJ*6sf
znm_qV0TLLcdt3A~%|R_`9kTQ{lymz`!C?8+c{fd5<0Tk1_a-91$J4r7B!B+FK<*q`
zY1S!s?>P4?eHod^%<^X^&26!_Bb{{pu){TA7ZMd3ozCIHw<ad9t<vR*PoC|pghr9+
zG}e!Q63V^RcMRpciyv4+WdIx8a7P!RzEK0ca3-$@TQ}E!&3bURM$so-e2phLE(m*_
z$Xrugj#Gh65Qz{StmjD|ubD%31@+GG@|VB8yC&ZhX)GyirYfYCc4FIrZR-qbC@gtV
z=c}@~**g=wF)_2807agWon_%ERr5u}b2Q6Yvp#U55`8|#2nsYHsc!j9(TveHtBVt$
zV&maE0m#|>h4x|HxKV|I$EYRzi<FmarA}d5lH{GE0S_$ZpX*pK-JGc_%#s2WILCqF
z-{mOOoa3f0)mOK+e9DpS{RjOAyTUWeZn4q$fUx+h(hB=9Eh=nI;;Up{aij4|_@t5j
z`ZNMu^To;zwqg*C?OZ~M^B$=|Es3nUMCT7WGiszZEXb3I7Y)~bR3&gyfSLsM>7Ty7
z<9IB2bKvrob2%tc{YDcvso))?vCzFZ*xdI#WC7-~E57##D`+df<^SH^=rbQv&bn$U
zlkRlh6yNPc!|8l9NH*@a2z;Sc=^a(wuK7Y5E87D*pOoq8#B&XC5a_$7D;^)8Ypk%k
zoZsoCZ`A`qkqYsyLXsIr?1LHvBCW|DV5wi&bR{QdvLIS4i?#h=W1iPD27SRJ**o{g
z{#d5nyO<eMTLDz1#?K5635#i+B|r4+w-O%~Le18OEhPpTA+3<{1JJNd&n`Uni+e^<
z*@2vAr&B`+Q9i=|c7sgHIyxBIsnX~saa5&P8EAUO)`rZ{df}7U8%Xq`ac&u#2USB*
z`9UmDKunp}NXavn`IQ6MDBbK0#4=K2>|vKPDWx>m@l|HhA`FXyAGn!U!@a<$iK>jJ
zC(6;TU=%1yFdUk+{<bPe{svQy{T&F4uuh>Sgb>8M`D$+4RBr37q*i!k(wx(AzsIK*
zJH?LW<2Z$s*3yl<NSSLDdr{K+O-3&1)T$aaD(u|od0tQoZKMO1`}ItZWdp^z_T+;6
z!CCZQd2QGtK5i*?;QNogHh-f{kb$Y52`6YlZ?0PcJ^OKTSQ&~t25NS9?ljI)EB;;V
z1RM_<Dbfr&tsyzxHumpRYUOvWnFuQvNRpg01t-_4K`_PBH4_Nm25=K?Rfr>f8V1a-
z#61;i6hF|-1$TsXSi*9b<x8v@X3AMBM2okq^nB?$s`ZzdGI(?mD9Dx=pg*tL$Ay)8
zEeid?$}sU$O~JD<zsg1JwjP;$82!Z%LZVb9c}Tf;4qpte1h+FplM}Kf>7C)(%I>Vk
zQU|Z}3IXxtmMl0_N4;Q+BC+zU3PSF_{IkrnL(ggCVE)tTDDdSp6N~j{pSHm*Epj4G
zy2UN(*Ztnu<2i#0$;+OsFaodJbzk9_24==iL1YBxs3zNc7`>$pP9`<6i>47c)=`N>
zp;+8cW^t-(zHgr5?>3^<;6-pL>eRhtCE@tF7)_$2FOYn@0&k7Ib?gwtJ`QQu(8%)H
z#gxA+B?<`(5a*`!_=$Ze->K*g-?$92>7s8i??%x`Tmv#2`D#+QEZGNL-<T=koc7GP
zZQNnLui131c=F1w#N#x0Oc#EPle`X7cwGA_LST&{RgL_3WXr(bQR_fo?B$r!Kpn52
zNqx<fjm0uFDjqj5ZXkn{%ER5@u*5okaZBe4>M!t~_xu5Qvxg}>NRjr6S$YI!**7?<
zIX&rogtYfYK7SMj)Gb+0L()yQ*ieOtzod4>Cb#6PEWU4#fS2~6BuxpN$24tYa}R&1
zj1LN^sm`SkJF0Hv2mg@B1Af7cEs%WTBrj+9W}DL(<>U=y0?wcLJWf0bD7<mv(-g_i
z{-0nuGJ_A3Z#MqwK4*0baYvWL`vsfCUkx&18cMSdzI6ch3n8Gi@8rI4a(#PtDrrc@
zvAB8|1p}C^&pY=+i)kIbk*%`RTjY;*S8}6DgJ0B<{#Wm_ek4YcIJKjtPL4(bg1)2-
zo|qhR_!ZEIUYG00;msO(mR9<bjEJ);pdVSHBiG^pU%7R5TsJ5+SlpSypzu36Y}=x<
z6%uJY`>`w<<Tn7n9T^{P<5?(IZg0D4oL9_`-^1@gG_GR&5p2|MDh6RNTaCaoAmX2`
zF|X(NbF~5MtFF=5bJ{S(i{jh>tkN2FTYxJIy8A&GMn5?H2GXIr<Hc?Ap^mok`Stf`
zVsJY5T-e=oNa-Fdj2TDH`y!ZkdlKP~vEhb@Nq|YM7b>m?PBK&PKq_y25sFw>DYjF0
zr{C@)@;p|=P_pLibk?@ra5EXX-9QExdkD<WcTO>hK!m@qu4YZd?w7^-j-_%*g*n%E
zXTXQ2){ZFNMK~1a36tT^-V6lh`V43{j@%u<*1=`2k^7F42;nC4w7Hy~&+#+x8<L}9
z1tavz*pzA+P9kdoBoB|(M*Xn6Vw>xAa0zUq^mY|;AN!k}C{NRo3zlFarpv^X1?HA<
zGHt129tz6u<QtU^Oe|^zZViW@!Xk^m?4bFTD~vmYMZd9z93g*q2%bO^O-8l4F!E1V
zYJj{%HrazL<9ZL<iG+Mrg5k4%(G=e8&+h7Rfya#%%y#oIRuIRup4{xuBI0L#4lnUd
z%Jo@?<y`b|$QnLzCd`@iD=p%+!!*P6Ivyn&IB=Q)H;%f9fO@7MEK@0>xaiB8qI@so
zy~h2neD~6?xy7>wM#g$oG*wuE^~w>zFq&XbTwA+d296M^kBRN-P1#566P>bW>Z>Lm
z?Oh9TdyvXHPX9a)dz#jcV%p+p@kjS+ZDA2Byp*b)i?^Di2P}2R;2oZ>LN*E7ksL$}
zbwX9nmvV8jLtt#4?e0xYRxM`}x}Zc|j4SfQ%aRsAIKl!<JjP4#yF$*xu{SmNQ+7RR
zrL`$3aG9()OM5gqqvhsS<59t^P#y=q;X*4ScN_P{;8ZL=Vcl99XoYU}ivi_KTQVqt
zPW3(RV!qGsez})@lmlPF90f~0wfmez#X~zZ;LvGs+`A;JJ#VwHH8;C)^FsTy){fm)
zHR4^35RQo-J?FB>b2f<g-1JxBpLRtq1>z<fAD>+ZvvfOSx?jPsr>~G;;bMA<h~;b!
z$l?6PVY~qxLv%X;yj`^7UQ{x(A+mIn8ewG)VypuNbtUAkk-L;WIj_<y>3()hJ6ToR
zu}av~z7vD^0S2u0SMNskM=ezHrGFbYKjLgB=g#^()HeQN;#E_h+>l*-$LL>Ett9FW
zGvAhNi@sSErdI{djL=Z>bby1kHZZi)uTTR)%350`hhBi8!=4oEYE}YnRExt|vKTDJ
zEF7O2r7&|>K826EGmQF<y&4>gBKPODz1U}qUdzFjSl0gNwH!Dt9_;LmBg<_34{`kl
z6XZF0uO}Cjap^o7J(bmnqe0VPEGpu?&p(Q7d!E1gTNe3+K|H{^;XVRd$qan;7Y3ji
zJJ<Fy6(+1M7mXN9B4<oz{gu)%M!Z>xRD1ru#jZ$v0v=wXzJKteXMT+_2*Phg>$Kn-
z$S@P`?(%2W+o$k>Q&9*<Gbj(su}i8mv2=te$Fwo_{hM7Pg+~nPrx}&j4)NV^3%NRp
zEgSN@c?KGUcJp}Yd*ayp#`z8HrQm;7u}&;V_R9Qqy4>7_)6x|t@cBVZ3k<_jNAsdx
z*?sIiVizBLnO_8HyLQ~;vR$=b8hJh1HyDB5Wr+vadD#f&h8dBb+`U7E;lHm-D0_;F
zWU`eNvS;6vg?MvV#BfhUbHdkuu>L?6Pz$sU#BElW&x`g5>!t2<c{0zVzXw_t;pSfr
zMdDy9L-4*>CfegwLXa(Mkg0@xYTbm@6THu6F07IGNJUlYAyVO?WUIRL7IhFN;7Uo{
zH~a+I>WEYA7n10S{FH*Cq1c>b7J%-9FrVvB*MyRxP_bJe8zV9gD4>fZ-M{|x6mXX<
zi07gickp)Rc2~IZR^asKUeqDw>Z?tR;sXi49NACbV6#tr<&Sg(!*R{dEk@0V>>-c|
z?P)DF9(0W+0_{Y?2E0zQ*VM4Z>%&7|x^B=-gGIn#e%-DW!vZFaXD!S513@u+AKkLu
zu+^YX^$XFvTSKm3&>iac33>(=gKijShxOJh<=!Ul)YVG;B~O<aja}+R>{R&P@@&&(
z%E)qsGaflH;)0P=yF?OJ?XbA{Nyh2x3E99rB{6#>5kS3*#FVqVonr_np5>DXu|yiY
zam?429wyZPI$K0@`Ako>giKn9_P8B2!uSv*{{%?mY;~o2a*H>o4rjioS#YVODdn16
zo%g+8>0cI%<%nL40mk|hFxEb>6q0bip~e#I6uC~9yDqb&@7X?c>i0Xkrt$!vg$#n*
z!-HG&RNSc1xMe0gueYL^TrXi40LH)s^McZz!9OXPA?SGxV%==t#KpPJ@eLJ(ZZ49H
zHD|YuSvJ!fk{oPieI2$@E$}I8HTU$M-<yzLBd(AuvcagMn?cK<{?=bKI|I&OX^YoC
zs6!WQtKQKra;aP-J!D_%BV9RJZjTgGQ3_|iP>_i*{p>uKS>b8KV_4%y_HptLaQ+WW
zhOQ*tvE9TZ#gjGe0x>ngT`d6{Hs3OhW_wgYlS&Dj<lwXgS3``fQExL&%+G&rt&D%X
z6t9USbyWfsgYJS%OKj8H2=Q6sQry>I<}Nc=_W-&+B4S-jOs3$-XICchQqBu3&P-%j
zv%)=gB(do~f5X(dg*0vss?T31i0<3?C%$fD-6B)n8LI0%IY@njK)MBCngHIb>1X!z
zCFrWy94my7^-mR9<t<?`$}=mEg|^{pT57`lrZ_>td`ilPng?Tl*#hB@75_GWu@g$z
zVEpt7m{dn(dm{H9G+6|0*fH_r*m2T_ep1FKyu6ChJDxHIT<hnuCcNPU^>zf)ZSAwo
z17&EYLnkjoU}y?3ec`By9DOb>PI;?9i)ynaYZcSE)OS4Q^Iv3kq^9nhF;&*mAe!Tx
z>vr9aJC@1+2wUPAPb)m@tN;~_u8MV<P(b%Rs-pltl;Uf#{L|G-17MS6oti4Yf;}5h
z4cB7(6V?{z&i=p{{3U+raGA&6KfME>a7%>nm+f-5-b>A773Sc9MOR(AZSuGuMa<}q
zJAs3>l+agFQ$&mYus|l>R!jB=6nL@QSjkWi0N7pWR<F7K?ENJrAajLLj^ATC*uV*6
z(nlw`m%eBw%&N>wka)sU*`ozxeRjQOhjD);8Y;jnrXUi=5jfmn6{>|>;ewH50S81T
z<GL0q^pVHV1uZWnYc8hFY~rdXS()6b;PO(cFJNo<OR{_!9mThjPx>Mhue{tMh?Ek;
zNTUFd3q{9jsn6kYbQNhzwrV>5!r_?oIu}mP7NTG%39-QH$^$>2>_5ICcV@iW4}(3E
z`(YCU?q%-d*BOc00nLh@(EkEzZX~Y7Nk&2+C|<SotvZ#i^Z*uVH2I6yZH}{PYvxC)
z{n*!x)-6vdKk28q_>Pe2s5i`+u!(RA7z}8Xnd=d6)4N^RQPjKq;Z|TK-q9)I-^SqO
z7t}O_s%f{;#QAyyVo3TH!$_RP%yM);*JX{814FH+HP4OCl49Om!UMCR`|fbMV_`(r
znH67he=Vm%f?oyC*w`FIV3L-7EYOhG-k)GoTVh5R^m40RQtOEm`j+QC?EtRK>ioBr
zoU6cV*>a+?%xXS8{~QdXy{wyrXv3`X4EtTEm1mkFZzB)c76mE7-~Ekbl`FiRcpIh<
zM`*5@*&1%GJQ7>sy*$v%-@f!r_O^AO^a!33J=_#pc?r}+uk*gIW0Oe22kn|p(>Jd8
zEUu(Jq`K-NQ4n*r_J|EZk%Aq&9?GqBMHQJR<tHX+5*X$ohL_-K%PV+n*v`Te9<GA=
zw6pk-`65cC*vQ8UAM+wNq=+yY%{tF5psQ?zXj@EjA&EdpkCE;1c9{6xk}6nbE)hW}
zQuq`-?>}@O9I0l9uk#(1$HprH;m=_|{W6jqC~S4=<m&<aKHQJQZ|TheWOanvqIK^C
zHF{09tjy>JXOAd1-LQ`Y_><o6nqqj9N=7#^(1k{(GDQ$OP^_{i2x?IpeF`o;$a;#X
zTLZ7v1UF#2vnS)cE--D*b?9DqZdufCvJgvuo3BT?w0E>#7{-`|@)aM;2SvH9O2Bqr
z`j`wFleqehn#Jn|cXR}|Ti<8z!aNr_CrXT8$6YKyK7~oHS5MNdSV3#SO|#dfLxLh~
zN8PoGVNSM8*$+(MIP}8pYu42`8UfrXzC9KlL6>9YQS~m?jFp$9xyM!7OzRD(0wg$_
zG_s3SO=KPBjJf}e8B=TllbDNbGuSZL4Zg*8!4n~p4%ce6mY?AS^_r0%5EhDa4BHKd
z5K}$Sgc7QC`Z=qu&f>DTH#Ofdj-m!f0aP%T^~`O43b!%`u2rlwbbF8ti`nE*)CNg+
zAJ#L68i*VD^uBr3%J!fU*YmDX8KNSNHfVk~?U}KZh%j!l>Zyy!RYK}5aZ`SM=ix!d
zkeh<MIn^^*Z57_u6f|HXXlbY|`{Y)Z@UN7(ZO{W@xB>(0&)RRLv5}L(B0X4H8bN~O
zzK_uG>g@rLEK41v)T<NQAlb>XXn9Gx*XslJ%;(q8TV@up^c_fI*{+iuz&UxvULimX
zYCQT*tz{5_=R~EiZ<W8IhuyY$(Rawt!jr9^HVIhGDcB8CIrK9_?feu$e-q7wlxs+N
z?W4HUjiK2c>w1x3q>V4f3DGalTHxh1rQ7Q(mB2F`&cFcnlg>|C+}Z#?2@Cj-t(JaV
zv?Qr!h6mgHT88sU`K(+vaC(#cvJl;-bxOJz+|M|Cg7U{!@3Zb55Qny1im==kA|HCA
z)nqWi`kj3xjGe^K-h^Y>M%b{xlY!Tr1v6a#KS%0G78coZ815B@0O7Z3JAUV51-Mt1
z!fr{R{Hf}<fmV0Kg9~0B(qHVVMLAuqzt_kO9OP`s|Fl(<yV7ODi9QZ-+{VZv2%^h)
z|K?Mggq4}@;bQ1L+;YT|_2@36rr2<$7^00Kf2?d>@EEFCL(BBahW>sttNfh){u`<_
zzQHg@q1%L0`&bv7XfX@Dl-#eNjU1H|I80Wap@FwLrUvKtqwD3L*2De=Ak=q3fBw|W
z9h3-0|BwshYLh-TT;S;htS5zbKa(~)PYc}#iib04@Rt}hgfdB>SgB)heYE-a%DNX#
zsGT?OC&I%jVpi=UbK?WaQ;)o`2}1u!r_!`Vkh&KQ#FW(Nd=o9@a6lM+-j%=5U)8f^
zMM?C)S|ZUkIb+x$8|a3*HnWR(y}o>@)vHYsZi<=O`l7W+uU%;3v)Rt?iaKtKmG$eS
z#86K<tqsata+xWyujR&ccRa?XHOCa|)wZ*Hf4r%W!f&;D)q~x_Z`y$jG{g-z0UhuI
z17f!;uhY|D?R2jOV-Pt0=&dB?2M0h)OD&UmtxER~_Ngx$TX9HlxS)uQGk=yGq^K?l
zYnZ||u%o!P-by5?_Y~W+CQq=0^FK$R32`1^)x4gMv8$p4<6M|62OVZ?lp?qP@g*G+
z80Tnqh>5NP%HS$aN=IXM>F`g`$szUMb3I-POBhx`Psyw~y&_Qq8V_pipb-D~^HW8A
z0{r}ajm;sf6T#Iu$AyCr0hqIPYsGFV6hz!%7T5DmNbv9CVAR^CunAbyiqQ~QOA@S|
z0~Mjuqt#B9YRls2!m>gI9i$O((#gg3{%z?IIH7wCvk>sVgS4W5Bib0!XF7<s=G-Re
z>B5hNj1aF~MVKCGCv)-p&3ZT*O)SBupR*tcjCX-+;Y37n*O%S^)z^)%`ls}7p3p{%
zBaVe%n!GsfG9vdmd++}A05@8Sfucd0?{4D5lH@KkPvMgMuUW9zRbyMC11kqXNEBzF
zIP{FUzk5^_JA{nDO9Vtl*Q@ipVcd;8gIE99U{!IM)Ve0>Sdbi0tfe;Ye^pkG!;3Z#
z$=%@J(q4M6kLd7r^*c$G7G=T-QjS0!U-m_LRdI`fW{LCb2eou2rjI=RSUIt@KU|K^
z@59@~VH2roR^C+<$}Yc|H9$(M+Ol8Bf2)&yE!E3tzAYu6qKQ^|u!t~8zg*ujmcPT4
zk*va8d)6&`oHMYB44D3HsVc3H_`DO_@f4MvV%(;Z*Sb_;&96=d`RMq{)2hm^@>2_B
z_2WawM1fHGOb)i`InbKMV3N4Vvt<j06v3`_<l9g>O8njr3)N{u7hK=qrYsF$UdPiP
zVL-8t(bMJr<0&Ag>q}~@t-@O?4rZ@uz&AN8NyVwa1Kdd`%X2WK;5RcB`r-0(QBwZa
zaHp7+gQ12Z^JZ3=WRk!~_Cw}b4K5(p6RjpV)TyKC$DV2}=W*|>o|5?fFpp#*rsAzj
zpP1e7Pds}TTu?FewIEXxOJL4IecSku!f2=aTjE5E(1<^Lf;P`;o>^cPPWG2<Qm!oM
z)bwYg7X?5Ux@wJ%ZP8$jaE@waN)*lqKRfE{AzN<pg$|k7C7?z-{j<z*$_5@~>}D}9
zV@T2MKzH0PXOW@!nLx13JWMF44fS`Foy^gh%apBethn~~3VbuzNC0AiFT&CxSVi!1
zS9B<5<ZN3OnP-b`<f`>)KZAJaLP(H55<_<D&by&ZV6%t=9n{?>s?{CVgee$Ww{<si
zjViVubsMy3R=9eDbSST52UA5X%F9$ae}9ihX3iHVDY<=zS{}U7?9{r(Ir8wspjpFw
zJbR41<FtjA;X!Wl2If^e<9dt49?*p2u!6#X5ZATnI%#j?mDm>*10K5lg7D<HUo>@-
zM$F}_`l0ffh~qVD>s6>`$;m`Puh@WPhmI+noLe(nI1GK}?+()x$0&8EY#3Pa3-)hL
zaJ^X-Qd!dMjEHmGwpfW3ahZAD>3`M&Y4wfY?uW5&8+_!p@ZV`Ll;X*h%uDQZjtMo^
z{jyxwEDNb^(cBdq+uIXLtq+i5QgWGDt^9ShaVW9pSCbJ_*o;8c@Zt)Hpv=x>t+9nM
zD;WH=Gy#qM5lv8rM+<?w4O8EG=l|onl~omC@vT2X@KZSlAOaUJ8X)bT5t3sZR|k4w
zx|=RDQTqjP`eexu+j?bBRJAnpsC=q|cT4uc>Z^3a*3`il!q;!O;b>3J_<l7b0mE?d
zdyH19;m1v0So?<Wte2)}<mJKEjVt&U6c+S_W@<ZMo{sHg=<NJ4_SzaaAPZ0U!QWIH
z1Q~oHaz*ZOmD~gbT?)ju2uMNj_t!j?ifK&o&VyP=XgEbl_)7~L|6iHo=X#D8(E~LE
zci=TGn)^h=^rrBv=h@7qV&Op=uP1+oU{sNenrX+`-ks`Lo^*1kh0pFC7BIof;cQ_S
z&sZV|C`Mrl2VqMzwDWyT8qzyF@VXLwxTUGn$HN80Ob~?nijzo<D=*mNU19q3-|HII
z(%XZTiBvaeP_da|Okrfz^mjb9zj5O49i646HrnOh!FiS}#;X@VHucA`<@IUdEg~)*
z&6r--h_}kiO5nW|b}iBj6chrrIMzOpzjH1a%PAhLCwv}zz?f%2ZFM_)&k~qROF@==
z=EoSahL1~EnL$sdYdJ&+-Ks`XOY+QMnelfBY8O0tBH#>OtbxmR1FPYjG6Hj%^bSta
zTuCY<i2U=q&i(NqOhMUS1g?aCO!}opes=hxvFtOuOk(M%yMg=^Exm6d{9wSmYyst#
zT!^rwek6<1-W4vs1W0Rql<4Ds#$AY<T#3~~M<7Ew1SokVGum3!;?Gb40cOIFz_CNt
z2~>C=J~Y|16?iGPRGzYVFLm<!*m&vi;y{Y4>c4u?9yo7F6KL8%(OQ;nX4SQlu0bpN
z<|pf48SF_FJL1jxT;Lfg(Y@86jUVpUBc@iapai?E;kTD95P0#T-lBqGurGoed87L|
zb13l??T9|xA9y6I1`OqGJ#L*iBYPdbadY0_Bh?IpSBV9EX&I6@n}YvtJv64T#r4}^
z%EkZku%>eG?C3dP1alFf3>Js;&e1DQd5tr@8NRalLj}Ltet-hfM8#IK1M$RZZ^9t~
z3p>3*j5r4E>BAg%C8oyvX*6_!bF=8*b|*4``U0|D(Rf}s5zpg@R<n^k9Rv?;u2qZ7
z=~cMNaBiGr4^q7g?rwnTOy*G@jhO7{e1(ek5kUv+aaHF{23{F>p;mLzkML@U@#QvW
z25ym}39V6XETxb%z)Ebs_ln5PFhqS^9OJ8}Ub8VJf8%(++A*JsFBXx>lF)YV<-B(~
zeaK=Lmng#zmE&q7G252&8wtV14eBzlx@=*Y(;54Lo(@qa;U>BO<)nMUm{CguNu-YG
zr?Knjm`n$UREeJG-yL@p1<S7N2H4OtvHMr^2}?t7hO^O1V{+p_G|U(dRS|C(dZZlR
zmA`|8SNw1pb6Sn_T7xwbO%hfBVjoNqxB*dJ<>V4a3#N@R5W_&WsG8RPxltMvbmE&U
zzkUM}iKp9l6s@JqKTY9ii;XwhM~9mJh$$L9v+oPnM!~eK<0J-s+M%&J(1^o;JTd|H
z)p%WS>N>0ciq195*q+XW9DxsD-Yu1pc6|4=bOaIq0{rX9Wr}EER|KChmb##Ldi3!F
zYoV{jgq}He;e`uJ|E*6rk~><O{jm|UpyZ7%hCsddB+`C5!R46G`aZw5L=cuC`tKtK
z(2D!j0t;q>$61>~@VmrUUI0`!>H2v6Jj-3=wPc|5lM*>p7!PfluhIu8W)@FyQxdR^
zhPQ1(Mq!CZG2#f5m><X<NxGWcY0zy)d9<8|%~$O#A$L%bWLfYg%nO82MCDI~n>yzJ
z9OwE&`g=31CK6ABF{x6uGqr4xfw*`@eLilKZ+ONWLTLOpgz8>_@|L*wShNytU1=GK
zQa*G5!j{ZkD3-N#BLls9PkB|2Wy!}<(s)GKkVs~R^!!S$wy0?XU@<*+T0rS9`Zk!X
zaTt>cC`t(95>)aDMYOi!l?dqk>ku86(%le_&TsZRoB^ohm17XiK<P|c@}AZC_-70O
zuOHQmpkT=}b+6#jvckE!fmVv>iJ@1Wbx?bta*JlYp%MKoq+!C(O}BZs<;_Zg>{HB}
z7G&eO8<%IUzqkfU_q`(V^uH6ibcI75$*~)l<6FRGRvHeQ!owXmb$)!qQ&fG;9>96v
zkFY{OvUbC*zR38!@xVOAi_25>ZIO#zITpddNI`VW{)e6$=?H1V#<D|>ue)g%^EV}h
zW0q!pH9l|Hnho|%6PmC_fnO&LyN=(^fe*yi{do|cw!3PJ-jS$^;v*$dd~h3v0@!Qi
z^l*>PpY^PCc$veaaZU~z^5y3usOh`hAVcVhY2>EKKL!YVn-YoT84s*fhWlze3GqfX
z)3zjM(XGPyhXex(+O0i&;jbEk3wujb0#Kb6hG#d>omE#AFH&VsNL*y3>q1}JcE{@z
zc5bh|wBpVcxz<ZjXi>v#*mBdKq`YCPR0pUAN^!!t@-7Ea>YhM|qXn#y1=tZN@Cg1E
zzNOcr2N2zq=>#2CV3}t%IE39OZ-W@se?v5|9{>1i?28y8NPqGM>T*3lkgaEB;OJ53
z|9Y;h2K#nB9Fqm(nJ<cZe6mo%7lZI)M{rd>H5YN96se6;={8zCGddw_Z5C%ibN_ME
z3_y!pa$CBlpasL|@TU>t4ny!*AIIRmDG4859m#H#e@bKOwj+Bi{vD2<ydn<o!sb&O
zsAat<AR^0l!4YE&KmxD9(zot$aK$(TBC7N0NgqcO7wr7>^pKEcW3{8aZ+3~=FCRN*
z*WLvu4s?g^vF4GPVH8@>$mm#;RdiuMDE!GK3)IIf@c}#T5m<9Az-m<#*q{F*T!+HE
z=#alaK#1@JI-OOspDtUjPz}$Qnhr?>ri|me%+zgXjbjx35(<@ZExYu3U3FJiqzVOa
zAy@z%ade;Ov;~Um!Bds;ZpRks1f7WZnPZ{VTVv&~N@6S^!K;QS&wO=h$_vMq_vSy5
zvN&yp7y!>KAD~OLySLluvYLRpwt?zN&^NcK0H3jdcDa6WJ&Lf)iE>Imr*%PpEE9o7
z9AKbtG#Gj$X#Pz?JW9j2nj@us6GO~d_sX-QK4r>Za_S!MSbfOM$qU5iJ*17TNl-G<
zFc|!ler~KxtkoRqt7mfV=rvc}a^#PXqVmLMYTgwKaG9LU;=~X)iBzVaU~23l`o~Dq
zw%|!FsA=GtApBg3zA*M1M1k27#HiT|%{x)@#OJGLe!{JBbXQW!mTAAuuu<1-z_a}&
zHBWLQp{S22PKULM9Y9z%x#rh1Cyk_<Hn#Jn%Z-ecSWx*+;)X6sg;}}+qLV~l8aEt#
z6O6YDa|iIzfG~rG(2J9Vq9D*D*kMGH3@iGQDQh@DSs-HDdevwfkR?u3o4<h)v-r?#
zrggaG@F)-7o3*=6Z6ROf1i&Y);%4X^hvo^q2ac~vd&;K8f-|&rZUiO_(h!ZPJ~%`*
zONEma3!+wr9v<pHwIawQL6;Se8jVOTaS~`u9+kJO_ohP&_~Elk?aqXmgP#!jI2T4Q
z2|LRjU4LwDSQ%fksLszRoI<4<;#WRE(w2Jej6hpFuvx_nRg7fiEhHajSoNVAiS>e4
zwIYQ805o}uNUGhg+O_#iC~-BB@cjI~RzkBQF4nhT`4bi6*pZEg@(J+5#N_lI-PjLx
zuUAPQ9sgY3BI%ax`u6+FH3HTXIOy4VxrrzoC~gtPpN!Y|vD?m6s$<w^+Bu$hQ$OxS
zrQ60ccCp0}CM&)!#%pG-GKE!q3?EHMle?umj0%&WwI818yjeW#gwT`qKUm_@C`@GZ
z`YSl^pMGlIi%i6@&K!XA=|i{`-D?%CM?Hy&!b@`}_wCcnO27?K9QD(*hJ-aD5{rQc
zyD!^m5aR#MW0&NJ-dvNUt?LT=K@O7{bk#$ia^4S4?+%`Ml@bi3mj^sp{uvJrKZc2q
z_@m!P>C@w@kAP+pq`pd}s`MdjV&)kOPIVX+{}OU&_kT5VmqBqgSp$FxPLSXbbZ`j+
zGw9$tFgOJFK?A{Ma19>ZJ!tUY!8K@b4G<tmuwcQRu)Hf@ZPjkoepUBR-#)kc)T!$8
zqx;sQ+#m$wI9Df+Ji8;cob2$<2&&I9w`y&7LfT)7nd&H6ezn_lXl%ct=@2m4q1!ap
zRkGFCWH)|2SUZ&>lDOGA?+G6gptA_y&;ha}(>T9sQw<lVmu{q7XK5zzT<F19paGgu
z4P<=%dECd!BN1+k^Buo_6f<HhS<$rOJU(lV&8%zvkM8L*y2)%y<8ed#P4(*ZRbHE^
z`B3><@#~>T{{b!8$4QLiOD-Lo!*AD?yWR6_rP{zTe|NvM-8+#|G>59r#kgIYob3Z8
zRYe-aj{;`32dsu`Lp{S!8#}RUgnIh&?^SXG2JaX8xk;4~gZU`eD49RWC2K#gB&$-=
za^u#?>=Q)62eDuW<h-pb>0Pbk;}>clc&*<tQR%~^6zgz8x-l`t3+uaD<~fZ=Xk6sX
zOXB-!C->P3zu@=gbPS?tO{R~ZAJ2Io$#e0k?&0$&4I&FnVYEg|D-!i2lUbx*3e3-V
z(uG_^RjuE%OuuJ3;bJ^j+nbBd+J=W=Bdgg~i6>+Cn#+mA6_gI*8K#q-C-4m~6m3%5
zQ<kX!70eb@RDUBv9mrjkkR#@bwlc!P)`th-FD^c&4@(#@wztUl;=9a3<P7X!NK7=%
z>ZR(W#cG@~-X%;A_4$_pOYGeZ1!zK2Akx?b0mbMDCW@9XX9)Qz=W$kIW10uc_|x&^
z>LCuorYkflcfKKqBU|gJ^wsgI$Id_dIlEGz36aA~uULgS+DWRO89zO0ZJoOQOts~?
zmCKzbaX$1-woWk}Pw*fU9aiS?nn=fF9~&KUCxfu|N2~Wl_K~<%gSxy)DXOvklO#W`
zE?2~nC{Fk`wXP@&eD6LRhHM^;Hp_4$4)Dd=*!TQ|XpM+LbRuu{4R$Tf8jKQRWI<|R
zxpX>Zo7)+hR>9M?U;|je)*Wh)+IN0yyB8258co*Wq8~#a{k<CH2tSOlIOyx9VTW{D
zqtbcKzTI?-lP)fGIf*R$iPtwAmPpU0*R$&IYl`69jAD9_gim89Xjz~XgNk{&e9TH0
zZ<Z9_#{hxy%XGRX{?!gROx5RuF($t^owSxuov^OW%06qA+k%*4Q^x}{Z+Or4mNVxw
zgsCa^LQTaRIx!RR;&W1`xAiP*<>DK)HgY~d<m!gczjNe6wE5{G1pFdPacM=wX05-v
z8x*avcl-<*`8_)JQLA0`7`w-yuB$bV1PnWkvJFizvCy>a*fuGPSvCsj^%>xRSUc+E
z@)Z;Gc#u0!NeN<3TFvWco#-q4P!GT$liXrmba7)Nao-ai)az1B29b6#BC<Wi`wWve
zVFCRZf3|PNtTh&DJrDFS$P!sqR42Q#M9Z37xxVIkZI&ep(&U$|e@;qT`?J|_?~%lK
z0hcR|8%PS5S@XT>C*7ntU5d#VC}=XwcBHGz`YoBmx8BkTm4{atz?F3;W`n&N6bkCK
zf#Rg8(ccm!M0GFO13}>_uTZ><BqBb+6nce`*N3roJOgPxl)q#+XU7<_e^LsJ8e2{<
zK%YDU`UlaK5VKpi1e~rc9EOE#q!lIaQ0|R%2_K=KVkYdCd3>qw9h|@G`(*q!t^buX
z3*t}Cx#CyuP6MV7?jXHhUt|^6nf&|V)=qL7L5D_@3GXUsN|k>(63i}2+Bt_teChpe
z&ChtXZ_(wATm`W=9RMpFiH0>l=T-}qA0&JC^YWo?%N`5g6Q&C}R*S3@>-I;6n#)y!
zuY1giHNw}Zz1cMIbho2>vh*++ALQzt9Y#Oi*G|gwWkTNGHLs<`QlJWgMn70Mo2Pb3
zdm6{o61e3){iYx^!@xis3vUp+R&X&2LWSlBu_L&j&YWhdd9C7axO%1MPaG*rxavU_
zqoh!>(WC6SpJtwE{spI4_~p+F2FAtOdVKj_3FRm{2}E{MMUeDSXebG&Sz3|ryj6#w
zPp^5_IEu9f^*pD=bh2s)lCrnqJLp+J(_q3d1x?)(*M~0&me$F_uL5$4gwr)w03fZM
znaQxpLU}6F%Q(aS*r?68dFs>VqWcZ>pM(4IpSuG?fwyojpf!P*t5R=N1oz&`)>J%E
z+(pfqf!#fSmo9;;o8PtUpkYOKl}S&PIs2{PVZhSUg;uI1EnZydLgo8d1nc{@0J#~_
z)9cry!u)UFKr4&z$>fD+(H$_e5=@w>#3}kIWuq<}1SIGvb_^NuF0-(VJ`SRq9MxP2
zB~GR*5uhLaF&c?ex9ua#F{d6}M79WmYaRveig!_QQXwgex!!X=1lg;I;E-e0cmB|Z
z=>U!nAE(t~y41J!^pnw9JKOaVy2(~^n^^4zi0=5Ror@LKf@(-4SiE}^-(*PDv2l>b
zHl;?M#@VO2%KB~D#-9sKK-$K{z63Itb|cMG-(*OBa$r=8OR@_mmdxFe`rzIijiu*S
zL2lwIPk}M5?0qYSn0zzGU^HfNP*#~v4~!wQm$mhIPmTMDUPZJ9_2WzP;ugUnN}UHL
z#KFOf_8X$WML2Gls2re0%;)v(?4L}7xVTrCAJZu^sjmw;Cxo&KdP8kJMXm@JYv>h1
zxWDWq>z&~L4EU05F}8ymvqdSuseSc`I*tuKC!9<t$6suW$8z_gl0^F+9o)V=_82yC
znWz9g9DLpXtKv{m9blQpCLY3$YIyN6$%4vASfMz-9=3|C+F*K@0+9sq<GQa9o%m{o
z+r?Kr1RpS6@b@=!_~5ay<---?SlVF2#=S<U*P)DUcNqB}*cPpwHPL};u?c4(IB8N;
zHohng?HO~f0aJ*?5vw+Y(c0Cl;dFxW=~wbxBo$*s+YgLwM?z)%3*e>ABKjD%*ucE6
z@rX(!3J`$8?A0lXutXmCytF_h)y(t~At8p_@Hna8&c}ChRgTr`S!`kcD?!GwDo4vs
zMfuNZ&Ug-MdUFHW*}m4^%N}>jm+OwH%ZVsKAGYl?JA_rP?;}3={q7x9De!<>raKK#
zUbCpk=kbdN6+IxF1EoYcOisdEWb7%k{M0myS}7aM4fk(SOn1ZP#`ezis6QcFi0_yN
zpXAmr8rt+fYcsx>A5*kPU!TLbv+qD+xYo{=Gf^rt-<-yE<49dR(4CS}`Vm#rO4<-0
zBNO)gO<SNTOkth9Tj*qOh*70PnX4l`E}eoisHjr>JgJ``A9(sk-*>+csK-dXC9?#e
zBg}*ULBeFZIbQu)+c=M-In<|#`=MIy_5ozPo1A!Pa4>ImXuu<)@G-Y(!1T)t4V`H^
zEE%Dk=`WcKLhN^qW|Ax7o%ovXJi34Du;s3S=$t>|-|us>MctiUKAJSwLQrcNs*r-M
zRT8q2hJWcWQnfBC_`#~Os1qu2E0cH~#ciX2`g}P3Qnc-OkZ>u6m93r_aIeH2GhMh=
zBCd?n)o3p={;YdjSgqIvjV_orXX4udD=G?62nm0NFBklXY>Ku3z7Or;H(4pn;J+uR
z6`kV##+C&}A`oDO_cvL;X3N*?u*MtFb0ntVHCo*b!{v}dZVnUZ>kToV+QM_^5-Idy
z#6Hf(sCd1#aS7XpwILHYJ0)8$7@=j3G{}1RVD{*cclv@Y?{b){A*I7nLa&ce;bMYN
z?=Nwyw_awxw4<qWn2|wz&o7+cXS)G){JXYxc&6G1RI)Ua@eaSWyt_YjSBk_Jk))e9
zWr1A=K#<Zn1b98BmrWz~x-O849mSP?4dPe7V3Ok8y6ug?5*hheS0Dfi?OWW}gF-&2
z+$@ONccGWQ&9G<2PTtb(Q;LR9*|_)5&~DxWXFln5ID75nMU$YEy9#RCeRE&4Rq$@Q
zW+|uYq7YVumwY*xTl}$KBaqtHK2p8c1k9p;oEFEUJ-Zv3D1Bm7qzNoms3_rw6zaN5
z$t(;N@rjG|9YimUZfNL9ZEfk%ihxsN!aexzj5TPhJRvi?TI@=D60b!Wb$FA;xcr<L
z-@O<!W6FLrAB_a5d#N$BU&H*CaYfC*mo3;-5@DD(6i?<r%@`;zhhr!4tkEl99=Eok
z;{N7tg8VoS!6R!!xlCpQj7_uq_}EZ5Ws@2ZIBtjnt9_m81nFH#)9DnQ+>qokm%+iv
z_$o4OSQ(u9oqHXRJD5ehJ*wr0lD!!vzauNnRAOC+?M(hRi<(jqbNl5ADo$^+KF+#l
zC^8Ys47!d*u#i_*Us*}Ioj^>J6U!3ysa=ok-D2ZSKRWnW=sL%T9Tv;P+w$+f;IF~n
zrQ%gbQexTA8IUNKZ>VvD=7e>UnR;NNb5}OsQ~>s^lR1p4WMz{#CmfA$g-=T(Lo@9R
za(vw>5R9vp<Z?9ijz@wF)UV03Q{+RfL*VrEWAz%rEjNbgX3x&dU67Gl{nCj&Y$j$I
z-G)(WbgA?%4~qTf)y{v@ftYMH9|`^5W<MX1MRIA+h<s*ek>Rks8U^dFm>I>k7wEcX
zHUS^|@J0nrh39FTQtZ9DQkgrZDR&ZN*W%+X#Yv0xBzT{Zh(g60ED2k^t0FVh=(6>j
zf{H~Gty(0TNS+)%oJL{s?{IEotF}Y0r=JH2(4hy4RC03#W5YddbLw~B1R;<I#a`<V
zDkM%~=N_Ir=;E~r+P)E^7`w#_VkjnLL?i1Bz@Zf;&o%P}U0HBOI_*}swW=ZxYJL(8
z<m4!;Wq`!?Mdcq9P`!S`dL9c|f2|Z%Vt!U__1U}9sk2uk38DG8q5H^%*|0QEVaZ-W
zYx^8utwB+>EKLIKj5)&xi5_q5LhX@JhfK(q@1<`n`ynTh-;1w#7hTX8AEl7S!LUO2
zfz^tUobST4_1$QeonhI9j*VI*pMD2zcPy1D3Fxzy|27YL93XNnb?EyH$z8o%-S{)a
za)g4iZ$MCj{q{G}!{I6MEn0DA6~~Bo$lDf_6>4&2{-F+DciI8{E7+*#qqvF1@eh>b
zU{3n#-n=-uPo=tiA??dY6wS0-tYHIzrd1f_izWrs<z$!_>oeaCGIMwt-i<IT$0Fc+
z+H=jmaz3%v!#0ZUw_m=O@G63<x$L-UtfF#HV#ZNyTwU6qJKGYDMHBH6BdjThGepU<
zY4u~QBgALpo@u0$_O_4Zc>-Dq$I|%p3cIM2aYzv^gIt?1{oAwz=Ztelv9%9Z)x2RK
zYNbCI)M{80RL_vT4ln{NLaF0QV`Qz17S|&554-29GV3Muvya*C?R{g&f!b$2!zW7~
z(NYRtMV^CJhh`Ra3p2oMn^7gs4UEiX3C>#XjM}#z>hJUmsB*gz=YG)JX2+Eie@t{N
z6s0=VByXzJiP*1xcGIU1pT1RO`v)NHac?xMk@{-hk68$M{AP7dyum{WN0X5;FpL61
z8r!1Gw?(VWC#d&)7-ndX6USrdF<<2k2SH}2Ct|P2_!C)s*x$RKk-2sA?I+!+{9&|E
z>CNOCh9*O93u0!ga941=Y#10)>E$iMUVA+YHvY;CE*a~QD0$Z+EYg(rOTEtMW>b_)
z;%C}sAlZ^^DM=FBFaCj4k(H2h6fYFyc*;?^84kSf`;b`|<gEvbS6{pR6WHCu{cr<p
zKbNKShNlF9t-8k|o~>mbE_H<)oY6OrY!^EH^h$to*@M&xZ?9YF{alA}>p?5BNwsbn
z`D77vtXIjnvhW;)n14FQnm`REJh>bOV!vW?!-*uWOt0ayY#9)J2Hwt6+$OO!wCAle
zC<{tkx2{ULzvV_rew_POR`#uwv^aHPpcjX6SJKy71MgbZW8>X9Lq~a$^(CrVCRow)
zx#)G%VacIMf_10U4E<o^f!1*No;G?R(AvASf@G%^Fj>VhagjYU5|Gl8J`%KE__flO
zrMAX#G>5u4n&t}X);KI}o8VV#37Jmkd1!hs*Ba)K%Dq#2s~<DD6{`3$C4cZ`_J=D{
z+<JBEO9G~iPoLhDb(hb`?3S&)#4;M*Ovg994#%h>tw#>HT7Jeuaz8x>`97<_)VZ=-
zG|_c4lD!1SCKFX9O)czS>5eEKYz)gqDntRR%O5Kc+mr%dglB~-0#<|kesLE{v>iIF
z8pzT5r5Qys?xHbnvApOQDo~CIej#P>r3wG&h6y>q9KWRX>&9J%I1mIqsh_!sa+M#1
zQctXyyI3+|Kg$&Gjv~cqkRI#kBeW;fdLUzoWcR8FckalU5{`<@JrFb<AajXqIP3Pv
zBqND#!i_63yoA2pAbA;|Fr4g)X_`wPr}|^N!rxtg)fin$A|vAPUFrOlSv?Ut%;P31
z5d~>Ybc^oO9F_J|_#KJ^NM`xkbLm{5^spmzWxEkGZ|s+%{+*{0y?ZB}gqg4p#i%N5
zK$VHxGud)}8H?bYS0tdQZ1#ZOC=!0JY4mIfrO@L0!x!k!4*<5Ri;b9xomP5W(r@?C
zLXj+^ZCt(QuyY2M+=q5=W!Tn%VN(w|^!+CmX+~aX*v3Q|-r)N^Le2}>$lL(+m5DFD
z2HpUMC=)rie0G`yo8QSm<Wpc!4Xx~=iv!<?yoWS%HIXr#1>AfT_j-xF;=2lEc1uM1
zVFa;a6~?$JRNpc-u>#M3cKmp2!Zw#vSv)NJCI=5yY`5GuZbjchOz(Lf)i%bCa$@rc
z(KJ@jtd`vw%XLfNI;~87ZSsq(?=rX{mDrpyE}X>qkHb1>(1NKb^vb~hqMh;mn|AiZ
zL|P!spQK6FCxBAZQum1-<pptqd7dmv=_f<f&GBjG>Gi*cHjWN5e+iPTGD6%SFdrDq
z1L6kp@PPz?Abu7Qh~+6x+0o*Eg=o5%IyqTdJh7#wcCMEH;xZ9-c4npy4u9pMX>H>Q
zczXVk69+)s(#7>@X#fu=m>0|^$juMr=H&fXs(()qpk(8233$qhn+;&=Wa?(^YH131
z(l!7789yhO6U6oeqXPb^dh-8U1^%IWKB1l(ZcmD*3IP0syUE(PxVi!O`Tmc2g9!5e
zzs=Q;S}TrAvN!?rCOu8e<n%w%I^X3<WRJ>E3GtZ~vXP<&Gv@;BV^!kEGiJK{+l9Rl
zt(}LVYY8HMU^HKox&h%*QqK~x@c}7F<C0i-*+tPRIL-Jk8M{+B04N_e6Ft|;U<FZ8
zm}%8H=-FwM)axlWpBxU6-ixftc~)c8@4pg_cjQX{rKO=VN<;G!tH=zDK{pNYc|QbI
z^}za~*BS6TXTqocyH;y>Qq~PibJ-X?yxdU;8#+3pA$5STp`0;J)9(E`+TirYSb`h>
zz_9#`ktK}90>V=PclA4B%vNMhSJL$#nD&V7U`VnwZ?dRy;P3M2ttzMqU)Xzi)~`mK
z<vwp8gGN#^nbKI^bPILtfz~ZNoRm}@cu>m0{9Ecjw+U6=)jcTY(!9n-+#wttNmG%d
zj?aA2@AGnAGp%nRI}K~Fi>08#f=$FR@Jnuvm8#FH!`QWe4WV-0QTuFbuYUtY1U=%o
zRew?;Ye7k|hq&c6Eo>?!6jZ*VidjFt!1YJQWgXP~h-Ml?n9@hcE$c24&cOytz4a*@
zW}D`CQy8Ok+8h|d!!m|?QnqGc6ki0nJ`tNSH_X*ZjPR7fbpPNYi?>OsK3qpTjDHOf
z=hU4<A5@@rP3)M9MPs(1Cq|<kZyAb=ZHlc79=p~Jb&B-)qq|RtWtbOo>o%)gWm|<v
z$Dax3Y<-n0&(oI8(RF`0V&*OWvl0gT3>4rk>9N|7JB{8E%$ApAsMbUdJ&Q?`-YVuE
z!=?zXYnvM@risJ*`fJ=%(qC-BWl1ybFw81q3ZnaPk4CuB8S9Z;)T?E5S*5J%^iHF_
z|K*Q$s^88*ioV^?bxNnQeztl|H5Xq5UD)dElTzAE<=ODLFSHod&e>8n|5)91TTLgq
zgiNY6LU?@|toMy=8v-bO`yH>9ueNzNMeJGCIAfc}Ac^*t+RAPDPdKW6l221N4aprF
zd+8=Vyc;9Mhn%*o7nk5#$ybH53V&U9gqVdF0}`sV2K=1)>iH(l&MbRAZ~U8UBq+gi
znZqo&bX4Zed$&HegUDiQHijc^Kkuw0#f56t{Wz5&hV10v%cyOZ!;|8qWyiIvtA<|~
z`#<oBMYl^_L?+1y)}`y~F4q3MaP(#^yp#H)VSZ(VbJVp!AOt<F)l-iY9eR;qk}|7f
zMHKpKH6T0yNu8_X_kZbj|GC$7Ut3x|=aP4@u>8BB3l@07aW!nbEdgMG=Uh4f12EtT
zeEbX4b#!zCfd3MhpTyn21YQ96uh#k3Kn7qS0+!+db3+9A1qHxRNhp{{1`L5hq(OWT
zX<1pw)0`OKe}_D+@=w*7AN0=#1Nh&Nq&XaZJu$Q}(cRZQfYXN)jdKs+7dE$MkJv^s
zlLc5IoACpzOf9&cMb;yOS<GRCDCQPOC`d&^sEz+wA6GY17dKCrr;2cML-={0GciF`
HWuN~IJrgNk

literal 0
HcmV?d00001

diff --git a/lib/sfrsd2/sfrsd_paper/ftdata.dat b/lib/sfrsd2/sfrsd_paper/ftdata.dat
new file mode 100644
index 000000000..948bb041e
--- /dev/null
+++ b/lib/sfrsd2/sfrsd_paper/ftdata.dat
@@ -0,0 +1,10 @@
+-26.5 0.000
+-26.0 0.016
+-25.5 0.090
+-25.0 0.281
+-24.5 0.581
+-24.0 0.844
+-23.5 0.977
+-23.0 0.998
+-22.5 1.000
+
diff --git a/lib/sfrsd2/sfrsd_paper/sfrsd.lyx b/lib/sfrsd2/sfrsd_paper/sfrsd.lyx
index f75b22dc2..1ec274ef9 100644
--- a/lib/sfrsd2/sfrsd_paper/sfrsd.lyx
+++ b/lib/sfrsd2/sfrsd_paper/sfrsd.lyx
@@ -1,956 +1,993 @@
-#LyX 2.1 created this file. For more info see http://www.lyx.org/
-\lyxformat 474
-\begin_document
-\begin_header
-\textclass paper
-\use_default_options true
-\maintain_unincluded_children false
-\language english
-\language_package default
-\inputencoding auto
-\fontencoding global
-\font_roman default
-\font_sans default
-\font_typewriter default
-\font_math auto
-\font_default_family default
-\use_non_tex_fonts false
-\font_sc false
-\font_osf false
-\font_sf_scale 100
-\font_tt_scale 100
-\graphics default
-\default_output_format default
-\output_sync 0
-\bibtex_command default
-\index_command default
-\paperfontsize 12
-\spacing onehalf
-\use_hyperref false
-\papersize default
-\use_geometry true
-\use_package amsmath 1
-\use_package amssymb 1
-\use_package cancel 1
-\use_package esint 1
-\use_package mathdots 1
-\use_package mathtools 1
-\use_package mhchem 1
-\use_package stackrel 1
-\use_package stmaryrd 1
-\use_package undertilde 1
-\cite_engine basic
-\cite_engine_type default
-\biblio_style plain
-\use_bibtopic false
-\use_indices false
-\paperorientation portrait
-\suppress_date false
-\justification true
-\use_refstyle 1
-\index Index
-\shortcut idx
-\color #008000
-\end_index
-\leftmargin 1in
-\topmargin 1in
-\rightmargin 1in
-\bottommargin 1in
-\secnumdepth 3
-\tocdepth 3
-\paragraph_separation indent
-\paragraph_indentation default
-\quotes_language english
-\papercolumns 1
-\papersides 1
-\paperpagestyle default
-\tracking_changes false
-\output_changes false
-\html_math_output 0
-\html_css_as_file 0
-\html_be_strict false
-\end_header
-
-\begin_body
-
-\begin_layout Title
-A stochastic successive erasures soft-decision decoder for the JT65 (63,12)
- Reed-Solomon code
-\end_layout
-
-\begin_layout Author
-Steven J.
- Franke, K9AN and Joseph H.
- Taylor, K1JT
-\end_layout
-
-\begin_layout Abstract
-The JT65 mode has revolutionized amateur-radio weak-signal communication
- by enabling amateur radio operators with small antennas and relatively
- low-power transmitters to communicate over propagation paths not usable
- with traditional technologies.
- A major reason for the success and popularity of JT65 is its use of a strong
- error-correction code: a short block-length, low-rate Reed-Solomon code
- based on a 64-symbol alphabet.
- Since 2004, most JT65 decoders have used the patented Koetter-Vardy (KV)
- algebraic soft-decision decoder, licensed to K1JT and implemented in a
- closed-source program for use in amateur radio applications.
- We describe here a new open-source alternative called the FT algotithm.
- It is conceptually simple, built around the well-known Berlekamp-Massey
- errors-and-erasures algorithm, and performs at least as well as the KV
- decoder.
-\end_layout
-
-\begin_layout Section
-Introduction
-\end_layout
-
-\begin_layout Standard
-JT65 message frames consist of a short compressed message encoded for transmissi
-on with a Reed-Solomon code.
- Reed-Solomon codes are block codes characterized by 
-\begin_inset Formula $n$
-\end_inset
-
-, the length of their codewords, 
-\begin_inset Formula $k$
-\end_inset
-
-, the number of message symbols conveyed by the codeword, and the number
- of possible values for each symbol in the codewords.
- The codeword length and the number of message symbols are specified using
- the notation 
-\begin_inset Formula $(n,k)$
-\end_inset
-
-.
- JT65 uses a (63,12) Reed-Solomon code with 64 possible values for each
- symbol.
- Each of the 12 message symbols represents 
-\begin_inset Formula $\log_{2}64=6$
-\end_inset
-
- message bits.
- The source-encoded messages conveyed by a 63-symbol JT65 frame thus consist
- of 72 bits.
- The JT65 code is systematic, which means that the 12 message symbols are
- embedded in the codeword without modification and another 51 parity symbols
- derived from the message symbols are added to form a codeword of 63 symbols.
- 
-\end_layout
-
-\begin_layout Standard
-The concept of Hamming distance is used as a measure of 
-\begin_inset Quotes eld
-\end_inset
-
-distance
-\begin_inset Quotes erd
-\end_inset
-
- between different codewords, or between a received word and a codeword.
- Hamming distance is the number of code symbols that differ in the two words
- being compared.
- Reed-Solomon codes have minimum Hamming distance 
-\begin_inset Formula $d$
-\end_inset
-
-, where 
-\begin_inset Formula 
-\begin{equation}
-d=n-k+1.\label{eq:minimum_distance}
-\end{equation}
-
-\end_inset
-
-The minimum Hamming distance of the JT65 code is 
-\begin_inset Formula $d=52$
-\end_inset
-
-, which means that any particular codeword differs from all other codewords
- in at least 52 symbol positions.
- 
-\end_layout
-
-\begin_layout Standard
-Given a received word containing some incorrect symbols (errors), the received
- word can be decoded into the correct codeword using a deterministic, algebraic
- algorithm provided that no more than 
-\begin_inset Formula $t$
-\end_inset
-
- symbols were received incorrectly, where
-\begin_inset Formula 
-\begin{equation}
-t=\left\lfloor \frac{n-k}{2}\right\rfloor .\label{eq:t}
-\end{equation}
-
-\end_inset
-
-For the JT65 code, 
-\begin_inset Formula $t=25$
-\end_inset
-
-, so it is always possible to efficiently decode a received word having
- no more than 25 symbol errors.
- Any one of several well-known algebraic algorithms, such as the widely
- used Berlekamp-Massey (BM) algorithm, can carry out the decoding.
- Two steps are ncessarily involved in this process, namely
-\end_layout
-
-\begin_layout Enumerate
-Determine which symbols were received incorrectly.
- 
-\end_layout
-
-\begin_layout Enumerate
-Find the correct value of the incorrect symbols.
-\end_layout
-
-\begin_layout Standard
-If we somehow know that certain symbols are incorrect, this information
- can be used to reduce the work involved in step 1 and allow step 2 to correct
- more than 
-\begin_inset Formula $t$
-\end_inset
-
- errors.
- In the unlikely event that the location of every error is known and if
- no correct symbols are accidentally labeled as errors, the BM algorithm
- can correct up to 
-\begin_inset Formula $d$
-\end_inset
-
- errors.
- 
-\end_layout
-
-\begin_layout Standard
-The FT algorithm creates lists of symbols suspected of being incorrect and
- sends them to the BM decoder.
- Symbols flagged in this way are called 
-\begin_inset Quotes eld
-\end_inset
-
-erasures,
-\begin_inset Quotes erd
-\end_inset
-
- while other incorrect symbols will be called 
-\begin_inset Quotes eld
-\end_inset
-
-errors.
-\begin_inset Quotes erd
-\end_inset
-
- As already noted, with perfect erasure information up to 51 errors can
- be corrected.
- Imperfect erasure information means that some erased symbols may be correct,
- and some other symbols in error.
- If 
-\begin_inset Formula $s$
-\end_inset
-
- symbols are erased and the remaining (unerased) symbols contain 
-\begin_inset Formula $e$
-\end_inset
-
- errors, the BM algorithm can find the correct codeword as long as 
-\begin_inset Formula 
-\begin{equation}
-s+2e\le d-1.\label{eq:erasures_and_errors}
-\end{equation}
-
-\end_inset
-
-If 
-\begin_inset Formula $s=0$
-\end_inset
-
-, the decoder is said to be an 
-\begin_inset Quotes eld
-\end_inset
-
-errors-only
-\begin_inset Quotes erd
-\end_inset
-
- decoder.
- If 
-\begin_inset Formula $0<s\le d-1$
-\end_inset
-
- (
-\begin_inset Formula $d-1=51$
-\end_inset
-
- for JT65), the decoder is called an 
-\begin_inset Quotes eld
-\end_inset
-
-errors-and-erasures
-\begin_inset Quotes erd
-\end_inset
-
- decoder.
- The possibility of doing errors-and-erasures decoding lies at the heart
- of the FT algorithm.
- On that foundation we build a capability for using 
-\begin_inset Quotes eld
-\end_inset
-
-soft
-\begin_inset Quotes erd
-\end_inset
-
- information on symbol reliability.
-\end_layout
-
-\begin_layout Section
-\begin_inset CommandInset label
-LatexCommand label
-name "sec:You've-got-to"
-
-\end_inset
-
-Do I feel lucky?
-\end_layout
-
-\begin_layout Standard
-The FT algorithm uses the estimated quality of received symbols to generate
- lists of symbols considered likely to be in error, thereby enabling reliable
- decoding of received words with more than 25 errors.
- As a specific example, consider a received JT65 word with 23 correct symbols
- and 40 errors.
- We do not know which symbols are in error.
- Suppose that the decoder randomly selects 
-\begin_inset Formula $s=40$
-\end_inset
-
- symbols for erasure, leaving 23 unerased symbols.
- According to Eq.
- (
-\begin_inset CommandInset ref
-LatexCommand ref
-reference "eq:erasures_and_errors"
-
-\end_inset
-
-), the BM decoder can successfully decode this word as long as 
-\begin_inset Formula $e$
-\end_inset
-
-, the number of errors present in the 23 unerased symbols, is 5 or less.
- The number of errors captured in the set of 40 erased symbols must therefore
- be at least 35.
- 
-\end_layout
-
-\begin_layout Standard
-The probability of selecting some particular number of incorrect symbols
- in a randomly selected subset of received symbols is governed by the hypergeome
-tric probability distribution.
- Let us define 
-\begin_inset Formula $N$
-\end_inset
-
- as the number of symbols from which erasures will be selected, 
-\begin_inset Formula $X$
-\end_inset
-
- as the number of incorrect symbols in the received set, and 
-\begin_inset Formula $x$
-\end_inset
-
- as the number of errors in the erased symbols.
- In an ensemble of many received words, 
-\begin_inset Formula $X$
-\end_inset
-
- and 
-\begin_inset Formula $x$
-\end_inset
-
- will be random variables.
- The conditional probability mass function for 
-\begin_inset Formula $x$
-\end_inset
-
- given stated values of 
-\begin_inset Formula $N$
-\end_inset
-
-, 
-\begin_inset Formula $X$
-\end_inset
-
-, and 
-\begin_inset Formula $s$
-\end_inset
-
- may be written as
-\end_layout
-
-\begin_layout Standard
-\begin_inset Formula 
-\begin{equation}
-P(x|N,X,s)=\frac{\binom{X}{x}\binom{N-X}{s-x}}{\binom{N}{s}}\label{eq:hypergeometric_pdf}
-\end{equation}
-
-\end_inset
-
-where 
-\begin_inset Formula $\binom{n}{k}=\frac{n!}{k!(n-k)!}$
-\end_inset
-
- is the binomial coefficient.
- The binomial coefficient can be calculated using the function 
-\begin_inset Quotes eld
-\end_inset
-
-nchoosek(
-\begin_inset Formula $n,k$
-\end_inset
-
-)
-\begin_inset Quotes erd
-\end_inset
-
- in the interpreted language GNU Octave.
- The hypergeometric probability mass function defined in Eq.
- (
-\begin_inset CommandInset ref
-LatexCommand ref
-reference "eq:hypergeometric_pdf"
-
-\end_inset
-
-) is available in GNU Octave as function 
-\begin_inset Quotes eld
-\end_inset
-
-hygepdf(
-\begin_inset Formula $x,N,X,s$
-\end_inset
-
-)
-\begin_inset Quotes erd
-\end_inset
-
-.
-\end_layout
-
-\begin_layout Paragraph
-Example 1:
-\end_layout
-
-\begin_layout Standard
-Suppose a codeword contains 
-\begin_inset Formula $X=40$
-\end_inset
-
- incorrect symbols.
- In an attempt to decode using an errors-and-erasures decoder, 
-\begin_inset Formula $s=40$
-\end_inset
-
- symbols are randomly selected for erasure from the full set of 
-\begin_inset Formula $N=n=63$
-\end_inset
-
- symbols.
- The probability that 
-\begin_inset Formula $x=35$
-\end_inset
-
- of the erased symbols are actually incorrect is then
-\begin_inset Formula 
-\[
-P(x=35)=\frac{\binom{40}{35}\binom{63-40}{40-35}}{\binom{63}{40}}\simeq2.4\times10^{-7}.
-\]
-
-\end_inset
-
-Similarly, the probability that 
-\begin_inset Formula $x=36$
-\end_inset
-
- of the erased symbols are incorrect is
-\begin_inset Formula 
-\[
-P(x=36)\simeq8.6\times10^{-9}.
-\]
-
-\end_inset
-
-Since the probability of erasing 36 errors is so much smaller than the probabili
-ty of erasing 35 errors, we may safely conclude that the probability of
- randomly choosing an erasure vector that can decode the received word is
- approximately 
-\begin_inset Formula $P(x=35)\simeq2.4\times10^{-7}$
-\end_inset
-
-.
- The odds of successfully decoding the word on the first try are very poor,
- about 1 in 4 million.
-\end_layout
-
-\begin_layout Paragraph
-Example 2:
-\end_layout
-
-\begin_layout Standard
-How might we best choose the number of symbols to erase, in order to maximize
- the probability of successful decoding? By exhaustive search over all possible
- values up to 
-\begin_inset Formula $s=51$
-\end_inset
-
-, it turns out that for 
-\begin_inset Formula $X=40$
-\end_inset
-
- the best strategy is to erase 
-\begin_inset Formula $s=45$
-\end_inset
-
- symbols.
- Decoding will then be assured if the set of erased symbols contains at
- least 37 errors, and with 
-\begin_inset Formula $N=63$
-\end_inset
-
-, 
-\begin_inset Formula $X=40$
-\end_inset
-
-, and 
-\begin_inset Formula $s=45$
-\end_inset
-
-, the probability of successful decode in a single try is 
-\begin_inset Formula 
-\[
-P(x\ge37)\simeq2\times10^{-6}.
-\]
-
-\end_inset
-
-This probability is about 8 times higher than the probability of success
- when only 40 symbols were erased.
- Nevertheless, the odds of successfully decoding on the first try are still
- only about 1 in 500,000.
- 
-\end_layout
-
-\begin_layout Paragraph
-Example 3:
-\end_layout
-
-\begin_layout Standard
-Examples 1 and 2 show that a random strategy for selecting symbols to erase
- is unlikely to be successful unless we are prepared to wait a long time
- for an answer.
- So let's modify the strategy to tip the odds in our favor.
- Let the received word contain 
-\begin_inset Formula $X=40$
-\end_inset
-
- incorrect symbols, as before, but suppose we know that 10 symbols are significa
-ntly more reliable than the other 53.
- We might therefore protect the 10 most reliable symbols from erasure, and
- choose erasures from the smaller set of 
-\begin_inset Formula $N=53$
-\end_inset
-
- less reliable symbols.
- If 
-\begin_inset Formula $s=45$
-\end_inset
-
- symbols are chosen randomly in this way, it is still necessary for the
- erased symbols to include at least 37 errors, as in Example 2.
- However, the probabilities are now much more favorable: with 
-\begin_inset Formula $N=53$
-\end_inset
-
-, 
-\begin_inset Formula $X=40$
-\end_inset
-
-, and 
-\begin_inset Formula $s=45$
-\end_inset
-
-, Eq.
- (
-\begin_inset CommandInset ref
-LatexCommand ref
-reference "eq:hypergeometric_pdf"
-
-\end_inset
-
-) yields 
-\begin_inset Formula $P(x\ge37)=0.016$
-\end_inset
-
-.
- Even better odds are obtained by choosing 
-\begin_inset Formula $s=47$
-\end_inset
-
-, which requires 
-\begin_inset Formula $x\ge38$
-\end_inset
-
-.
- With 
-\begin_inset Formula $N=53$
-\end_inset
-
-, 
-\begin_inset Formula $X=40$
-\end_inset
-
-, and 
-\begin_inset Formula $s=47$
-\end_inset
-
-, 
-\begin_inset Formula $P(x\ge38)=0.0266$
-\end_inset
-
-.
- The odds for successful decoding on the first try are now about 1 in 38.
- A few hundred independently randomized tries would be enough to all-but-guarant
-ee production of a valid codeword by the BM decoder.
-\end_layout
-
-\begin_layout Section
-\begin_inset CommandInset label
-LatexCommand label
-name "sec:The-decoding-algorithm"
-
-\end_inset
-
-The FT decoding algorithm
-\end_layout
-
-\begin_layout Standard
-Example 3 shows how reliable information about symbol quality should make
- it possible to decode received frames having a large number of errors.
- In practice the number of errors in the received word is unknown, so we
- use a stochastic algorithm to assign a high erasure probability to low-quality
- symbols and a relatively low probability to high-quality symbols.
- As illustrated by Example 3, a good choice of these probabilities can increase
- the chance of a successful decode by many orders of magnitude.
-\end_layout
-
-\begin_layout Standard
-The FT algorithm uses two quality indices made available by a noncoherent
- 64-FSK demodulator.
- The demodulator identifies the most likely value for each symbol based
- on which of 64 frequency bins contains the the largest signal-plus-noise
- power.
- The fraction of total power in the two bins containing the largest and
- second-largest powers (denoted by 
-\begin_inset Formula $p_{1}$
-\end_inset
-
- and 
-\begin_inset Formula $p_{2}$
-\end_inset
-
-, respectively) are passed to the decoder from the demodulator as 
-\begin_inset Quotes eld
-\end_inset
-
-soft-symbol
-\begin_inset Quotes erd
-\end_inset
-
- information.
- The decoder derives two metrics from 
-\begin_inset Formula $\{p_{1},p_{2}\}:$
-\end_inset
-
-
-\end_layout
-
-\begin_layout Itemize
-\begin_inset Formula $p_{1}$
-\end_inset
-
--rank: the rank 
-\begin_inset Formula $\{1,2,\ldots,63\}$
-\end_inset
-
- of the symbol's fractional power, 
-\begin_inset Formula $p_{1}$
-\end_inset
-
- in the sorted list of 
-\begin_inset Formula $p_{1}$
-\end_inset
-
- values.
- High ranking symbols have larger signal-to-noise ratio than those with
- lower rank.
-\end_layout
-
-\begin_layout Itemize
-\begin_inset Formula $p_{2}/p_{1}$
-\end_inset
-
-: when 
-\begin_inset Formula $p_{2}/p_{1}$
-\end_inset
-
- is not small compared to 1, the most likely symbol value is only slightly
- more reliable than the second most likely one.
-\end_layout
-
-\begin_layout Standard
-The FT decoder uses a table of symbol error probabilities derived from a
- large dataset of received words that have been successfully decoded.
- The table provides an estimate of the 
-\emph on
-a-priori
-\emph default
- probability of symbol error based on a given symbol's 
-\begin_inset Formula $p_{1}$
-\end_inset
-
--rank and 
-\begin_inset Formula $p_{2}/p_{1}$
-\end_inset
-
- metrics.
- These probabilities are close to 1 for low-quality symbols and close to
- 0 for high-quality symbols.
- Recall from Examples 2 and 3 that best performance was obtained with 
-\begin_inset Formula $s>X$
-\end_inset
-
-.
- Correspondingly, the FT algorithm works best when the probability of erasing
- a symbol is somewhat larger than the probability that the symbol is incorrect.
- We found empirically that good decoding performance is obtained when the
- symbol erasure probability is about 1.3 times the symbol error probability.
-\end_layout
-
-\begin_layout Standard
-The FT algorithm tries successively to decode the received word using independen
-t 
-\begin_inset Quotes eld
-\end_inset
-
-educated guesses
-\begin_inset Quotes erd
-\end_inset
-
- to select symbols for erasure.
- For each iteration a stochastic erasure vector is generated based on the
- symbol erasure probabilities.
- The erasure vector is sent to the BM decoder along with the full set of
- 63 received symbols.
- When the BM decoder finds a candidate codeword it is assigned a quality
- metric 
-\begin_inset Formula $d_{s}$
-\end_inset
-
- defined as the soft distance between the received word and the codeword,
- where
-\begin_inset Formula 
-\begin{equation}
-d_{s}=\sum_{i=1}^{n}\alpha_{i}\,(1+p_{1,i}).\label{eq:soft_distance}
-\end{equation}
-
-\end_inset
-
-Here 
-\begin_inset Formula $\alpha_{i}=0$
-\end_inset
-
- if received symbol 
-\begin_inset Formula $i$
-\end_inset
-
- is the same as the corresponding symbol in the codeword, 
-\begin_inset Formula $\alpha_{i}=1$
-\end_inset
-
- if the received symbol and codeword symbol are different, and 
-\begin_inset Formula $p_{1,i}$
-\end_inset
-
- is the fractional power associated with received symbol 
-\begin_inset Formula $i$
-\end_inset
-
-.
- Think of the soft distance as made up of two terms: the first is the Hamming
- distance between the received word and the codeword, and the second ensures
- that if two candidate codewords have the same Hamming distance from the
- received word, a smaller soft distance will be assigned to the one where
- differences occur in symbols of lower estimated reliability.
-\end_layout
-
-\begin_layout Standard
-Technically the FT algorithm is a list decoder, potentially generating a
- list of candidate codewords.
- Among the list of candidate codewords found by the stochastic search algorithm,
- only the one with the smallest soft distance from the received word is
- retained.
- As with all such algorithms, a stopping criterion is necessary.
- FT accepts a codeword unconditionally if its soft distance is smaller than
- an empirically determined acceptance threshold, 
-\begin_inset Formula $d_{a}$
-\end_inset
-
-.
- A timeout is used to limit the algorithm's execution time if no codewords
- within soft distance 
-\begin_inset Formula $d_{a}$
-\end_inset
-
- of the received word are found in a reasonable number of trials.
-\end_layout
-
-\begin_layout Paragraph
-Algorithm pseudo-code:
-\end_layout
-
-\begin_layout Enumerate
-For each received symbol, define the erasure probability as 1.3 times the
- 
-\emph on
-a priori
-\emph default
- symbol-error probability determined from soft-symbol information 
-\begin_inset Formula $\{p_{1}\textrm{-rank},\,p_{2}/p_{1}\}$
-\end_inset
-
-.
- 
-\end_layout
-
-\begin_layout Enumerate
-Make independent stochastic decisions about whether to erase each symbol
- by using the symbol's erasure probability, allowing a maximum of 51 erasures.
-\end_layout
-
-\begin_layout Enumerate
-Attempt errors-and-erasures decoding by using the BM algorithm and the set
- of eraseures determined in step 2.
- If the BM decoder is successful go to step 5.
-\end_layout
-
-\begin_layout Enumerate
-If decoding is not successful, go to step 2.
-\end_layout
-
-\begin_layout Enumerate
-Calculate the soft distance 
-\begin_inset Formula $d_{s}$
-\end_inset
-
- between the candidate codeword and the received symbols.
- Set 
-\begin_inset Formula $d_{s,min}=d_{s}$
-\end_inset
-
- if the soft distance is the smallest one encountered so far.
-\end_layout
-
-\begin_layout Enumerate
-If 
-\begin_inset Formula $d_{s,min}\le d_{a}$
-\end_inset
-
-, go to 8.
- 
-\end_layout
-
-\begin_layout Enumerate
-If the number of trials is less than the maximum allowed number, go to 2.
- Otherwise, declare decoding failure and exit.
-\end_layout
-
-\begin_layout Enumerate
-A 
-\begin_inset Quotes eld
-\end_inset
-
-best
-\begin_inset Quotes erd
-\end_inset
-
- codeword with 
-\begin_inset Formula $d_{s,min}\le d_{a}$
-\end_inset
-
- has been found.
- Declare a successful decode and return this codeword .
-\end_layout
-
-\begin_layout Section
-Results and Comparison with KVASD
-\end_layout
-
-\begin_layout Standard
-Possible figures:
-\end_layout
-
-\begin_layout Itemize
-histogram of 
-\begin_inset Formula $s$
-\end_inset
-
- (number of erasures) for succeffsul decodes with HF and EME data
-\end_layout
-
-\begin_layout Itemize
-histogram of 
-\begin_inset Quotes eld
-\end_inset
-
-ntrials
-\begin_inset Quotes erd
-\end_inset
-
- (or execution time)
-\end_layout
-
-\begin_layout Itemize
-Number of decodes vs.
- ntrials
-\end_layout
-
-\begin_layout Itemize
-Probability of successful decode vs.
- Es/No or S/N in 2500 Hz BW
-\end_layout
-
-\begin_layout Itemize
-other...
- ?
-\end_layout
-
-\begin_layout Section
-Summary 
-\end_layout
-
-\begin_layout Bibliography
-\begin_inset CommandInset bibitem
-LatexCommand bibitem
-key "key-1"
-
-\end_inset
-
-
-\end_layout
-
-\end_body
-\end_document
+#LyX 2.1 created this file. For more info see http://www.lyx.org/
+\lyxformat 474
+\begin_document
+\begin_header
+\textclass paper
+\use_default_options true
+\maintain_unincluded_children false
+\language english
+\language_package default
+\inputencoding auto
+\fontencoding global
+\font_roman default
+\font_sans default
+\font_typewriter default
+\font_math auto
+\font_default_family default
+\use_non_tex_fonts false
+\font_sc false
+\font_osf false
+\font_sf_scale 100
+\font_tt_scale 100
+\graphics default
+\default_output_format default
+\output_sync 0
+\bibtex_command default
+\index_command default
+\paperfontsize 12
+\spacing onehalf
+\use_hyperref false
+\papersize default
+\use_geometry true
+\use_package amsmath 1
+\use_package amssymb 1
+\use_package cancel 1
+\use_package esint 1
+\use_package mathdots 1
+\use_package mathtools 1
+\use_package mhchem 1
+\use_package stackrel 1
+\use_package stmaryrd 1
+\use_package undertilde 1
+\cite_engine basic
+\cite_engine_type default
+\biblio_style plain
+\use_bibtopic false
+\use_indices false
+\paperorientation portrait
+\suppress_date false
+\justification true
+\use_refstyle 1
+\index Index
+\shortcut idx
+\color #008000
+\end_index
+\leftmargin 1in
+\topmargin 1in
+\rightmargin 1in
+\bottommargin 1in
+\secnumdepth 3
+\tocdepth 3
+\paragraph_separation indent
+\paragraph_indentation default
+\quotes_language english
+\papercolumns 1
+\papersides 1
+\paperpagestyle default
+\tracking_changes false
+\output_changes false
+\html_math_output 0
+\html_css_as_file 0
+\html_be_strict false
+\end_header
+
+\begin_body
+
+\begin_layout Title
+A stochastic successive erasures soft-decision decoder for the JT65 (63,12)
+ Reed-Solomon code
+\end_layout
+
+\begin_layout Author
+Steven J.
+ Franke, K9AN and Joseph H.
+ Taylor, K1JT
+\end_layout
+
+\begin_layout Abstract
+The JT65 mode has revolutionized amateur-radio weak-signal communication
+ by enabling amateur radio operators with small antennas and relatively
+ low-power transmitters to communicate over propagation paths not usable
+ with traditional technologies.
+ A major reason for the success and popularity of JT65 is its use of a strong
+ error-correction code: a short block-length, low-rate Reed-Solomon code
+ based on a 64-symbol alphabet.
+ Since 2004, most JT65 decoders have used the patented Koetter-Vardy (KV)
+ algebraic soft-decision decoder, licensed to K1JT and implemented in a
+ closed-source program for use in amateur radio applications.
+ We describe here a new open-source alternative called the FT algotithm.
+ It is conceptually simple, built around the well-known Berlekamp-Massey
+ errors-and-erasures algorithm, and performs at least as well as the KV
+ decoder.
+\end_layout
+
+\begin_layout Section
+Introduction
+\end_layout
+
+\begin_layout Standard
+JT65 message frames consist of a short compressed message encoded for transmissi
+on with a Reed-Solomon code.
+ Reed-Solomon codes are block codes characterized by 
+\begin_inset Formula $n$
+\end_inset
+
+, the length of their codewords, 
+\begin_inset Formula $k$
+\end_inset
+
+, the number of message symbols conveyed by the codeword, and the number
+ of possible values for each symbol in the codewords.
+ The codeword length and the number of message symbols are specified using
+ the notation 
+\begin_inset Formula $(n,k)$
+\end_inset
+
+.
+ JT65 uses a (63,12) Reed-Solomon code with 64 possible values for each
+ symbol.
+ Each of the 12 message symbols represents 
+\begin_inset Formula $\log_{2}64=6$
+\end_inset
+
+ message bits.
+ The source-encoded messages conveyed by a 63-symbol JT65 frame thus consist
+ of 72 bits.
+ The JT65 code is systematic, which means that the 12 message symbols are
+ embedded in the codeword without modification and another 51 parity symbols
+ derived from the message symbols are added to form a codeword of 63 symbols.
+ 
+\end_layout
+
+\begin_layout Standard
+The concept of Hamming distance is used as a measure of 
+\begin_inset Quotes eld
+\end_inset
+
+distance
+\begin_inset Quotes erd
+\end_inset
+
+ between different codewords, or between a received word and a codeword.
+ Hamming distance is the number of code symbols that differ in the two words
+ being compared.
+ Reed-Solomon codes have minimum Hamming distance 
+\begin_inset Formula $d$
+\end_inset
+
+, where 
+\begin_inset Formula 
+\begin{equation}
+d=n-k+1.\label{eq:minimum_distance}
+\end{equation}
+
+\end_inset
+
+The minimum Hamming distance of the JT65 code is 
+\begin_inset Formula $d=52$
+\end_inset
+
+, which means that any particular codeword differs from all other codewords
+ in at least 52 symbol positions.
+ 
+\end_layout
+
+\begin_layout Standard
+Given a received word containing some incorrect symbols (errors), the received
+ word can be decoded into the correct codeword using a deterministic, algebraic
+ algorithm provided that no more than 
+\begin_inset Formula $t$
+\end_inset
+
+ symbols were received incorrectly, where
+\begin_inset Formula 
+\begin{equation}
+t=\left\lfloor \frac{n-k}{2}\right\rfloor .\label{eq:t}
+\end{equation}
+
+\end_inset
+
+For the JT65 code, 
+\begin_inset Formula $t=25$
+\end_inset
+
+, so it is always possible to efficiently decode a received word having
+ no more than 25 symbol errors.
+ Any one of several well-known algebraic algorithms, such as the widely
+ used Berlekamp-Massey (BM) algorithm, can carry out the decoding.
+ Two steps are ncessarily involved in this process, namely
+\end_layout
+
+\begin_layout Enumerate
+Determine which symbols were received incorrectly.
+ 
+\end_layout
+
+\begin_layout Enumerate
+Find the correct value of the incorrect symbols.
+\end_layout
+
+\begin_layout Standard
+If we somehow know that certain symbols are incorrect, this information
+ can be used to reduce the work involved in step 1 and allow step 2 to correct
+ more than 
+\begin_inset Formula $t$
+\end_inset
+
+ errors.
+ In the unlikely event that the location of every error is known and if
+ no correct symbols are accidentally labeled as errors, the BM algorithm
+ can correct up to 
+\begin_inset Formula $d$
+\end_inset
+
+ errors.
+ 
+\end_layout
+
+\begin_layout Standard
+The FT algorithm creates lists of symbols suspected of being incorrect and
+ sends them to the BM decoder.
+ Symbols flagged in this way are called 
+\begin_inset Quotes eld
+\end_inset
+
+erasures,
+\begin_inset Quotes erd
+\end_inset
+
+ while other incorrect symbols will be called 
+\begin_inset Quotes eld
+\end_inset
+
+errors.
+\begin_inset Quotes erd
+\end_inset
+
+ As already noted, with perfect erasure information up to 51 errors can
+ be corrected.
+ Imperfect erasure information means that some erased symbols may be correct,
+ and some other symbols in error.
+ If 
+\begin_inset Formula $s$
+\end_inset
+
+ symbols are erased and the remaining (unerased) symbols contain 
+\begin_inset Formula $e$
+\end_inset
+
+ errors, the BM algorithm can find the correct codeword as long as 
+\begin_inset Formula 
+\begin{equation}
+s+2e\le d-1.\label{eq:erasures_and_errors}
+\end{equation}
+
+\end_inset
+
+If 
+\begin_inset Formula $s=0$
+\end_inset
+
+, the decoder is said to be an 
+\begin_inset Quotes eld
+\end_inset
+
+errors-only
+\begin_inset Quotes erd
+\end_inset
+
+ decoder.
+ If 
+\begin_inset Formula $0<s\le d-1$
+\end_inset
+
+ (
+\begin_inset Formula $d-1=51$
+\end_inset
+
+ for JT65), the decoder is called an 
+\begin_inset Quotes eld
+\end_inset
+
+errors-and-erasures
+\begin_inset Quotes erd
+\end_inset
+
+ decoder.
+ The possibility of doing errors-and-erasures decoding lies at the heart
+ of the FT algorithm.
+ On that foundation we build a capability for using 
+\begin_inset Quotes eld
+\end_inset
+
+soft
+\begin_inset Quotes erd
+\end_inset
+
+ information on symbol reliability.
+\end_layout
+
+\begin_layout Section
+\begin_inset CommandInset label
+LatexCommand label
+name "sec:You've-got-to"
+
+\end_inset
+
+Do I feel lucky?
+\end_layout
+
+\begin_layout Standard
+The FT algorithm uses the estimated quality of received symbols to generate
+ lists of symbols considered likely to be in error, thereby enabling reliable
+ decoding of received words with more than 25 errors.
+ As a specific example, consider a received JT65 word with 23 correct symbols
+ and 40 errors.
+ We do not know which symbols are in error.
+ Suppose that the decoder randomly selects 
+\begin_inset Formula $s=40$
+\end_inset
+
+ symbols for erasure, leaving 23 unerased symbols.
+ According to Eq.
+ (
+\begin_inset CommandInset ref
+LatexCommand ref
+reference "eq:erasures_and_errors"
+
+\end_inset
+
+), the BM decoder can successfully decode this word as long as 
+\begin_inset Formula $e$
+\end_inset
+
+, the number of errors present in the 23 unerased symbols, is 5 or less.
+ The number of errors captured in the set of 40 erased symbols must therefore
+ be at least 35.
+ 
+\end_layout
+
+\begin_layout Standard
+The probability of selecting some particular number of incorrect symbols
+ in a randomly selected subset of received symbols is governed by the hypergeome
+tric probability distribution.
+ Let us define 
+\begin_inset Formula $N$
+\end_inset
+
+ as the number of symbols from which erasures will be selected, 
+\begin_inset Formula $X$
+\end_inset
+
+ as the number of incorrect symbols in the received set, and 
+\begin_inset Formula $x$
+\end_inset
+
+ as the number of errors in the erased symbols.
+ In an ensemble of many received words, 
+\begin_inset Formula $X$
+\end_inset
+
+ and 
+\begin_inset Formula $x$
+\end_inset
+
+ will be random variables.
+ The conditional probability mass function for 
+\begin_inset Formula $x$
+\end_inset
+
+ given stated values of 
+\begin_inset Formula $N$
+\end_inset
+
+, 
+\begin_inset Formula $X$
+\end_inset
+
+, and 
+\begin_inset Formula $s$
+\end_inset
+
+ may be written as
+\end_layout
+
+\begin_layout Standard
+\begin_inset Formula 
+\begin{equation}
+P(x|N,X,s)=\frac{\binom{X}{x}\binom{N-X}{s-x}}{\binom{N}{s}}\label{eq:hypergeometric_pdf}
+\end{equation}
+
+\end_inset
+
+where 
+\begin_inset Formula $\binom{n}{k}=\frac{n!}{k!(n-k)!}$
+\end_inset
+
+ is the binomial coefficient.
+ The binomial coefficient can be calculated using the function 
+\begin_inset Quotes eld
+\end_inset
+
+nchoosek(
+\begin_inset Formula $n,k$
+\end_inset
+
+)
+\begin_inset Quotes erd
+\end_inset
+
+ in the interpreted language GNU Octave.
+ The hypergeometric probability mass function defined in Eq.
+ (
+\begin_inset CommandInset ref
+LatexCommand ref
+reference "eq:hypergeometric_pdf"
+
+\end_inset
+
+) is available in GNU Octave as function 
+\begin_inset Quotes eld
+\end_inset
+
+hygepdf(
+\begin_inset Formula $x,N,X,s$
+\end_inset
+
+)
+\begin_inset Quotes erd
+\end_inset
+
+.
+\end_layout
+
+\begin_layout Paragraph
+Example 1:
+\end_layout
+
+\begin_layout Standard
+Suppose a codeword contains 
+\begin_inset Formula $X=40$
+\end_inset
+
+ incorrect symbols.
+ In an attempt to decode using an errors-and-erasures decoder, 
+\begin_inset Formula $s=40$
+\end_inset
+
+ symbols are randomly selected for erasure from the full set of 
+\begin_inset Formula $N=n=63$
+\end_inset
+
+ symbols.
+ The probability that 
+\begin_inset Formula $x=35$
+\end_inset
+
+ of the erased symbols are actually incorrect is then
+\begin_inset Formula 
+\[
+P(x=35)=\frac{\binom{40}{35}\binom{63-40}{40-35}}{\binom{63}{40}}\simeq2.4\times10^{-7}.
+\]
+
+\end_inset
+
+Similarly, the probability that 
+\begin_inset Formula $x=36$
+\end_inset
+
+ of the erased symbols are incorrect is
+\begin_inset Formula 
+\[
+P(x=36)\simeq8.6\times10^{-9}.
+\]
+
+\end_inset
+
+Since the probability of erasing 36 errors is so much smaller than the probabili
+ty of erasing 35 errors, we may safely conclude that the probability of
+ randomly choosing an erasure vector that can decode the received word is
+ approximately 
+\begin_inset Formula $P(x=35)\simeq2.4\times10^{-7}$
+\end_inset
+
+.
+ The odds of successfully decoding the word on the first try are very poor,
+ about 1 in 4 million.
+\end_layout
+
+\begin_layout Paragraph
+Example 2:
+\end_layout
+
+\begin_layout Standard
+How might we best choose the number of symbols to erase, in order to maximize
+ the probability of successful decoding? By exhaustive search over all possible
+ values up to 
+\begin_inset Formula $s=51$
+\end_inset
+
+, it turns out that for 
+\begin_inset Formula $X=40$
+\end_inset
+
+ the best strategy is to erase 
+\begin_inset Formula $s=45$
+\end_inset
+
+ symbols.
+ Decoding will then be assured if the set of erased symbols contains at
+ least 37 errors, and with 
+\begin_inset Formula $N=63$
+\end_inset
+
+, 
+\begin_inset Formula $X=40$
+\end_inset
+
+, and 
+\begin_inset Formula $s=45$
+\end_inset
+
+, the probability of successful decode in a single try is 
+\begin_inset Formula 
+\[
+P(x\ge37)\simeq2\times10^{-6}.
+\]
+
+\end_inset
+
+This probability is about 8 times higher than the probability of success
+ when only 40 symbols were erased.
+ Nevertheless, the odds of successfully decoding on the first try are still
+ only about 1 in 500,000.
+ 
+\end_layout
+
+\begin_layout Paragraph
+Example 3:
+\end_layout
+
+\begin_layout Standard
+Examples 1 and 2 show that a random strategy for selecting symbols to erase
+ is unlikely to be successful unless we are prepared to wait a long time
+ for an answer.
+ So let's modify the strategy to tip the odds in our favor.
+ Let the received word contain 
+\begin_inset Formula $X=40$
+\end_inset
+
+ incorrect symbols, as before, but suppose we know that 10 symbols are significa
+ntly more reliable than the other 53.
+ We might therefore protect the 10 most reliable symbols from erasure, and
+ choose erasures from the smaller set of 
+\begin_inset Formula $N=53$
+\end_inset
+
+ less reliable symbols.
+ If 
+\begin_inset Formula $s=45$
+\end_inset
+
+ symbols are chosen randomly in this way, it is still necessary for the
+ erased symbols to include at least 37 errors, as in Example 2.
+ However, the probabilities are now much more favorable: with 
+\begin_inset Formula $N=53$
+\end_inset
+
+, 
+\begin_inset Formula $X=40$
+\end_inset
+
+, and 
+\begin_inset Formula $s=45$
+\end_inset
+
+, Eq.
+ (
+\begin_inset CommandInset ref
+LatexCommand ref
+reference "eq:hypergeometric_pdf"
+
+\end_inset
+
+) yields 
+\begin_inset Formula $P(x\ge37)=0.016$
+\end_inset
+
+.
+ Even better odds are obtained by choosing 
+\begin_inset Formula $s=47$
+\end_inset
+
+, which requires 
+\begin_inset Formula $x\ge38$
+\end_inset
+
+.
+ With 
+\begin_inset Formula $N=53$
+\end_inset
+
+, 
+\begin_inset Formula $X=40$
+\end_inset
+
+, and 
+\begin_inset Formula $s=47$
+\end_inset
+
+, 
+\begin_inset Formula $P(x\ge38)=0.0266$
+\end_inset
+
+.
+ The odds for successful decoding on the first try are now about 1 in 38.
+ A few hundred independently randomized tries would be enough to all-but-guarant
+ee production of a valid codeword by the BM decoder.
+\end_layout
+
+\begin_layout Section
+\begin_inset CommandInset label
+LatexCommand label
+name "sec:The-decoding-algorithm"
+
+\end_inset
+
+The FT decoding algorithm
+\end_layout
+
+\begin_layout Standard
+Example 3 shows how reliable information about symbol quality should make
+ it possible to decode received frames having a large number of errors.
+ In practice the number of errors in the received word is unknown, so we
+ use a stochastic algorithm to assign a high erasure probability to low-quality
+ symbols and a relatively low probability to high-quality symbols.
+ As illustrated by Example 3, a good choice of these probabilities can increase
+ the chance of a successful decode by many orders of magnitude.
+\end_layout
+
+\begin_layout Standard
+The FT algorithm uses two quality indices made available by a noncoherent
+ 64-FSK demodulator.
+ The demodulator identifies the most likely value for each symbol based
+ on which of 64 frequency bins contains the the largest signal-plus-noise
+ power.
+ The fraction of total power in the two bins containing the largest and
+ second-largest powers (denoted by 
+\begin_inset Formula $p_{1}$
+\end_inset
+
+ and 
+\begin_inset Formula $p_{2}$
+\end_inset
+
+, respectively) are passed to the decoder from the demodulator as 
+\begin_inset Quotes eld
+\end_inset
+
+soft-symbol
+\begin_inset Quotes erd
+\end_inset
+
+ information.
+ The decoder derives two metrics from 
+\begin_inset Formula $\{p_{1},p_{2}\}:$
+\end_inset
+
+
+\end_layout
+
+\begin_layout Itemize
+\begin_inset Formula $p_{1}$
+\end_inset
+
+-rank: the rank 
+\begin_inset Formula $\{1,2,\ldots,63\}$
+\end_inset
+
+ of the symbol's fractional power, 
+\begin_inset Formula $p_{1}$
+\end_inset
+
+ in the sorted list of 
+\begin_inset Formula $p_{1}$
+\end_inset
+
+ values.
+ High ranking symbols have larger signal-to-noise ratio than those with
+ lower rank.
+\end_layout
+
+\begin_layout Itemize
+\begin_inset Formula $p_{2}/p_{1}$
+\end_inset
+
+: when 
+\begin_inset Formula $p_{2}/p_{1}$
+\end_inset
+
+ is not small compared to 1, the most likely symbol value is only slightly
+ more reliable than the second most likely one.
+\end_layout
+
+\begin_layout Standard
+The FT decoder uses a table of symbol error probabilities derived from a
+ large dataset of received words that have been successfully decoded.
+ The table provides an estimate of the 
+\emph on
+a-priori
+\emph default
+ probability of symbol error based on a given symbol's 
+\begin_inset Formula $p_{1}$
+\end_inset
+
+-rank and 
+\begin_inset Formula $p_{2}/p_{1}$
+\end_inset
+
+ metrics.
+ These probabilities are close to 1 for low-quality symbols and close to
+ 0 for high-quality symbols.
+ Recall from Examples 2 and 3 that best performance was obtained with 
+\begin_inset Formula $s>X$
+\end_inset
+
+.
+ Correspondingly, the FT algorithm works best when the probability of erasing
+ a symbol is somewhat larger than the probability that the symbol is incorrect.
+ We found empirically that good decoding performance is obtained when the
+ symbol erasure probability is about 1.3 times the symbol error probability.
+\end_layout
+
+\begin_layout Standard
+The FT algorithm tries successively to decode the received word using independen
+t 
+\begin_inset Quotes eld
+\end_inset
+
+educated guesses
+\begin_inset Quotes erd
+\end_inset
+
+ to select symbols for erasure.
+ For each iteration a stochastic erasure vector is generated based on the
+ symbol erasure probabilities.
+ The erasure vector is sent to the BM decoder along with the full set of
+ 63 received symbols.
+ When the BM decoder finds a candidate codeword it is assigned a quality
+ metric 
+\begin_inset Formula $d_{s}$
+\end_inset
+
+ defined as the soft distance between the received word and the codeword,
+ where
+\begin_inset Formula 
+\begin{equation}
+d_{s}=\sum_{i=1}^{n}\alpha_{i}\,(1+p_{1,i}).\label{eq:soft_distance}
+\end{equation}
+
+\end_inset
+
+Here 
+\begin_inset Formula $\alpha_{i}=0$
+\end_inset
+
+ if received symbol 
+\begin_inset Formula $i$
+\end_inset
+
+ is the same as the corresponding symbol in the codeword, 
+\begin_inset Formula $\alpha_{i}=1$
+\end_inset
+
+ if the received symbol and codeword symbol are different, and 
+\begin_inset Formula $p_{1,i}$
+\end_inset
+
+ is the fractional power associated with received symbol 
+\begin_inset Formula $i$
+\end_inset
+
+.
+ Think of the soft distance as made up of two terms: the first is the Hamming
+ distance between the received word and the codeword, and the second ensures
+ that if two candidate codewords have the same Hamming distance from the
+ received word, a smaller soft distance will be assigned to the one where
+ differences occur in symbols of lower estimated reliability.
+\end_layout
+
+\begin_layout Standard
+Technically the FT algorithm is a list decoder, potentially generating a
+ list of candidate codewords.
+ Among the list of candidate codewords found by the stochastic search algorithm,
+ only the one with the smallest soft distance from the received word is
+ retained.
+ As with all such algorithms, a stopping criterion is necessary.
+ FT accepts a codeword unconditionally if its soft distance is smaller than
+ an empirically determined acceptance threshold, 
+\begin_inset Formula $d_{a}$
+\end_inset
+
+.
+ A timeout is used to limit the algorithm's execution time if no codewords
+ within soft distance 
+\begin_inset Formula $d_{a}$
+\end_inset
+
+ of the received word are found in a reasonable number of trials.
+\end_layout
+
+\begin_layout Paragraph
+Algorithm pseudo-code:
+\end_layout
+
+\begin_layout Enumerate
+For each received symbol, define the erasure probability as 1.3 times the
+ 
+\emph on
+a priori
+\emph default
+ symbol-error probability determined from soft-symbol information 
+\begin_inset Formula $\{p_{1}\textrm{-rank},\, p_{2}/p_{1}\}$
+\end_inset
+
+.
+ 
+\end_layout
+
+\begin_layout Enumerate
+Make independent stochastic decisions about whether to erase each symbol
+ by using the symbol's erasure probability, allowing a maximum of 51 erasures.
+\end_layout
+
+\begin_layout Enumerate
+Attempt errors-and-erasures decoding by using the BM algorithm and the set
+ of eraseures determined in step 2.
+ If the BM decoder is successful go to step 5.
+\end_layout
+
+\begin_layout Enumerate
+If decoding is not successful, go to step 2.
+\end_layout
+
+\begin_layout Enumerate
+Calculate the soft distance 
+\begin_inset Formula $d_{s}$
+\end_inset
+
+ between the candidate codeword and the received symbols.
+ Set 
+\begin_inset Formula $d_{s,min}=d_{s}$
+\end_inset
+
+ if the soft distance is the smallest one encountered so far.
+\end_layout
+
+\begin_layout Enumerate
+If 
+\begin_inset Formula $d_{s,min}\le d_{a}$
+\end_inset
+
+, go to 8.
+ 
+\end_layout
+
+\begin_layout Enumerate
+If the number of trials is less than the maximum allowed number, go to 2.
+ Otherwise, declare decoding failure and exit.
+\end_layout
+
+\begin_layout Enumerate
+A 
+\begin_inset Quotes eld
+\end_inset
+
+best
+\begin_inset Quotes erd
+\end_inset
+
+ codeword with 
+\begin_inset Formula $d_{s,min}\le d_{a}$
+\end_inset
+
+ has been found.
+ Declare a successful decode and return this codeword .
+\end_layout
+
+\begin_layout Section
+Results and Comparison with KVASD
+\end_layout
+
+\begin_layout Standard
+Possible figures:
+\end_layout
+
+\begin_layout Itemize
+histogram of 
+\begin_inset Formula $s$
+\end_inset
+
+ (number of erasures) for succeffsul decodes with HF and EME data
+\end_layout
+
+\begin_layout Itemize
+histogram of 
+\begin_inset Quotes eld
+\end_inset
+
+ntrials
+\begin_inset Quotes erd
+\end_inset
+
+ (or execution time)
+\end_layout
+
+\begin_layout Itemize
+Number of decodes vs.
+ ntrials
+\end_layout
+
+\begin_layout Itemize
+Probability of successful decode vs.
+ Es/No or S/N in 2500 Hz BW
+\begin_inset Float figure
+wide false
+sideways false
+status open
+
+\begin_layout Plain Layout
+\align center
+\begin_inset Graphics
+	filename fig_psuccess.pdf
+
+\end_inset
+
+
+\end_layout
+
+\begin_layout Plain Layout
+\begin_inset Caption Standard
+
+\begin_layout Plain Layout
+Percentage of JT65 messages successfully decoded as a function of SNR in
+ 2.5 kHz bandwidth.
+ Results are shown for the hard-decision Berlekamp-Massey (BM) and the Franke-Ta
+ylor (FT) decoding algorithms.
+\end_layout
+
+\end_inset
+
+
+\end_layout
+
+\begin_layout Plain Layout
+
+\end_layout
+
+\end_inset
+
+
+\end_layout
+
+\begin_layout Itemize
+other...
+ ?
+\end_layout
+
+\begin_layout Section
+Summary 
+\end_layout
+
+\begin_layout Bibliography
+\begin_inset CommandInset bibitem
+LatexCommand bibitem
+key "key-1"
+
+\end_inset
+
+
+\end_layout
+
+\end_body
+\end_document