w4kek/WSJT-X
1
0
Fork 0
mirror of https://github.com/saitohirga/WSJT-X.git synced 2025-02-03 09:44:24 -05:00
Code Issues Packages Projects Releases Wiki Activity

Fix two small typos.

Browse Source 
git-svn-id: svn+ssh://svn.code.sf.net/p/wsjt/wsjt/branches/wsjtx@6369 ab8295b8-cf94-4d9e-aec4-7959e3be5d79
This commit is contained in:
Steven Franke 2016-01-09 02:38:49 +00:00
parent e0f40f71fc
commit 33b46a60cb
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -246,7 +246,7 @@ The minimum Hamming distance of the JT65 code is
\end_inset \end_inset
, which means that any particular codeword differs from all other codewords , which means that any particular codeword differs from all other codewords
in at least 52 or the 63 symbol positions. in at least 52 of the 63 symbol positions.
\end_layout \end_layout
@ -849,7 +849,7 @@ The FT algorithm uses quality indices made available by a noncoherent 64-FSK
\end_inset \end_inset
of the symbol's fractional power of the symbol's fractional power
\begin_inset Formula $p_{1,\,j}$ \begin_inset Formula $p_{1,\, j}$
\end_inset \end_inset
in a sorted list of in a sorted list of
@ -919,7 +919,7 @@ t educated guesses to select symbols for erasure.
, the soft distance between the received word and the codeword: , the soft distance between the received word and the codeword:
\begin_inset Formula \begin_inset Formula
\begin{equation} \begin{equation}
d_{s}=\sum_{j=1}^{n}\alpha_{j}\,(1+p_{1,\,j}).\label{eq:soft_distance} d_{s}=\sum_{j=1}^{n}\alpha_{j}\,(1+p_{1,\, j}).\label{eq:soft_distance}
\end{equation} \end{equation}
\end_inset \end_inset
@ -937,7 +937,7 @@ Here
\end_inset \end_inset
if the received symbol and codeword symbol are different, and if the received symbol and codeword symbol are different, and
\begin_inset Formula $p_{1,\,j}$ \begin_inset Formula $p_{1,\, j}$
\end_inset \end_inset
is the fractional power associated with received symbol is the fractional power associated with received symbol
@ -981,7 +981,7 @@ In practice we find that
\begin_layout Standard \begin_layout Standard
\begin_inset Formula \begin_inset Formula
\begin{equation} \begin{equation}
u=\frac{1}{n}\sum_{j=1}^{n}S(c_{j},\,j).\label{eq:u-metric} u=\frac{1}{n}\sum_{j=1}^{n}S(c_{j},\, j).\label{eq:u-metric}
\end{equation} \end{equation}
\end_inset \end_inset
@ -1014,7 +1014,7 @@ The correct JT65 codeword produces a value for
bins containing noise only. bins containing noise only.
Thus, if the spectral array Thus, if the spectral array
\begin_inset Formula $S(i,\,j)$ \begin_inset Formula $S(i,\, j)$
\end_inset \end_inset
has been normalized so that the average value of the noise-only bins is has been normalized so that the average value of the noise-only bins is
@ -1263,7 +1263,7 @@ For each received symbol, define the erasure probability as 1.3 times the
a priori a priori
\emph default \emph default
symbol-error probability determined from soft-symbol information 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 \end_inset
. .
@ -1595,7 +1595,7 @@ If
\begin_inset Formula $u$ \begin_inset Formula $u$
\end_inset \end_inset
is the largest found so far, presevre any previous value of is the largest found so far, preserve any previous value of
\begin_inset Formula $u_{1}$ \begin_inset Formula $u_{1}$
\end_inset \end_inset