The document discusses coding techniques for fading channels. It notes that most coding wisdom is based on high SNR Gaussian channels, but fading channels have different properties like low and variable SNR and non-Gaussian statistics. For fading channels, the optimal coding criteria depends on the channel model. Techniques like trellis coded modulation (TCM) and bit-interleaved coded modulation (BICM) can provide more robust performance over fading channels compared to codes optimized for Gaussian channels. BICM in particular separates demodulation and decoding, improving performance when the exact channel model is unknown. The document also discusses coding for block fading channels, where a codeword experiences a limited number of independent fading gains rather than full interleaving.
RF Basics & Getting Started Guide by AnarenAnaren, Inc.
This presentation serves as an overview of the parameters and considerations a designer would use to select a low-power wireless (LPRF) solution. It also highlights the devices and tools from the Anaren Integrated Radio (AIR) module product line and how they fit in a typical LPW design.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
5. FOR EXAMPLE, EVEN ON LOW-SNR
GAUSSIAN CHANNELS
MINIMUM-EUCLIDEAN DISTANCE IS NOT
THE OPTIMUM CRITERION
EXAMPLE: Minimum P(e) for
4-point, one-dimensional constellation:
low SNR
high SNR
5
6. WIRELESS CHANNELS DIFFER
CONSIDERABLY FROM HIGH-SNR
GAUSSIAN CHANNELS:
SNR IS A RANDOM VARIABLE
AVERAGE SNR IS LOW
CHANNEL STATISTICS ARE NOT GAUSSIAN
MODEL MAY NOT BE STABLE
6
7. CODING FOR THE FADING CHANNEL
• Modeling the wireless channel
7
8. COHERENCE BANDWIDTH
DEFINITION:
1
----------------------
DELAY SPREAD
OPERATIONAL MEANING:
Frequency separation at which two frequency
components of TX signal undergo
independent attenuations 8
9. COHERENCE TIME
DEFINITION:
1
---------------------------
DOPPLER SPREAD
OPERATIONAL MEANING:
Time separation at which two time
components of TX signal undergo
independent attenuations 9
10. FADING-CHANNEL CLASSIFICATION
Bx
flat selective
in in time
time and frequency
Bc
flat
flat in
in time and
frequency
frequency
Tc Tx
10
11. MOST COMMON MODEL FOR FADING
• channel is frequency-flat
• channel is time-flat (fading is “slow”)
11
12. MOST COMMON MODEL FOR FADING
• FREQUENCY-FLAT CHANNEL:
Fading affects the received signal as a
multiplicative process
noise
Received signal:
r(t ) = R(t )exp jΘ(t ) x(t ) + n(t )
Gaussian process:
R Rayleigh or Rice transmitted
signal
12
13. MOST COMMON MODEL FOR FADING
• SLOW FADING :
Fading is approximately constant
during a symbol duration
Received signal:
r(t ) = R exp jΘ x(t ) + n(t ), 0<t <T
This is constant over
a symbol interval
13
14. COHERENT DEMODULATION
Received signal:
r (t ) = R x(t ) + n(t ), 0 <t <T
Phase term is estimated
and compensated for
14
15. CHANNEL-STATE INFORMATION
The value of the fading attenuation is the
“channel-state information”
This may be:
• Unknown to transmitter and receiver
• Known to receiver only
(through pilot tones, pilot symbols, …)
• Known to transmitter and receiver
15
16. EFFECT OF FADING ON ERROR PROBABILITIES
1
bit error probability, binary antipodal signals
0.1
RAYLEIGH
0.01 FADING
0.001
GAUSSIAN
CHANNEL
0.0001
0.00001
0 10 20 30
signal-to-noise ratio (dB)
performance of uncoded modulation over the fading channel
with coherent demodulation
16
17. CODING FOR THE FADING CHANNEL
• Optimum codes for the
frequency-flat,
slow fading channel
• Euclid vs. Hamming
• How useful is an
“optimum code”?
17
18. MOST COMMON MODEL FOR CODING
Our analysis here is concerned with the
frequency-flat, slow,
FULLY-INTERLEAVED CHANNEL
as the de-interleaving mechanism creates a
fading channel in which the random variables
R in adjacent intervals are independent
18
19. DESIGNING OPTIMUM CODES
Chernoff bound on the pairwise error probability
over the Rayleigh fading channel with high SNR:
Hamming distance
Signal-to-noise ratio
−dH ( x ,x )
1 Γ 2
P(x → x) ≤ ∏
≤ δ
Γ 4
k
1+ | xk − xk |2
4
Product distance
Most relevant parameter: Hamming 19
distance
20. DESIGNING OPTIMUM CODES
Design criterion:
Maximize Hamming distance among signa
A consequence:
In trellis-coded modulation, avoid “parallel transitions
as they have Hamming distance = 1.
20
21. DESIGNING OPTIMUM CODES
If we maximize Hamming distance among
signals strange effects occur. For example:
if fading acts
independently
on I and Q parts:
4PSK Effect of a deep fade on
Q part (one bit is lost)
if fading acts
independently
on I and Q parts:
Rotated 4PSK Effect of a deep fade on
(same Euclidean distance) Q part 21
(no bit is lost)
22. DESIGNING OPTIMUM CODES
Problems with optimum fading codes:
• The channel model may be unknown,
or incompletely known
• The channel model may be unstable
22
23. ROBUST CODES
In these conditions, one should look for
robust, rather than optimum,
coding schemes
23
24. CODING FOR THE FADING CHANNEL
• BICM as a robust coding
scheme
24
25. A ROBUST SCHEME: BICM
encoder bit modulator hannel
c demo bit decoder
interleaver d. deinterleav
er
interleaving is done at bit level
demodulation and decoding are separated
25
26. A ROBUST SCHEME: BICM
Separating demodulation and decoding is a considerable
departure from the “Ungerboeck’s paradigm” , which states
that demodulation and decoding should be integrated
in a single entity for optimality
But this may not be true if the channel is not Gaussian!
Bit interleaving may increase Hamming distance amon
code words at the price of a slight decrease of Euclide
distance ( robust solution if channel model is not stable
26
27. A ROBUST SCHEME: BICM
BICM idea is that Hamming distance
(and hence performance over the fading channel)
can be increased by making it
equal to the smallest number of bits
(rather than channel symbols)
along any error event:
00 00 00
correct path
11 10 11 concurrent path
TCM: Hamming distance is 3
BICM: Hamming distance is 5 27
28. A ROBUST SCHEME: BICM
BICM DECODER USES MODIFIED “BIT METRICS ”
With TCM, the metric associated with symbol s is
p(r | s)
With BICM, the metric associated with bit b is
∑ p( r | s )
s∈Si ( b )
i
where S the set of symbols whose label is b in position i
is (b )
01
EXAMPLE:
11 00 S1 (0)
28
10
29. A ROBUST SCHEME: BICM
The performance of BICM with ideal interleaving
depends on the following parameters:
• Minimum binary Hamming distance of the code select
• Minimum Euclidean distance of the constellation sele
so we can combine:
• A powerful modulation scheme
• A powerful code (turbo codes, …)
29
31. ANTENNA DIVERSITY & CHANNEL INVERSION
Possible solution to the”robustness problem”:
Turn the fading channel into
a Gaussian channel, and use standard cod
• Antenna diversity
• Channel inversion as a power-allocation
technique
31
33. ANTENNA DIVERSITY (order M)
• The fading channel becomes Gaussian
as M → ∞
• Codes optimized for the Gaussian
channel perform well on the Rayleigh
channel if M is large enough
• Branch correlation coefficients up to 0.5
achieve uncorrelated performance
within 1 dB
• The error floor with CCI decreases
exponentially with the product of M
times the Hamming distance of the code
used 33
34. EXPERIMENTAL RESULTS
Performance was evaluated for
the following coding schemes:
J4: 4-state, rate-2/3 coded 8-PSK optimized
for Rayleigh-fading channels
U4 & U8: Ungerboeck’s rate-2/3 coded 8-PSK
with 4 and 8 states optimized for the Gaussian chan
Q64: “Pragmatic” concatenation of the “best” binary
rate-1/2 64-state convolutional code (171, 133)
mapped onto Gray-encoded 4-PSK
34
36. CODING FOR THE FADING CHANNEL
• The block-fading channel
36
37. Most of the analyses are concerned with the
FULLY-INTERLEAVED CHANNEL
as the de-interleaving mechanism creates a
virtually memoryless coding channel.
HOWEVER,
in practical applications such as digital cellular
speech communication, the delay introduced by
long interleaving is intolerable
37
38. FACTS
In many wireless systems:
Typical Doppler spreads range from 1 Hz to 100 Hz
(hence coherence time ranges from 0.01 to 1 s)
Data rates range from 20 to 200 kbaud
Consequently, at least
L=20,000 x 0.01 = 200 symbols
are affected approximately by the same fading gain
38
39. FACTS
Consider transmission of a code word of length n.
For each symbol to be affected by an independent
fading gain, interleaving should be used
The actual time spanned by the interleaved code
word becomes at least nL
The delay becomes very large
39
40. FACTS
In some applications, large delays are unacceptable
(real time speech: 100 ms at most)
Thus, an n-symbol code word
is affected by less than n independent fading gains
40
41. BLOCK-FADING CHANNEL MODEL
This model assume that the fading-gain process
is piecewise constant on blocks of N symbols.
It is modeled as a sequence of independent
random variables, each of which is the fading gain
in a block.
A code word of length n is spread over M blocks
of N symbols each, so that n=NM
41
42. BLOCK-FADING CHANNEL MODEL
1 M
N
2
N
3
N .. N
n=NM ..
• Each block of length N is affected by the same fading.
• The blocks are sent through M independent channels.
• Interleaver spreads the code symbols over the M block
(McEliece and Stark, 1984 -- Knopp, 1997) 42
43. BLOCK-FADING CHANNEL MODEL
Special cases:
M=1 (or N=n) the entire code word
is affected by the
same fading gain
(no interleaving)
M=n (or N=1) each symbol is affected
by an independent
fading gain
(ideal interleaving)
43
44. BLOCK-FADING CHANNEL MODEL
The delay constraints determines
the maximum M
The choice M → ∞ makes the channel
ergodic, and allows Shannon’s channel
capacity to be defined (more on this later)
44
45. System where this model is appropriate:
GSM with frequency hopping
f
4 4
3 3
2 2 2
1 1 1
t
M=4 (half-rate GSM) 45
46. System where this model is appropriate:
IS-54 with time-hopping
1 2 1
M=2
46
47. COMPUTING ERROR PROBABILITIES
“Channel use” is now the transmission
of a block of N coded symbols
From Chernoff bound we have, over
Rayleigh block-fading channels:
1
P ( X → X) ≤ ∏
ˆ
m∈M 1 + dm / 4N0
2
Set of indices in which Squared Euclidean distance
coded symbols differ between coded blocks
47
48. COMPUTING ERROR PROBABILITIES
For high SNR:
Signal-to-noise ratio Hamming block-distance
ˆ
−d H ( X , X )
1 Γ 2
P ( X → X) ≤ ∏
ˆ ≤ δ
m∈M 1 +
Γ 2 4
dm
4
Product distance
48
49. Relevant parameter for
design
Minimum Hamming block-distance D
between
code words on block basis:
Error probability decreases with
exponent D min
(also called: code diversity )
49
51. Bound on Dmin
With S-ary modulation, Singleton bound
holds for a rate-R code:
R
Dmin ≤ 1 + M 1 −
log S
2
51
52. Example: Coding in GSM
+
+
Rate-1/2 convolutional code (0.5 bits/dimension)
used in GSM with M=8. It has dfree=7
52
53. Example: Coding in GSM
dfree path is: {0...011010011110...0}
Symbols in each one of the 8 blocks:
1: 0...0110...0
2: 0...0110...0
Dmin=5
3: 0...0000...0
4: 0...0100...0
5: 0...0000...0
6: 0...0000...0
7: 0...0100...0
8: 0...0100...0 53
54. This code is optimum!
With full-rate GSM, R=0.5 bits/dim, M=8, S=2. Hence:
Dmin ≤ 5
achieved by the code. (With S=4 the upper bound
would increase to 7).
54
57. We have:r (t ) = R x(t ) + n(t )
Assume R is known to transmitter and
receiver
γ
If: x (t ) = s (t )
R
( channel inversion) then the fading channel
is turned into a Gaussian channel
57
58. Channel inversion is common
n spread-spectrum systems
with near-far imbalance
PROBLEM: For Rayleigh fading channels the avera
transmitted power would be infinite.
SOLUTION: Use average-power constraint.
58
59. CODING FOR THE FADING CHANNEL
• Using multiple antennas
59
60. MULTIPLE- ANTENNA MODEL
(Si n g l e-u ser) ch a n n el w i th
t tra n sm i t a n d r recei ve a n ten n a s:
t r
H
60
61. CHANNEL CAPACITY
RATIONALE: U se sp a ce to i n crea se d i versi ty
(Freq u en cy a n d ti m e co st to o m u ch )
Ea ch recei ver sees th e si g n a l s ra d i a ted fro m
th e t tra n sm i t a n ten n a s
Pa ra m eter u sed to a ssess sy stem q u a l i ty :
CHANNEL CAP ACITY
(Th i s i s a limit to error- f ree bit rate, p ro vi d ed
b y i n fo rm a ti o n th eo ry ) 61
62. CHANNEL CAPACITY
Assu m e th a t tra n sm i ssi o n o ccu rs i n f rames:
th ese a re sh o rt en o u g h th a t th e ch a n n el i s
essen ti a l l y u n ch a n g ed d u ri n g a fra m e,
a l th o u g h i t m i g h t ch a n g e co n si d era b l y fro m o n e
fra m e to th e n ext (“ quasi- stationary” vi ew p o i n t)
W e a ssu m e th e ch a n n el to b e
u n k n o w n to th e tra n sm i tter, b u t
k n o w n to th e recei ver
H o w ever, th e tra n sm i tter h a s a p a rti a l k n o w l ed g e
o f th e ch a n n el q u a l i ty , so th a t i t ca n ch o o se
th e tra n sm i ssi o n ra te 62
63. CHANNEL CAPACITY
N o w , th e ch a n n el va ri es w i th ti m e fro m fra m e
to fra m e, so fo r so m e (sm a l l ) p ercen ta g e o f
fra m es d el i veri n g th e d esi red b i t ra te a t th e
d esi red BER m a y b e i m p o ssi b l e.
W h en th i s h a p p en s, w e sa y th a t a channel outage
h a s o ccu rred . I n p ra cti ce capacity is a random
variable.
W e a re i n terested i n th e ca p a ci ty th a t ca n b e
a ch i eved i n n ea rl y a l l tra n sm i ssi o n s (e.g ., 99% ).
63
64. CHANNEL CAPACITY
1 % -o u ta g e ca p a ci ty
(u p p er cu rves)
fo r Ra y l ei g h ch a n n el
vs. SN R a n d
n u m b er o f
a n ten n a s
N o te: a t 0-d B SN R,
25 b / s/ H z a re
a va i l a b l e w i th t= r= 32!
t= r
(SN R i s P/ N a t ea ch recei ve a n ten n a ) 64
65. CHANNEL CAPACITY
1 % -o u ta g e ca p a ci ty
p er d i m en si o n
(u p p er cu rves)
fo r Ra y l ei g h
ch a n n el
vs. SN R a n d
n u m b er o f
a n ten n a s
t= r
65
67. SPACE- TIME CODING
(Al a m o u ti , 1 998)
Co n si d er t 2 a n d r 1 .
= =
Den o te s0 th e si g n a l fro m a n ten n a 0
a n d s1 th e si g n a l fro m a n ten n a 1
Du ri n g th e n ext sy m b o l p eri o d
-s1 * i s tra n sm i tted b y a n ten n a 0
s0* i s tra n sm i tted b y a n ten n a 1
67
68. SPACE- TIME CODING
Th e si g n a l s recei ved i n tw o a d j a cen t ti m e sl o ts a re
r0 = r (t ) = h0 s0 + h1s1 + n0
∗ ∗
r1 = r (t + T ) = − h s + h1s0 + n1
0 1
Th e co m b i n er y i el d s
~ = h ∗r + h r ∗
s0 0 0 1 1
~ = h ∗r − h r ∗
s 1 1 0 0 1
68
69. SPACE- TIME CODING
So th a t:
~ = h 2 + h 2 s + noise
s0 0 1 0
~ = h 2 + h 2 s + noise
s1 0 1 1
A m a xi m u m -l i k el i h o o d d etecto r m a k es a
d eci si o n o n s0 a n d s1 . Th i s sch em e h a s th e sa m e
p erfo rm a n ce a s a sch em e w i th t 1 , r 2 a n d
= =
m a xi m a l -ra ti o co m b i n i n g .
69
71. SPACE- TIME CODING
M RRC=
m a xi m u m -
ra ti o
recei ve
co m b i n i n g 71
SN R (d B)
72. SPACE- TIME CODING
Th e p erfo rm a n ce o f th i s sy stem w i th t 2
=
a n d r 1 i s 3-d B w o rse th a n w i th t 1 a n d r 2
= = =
p l u s M RRC.
Th i s p en a l ty i s i n cu rred b eca u se th e cu rves a re
d eri ved u n d er th e a ssu m p ti o n th a t each TX
antenna radiates half the energy as the single
transmit antenna w i th M RRC.
72
73. SPACE- TIME CODING
(Ta ro k h , Sesh a d ri , Ca l d erb a n k , et a l .)
Co n si d er tw o tra n sm i t a n ten n a s
Exa m p l e:
Sp a ce-ti m e co d e a ch i evi n g d i versi ty 2 w i th
o n e recei ve a n ten n a (“ 2-sp a ce-ti m e co d e” ),
a n d d i versi ty 4 w i th tw o recei ve a n ten n a s
73
74. SPACE- TIME CODING
La b el x m ea n s th a t
y
si g n a l x s tra n sm i tted o n a n ten n a 1 , w h i l e
i
si g n a l y s (si m u l ta n eo u sl y ) tra n sm i tted o n a n ten n a
i
2
00 01 02 03
2-sp a ce-ti m e co d e
10 11 12 13 4PSK
4 sta tes
20 21 22 23 2 b i t/ s/ H z
30 31 32 33 74
75. SPACE- TIME CODING
• I f y j n d en o tes th e si g n a l recei ved a t a n ten n a j
a t ti m e n , th e b ra n ch m etri c fo r a tra n si ti o n l a b el ed
qq… qi s
1 2 t
r t 2
∑j =1
y n − ∑ hi , j qi
j
i =1
(n o te th a t ch a n n el -sta te i n fo rm a ti o n i s n eed ed
to g en era te th i s m etri c)
75
76. SPACE- TIME CODING
Fo r w i rel ess sy stem s w i th a sm a l l n u m b er
o f a n ten n a s, th e sp a ce-ti m e co d es o f
Ta ro k h , Sesh a d ri , a n d Ca l d erb a n k p ro vi d e
both coding gain and diversity
Using a 64- state decoder these come
within 2—3 dB of outage capacity
76
77. TUR O- CODED MODULATION
B
(Stefa n o v a n d Du m a n , 1 999)
77
78. TUR O- CODED MODULATION
B
BER fo r severa l
tu rb o co d es
a n d a 1 6-sta te
sp a ce-ti m e co d e
78
Editor's Notes
For example, in a TDMA or FDMA system, the network resource is shared among users via disjoint frequency and time slots, and this sharing provides a simple abstraction for resource allocation problems at the networking layer .