path: root/doc/thesis/chapters/theory.tex

% vim: set ts=2 sw=2 noet spell:

\chapter{Theory} \label{chp:theory}

\begin{figure}
	\centering
	\resizebox{.9\linewidth}{!}{
		\input{figures/tikz/overview}
	}
	\caption{
		Block diagram of the developed wireless communication system with annotated signal names. Frequency domain representations of signals use the uppercase symbol of their respective time domain name. Amplification constants in the channel (for \(s(t)\) and \(r(t)\)) were omitted throughout the document for readability.
		\label{fig:blockdiagram}
	}
\end{figure}

\section{Overview}

The sections \ref{sec:mqam} and \ref{sec:mpsk} will briefly introduce the mathematical formulations of the QAM and PSK modulation schemes. Section \ref{sec:multipath-fading} the channel models used in this project are explained. The setup is summarized as a block diagram in \figref{fig:blockdiagram}. For conciseness, encoding schemes and (digital) signal processing calculations are left out and discussed later. Section \ref{sec:multipath-fading} presents an established mathematical model to understand multipath fading, as well as a brief description of a discrete-time model and the intricacies caused by the sampling process. Finally, the concept of stochastic models is mentioned, as they are often used to simulate multipath channels \cite{Messier,Mathis}.

%% TODO: A section on maths?
% \section{Signal space and linear operators}

\section{Quadrature amplitude modulation (\(M\)-ary QAM)} \label{sec:mqam}

\begin{figure}
	\centering
	\resizebox{.9\linewidth}{!}{
		\input{figures/tikz/qam-modulator}
	}
	\caption{
		Block diagram of a \(M\)-ary QAM modulator.
		\label{fig:quadrature-modulation}
	}
\end{figure}

Quadrature amplitude modulation is a family of modern digital modulation methods, that use an analog carrier signal. The simple yet effective idea behind QAM is to encode extra information into an orthogonal carrier signal, thus increasing the number of bits sent per unit of time (symbol) \cite{Gallager,Kneubuehler,Mathis,Hsu}. A block diagram of the process is shown in \figref{fig:quadrature-modulation}.

\subsection{Modulation of a digital message}

\paragraph{Bit splitter}

As mentioned above, quadrature modulation allows to send more than one bit per unit time. The first step of the process, is to use a so called bit splitter, that converts the continuous bit stream \(m(n)\) into pairs of chunks of \(\kappa = \log_2 \sqrt{M}\) bits each, where \(M\) is a power of 2. The two bit vectors of length \(\kappa\), denoted by \(\vec{m}_i\) and \(\vec{m}_q\) in figure \ref{fig:quadrature-modulation}, are called in-phase and quadrature component respectively\cite{Hsu}. The reason will become more clear later.

\paragraph{Binary to level converter}

%% TODO: explain why gray code

Both bit vectors \(\vec{m}_i, \vec{m}_q \in \{0,1\}^\kappa\) are sent through a binary to level converter. It's purpose is to reinterpret the bit vectors as numbers, usually in gray code, and to convert them into analog waveforms, which we will denote with \(m_i(t)\) and \(m_q(t)\) respectively. Mathematically the binary to level converter can be described as:
\begin{equation}
	m_i(t) = \text{Level}(\vec{m}_i) \cdot p(t),
\end{equation}
i.e. a pulse function\footnote{Typically a root raised cosine to optimize for bandwidth \cite{Hsu}.} \(p(t)\) scaled by the interpreted binary value, written here using a ``Level'' function. So there are \(2^\kappa = \sqrt{M}\) levels the analog waveforms \(m_i(t)\) and \(m_q(t)\) can take, and each level encodes \(\kappa\) bits per unit time.


\paragraph{Mixer}

By having analog level signals, it is now possible to mix them with radio frequency carriers. Because there are two waveforms, one might expect that two carrier frequencies are necessary, however this is not the case. The two component \(m_i(t)\) and \(m_q(t)\) are mixed with two different periodic signals \(\phi_i(t)\) and \(\phi_q(t)\) that have the same frequency \(\omega_c = 2\pi / T\). How this is possible is explained in the next section.


\subsection{Orthogonality of carrier signals}

Before explaining how the two carrier signals are generated, some important mathematical properties of \(\phi_i\) and \(\phi_q\) have to be discussed. In order to modulate two messages over the same frequency \(\omega_c\), the two carriers need to be \emph{orthonormal}\footnote{Actually orthogonality alone would be sufficient, however then the left side of \eqref{eqn:orthonormal-condition} would not equal 1, and an inconvenient factor would be introduced in many later equations \cite{Gallager,Hsu}.} to each other. Mathematically this is expressed by the conditions \cite{Gallager}
\begin{subequations} \label{eqn:orthonormal-conditions}
	\begin{align}
		\langle \phi_i, \phi_q \rangle
			&= \int_T \phi_i \phi_q^* \, dt
			= 0, \text{ and } \label{eqn:orthogonal-condition} \\
		\langle \phi_k, \phi_k \rangle
			&= \int_T \phi_k \phi_k^*  \,dt = 1,
			\text{ where } k \text{ is either } i \text{ or } q. \label{eqn:orthonormal-condition}
	\end{align}
\end{subequations}
Provided these rather abstract conditions, let's define a new signal 
\begin{equation}
	s = m_i\phi_i + m_q\phi_q.
\end{equation}
%% TODO: is this assumption correct?
Notice that assuming \(m_i\) and \(m_q\) are constant\footnote{This is an approximation assuming that the signal changes much slower relative to the carrier.} over the carrier's period \(T\),
\begin{align*}
	\langle s, \phi_i \rangle = \int_T s \phi_i^* \,dt
		&= \int m_i \phi_i \phi_i^* + m_q \phi_q \phi_i^* \,dt \\
		&= m_i \underbrace{\int_T \phi_i \phi_i^* \,dt}_{1}
			+ m_q \underbrace{\int_T \phi_q \phi_i^* \,dt}_{0} = m_i,
\end{align*}
which effectively means that it is possible to isolate a single component \(m_i(t)\) out of \(s(t)\). The same of course works with \(\phi_q\) as well resulting in \(\langle s, \phi_q \rangle = m_q\). Thus (remarkably) it is possible to send two different signals over the same frequency, without them interfering with each other. Since each signal can represent one of \(\sqrt{M}\) values, by having two we obtain \(\sqrt{M} \cdot \sqrt{M} = M\) possible combinations.

A graphical way to see what is happening, is to observe a so called \emph{constellation diagram}. An example is shown in \figref{fig:qam-constellation} for \(M = 16\). The two carrier signals \(\phi_i\) and \(\phi_q\) can be understood as bases of a coordinate system, in which the two amplitude levels of the modulated messages determine a position in the grid.

\paragraph{Example}

A concrete example for \(M = 16\): if the message is 1110 the bit splitter creates two values \(\vec{m}_q = 11\) and \(\vec{m}_i = 10\); both are converted into analog amplitudes (symbols) \(m_q = 3\) and \(m_i = 4\); that are then mixed with their respective carrier, resulting in \(s(t)\) being the point inside the bottom right sub-quadrant of the top right quadrant (blue dot in \figref{fig:qam-constellation}).
\vspace{1em}

In \figref{fig:qam-constellation} the dots of the constellation have coordinates that begin on the bottom left corner, and are nicely aligned on a grid. Both are not a necessary requirement for QAM, in fact there are schemes that are arranged on a non square shape, and place the dots in different orders. For example, when \(M = 32\) the dots are arranged on a \(6\times 6\) grid, but the outermost corners are not used. The only constraint that most QAM modulators have in common, with regards to the geometry of the constellation, is that between any two adjacent dots (along the axis, not diagonally) only one bit of the represented value changes (gray code). This is done to improve the bit error rate (BER) of the transmission.

\begin{figure}
	\hfill
	\begin{subfigure}{.4\linewidth}
		\input{figures/tikz/qam-constellation}
		\caption{16-QAM\label{fig:qam-constellation}}
	\end{subfigure}
	\hfill
	\begin{subfigure}{.4\linewidth}
		\input{figures/tikz/psk-constellation}
		\caption{8-PSK\label{fig:psk-constellation}}
	\end{subfigure}
	\hfill
	\caption{
		Examples of constellation diagrams. Each dot represents a possible location for the complex amplitude of the passband signal.
	}
\end{figure}

\subsection{Construction of orthogonal carrier signals}

Knowing why there is a need for orthogonal carriers, it should now be discussed which functions satisfy the property described by \eqref{eqn:orthogonal-condition}. If \(\phi_i\) is a real valued signal (which is typical) it is possible to find a function for the quadrature carrier using the \emph{Hilbert transform} (sometimes called Hilbert filter):
\begin{equation}
	\hilbert g(t) = g(t) * \frac{1}{\pi t}
		= \frac{1}{\pi} \int_\mathbb{R} \frac{g(\tau)}{t - \tau} \,d\tau
		= \frac{1}{\pi} \int_\mathbb{R} \frac{g(t - \tau)}{\tau} \,d\tau.
\end{equation}
The Hilbert transform is a linear operator that introduces a phase shift of \(\pi / 2\) over all frequencies \cite{Hsu,Gallager}, and it is possible to show that given a real valued function \(g(t)\) then \(\langle g, \hilbert g \rangle = 0\) \cite{Kschischang,Kneubuehler}. There are many functions that are Hilbert transform pairs, however in practice the pair \(\phi_i(t) = \cos(\omega_c t)\) and \(\phi_q(t) = \hilbert \phi_i(t) = \sin(\omega_c t)\) is always used.

% \paragraph{Oscillator and phase shifter}
% \skelpar[4]{Give a few details on how the carrier is generated in practice.}

% \subsection{Spectral properties of a QAM signal}
% \skelpar[4]{Spectral properties of QAM}

\section{Phase shift keying (\(M\)-PSK)} \label{sec:mpsk}

Phase shift keying (PSK) is another popular family of modulation schemes for digital signals that is simpler than QAM. In PSK as the name suggests only the phase of the envelope changes, which implies that all symbols have the same amplitude. Thus, instead of arranging the symbols into a grid, as is done in QAM, \(M\)-PSK distributes the symbols over the unit circle at equidistant intervals of \(2\pi / M\) radians \cite{Mathis,Kneubuehler}. An example of 8-PSK is shown in \figref{fig:psk-constellation}. Mathematically the process of a PSK modulation can be described by making the carrier's phase of the message. For a complex exponential carrier:
\begin{equation}
	s(t) = \exp j\left(\omega_c t + \varphi(t)\right), \quad\text{where}\quad
	\varphi = \frac{2\pi \cdot \text{Level}(\vec{m})}{M}, \quad \vec{m} \in \{0,1\}^{\log_2 M}.
\end{equation}

It is worth noting that the case of 4-PSK, also known as quaternary phase shift keying (QPSK), is a special case, because its constellation is (up to a constant phase difference) the same as a 4-ary QAM.

\section{Multipath fading} \label{sec:multipath-fading}

In the previous section, we discussed how the data is modulated and demodulated at the two ends of the transmission system. This section discusses what happens between the transmitter and receiver when the modulated passband signal is transmitted wirelessly.

In theory because wireless transmission happens through electromagnetic radiation, to model a wireless channel one would need to solve Maxwell's equations for either the electric or magnetic field, however in practice that is usually not (analytically) possible. Instead what is typically done, is to model the impulse response of the channel using a geometrical or statistical model, that is parametrized by a set of coefficients, which are either simulated or measured experimentally \cite{Gallager}.

In our relatively simple model we are going to include an additive white Gaussian noise (AWGN) and a Rician (or Rayleighan) fading; both are required to model physical effects of the real world. The former in particular is relevant today, as it describes the noise patterns of dense urban environments \cite{Messier}.

\subsection{Geometric model}

The simplest way to understand multipath fading, is to consider it from a geometrical perspective. \figref{fig:multipath-sketch} is a sketch of a wireless transmission system affected by multipath fading. The transmitter's antenna radiates an electromagnetic wave in the direction of the receiver (red line), however even under the best circumstances a part of the signal is dispersed in other directions (blue lines).

\begin{figure}
	\centering
	\input{figures/tikz/multipath-sketch}
	\caption{
		Sketch of channel with multipath fading.
		\label{fig:multipath-sketch}
	}
\end{figure}

The problem is that, as is geometrically evident, some paths are longer than others. Because of electromagnetic wave travel at a constant speed, the signal is seen by the receiver multiple times with different phase shifts~\cite{Gallager,Messier}. To analytically model this effect, we describe the received signal \(r(t)\) as a linear combination of delayed copies of the sent signal \(s(t)\), each with a different attenuation \(c_k\) and phase shift \(\tau_k\):
\begin{equation} \label{eqn:geom-multipath-rx}
	r(t) = \sum_k c_k s(t - \tau_k).
\end{equation}

The linearity of the model is justified by the assumption that the underlying electromagnetic waves behave linearly (superposition holds) \cite{Gallager}. How many copies of \(s(t)\) (usually referred to as ``taps'' or ``rays'') should be included in \eqref{eqn:geom-multipath-rx}, depends on the precision requirements of the model.

A further complication arises, when one end (or both) is not stationary. In that case the lengths of the paths change over time, and as a result the delays \(\tau_k\) and the attenuations \(c_k\) become functions of time: \(\tau_k(t)\) and \(c_k(t)\) respectively \cite{Gallager,Messier}. Even worse is when the velocity at which the device is moving is high, since then Doppler shifts of the electromagnetic wave frequency become non negligible \cite{Gallager}.

\begin{figure}
	\centering
	\input{figures/tikz/multipath-impulse-response}
	\caption{
		LTV impulse response of a multipath fading channel.
		\label{fig:multipath-impulse-response}
	}
\end{figure}

Thus the arrangement can be modelled as a linear time-\emph{varying} system (LTV), if the transmitter or the receiver (or anything else in the channel) is moving, and as a linear time \emph{invariant} (LTI) system if the geometry is stationary. We can rewrite an LTV version of equation \eqref{eqn:geom-multipath-rx} using a convolution product as follows:
\begin{align*}
	r(t) = \sum_k c_k(t) s(t - \tau_k(t)) &= \sum_k c_k(t) \int_\mathbb{R} s(\tau) \delta(\tau - \tau_k(t)) \,d\tau \\
		&= \int_\mathbb{R} s(\tau) \sum_k c_k(t) \delta(\tau - \tau_k(t)) \,d\tau = s(\tau) * h(\tau, t),
\end{align*}
obtaining a new function
\begin{equation} \label{eqn:multipath-impulse-response}
	h(\tau, t) = \sum_k c_k(t) \delta(\tau - \tau_k(t)),
\end{equation}
that describes the \emph{channel impulse response} (CIR). This function depends on two time parameters: actual time \(t\) and convolution time \(\tau\). To better understand \(h(\tau, t)\), consider an example shown in \figref{fig:multipath-impulse-response}. Each stem represents a weighted Dirac delta, so each series of stems of the same color, along the convolution time \(\tau\) axis, is a channel response at some specific time \(t\). Along the other axis we see how the entire channel response changes over time\footnote{In the figure only a finite number of stems was drawn, but actually the weights \(c_k(t)\) of the Dirac deltas change continuously.}. Notice that the stems are not quite aligned to the \(\tau\) time raster (dotted lines), that is because in \eqref{eqn:multipath-impulse-response} not only the weights \(c_k\) but also the delays \(\tau_k\) are time dependent.

\subsection{Spectrum of a multipath fading channel}

With a continuous time channel model the spectral properties of a fading channel can now be discussed. The frequency response is the Fourier transform of the impulse response, i.e. \(H(f, t) = \fourier h(\tau, t)\), though in this case \(h(\tau, t)\) depends on two time variables, but that is actually not an issue. It just means that the frequency response is also changing over time. Hence we perform the Fourier transform with respect to the channel (convolution) time variable \(\tau\) to obtain
\begin{equation} \label{eqn:multipath-frequency-response}
	H(f, t) = \int_\mathbb{R} \sum_k c_k(t) \delta(\tau - \tau_k(t)) e^{-2\pi jf\tau} \, d\tau
	= \sum_k c_k(t) e^{-2\pi jf \tau_k(t)}.
\end{equation}

Equation \eqref{eqn:multipath-frequency-response} shows that the frequency response is a periodic complex exponential. This has some important implications. Notice that if there is only one tap (term), the magnitude of \(H(f, t)\) is a constant (with respect to \(f\)) since \(|e^{j\alpha f}| = 1\). This means that the channel attenuates all frequencies by the same amount, therefore it is said to be a \emph{frequency non-selective} or \emph{flat fading} channel. Whereas in the case when there is more than one tap, the taps interfere destructively at certain frequencies and the channel is called \emph{frequency selective}. To illustrate how this happens, plots of the frequency response of a two tap channel model are shown in \figref{fig:multipath-frequency-response-plots}. On the left is the magnitude of \(H(f, t)\), which presents periodic ``dips'' when the taps interfere destructively. On the right complex loci for the two taps (red and blue), as well as their sum (magenta) are shown, for values over the frequency range near the first dip (2 to 2.5 MHz).


\begin{figure}
	\centering
	\resizebox{\linewidth}{!}{
		\input{figures/tikz/multipath-frequency-response-plots}
		% \skelfig[width = .8 \linewidth, height = 3cm]{}
	}
	\caption{
		Frequency response of a multipath fading channel.
		\label{fig:multipath-frequency-response-plots}
	}
\end{figure}

\subsection{Quantifying dispersion}

Having discussed how multipath fading affects communication systems, the next important step is to be able to quantify its effects in order to to compare different multipath channels to each other.

An intuitive parameter to quantify how dispersive a channel is, is to take the time difference between the fastest and slowest paths with significant energy. In the literature this is called \emph{delay spread} \cite{Messier}, and here it is denoted by \(T_d\). Consequently, a low delay spread means that all paths have more or less the same length, while a high delay spread implies that there is a large difference in length among the paths. Thus \(T_d\) could be be defined as
\begin{equation}
	T_d = \max_{k} (\tau_k(t)) -  \min_{k} (\tau_k(t)),
\end{equation}
as is done in \cite{Gallager}. However since in reality some paths get more attenuated than others (\(c_k(t)\) parameters) it also not uncommon to define the delay spread as a weighted mean or even as a statistical second moment (RMS value), where mean tap power \(\expectation\{|c_k(t)|^2\}\) is taken into account \cite{Mathis,Messier}. % More sophisticated definitions of delay spread will be briefly mentioned later in section \ref{sec:statistical-model}.

Another important parameter for quantifying dispersion is \emph{coherence bandwidth}, a measure that is highly related to delay spread but in the frequency domain. Coherence bandwidth, is informally ``how much bandwidth can be used by the signal before it gets distorted'' (in our case by fading) \cite{Messier}. Thus intuitively, this parameter must be related to the delay spread with an inversely proportional relationship, since higher delay spread implies more intersymbol interference. And in fact, although there are multiple definitions depending on the context, the coherence bandwidth \(B_c\) is usually estimated with
\begin{equation}
	B_c \approx \frac{1}{T_d}.
\end{equation}

Finally, another important mean of parametrizing a multipath fading channel is what is called a \emph{power delay profile} (PDP). PDPs are nothing but a list of taps for a FIR model of multipath fading \cite{Mathis}. The weight of each tap in the PDP corresponds to the average channel tap power (hence the name \emph{power} delay profile) and is usually given in decibel \cite{Mathis,Messier}. An example is shown at the end of chapter \ref{chp:implementation} in \tabref{tab:etsi-tap-values}.

% \subsection{Effects of multipath fading on modulation constellations}
% 
% % TODO : Can we sai it that way /dose it need to be in the implementation Part?
% 
% It is to mention that not every constellation of parameter for a fading illustration leads to a satisfying  plot constellation.
% For example in a Discrete-time Model: the same delay as the samples per Symbol or a multiple of it leads to a special case, where we see the constellation are around the modulate signal points, when there is no line of side path. This is because of \skelpar{Beschreiben warnn die Werte hübsch sind}

\subsection{Discrete-time model} \label{sec:discrete-time-model}

% TODO: discuss the "bins" of discrete time

Since in practice signal processing is done digitally, it is meaningful to discuss the properties of a discrete-time model. To keep the complexity of the model manageable some assumptions are necessary, thus the sent discrete signal\footnote{This is an abuse of notation. The argument \(n\) is used to mean the \(n\)-th digital sample of \(s\), whereas \(s(t)\) is used for the analog waveform. A more correct but longer notation is \(s(nT)\), where \(T\) is the sample time.} \(s(n)\) is assumed to have a finite single sided bandwidth \(W\) and the sampling is assumed to be ideal. This implies that the time-domain signal is a series of sinc-shaped pulses each shifted from the previous by a time interval \(T = 1 / (2W)\) (Nyquist rate) \cite{Messier}:
\begin{equation}
	s(t) = \sum_n s(n) \sinc \left(\frac{t}{T} - n\right).
\end{equation}
The waveform \(s(t)\) is then convolved with the CIR function \(h(\tau, t)\) (with respect to \(\tau\)) from the continuous time model resulting in the waveform at the receiver
\begin{align*}
	r(t) &= \int_ \mathbb{R} \sum_n s(n) \sinc \left(
			\frac{\tau}{T} - n
		\right) \sum_k c_k(t) \delta(\tau - \tau_k(t)) \,d\tau \\
	&= \sum_n s(n) \sum_k c_k(t) \sinc\left(
			\frac{t - \tau_k(t)}{T} - n
		\right),
\end{align*}
which is then sampled at the Nyquist rate of \(2W = 1/T\), resulting in a set of samples\footnote{Again, the notation \(r(m)\) means the \(m\)-th digital sample of \(r(t)\), i.e. \(r(mT)\).} \cite{Messier}:
\[
	r(m) = \sum_n s(n) \sum_k c_k(mT) \sinc\left(m - \frac{\tau_k(mT)}{T} - n\right).
\]
Finally, the substitution \(l = m - n\) eliminates the sender's sample counter \(n\) (unknown to the receiver), and reformulates \(r(m)\) as a discrete convolution product of \(s(n)\) with a discrete CIR function \(h_l(m)\) \cite{Messier}:
\begin{equation}
	r(m) = \sum_l s(m - l) \sum_k c_k(mT) \sinc\left(l - \frac{\tau_k(mT)}{T}\right) 
	= \sum_l s(m - l) h_l (m).
\end{equation}
This result is very similar to the continuous time model described by \eqref{eqn:multipath-impulse-response} in the sense that each received digital sample is a sent sample convolved with a different discrete channel response (because of time variance). To see how the discrete CIR
\begin{equation} \label{eqn:discrete-multipath-impulse-response}
	h_l(m) = \sum_k c_k(mT) \sinc\left(l - \frac{\tau_k(mT)}{T}\right)
\end{equation}
is different from \eqref{eqn:multipath-impulse-response} consider again the plot of \(h(\tau,t)\) in \figref{fig:multipath-impulse-response}. The plot of \(h_l(m)\) would have discrete axes with \(m\) replacing \(t\) and \(l\) instead of \(\tau\). Because of the finite bandwidth in the \(l\) axis instead of Dirac deltas there would be superposed sinc functions.

\begin{figure}
	\centering
	\input{figures/tikz/tapped-delay-line}
	\caption{
		Fading channel as a tapped delay line.
		\label{fig:tapped-delay-line}
	}
\end{figure}

From a signal processing perspective \eqref{eqn:discrete-multipath-impulse-response} can be interpreted as a simple tapped delay line \cite{Messier, Gallager}, as schematically drawn in \figref{fig:tapped-delay-line}. Together with linearity, this confirms that the presented model is indeed just a FIR filter. Simple multipath channels can be simulated with just a few lines of code, for example the data for the static fading channel in \figref{fig:multipath-frequency-response-plots} is generated in just four lines of Python. The difficulty of fading channels in practice lies in the estimation of the constantly changing parameters \(c_k(t)\) and \(\tau_k(t)\) \cite{Messier}.

\subsection{Simulating multipath CIR with FIR filters} \label{sec:fractional-delay}

As mentioned in the previous section a FIR filter can be used to simulate discrete-time models of multipath fading. But with FIR filters the delays can only be integer multiples of the sample rate. When the delays are non integer an approximation needs to be done. That is because FIR filters have a transfer function of the form
\begin{equation} \label{eqn:transfer-function-fir}
	H(j\omega) = \sum_{n = 0}^{N} h(n) e^{-j\omega nT}
	\quad \text{commonly written as} \quad
	H(z) = \sum_{n = 0}^{N} h(n) z^{-n},
\end{equation}
but a non integer delay of \(\tau\) in the frequency domain is \(H_\tau(j\omega) = e^{-j\omega \tau}\). There are multiple ways to find coefficients \(h(n)\) that approximate \(H_\tau\) \cite{Valimaki1995}. In this case the least squares method was used by minimizing the error function
\begin{equation}
	E(j\omega) = H(j\omega) - H_\tau(j\omega).
\end{equation}
The least square method together with the assumption of finite bandwidth and the requirement of causality gives the following rule for computing the FIR filter coefficients \cite{Valimaki1995}:
\begin{equation}
	h(n)= \begin{cases}
		\sinc (n - \tau) & 0 \leq n \leq N \\ 
		0 & \text { otherwise},
	\end{cases}
\end{equation}
where the odd order of the filter \(N\) should satisfy the condition
\begin{equation} \label{eqn:fractional-fir-length}
	N = 2 \lfloor \tau \rfloor + 1
\end{equation}
for a minimal error in the approximation \cite{Valimaki1995}. It is worth mentioning that it is also possible to build FIR filters of even length with a different condition, or ones that do not satisfy \eqref{eqn:fractional-fir-length}, in which cases more consideration is required. An example of a fractional delay FIR filter is shown in \figref{fig:fractional-delay-sinc-plot}.
Where the sinc function does not select an integer sample, which in turn means that the other sampled values do not add up to zero.
Thus, they will be distributed among the other whole numbers.

\begin{figure}
	\centering
	\begin{subfigure}{.4\linewidth}
		\includegraphics[width=\linewidth]{./figures/screenshots/Fractional_delay_6}
		\caption{Integer delay of 6 samples.}
	\end{subfigure}
	\hskip 5mm
	\begin{subfigure}{.4\linewidth}
		\includegraphics[width=\linewidth]{./figures/screenshots/Fractional_delay_637}
		\caption{Fractional delay of 6.37 samples.}
	\end{subfigure}
	\caption{
		FIR filters for integer and fractional delays.
		\label{fig:fractional-delay-sinc-plot}
	}
\end{figure}

\subsection{Statistical model} \label{sec:statistical-model}

Because as mentioned earlier it is difficult to estimate the time-dependent parameters of \(h_l(m)\) in many cases it is easier to model the components of the CIR as stochastic processes, thus greatly reducing the number of parameters \cite{Messier,Mathis}. This is especially effective for channels that are constantly changing, because by the central limit theorem the cumulative effect of many small changes tends to a normal distribution.

% \skelpar[3]{Assumptions of the model}
Before discussing the models themselves, their underlying statistical assumptions need to be considered. In the literature the so called WSSUS assumptions are made \cite{Messier, Gallager}, which for a LTV CIR \(h(\tau, t)\) can be formulated as
\begin{subequations}
	\begin{align}
		R(\tau') &= \E{h(\tau, t) h^*(\tau + \tau', t)}, \text{ and } \label{eqn:stat-wss} \\
		0 &= \E{h(\tau, t) h^*(\tau, t')} \text { for } t \neq t'. \label{eqn:stat-us}
	\end{align}
	% discrete time version
	% \begin{align}
	% 	R_{l} (k) &= \E{h_l(m) h_l^*(m+k)}, \text{ and } \label{eqn:stat-wss} \\
	% 	0 &= \E{h_l(m) h_k^*(m)} \text { for } l \neq k. \label{eqn:stat-us}
	% \end{align}
\end{subequations}
Equation \eqref{eqn:stat-wss} states that the fading CIR is a \emph{wide sense stationary} (WSS) stochastic process, while \eqref{eqn:stat-us} is the \emph{uncorrelated scattering} assumption, which loosely speaking states that the paths do not interfere with each other. The latter is more realistic than the former, but WSS is still useful as it considerably simplifies the mathematical formulation \cite{Messier}.

\paragraph{NLOS case}

Recall that \(h(\tau, t)\) is a function of time because \(c_k\) and \(\tau_k\) change over time. The idea of the statistical model is to replace the cumulative change caused by \(c_k\) and \(\tau_k\) (which are difficult to estimate) with a single random variable \(f\). This is done as follows.

Multipath fading is a form of multiplicative noise, as confirmed by the fact that convolving a complex baseband signal \(e^{j\omega_c t}\) with the fading CIR \(h(\tau, t)\) gives
\begin{equation}
	e^{j\omega_c \tau} * h(t, \tau) = \sum_k c_k(t) e^{j\omega_c(\tau - \tau_k(t))}
	= e^{j\omega_c \tau} \sum_k c_k(t) e^{-j\omega_c \tau_k(t)}
	= e^{j\omega_c \tau} \cdot f(t).
\end{equation}
If there is no line of sight (NLOS), it is reasonable to assume that all paths have more or less the same attenuation, i.e. all \(c_k\) are the same. Another reasonable assumption in this case is that all paths are equally likely to be taken, or in other words the delays \(-\omega_c \tau_k\) can be replaced with random variables \(\vartheta_k\) that are uniformly distributed on \([0,2\pi)\) \cite{Hoher2013,Mathis}; physically this can be imagined as a ``ring of scattering objects'' around the receiver \cite{Messier} as sketched in \figref{fig:ring-of-scattering-objects} (without the red line of sight signal). Finally, assuming that there are infinitely many paths the random variable for the multiplicative fading noise becomes
\begin{equation} \label{eqn:mult-fading-nlos}
	f = \lim_{N\rightarrow\infty} \frac{1}{\sqrt{N}}
		\sum_{k=1}^{N} e^{j \vartheta_k },
\end{equation}
where the \(c_k\) where omitted, since they are assumed to be all equal \cite{Hoher2013}. The factor \(1/\sqrt{N}\) is introduced such that \(\expectation \{|f|^2\} = 1\). It then can be shown that the probability density function of \(|f|\) is
\begin{equation}
	p(a)= 2a e^{-a^2}, \text{ or } |f| \sim \mathrm{Rayleigh},
\end{equation}
i.e. the amplitude of \(f\) is \emph{Raileigh} distributed \cite{Hoher2013}. The probability density function of a Rayleigh distributed random variable is shown in \figref{fig:rayleigh-rice-pdf}.

\begin{figure}
	\centering
	\hfill
	\begin{subfigure}[t]{.5\linewidth}
		\input{figures/tikz/rayleigh-rice-pdf-plots}
		\caption{
			Amplitude density \(p(a)\).
			\label{fig:rayleigh-rice-pdf}
		}
	\end{subfigure}
	\hfill
	\begin{subfigure}[t]{.45\linewidth}
		\centering
		\resizebox{!}{5cm}{%
			\input{figures/tikz/ring-of-scattering-objects}
		}
		\caption{
			Ring of scattering objects.
			\label{fig:ring-of-scattering-objects}
		}
	\end{subfigure}
	\hfill
	\caption{
		Statistical model for multipath fading.
		\label{fig:multipath-statistical-models}
	}
\end{figure}

\paragraph{LOS case}

Extending the previous NLOS case, if there is a line of sight (LOS) path (red signal in \figref{fig:ring-of-scattering-objects}), the statistical model has to be extended by defining the so called Rice factor \(K\). This \(K\) factor is the ratio between the power from the LOS path and the average power of the NLOS paths (often also referred to as distributed components) \cite{Hoher2013}. Hence, by taking \(K\) into account \eqref{eqn:mult-fading-nlos} becomes \cite{Hoher2013}:
\begin{equation} \label{eqn:mult-fading-los}
	f = \sqrt{\frac{K}{K+1}} + 
	\frac{1}{\sqrt{K+1}} \left(
		\lim_{N\rightarrow\infty} 
		\frac{1}{\sqrt{N}}\sum_{n=1}^{N} e^{j \vartheta_k}
	\right).
\end{equation}
Notice that by letting \(K = 0\), that is, no power in the LOS path, \eqref{eqn:mult-fading-los} becomes \eqref{eqn:mult-fading-nlos} or Rayleigh distributed (as expected). For a factor \(K = 5.1\) the probability function is gaussian distributed. Conversely when \(K \to \infty\), i.e. no power in the NLOS paths, then \(f \to 1\) and the fading disappears. The new amplitude density in this case is:
\begin{equation}
	p(a)= 2a(1+K) \exp{\left(-K -a^2 (K+1) \right)} I_0 \left(2a\sqrt{K(1+K)} \right),
\end{equation}
where \(I_0\) the zeroth order modified Bessel function. Random variables with this probability density function are said to have a \emph{Rice} or \emph{Rician} distribution \cite{Hoher2013}.