Главная
Study mode:
on
1
Intro
2
Motivation - Orthogonal Transmission Scheme
3
Orthogonal Transmission Scheme - Sketch
4
Motivation - Dynamics of Orthogonal Transmission Scheme
5
Drawback of OFDM - The Effect of Clipping
6
Motivation - High Dynamics of Orthogonal Transmission Scheme
7
Motivation - Tone Reservation method
8
PAPR Reduction Problem - Remarks
9
Necessary and Sufficient Conditions - Essential Subspaces
10
Necessary Condition - Sketch of Proof
11
Outline
12
Solvability of PAPR Problem - OFDM
13
Szemerédi Theorem on Arithmetic Progressions
14
Szemerédi Theorem - Historical Remarks
15
Szemerédi Theorem - Asymptotic Case and Probabilistic Case
16
Solvability of PAPR reduction problem & Arithmetic Progressions
17
Asymptotic Tightenings of Thm. 3.7
18
Walsh functions
19
Perfect Walsh Sum
20
PAPR reduction problem for CDMA Case - PWS
21
Asymptotic results for PWS
22
Summary and Conclusions
23
PAPR Reduction Problem - Formulation
Description:
Explore the mathematics behind signal design for communication systems in this lecture by Holger Boche from TU München. Delve into the challenges of orthogonal transmission schemes, focusing on their high dynamical behavior and its impact on system performance and efficiency. Discover the connections between this problem and various mathematical fields, including functional analysis, additive combinatorics, and harmonic analysis. Examine the Peak-to-Average power ratio (PAPR) reduction problem and its relationship to Szemerédi's Theorem on arithmetic progressions. Investigate necessary and sufficient conditions for solving the PAPR problem in OFDM and CDMA systems, and learn about asymptotic tightenings and perfect Walsh sums. Gain insights into the interdisciplinary nature of signal processing and its applications in modern communication standards.

Mathematics of Signal Design for Communication Systems and Szemerédi’s and Green-Tao’s Theorems

Hausdorff Center for Mathematics
Add to list
0:00 / 0:00