w4kek
/
WSJT-X
mirror of https://github.com/saitohirga/WSJT-X.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fix misprints in equation 4 and 5 

git-svn-id: svn+ssh://svn.code.sf.net/p/wsjt/wsjt/branches/wsjtx@6313 ab8295b8-cf94-4d9e-aec4-7959e3be5d79
This commit is contained in:
Steven Franke 2015-12-24 19:44:30 +00:00
parent 459f74ac60
commit e2dcc912a1
1 changed files with 1623 additions and 1623 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -392,7 +392,7 @@ tric probability distribution.
\begin_layout Standard
\begin_inset Formula
\begin{equation}
P(x=\epsilon|N,X,s)=\frac{\binom{X}{x}\binom{N-X}{s-\epsilon}}{\binom{N}{s}}\label{eq:hypergeometric_pdf}
P(x=\epsilon|N,X,s)=\frac{\binom{X}{\epsilon}\binom{N-X}{s-\epsilon}}{\binom{N}{s}}\label{eq:hypergeometric_pdf}
\end{equation}
\end_inset
@ -456,7 +456,7 @@ hygepdf(
errors is
\begin_inset Formula
\begin{equation}
P(x\ge\epsilon|N,X,s)=\sum_{j=\epsilon}^{N}P(x=j|N,X,s).\label{eq:cumulative_prob}
P(x\ge\epsilon|N,X,s)=\sum_{j=\epsilon}^{s}P(x=j|N,X,s).\label{eq:cumulative_prob}
\end{equation}
\end_inset
@ -735,7 +735,7 @@ and
\end_inset
of the symbol's fractional power
\begin_inset Formula $p_{1,\,j}$
\begin_inset Formula $p_{1,\, j}$
\end_inset
in a sorted list of
@ -878,7 +878,7 @@ and
\begin_layout Standard
\begin_inset Formula
\[
u=\frac{1}{n}\sum_{j=1}^{n}S(c_{j},\,j).
u=\frac{1}{n}\sum_{j=1}^{n}S(c_{j},\, j).
\]
\end_inset
@ -911,7 +911,7 @@ The correct JT65 codeword produces a value for
bins containing noise only.
Thus, if the spectral array
\begin_inset Formula $S(i,\,j)$
\begin_inset Formula $S(i,\, j)$
\end_inset
has been normalized so that its median value (essentially the average noise
@ -949,7 +949,7 @@ For JT65 this expression evaluates to
\begin_layout Standard
\begin_inset Formula
\[
u\approx1\pm0.13+(0.19\pm0.06)\,y.
u\approx1\pm0.13+(0.19\pm0.06)\, y.
\]
\end_inset
@ -1028,7 +1028,7 @@ For each received symbol, define the erasure probability as 1.3 times the
a priori
\emph default
symbol-error probability determined from soft-symbol information
\begin_inset Formula $\{p_{1}\textrm{-rank},\,p_{2}/p_{1}\}$
\begin_inset Formula $\{p_{1}\textrm{-rank},\, p_{2}/p_{1}\}$
\end_inset
.