processig 0.0.2

digital signal processing tools
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83

\documentclass {IEEEtran}

%% \ifCLASSOPTIONcompsoc
%% % IEEE Computer Society needs nocompress option
%% % requires cite.sty v4.0 or later (November 2003)
%% \usepackage[nocompress]{cite}
%% \else
%% % normal IEEE
%% \usepackage{cite}
%% \fi

\usepackage{amsmath}
\usepackage{tikz}
\usepackage{algorithm2e}

\begin {document}

\title {Notes on FFT Implementation in Processig}

\author {Bill~Liu}

% The paper headers
%% \markboth{Journal of \LaTeX\ Class Files,~Vol.~14, No.~8, August~2015}%
%%          {Shell \MakeLowercase{\textit{et al.}}: Bare Demo of IEEEtran.cls for Computer Society Journals}

         \IEEEtitleabstractindextext{%
           \begin{abstract}
             This serves as a collection of notes and implementation details of FFT within the Processig Rust crate.
           \end{abstract}

           % Note that keywords are not normally used for peerreview papers.
           \begin{IEEEkeywords}
             FFT
         \end{IEEEkeywords}}
         
         % make the title area
         \maketitle

         \IEEEPARstart{T}{his} document briefly outlines the background and proceeds to describe the implementation of FFT algorithm.

         \section{Background}
         The Fast Fourier Transform and its inverse are commonly used for transforming signals into point-value forms to be pointwise multiplied and then converted back to polynomial coefficient form. 
         \begin{algorithm}[H]
           \KwData{this text}
           \KwResult{how to write algorithm with \LaTeX2e }
           initialization\;
           \While{not at end of this document}{
             read current\;
             \eIf{understand}{
               go to next section\;
               current section becomes this one\;
             }{
               go back to the beginning of current section\;
             }
           }
           \caption{How to write algorithms}
         \end{algorithm}

         \begin{tikzpicture}
           \draw (1,0) -- (0,0) -- (0,1);
         \end{tikzpicture}
         
         \section{Implementation}
         The conclusion goes here.

         \appendices
         \section{Proof of the First Zonklar Equation}
         Appendix one text goes here.

         % you can choose not to have a title for an appendix
         % if you want by leaving the argument blank
         \section{}
         Appendix two text goes here.

         %% \begin{thebibliography}{1}

         %% \bibitem{IEEEhowto:kopka}
         %%   H.~Kopka and P.~W. Daly, \emph{A Guide to \LaTeX}, 3rd~ed.\hskip 1em plus
         %%   0.5em minus 0.4em\relax Harlow, England: Addison-Wesley, 1999.

         %% \end{thebibliography}

\end {document}