From 8ba09d51759ca8768fe78bfd29b558e06b64ea7e Mon Sep 17 00:00:00 2001 From: Joe Taylor Date: Wed, 6 Jan 2016 00:10:54 +0000 Subject: [PATCH] A few more editorial tweaks, and more text. git-svn-id: svn+ssh://svn.code.sf.net/p/wsjt/wsjt/branches/wsjtx@6354 ab8295b8-cf94-4d9e-aec4-7959e3be5d79 --- lib/ftrsd/ftrsd_paper/ftrsd.lyx | 278 ++++++++++++++++++++++---------- 1 file changed, 197 insertions(+), 81 deletions(-) diff --git a/lib/ftrsd/ftrsd_paper/ftrsd.lyx b/lib/ftrsd/ftrsd_paper/ftrsd.lyx index 405c7275e..fa55cf70a 100644 --- a/lib/ftrsd/ftrsd_paper/ftrsd.lyx +++ b/lib/ftrsd/ftrsd_paper/ftrsd.lyx @@ -139,15 +139,21 @@ WSJT-X \emph default , widely used for amateur weak-signal communication with JT65 and other specialized digital modes. - The program is freely available and licensed under the GNU General Public - License. + The program is freely available +\begin_inset CommandInset citation +LatexCommand cite +key "wsjt" + +\end_inset + + and licensed under the GNU General Public License. \end_layout \begin_layout Standard The JT65 protocol specifies transmissions that normally start one second into a UTC minute and last for 46.8 seconds. - Receiving software therefore has up to several seconds to decode a message, - before the operator sends a reply at the start of the next minute. + Receiving software therefore has up to several seconds to decode a message + before the start of the next minute, when the operator sends a reply. With today's personal computers, this relatively long time available for decoding a short message encourages experimentation with decoders of high computational complexity. @@ -158,7 +164,7 @@ The JT65 protocol specifies transmissions that normally start one second properties, not least of which is its conceptual simplicity. Decoding performance and complexity scale in a convenient way, providing steadily increasing soft-decision decoding gain as a tunable computational - complexity parameter is increased over more than 5 orders of magnitude. + complexity parameter is increased over more than five orders of magnitude. Appreciable gain is available from our decoder even on very simple (and relatively slow) computers. On the other hand, because the algorithm benefits from a large number of @@ -405,7 +411,7 @@ probabilistic \begin_inset CommandInset citation LatexCommand cite after "Chapter 10" -key "key-1" +key "lc2004" \end_inset @@ -1224,17 +1230,21 @@ Calculate the hard-decision Hamming distance \begin_inset Formula $X$ \end_inset - between the candidate codeword and the received symbols, the corresponding - soft distance + between the candidate codeword and the received symbols, along with the + corresponding soft distance \begin_inset Formula $d_{s}$ \end_inset -, and the quality metric + and the quality metric \begin_inset Formula $u$ \end_inset . - If + +\end_layout + +\begin_layout Enumerate +If \begin_inset Formula $u$ \end_inset @@ -1242,8 +1252,8 @@ Calculate the hard-decision Hamming distance \begin_inset Formula $u_{1}$ \end_inset - as -\begin_inset Formula $u_{2}$ + by setting +\begin_inset Formula $u_{2}=u_{1}$ \end_inset and then set @@ -1262,11 +1272,11 @@ If \begin_inset Formula $d_{s}