19.11.2014 Views

mohatta2015.pdf

signal processing from power amplifier operation control point of view

signal processing from power amplifier operation control point of view

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

PROBLEMS 147<br />

the channel to minimum phase without changing the noise correlation properties<br />

[Cla87, Abr98, Ger02b]. In [Bal97], to address stability concerns with the all-pass<br />

filter, the channel is converted to maximum phase and the M-algorithm is used to<br />

process the data backwards in time. Even without prefiltering, processing the data<br />

in time reverse can be helpful [Mcg97].<br />

For the purely MIMO scenario, an iterative clustering approach has been explored,<br />

in which higher-order modulations are approximated with a few centroids<br />

in the earliest iterations [Rup04, Jon05, Cui05, Agg07, Jia08].<br />

There has also been work on assisted MLD (AMLD), in which simpler equalization<br />

approaches are used to initially prune the search space [Fan04, Lov05, Nam09].<br />

Many of these approaches are based on a form of Chase decoding [Cha72], in which<br />

soft bit magnitudes are used to identify which bits need to be left undecided in the<br />

pruning process. Multistage group detection forms of AMLD have been developed.<br />

In serial forms, symbols are added to a single group one at a time, with pruning<br />

after each addition [Kan04, Jia05]. In a parallel form, group detection is applied to<br />

small groups, followed by pruning before combining small groups into larger groups<br />

with additional pruning [BotlOb].<br />

As for sub-block forms, sub-block DFE is described in [WÍ192]. Sub-block LE<br />

can be found in [Bot08]. An approximate MLSD form uses MLSD per user with<br />

coupling [MilOl].<br />

PROBLEMS<br />

The idea<br />

6.1 Consider the Alice and Bob example. Suppose instead that n = — 1 and<br />

r 2 = 4. Assume «o is unknown.<br />

a) Form a table of metrics for all combinations of SQ, SI and «2-<br />

b) Which metric is best? What is the detected sequence?<br />

6.2 Consider the Alice and Bob example. Suppose instead that n = — 1 and<br />

r-i = 4. Assume s () = +1.<br />

a) Form a table of metrics for all combinations of s\ and β2·<br />

b) Which metric is best? What is the detected sequence?<br />

6.3 Consider the Alice and Bob example. Suppose instead that r\ is missing and<br />

r 2 = 4.<br />

a) Form a table of metrics for all combinations of si and si.<br />

b) Which metric is best? What is the detected sequence?<br />

More details<br />

6.4 Consider the Alice and Bob example. Suppose instead that r\ = — 1 and<br />

Γ2 = 4. Assume s» = +1. Consider the MLSD tree.<br />

a) What are the two path metrics after processing ri?<br />

b) What are the four path metrics after processing Γ2?<br />

c) Which metric is best? What is the detected sequence?

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!