-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathliterature.bib
executable file
·422 lines (384 loc) · 16.6 KB
/
literature.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
%Journal, transaction, magazine article
\nocite{*}
\bibliographystyle{unsrt}
@ARTICLE{Arikan,
author={E. Arikan},
title={Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels},
year={2009},
volume={55},
number={7},
journal={{IEEE} Trans. Inf. Theory},
pages={3051-3073},
keywords={binary codes;channel capacity;channel coding;decoding;memoryless systems;probability;channel polarization;symmetric binary-input memoryless channel;code sequence;channel capacity;probability;channel coding;polar codes;successive cancellation decoding algorithm;Polarization;Memoryless systems;Decoding;Capacity planning;Channel capacity;Channel coding;Noise cancellation;Codes;Councils;Information theory;Capacity-achieving codes;channel capacity;channel polarization;Plotkin construction;polar codes;Reed– Muller (RM) codes;successive cancellation decoding},
doi={10.1109/TIT.2009.2021379},
ISSN={0018-9448},
month={July},
}
@ARTICLE{SCL,
author={I. Tal and A. Vardy},
journal={{IEEE} Trans. Inf. Theory},
title={List Decoding of Polar Codes},
year={2015},
volume={61},
number={5},
pages={2213-2226},
keywords={cyclic redundancy check codes;maximum likelihood decoding;parity check codes;precoding;list decoding;polar codes;successive-cancellation list decoder;decoding path;decoding stage;integer parameter;decoding process;codeword;decoder output;maximum-likelihood decoding;LDPC codes;CRC precoding;specific list-decoding algorithm;information bit;pruning procedure;stark contrast;algorithmic transformations;Maximum likelihood decoding;Arrays;Complexity theory;Parity check codes;Vectors;Bit error rate;List decoding;polar codes;successive cancellation decoding;List decoding;polar codes;successive cancellation decoding},
doi={10.1109/TIT.2015.2410251},
ISSN={0018-9448},
month={May},
}
%Book
@Book{Cover,
author = {T.~Cover and J.~Thomas},
title = {Elements of Information Theory},
publisher = {John Wiley \& Sons},
year = {1991},
series = {Wiley series in telecommunications},
address = {New York}
}
%Book
@Book{Hennessy,
author = {John L.~Hennessy and David A.~Patterson},
title = {Computer Architecture: A Quantitative Approach},
publisher = {Morgan Kaufmann},
year = {2011},
series = {The Morgan Kaufmann Series in Computer Architecture and Design},
address = {Burlington, Massachusetts}
}
%Book
@Book{CLRS,
author = { {Thomas H.~Cormen, Charles E.~Leiserson, Ronald L.~Rivest and Clifford Stein}},
title = {Introduction to Algorithms },
publisher = {The MIT Press},
year = {2009},
address = {Cambridge, Massachusetts}
}
@ARTICLE{DesignOfPolarCodes5G,
author = {{Bioglio}, V. and {Condo}, C. and {Land}, I.},
title = "{Design of Polar Codes in 5G New Radio}",
journal = {ArXiv e-prints},
archivePrefix = "arXiv",
eprint = {1804.04389},
primaryClass = "cs.IT",
keywords = {Computer Science - Information Theory},
year = 2018,
month = apr,
adsurl = {http://adsabs.harvard.edu/abs/2018arXiv180404389B},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@ARTICLE{PolarCodesPrimaryConcepts,
author={K. Niu and K. Chen and J. Lin and Q. T. Zhang},
journal={{IEEE} Commun. Mag.},
title={Polar codes: Primary concepts and practical decoding algorithms},
year={2014},
volume={52},
number={7},
pages={192-203},
keywords={channel coding;decoding;error correction codes;parity check codes;turbo codes;polar codes;decoding algorithms;error-correcting codes;discrete memoryless channel;decoding techniques;capacity-approaching coding strategy;channel polarization;polar encoding;SC algorithm;SC decoding technique;SC decoding;CRC codes;LDPC codes;turbo codes;Decoding;Channel coding;Polar codes;Error probability;Channel capacity},
doi={10.1109/MCOM.2014.6852102},
ISSN={0163-6804},
month={July},
}
@ARTICLE{fastSSC,
author={M. Hanif and M. Ardakani},
journal={{IEEE} Commun. Lett.},
title={Fast Successive-Cancellation Decoding of Polar Codes: Identification and Decoding of New Nodes},
year={2017},
volume={21},
number={11},
pages={2360-2363},
keywords={Maximum likelihood decoding;Systematics;Indexes;Corporate acquisitions;Block codes;Polar codes;maximum a posteriori;maximum likelihood;systematic codes;non-systematic codes},
doi={10.1109/LCOMM.2017.2740305},
ISSN={1089-7798},
month={Nov},
}
@ARTICLE{SSC,
author={A. Alamdar-Yazdi and F. R. Kschischang},
journal={{IEEE} Commun. Lett.},
title={A Simplified Successive-Cancellation Decoder for Polar Codes},
year={2011},
volume={15},
number={12},
pages={1378-1380},
keywords={channel coding;error statistics;parity check codes;source coding;successive cancellation decoder;polar codes;local decoders;constituent codes;block error rate;bit error rate;Decoding;Complexity theory;Vectors;Echo cancellers;Source coding;Generators;Polar codes;successive-cancellation decoding},
doi={10.1109/LCOMM.2011.101811.111480},
ISSN={1089-7798},
month={December},
}
@ARTICLE{LLCSCLD,
author={A. Balatsoukas-Stimming and M. B. Parizi and A. Burg},
journal={{IEEE} Trans. Signal Process.},
title={LLR-Based Successive Cancellation List Decoding of Polar Codes},
year={2015},
volume={63},
number={19},
pages={5165-5179},
keywords={concatenated codes;cyclic redundancy check codes;error statistics;statistical analysis;LLR-based successive cancellation list decoding;numerical stability;log-likelihood ratio based formulation;sorting step;metric sorter;CRC-aided successive cancellation list decoder;concatenated polar codes;block-error probability;Decoding;Hardware;Signal processing algorithms;Throughput;Receivers;Sorting;Indexes;CRC-aided successive cancellation list decoder;hardware implementation;polar codes;successive cancellation decoder;successive cancellation list decoder},
doi={10.1109/TSP.2015.2439211},
ISSN={1053-587X},
month={Oct},
}
@ARTICLE{increaseTpPolarDec,
author={G. Sarkis and W. J. Gross},
journal={{IEEE} Commun. Lett.},
title={Increasing the Throughput of Polar Decoders},
year={2013},
volume={17},
number={4},
pages={725-728},
keywords={decoding;error correction;polar decoder;successive-cancellation decoding algorithm;error-correction performance;Throughput;Maximum likelihood decoding;Vectors;Standards;Complexity theory;Clocks;Polar codes;latency;throughput;simplified successive-cancellation decoding},
doi={10.1109/LCOMM.2013.021213.121633},
ISSN={1089-7798},
month={April},
}
@ARTICLE{multiGbpsSoftwareDec,
author={B. Le Gal and C. Leroux and C. Jego},
journal={{IEEE} Trans. Signal Process.},
title={Multi-Gb/s Software Decoding of Polar Codes},
year={2015},
volume={63},
number={2},
pages={349-359},
keywords={decoding;optimisation;multiGb/s software decoding;polar codes;successive cancellation decoder;SC decoder;parallel software polar decoder;x86 processor target;processor architectures;memory reduction techniques;algorithmic simplifications;low level optimizations;explicit assembly description;data packing;code length;code rate;selected target;SIMD mode;multithreading mode;energy per decoded bit;software polar decoders;AVX mode;Decoding;Software;Signal processing algorithms;Throughput;Vectors;Optimization;Systematics;Polar codes;SIMD;software optimizations;successive cancellation decoding;x86 processor},
doi={10.1109/TSP.2014.2371781},
ISSN={1053-587X},
month={Jan},
}
@ARTICLE{fastPolarDecodersAlgoImpl,
author={G. Sarkis and P. Giard and A. Vardy and C. Thibeault and W. J. Gross},
journal={{IEEE} J. Sel. Areas Commun.},
title={Fast Polar Decoders: Algorithm and Implementation},
year={2014},
volume={32},
number={5},
pages={946-957},
keywords={block codes;decoding;error correction codes;field programmable gate arrays;linear codes;fast polar decoders;polar codes;symmetric memoryless channel capacity;polar decoding hardware throughput;successive-cancellation decoders;FPGA implementation;flexible polar decoder;gigabit-per-second polar decoder;Parity check codes;Maximum likelihood decoding;Throughput;Complexity theory;Reliability;Systematics;polar codes;successive-cancellation decoding;storage systems},
doi={10.1109/JSAC.2014.140514},
ISSN={0733-8716},
month={May},
}
@techreport{3gpp.38.212,
author = {3GPP},
institution = {{3rd Generation Partnership Project (3GPP)}},
month = {April},
note = {Version 15.1.1},
number = {38.212},
title = {{Technical Specification Group Radio Access Network; NR; Multiplexing and channel coding}},
type = {Technical Specification (TS)},
url = {http://www.3gpp.org/ftp/Specs/archive/38_series/38.212/},
year = {2018}
}
@techreport{3gpp.38.211,
author = {3GPP},
institution = {{3rd Generation Partnership Project (3GPP)}},
month = {April},
note = {Version 15.1.0},
number = {38.211},
title = {{Technical Specification Group Radio Access Network; NR; Physical channels and modulation}},
type = {Technical Specification (TS)},
url = {http://www.3gpp.org/ftp/Specs/archive/38_series/38.211/},
year = {2018}
}
@techreport{3gpp.TSG-RAN_WG1,
author = {Qualcomm},
institution = {{3rd Generation Partnership Project (3GPP)}},
month = {May},
note = {Meeting 89},
number = {7.1.4.2.1.3},
title = {{Interleaver design for Polar Codes}},
type = {Discussion/Decision},
year = {2017}
}
@article{Sarwate:1988:CCR:63030.63037,
author = {Sarwate, D. V.},
title = {Computation of Cyclic Redundancy Checks via Table Look-up},
journal = {Commun. ACM},
issue_date = {Aug. 1988},
volume = {31},
number = {8},
month = aug,
year = {1988},
issn = {0001-0782},
pages = {1008--1013},
numpages = {6},
url = {http://doi.acm.org/10.1145/63030.63037},
doi = {10.1145/63030.63037},
acmid = {63037},
publisher = {ACM},
address = {New York, NY, USA},
}
@Electronic{naiveCRCCalculation,
author = {Wikipedia},
title = {Cyclic redundancy check},
url = {https://en.wikipedia.org/wiki/Cyclic_redundancy_check}
}
@ARTICLE{MoriTanakaDE,
author={R. Mori and T. Tanaka},
journal={{IEEE} Commun. Lett.},
title={Performance of polar codes with the construction using density evolution},
year={2009},
volume={13},
number={7},
pages={519-521},
keywords={binary codes;computational complexity;decoding;polar codes;density evolution;symmetric binary-input discrete memoryless channel;decoding complexity;low encoding complexity;binary erasure channel;capacity-achieving code construction method;linear complexity;Memoryless systems;Maximum likelihood decoding;Symmetric matrices;Polarization;Belief propagation;Statistics;Arithmetic;Linear code;Channel polarization, polar codes, code construction, belief propagation, density evolution.},
doi={10.1109/LCOMM.2009.090428},
ISSN={1089-7798},
month={July},
}
@ARTICLE{TalVardyGA,
author={I. Tal and A. Vardy},
journal={{IEEE} Trans. Inf. Theory},
title={How to Construct Polar Codes},
year={2013},
volume={59},
number={10},
pages={6562-6582},
keywords={approximation theory;codes;polar codes;polar bit-channels;alphabet size;approximation methods;construction algorithms;channel capacity;Approximation methods;Quantization (signal);Approximation algorithms;Decoding;Kernel;Complexity theory;Convolutional codes;Channel degrading and upgrading;channel polarization;construction algorithms;polar codes},
doi={10.1109/TIT.2013.2272694},
ISSN={0018-9448},
month={Oct},
}
@ARTICLE{URLLC_5G,
author={H. Ji and S. Park and J. Yeo and Y. Kim and J. Lee and B. Shim},
journal={{IEEE} Wireless Commun.},
title={Ultra-Reliable and Low-Latency Communications in 5G Downlink: Physical Layer Aspects},
year={2018},
volume={25},
number={3},
pages={124-130},
keywords={5G mobile communication;synchronisation;telecommunication network reliability;telecommunication scheduling;URLLC;air interface;5G NR downlink;physical layer issues;low-latency communications;ultra-reliable communications;3GPP release 15 standardization;New Radio;Reliability;Physical layer;5G mobile communication;Scheduling;3GPP;Long Term Evolution;Channel estimation},
doi={10.1109/MWC.2018.1700294},
ISSN={1536-1284},
month={JUNE},
}
@INPROCEEDINGS{betaExpansion,
author={G. He and J. Belfiore and I. Land and G. Yang and X. Liu and Y. Chen and R. Li and J. Wang and Y. Ge and R. Zhang and W. Tong},
booktitle={{IEEE} Global Telecommun. Conf},
title={Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes},
year={2017},
volume={},
number={},
pages={1-6},
keywords={AWGN channels;channel coding;number theory;polynomials;polar codes;polynomial equations;recursive construction;number theory;closed- form β-expansion;Reliability;AWGN channels;Indexes;Algorithm design and analysis;Color;Electronic mail;Complexity theory},
doi={10.1109/GLOCOM.2017.8254146},
ISSN={},
month={Dec},
}
@INPROCEEDINGS{lowcomplexityPuncShorteng,
author={V. Bioglio and F. Gabry and I. Land},
booktitle={{IEEE} Wireless Commun. and Netw. Conf. Workshop (WCNCW)},
title={Low-Complexity Puncturing and Shortening of Polar Codes},
year={2017},
volume={},
number={},
pages={1-6},
keywords={block codes;communication complexity;error correction codes;linear codes;low-complexity puncturing;low-complexity shortening;shortened polar codes;punctured polar codes;low-complexity code construction;code length;code rate;construction complexity reduction;block error rate performance;communication systems;Decoding;Complexity theory;Measurement;Reliability;Algorithm design and analysis;Encoding;Error analysis},
doi={10.1109/WCNCW.2017.7919040},
ISSN={},
month={March},
}
@article{lowLatencySWPolarDec,
author = {Giard, Pascal and Sarkis, Gabi and Leroux, Camille and Thibeault, Claude and Gross, Warren J.},
title = {Low-Latency Software Polar Decoders},
journal = {J. Signal Process. Syst.},
issue_date = {May 2018},
volume = {90},
number = {5},
month = may,
year = {2018},
issn = {1939-8018},
pages = {761--775},
numpages = {15},
url = {https://doi.org/10.1007/s11265-016-1157-y},
doi = {10.1007/s11265-016-1157-y},
acmid = {3220830},
publisher = {Kluwer Academic Publishers},
address = {Norwell, MA, USA},
keywords = {Polar codes, Software decoders, Successive-cancellation decoding},
}
%PhD thesis
@PhdThesis{Sarkis,
author = {Gabi Sarkis},
title = {Efficient Encoders and Decoders for Polar Codes: Algorithms and Implementations},
school = {McGill University},
year = {2016},
address = {Montreal, Canada},
month = April
}
@Booklet{CMP,
title = {{Chip Multi Core Processors}},
author = {Andreas Herkersdorf},
howpublished = {Lecture Notes, Institute for Integrated Systems, Technische Universit{\"a}t M{\"u}nchen},
year = {2017}
}
@Booklet{SoCT,
title = {{System on Chip Technologies}},
author = {Andreas Herkersdorf},
howpublished = {{Lecture Notes, Institute for Integrated Systems, Technische Universit{\"a}t M{\"u}nchen}},
year = {2016}
}
%Technical report
@techreport{AgnerFog,
author = {Agner Fog},
title = {{Instruction tables: Lists of instruction latencies, throughputs and micro-operation breakdowns for Intel, AMD and VIA CPUs}},
institution = {Technical University of Denmark},
year = {2018},
url = {https://www.agner.org/optimize/}
}
@techreport{cacheMiss,
author = {Ulrich Drepper},
title = {{What Every Programmer Should Know About Memory}},
institution = {Red Hat, Inc.},
year = {2018},
url = {https://lwn.net/Articles/250967/}
}
@article{MatrixMultComplexity,
author = {Fran{\c{c}}ois Le Gall},
title = {Powers of Tensors and Fast Matrix Multiplication},
journal = {CoRR},
volume = {abs/1401.7714},
year = {2014},
url = {http://arxiv.org/abs/1401.7714},
archivePrefix = {arXiv},
eprint = {1401.7714},
timestamp = {Mon, 13 Aug 2018 16:48:21 +0200},
biburl = {https://dblp.org/rec/bib/journals/corr/Gall14},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Electronic{SIMDWiki,
author = {Vadikus},
title = {{SIMD Units}},
url = {https://en.wikipedia.org/wiki/SIMD}
}
@Electronic{kronecker,
author = {Wikipedia},
title = {{Kronecker Produc}t},
url = {https://en.wikipedia.org/wiki/Kronecker_product}
}
@Electronic{IntelIntrinsics,
author = {Intel},
title = {{Intel Intrinsics Guide}},
url = {https://software.intel.com/sites/landingpage/IntrinsicsGuide/}
}
@Electronic{5G_TTI,
author = {www.sharetechnote.com},
title = {{5G - Frame Structure}},
url = {http://www.sharetechnote.com/html/5G/5G_FrameStructure_Candidate.html}
}
@Electronic{amdEpyc,
author = {www.amd.com},
title = {{AMD EPYC Procesor Datasheet}},
url = {https://www.amd.com/system/files/2017-06/AMD-EPYC-Data-Sheet.pdf}
}
@Electronic{minimizeFPGAResource,
author = {{Gisselquist Technology}},
title = {Minimizing {FPGA} {R}esource {U}tilization},
url = {https://zipcpu.com/blog/2017/06/12/minimizing-luts.html}
}
@Electronic{cppStd,
author = {{C++ Standardization Committee}},
title = {C++ reference},
url = {https://en.cppreference.com/w/}
}
\bibliographystyle{IEEEtran}
\bibliography{IEEEabrv,conf-jrnls}