-Returning to the actual FIR filter, we will slightly change the equation
-describing it, so as to make the translation to code more obvious and concise.
-What we do is change the definition of the vector of input samples and delay
-the computation by one sample. Instead of having the input sample received at
-time $t$ stored in $x_t$, $x_0$ now always stores the newest sample, and $x_i$
-stores the $ith$ previous sample. This changes the equation to the following
-(note that this is completely equivalent to the original equation, just with a
-different definition of $x$ that will better suit the transformation to code):
+Returning to the actual \acro{FIR} filter, we will slightly change the
+equation describing it, so as to make the translation to code more obvious and
+concise. What we do is change the definition of the vector of input samples
+and delay the computation by one sample. Instead of having the input sample
+received at time $t$ stored in $x_t$, $x_0$ now always stores the newest
+sample, and $x_i$ stores the $ith$ previous sample. This changes the equation
+to the following (note that this is completely equivalent to the original
+equation, just with a different definition of $x$ that will better suit the
+transformation to code):