High-Level Plots neu

chapter_03.tex

@@ -119,7 +119,7 @@ After the general functionality of the \ac{ANR} algorithm has been verified with
 \noindent The error signal in Figure \ref{fig:fig_plot_2_wav.png} confirms the function of the algorithm and shows maxima corresponding to the maxima in the breathing noise, indicating the moments, when the \ac{ANR} algorithm is setting its coefficients again to adapt to the changing noise characteristics. It makes sense, that the adaption of the filter coefficients causes repeating maxima in the error signal, as the noise signal now is not static or periodic, but rather dynamic and changing it frequency and amplitude over time. The \ac{SNR}-Gain of 6.51 dB also indicates a significant improvement in signal quality and can be compared againtst the complex use case in the next subchapter, where the same audio tracks are used, but now with different transfer functions applied to them.
 \subsection{Complex ANR use case}
 To close the topic of high-level simulations of the \ac{ANR} algorithm, a more complex and realistic use case is finally introduced. In this scenario, the same two audio tracks of the previous use case are used - but now they pass different transfer functions. Now, an analytical solution is not possible anymore, as the transfer functions affect the signals in different ways, making it impossible to simply subtract the noise signal from the corrupted signal. This scenario represents a more realistic application of the \ac{ANR} algorithm, as it involves complex audio signals with varying frequency components and dynamics, as well as different transfer functions affecting the signals.\\ \\
-Therefore, the audio tracks from the previous example are now convolved with different transfer functions, which mimic the case, that the sensor recording the corrupted signal, shows another frequency response characteristic as the one recording the reference noise signal. This means, that the reference noise signal is now different to the noise signal corrupting the desired signal, making adaptive noise reduction the only feasible approach to reduce the noise from the corrupted signal.
+Therefore, the audio tracks from the previous example are now convolved with different transfer functions, which mimic the case, that the sensor recording the corrupted signal, shows another frequency response characteristic as the one recording the reference noise signal. Additionaly, a delay of 2 ms between the two signals is introduced, mimicing different loactions of the sensors and different preprocessing of the signals. This means, that the reference noise signal is now not only differs from the noise signal corrupting the desired signal but also reaching the secondary sensor delayed, making adaptive noise reduction the only feasible approach to reduce the noise from the corrupted signal.
 \begin{figure}[H]
     \centering
     \includegraphics[width=1.0\linewidth]{Bilder/fig_plot_3_wav_complex.png}
@@ -133,14 +133,14 @@ Therefore, the audio tracks from the previous example are now convolved with dif
     \caption{The raw noise signal recorded with two different sensors, showing the effect of different transfer functions on the signal}
     \label{fig:fig_plot_4_wav_complex.png}
 \end{figure}
-\noindent To evaluate the performance of the \ac{ANR} algorithm in this complex scenario, the corrupted signal is recorded with the primary sensor while the reference noise signal is recorded with secondary sensor. The filter output in Figure \ref{fig:fig_plot_1_wav_complex.png} indicates, that the \ac{ANR} algorithm is still capable of significantly reducing the noise from the corrupted signal, even with the reference noise signal being different from the corruption noise signal. 
+\noindent To evaluate the performance of the \ac{ANR} algorithm in this complex scenario, the corrupted signal is recorded with the primary sensor while the reference noise signal is recorded with secondary sensor. The filter output and \ac{SNR}-Ratio in Figure \ref{fig:fig_plot_1_wav_complex.png} display with 5.14 dB a significantly worse performance compared to the previous use case. This bevavior is perfectly explainable by the fact, that the introduced delay is taking the small 16 tap filter already to its limit to adapt effectively, as the noise signal is already changing significantly after 2 ms. A longer filter would be required to adapt effectively, especially if the noise signal would show a higher dynamics.
 \begin{figure}[H]
     \centering
     \includegraphics[width=1.0\linewidth]{Bilder/fig_plot_1_wav_complex.png}
     \caption{Desired signal, corrupted signal, reference noise signal and filter output of the complex \ac{ANR} use case}
     \label{fig:fig_plot_1_wav_complex.png}
 \end{figure}
-\noindent The error signal in Figure \ref{fig:fig_plot_2_wav_complex.png} shows, as expected, a slightly wore performance to the previous intermediate use case, indicating that the \ac{ANR} algorithm is confronted by a more challening task. The performance decrease can be explained by the fact, that the transfer functions applied to the signals have attenuated certain frequency components of the noise signal, making it harder for the \ac{ANR} algorithm to isolate and reduce the noise from the corrupted signal. Also, the corruption noise signal is reduced in amplitude, whereas the reference noise signal is amplified in certain frequency areas. Still, the \ac{SNR}-Gain of 6.15 dB still indicates a quite sucessful noise reduction, even in this more complex scenario.
+\noindent The error signal in Figure \ref{fig:fig_plot_2_wav_complex.png} shows, as expected, also a increased amplitude compared to the previous intermediate use case, indicating that the \ac{ANR} algorithm is confronted by a more challening task. Still, the \ac{SNR}-Gain of 5.14 dB still indicates a quite sucessful noise reduction, even with just 16 taps in this more complex scenario.
 \begin{figure}[H]
     \centering
     \includegraphics[width=1.0\linewidth]{Bilder/fig_plot_2_wav_complex.png}

chapter_04.aux

@@ -1,5 +1,5 @@
 \relax 
-\@writefile{toc}{\contentsline {section}{\numberline {4}Hardware implementation and optimization of the ANR Algorithm on a low-power system}{40}{}\protected@file@percent }
+\@writefile{toc}{\contentsline {section}{\numberline {4}Hardware implementation and performance quantization of the ANR Algorithm on a low-power system}{40}{}\protected@file@percent }
 \acronymused{ANR}
 \acronymused{CI}
 \acronymused{ANR}
@@ -218,12 +218,6 @@
 \newlabel{equation_c_5}{{30}{54}{}{}{}}
 \newlabel{equation_computing_final}{{31}{55}{}{}{}}
 \acronymused{DSP}
-\@writefile{toc}{\contentsline {subsubsection}{\numberline {4.3.3}Performance evaluation of different implementation variants}{55}{}\protected@file@percent }
-\acronymused{DSP}
-\acronymused{ANR}
-\acronymused{FIR}
-\acronymused{ANR}
-\acronymused{SNR}
 \@setckpt{chapter_04}{
 \setcounter{page}{56}
 \setcounter{equation}{31}
@@ -236,7 +230,7 @@
 \setcounter{part}{0}
 \setcounter{section}{4}
 \setcounter{subsection}{3}
-\setcounter{subsubsection}{3}
+\setcounter{subsubsection}{2}
 \setcounter{paragraph}{0}
 \setcounter{subparagraph}{0}
 \setcounter{figure}{44}

chapter_04.tex

@@ -1,4 +1,4 @@
-\section{Hardware implementation and optimization of the ANR Algorithm on a low-power system}
+\section{Hardware implementation and performance quantization of the ANR Algorithm on a low-power system}
 This section can be considered as the heart of this thesis. The first subchapter describes the hardware, on which the \ac{ANR} algorithm is implemented, including its environment, which serves as a link to the \ac{CI} system itself. The following subchapter continues with the basic implementation of the \ac{ANR} algorithm on the hardware itself and shall provide the reader with a basic understanding of its challenges, possibilities and limitations. This basic implementation is then low-level simulated with some of the previuous use cases to get some idea of the general performance.\\
 The last subchapter picks the final optimizations of the \ac{ANR} algorithm itself as a central theme, especially with respect to the capabilities of a hybrid \ac{ANR} approach.
 \subsection{Low-power system architecture and integration}
@@ -262,8 +262,6 @@ C_{write\_output} = 5 \\
  C_{total} = N + \frac{6*N+8}{U} + 34
 \end{equation}
 Equation \ref{equation_computing_final} now provides an estimation of the necessary computing effort for one output sample in relation to the filter length $N$ and the update rate of the filter coefficients $1/U$. This formula can now be used to estimate the needed computing power (and therefore the power consumption) of the \ac{DSP} core for different parameter settings, alowing to find an optimal parameter configuration in regard of the quality of the noise reduction and the power consumption of the system.
-\subsubsection{Performance evaluation of different implementation variants}
-To verify the general performance of the \ac{DSP} implemented \ac{ANR} algorithm, the complex usecase of the high-level implemenation is used, which includes a 16-tap \ac{FIR} filter and an update of the filter coefficients every cycle. In contary to the high-level implementation, the coeffcient convergence is now not included in the evaluation anymore, but the metric for the \ac{ANR} performance stays the same as the \ac{SNR} improvement  
 
 
 

chapter_05.aux

@@ -0,0 +1,171 @@
+\relax 
+\@writefile{toc}{\contentsline {section}{\numberline {5}Performance evaluation of different implementation variants}{56}{}\protected@file@percent }
+\acronymused{DSP}
+\acronymused{ANR}
+\acronymused{FIR}
+\acronymused{ANR}
+\acronymused{SNR}
+\@writefile{lof}{\contentsline {figure}{\numberline {45}{\ignorespaces Desired signal, corrupted signal, reference noise signal and filter output of the complex \ac {ANR} use case, simulated on the \ac {DSP}}}{56}{}\protected@file@percent }
+\acronymused{ANR}
+\acronymused{DSP}
+\newlabel{fig:fig_plot_1_dsp_complex.png}{{45}{56}{}{}{}}
+\@writefile{lof}{\contentsline {figure}{\numberline {46}{\ignorespaces Error signal and filter coefficient evolution of the complex \ac {ANR} use case, simulated on the \ac {DSP}}}{57}{}\protected@file@percent }
+\acronymused{ANR}
+\acronymused{DSP}
+\newlabel{fig:fig_plot_2_dsp_complex.png}{{46}{57}{}{}{}}
+\acronymused{ANR}
+\acronymused{DSP}
+\acronymused{SNR}
+\acronymused{DSP}
+\acronymused{DSP}
+\acronymused{ANR}
+\acronymused{DSP}
+\@setckpt{chapter_05}{
+\setcounter{page}{58}
+\setcounter{equation}{31}
+\setcounter{enumi}{0}
+\setcounter{enumii}{0}
+\setcounter{enumiii}{0}
+\setcounter{enumiv}{0}
+\setcounter{footnote}{0}
+\setcounter{mpfootnote}{0}
+\setcounter{part}{0}
+\setcounter{section}{5}
+\setcounter{subsection}{0}
+\setcounter{subsubsection}{0}
+\setcounter{paragraph}{0}
+\setcounter{subparagraph}{0}
+\setcounter{figure}{46}
+\setcounter{table}{0}
+\setcounter{float@type}{16}
+\setcounter{tabx@nest}{0}
+\setcounter{listtotal}{0}
+\setcounter{listcount}{0}
+\setcounter{liststart}{0}
+\setcounter{liststop}{0}
+\setcounter{citecount}{0}
+\setcounter{citetotal}{0}
+\setcounter{multicitecount}{0}
+\setcounter{multicitetotal}{0}
+\setcounter{instcount}{18}
+\setcounter{maxnames}{3}
+\setcounter{minnames}{1}
+\setcounter{maxitems}{3}
+\setcounter{minitems}{1}
+\setcounter{citecounter}{0}
+\setcounter{maxcitecounter}{0}
+\setcounter{savedcitecounter}{0}
+\setcounter{uniquelist}{0}
+\setcounter{uniquename}{0}
+\setcounter{refsection}{0}
+\setcounter{refsegment}{0}
+\setcounter{maxextratitle}{0}
+\setcounter{maxextratitleyear}{0}
+\setcounter{maxextraname}{3}
+\setcounter{maxextradate}{0}
+\setcounter{maxextraalpha}{0}
+\setcounter{abbrvpenalty}{50}
+\setcounter{highnamepenalty}{50}
+\setcounter{lownamepenalty}{25}
+\setcounter{maxparens}{3}
+\setcounter{parenlevel}{0}
+\setcounter{blx@maxsection}{0}
+\setcounter{mincomprange}{10}
+\setcounter{maxcomprange}{100000}
+\setcounter{mincompwidth}{1}
+\setcounter{afterword}{0}
+\setcounter{savedafterword}{0}
+\setcounter{annotator}{0}
+\setcounter{savedannotator}{0}
+\setcounter{author}{0}
+\setcounter{savedauthor}{0}
+\setcounter{bookauthor}{0}
+\setcounter{savedbookauthor}{0}
+\setcounter{commentator}{0}
+\setcounter{savedcommentator}{0}
+\setcounter{editor}{0}
+\setcounter{savededitor}{0}
+\setcounter{editora}{0}
+\setcounter{savededitora}{0}
+\setcounter{editorb}{0}
+\setcounter{savededitorb}{0}
+\setcounter{editorc}{0}
+\setcounter{savededitorc}{0}
+\setcounter{foreword}{0}
+\setcounter{savedforeword}{0}
+\setcounter{holder}{0}
+\setcounter{savedholder}{0}
+\setcounter{introduction}{0}
+\setcounter{savedintroduction}{0}
+\setcounter{namea}{0}
+\setcounter{savednamea}{0}
+\setcounter{nameb}{0}
+\setcounter{savednameb}{0}
+\setcounter{namec}{0}
+\setcounter{savednamec}{0}
+\setcounter{translator}{0}
+\setcounter{savedtranslator}{0}
+\setcounter{shortauthor}{0}
+\setcounter{savedshortauthor}{0}
+\setcounter{shorteditor}{0}
+\setcounter{savedshorteditor}{0}
+\setcounter{labelname}{0}
+\setcounter{savedlabelname}{0}
+\setcounter{institution}{0}
+\setcounter{savedinstitution}{0}
+\setcounter{lista}{0}
+\setcounter{savedlista}{0}
+\setcounter{listb}{0}
+\setcounter{savedlistb}{0}
+\setcounter{listc}{0}
+\setcounter{savedlistc}{0}
+\setcounter{listd}{0}
+\setcounter{savedlistd}{0}
+\setcounter{liste}{0}
+\setcounter{savedliste}{0}
+\setcounter{listf}{0}
+\setcounter{savedlistf}{0}
+\setcounter{location}{0}
+\setcounter{savedlocation}{0}
+\setcounter{organization}{0}
+\setcounter{savedorganization}{0}
+\setcounter{origlocation}{0}
+\setcounter{savedoriglocation}{0}
+\setcounter{origpublisher}{0}
+\setcounter{savedorigpublisher}{0}
+\setcounter{publisher}{0}
+\setcounter{savedpublisher}{0}
+\setcounter{language}{0}
+\setcounter{savedlanguage}{0}
+\setcounter{origlanguage}{0}
+\setcounter{savedoriglanguage}{0}
+\setcounter{pageref}{0}
+\setcounter{savedpageref}{0}
+\setcounter{textcitecount}{0}
+\setcounter{textcitetotal}{0}
+\setcounter{textcitemaxnames}{0}
+\setcounter{biburlbigbreakpenalty}{100}
+\setcounter{biburlbreakpenalty}{200}
+\setcounter{biburlnumpenalty}{0}
+\setcounter{biburlucpenalty}{0}
+\setcounter{biburllcpenalty}{0}
+\setcounter{smartand}{1}
+\setcounter{bbx:relatedcount}{0}
+\setcounter{bbx:relatedtotal}{0}
+\setcounter{parentequation}{0}
+\setcounter{lstnumber}{15}
+\setcounter{FancyVerbLine}{0}
+\setcounter{linenumber}{1}
+\setcounter{LN@truepage}{57}
+\setcounter{FancyVerbWriteLine}{0}
+\setcounter{FancyVerbBufferLine}{0}
+\setcounter{FV@TrueTabGroupLevel}{0}
+\setcounter{FV@TrueTabCounter}{0}
+\setcounter{FV@HighlightLinesStart}{0}
+\setcounter{FV@HighlightLinesStop}{0}
+\setcounter{FancyVerbLineBreakLast}{0}
+\setcounter{FV@BreakBufferDepth}{0}
+\setcounter{minted@FancyVerbLineTemp}{0}
+\setcounter{listing}{0}
+\setcounter{lstlisting}{0}
+}

chapter_05.tex

@@ -0,0 +1,15 @@
+\section{Performance evaluation of different implementation variants}
+To verify the general performance of the \ac{DSP} implemented \ac{ANR} algorithm, the complex usecase of the high-level implemenation is used, which includes a 16-tap \ac{FIR} filter and an update of the filter coefficients every cycle. In contary to the high-level implementation, the coeffcient convergence is now not included in the evaluation anymore, but the metric for the \ac{ANR} performance stays the same as the \ac{SNR} improvement.
+\begin{figure}[H]
+    \centering
+    \includegraphics[width=1.0\linewidth]{Bilder/fig_plot_1_dsp_complex.png}
+    \caption{Desired signal, corrupted signal, reference noise signal and filter output of the complex \ac{ANR} use case, simulated on the \ac{DSP}}
+    \label{fig:fig_plot_1_dsp_complex.png}
+\end{figure}
+\begin{figure}[H]
+    \centering
+    \includegraphics[width=1.0\linewidth]{Bilder/fig_plot_2_dsp_complex.png}
+    \caption{Error signal and filter coefficient evolution of the complex \ac{ANR} use case, simulated on the \ac{DSP}}
+    \label{fig:fig_plot_2_dsp_complex.png}
+\end{figure}  
+Figure \ref{fig:fig_plot_1_dsp_complex.png} and \ref{fig:fig_plot_2_dsp_complex.png} show the results of the complex \ac{ANR} use case, simulated on the \ac{DSP}. The \ac{SNR} improvement of 5.92 dB is nearly the same as the one of the high-level implementation, which is 6.15 dB. The small difference can be explained by the fact that the \ac{DSP} implementation is based on fixed-point arithmetic, which leads to a slightly different convergence behavior. Nevertheless, the results show that the \ac{DSP} implementation of the \ac{ANR} algorithm is able to achieve a similar performance as the high-level implementation. The next step is of evaluate the performance of the \ac{DSP} implementation in terms of computational efficiency under different scenarios.

main.tex

@@ -73,6 +73,7 @@ abstract
 \include{chapter_02}
 \include{chapter_03}
 \include{chapter_04}
+\include{chapter_05}
 \printbibliography
 \listoffigures