List 3

advertisement
AdaptiveandArraySignalProcessing/Processamento de Sinais Adaptativo
CETUC/PUC-Rio - Prof. Rodrigo de Lamare
Tutorial Questions/Lista de Exercícios - 3
1. Consider a Wiener filtering problem characterised as follows: The correlation matrix 𝑹 of the
input data vector 𝒙[𝑖] is
1 0.5
𝑹=[
]
0.5 1
The cross-correlation vector 𝒑between 𝒙[𝑖]and the desired signal 𝑑[𝑖] is
0.5
𝒑=[
]
0.25
a) Compute the Wiener filter using both analytical and numerical values.
b) What is the minimum mean-squared error produced by this Wiener filter?
c) Write down a representation of the Wiener filter in terms of eigenvalues of 𝑹 and associated
eigenvectors.
2. The minimum mean-square error (MMSE) of a linear filter is defined by
𝑀𝑀𝑆𝐸 = πœŽπ‘‘2 − 𝒑𝐻 𝑹−1 𝒑,
whereπœŽπ‘‘2 is the variance of the desired response 𝑑[𝑖], 𝑹 is the correlation matrix of the input
𝒙[𝑖], and 𝒑 is the cross-correlation vector between 𝒙[𝑖]and 𝑑[𝑖]. By applying the unitary
similarity transformation to the inverse of the correlation matrix, 𝑹−1 , show that
2
𝑀𝑀𝑆𝐸 = πœŽπ‘‘2 − ∑𝑁
π‘˜=1
|π’’π‘˜ 𝐻 𝒑|
πœ†π‘˜
,
whereπœ†π‘˜ is the kth eigenvalue of the correlation matrix 𝑹, and π’’π‘˜ is the corresponding
eigenvector.
3. Consider the design of a three-step predictor using a first order filter in which the observed
signal π‘₯[𝑖] is the input to the filter π’˜, which generates the following minimum mean-square
estimate of π‘₯[𝑖 + 3]:
π‘₯Μ‚[𝑖 + 3] = 𝑀0 π‘₯[𝑖] + 𝑀1 π‘₯[𝑖 − 1]
a) What are the Wiener-Hopf equations for the three-step predictor?
b) If the values of 𝑝π‘₯ [𝑖] for lags 𝑖 = 0 and 𝑖 = 4 are 𝑝π‘₯ [𝑖] = [1, 0, 0.1, −0.2, −0.9, 0.2]𝑇 find
the optimum three-step predictor.
c) Compute the Wiener-Hopf equations and the optimum three-step predictor for the same
values above using a second-order filter. Compare the mean-square error of the first-order
and the second-order filters.
4. Consider a multi-antenna wireless communications system using N transmit and receive
antennas as described below
𝒔̂
𝒔
Tx
Rx
This system can be modelled by a simple linear equation given by
𝒓 = 𝑯𝒔 + 𝒏 ,
where 𝑯 is the N x N channel matrix, 𝒔 is the N x 1 vector of data symbols and 𝒏 is the N x 1
noise vector. The elements of the matrix 𝑯 are randomly generated using a complex Gaussian
variable with zero mean and unit variance. The vector 𝒔contains binary-phase shift-keying (BPSK)
symbols that are randomly generated from a discrete random variable with zero mean, variance
πœŽπ‘ 2 and its entries are independent and identically distributed (i.i.d.). The vector 𝒏is a complex
Gaussian random vector with zero mean and variance πœŽπ‘›2 . The vectors 𝒔and𝒏are assumed to be
statistically independent.
a) Design a Wiener filter π’˜ to perform linear equalisation on the received data𝒓,and write
down the Wiener-Hopf equations.
b) Compute the minimum mean-square error of the Wiener filter.
c) Write a down a simulation code of a multi-antenna system that transmits packets of data
between the Tx and the Rx and measure the bit error rate (BER) performance against the
signal-to-noise ratio (SNR) defined by 𝑆𝑁𝑅 = π‘πœŽπ‘ 2 /πœŽπ‘›2 . Plot a curve showing the BER
against the SNR for values of SNR between 0 and 20 dB.
Download