<< Chapter < Page Chapter >> Page >

The direct calculation of d x ( k T s ) d θ as a filtered version of [link] is only one way to calculate the derivative. Replace this using a numericalapproximation (such as the forward or backward Euler, or the trapezoidal rule). Compare the performance of your algorithmto plldd.m .

Consider the DD phase tracking algorithm when the message alphabet is binary ± 1 .

  1. Modify plldd.m to simulate this case.
  2. Modify plldderrsys.m to draw the error surface. Is the DD algorithm better (or worse) suited to the binarycase than the 4-PAM case?

Consider the DD phase tracking algorithm when the message alphabet is 6-PAM.

  1. Modify plldd.m to simulate this case.
  2. Modify plldderrsys.m to draw the error surface. Is the DD algorithm better (or worse) suited to 6-PAM than to 4-PAM?

What happens when the number of inputs used to calculate the error surface is too small? Try N = 100 , 10 , 1 . Can N be too large?

Investigate how the error surface depends on the input signal.

  1. Draw the error surface for the DD phase tracking algorithm when the inputs are binary ± 1 .
  2. Draw the error surface for the DD phase tracking algorithm when the inputs are drawn from the 4-PAMconstellation, for the case in which the symbol - 3 never occurs.

TRUE or FALSE: Decision-directed phase recovery can exhibit local minimaof different depths.

This problem uses the B 3 I G to test the carrier recovery algorithm of your choice.

  1. Currently, the receiver portion of the script in BigIdeal.m “knows” the phase of the carrier. Add a carrier recovery algorithm of your choice to BigIdeal.m so that the receiver can accommodate unknown carrier phases. Run the modified code and usethe carrier recovery algorithm to estimate the phase offset Φ . State the carrier recovery method used and plot the tracking of Φ . If the receiver employs preprocessing, take care to design the BPF appropriately.
  2. Modify the B 3 I G so that a phase offset is introduced. In BigTransmitter.m , set the variable phi=-0.5 , and add a phase offset x_rf=x.*cos(2*pi*rfParams.f_if_tx*... [1:length(x)]'*rfParams.T_t_tx/M+p_noise+phi); where upconversion is performed. Rerun the code. How does the behavior of your algorithm differ?Include plots to justify your claim.
  3. Repeat part (b) for the case when phi=1.2 .

Frequency tracking

The problems inherent in even a tiny difference in the frequency of the carrier at the transmitterand the assumed frequency at the receiver are shown in [link] and illustrated graphically in [link] . Since no two independent oscillators are ever exactlyaligned, it is important to find ways of estimating the frequency from the received signal. The direct methodof "Direct Frequency Estimation" derives an algorithm based on a performance function that usesa square difference in the time domain. Unfortunately, this does not work well, and its failure can be traced tothe shape of the error surface.

"Indirect Frequency Estimation" begins with the observation (familiar from [link] and [link] ) that the estimates of phase made by the phase tracking algorithmsover time lie on a line whose slope is proportional to the difference in frequency between the modulating and the demodulating oscillators.This slope contains valuable information that can be exploited to indirectly estimate the frequency.The resulting dual-loop element is actually a special case of a more general (and ultimately simpler) technique that puts anintegrator in the forward part of the loop in the PLL. This is detailed in "Generalized PLL" .

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Software receiver design. OpenStax CNX. Aug 13, 2013 Download for free at http://cnx.org/content/col11510/1.3
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Software receiver design' conversation and receive update notifications?

Ask