ECE 5397/6331, Fall, 2021

Wireless Communication

 
                                                          

Zhu Han
Department of Electrical and Computer Engineering

Class 22

Nov. 15th, 2021

 Outline
 MIMO/Space time coding
 Trellis code modulation
 BICM
 Unequal error protection and joint source channel coding
 Polar code

 
 Homework 6
                                                          
 MIMO
 Model

                                                             T: Time index

W: Noise
YN T  H N M  X M T  WN T
 Alamouti Space-Time Code
• Transmitted signals are orthogonal => Simplified receiver
• Redundance in time and space => Diversity
• Equivalent diversity gain as maximum ratio combining => Smaller terminals

                                                            

Antenna 1 Antenna 2

Time n d0 d1
Time n +
- d1* d0*
T
 Space Time Code Performance
Block of T
symbols

Constellation
mapper
Data in
nt transmit
STBC antennas

                                                            
Block of K
symbols

• K input symbols, T output symbols T K

• R=K/T is the code rate
• If R=1 the STBC has full rate
• If T= nt the code has minimum delay
• Detector is linear !!!
 BLAST
 Bell Labs Layered Space Time Architecture
 V-BLAST implemented -98 by Bell Labs (40 bps/Hz)
 Steps for V-BLAST detection
1. Ordering: choosing the best channel
2. Nulling: using ZF or MMSE

  3. Slicing: making a symbol decision

4. Canceling: subtracting the detected symbol
                                                          
Time

5. Iteration: going to the first step to

Antenna
s1 s1 s1 s1 s1 s1
s2 s2 s2 s2 s2 s2 V-BLAST
detect the next symbol s3 s3 s3 s3 s3 s3

s0 s1 s2 s0 s1 s2
s0 s1 s2 s0 s1 D-BLAST
s0 s1 s2 s0
 Trellis Coded Modulation
1. Combine both encoding and modulation. (using Euclidean
distance only)
2. Allow parallel transition in the trellis.
3. Has significant coding gain (3~4dB) without bandwidth
compromise.
  4. Has the same complexity (same amount of computation, same
                                                          

decoding time and same amount of memory needed).

5. Has great potential for fading channel.
6. Widely used in Modem
 Set Partitioning
1. Branches diverging from the same state must have the largest distance.
2. Branches merging into the same state must have the largest distance.
3. Codes should be designed to maximize the length of the shortest error event
path for fading channel (equivalent to maximizing diversity).
4. By satisfying the above two criterion, coding gain can be increased.

                                                            
 Coding Gain
 About 3dB

                                                            
 Bit-Interleaved Coded Modulation
 Coded bits are interleaved prior to modulation.
 Performance of this scheme is quite desirable
 Relatively simple (from a complexity standpoint) to implement.

                                                            

Binary Bitwise M-ary

Encoder Interleaver Modulator

Channel

Soft Bitwise Soft

Decoder Deinterleaver Demodulator
 BICM Performance
12

CM
BICM
AWGN Channel,
10 Noncoherent Detection
M: Modulation Alphabet Size

8
Minimum Eb/No (in

                                                            
M=2
dB)

6
M=4

M = 16
2

M = 64
0
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1

Code Rate R
 Unequal Error Protection
 Multiple Description Coding

                                                            

 Video
– Base layer vs. enhancement layer
 Unequal Error Protection
 For different packets with different importance, different channel coding is
used.

                                                            
 Joint Source Channel Coding
 Limited bandwidth
 If source data is more, less channel
protection data.
 What is the best tradeoff

                                                            
 Polar Code
 https://www.youtube.com/watch?v=KR2cZXyVR2Q
 linear block error-correcting code.
 The code construction is based on a multiple recursive
concatenation of a short kernel code which transforms the
physical channel into virtual outer channels.
   When the number of recursions becomes large, the virtual
                                                          

channels tend to either have high reliability or low reliability (in

other words, they polarize or become sparse), and the data bits
are allocated to the most reliable channels.
 It is the first code with an explicit construction to provably
achieve the channel capacity for symmetric binary-input,
discrete, memoryless channels (B-DMC)
 Homework 6, Due 12/1/21
 Hamming code, generation matrix and parity check matrix.
Show that how one error can be checked and correct. Show
how about 2 error case

   CRC code,
                                                          

– message 11010011101100, divider 1011. Show what is 3bit

CRC code. Explain how the receive know if the packet is right.
 Explain how convolutional encoder works, what is the
maximum likelihood decoding by trellis graph, what is
Viterbi decoding