Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Sign up for free
Menu
Search
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Pricing
Search
Sign in
Sign up for free
Steredenn Daumont - Démodulation abeugle dans u...
Search
SCEE Team
October 02, 2008
Research
120
0
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
Steredenn Daumont - Démodulation abeugle dans un contexte d'interception
SCEE Team
October 02, 2008
More Decks by SCEE Team
See All by SCEE Team
Cédric Marchand - Non-Binary LDPC codes
scee_team
1
630
Marie Chabert - Periodic Non-Uniform Sampling (PNS) for Satellite Communications
scee_team
0
160
Eleftherios Kofidis - Channel Estimation in Filter Bank-based Multicarrier Systems: Fundamentals and Recent Advances
scee_team
0
230
Adrien Thierry - Reconfiguration Partielle dynamique des FPGA pour les Applications Spatiales
scee_team
0
140
Hamed Ahmadi - Learning, prediction and selection algorithms for opportunistic spectrum access
scee_team
0
98
Arman Farhang - New Waveform Candidates for 5G: Options and Opportunities
scee_team
0
280
Julio Cesar - Novel spectrum sensing schemes for Cognitive Radio Networks
scee_team
0
140
Laurent Martinod - FP7 EMPHATIC project: Airbus D&S current view and study
scee_team
0
200
Vincent Savaux - Pilot-Aided and Blind Equalization in FBMC Modulation for PMR Networks
scee_team
0
200
Other Decks in Research
See All in Research
データサイエンティストの就労意識~2015 → 2026 一般(個人)会員アンケートより
datascientistsociety
PRO
0
1k
CVPR2026論文紹介_VLMにとって良いvision encoderとは何か?Rethinking Model Selection in VLM Through the Lens of Gromov-Wasserstein Distance
kobayashi31
1
270
実例から見るLLMのマンガ理解:実務VQAタスクによる長期的文脈と視覚情報の定性評価
kzmssk
0
190
進化?迷走?CasualConc ファミリーアプリの現在地 @ 英語コーパス学会 2026
casualconc
0
150
CDCL を用いた MILP の厳密解法
imai448
0
300
就労支援の現場での生成AI活用
enochan
0
150
ふとした出会いで生まれたSkillが、 社内利用1位になるまで
mikimhk
22
25k
Être éleveur dans un monde en transition : Comprendre les changements pour mieux les accompagner
institutdelelevage
PRO
0
140
山中市政の総括:相反する二つの顔
sishi
0
220
20260624 NLP colloquium: 単一のhubテキストがCLIPを壊す:hubnessによる埋め込みの脆弱性特定
de9uch1
2
300
ros2-perf-multihost: 分散システムにおける客観的なアーキテクチャ評価フレームワーク
takasehideki
0
290
HackSick vol.7 LT資料【LLMアーキテクチャ入門・事前学習時の躓き所解説】 スパースなAttention・状態空間モデル
rikkabotan7
0
220
Featured
See All Featured
VelocityConf: Rendering Performance Case Studies
addyosmani
331
25k
jQuery: Nuts, Bolts and Bling
dougneiner
66
8.6k
How GitHub (no longer) Works
holman
316
150k
Self-Hosted WebAssembly Runtime for Runtime-Neutral Checkpoint/Restore in Edge–Cloud Continuum
chikuwait
0
890
How to Build an AI Search Optimization Roadmap - Criteria and Steps to Take #SEOIRL
aleyda
1
2.2k
So, you think you're a good person
axbom
PRO
2
2.2k
Documentation Writing (for coders)
carmenintech
77
5.6k
Fireside Chat
paigeccino
43
4.1k
技術選定の審美眼(2025年版) / Understanding the Spiral of Technologies 2025 edition
twada
PRO
120
120k
DBのスキルで生き残る技術 - AI時代におけるテーブル設計の勘所
soudai
PRO
68
58k
How to audit for AI Accessibility on your Front & Back End
davetheseo
0
600
Groundhog Day: Seeking Process in Gaming for Health
codingconduct
0
410
Transcript
None
!" ! # $%$& # ! ' ( )
* !" %+# $%$& $%$& ' $ % $ &
,- . /# , 0 112 # 3 / 4 ' - . $%$& 0 11 4 ' 3 ! ! ( ) ( )
5 !" %+# $%$& # ' $%$& ! 6 78
! 3 6 ' - 3 6 ' # $%$& # $%$& ( , 6 $%$& ' # 0/,,4 0 4 # 9 ( ) 0 4
!" %+# $%$& ,- . , : - 9 ;
! " + =
2 !" %%+# 4 <- ". = >= # -
# < < : ? 3 " /,, # 3 3 - # - 9 ;
@ !" %%+# 34! ! % ' "#$ %& "#$
"#$ ' "#$ %& "#$( "#$ ) "#$ "#$ ) *"#$ + = + = = ! * Φ = ' "#$ *"#$ = =
!" %%+# 4A B $ ' " ' ( )
+ + ℜ ℜ = − = ∑ = , (' ' =
1 !" %%+# 4 A B $ $ ' (
B 0 4 " ' ( ) ( ) ( ) ( ) ( ) − ℑ + − ℜ = ∑ = , (' ' =
!" %%+# 4 % C " 6 0 " $
$$ 4 ! "# $ % % & % $% % ' % $ % % % & $ & % ( %% % %% % % ) %% $ " 3 6 0 " $ 4 % * ! +,- . & / 0# & / 0 % * % %% % ! % % % % & % %
!" %%+# 4 % C " 6 0 " $
$$ 4 $ 9 D 9 " 6 E E ) ) ) ) ∇ + = + µ
!" %%+# 4 % $ " 3 6 0 "
$ 4 / . $ ' F - . G 7 . 3 ( ) ( ) ( ) ( ) ( ) ( ) ( ) - - . / . - - - ⊗ = ⊗ ⊗ = − = − ⊗ ⊗ = − = ∑ ∑ ∑ = = = M = ⊗ % % % % M
* !" %%+# 4 ! 3 6 % " '
, ' . $$ % ' , ' 3 H ! * Φ =
5 !" %%+# 4 # 3 H
− − K K = K K 0
!" %%+# 4 # 3 H
− − ≈ − − ≈ K K K K π π π π π π π π π π π π π π π π 0 0
2 !" %%+# 4 # 3 H
− − ≈ − − ≈ K K K K π π π π π π π π π π π π π π 0 0
@ !" %%+# 4 # 3 H
− − ≈ − − ≈ K K K K π π π π π π π π π π π π π π π π 0 0
!" %%+# 4 # 3 H $ " 4 3
' ' 4 F " *4 # − − − − K K K K − ≠ − ≠ − ≈ π π π π π π π π K K 0
1 !" %%+# 4 # 3 H 3 . /,,
3 ? I # - " ' [ ] [ ] + − + = + − + = − − ≈ − − ≈ K K K K π π π π π π π π π π π π π π 0 0
!" %%+# 4 # 3 H J % % 3
- " ≈ + − + − ≈ + + + = ≈ − ≈ − + − ≈ ≈ + + = + + + + + + + + + + π π π π π π π π π π
!" %%+# 4 # 3 H , - " 3
" - " 3 ' , % 8% - " 3 , - " ( : ? ≈ ≈ = + π
!" %%+# 4 # 3 H F " 0;K; 4
π π − + + + = + − − ≈ K K π π π π π π π π − − ≈ K K π π π π π π π π 0
* !" $ ( - 3 ' & 3 '
π π + − + − + = + + = + − − ≈ = = − − ≈ K K K K 0 0 π π
5 !" %%+# 4 # 3 H ! , /,,
(( ' + > + + − ≈ + + ≈ + − − ≈ K K 0
!" %%+# 4 # 3 H , /,, ! 6
' + < + + ≈ + + − ≈ + − − ≈ K K 0
2 !" %%+# 4 # 3 H , - ,
- + − = + + + = + + + = + + − = +
@ !" %%+# 4 # 3 H L$ " 6
6 ' L$ " 6 6 ' = = + − + − + × = → ( ) ' ' σ σ + + − + + − × = σ σ
!" %%+# 4 # 3 H # 6 - (
- 3 ' ! " # − = × = − → → → → σ σ → '
1 !" %%+# 4 # 3 H L$ " 6
0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 −45 −40 −35 −30 −25 −20 −15 −10 −5 0 EQM avec 100 réalisations, Nt=Nr=2, 10000 symboles, mu=0.002 Es/N0(dB) EQM(dB) EQM théorique sans exploiter la redondance 16−QAM EQM théorique en exploitant la redondance 16−QAM EQM théorique en exploitant la redondance 4−QAM EQM théorique sans exploiter la redondance 4−QAM
* !" %%+# 4 # 3 H F 0 2
4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 −45 −40 −35 −30 −25 −20 −15 −10 −5 0 EQM avec 100 réalisations, Nt=Nr=2, 10000 symboles, mu=0.002 Es/N0(dB) EQM(dB) EQM sans exploiter la redondance 4−QAM EQM en exploitant la redondance 4−QAM EQM sans exploiter la redondance 16−QAM EQM en exploitant la redondance 16−QAM
* !" %%+# 4 3 6 78 3 H K
L$ J " /,, 78 , ' ( )
* !" %%%+! ' ( ) ! A )
+ = + − = " $% $ " $% ! ! ! ! % 1 2& 3 41 1
** !" %%%+! ' ( ) 4 " 5 4
4! ! 41 1 + − − = − − − = − − + − = + − = − − = − + − = ! 2 6 ! ! 6 1 1 1 2 2 ! 2 7 2 ! 6
*5 !" %%%+! ' ( ) 34 ! 3 .
6 ! ( ) - 3 I 7 6 - . ( # 6 8 - 3 ? 9 9 , 7 ' = - 3 9 /,, <- ". ' # = - 3 : " /,, ' $ " 3 6 3 0 3 ( 3 = 8= 4
* !" %%%+! ' ( ) 4 % ( )
<- ". ' 4 M /,, $ 3 = - 3 : 4 # 3 H *4 = . N 9 9
*2 !" %%%+! ' ( ) 4 % ( )
0 4 54 % ( ) 9 = 4 $%$& 9 ( ) 24 - 3 9
*@ !" %%%+! ' ( ) 4 F
* !" %%%+! ' ( ) 4 % ( )
/ - −3 2 7 12 17 10−5 10−4 10−3 10−2 10−1 100 BER with 10000 runs, fdTs=0.0056, K=3dB, Ns=100, Np=10 Eb/N 0 (dB) BER Blind KF (BER 1) KF using training sequences (BER 2) ACMA (BER 3)
*1 !" %J+ F 3 6 6 ' # $%$&
( M $$ # 3 H L$ # $%$& M ( ) 9 % ( ) 9 /,, $ 3 ! (