Added thesis template to latex folder
This commit is contained in:
parent
b6fe01e149
commit
4bd9c32480
@ -1,33 +0,0 @@
|
||||
BUILDDIR = build
|
||||
SRCDIR = src
|
||||
RESDIR = res
|
||||
TEMPDIR = tmp
|
||||
|
||||
CC = latexmk
|
||||
CFLAGS = -pdf -shell-escape -halt-on-error
|
||||
|
||||
|
||||
TARGETS = $(BUILDDIR)/thesis.pdf
|
||||
|
||||
|
||||
all: clean precomp $(TARGETS) postcomp
|
||||
|
||||
precomp:
|
||||
@mkdir -p $(TEMPDIR)
|
||||
@cd $(TEMPDIR) && ln -s ../$(SRCDIR)/* .
|
||||
@cd $(TEMPDIR) && ln -s ../$(RESDIR)/* .
|
||||
|
||||
postcomp:
|
||||
@rm -r $(TEMPDIR)
|
||||
|
||||
$(BUILDDIR)/thesis.pdf: $(TEMPDIR)/thesis.tex
|
||||
$(CC) $(CFLAGS) -output-directory=../$(BUILDDIR) -cd $<
|
||||
|
||||
clean:
|
||||
rm -rf $(BUILDDIR) $(TEMPDIR)
|
||||
|
||||
show:
|
||||
okular $(TARGETS) &
|
||||
|
||||
|
||||
.PHONY: all precomp postcomp show clean f
|
||||
59
latex/abbreviations.tex
Normal file
59
latex/abbreviations.tex
Normal file
@ -0,0 +1,59 @@
|
||||
% This file provides Abbreviations
|
||||
% Sorting them is a good idea because the acronym package won't!
|
||||
\chapter{Abbreviations}
|
||||
\begin{acronym}[TROLL]
|
||||
\acro{AGC}[AGC]{automatic gain control}
|
||||
\acro{API}[API]{application program interface}
|
||||
\acro{AWGN}[AWGN]{additive white Gaussian noise}
|
||||
\acro{AVX}[AVX]{advanced vector extensions}
|
||||
|
||||
\acro{BEC}[BEC]{binary erasure channel}
|
||||
\acro{BER}[BER]{bit error rate}
|
||||
\acro{BDMC}[BDMC]{binary \acs{DMC}}
|
||||
\acro{BP}[BP]{belief propagation}
|
||||
\acro{BSC}[BSC]{binary symmetric channel}
|
||||
|
||||
\acro{CEL}[CEL]{Communications Engineering Lab}
|
||||
\acro{CPU}[CPU]{central processing unit}
|
||||
|
||||
\acro{DFT}[DFT]{discrete Fourier transform}
|
||||
\acro{DMC}[DMC]{discrete nemoryless channel}
|
||||
\acro{dSNR}[dSNR]{design \ac{SNR}}
|
||||
\acro{DSP}[DSP]{digital signal processing}
|
||||
|
||||
\acro{ESA}[ESA]{European Space Agency}
|
||||
|
||||
\acro{FER}[FER]{frame error rate}
|
||||
\acro{FFT}[FFT]{fast Fourier transform}
|
||||
|
||||
\acro{GPP}[GPP]{general purpose processor}
|
||||
\acro{GRC}[GRC]{GNU Radio Companion}
|
||||
|
||||
\acro{NASA}[NASA]{National Aeronautics and Space Administration}
|
||||
\acro{LDPC}[LDPC]{low-density parity-check}
|
||||
\acro{SIMD}[SIMD]{single instruction multiple data}
|
||||
\acro{VOLK}[VOLK]{vector-optimized library of kernels}
|
||||
|
||||
\acro{IDFT}[IDFT]{inverse discrete Fourier transform}
|
||||
\acro{KIT}[KIT]{Karlsruhe Institute of Technology}
|
||||
|
||||
\acro{LR}[LR]{likelihood ratio}
|
||||
\acro{LLR}[LLR]{log-likelihood ratio}
|
||||
\acro{LTE}[LTE]{Long Term Evolution}
|
||||
|
||||
\acro{MAP}[MAP]{maximum a posteriori}
|
||||
\acro{ML}[ML]{maximum likelihood}
|
||||
|
||||
\acro{NRZ}[NRZ]{non return to zero}
|
||||
|
||||
\acro{RV}[RV]{random variable}
|
||||
|
||||
\acro{SC}[SC]{successive cancellation}
|
||||
\acro{SCL}[SCL]{successive cancellation list}
|
||||
\acro{SDR}[SDR]{software defined radio}
|
||||
\acro{SNR}[SNR]{signal-to-noise ratio}
|
||||
\acro{SPC}[SPC]{single parity check}
|
||||
\acro{SSE}[SSE]{streaming \ac{SIMD} extensions}
|
||||
|
||||
\acro{UML}[UML]{unified modeling language}
|
||||
\end{acronym}
|
||||
396
latex/bibliography.bib
Normal file
396
latex/bibliography.bib
Normal file
@ -0,0 +1,396 @@
|
||||
@Comment Eintr{\"a}ge k{\"o}nnen komfortabel {\"u}ber das (X)Emacs-Menu "Entry-Types"
|
||||
@Comment gemacht werden.
|
||||
@Comment
|
||||
@Comment Zur Verwendung von BibTeX siehe auch
|
||||
@Comment file:/tools/misc/teTeX/share/texmf/doc/bibtex/base/btxdoc.dvi
|
||||
|
||||
@Comment Mama-Paper
|
||||
|
||||
@INPROCEEDINGS{sha49,
|
||||
author = {Claude E. Shannon},
|
||||
title = {Communication in the Presence of Noise},
|
||||
booktitle = {Proc. IRE},
|
||||
year = {1949},
|
||||
month = jan
|
||||
}
|
||||
|
||||
@Comment Paper zur Arbeit, Studienarbeit
|
||||
|
||||
@Comment Berichte von Regulierungsbehoerden
|
||||
|
||||
@TECHREPORT{itu,
|
||||
title = {Radio Regulations},
|
||||
institution = {International Telecommunication Union - Radiocommunication},
|
||||
note = {},
|
||||
year = {2006}
|
||||
}
|
||||
|
||||
|
||||
@Comment software radio ...
|
||||
|
||||
@INPROCEEDINGS{mit92,
|
||||
title = {Software radios-survey, critical evaluation and future directions},
|
||||
author = {Joseph Mitola},
|
||||
journal = {Proc. National Telesystems Conference},
|
||||
month = may,
|
||||
year = {1992}
|
||||
}
|
||||
|
||||
|
||||
@ARTICLE{hay05,
|
||||
title = {Cognitive radio: brain-empowered wireless communications},
|
||||
author = {Haykin, S.},
|
||||
journal = IEEE_J_JSAC,
|
||||
month = Feb,
|
||||
year = {2005}
|
||||
}
|
||||
|
||||
@ARTICLE{jon05,
|
||||
title = {Software-Defined Radio Basics and Evolution to Cognitive Radio},
|
||||
author = {Friedrich Jondral},
|
||||
journal = {EURASIP Journal on Wireless Communications and Networking},
|
||||
month = Feb,
|
||||
year = {2005}
|
||||
}
|
||||
|
||||
|
||||
@Comment Cooperation in Spectrum Sensing
|
||||
|
||||
@ARTICLE{jon07,
|
||||
title = {Cognitive Radio: A Communications Engineering View},
|
||||
author = {Friedrich K. Jondral},
|
||||
journal = {IEEE Wireless Communications},
|
||||
month = Aug,
|
||||
year = {2007}
|
||||
}
|
||||
|
||||
@book{tc02,
|
||||
title = {Turbo Coding, Turbo Equalisation and Space-Time Coding for Transmission over Wireless Channels},
|
||||
author = {L. Hanzo and T. H. Liew and B. L. Yeap},
|
||||
publisher = {Wiley},
|
||||
year = {2002}
|
||||
}
|
||||
@article{te02,
|
||||
title = {Turbo Equalization: Principles and New Results},
|
||||
year = {2002},
|
||||
author = {M. Tüchler and R. Kötter and A. C. Singer},
|
||||
journal = IEEE_J_TCOM,
|
||||
volume = {50},
|
||||
month = {May}
|
||||
}
|
||||
|
||||
@misc{gnrDoc,
|
||||
title = "{GNURadio 3.7.2 C++ API}",
|
||||
howpublished = "\url{http://gnuradio.org/doc/doxygen/namespacegr_1_1trellis.html}",
|
||||
}
|
||||
|
||||
@misc{repo:gr-lte,
|
||||
title = "{gr-lte Repository}",
|
||||
howpublished = "\url{https://github.com/kit-cel/gr-lte}",
|
||||
note = {Accessed 2015-02-12}
|
||||
}
|
||||
|
||||
@misc{repo:gr-misc,
|
||||
title = "{gr-misc Repository}",
|
||||
howpublished = "\url{https://github.com/jdemel/gr-misc}",
|
||||
note = {Accessed 2015-02-12}
|
||||
}
|
||||
|
||||
@misc{repo:gr-rename-contribution,
|
||||
title = "{GNU Radio modtool rename contribution}",
|
||||
howpublished = "\url{https://github.com/gnuradio/gnuradio/tree/ab6b4208b4e843548d9c8898cbe1102976161663}",
|
||||
note = {Accessed 2015-02-12}
|
||||
}
|
||||
|
||||
@misc{Charles2013,
|
||||
author = {Charles, P.W.D.},
|
||||
title = {Project Title},
|
||||
year = {2013},
|
||||
publisher = {GitHub},
|
||||
journal = {GitHub repository},
|
||||
howpublished = {\url{https://github.com/charlespwd/project-title}},
|
||||
commit = {4f57d6a0e4c030202a07a60bc1bb1ed1544bf679}
|
||||
}
|
||||
|
||||
@misc{git:commit:polar-code-merge,
|
||||
title = "{GNU Radio repository}",
|
||||
year = {2015},
|
||||
journal = {GitHub repository},
|
||||
howpublished = "\url{https://github.com/gnuradio/gnuradio}",
|
||||
note = {Accessed 2015-11-02},
|
||||
commit = {45faa98d307f84c6000fe32d69f6c12eb8efd180},
|
||||
}
|
||||
|
||||
@misc{gnuradio:volk,
|
||||
title = "{Vector-Optimized Library of Kernels}",
|
||||
year = {2015},
|
||||
journal = {libvolk.org},
|
||||
howpublished = "\url{http://libvolk.org/}",
|
||||
note = {Accessed 2015-11-19},
|
||||
}
|
||||
|
||||
@misc{gnuradio:volk-repository,
|
||||
title = "{Vector-Optimized Library of Kernels}",
|
||||
year = {2015},
|
||||
journal = {GitHub},
|
||||
howpublished = "\url{https://github.com/gnuradio/volk}",
|
||||
note = {Accessed 2015-11-19},
|
||||
commit = {98363e32638a7b036b47905bf8b3de243620a1aa},
|
||||
}
|
||||
|
||||
@misc{gnuradio:fecapi-doc,
|
||||
title = "{FECAPI documentation}",
|
||||
year = {2015},
|
||||
journal = {GNU Radio},
|
||||
howpublished = "\url{https://gnuradio.org/doc/doxygen/page_fec.html}",
|
||||
note = {Accessed 2015-11-03},
|
||||
}
|
||||
|
||||
@misc{boost:random,
|
||||
title = "{Boost Random}",
|
||||
year = {2010},
|
||||
journal = {Boost},
|
||||
howpublished = "\url{http://www.boost.org/doc/libs/1_59_0/doc/html/boost_random.html}",
|
||||
note = {Accessed 2015-11-03},
|
||||
}
|
||||
|
||||
@COMMENT howpublished = "\url{http://www.uni-kl.de/en/channel-codes/channel-codes-database/wimax-ldpc/}",
|
||||
@misc{ldpc:alist,
|
||||
title = {Database of Channel Codes and {ML} Simulation Results},
|
||||
author = {Helmling, Michael and Scholl, Stefan},
|
||||
year = {2015},
|
||||
journal = {University of Kaiserslautern},
|
||||
howpublished = "\url{www.uni-kl.de/channel-codes}",
|
||||
note = {Accessed 2015-11-19},
|
||||
}
|
||||
|
||||
@article{lte:winncomm2013,
|
||||
title = {A LTE Receiver Framework Implementation in {GNU Radio}},
|
||||
year = {2013},
|
||||
author = {J. Demel and S. Koslowski and F. Jondral},
|
||||
journal = {SDR-WInnComm-Europe-2013},
|
||||
month = {June}
|
||||
}
|
||||
|
||||
@article{lte:springer2015,
|
||||
title = "{A LTE Receiver Framework Using GNU Radio}",
|
||||
year = {2015},
|
||||
author = {J. Demel and S. Koslowski and F. Jondral},
|
||||
journal = {Springer Journal on Signal Processing Systems},
|
||||
doi = {10.1007/s11265-014-0959-z}
|
||||
}
|
||||
|
||||
@misc{dijkstra:zerocounting,
|
||||
title = "{Why numbering should start at zero}",
|
||||
author = {Edsger W. Dijkstra},
|
||||
year = {2008},
|
||||
howpublished = "\url{http://www.cs.utexas.edu/users/EWD/transcriptions/EWD08xx/EWD831.html}",
|
||||
note = {Accessed 2015-10-26}
|
||||
}
|
||||
|
||||
@article{cloudran:2015,
|
||||
author = {P. Rost and A. Maeder and H. Paul and D. W\"{u}bben and A. Dekorsy and G. Fettweis and Ignacio Berberana and Vinay Suryaprakash and Matthew Valenti},
|
||||
title = {Benefits and Challenges of Virtualization in {5G} Radio Access Networks},
|
||||
year = {2015},
|
||||
month = dec,
|
||||
journal=IEEE_M_COM,
|
||||
}
|
||||
|
||||
@ARTICLE{polar:arikan09,
|
||||
author={Ar\i{}kan, Erdal},
|
||||
ownlabel={Ar\i{}01},
|
||||
journal=IEEE_J_IT,
|
||||
title={Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels},
|
||||
year={2009},
|
||||
month={July},
|
||||
volume={55},
|
||||
number={7},
|
||||
pages={3051-3073},
|
||||
keywords={binary codes;channel capacity;channel coding;decoding;memoryless systems;probability;channel capacity;channel coding;channel polarization;code sequence;polar codes;probability;successive cancellation decoding algorithm;symmetric binary-input memoryless channel;Capacity planning;Channel capacity;Channel coding;Codes;Councils;Decoding;Information theory;Memoryless systems;Noise cancellation;Polarization;Capacity-achieving codes;Plotkin construction;Reed– Muller (RM) codes;channel capacity;channel polarization;polar codes;successive cancellation decoding},
|
||||
doi={10.1109/TIT.2009.2021379},
|
||||
ISSN={0018-9448},
|
||||
}
|
||||
|
||||
@article{polar:arikan11systematic,
|
||||
title={Systematic polar coding},
|
||||
author={Ar\i{}kan, Erdal},
|
||||
journal=IEEE_J_COML,
|
||||
volume={15},
|
||||
number={8},
|
||||
pages={860--862},
|
||||
year={2011},
|
||||
publisher={Citeseer}
|
||||
}
|
||||
|
||||
|
||||
@article{tal2013construct,
|
||||
title={How to construct polar codes},
|
||||
author={Tal, Ido and Vardy, Alexander},
|
||||
journal=IEEE_J_IT,
|
||||
volume={59},
|
||||
number={10},
|
||||
pages={6562--6582},
|
||||
year={2013},
|
||||
publisher={IEEE}
|
||||
}
|
||||
|
||||
@article{chen2013improved,
|
||||
title={Improved successive cancellation decoding of polar codes},
|
||||
author={Chen, Kai and Niu, Kai and Lin, Jiaru},
|
||||
journal=IEEE_J_TCOM,
|
||||
volume={61},
|
||||
number={8},
|
||||
pages={3100--3107},
|
||||
year={2013},
|
||||
publisher={IEEE}
|
||||
}
|
||||
|
||||
@article{li2012adaptive,
|
||||
title={An adaptive successive cancellation list decoder for polar codes with cyclic redundancy check},
|
||||
author={Li, Bin and Shen, Hui and Tse, David},
|
||||
journal=IEEE_J_COML,
|
||||
volume={16},
|
||||
number={12},
|
||||
pages={2044--2047},
|
||||
year={2012},
|
||||
publisher={IEEE}
|
||||
}
|
||||
|
||||
@Book{shannon1998,
|
||||
author = {Shannon, Claude},
|
||||
title = {The mathematical theory of communication},
|
||||
publisher = {University of Illinois Press},
|
||||
year = {1998},
|
||||
address = {Urbana},
|
||||
isbn = {0252725468}
|
||||
}
|
||||
|
||||
@book{Richardson:2008:MCT,
|
||||
author = {Richardson, Tom and Urbanke, Rüdiger},
|
||||
title = {Modern Coding Theory},
|
||||
year = {2008},
|
||||
isbn = {0521852293, 9780521852296},
|
||||
publisher = {Cambridge University Press},
|
||||
address = {New York, NY, USA},
|
||||
}
|
||||
|
||||
@misc{Friedrichs:2010:error-control-coding,
|
||||
author = {Friedrichs, Bernd},
|
||||
title = {Error-Control Coding},
|
||||
publisher = {Springer-Verlag},
|
||||
address = {Berlin},
|
||||
howpublished = "\url{http://www.berndfriedrichs.de/buecher_d.htm#ecc}",
|
||||
note = {Accessed 2015-11-06}
|
||||
}
|
||||
|
||||
@article{polar:vangala:cc-comparison,
|
||||
author = {Harish Vangala and
|
||||
Emanuele Viterbo and
|
||||
Yi Hong},
|
||||
title = {A Comparative Study of Polar Code Constructions for the {AWGN} Channel},
|
||||
journal = {CoRR},
|
||||
volume = {abs/1501.02473},
|
||||
year = {2015},
|
||||
url = {http://arxiv.org/abs/1501.02473},
|
||||
timestamp = {Mon, 02 Feb 2015 14:12:25 +0100},
|
||||
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/VangalaVH15},
|
||||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||||
}
|
||||
|
||||
@ARTICLE{polar:talvardy:howtoCC,
|
||||
author={Tal, I. and Vardy, A.},
|
||||
journal=IEEE_J_IT,
|
||||
title={How to Construct Polar Codes},
|
||||
year={2013},
|
||||
volume={59},
|
||||
number={10},
|
||||
pages={6562-6582},
|
||||
keywords={approximation theory;codes;alphabet size;approximation methods;channel capacity;construction algorithms;polar bit-channels;polar codes;Approximation algorithms;Approximation methods;Complexity theory;Convolutional codes;Decoding;Kernel;Quantization (signal);Channel degrading and upgrading;channel polarization;construction algorithms;polar codes},
|
||||
doi={10.1109/TIT.2013.2272694},
|
||||
ISSN={0018-9448},
|
||||
month={Oct},
|
||||
}
|
||||
|
||||
@INPROCEEDINGS{polar:talvardy:scl,
|
||||
author={Tal, I. and Vardy, A.},
|
||||
booktitle={Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on},
|
||||
title={List decoding of polar codes},
|
||||
year={2011},
|
||||
pages={1-5},
|
||||
keywords={maximum likelihood decoding;Arikan;decoding paths;maximum likelihood decoder;polar codes;successive-cancellation list decoder;Arrays;Complexity theory;Equations;Error analysis;Mathematical model;Maximum likelihood decoding},
|
||||
doi={10.1109/ISIT.2011.6033904},
|
||||
ISSN={2157-8095},
|
||||
month={July},
|
||||
}
|
||||
|
||||
@article{polar:llr_scl,
|
||||
author = {Alexios Balatsoukas{-}Stimming and
|
||||
Mani Bastani Parizi and
|
||||
Andreas Burg},
|
||||
title = {LLR-based Successive Cancellation List Decoding of Polar Codes},
|
||||
journal = {CoRR},
|
||||
volume = {abs/1401.3753},
|
||||
year = {2014},
|
||||
url = {http://arxiv.org/abs/1401.3753},
|
||||
timestamp = {Sun, 02 Feb 2014 18:37:28 +0100},
|
||||
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/Balatsoukas-StimmingPB14},
|
||||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||||
}
|
||||
|
||||
@article{polar:fast-ssc,
|
||||
author = {Pascal Giard and
|
||||
Gabi Sarkis and
|
||||
Camille Leroux and
|
||||
Claude Thibeault and
|
||||
Warren J. Gross},
|
||||
title = {Low-Latency Software Polar Decoders},
|
||||
journal = {CoRR},
|
||||
volume = {abs/1504.00353},
|
||||
year = {2015},
|
||||
url = {http://arxiv.org/abs/1504.00353},
|
||||
timestamp = {Sat, 02 May 2015 17:50:32 +0200},
|
||||
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/GiardSLTG15},
|
||||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||||
}
|
||||
|
||||
@article{polar:fast-systematic-encoder,
|
||||
author = {Gabi Sarkis and
|
||||
Ido Tal and
|
||||
Pascal Giard and
|
||||
Alexander Vardy and
|
||||
Claude Thibeault and
|
||||
Warren J. Gross},
|
||||
title = {Flexible and Low-Complexity Encoding and Decoding of Systematic Polar
|
||||
Codes},
|
||||
journal = {CoRR},
|
||||
volume = {abs/1507.03614},
|
||||
year = {2015},
|
||||
url = {http://arxiv.org/abs/1507.03614},
|
||||
timestamp = {Sun, 02 Aug 2015 18:42:02 +0200},
|
||||
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/SarkisTGVTG15},
|
||||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||||
}
|
||||
|
||||
@INPROCEEDINGS{polar:bpd,
|
||||
author={Jing Guo and Minghai Qin and Guillen i Fabregas, A. and Siegel, P.H.},
|
||||
booktitle={Information Theory (ISIT), 2014 IEEE International Symposium on},
|
||||
title={Enhanced belief propagation decoding of polar codes through concatenation},
|
||||
year={2014},
|
||||
pages={2987-2991},
|
||||
keywords={concatenated codes;decoding;parity check codes;BP decoding;belief propagation decoding;bit-channels;concatenated polar code;enhanced concatenation;finite length polar codes;intermediate channels;low density parity check code;Bit error rate;Decoding;Iron;Parity check codes},
|
||||
doi={10.1109/ISIT.2014.6875382},
|
||||
month={June},
|
||||
}
|
||||
|
||||
@article{polar:sts,
|
||||
affiliation = {Key Laboratory of Universal Wireless Communications, Beijing University of Posts and Telecommunications},
|
||||
author = {Niu, K. and Chen, K.},
|
||||
doi = {10.1049/el.2012.1459},
|
||||
journal = {Electronics Letters},
|
||||
language = {Undetermined},
|
||||
number = {12},
|
||||
pages = {695 - 697},
|
||||
title = {Stack decoding of polar codes},
|
||||
volume = {48},
|
||||
year = {2012},
|
||||
}
|
||||
381
latex/cel-thesis/.gitignore
vendored
Normal file
381
latex/cel-thesis/.gitignore
vendored
Normal file
@ -0,0 +1,381 @@
|
||||
|
||||
# Created by https://www.toptal.com/developers/gitignore/api/latex,visualstudiocode,texstudio,emacs,vim
|
||||
# Edit at https://www.toptal.com/developers/gitignore?templates=latex,visualstudiocode,texstudio,emacs,vim
|
||||
|
||||
### Emacs ###
|
||||
# -*- mode: gitignore; -*-
|
||||
*~
|
||||
\#*\#
|
||||
/.emacs.desktop
|
||||
/.emacs.desktop.lock
|
||||
*.elc
|
||||
auto-save-list
|
||||
tramp
|
||||
.\#*
|
||||
|
||||
# Org-mode
|
||||
.org-id-locations
|
||||
*_archive
|
||||
ltximg/**
|
||||
|
||||
# flymake-mode
|
||||
*_flymake.*
|
||||
|
||||
# eshell files
|
||||
/eshell/history
|
||||
/eshell/lastdir
|
||||
|
||||
# elpa packages
|
||||
/elpa/
|
||||
|
||||
# reftex files
|
||||
*.rel
|
||||
|
||||
# AUCTeX auto folder
|
||||
/auto/
|
||||
|
||||
# cask packages
|
||||
.cask/
|
||||
dist/
|
||||
|
||||
# Flycheck
|
||||
flycheck_*.el
|
||||
|
||||
# server auth directory
|
||||
/server/
|
||||
|
||||
# projectiles files
|
||||
.projectile
|
||||
|
||||
# directory configuration
|
||||
.dir-locals.el
|
||||
|
||||
# network security
|
||||
/network-security.data
|
||||
|
||||
|
||||
### LaTeX ###
|
||||
## Core latex/pdflatex auxiliary files:
|
||||
*.aux
|
||||
*.lof
|
||||
*.log
|
||||
*.lot
|
||||
*.fls
|
||||
*.out
|
||||
*.toc
|
||||
*.fmt
|
||||
*.fot
|
||||
*.cb
|
||||
*.cb2
|
||||
.*.lb
|
||||
|
||||
## Intermediate documents:
|
||||
*.dvi
|
||||
*.xdv
|
||||
*-converted-to.*
|
||||
# these rules might exclude image files for figures etc.
|
||||
# *.ps
|
||||
# *.eps
|
||||
# *.pdf
|
||||
|
||||
## Generated if empty string is given at "Please type another file name for output:"
|
||||
.pdf
|
||||
|
||||
## Bibliography auxiliary files (bibtex/biblatex/biber):
|
||||
*.bbl
|
||||
*.bcf
|
||||
*.blg
|
||||
*-blx.aux
|
||||
*-blx.bib
|
||||
*.run.xml
|
||||
|
||||
## Build tool auxiliary files:
|
||||
*.fdb_latexmk
|
||||
*.synctex
|
||||
*.synctex(busy)
|
||||
*.synctex.gz
|
||||
*.synctex.gz(busy)
|
||||
*.pdfsync
|
||||
|
||||
## Build tool directories for auxiliary files
|
||||
# latexrun
|
||||
latex.out/
|
||||
|
||||
## Auxiliary and intermediate files from other packages:
|
||||
# algorithms
|
||||
*.alg
|
||||
*.loa
|
||||
|
||||
# achemso
|
||||
acs-*.bib
|
||||
|
||||
# amsthm
|
||||
*.thm
|
||||
|
||||
# beamer
|
||||
*.nav
|
||||
*.pre
|
||||
*.snm
|
||||
*.vrb
|
||||
|
||||
# changes
|
||||
*.soc
|
||||
|
||||
# comment
|
||||
*.cut
|
||||
|
||||
# cprotect
|
||||
*.cpt
|
||||
|
||||
# elsarticle (documentclass of Elsevier journals)
|
||||
*.spl
|
||||
|
||||
# endnotes
|
||||
*.ent
|
||||
|
||||
# fixme
|
||||
*.lox
|
||||
|
||||
# feynmf/feynmp
|
||||
*.mf
|
||||
*.mp
|
||||
*.t[1-9]
|
||||
*.t[1-9][0-9]
|
||||
*.tfm
|
||||
|
||||
#(r)(e)ledmac/(r)(e)ledpar
|
||||
*.end
|
||||
*.?end
|
||||
*.[1-9]
|
||||
*.[1-9][0-9]
|
||||
*.[1-9][0-9][0-9]
|
||||
*.[1-9]R
|
||||
*.[1-9][0-9]R
|
||||
*.[1-9][0-9][0-9]R
|
||||
*.eledsec[1-9]
|
||||
*.eledsec[1-9]R
|
||||
*.eledsec[1-9][0-9]
|
||||
*.eledsec[1-9][0-9]R
|
||||
*.eledsec[1-9][0-9][0-9]
|
||||
*.eledsec[1-9][0-9][0-9]R
|
||||
|
||||
# glossaries
|
||||
*.acn
|
||||
*.acr
|
||||
*.glg
|
||||
*.glo
|
||||
*.gls
|
||||
*.glsdefs
|
||||
*.lzo
|
||||
*.lzs
|
||||
|
||||
# uncomment this for glossaries-extra (will ignore makeindex's style files!)
|
||||
# *.ist
|
||||
|
||||
# gnuplottex
|
||||
*-gnuplottex-*
|
||||
|
||||
# gregoriotex
|
||||
*.gaux
|
||||
*.gtex
|
||||
|
||||
# htlatex
|
||||
*.4ct
|
||||
*.4tc
|
||||
*.idv
|
||||
*.lg
|
||||
*.trc
|
||||
*.xref
|
||||
|
||||
# hyperref
|
||||
*.brf
|
||||
|
||||
# knitr
|
||||
*-concordance.tex
|
||||
# TODO Comment the next line if you want to keep your tikz graphics files
|
||||
*.tikz
|
||||
*-tikzDictionary
|
||||
|
||||
# listings
|
||||
*.lol
|
||||
|
||||
# luatexja-ruby
|
||||
*.ltjruby
|
||||
|
||||
# makeidx
|
||||
*.idx
|
||||
*.ilg
|
||||
*.ind
|
||||
|
||||
# minitoc
|
||||
*.maf
|
||||
*.mlf
|
||||
*.mlt
|
||||
*.mtc
|
||||
*.mtc[0-9]*
|
||||
*.slf[0-9]*
|
||||
*.slt[0-9]*
|
||||
*.stc[0-9]*
|
||||
|
||||
# minted
|
||||
_minted*
|
||||
*.pyg
|
||||
|
||||
# morewrites
|
||||
*.mw
|
||||
|
||||
# nomencl
|
||||
*.nlg
|
||||
*.nlo
|
||||
*.nls
|
||||
|
||||
# pax
|
||||
*.pax
|
||||
|
||||
# pdfpcnotes
|
||||
*.pdfpc
|
||||
|
||||
# sagetex
|
||||
*.sagetex.sage
|
||||
*.sagetex.py
|
||||
*.sagetex.scmd
|
||||
|
||||
# scrwfile
|
||||
*.wrt
|
||||
|
||||
# sympy
|
||||
*.sout
|
||||
*.sympy
|
||||
sympy-plots-for-*.tex/
|
||||
|
||||
# pdfcomment
|
||||
*.upa
|
||||
*.upb
|
||||
|
||||
# pythontex
|
||||
*.pytxcode
|
||||
pythontex-files-*/
|
||||
|
||||
# tcolorbox
|
||||
*.listing
|
||||
|
||||
# thmtools
|
||||
*.loe
|
||||
|
||||
# TikZ & PGF
|
||||
*.dpth
|
||||
*.md5
|
||||
*.auxlock
|
||||
|
||||
# todonotes
|
||||
*.tdo
|
||||
|
||||
# vhistory
|
||||
*.hst
|
||||
*.ver
|
||||
|
||||
# easy-todo
|
||||
*.lod
|
||||
|
||||
# xcolor
|
||||
*.xcp
|
||||
|
||||
# xmpincl
|
||||
*.xmpi
|
||||
|
||||
# xindy
|
||||
*.xdy
|
||||
|
||||
# xypic precompiled matrices and outlines
|
||||
*.xyc
|
||||
*.xyd
|
||||
|
||||
# endfloat
|
||||
*.ttt
|
||||
*.fff
|
||||
|
||||
# Latexian
|
||||
TSWLatexianTemp*
|
||||
|
||||
## Editors:
|
||||
# WinEdt
|
||||
*.bak
|
||||
*.sav
|
||||
|
||||
# Texpad
|
||||
.texpadtmp
|
||||
|
||||
# LyX
|
||||
*.lyx~
|
||||
|
||||
# Kile
|
||||
*.backup
|
||||
|
||||
# gummi
|
||||
.*.swp
|
||||
|
||||
# KBibTeX
|
||||
*~[0-9]*
|
||||
|
||||
# TeXnicCenter
|
||||
*.tps
|
||||
|
||||
# auto folder when using emacs and auctex
|
||||
./auto/*
|
||||
*.el
|
||||
|
||||
# expex forward references with \gathertags
|
||||
*-tags.tex
|
||||
|
||||
# standalone packages
|
||||
*.sta
|
||||
|
||||
# Makeindex log files
|
||||
*.lpz
|
||||
|
||||
# REVTeX puts footnotes in the bibliography by default, unless the nofootinbib
|
||||
# option is specified. Footnotes are the stored in a file with suffix Notes.bib.
|
||||
# Uncomment the next line to have this generated file ignored.
|
||||
#*Notes.bib
|
||||
|
||||
### LaTeX Patch ###
|
||||
# LIPIcs / OASIcs
|
||||
*.vtc
|
||||
|
||||
# glossaries
|
||||
*.glstex
|
||||
|
||||
#!! ERROR: texstudio is undefined. Use list command to see defined gitignore types !!#
|
||||
|
||||
### Vim ###
|
||||
# Swap
|
||||
[._]*.s[a-v][a-z]
|
||||
!*.svg # comment out if you don't need vector files
|
||||
[._]*.sw[a-p]
|
||||
[._]s[a-rt-v][a-z]
|
||||
[._]ss[a-gi-z]
|
||||
[._]sw[a-p]
|
||||
|
||||
# Session
|
||||
Session.vim
|
||||
Sessionx.vim
|
||||
|
||||
# Temporary
|
||||
.netrwhist
|
||||
# Auto-generated tag files
|
||||
tags
|
||||
# Persistent undo
|
||||
[._]*.un~
|
||||
|
||||
### VisualStudioCode ###
|
||||
.vscode/*
|
||||
!.vscode/tasks.json
|
||||
!.vscode/launch.json
|
||||
*.code-workspace
|
||||
|
||||
### VisualStudioCode Patch ###
|
||||
# Ignore all local history of files
|
||||
.history
|
||||
.ionide
|
||||
|
||||
# End of https://www.toptal.com/developers/gitignore/api/latex,visualstudiocode,texstudio,emacs,vim
|
||||
489
latex/cel-thesis/IEEEabrv.bib
Normal file
489
latex/cel-thesis/IEEEabrv.bib
Normal file
@ -0,0 +1,489 @@
|
||||
|
||||
IEEEabrv.bib
|
||||
V1.14 (2015/08/26)
|
||||
Copyright (c) 2002-2015 by Michael Shell
|
||||
See: http://www.michaelshell.org/
|
||||
for current contact information.
|
||||
|
||||
BibTeX bibliography string definitions of the ABBREVIATED titles of
|
||||
IEEE journals and magazines and online publications.
|
||||
|
||||
This file is designed for bibliography styles that require
|
||||
abbreviated titles and is not for use in bibliographies that
|
||||
require full-length titles.
|
||||
|
||||
Support sites:
|
||||
http://www.michaelshell.org/tex/ieeetran/
|
||||
http://www.ctan.org/pkg/ieeetran
|
||||
and/or
|
||||
http://www.ieee.org/
|
||||
|
||||
Special thanks to Laura Hyslop, Ken Rawson, Kevin Lisankie and
|
||||
Mona Mittra of the IEEE for their help in obtaining the information needed
|
||||
to compile this file. Also, Volker Kuhlmann, Moritz Borgmann,
|
||||
Yannick Berker, Nicolás Barabino, Chuanren Wu and Santiago Cogollos Borras
|
||||
kindly provided some corrections and additions.
|
||||
|
||||
|
||||
*************************************************************************
|
||||
Legal Notice:
|
||||
This code is offered as-is without any warranty either expressed or
|
||||
implied; without even the implied warranty of MERCHANTABILITY or
|
||||
FITNESS FOR A PARTICULAR PURPOSE!
|
||||
User assumes all risk.
|
||||
In no event shall the IEEE or any contributor to this code be liable for
|
||||
any damages or losses, including, but not limited to, incidental,
|
||||
consequential, or any other damages, resulting from the use or misuse
|
||||
of any information contained here.
|
||||
|
||||
All comments are the opinions of their respective authors and are not
|
||||
necessarily endorsed by the IEEE.
|
||||
|
||||
This work is distributed under the LaTeX Project Public License (LPPL)
|
||||
( http://www.latex-project.org/ ) version 1.3, and may be freely used,
|
||||
distributed and modified. A copy of the LPPL, version 1.3, is included
|
||||
in the base LaTeX documentation of all distributions of LaTeX released
|
||||
2003/12/01 or later.
|
||||
Retain all contribution notices and credits.
|
||||
** Modified files should be clearly indicated as such, including **
|
||||
** renaming them and changing author support contact information. **
|
||||
*************************************************************************
|
||||
|
||||
|
||||
USAGE:
|
||||
|
||||
\bibliographystyle{mybstfile}
|
||||
\bibliography{IEEEabrv,mybibfile}
|
||||
|
||||
where the IEEE titles in the .bib database entries use the strings
|
||||
defined here. e.g.,
|
||||
|
||||
|
||||
journal = IEEE_J_AC,
|
||||
|
||||
|
||||
to yield "{IEEE} Trans. Automat. Contr."
|
||||
|
||||
|
||||
The IEEE uses abbreviated journal titles in their bibliographies -
|
||||
this file is suitable for work that is to be submitted to the IEEE.
|
||||
|
||||
For work that requires full-length titles, you should use the full
|
||||
titles provided in the companion file, IEEEfull.bib.
|
||||
|
||||
|
||||
** NOTES **
|
||||
|
||||
1. Journals have been grouped according to subject in order to make it
|
||||
easier to locate and extract the definitions for related journals -
|
||||
as most works use references that are confined to a single topic.
|
||||
Magazines are listed in straight alphabetical order.
|
||||
|
||||
2. String names are closely based on IEEE's own internal acronyms.
|
||||
|
||||
3. Older, out-of-print IEEE titles are included (but not including titles
|
||||
dating prior to the IEEE's formation from the IRE and AIEE in 1963).
|
||||
|
||||
4. Abbreviations comply with the official specifications of the IEEE.
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
IEEE Journals
|
||||
|
||||
|
||||
aerospace and military
|
||||
@STRING{IEEE_J_ANNE = "{IEEE} Trans. Aeronaut. Navig. Electron."}
|
||||
@STRING{IEEE_J_AES = "{IEEE} Trans. Aerosp. Electron. Syst."}
|
||||
@STRING{IEEE_J_ANE = "{IEEE} Trans. Aerosp. Navig. Electron."}
|
||||
@STRING{IEEE_J_AS = "{IEEE} Trans. Aerosp."}
|
||||
@STRING{IEEE_J_AIRE = "{IEEE} Trans. Airborne Electron."}
|
||||
@STRING{IEEE_J_MIL = "{IEEE} Trans. Mil. Electron."}
|
||||
|
||||
|
||||
|
||||
autos, transportation and vehicles (non-aerospace)
|
||||
@STRING{IEEE_J_ITS = "{IEEE} Trans. Intell. Transp. Syst."}
|
||||
@STRING{IEEE_J_IV = "{IEEE} Trans. Intell. Veh."}
|
||||
@STRING{IEEE_J_TTE = "{IEEE} Trans. Transport. Electrific."}
|
||||
@STRING{IEEE_J_VC = "{IEEE} Trans. Veh. Commun."}
|
||||
@STRING{IEEE_J_VT = "{IEEE} Trans. Veh. Technol."}
|
||||
|
||||
|
||||
|
||||
circuits, signals, systems, audio and controls
|
||||
@STRING{IEEE_J_STSP = "{IEEE} J. Sel. Topics Signal Process."}
|
||||
@STRING{IEEE_J_SPL = "{IEEE} Signal Process. Lett."}
|
||||
@STRING{IEEE_J_SYST = "{IEEE} Syst. J."}
|
||||
@STRING{IEEE_J_ASSP = "{IEEE} Trans. Acoust., Speech, Signal Process."}
|
||||
@STRING{IEEE_J_AU = "{IEEE} Trans. Audio"}
|
||||
@STRING{IEEE_J_AUEA = "{IEEE} Trans. Audio Electroacoust."}
|
||||
in 2014 ASL became ASLP
|
||||
@STRING{IEEE_J_ASLP = "{IEEE/ACM} Trans. Audio, Speech, Language Process."}
|
||||
@STRING{IEEE_J_ASL = "{IEEE} Audio, Speech, Language Process."}
|
||||
@STRING{IEEE_J_AC = "{IEEE} Trans. Autom. Control"}
|
||||
@STRING{IEEE_J_CAS = "{IEEE} Trans. Circuits Syst."}
|
||||
@STRING{IEEE_J_CASVT = "{IEEE} Trans. Circuits Syst. Video Technol."}
|
||||
@STRING{IEEE_J_CASI = "{IEEE} Trans. Circuits Syst. {I}"}
|
||||
@STRING{IEEE_J_CASII = "{IEEE} Trans. Circuits Syst. {II}"}
|
||||
in 2004 CASI and CASII renamed part title to CASI_RP and CASII_EB, respectively
|
||||
@STRING{IEEE_J_CASI_RP = "{IEEE} Trans. Circuits Syst. {I}"}
|
||||
@STRING{IEEE_J_CASII_EB = "{IEEE} Trans. Circuits Syst. {II}"}
|
||||
@STRING{IEEE_J_CT = "{IEEE} Trans. Circuit Theory"}
|
||||
@STRING{IEEE_J_CST = "{IEEE} Trans. Control Syst. Technol."}
|
||||
@STRING{IEEE_J_ETCAS = "{IEEE} Trans. Emerg. Sel. Topics Circuits Syst."}
|
||||
@STRING{IEEE_J_SP = "{IEEE} Trans. Signal Process."}
|
||||
@STRING{IEEE_J_SU = "{IEEE} Trans. Sonics Ultrason."}
|
||||
@STRING{IEEE_J_SAP = "{IEEE} Trans. Speech Audio Process."}
|
||||
@STRING{IEEE_J_UE = "{IEEE} Trans. Ultrason. Eng."}
|
||||
@STRING{IEEE_J_UFFC = "{IEEE} Trans. Ultrason., Ferroelectr., Freq. Control"}
|
||||
|
||||
|
||||
|
||||
communications
|
||||
@STRING{IEEE_J_COML = "{IEEE} Commun. Lett."}
|
||||
@STRING{IEEE_J_JSAC = "{IEEE} J. Sel. Areas Commun."}
|
||||
@STRING{IEEE_J_COM = "{IEEE} Trans. Commun."}
|
||||
@STRING{IEEE_J_COMT = "{IEEE} Trans. Commun. Technol."}
|
||||
@STRING{IEEE_J_WCOM = "{IEEE} Trans. Wireless Commun."}
|
||||
@STRING{IEEE_J_WCOML = "{IEEE} Wireless Commun. Lett."}
|
||||
|
||||
|
||||
|
||||
components, packaging and manufacturing
|
||||
@STRING{IEEE_J_ADVP = "{IEEE} Trans. Adv. Packag."}
|
||||
@STRING{IEEE_J_CHMT = "{IEEE} Trans. Compon., Hybrids, Manuf. Technol."}
|
||||
in 2011 CAPT became CPMT
|
||||
@STRING{IEEE_J_CPMT = "{IEEE} Trans. Compon. Packag. Manuf. Technol."}
|
||||
@STRING{IEEE_J_CPMTA = "{IEEE} Trans. Compon., Packag., Manuf. Technol. {A}"}
|
||||
@STRING{IEEE_J_CPMTB = "{IEEE} Trans. Compon., Packag., Manuf. Technol. {B}"}
|
||||
@STRING{IEEE_J_CPMTC = "{IEEE} Trans. Compon., Packag., Manuf. Technol. {C}"}
|
||||
@STRING{IEEE_J_CAPTS = "{IEEE} Trans. Compon. Packag. Technol."}
|
||||
@STRING{IEEE_J_CAPT = "{IEEE} Trans. Compon. Packag. Technol."}
|
||||
@STRING{IEEE_J_CPART = "{IEEE} Trans. Compon. Parts"}
|
||||
@STRING{IEEE_J_EPM = "{IEEE} Trans. Electron. Packag. Manuf."}
|
||||
@STRING{IEEE_J_MFT = "{IEEE} Trans. Manuf. Technol."}
|
||||
@STRING{IEEE_J_PHP = "{IEEE} Trans. Parts, Hybrids, Packag."}
|
||||
@STRING{IEEE_J_PMP = "{IEEE} Trans. Parts, Mater., Packag."}
|
||||
|
||||
|
||||
|
||||
CAD
|
||||
@STRING{IEEE_J_TCAD = "{IEEE} J. Technol. Comput. Aided Design"}
|
||||
@STRING{IEEE_J_CAD = "{IEEE} Trans. Comput.-Aided Design Integr. Circuits Syst."}
|
||||
|
||||
|
||||
|
||||
coding, data, information, knowledge
|
||||
@STRING{IEEE_J_BD = "{IEEE} Trans. Big Data"}
|
||||
@STRING{IEEE_J_IFS = "{IEEE} Trans. Inf. Forensics Security"}
|
||||
@STRING{IEEE_J_IT = "{IEEE} Trans. Inf. Theory"}
|
||||
@STRING{IEEE_J_KDE = "{IEEE} Trans. Knowl. Data Eng."}
|
||||
|
||||
|
||||
|
||||
computers, computation, networking and software
|
||||
@STRING{IEEE_J_CAL = "{IEEE} Comput. Archit. Lett."}
|
||||
@STRING{IEEE_J_ES = "{IEEE} Embedded Syst. Lett."}
|
||||
@STRING{IEEE_J_IOT = "{IEEE} Internet Things J."}
|
||||
@STRING{IEEE_J_XCDC = "{IEEE} J. Explor. Solid-State Computat. Devices Circuits"}
|
||||
@STRING{IEEE_J_MMCT = "{IEEE} J. Multiscale and Multiphys. Comput. Techn."}
|
||||
@STRING{IEEE_J_SUSC = "{IEEE} Sustain. Comput."}
|
||||
@STRING{IEEE_J_CC = "{IEEE} Trans. on Cloud Comput."}
|
||||
@STRING{IEEE_J_CSS = "{IEEE} Trans. Comput. Social Syst."}
|
||||
@STRING{IEEE_J_C = "{IEEE} Trans. Comput."}
|
||||
@STRING{IEEE_J_CNS = "{IEEE} Trans. Control Netw. Syst."}
|
||||
@STRING{IEEE_J_DSC = "{IEEE} Trans. Depend. Sec. Comput."}
|
||||
@STRING{IEEE_J_ECOMP = "{IEEE} Trans. Electron. Comput."}
|
||||
@STRING{IEEE_J_ETC = "{IEEE} Trans. Emerg. Topics Comput."}
|
||||
@STRING{IEEE_J_EVC = "{IEEE} Trans. Evol. Comput."}
|
||||
@STRING{IEEE_J_FUZZ = "{IEEE} Trans. Fuzzy Syst."}
|
||||
@STRING{IEEE_J_MC = "{IEEE} Trans. Mobile Comput."}
|
||||
@STRING{IEEE_J_MSCS = "{IEEE} Trans. Multi-Scale Comput. Syst."}
|
||||
@STRING{IEEE_J_NET = "{IEEE/ACM} Trans. Netw."}
|
||||
@STRING{IEEE_J_NSE = "{IEEE} Trans. Netw. Sci. Eng."}
|
||||
@STRING{IEEE_J_NSM = "{IEEE} Trans. Netw. Service Manag."}
|
||||
@STRING{IEEE_J_NN = "{IEEE} Trans. Neural Netw."}
|
||||
in 2012 NN became NNLS
|
||||
@STRING{IEEE_J_NNLS = "{IEEE} Trans. Neural Netw. Learn. Syst."}
|
||||
@STRING{IEEE_J_PDS = "{IEEE} Trans. Parallel Distrib. Syst."}
|
||||
@STRING{IEEE_J_SC = "{IEEE} Trans. Serv. Comput."}
|
||||
@STRING{IEEE_J_SIPN = "{IEEE} Trans. Signal Inf. Process. Netw."}
|
||||
@STRING{IEEE_J_SE = "{IEEE} Trans. Softw. Eng."}
|
||||
|
||||
|
||||
|
||||
computer graphics, imaging, and multimedia
|
||||
@STRING{IEEE_J_JDT = "{IEEE/OSA} J. Display Technol."}
|
||||
@STRING{IEEE_J_IP = "{IEEE} Trans. Image Process."}
|
||||
@STRING{IEEE_J_MM = "{IEEE} Trans. Multimedia"}
|
||||
@STRING{IEEE_J_VCG = "{IEEE} Trans. Vis. Comput. Graphics"}
|
||||
|
||||
|
||||
|
||||
cybernetics, ergonomics, robots, man-machine, artificial intelligence and automation
|
||||
@STRING{IEEE_J_JAS = "{IEEE/CAA} J. Autom. Sinica"}
|
||||
@STRING{IEEE_J_JRA = "{IEEE} J. Robot. Autom."}
|
||||
@STRING{IEEE_J_AFFC = "{IEEE} Trans. Affect. Comput."}
|
||||
@STRING{IEEE_J_ASE = "{IEEE} Trans. Autom. Sci. Eng."}
|
||||
@STRING{IEEE_J_AMD = "{IEEE} Trans. Auton. Mental Develop."}
|
||||
@STRING{IEEE_J_CCN = "{IEEE} Trans. on Cogn. Commun. Netw."}
|
||||
in 2015 AMD became CDS
|
||||
@STRING{IEEE_J_CDS = "{IEEE} Trans. Cogn. Develop. Syst."}
|
||||
@STRING{IEEE_J_CIAIG = "{IEEE} Trans. Comput. Intell. {AI} in Games"}
|
||||
in 2013 SMCB became CYB
|
||||
@STRING{IEEE_J_CYB = "{IEEE} Trans. Cybern."}
|
||||
@STRING{IEEE_J_H = "{IEEE} Trans. Haptics"}
|
||||
@STRING{IEEE_J_HFE = "{IEEE} Trans. Hum. Factors Electron."}
|
||||
in 2013 SMCC became HMS
|
||||
@STRING{IEEE_J_HMS = "{IEEE} Trans. Human-Mach. Syst."}
|
||||
@STRING{IEEE_J_MMS = "{IEEE} Trans. Man-Mach. Syst."}
|
||||
@STRING{IEEE_J_PAMI = "{IEEE} Trans. Pattern Anal. Mach. Intell."}
|
||||
in 1989 JRA became RA
|
||||
in August 2004, RA split into ASE and RO
|
||||
@STRING{IEEE_J_RA = "{IEEE} Trans. Robot. Autom."}
|
||||
@STRING{IEEE_J_RAL = "{IEEE} Robot. Autom. Lett."}
|
||||
@STRING{IEEE_J_RO = "{IEEE} Trans. Robot."}
|
||||
@STRING{IEEE_J_SMC = "{IEEE} Trans. Syst., Man, Cybern."}
|
||||
@STRING{IEEE_J_SMCA = "{IEEE} Trans. Syst., Man, Cybern. {A}"}
|
||||
@STRING{IEEE_J_SMCB = "{IEEE} Trans. Syst., Man, Cybern. {B}"}
|
||||
@STRING{IEEE_J_SMCC = "{IEEE} Trans. Syst., Man, Cybern. {C}"}
|
||||
in 2012 SMCA became SMCS
|
||||
@STRING{IEEE_J_SMCS = "{IEEE} Trans. Syst., Man, Cybern., Syst."}
|
||||
@STRING{IEEE_J_SSC = "{IEEE} Trans. Syst. Sci. Cybern."}
|
||||
|
||||
|
||||
|
||||
earth, wind, fire and water
|
||||
@STRING{IEEE_J_GRSL = "{IEEE} Geosci. Remote Sens. Lett."}
|
||||
@STRING{IEEE_J_GE = "{IEEE} Trans. Geosci. Electron."}
|
||||
@STRING{IEEE_J_GRS = "{IEEE} Trans. Geosci. Remote Sens."}
|
||||
@STRING{IEEE_J_OE = "{IEEE} J. Ocean. Eng."}
|
||||
@STRING{IEEE_J_STARS = "{IEEE} J. Sel. Topics Appl. Earth Observ. Remote Sens."}
|
||||
|
||||
|
||||
|
||||
education, engineering, history, IEEE, professional
|
||||
@STRING{IEEE_J_CJECE = "Canadian J. Elect. Comput. Eng."}
|
||||
@STRING{IEEE_J_PROC = "Proc. {IEEE}"}
|
||||
@STRING{IEEE_J_RITA = "{IEEE} Revista Iberoamericana de Technolog{\'{i}}as del Aprendizaje"}
|
||||
@STRING{IEEE_J_EDU = "{IEEE} Trans. Educ."}
|
||||
@STRING{IEEE_J_EM = "{IEEE} Trans. Eng. Manag."}
|
||||
@STRING{IEEE_J_EWS = "{IEEE} Trans. Eng. Writing Speech"}
|
||||
@STRING{IEEE_J_LT = "{IEEE} Trans. Learn. Technol."}
|
||||
@STRING{IEEE_J_PC = "{IEEE} Trans. Prof. Commun."}
|
||||
|
||||
|
||||
|
||||
electromagnetics, antennas, EMI, magnetics and microwave
|
||||
@STRING{IEEE_J_AWPL = "{IEEE} Antennas Wireless Propag. Lett."}
|
||||
@STRING{IEEE_J_MAGL = "{IEEE} Magn. Lett."}
|
||||
@STRING{IEEE_J_MGWL = "{IEEE} Microw. Guided Wave Lett."}
|
||||
@STRING{IEEE_J_MWCL = "{IEEE} Microw. Wireless Compon. Lett."}
|
||||
@STRING{IEEE_J_RFIC = "{IEEE} {RFIC} J."}
|
||||
@STRING{IEEE_J_RFID = "{IEEE} {RFID} J."}
|
||||
@STRING{IEEE_J_AP = "{IEEE} Trans. Antennas Propag."}
|
||||
@STRING{IEEE_J_EMC = "{IEEE} Trans. Electromagn. Compat."}
|
||||
@STRING{IEEE_J_MAG = "{IEEE} Trans. Magn."}
|
||||
@STRING{IEEE_J_MTT = "{IEEE} Trans. Microw. Theory Techn."}
|
||||
@STRING{IEEE_J_RFI = "{IEEE} Trans. Radio Freq. Interference"}
|
||||
@STRING{IEEE_J_TTHZ = "{IEEE} Trans. {THz} Sci. Technol."}
|
||||
@STRING{IEEE_J_TJMJ = "{IEEE} Transl. J. Magn. Jpn."}
|
||||
|
||||
|
||||
|
||||
energy, power and conversion
|
||||
@STRING{IEEE_J_PHOT = "{IEEE} J. Photovolt."}
|
||||
@STRING{IEEE_J_PEL = "{IEEE} Power Electron. Lett."}
|
||||
@STRING{IEEE_J_PETS = "{IEEE} Power Energy Technol. Syst. J."}
|
||||
@STRING{IEEE_J_ESTPE = "{IEEE} Trans. Emerg. Sel. Topics Power Electron."}
|
||||
@STRING{IEEE_J_EC = "{IEEE} Trans. Energy Convers."}
|
||||
@STRING{IEEE_J_PWRAS = "{IEEE} Trans. Power App. Syst."}
|
||||
@STRING{IEEE_J_PWRD = "{IEEE} Trans. Power Del."}
|
||||
@STRING{IEEE_J_PWRE = "{IEEE} Trans. Power Electron."}
|
||||
@STRING{IEEE_J_PWRS = "{IEEE} Trans. Power Syst."}
|
||||
@STRING{IEEE_J_SG = "{IEEE} Trans. Smart Grid"}
|
||||
@STRING{IEEE_J_STE = "{IEEE} Trans. Sustain. Energy"}
|
||||
|
||||
|
||||
|
||||
industrial, commercial and consumer
|
||||
@STRING{IEEE_J_PSE = "{IEEE} J. Product Safety Eng."}
|
||||
@STRING{IEEE_J_APPIND = "{IEEE} Trans. Appl. Ind."}
|
||||
@STRING{IEEE_J_BC = "{IEEE} Trans. Broadcast."}
|
||||
@STRING{IEEE_J_BCTV = "{IEEE} Trans. Broadcast Television Receivers"}
|
||||
@STRING{IEEE_J_CE = "{IEEE} Trans. Consum. Electron."}
|
||||
@STRING{IEEE_J_IE = "{IEEE} Trans. Ind. Electron."}
|
||||
@STRING{IEEE_J_IECI = "{IEEE} Trans. Ind. Electron. Contr. Instrum."}
|
||||
@STRING{IEEE_J_IA = "{IEEE} Trans. Ind. Appl."}
|
||||
@STRING{IEEE_J_IGA = "{IEEE} Trans. Ind. Gen. Appl."}
|
||||
@STRING{IEEE_J_IINF = "{IEEE} Trans. Ind. Informat."}
|
||||
|
||||
|
||||
|
||||
instrumentation and measurement
|
||||
@STRING{IEEE_J_IM = "{IEEE} Trans. Instrum. Meas."}
|
||||
|
||||
|
||||
|
||||
insulation and materials
|
||||
@STRING{IEEE_J_JEM = "{IEEE/TMS} J. Electron. Mater."}
|
||||
@STRING{IEEE_J_DEI = "{IEEE} Trans. Dielectr. Electr. Insul."}
|
||||
@STRING{IEEE_J_EI = "{IEEE} Trans. Electr. Insul."}
|
||||
|
||||
|
||||
|
||||
mechanical
|
||||
@STRING{IEEE_J_MEMS = "J. Microelectromech. Syst."}
|
||||
in 2014 MEMS became MEMSI
|
||||
@STRING{IEEE_J_MEMSI = "J. Microelectromech. Syst."}
|
||||
@STRING{IEEE_J_MECH = "{IEEE/ASME} Trans. Mechatronics"}
|
||||
|
||||
|
||||
|
||||
medical and biological
|
||||
@STRING{IEEE_J_BHI = "{IEEE} J. Biomed. Health Inform."}
|
||||
@STRING{IEEE_J_TEHM = "{IEEE} J. Transl. Eng. Health Med."}
|
||||
@STRING{IEEE_J_LS = "{IEEE} Life Sci. Lett."}
|
||||
@STRING{IEEE_J_RBME = "{IEEE} Rev. Biomed. Eng."}
|
||||
@STRING{IEEE_J_BCAS = "{IEEE} Trans. Biomed. Circuits Syst."}
|
||||
@STRING{IEEE_J_BMELC = "{IEEE} Trans. Bio-Med. Electron."}
|
||||
B-ME later dropped the hyphen and became the BME
|
||||
@STRING{IEEE_J_BME = "{IEEE} Trans. Biomed. Eng."}
|
||||
@STRING{IEEE_J_B-ME = "{IEEE} Trans. Bio-Med. Eng."}
|
||||
@STRING{IEEE_J_CBB = "{IEEE/ACM} Trans. Comput. Biol. Bioinformatics"}
|
||||
@STRING{IEEE_J_ITBM = "{IEEE} Trans. Inf. Technol. Biomed."}
|
||||
@STRING{IEEE_J_ME = "{IEEE} Trans. Med. Electron."}
|
||||
@STRING{IEEE_J_MI = "{IEEE} Trans. Med. Imag."}
|
||||
@STRING{IEEE_J_MBSC = "{IEEE} Trans. Mol. Biol. Multi-Scale Commun."}
|
||||
@STRING{IEEE_J_NB = "{IEEE} Trans. Nanobiosci."}
|
||||
@STRING{IEEE_J_NSRE = "{IEEE} Trans. Neural Syst. Rehabil. Eng."}
|
||||
@STRING{IEEE_J_RE = "{IEEE} Trans. Rehabil. Eng."}
|
||||
|
||||
|
||||
|
||||
optics, lightwave and photonics
|
||||
@STRING{IEEE_J_JLT = "J. Lightw. Technol."}
|
||||
@STRING{IEEE_J_OCN = "{IEEE} J. Opt. Commun. Netw."}
|
||||
@STRING{IEEE_J_PJ = "{IEEE} Photon. J."}
|
||||
@STRING{IEEE_J_PTL = "{IEEE} Photon. Technol. Lett."}
|
||||
|
||||
|
||||
|
||||
physics, electrons, nanotechnology, nuclear and quantum electronics
|
||||
@STRING{IEEE_J_EDL = "{IEEE} Electron Device Lett."}
|
||||
@STRING{IEEE_J_EDS = "{IEEE} J. Electron Devices Soc."}
|
||||
@STRING{IEEE_J_JQE = "{IEEE} J. Quantum Electron."}
|
||||
@STRING{IEEE_J_JSTQE = "{IEEE} J. Sel. Topics Quantum Electron."}
|
||||
@STRING{IEEE_J_ENANO = "{IEEE} Nanotechnol. Express"}
|
||||
@STRING{IEEE_J_ED = "{IEEE} Trans. Electron Devices"}
|
||||
@STRING{IEEE_J_NANO = "{IEEE} Trans. Nanotechnol."}
|
||||
@STRING{IEEE_J_NS = "{IEEE} Trans. Nucl. Sci."}
|
||||
@STRING{IEEE_J_PS = "{IEEE} Trans. Plasma Sci."}
|
||||
|
||||
|
||||
|
||||
reliability
|
||||
@STRING{IEEE_J_DMR = "{IEEE} Trans. Device Mater. Rel."}
|
||||
@STRING{IEEE_J_R = "{IEEE} Trans. Rel."}
|
||||
|
||||
|
||||
|
||||
semiconductors, superconductors, electrochemical and solid state
|
||||
@STRING{IEEE_J_ESSL = "{IEEE/ECS} Electrochem. Solid-State Lett."}
|
||||
@STRING{IEEE_J_JSSC = "{IEEE} J. Solid-State Circuits"}
|
||||
@STRING{IEEE_J_ASC = "{IEEE} Trans. Appl. Supercond."}
|
||||
@STRING{IEEE_J_SM = "{IEEE} Trans. Semicond. Manuf."}
|
||||
|
||||
|
||||
|
||||
sensors
|
||||
@STRING{IEEE_J_SENSOR = "{IEEE} Sensors J."}
|
||||
|
||||
|
||||
|
||||
VLSI
|
||||
@STRING{IEEE_J_VLSI = "{IEEE} Trans. {VLSI} Syst."}
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
IEEE Magazines and Online Publications
|
||||
|
||||
|
||||
@STRING{IEEE_O_ACC = "{IEEE} Access"}
|
||||
@STRING{IEEE_M_AES = "{IEEE} Aerosp. Electron. Syst. Mag."}
|
||||
@STRING{IEEE_M_HIST = "{IEEE} Ann. Hist. Comput."}
|
||||
@STRING{IEEE_M_AP = "{IEEE} Antennas Propag. Mag."}
|
||||
@STRING{IEEE_M_ASSP = "{IEEE} {ASSP} Mag."}
|
||||
@STRING{IEEE_M_CHINAC = "China Commun."}
|
||||
@STRING{IEEE_M_CD = "{IEEE} Circuits Devices Mag."}
|
||||
@STRING{IEEE_M_CAS = "{IEEE} Circuits Syst. Mag."}
|
||||
@STRING{IEEE_M_COM = "{IEEE} Commun. Mag."}
|
||||
@STRING{IEEE_M_COMSOC = "{IEEE} Commun. Soc. Mag."}
|
||||
@STRING{IEEE_O_CSTO = "{IEEE} Commun. Surveys Tuts."}
|
||||
@STRING{IEEE_M_CIM = "{IEEE} Comput. Intell. Mag."}
|
||||
CSEM changed to CSE in 1999
|
||||
@STRING{IEEE_M_CSE = "{IEEE} Comput. Sci. Eng."}
|
||||
@STRING{IEEE_M_CSEM = "{IEEE} Comput. Sci. Eng. Mag."}
|
||||
@STRING{IEEE_M_C = "Computer"}
|
||||
@STRING{IEEE_M_CAP = "{IEEE} Comput. Appl. Power"}
|
||||
@STRING{IEEE_M_CGA = "{IEEE} Comput. Graph. Appl."}
|
||||
@STRING{IEEE_M_CONC = "{IEEE} Concurrency"}
|
||||
@STRING{IEEE_M_CS = "{IEEE} Control Syst. Mag."}
|
||||
in 2012 DTC became DT
|
||||
@STRING{IEEE_M_DT = "{IEEE} Des. Test"}
|
||||
@STRING{IEEE_M_DTC = "{IEEE} Des. Test. Comput."}
|
||||
@STRING{IEEE_O_DSO = "{IEEE} Distrib. Syst. Online"}
|
||||
@STRING{IEEE_M_EI = "{IEEE} Electr. Insul. Mag."}
|
||||
@STRING{IEEE_M_ETF = "{IEEE} Electrific. Mag."}
|
||||
@STRING{IEEE_M_EMC = "{IEEE} Electromagn. Compat."}
|
||||
@STRING{IEEE_M_ETR = "{IEEE} ElectroTechnol. Rev."}
|
||||
@STRING{IEEE_M_EMR = "{IEEE} Eng. Manag. Rev."}
|
||||
@STRING{IEEE_M_EMB = "{IEEE} Eng. Med. Biol. Mag."}
|
||||
@STRING{IEEE_M_EXP = "{IEEE} Expert"}
|
||||
@STRING{IEEE_M_GRS = "{IEEE} Geosci. Remote Sens. Mag."}
|
||||
@STRING{IEEE_M_IA = "{IEEE} Ind. Appl. Mag."}
|
||||
@STRING{IEEE_M_IE = "{IEEE} Ind. Electron. Mag."}
|
||||
@STRING{IEEE_M_IM = "{IEEE} Instrum. Meas. Mag."}
|
||||
@STRING{IEEE_M_IS = "{IEEE} Intell. Syst."}
|
||||
@STRING{IEEE_M_ITS = "{IEEE} Intell. Transp. Syst. Mag."}
|
||||
@STRING{IEEE_M_IC = "{IEEE} Internet Comput."}
|
||||
@STRING{IEEE_M_ITP = "{IEEE} {IT} Prof."}
|
||||
@STRING{IEEE_M_MICRO = "{IEEE} Micro"}
|
||||
@STRING{IEEE_M_MW = "{IEEE} Microw. Mag."}
|
||||
@STRING{IEEE_M_MM = "{IEEE} Multimedia"}
|
||||
@STRING{IEEE_M_NANO = "{IEEE} Nanotechnol. Mag."}
|
||||
@STRING{IEEE_M_NET = "{IEEE} Netw."}
|
||||
IEEE's editorial manual lists "Pers. Commun.",
|
||||
but "Personal Commun. Mag." seems to be what is used in the journals
|
||||
@STRING{IEEE_M_PCOM = "{IEEE} Personal Commun. Mag."}
|
||||
@STRING{IEEE_M_PVC = "{IEEE} Pervasive Comput."}
|
||||
@STRING{IEEE_M_POT = "{IEEE} Potentials"}
|
||||
@STRING{IEEE_M_PEL = "{IEEE} Power Electron. Mag."}
|
||||
CAP and PER merged to form PE in 2003
|
||||
@STRING{IEEE_M_PE = "{IEEE} Power Energy Mag."}
|
||||
@STRING{IEEE_M_PER = "{IEEE} Power Eng. Rev."}
|
||||
@STRING{IEEE_M_PULSE = "{IEEE} Pulse"}
|
||||
@STRING{IEEE_M_RA = "{IEEE} Robot. Autom. Mag."}
|
||||
@STRING{IEEE_M_SAP = "{IEEE} Security Privacy"}
|
||||
@STRING{IEEE_M_SP = "{IEEE} Signal Process. Mag."}
|
||||
@STRING{IEEE_M_S = "{IEEE} Softw."}
|
||||
@STRING{IEEE_M_SSC = "{IEEE} Solid-State Circuits Mag."}
|
||||
@STRING{IEEE_M_SPECT = "{IEEE} Spectr."}
|
||||
@STRING{IEEE_M_SMC = "{IEEE} Syst., Man, Cybern. Mag."}
|
||||
@STRING{IEEE_M_TS = "{IEEE} Technol. Soc. Mag."}
|
||||
@STRING{IEEE_M_VT = "{IEEE} Veh. Technol. Mag."}
|
||||
@STRING{IEEE_M_WC = "{IEEE} Wireless Commun."}
|
||||
@STRING{IEEE_M_TODAY = "Today's Engineer"}
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
--
|
||||
EOF
|
||||
2833
latex/cel-thesis/IEEEtranSA_own.bst
Normal file
2833
latex/cel-thesis/IEEEtranSA_own.bst
Normal file
File diff suppressed because it is too large
Load Diff
182
latex/cel-thesis/cel-thesis.cls
Normal file
182
latex/cel-thesis/cel-thesis.cls
Normal file
@ -0,0 +1,182 @@
|
||||
% Author: Johannes Demel
|
||||
% This file requires quite a few texlive packages.
|
||||
% texlive-lang-german / texlive-lang-european
|
||||
% texlive-science
|
||||
|
||||
\NeedsTeXFormat{LaTeX2e}
|
||||
\ProvidesClass{cel-thesis/cel-thesis}
|
||||
\LoadClass[11pt, % 11pt
|
||||
titlepage,
|
||||
twoside, % Doppelseitige Ausgabe
|
||||
a4paper, % DIN A4
|
||||
openright, % Neue Kapitel auf rechter Seite
|
||||
% draft, % Overfull H-Boxen markieren
|
||||
final, % Engueltige Version mit Bildern
|
||||
]{scrreprt}
|
||||
\areaset[8mm]{150mm}{225mm}
|
||||
\RedeclareSectionCommand[
|
||||
beforeskip=0pt,
|
||||
]{chapter}
|
||||
|
||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
% variables
|
||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
% new commands
|
||||
\newcommand{\thesisTitle}[1]{\def \theThesisTitle{#1}}
|
||||
\newcommand{\thesisType}[1]{\def \theThesisType{#1}}
|
||||
\newcommand{\thesisAuthor}[1]{\def \theThesisAuthor{#1}}
|
||||
\newcommand{\thesisAdvisor}[1]{\def \theThesisAdvisor{#1}}
|
||||
\newcommand{\thesisSupervisor}[1]{\def \theThesisSupervisor{#1}}
|
||||
\newcommand{\thesisHeadOfInstitute}[1]{\def \theThesisHeadOfInstitute{#1}}
|
||||
\newcommand{\thesisStartDate}[1]{\def \theThesisStartDate{#1}}
|
||||
\newcommand{\thesisEndDate}[1]{\def \theThesisEndDate{#1}}
|
||||
\newcommand{\thesisSignatureDate}[1]{\def \theThesisSignatureDate{#1}}
|
||||
\newcommand{\thesisLanguage}[1]{\def \theThesisLanguage{#1}}
|
||||
\newcommand{\thesisCC}[1]{\def \theThesisCC{#1}}
|
||||
\newcommand{\thesisPythonWatermark}[1]{\def \theThesisPythonWatermark{#1}}
|
||||
% Defaults
|
||||
\thesisTitle{Random Thesis Title}
|
||||
\thesisType{Master Thesis Type}
|
||||
\thesisAuthor{John Doe}
|
||||
\thesisAdvisor{Dr.-Ing. Holger J\"akel}
|
||||
\thesisHeadOfInstitute{Prof. Dr.-Ing. Laurent Schmalen}
|
||||
\thesisSupervisor{Super-Assi Deluxe M.Sc.}
|
||||
\thesisStartDate{dd.mm.yyyy}
|
||||
\thesisEndDate{dd.mm.yyyy}
|
||||
\thesisSignatureDate{dd.mm.yyyy}
|
||||
\thesisLanguage{english}
|
||||
\thesisCC{FALSE}
|
||||
\thesisPythonWatermark{FALSE}
|
||||
|
||||
\def\dictThesisLanguageGerman{ngerman}
|
||||
\def\dictThesisLanguageEnglish{english}
|
||||
\def\dictThesisFALSE{FALSE}
|
||||
\def\dictThesisTRUE{TRUE}
|
||||
|
||||
|
||||
% General %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
\usepackage[T1]{fontenc} % encoding for target files.
|
||||
\usepackage[utf8]{inputenc} % UTF-8 encoding for source files
|
||||
\usepackage{lmodern}
|
||||
|
||||
\usepackage{microtype}
|
||||
\usepackage[printonlyused]{acronym} % use this package for abbreviations!
|
||||
\def\setlanguage{
|
||||
\usepackage[\theThesisLanguage]{babel}
|
||||
\ifx\theThesisLanguage\dictThesisLanguageEnglish
|
||||
%\bibliographystyle{alpha} % American Style
|
||||
\bibliographystyle{cel-thesis/IEEEtranSA_own} % modified IEEE alpha style that allows underlining of own publications
|
||||
\def\theUniversity{Karlsruhe Institute of Technology}
|
||||
\sisetup{%
|
||||
binary-units = true,
|
||||
output-decimal-marker={.}
|
||||
}
|
||||
\else
|
||||
%\bibliographystyle{alphadin} % DIN norm
|
||||
\bibliographystyle{cel-thesis/IEEEtranSA_own} % modified IEEE alpha style that allows underlining of own publications
|
||||
\def\theUniversity{Karlsruher Institut für Technologie}
|
||||
\sisetup{%
|
||||
binary-units = true,
|
||||
output-decimal-marker={,}
|
||||
}
|
||||
\mathcode`,="013B % avoid space in comma decimal numbers
|
||||
\fi
|
||||
}
|
||||
|
||||
% Math and Symbols %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
\usepackage{amssymb, amsfonts, latexsym}
|
||||
\usepackage{amsmath}
|
||||
\usepackage[right]{eurosym}
|
||||
\usepackage{siunitx}
|
||||
|
||||
% make bibliography appear in table of contents %%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
\usepackage[nottoc]{tocbibind}
|
||||
|
||||
%% Define always missing math symbols.
|
||||
\DeclareMathOperator*{\argmin}{\arg\!\min}
|
||||
\DeclareMathOperator*{\argmax}{\arg\!\max}
|
||||
\DeclareMathOperator\sign{sign}
|
||||
|
||||
|
||||
|
||||
% Graphics %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
% Ueberschriften fett
|
||||
%\setkomafont{sectioning}{\normalcolor\bfseries}
|
||||
% Bild- und Tabellen-Unterschriften formatieren
|
||||
\renewcommand{\caplabelfont}{\bfseries}
|
||||
\renewcommand{\capfont}{\small}
|
||||
\newcommand{\figref}[1]{\figurename~\ref{#1}}
|
||||
|
||||
\usepackage{graphicx}
|
||||
\usepackage{color}
|
||||
\usepackage{pgf, tikz, pgfplots}
|
||||
\usetikzlibrary{shapes,arrows}
|
||||
\pgfplotsset{compat=1.9}
|
||||
|
||||
% Layout %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
\RequirePackage{marginnote}
|
||||
\RequirePackage{ifthen}
|
||||
\RequirePackage[hidelinks, final=true]{hyperref}
|
||||
\RequirePackage[ddmmyyyy]{datetime}
|
||||
\renewcommand{\dateseparator}{.}
|
||||
\RequirePackage[export]{adjustbox}
|
||||
|
||||
|
||||
\setlength{\parskip}{5pt}
|
||||
|
||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
% Create titlepage and optional parts like a CC statement.
|
||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
\newcommand{\header}{%
|
||||
\begin{tabular*}{1.0\linewidth}[c]{lcr}
|
||||
\includegraphics[height=18mm,valign=c]{cel-thesis/logos/kitlogo_de_rgb}%
|
||||
&%
|
||||
\begin{minipage}{8cm}\centering%
|
||||
\textbf{\theUniversity}\\
|
||||
Communications Engineering Lab\\
|
||||
\theThesisHeadOfInstitute%
|
||||
\end{minipage}%
|
||||
&%
|
||||
\includegraphics[height=18mm,valign=c]{cel-thesis/logos/cel_logo}%
|
||||
\end{tabular*}
|
||||
}
|
||||
\newcommand{\ssection}[1]{\vspace*{0.8em}{\textbf{#1}}\\}
|
||||
|
||||
\def\makestatutorydeclaration{
|
||||
\include{cel-thesis/eidesstattliche_erklaerung}
|
||||
}
|
||||
|
||||
\def\maketitle{
|
||||
\hypersetup{
|
||||
pdfauthor = \theThesisAuthor,
|
||||
pdftitle = {\theThesisType{ }\theThesisTitle{ } \theThesisAuthor},
|
||||
pdfsubject = {Institut für Nachrichtentechnik (CEL)},
|
||||
}
|
||||
\thispagestyle{empty}
|
||||
\header % institute banner, etc.
|
||||
\vspace*{5.0cm}%
|
||||
% Title
|
||||
\begin{center}
|
||||
{\Large \textbf{\theThesisTitle}} \\[1cm]
|
||||
{\large \theThesisType} \\[2.5cm]
|
||||
{\textbf{\theThesisAuthor}}\\[5cm]
|
||||
\begin{tabular}{lll}
|
||||
\ifx\theThesisLanguage\dictThesisLanguageEnglish % default is german. But one may use english.
|
||||
Advisor & : & \theThesisAdvisor \\
|
||||
Supervisor & : & \theThesisSupervisor\\[2cm]
|
||||
Start date & : & \theThesisStartDate \\
|
||||
End date & : & \theThesisEndDate \\
|
||||
\else
|
||||
Hauptreferent & : & \theThesisAdvisor \\
|
||||
Betreuer & : & \theThesisSupervisor\\[2cm]
|
||||
Beginn & : & \theThesisStartDate \\
|
||||
Abgabe & : & \theThesisEndDate \\
|
||||
\fi
|
||||
\end{tabular}
|
||||
|
||||
\end{center}
|
||||
\hspace*{\fill}
|
||||
\newpage
|
||||
\makestatutorydeclaration
|
||||
}
|
||||
|
||||
60
latex/cel-thesis/eidesstattliche_erklaerung.tex
Normal file
60
latex/cel-thesis/eidesstattliche_erklaerung.tex
Normal file
@ -0,0 +1,60 @@
|
||||
\ifx\theThesisLanguage\dictThesisLanguageEnglish
|
||||
|
||||
\chapter*{Declaration}
|
||||
|
||||
With this statement I declare that I have independently completed the above
|
||||
master's thesis. The thoughts taken directly or indirectly from external
|
||||
sources are properly marked as such. This thesis was not previously submitted
|
||||
to another academic institution and has also not yet been published.
|
||||
|
||||
\vspace{2cm}
|
||||
\begin{tabbing}
|
||||
\hspace{3em}\= \kill
|
||||
\>Karlsruhe, \theThesisSignatureDate
|
||||
\end{tabbing}
|
||||
|
||||
\vspace{2cm}
|
||||
\begin{tabbing}
|
||||
\hspace{3em}\= \kill
|
||||
\>\theThesisAuthor\\[1ex]
|
||||
%\>Amalienstra{\ss}e 79\\
|
||||
%\>76133 Karlsruhe\\[1ex]
|
||||
\end{tabbing}
|
||||
|
||||
\else
|
||||
|
||||
\chapter*{Erkl{\"a}rung}
|
||||
|
||||
%Ich versichere hiermit, dass ich meine Masterarbeit selbständig und unter Beachtung der Satzung der Universität Karlsruhe (TH) zur Sicherung guter wissenschaftlicher Praxis in der aktuellen Fassung angefertigt habe. Ich habe keine anderen als die angegebenen Quellen und Hilfsmittel benutzt und wörtlich oder inhaltlich übernommene Stellen als solche kenntlich gemacht.
|
||||
|
||||
Ich versichere hiermit,
|
||||
dass ich die vorliegende Arbeit selbstst{\"a}ndig
|
||||
und unter Beachtung der Satzung des Karlsruher Instituts f\"ur Technologie (KIT)
|
||||
zur Sicherung guter wissen\-schaft\-licher Praxis in der aktuellen Fassung angefertigt habe.
|
||||
Ich habe keine anderen als die angegebenen Quellen und Hilfsmittel benutzt und w{\"o}rtlich oder inhaltlich {\"u}bernommene Stellen als solche kenntlich gemacht.
|
||||
|
||||
\vspace{2cm}
|
||||
\begin{tabbing}
|
||||
\hspace{3em}\= \kill
|
||||
\>Karlsruhe, den \theThesisSignatureDate
|
||||
\end{tabbing}
|
||||
|
||||
\vspace{2cm}
|
||||
\begin{tabbing}
|
||||
\hspace{3em}\= \kill
|
||||
\>\theThesisAuthor\\[1ex]
|
||||
%\>Amalienstra{\ss}e 79\\
|
||||
%\>76133 Karlsruhe\\[1ex]
|
||||
\end{tabbing}
|
||||
|
||||
\fi
|
||||
|
||||
\ifx\theThesisCC\dictThesisTRUE
|
||||
\newpage
|
||||
\begin{center}
|
||||
\includegraphics[width=25mm,valign=c]{cel-thesis/logos/cc-by-nc}
|
||||
\end{center}
|
||||
|
||||
\vspace{1cm}
|
||||
This work is licensed under the Creative Commons Attribution-NonCommercial 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc/4.0/.
|
||||
\fi
|
||||
BIN
latex/cel-thesis/logos/cc-by-nc.png
Normal file
BIN
latex/cel-thesis/logos/cc-by-nc.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 17 KiB |
BIN
latex/cel-thesis/logos/cel_logo.pdf
Normal file
BIN
latex/cel-thesis/logos/cel_logo.pdf
Normal file
Binary file not shown.
BIN
latex/cel-thesis/logos/kitlogo_de_rgb.pdf
Normal file
BIN
latex/cel-thesis/logos/kitlogo_de_rgb.pdf
Normal file
Binary file not shown.
BIN
latex/cel-thesis/logos/watermark_thesis.pdf
Normal file
BIN
latex/cel-thesis/logos/watermark_thesis.pdf
Normal file
Binary file not shown.
44
latex/chapters/abstract.tex
Normal file
44
latex/chapters/abstract.tex
Normal file
@ -0,0 +1,44 @@
|
||||
\chapter*{Abstract (Master Theses only)}
|
||||
This is an abstract. It should be about half a page to a page in length.
|
||||
It mostly serves as clarification for what to expect when reading the thesis:
|
||||
What is your topic, what are the most striking results, what's the process of
|
||||
getting these.
|
||||
It is \emph{not} an introduction to the topic (that's what the introduction
|
||||
chapter is for). Now, for a few lines of content:
|
||||
|
||||
Polar codes are the first codes to asymptotically achieve channel capacity with low complexity encoders and decoders.
|
||||
They were first introduced by Erdal Arikan in 2009 \cite{polar:arikan09}.
|
||||
Channel coding has always been a challenging task because it draws a lot of resources, especially in software implementations.
|
||||
Software Radio is getting more prominent because it offers several advantages among which are higher flexibility and better maintainability.
|
||||
Future radio systems are aimed at being run on virtualized servers instead of dedicated hardware in base stations \cite{cloudran:2015}.
|
||||
Polar codes may be a promising candidate for future radio systems if they can be implemented efficiently in software.
|
||||
|
||||
In this thesis the theory behind polar codes and a polar code implementation in GNU Radio is presented.
|
||||
This implementation is then evaluated regarding parameterization options and their impact on error correction performance.
|
||||
The evaluation includes a comparison to state-of-the-art \ac{LDPC} codes.
|
||||
|
||||
\begin{figure}[h]
|
||||
\begin{subfigure}[t]{.49\textwidth}
|
||||
\begin{center}
|
||||
\def\dist{1.5}
|
||||
\def\power{3}
|
||||
\input{figures/polar_nbit_encoder_natural}
|
||||
\caption{8 bit polar encoder}
|
||||
\label{abs:polar_8bit_encoder_natural}
|
||||
\end{center}
|
||||
\end{subfigure}\,%
|
||||
\begin{subfigure}[t]{.49\textwidth}
|
||||
\begin{center}
|
||||
\def\dist{1.5}
|
||||
\def\power{3}
|
||||
\input{figures/polar_nbit_decoder}
|
||||
\caption{8 bit polar decoder}
|
||||
\label{abs:polar_8bit_decoder}
|
||||
\end{center}
|
||||
\end{subfigure}%
|
||||
\caption{Polar code encoding and decoding}
|
||||
\label{abs:encoder-decoder}
|
||||
\end{figure}
|
||||
|
||||
The polar encoder is shown in Fig. \ref{abs:polar_8bit_encoder_natural}.
|
||||
|
||||
10
latex/chapters/conclusion.tex
Normal file
10
latex/chapters/conclusion.tex
Normal file
@ -0,0 +1,10 @@
|
||||
\chapter{Conclusion}\label{chapter:conclusion}
|
||||
So you made it!
|
||||
This is the last part of your thesis.
|
||||
Tell everyone what happened.
|
||||
You did something... and you could show that ... followed.
|
||||
|
||||
In the end make a personal statement.
|
||||
Why would one consider this thesis to be useful?
|
||||
|
||||
|
||||
27
latex/chapters/introduction.tex
Normal file
27
latex/chapters/introduction.tex
Normal file
@ -0,0 +1,27 @@
|
||||
\chapter{Introduction}
|
||||
This is the introductory chapter.
|
||||
It is usually a page or two.
|
||||
Tell a story about the objectives, explain them briefly and outline the structure of your thesis.
|
||||
|
||||
\section{Structuring Your Thesis}
|
||||
|
||||
An example structure would be:
|
||||
\begin{enumerate}
|
||||
\item Introduction
|
||||
\item Theoretical basis
|
||||
\item Your work
|
||||
\item Measurement results
|
||||
\item Conclusion
|
||||
\end{enumerate}
|
||||
|
||||
This is just an example, choose a structure that fits the nature of your work.
|
||||
|
||||
\section{References}
|
||||
Citing references is always good. Plagiarizing, however, is strictly forbidden!
|
||||
|
||||
\section{Images}
|
||||
If possible use vector graphics. Only use pixel graphics for photos. TikZ is also an interesting option for creating all sorts of images.
|
||||
|
||||
And don't forget \SI{10.0815}{\giga\byte} of data is quite a lot.
|
||||
This is an example how to use the siunitx package.
|
||||
|
||||
139
latex/chapters/systemmodel.tex
Normal file
139
latex/chapters/systemmodel.tex
Normal file
@ -0,0 +1,139 @@
|
||||
\acresetall
|
||||
% This is an example chapter from 'Polar Codes for Software Radio'. Do not use it but delete it! It serves as an example!
|
||||
% Titles should be in title case (https://en.wikipedia.org/wiki/Title_case)
|
||||
\chapter{An Example Chapter}\label{chapter:systemmodel}
|
||||
Polar codes are defined for a specific system model.
|
||||
The objective of this chapter is to introduce the key concepts.
|
||||
Notations are introduced and important terms are revisited in order to refer to them.
|
||||
|
||||
\section{Key Channel Coding Concepts}
|
||||
The system model used throughout this thesis follows the remarks in~\cite{Richardson:2008:MCT} and~\cite{polar:arikan09}.
|
||||
It is intended to define the domain for which polar codes are developed.
|
||||
|
||||
The objective of channel coding is to transmit information from a source to a sink over a point-to-point connection with as few errors as possible.
|
||||
A source wants to transmit binary data $u \in \mathcal{U} = \{0, 1\}$ to a sink where $u$ represents one draw of a binary uniformly distributed random variable.
|
||||
The source symbols are encoded, transmitted over a channel and decoded afterwards in order to pass an estimate $\hat{u}$ to a sink.
|
||||
|
||||
This thesis uses a common notation for vectors which is introduced here shortly.
|
||||
A variable $x$ may assume any value in an alphabet $\mathcal{X}$, i.e. $x \in \mathcal{X}$.
|
||||
Multiple variables are combined into a (row) vector $\bm{x}^n = (x_0, \ldots x_{n-1})$ of size $n$ with $\bm{x}^n \in \mathcal{X}^n$.
|
||||
A subvector of $\bm{x}^n$ is denoted $\bm{x}_i^j = (x_i, \ldots x_{j-1})$ where $0 \leq i \leq j \leq n$.
|
||||
A vector where $i=j$ is an empty vector.
|
||||
A vector $\bm{x}^n$ ($n$ even) may be split into even and odd subvectors which are denoted $\bm{x}_{0,\mathrm{e}}^{n} = (x_0, x_2, \ldots x_{n-2})$, $\bm{x}_{0,\mathrm{o}}^{n} = (x_1, x_3, \ldots x_{n-1})$.
|
||||
This numbering convention is in accordance with~\cite{dijkstra:zerocounting}, where the author makes a strong point for this exact notation and some papers on polar codes follow it too, e.g.~\cite{polar:talvardy:howtoCC}.
|
||||
|
||||
|
||||
\subsection{Encoder}
|
||||
The encoder takes a frame $\bm{u}^k$ and maps it to a binary codeword $\bm{x}^n$, where $k$ and $n$ denote the vector sizes of a frame and a codeword respectively with $\bm{k} \leq n$.
|
||||
An ensemble of all valid codewords for an encoder is a code $\mathcal{C}$.
|
||||
It should be noted that $|\mathcal{C}| = |\mathcal{X}^n|$ must hold in order for the code to be able to represent every possible frame.
|
||||
|
||||
Not all possible symbols from $\mathcal{X}^n$ are used for transmission.
|
||||
The difference between all $2^n$ possible codewords and the $2^k$ used codewords is called redundancy.
|
||||
With those two values, the code rate is defined as $r = \frac{k}{n}$.
|
||||
It is a measure of efficient channel usage.
|
||||
|
||||
The encoder is assumed to be linear and to perform a one-to-one mapping of frames to codewords.
|
||||
A code is linear if $\alpha \bm{x} + \alpha^\prime \bm{x}^\prime \in \mathcal{C}$ for $\forall \bm{x}, \bm{x}^\prime \in \mathcal{C}$ and $\forall \alpha, \alpha^\prime \in \mathbb{F}$ hold.
|
||||
It should be noted that all operations are done over the Galois field GF(2) or $\mathbb{F} = \{0, 1\}$ unless stated otherwise.
|
||||
Then the expression can be simplified to
|
||||
\begin{equation}
|
||||
\bm{x} + \bm{x}^\prime \in \mathcal{C} \quad \textrm{for} \quad \forall \bm{x}, \bm{x}^\prime \in \mathcal{C}.
|
||||
\end{equation}
|
||||
A linear combination of two codewords must yield a codeword again.
|
||||
|
||||
For linear codes it is possible to find a generator matrix $\bm{G} \in \mathbb{F}^{k \times n}$ and obtain a codeword from a frame with $\bm{x}^n = \bm{u}^k \bm{G}^{k \times n}$.
|
||||
All linear codes can be transformed into systematic form with $\bm{G} = (\bm{I}_k\ \bm{P})$. Therein, $\bm{I}_k$ is the identity matrix of size $k \times k$.
|
||||
If $\bm{G}$ is systematic, all elements of a frame $\bm{u}^k$ are also elements of the codeword $\bm{x}^n$.
|
||||
Also, a parity check matrix $\bm{H} = (-\bm{P}^\top\ \bm{I}_{n-k})$ of size $\dim\bm{H} = (n-k) \times n$ can be obtained from the systematic $\bm{G}$.
|
||||
The parity check matrix can be used to define the code, as $\bm{H} \bm{x}^\top = \bm{0}^\top$, $\forall \bm{x} \in \mathcal{C}$.
|
||||
Thus, a parity check matrix can be used to verify correct codeword reception and furthermore error correction may be performed.
|
||||
|
||||
A code can be characterized by the minimum distance between any two codewords.
|
||||
In order to obtain this value we use the Hamming distance.
|
||||
This distance $d(\bm{v}^n,\bm{x}^n)$ equals the number of positions in $\bm{v}^n$ that differ from $\bm{x}^n$.
|
||||
The minimum distance of a code is than defined by $d(\mathcal{C}) = \min\{d(\bm{x},\bm{v}): \bm{x},\bm{v} \in \mathcal{C}, \bm{x} \neq \bm{v}\}$.
|
||||
For linear codes, the minimum distance computation can be simplified by comparing all codewords to the zero codeword $d(\mathcal{C}) = \min\{d(\bm{x},0): \bm{x} \in \mathcal{C}, \bm{x} \neq \bm{0}\}$.
|
||||
|
||||
\subsection{Channel Model}\label{sec:channel_model}
|
||||
Channel coding relies on a generic channel model.
|
||||
Its input is $x \in \mathcal{X}$ and its distorted output is $y \in \mathcal{Y}$.
|
||||
A channel is denoted by $W: \mathcal{X} \rightarrow \mathcal{Y}$ along with its transition probability $W(y|x), x \in \mathcal{X}, y \in \mathcal{Y}$.
|
||||
A \ac{DMC} does not have memory, thus every symbol transmission is independent from any other.
|
||||
Combined with a binary input alphabet it is called a \ac{BDMC}.
|
||||
For a symmetric channel, $P(y|1) = P(-y|-1)$ must hold for an output alphabet $y \in \mathcal{Y}, \mathcal{Y} \subset \mathbb{R}$~\cite{Richardson:2008:MCT}.
|
||||
Assuming symmetry for a \ac{BDMC} leads to a symmetric \ac{BDMC}.
|
||||
In Sec.~\ref{theory:channels}, several examples of such channels are discussed.
|
||||
|
||||
This channel concept may be extended to vector channels.
|
||||
A vector channel $W^n$ corresponds to $n$ independent uses of a channel $W$ which is denoted as $W^n : \mathcal{X}^n \rightarrow \mathcal{Y}^n$.
|
||||
Also, vector transition probabilities are denoted $W^n(\bm{y}^n|\bm{x}^n) = \prod_{i=0}^{n-1} W(y_i|x_i)$.
|
||||
|
||||
\subsection{Decoder}
|
||||
A decoder receives a possibly erroneous codeword $\bm{y}$ and checks its validity by asserting $\bm{H} \bm{y}^\top = \bm{0}^\top$, thus performing error detection.
|
||||
A more sophisticated decoder tries to correct errors by using redundant information transmitted in a codeword.
|
||||
An optimal decoder strategy is to maximize the \emph{a posteriori} probability.
|
||||
Given the probability of each codeword $P(\bm{x})$ and the channel transition probability $P(\bm{y}|\bm{x})$, the task at hand is to find the most likely transmitted codeword $\bm{x}$ under the observation $\bm{y}$, $P(\bm{x}|\bm{y})$.
|
||||
This is denoted
|
||||
\begin{equation}
|
||||
\hat{\bm{x}}^{\text{MAP}} = \argmax_{\bm{x} \in \mathcal{C}} P(\bm{x}|\bm{y}) \stackrel{(i)}{=} \argmax_{\bm{x} \in \mathcal{C}} P(\bm{y}|\bm{x}) \frac{P(\bm{x})}{P(\bm{y})} \stackrel{(ii)}{=} \argmax_{\bm{x} \in \mathcal{C}} P(\bm{y}|\bm{x}) P(\bm{x})
|
||||
\end{equation}
|
||||
where we have used Bayes' rule in $(i)$ and the simplification in $(ii)$ is due to the fact that $P(\bm{y})$ is constant and does not change when varying $\bm{x}$.
|
||||
|
||||
Assume that every codeword is transmitted with identical probability $P(\bm{x}) = P(\bm{v})$, $\forall \bm{x}, \bm{v} \in \mathcal{C}$.
|
||||
This simplifies the equation and yields the \ac{ML} decoder
|
||||
\begin{equation}
|
||||
\hat{\bm{x}}^{\text{ML}} = \argmax_{\bm{x} \in \mathcal{C}} P(\bm{y}|\bm{x})
|
||||
\end{equation}
|
||||
which estimates the most likely codeword to be transmitted given a received possibly erroneous codeword~\cite{Richardson:2008:MCT}.
|
||||
In conclusion, the task at hand is to find a code which inserts redundancy intelligently, so a decoder can use this information to detect and correct transmission errors.
|
||||
|
||||
\subsection{Asymptotically Good Codes}\label{theory:repetition_code}
|
||||
A repetition code is a very simple code which helps clarify certain key concepts in the channel coding domain.
|
||||
Assume that the encoder and decoder use a repetition code.
|
||||
For example, a repetition code with $k=1$ and $n = 3$ has two codewords $\mathcal{C} = \{(0,0,0), (1,1,1)\}$.
|
||||
Thus in this example $r=\frac{1}{3}$.
|
||||
We can also obtain its generator and parity check matrices as
|
||||
\begin{equation}
|
||||
\bm{G} = \begin{pmatrix} 1 & 1 & 1 \end{pmatrix},\qquad \bm{H} = \begin{pmatrix} 1 & 1 & 0 \\ 1 & 0 & 1 \end{pmatrix}\,.
|
||||
\end{equation}
|
||||
The parity check matrix $\bm{H}$ can be used to detect if a transmission error occurred by verifying if $\bm{H} \bm{x}^\top = \bm{0}^\top$.
|
||||
In the case where an error occurred, an \ac{ML} decoder for a \ac{BSC} carries out a majority decision to estimate the most likely codeword.
|
||||
|
||||
Repetition codes shed light on a problem common to a lot of codes.
|
||||
If the reliability of a code needs to be improved, it comes at the expense of a lower code rate.
|
||||
Increasing $n$ comes at the expense of decreasing $r = \frac{1}{n}$ because $k=1$ for all repetition codes.
|
||||
Thus for a very reliable repetition code has a vanishing rate as $\lim_{n \to \infty} r = 0$.
|
||||
|
||||
The above results leads to the definition of asymptotically good codes $\mathcal{C}(n_s, k_s, d_s)$ \cite{Friedrichs:2010:error-control-coding}.
|
||||
Two properties must hold for this class of codes:
|
||||
\begin{equation}
|
||||
R = \lim_{s \to \infty} \frac{k_s}{n_s} > 0 \quad \textrm{and} \quad \lim_{s \to \infty} \frac{d_s}{n_s} > 0.
|
||||
\end{equation}
|
||||
The code rate must be positive ($>0$) for all codes. Repetition codes do not satisfy this property, for example. Furthermore, the distance between codewords must grow proportionally to the code block size $n$.
|
||||
|
||||
\section{Channels}\label{theory:channels}
|
||||
Several common channel models exist to describe the characteristics of a physical transmission.
|
||||
Common properties were discussed in Sec.~\ref{sec:channel_model} whereas in this section, the differences are targeted.
|
||||
The three most important channel models for polar codes are presented, namely the \ac{BSC}, the \ac{BEC} and the \ac{AWGN} channel.
|
||||
|
||||
\subsection{AWGN Channel}
|
||||
An \ac{AWGN} channel as used in this thesis has a binary input alphabet and a continuous output alphabet $\mathcal{Y} = \mathbb{R}$.
|
||||
Each input symbol is affected by Gaussian noise to yield an output symbol.
|
||||
|
||||
\subsection{Capacity and Reliability}
|
||||
Channels are often characterized by two important measures: their capacity and their reliability.
|
||||
These measures are introduced in this section. The channel capacity for symmetric \acp{BDMC} with input alphabet $\mathcal{X} = \{0,1\}$ can be calculated by
|
||||
\begin{equation}
|
||||
I(W) = \frac{1}{2} \sum_{y \in \mathcal{Y}} \sum_{x \in \mathcal{X}} W(y|x) \log_2 \frac{W(y|x)}{\frac{1}{2} (W(y|0) + W(y|1))},
|
||||
\end{equation}
|
||||
where we assume equiprobable channel input symbols $P(X=0) = P(X=1) = \frac{1}{2}$, which is the capacity-achieving input distribution for symmetric \acp{BDMC}.
|
||||
The capacity defines the highest rate at which a reliable transmission (i.e., with a vanishing error probability after decoding) over a channel $W$ can be realized.
|
||||
It is also called the Shannon capacity~\cite{sha49} for symmetric channels.
|
||||
|
||||
The Bhattacharyya parameter
|
||||
\begin{equation}
|
||||
Z(W) = \sum_{y \in \mathcal{Y}} \sqrt{W(y|0) W(y|1)}
|
||||
\end{equation}
|
||||
is used to quantify a channel's reliability where a lower value for $Z(W)$ indicates higher reliability.
|
||||
Also, an upper \ac{ML} decision error bound is given by $Z(W)$~\cite{polar:arikan09}.
|
||||
54
latex/figures/polar_nbit_decoder.tex
Normal file
54
latex/figures/polar_nbit_decoder.tex
Normal file
@ -0,0 +1,54 @@
|
||||
\begin{tikzpicture}[node distance = 1.5cm, auto]
|
||||
% \def\dist{1.5}
|
||||
% \def\power{4}
|
||||
\pgfmathparse{\power-1}
|
||||
\newcount\powerleq
|
||||
\let\powerleq\pgfmathresult
|
||||
\pgfmathparse{int(2^\power)}
|
||||
\newcount\blocksize
|
||||
\let\blocksize\pgfmathresult
|
||||
\pgfmathparse{\blocksize-1}
|
||||
\newcount\blockleq
|
||||
\let\blockleq\pgfmathresult
|
||||
|
||||
\foreach \j in {0,...,\powerleq}{
|
||||
\pgfmathparse{int(-1*\j-1)}
|
||||
\let\srow\pgfmathresult
|
||||
|
||||
\pgfmathparse{int(-1*\j)}
|
||||
\let\drow\pgfmathresult
|
||||
|
||||
\pgfmathparse{int(2^(\j+1))}
|
||||
\let\ccsize\pgfmathresult
|
||||
|
||||
\pgfmathparse{int(\ccsize/2)}
|
||||
\let\cchalf\pgfmathresult
|
||||
|
||||
\foreach \i in {0,...,\blockleq}{
|
||||
\pgfmathparse{int(mod(\i,\ccsize))}
|
||||
\let\n\pgfmathresult
|
||||
|
||||
|
||||
\ifnum\n<\cchalf
|
||||
\path (\dist*\drow, \i) edge [dashed] (\dist*\srow, \i+\n);
|
||||
\path (\dist*\drow, \i) edge [dashed] (\dist*\srow, \i+\n+1);
|
||||
\else
|
||||
\pgfmathparse{int(\ccsize * int(\i / \ccsize)) + int(mod(2* (\i + \cchalf), \ccsize) )}
|
||||
\let\jumpsize\pgfmathresult
|
||||
\path (\dist*\drow, \i) edge (\dist*\srow, \jumpsize);
|
||||
\path (\dist*\drow, \i) edge (\dist*\srow, \jumpsize+1);
|
||||
\fi
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
\foreach \i in {0,...,\blockleq}{
|
||||
\node[draw=none] at (-0.3-\dist*\power, \blockleq-\i) {$y_{\i}$};
|
||||
\node[draw=none] at (0.3, \blockleq-\i) {$\hat{u}_{\i}$};
|
||||
}
|
||||
|
||||
\foreach \i in {0,...,\power}{
|
||||
\node[draw=none] at (-1*\dist*\power+\dist*\i, \blocksize-0.5) {$S_{\i}$};
|
||||
}
|
||||
|
||||
\end{tikzpicture}
|
||||
48
latex/figures/polar_nbit_encoder_natural.tex
Normal file
48
latex/figures/polar_nbit_encoder_natural.tex
Normal file
@ -0,0 +1,48 @@
|
||||
\usetikzlibrary[topaths, calc]
|
||||
|
||||
\begin{tikzpicture}[transform shape]
|
||||
% \def\dist{1.5}
|
||||
% \def\power{3}
|
||||
\pgfmathparse{\power-1}
|
||||
\newcount\powerleq
|
||||
\let\powerleq\pgfmathresult
|
||||
\pgfmathparse{int(2^\power)}
|
||||
\newcount\blocksize
|
||||
\let\blocksize\pgfmathresult
|
||||
\pgfmathparse{\blocksize-1}
|
||||
\newcount\blockleq
|
||||
\let\blockleq\pgfmathresult
|
||||
|
||||
|
||||
\foreach \j in {0,...,\powerleq}{
|
||||
\pgfmathparse{int(\j+1)}
|
||||
\let\drow\pgfmathresult
|
||||
|
||||
\pgfmathparse{int(2^(\j+1))}
|
||||
\let\ccsize\pgfmathresult
|
||||
|
||||
\pgfmathparse{int(\ccsize/2)}
|
||||
\let\cchalf\pgfmathresult
|
||||
|
||||
\foreach \i in {0,...,\blockleq}{
|
||||
\pgfmathparse{int(mod(\i,2))}
|
||||
\let\n\pgfmathresult
|
||||
|
||||
\pgfmathparse{int(\ccsize * int(\i / \ccsize))}
|
||||
\let\dblock\pgfmathresult
|
||||
|
||||
\pgfmathparse{\dblock + int(mod(\i, \ccsize) / 2) + \cchalf}%(\ccsize * int(\i / \ccsize)) + int(mod(2* (\i + \cchalf), \ccsize)) + 1}
|
||||
\let\dest\pgfmathresult
|
||||
\path (\dist*\j, \i) edge (\dist*\drow, \dest);
|
||||
\ifnum\n=0
|
||||
\path (\dist*\j, \i) edge [dashed] (\dist*\drow, \dest-\cchalf);
|
||||
\fi
|
||||
}
|
||||
}
|
||||
|
||||
\foreach \i in {0,...,\blockleq}{
|
||||
\node[draw=none] at (-0.3, \blockleq-\i) {$u_{\i}$};
|
||||
\node[draw=none] at (\dist*\power+0.3, \blockleq-\i) {$x_{\i}$};
|
||||
}
|
||||
|
||||
\end{tikzpicture}
|
||||
@ -1,54 +0,0 @@
|
||||
%
|
||||
% Default template copied from Overleaf
|
||||
%
|
||||
|
||||
|
||||
%--------------------
|
||||
% Packages
|
||||
% -------------------
|
||||
\documentclass[11pt,a4paper]{article}
|
||||
\usepackage[utf8x]{inputenc}
|
||||
\usepackage[T1]{fontenc}
|
||||
%\usepackage{gentium}
|
||||
\usepackage{mathptmx} % Use Times Font
|
||||
|
||||
|
||||
\usepackage[pdftex]{graphicx} % Required for including pictures
|
||||
\usepackage[swedish]{babel} % Swedish translations
|
||||
\usepackage[pdftex,linkcolor=black,pdfborder={0 0 0}]{hyperref} % Format links for pdf
|
||||
\usepackage{calc} % To reset the counter in the document after title page
|
||||
\usepackage{enumitem} % Includes lists
|
||||
|
||||
\frenchspacing % No double spacing between sentences
|
||||
\linespread{1.2} % Set linespace
|
||||
\usepackage[a4paper, lmargin=0.1666\paperwidth, rmargin=0.1666\paperwidth, tmargin=0.1111\paperheight, bmargin=0.1111\paperheight]{geometry} %margins
|
||||
%\usepackage{parskip}
|
||||
|
||||
\usepackage[all]{nowidow} % Tries to remove widows
|
||||
\usepackage[protrusion=true,expansion=true]{microtype} % Improves typography, load after fontpackage is selected
|
||||
|
||||
\usepackage{lipsum} % Used for inserting dummy 'Lorem ipsum' text into the template
|
||||
|
||||
|
||||
%-----------------------
|
||||
% Set pdf information and add title, fill in the fields
|
||||
%-----------------------
|
||||
\hypersetup{
|
||||
pdfsubject = {},
|
||||
pdftitle = {},
|
||||
pdfauthor = {}
|
||||
}
|
||||
|
||||
%-----------------------
|
||||
% Begin document
|
||||
%-----------------------
|
||||
\begin{document} %All text i dokumentet hamnar mellan dessa taggar, allt ovanför är formatering av dokumentet
|
||||
|
||||
\section{Introduction}
|
||||
|
||||
\lipsum[1-3]
|
||||
|
||||
|
||||
\subsection*{Subtitle}
|
||||
\lipsum[4-5]
|
||||
\end{document}
|
||||
64
latex/thesis-master.tex
Normal file
64
latex/thesis-master.tex
Normal file
@ -0,0 +1,64 @@
|
||||
% Template author: Johannes Demel
|
||||
% Document class provides standardized title page + needed extras.
|
||||
\documentclass{cel-thesis/cel-thesis}
|
||||
\thesisTitle{Write my thesis}
|
||||
\thesisType{Example Template}
|
||||
\thesisAuthor{John Doe}
|
||||
%\thesisAdvisor{Prof. Dr.-Ing. Laurent Schmalen}
|
||||
%\thesisHeadOfInstitute{Prof. Dr.-Ing. Laurent Schmalen}
|
||||
\thesisSupervisor{Name of assistant}
|
||||
\thesisStartDate{Start date}
|
||||
\thesisEndDate{End date}
|
||||
\thesisSignatureDate{Signature date}
|
||||
\thesisLanguage{english} % english or ngerman
|
||||
\thesisCC{FALSE}
|
||||
\thesisPythonWatermark{FALSE}
|
||||
|
||||
|
||||
%%% LANGUAGE SETTINGS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
% additional Hyphenation rules
|
||||
\hyphenation{non-para-metric repro-gra-mmable}
|
||||
% Settings for bibliography
|
||||
\usepackage{babelbib}
|
||||
\setlanguage % set correct language as selected above
|
||||
|
||||
%%% PACKAGES %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
% Add all the packages you feel like you need them.
|
||||
% You'll need it.
|
||||
% automatically expand/abbreviate terms.
|
||||
\usepackage{caption}
|
||||
\usepackage{bm}
|
||||
\usepackage{subcaption}
|
||||
\usepackage{todonotes} % great for draft annotations
|
||||
\DeclareCaptionLabelFormat{bf-nodot}{\textbf{#1}~\textbf{#2}}
|
||||
\captionsetup{labelformat=bf-nodot,labelsep=colon}
|
||||
|
||||
%%% DEFINITIONS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
%% pretty C++ print.
|
||||
\def\CC{{C\nolinebreak[4]\hspace{-.05em}\raisebox{.4ex}{\tiny\textbf{++}}}}
|
||||
|
||||
\begin{document}
|
||||
\pagenumbering{roman} % all the preliminaries should be counted roman style
|
||||
\maketitle
|
||||
%% preliminaries
|
||||
\include{chapters/abstract} % a MUST, few pages abstract
|
||||
|
||||
%% main document
|
||||
\cleardoublepage
|
||||
\pagenumbering{arabic} % now old school arabic enumerated pages.
|
||||
\tableofcontents % a MUST
|
||||
\cleardoublepage % make sure multipage TOCs are numbered correctly.
|
||||
\include{chapters/introduction} % include chapter introduction.tex
|
||||
\include{chapters/systemmodel} % an example chapter
|
||||
\include{chapters/conclusion} % everything ends with a summary!
|
||||
|
||||
|
||||
%% Appendix
|
||||
\appendix
|
||||
% \listoffigures % if you want, not usual
|
||||
% \listoftables % if you want, not usual
|
||||
\include{abbreviations} % use the acronym package. Already include with the template.d
|
||||
\bibliography{cel-thesis/IEEEabrv,bibliography} % include bibliography.bib and with formating etc.
|
||||
|
||||
|
||||
\end{document}
|
||||
Loading…
Reference in New Issue
Block a user