MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm reading a paper [R1] where the authors propose a MAP estimator of the phase noise and frequency offset. However equation (17), which I reproduce below, represents a challenging step and I would appreciate any help on how this equality is achieved

\begin{align} \sum_{\bar{c}}p(\bar{c})\exp\left(\frac{2}{\sigma^2}\Re\left(\bar{r}^*\bar{c}e^{j\bar{\phi}}\right)\right)=\\ \prod_{k=1}^N\cosh\left(\frac{\lambda_k}{2}+\frac{2}{\sigma^2}\Re\left(r_k^*e^{j\phi_k}\right)\right) \end{align}

We can use the a priori information to calculate $p(\bar{c})$. For binary phase shift keying (BPSK), the a priori probabilities probabilities of each bit found by its log-likelihood ratio (LLR) in the previous iteration ($i-1$), can be expressed as

\begin{equation} p(c_n=1|\bar{z}^{(i-1)})=\frac{e^{\lambda_n}}{1+e^{\lambda_n}}, \end{equation}

\begin{equation} p(c_n=-1|\bar{z}^{(i-1)})=\frac{1}{1+e^{\lambda_n}}. \end{equation}

For BPSK, the decoder provides the LLR for each coded bit which is defined as $\lambda_n=\ln\frac{Pr(c_n=1|z_n)}{Pr(c_n=-1|z_n)}$ where $c_n$ is the $n$-th BPSK modulated symbol and $z_n$ is the corresponding equalizer output.

Note that $\bar{x}=[x_1,\ldots,x_N]$ and $\Re(\cdot)$ is the real part of a complex number.

[R1] Sabbaghian, M.; Falconer, D.; , "Joint Turbo Frequency Domain Equalization and Carrier Synchronization," Wireless Communications, IEEE Transactions on , vol.7, no.1, pp.204-212, Jan. 2008 doi: 10.1109/TWC.2008.060451 URL:

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.