Channel Equal Is at Ion
Channel Equal Is at Ion
Introduction
In the previous lecture, we used the Channel Equalisation problem of Telecommunication as a motivating example. Here we further explore this application.
The Problem
We transmit data (drawn for a finite alphabet say 1) over a communication channel. During transmission, the data is corrupted by (i) dispersion due to the channel (i.e., neighbouring symbols interfer) (ii) noise
Communications Channel
yk = g0uk d + g1uk d 1 + K + gl uk d l + k
0 K K 0 1 A= ; O 1 0 C = [0K 0 g0 K gl ] { 1 24 4 3
d 1 l +1
1 0 B= M M
Special feature of our case: uk Finite Set Use a Rolling Horizon constrained state estimator. Note: Closed Form solutions available as for the control problem particularly simple for N = 1.
Special Case; N = 1, R 0
u constrained to (finite alphabet)
u N d | N = q {}
where
= g1 y N g1u N d 1| N 1 K gl u N d l| N 1 0
This optimal Receding Horizon solution is actually used extensively in practice. (Called Decision Feedback Equalizer)
Centre for Complex Dynamic Systems and Control
Diagrammatic Form
1/g0
N/L G(q)
Recall that this circuit was introduced on: Day 1: Lecture 2. We now see that it is a special case of receding horizon finite alphabet estimation.
Centre for Complex Dynamic Systems and Control
Example 1
Here we recall the results presented in the second lecture on Day 1.
yk = uk 1.7uk 1 + 0.72uk 2 + nk
uk , uk
10
15
20
25
Figure: Data uk (circle-solid line) and estimate uk (triangle-solid line) using 2 the DFE. Noise variance: = 0.1.
Centre for Complex Dynamic Systems and Control
uk , uk
10
15
20
25
Figure: Data uk (circle-solid line) and estimate uk (triangle-solid line) using 2 the DFE. Noise variance: = 0.2.
Centre for Complex Dynamic Systems and Control
uk , uk
10
15
20
25
Figure: Data uk (circle-solid line) and estimate uk (triangle-solid line) using the moving horizon two-step estimator. Noise variance: 2 = 0.2.
Centre for Complex Dynamic Systems and Control
8 Example 2
H (z ) = 1 + 2z 1 + 2z 2 .
(1)
In order to illustrate the performance of the multistep optimal equaliser presented, we carry out simulations of this channel with an input consisting of 10000 independent and equiprobable binary digits drawn from the alphabet U = {1, 1}. The system is affected by Gaussian noise with different variances.
The following detection architectures are used: direct quantisation of the channel output, decision feedback equalisation and moving horizon estimation, with parameters (L1 , L2 ) = (1, 2) and also with (L1 , L2 ) = (2, 3).
10
10
10
12
14
9 Conclusions
In this lecture we have presented an approach that addresses estimation problems where the decision variables are constrained to belong to a nite alphabet.