wip

Author: osmanyasar05

paper.tex

@@ -339,6 +339,8 @@ \subsection{Compression Algorithms}
 
 \subsubsection{Wallace Tree}
 
+Placeholder
+
 \subsubsection{Dadda's Algorithm}
 Dadda's algorithm is a method for reducing the partial products of an $n$-bit multiplier to a two-row representation 
 using \acrfull{fa} and \acrfull{ha}, after which a single \ac{cpa} produces the final result \cite{application_specific_arithmetic} \cite{dadda_tree}.
@@ -407,7 +409,7 @@ \subsection{\BitExpr}
 \end{array}
 \]
 \sam{What is $\barwedge$? You need to define it. Secondly we're missing an inversion/negation operator?}
-\osman{It is the NAND operation. do we also need to define \wedge or \vee as well? are they not standard? (though not so sure about \barwedge)}
+\osman{It is the NAND operation. do we also need to define $\wedge$ or $\vee$ as well? are they not standard? (though not so sure about $\barwedge$)}
 
 \[
 \begin{array}{r@{\;}c@{\;}l}