ajouts suite a discussion avec Arthur

jfriedt
1 parent ef6d349d4f
Showing 1 changed file with 7 additions and 7 deletions Side-by-side Diff
ifcs2018_poster.tex
@@ -98,15 +98,15 @@
 %\setlength{\itemsep}{0pt}%
 %\setlength{\parskip}{0pt}%
 \vspace{-.40cm}
-  \addblock{0.44\textwidth}{
+  \addblock{0.38\textwidth}{
 %  \begin{enumerate}[noitemsep,nolistsep]
 %    \item 
 \textbf{1. Classical way:}\\
-    Compute the transfer function of a monolithic filter
+    Compute transfer function of a monolithic filter
     \begin{itemize}[label=$\Rightarrow$, noitemsep, nolistsep]
       {\color{Green}\item Simplest way to design filter}
-      {\color{Green}\item Great rejection}
-      {\color{Red}\item Consume lot of resources on FPGA}
+      {\color{Red}\item Fixed configuration (bits/coef.)}
+      {\color{Red}\item High resource consumption on FPGA}
     \end{itemize}
 %  \end{enumerate}
   }
  
@@ -115,10 +115,10 @@
 %    \setcounter{enumi}{1}
 %    \item 
 \textbf{2. Alternative way (our focus):}\\
-    Chain of small filters
+    Cascade of small(er) filters
     \begin{itemize}[label=$\Rightarrow$, noitemsep, nolistsep]
       {\color{Green}\item Fewer resource consumption on FPGA}
-      {\color{Green}\item Greater rejection}
+      {\color{Green}\item Flexibility (increasing bits/coef.)}
       {\color{Red}\item Harder way to design filter}
     \end{itemize}
 %  \end{enumerate}
@@ -138,7 +138,7 @@
 \vspace{-0.40cm}
 \noindent Expressed as a {\bf Mixed-Integer Linear Programming} (MILP) with GLPK solver
  
-\noindent 3 degrees of freedom: number of filters, $N_i$ number of coeff. for each filter $i$, $c_i$
+\noindent 3 degrees of freedom: number of filters, $N_i$ number of coef. for each filter $i$, $c_i$
 number of bits for coefficients of filter $i$
 \vspace{.1cm}
 %\parbox{.60\linewidth}{
...	...	@@ -98,15 +98,15 @@
98	98	%\setlength{\itemsep}{0pt}%
99	99	%\setlength{\parskip}{0pt}%
100	100	\vspace{-.40cm}
101		- \addblock{0.44\textwidth}{
	101	+ \addblock{0.38\textwidth}{
102	102	% \begin{enumerate}[noitemsep,nolistsep]
103	103	% \item
104	104	\textbf{1. Classical way:}\\
105		- Compute the transfer function of a monolithic filter
	105	+ Compute transfer function of a monolithic filter
106	106	\begin{itemize}[label=$\Rightarrow$, noitemsep, nolistsep]
107	107	{\color{Green}\item Simplest way to design filter}
108		- {\color{Green}\item Great rejection}
109		- {\color{Red}\item Consume lot of resources on FPGA}
	108	+ {\color{Red}\item Fixed configuration (bits/coef.)}
	109	+ {\color{Red}\item High resource consumption on FPGA}
110	110	\end{itemize}
111	111	% \end{enumerate}
112	112	}
113	113
...	...	@@ -115,10 +115,10 @@
115	115	% \setcounter{enumi}{1}
116	116	% \item
117	117	\textbf{2. Alternative way (our focus):}\\
118		- Chain of small filters
	118	+ Cascade of small(er) filters
119	119	\begin{itemize}[label=$\Rightarrow$, noitemsep, nolistsep]
120	120	{\color{Green}\item Fewer resource consumption on FPGA}
121		- {\color{Green}\item Greater rejection}
	121	+ {\color{Green}\item Flexibility (increasing bits/coef.)}
122	122	{\color{Red}\item Harder way to design filter}
123	123	\end{itemize}
124	124	% \end{enumerate}
...	...	@@ -138,7 +138,7 @@
138	138	\vspace{-0.40cm}
139	139	\noindent Expressed as a {\bf Mixed-Integer Linear Programming} (MILP) with GLPK solver
140	140
141		-\noindent 3 degrees of freedom: number of filters, $N_i$ number of coeff. for each filter $i$, $c_i$
	141	+\noindent 3 degrees of freedom: number of filters, $N_i$ number of coef. for each filter $i$, $c_i$
142	142	number of bits for coefficients of filter $i$
143	143	\vspace{.1cm}
144	144	%\parbox{.60\linewidth}{