diff options
| author | Philipp Le <philipp-le-prviat@freenet.de> | 2020-06-29 00:01:00 +0200 |
|---|---|---|
| committer | Philipp Le <philipp-le-prviat@freenet.de> | 2021-03-04 22:44:39 +0100 |
| commit | fd55df1b53c97b7e12a440c56cb5859cf1a8c391 (patch) | |
| tree | 723ec2795b68d94b6e0c3cbb29c6e84f23fb5830 | |
| parent | 89ca4a75cd646131d3a06ad1bf987c66c337ae36 (diff) | |
| download | dcs-lecture-notes-fd55df1b53c97b7e12a440c56cb5859cf1a8c391.zip dcs-lecture-notes-fd55df1b53c97b7e12a440c56cb5859cf1a8c391.tar.gz dcs-lecture-notes-fd55df1b53c97b7e12a440c56cb5859cf1a8c391.tar.bz2 | |
Added rules for OVSF code tree generation
| -rw-r--r-- | chapter07/content_ch07.tex | 10 |
1 files changed, 10 insertions, 0 deletions
diff --git a/chapter07/content_ch07.tex b/chapter07/content_ch07.tex index e436e1a..f332b10 100644 --- a/chapter07/content_ch07.tex +++ b/chapter07/content_ch07.tex @@ -1887,6 +1887,16 @@ However, not each $L_1$ code is orthogonal to any $L_2$ code. The relation of or \label{fig:ch07:ovsf_code_tree} \end{figure} +The rules for creating the \acs{OVSF} code tree are (derived from the construction rules of the Hadamard matrix):
+\begin{itemize}
+ \item The parent node in the tree is $\vect{C}_{n,k}$ ($n$ is the code length, $k$ is the index).
+ \item The child nodes are:
+ \begin{itemize}
+ \item $\vect{C}_{2n,2k-1} = \left[\vect{C}_{n,k}, \vect{C}_{n,k}\right]$
+ \item $\vect{C}_{2n,2k} = \left[\vect{C}_{n,k}, -\vect{C}_{n,k}\right]$
+ \end{itemize}
+\end{itemize}
+ \subsection{Asynchronous \acs{DS-CDMA}} Welsh code have excellent cross-correlation properties. But, Welsh codes \underline{do not} have good autocorrelation properties. |