w4kek/WSJT-X
1
0
Fork 0
mirror of https://github.com/saitohirga/WSJT-X.git synced 2024-11-01 08:07:10 -04:00
Code Issues Packages Projects Releases Wiki Activity

A few more edits to oo 8-11, the sections on algorithms.

Browse Source 
git-svn-id: svn+ssh://svn.code.sf.net/p/wsjt/wsjt/branches/wsjtx@6364 ab8295b8-cf94-4d9e-aec4-7959e3be5d79
This commit is contained in:
Joe Taylor 2016-01-08 20:43:47 +00:00
parent 2890ffe2f3
commit 8624c593be
1 changed files with 14 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
lib/ftrsd/ftrsd_paper/ftrsd.lyx
View File

@ -1167,7 +1167,7 @@ If the signal-to-noise ratio
.
We therefore apply a ratio threshold test, say
\begin_inset Formula $r<r_{1}$
\begin_inset Formula $r<R_{1}$
\end_inset
, to identify codewords with high probability of being correct.
@ -1179,7 +1179,7 @@ reference "sec:Theory,-Simulation,-and"
\end_inset
, we use simulations to set an empirical acceptance threshold
\begin_inset Formula $r_{1}$
\begin_inset Formula $R_{1}$
\end_inset
that maximizes the probability of correct decodes while ensuring a low
@ -1208,16 +1208,16 @@ Technically the FT algorithm is a list decoder.
\end_inset
and
\begin_inset Formula $d_{0}$
\begin_inset Formula $D_{0}$
\end_inset
.
Secondary acceptance criteria
\begin_inset Formula $d_{s}<d_{1}$
\begin_inset Formula $d_{s}<D_{1}$
\end_inset
and
\begin_inset Formula $r<r_{1}$
\begin_inset Formula $r<R_{1}$
\end_inset
are used to validate additional codewords that did not pass the first test.
@ -1338,7 +1338,7 @@ If
\end_inset
and
\begin_inset Formula $d_{s}<D_{0}$
\begin_inset Formula $d_{1}<D_{0}$
\end_inset
, go to step 11.
@ -1363,7 +1363,7 @@ If
\end_inset
and
\begin_inset Formula $r=u2/u1<r_{1},$
\begin_inset Formula $r=u_{2}/u_{1}<R_{1},$
\end_inset
go to step 11.
@ -1518,8 +1518,8 @@ For hinted decoding we again invoke a ratio threshold test, but in this
the largest and second-largest values of total signal-plus-noise power
among all the tested codewords.
Once again the criterion for comparison is chosen empirically to maximize
the number of correct decodes while ensuring that false decodes are rare.
The criterion for comparison is chosen empirically to maximize the number
of correct decodes while ensuring that false decodes are rare.
Because tested candidate codewords are drawn from a list typically no longer
than a few thousand, rather than
\begin_inset Formula $2^{72},$
@ -1604,7 +1604,7 @@ If the number of tested codewords is less than
\begin_layout Enumerate
If
\begin_inset Formula $r=u2/u1<r_{2},$
\begin_inset Formula $r=u_{2}/u_{1}<R_{2},$
\end_inset
go to step 7.
@ -1674,19 +1674,19 @@ reference "sec:Appendix:SNR"
\end_inset
\begin_inset Formula $d_{0},$
\begin_inset Formula $D_{0},$
\end_inset
\begin_inset Formula $d_{1},$
\begin_inset Formula $D_{1},$
\end_inset
\begin_inset Formula $r_{1},$
\begin_inset Formula $R_{1},$
\end_inset
and
\begin_inset Formula $r_{2}.$
\begin_inset Formula $R_{2}.$
\end_inset