Geometric Representation of M-ary Signals

(Orthogonal, Bi-orthogonal, Simplex)

송홍엽

Coding and Crypto Lab.

Dept. Electrical and Electronics Engineering
Yonsei university

Content

 Introduction
 4-ary Signals
 4-ary Baseband Signals and Waveforms
 M-ary Orthogonal Signals
 M-ary Bi-orthogonal Signals
 Simplex Bound
 Simplex Bound – detailed proof
 M-ary Simplex Signals

Coding and Crypto Lab 2/16

 Introduction

 Consider only those signal sets with constant energy:

Ts
Es   si (t ) 2 dt , i  1,2,  , M .
0

 Mainly consider the case where M  2m  2, 4, 8, 16, 32, etc.

 SER Performance is critically dependent on their covariance
matrix   ij  whose (i,j)-component is given by
1 Ts
ij   si (t ) s j (t )dt , i, j  1,2, , M .
Es 0
 Some already discussed examples are:
Binary Antipodal and Binary Orthogonal
 1  1  1 0
       
  1 1   0 1 

Coding and Crypto Lab 3/16

4-ary signal sets

1 a b c
 
 Typical covariance matrix a 1 d e

b d 1 f
of a 4-ary signal set looks like:  
c e 1 
 f
 Best Choice:
 all off-diagonal terms are –1 (pair-wise antipodal), but
 this is impossible to achieve, except for the binary case.
 can you prove this ?
 Several good choices are:
 1  1 / 3  1 / 3  1 / 3  1 0 1 0  1 0 0 0
     
 1/ 3 1  1 / 3  1 / 3  0 1 0  1 0 1 0 0
1   2   3  
1/ 3 1/ 3 1  1 / 3 1 0 1 0  0 0 1 0
     
 1/ 3 1/ 3 1/ 3 1   0 1 0 1  0 0 0 1 
   

simplex bi-orthogonal orthogonal

(or, trans-orthogonal)
Coding and Crypto Lab 4/16
 4-ary Baseband Signals and Waveforms
1 0 0 0  1 0 1 0   1  1 / 3  1 / 3  1 / 3
     
0 1 0 0  0 1 0  1  1/ 3 1  1 / 3  1 / 3
3   2   1  
0 0 1 0 1 0 1 0  1/ 3 1/ 3 1  1 / 3
     
0 0 0 1   0 1 0 1   1/ 3 1/ 3 1/ 3 1 
   
orthogonal bi-orthogonal simplex
(trans-orthogonal)

Coding and Crypto Lab 5/16

M-ary Orthogonal Signals

 Dimension of signal space is M.

M-ary orthognal signals correspond to M unit vectors on orthognal M-
dimensional signal space.
 Covariance matrix consists of all 1’s on the main diagonal and
all 0’s on the off-diagonal.
 Most useful construction comes from a Hadamard matrix of
size M by M.
 A Hadamard matrix of size M by M exists, then M must be
1, 2, or a multiple of 4.
 It is not known yet whether there is a Hadamard matrix of size
M by M for all the multiples of 4.
The smallest unknown case is 428. (conjectured to be true…i.e. it exists
but not yet unknown to us..)

Coding and Crypto Lab 6/16

 M-ary Bi-orthogonal Signals

 Sometimes, it is called “trans-orthogonal” signals.

 M must be even.
M-ary bi-orthognal signals correspond to M unit vectors on orthognal
M/2-dimensional signal space, where we select two antipodal vectors of
unit length on each axis.
Therefore, any pair not on the same axis are orthogonal, but the pair on
the same axis are antipodal.
 Covariance matrix consists of all 1’s on the main diagonal and
off-diagonal terms are either 0 or –1.
Number of –1’s is exactly M/2, and the rest are all 0’s.
 Most useful construction comes from a Hadamard matrix of
size M/2 by M/2, by taking it’s row vectors and all of their
complements.

Coding and Crypto Lab 7/16

Hadamard Matrix

 We will discuss sometime later on Hadamard

matrices in terms of
Definition
Famous Construction
Existence Problem
etc

Coding and Crypto Lab 8/16

 Simplex Bound

 Is there any fundamental limit on these off-diagonal terms ?

 Yes, there is. It is called “Simplex Bound,” which gives a lower bound
(over all possible signal sets) on the maximum of all off-diagonal terms.
 For any constant energy M-ary signal set S, we have

over all

min max ij 
i j
 1
M 1
.
possible
S

 For any constant energy M-ary signal set S,


all i  j
ij   M

Equality == Optimum in the sense of average correlation

Coding and Crypto Lab 9/16

Simplex Bound – detail (1)

 We will consider a set S of M (constant energy) vectors of

length M.

 Can you find the set S so that its max ij is smaller than or
equal to max ij ' of all other set S’ ?

 We say that such a signal set attains the minimum of max ij
over all S.

 Can we determine such a minimum beforehand ?

 Yes, we can, by the following:

Coding and Crypto Lab 10/16

 Simplex Bound – detail (2)

Let S be a given signal set containing

M complex vectors of unit energy.

That is, we assume that S  {1 ,  2 , ... ,  M }

where
 i  (ai1 , ai 2 , ai 3 , ... , aiM ), i  1,2,..., M
||  i ||2  ai1  ai 2  ai 3  ...  aiM  1, for all i  1,2,..., M
2 2 2 2

M
 ij  ai1a j1  ...  aiM a jM   aik a jk   i   j , i  j
 k 1
 M

 ii   aik 2   i   i  1
k 1
Coding and Crypto Lab 11/16

Simplex Bound – detail (3)

1 M M M 
max ij  ave ij 
i j i j

 
M ( M  1)  i 1 j 1
ij    
ii 
i 1 
1 M M 
   ( i   j )  M 
M ( M  1)  i 1 j 1 

1  M   M  
   i     j   M 
 

M ( M  1)   i 1   j 
 
1  M 2

 
M ( M  1) 
 i M 

i 1


1
0  M    1
M ( M  1) M 1
Coding and Crypto Lab 12/16
 Simplex Bound – detail (4)

 Note that
 ave    M ( M  1)  1   M

all i  j
ij  
all i  j  i  j ij  M 1

 Note that the equality holds if and only if

M 2
max ij  ave ij
i j i j
and 
i 1
i 0

This implies that This implies that

the component-wise sum of
max ij  ave ij  ij all the vectors in S must be 0.
i j i j

1
 for all i  j
M 1

Coding and Crypto Lab 13/16

M-ary Simplex Signals

 Dimension of signal space is M-1.
M-ary simplex signals can be constructed from an M-ary orthogonal signals.
(next pages)
Or, they can easily be constructed from a Hadamard matrix of size M by M
by removing a column consisting of all 1’s and re-scaling the energy of
each signal.
 Covariance matrix consists of all 1’s on the main diagonal and all
–1/(M-1)’s on the off-diagonal.
 It is proved that M-ary simplex gives the best SER performance
over all M-ary signals. It shows only a local optimum property
near very low and also very high SNR ranges.
There is a famous story of false proof that it is globally optimum in the
sense that it gives the best over all SNR range.

Coding and Crypto Lab 14/16

 M-ary Simplex Signals

 Let s m (t ), m  1,2, , M , be a set of M orthogonal signals,

i.e., T
0 sm (t ) sn (t )dt  0, mn
T
& Em  A2T   sm2 (t )dt  constant for all m
0
1
 Define: sm' (t )  sm (t ) 
M
 s (t )
k
k
for each m.

2
 
  1
Energy : s (t ) dt    sm (t )   sk (t )  dt
T 2 T
'
m
0 0
 M k 
T 2 1 
   sm2 (t )  sm (t ) sk (t )  2  s (t )s (t ) dt
k l
 M M 
0
k k ,l

2 1
 Em  Em  2 MEm
M M
 1  
 1   Em  Em'
 M

Coding and Crypto Lab 15/16

M-ary Simplex Signals

Correlation coefficeint for different n,m :
T '
0 sm (t ) sn (t )dt
'

T 1  1 
 0  s m (t )   sk (t )  sn (t )   sl (t ) dt
 M k  M l 
1 T  1 T  E
 0  0  s n (t )   s k (t ) dt  0  sm (t )   sl (t ) dt  m
M  k  M  l  M
1 1 E 1
 Em  Em  m   Em
M M M M
1 M 1
  Em'   Em'
M M 1 M 1

Orthoganal  Simplex
*
M -1 
E  E E'
M
1
xi , j  0  xi' , j   0
M 1
Coding and Crypto Lab 16/16
 Constant Envelope M-ary Signaling

송홍엽

Coding and Crypto Lab.

Dept. Electrical and Electronics Engineering
Yonsei university

Contents
 Coherent MPSK signal
 Performance of MPSK (coherent)
 ML detector
 SER (Symbol Error Rate)
 Bit Error Prob. vs. Symbol Error Prob.
 BER of MPSK with Gray Coding
 BPSK & QPSK have the same BER.
 MFSK (orthogonal)
 Vectorial View of MPSK & MFSK
 SER vs BER of ortho. MFSK
 Coherent detection of ortho. MFSK
 Non-coherent detection of ortho. MFSK

Copyright @ Hong-Yeop Song, Coding and Crypto Lab, Yonsei University 2/41
 Coherent MPSK

 Coherent MPSK signal : 2- dimensional

2E  2 
si (t )  cos  o t  i , 0t T i  1,2, , M
T  M 
2E  2i 2i 
  cos  cos  o t  sin  sin  o t 
T  M M 
Let 2
1 (t )  cos  o t and
T
2
1 (t )  sin  o t for 0  t  T
T
 T 2 2 T 1  cos 2 o t
  0 i (t )dt  0 dt  1
 T 2
 & T 1 (t ) 2 (t )dt  0
 0

Use these as basis functions of the 2-dimensional signal space.

Copyright @ Hong-Yeop Song, Coding and Crypto Lab, Yonsei University 3/41

Coherent MPSK

2i 2i M  4  2 2 : 4PSK or QPSK

si (t )  E cos  1 (t )  E sin   2 (t )
M M
M  8  23 : 8PSK
ai1 ai 2
M  16  2 4 : 16PSK
s i  ai1 , ai 2 , i  1,2, , M 

Copyright @ Hong-Yeop Song, Coding and Crypto Lab, Yonsei University 4/41
 Coherent MPSK

Bit stream s1 (t ) si (t )
s 2 (t ) for each m bits

s M (t )

 binary equally-likely => M=2m ary equally-likely

 “m-bit” is called a “symbol”
1
 (symbol rate) =  (bit rate)
m
1 Rb
or Rs   Rb 
m log 2 M
 R  1 and R  1
s b
Ts Tb
 Ts  m  Tb  log 2 M   Tb

Copyright @ Hong-Yeop Song, Coding and Crypto Lab, Yonsei University 5/41