Broadcast Channels With Cooperating Decoders

We consider the problem of communicating over the general discrete memoryless broadcast channel (DMBC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite capacities, prior to decoding the messages sent from the transmitter. In this paper, we formulate the general problem of broadcast with cooperation. We first find the capacity region for the case where the BC is physically degraded. Then, we give achievability results for the general broadcast channel, for both the two independent messages case and the single common message case     

Inherent limitations in data-aided time synchronization ofcontinuous phase-modulation signals over time-selective fading channels

Time synchronization of continuous phase modulation (CPM) signals over time selective, Rayleigh fading channels is considered. The Cramer-Rao lower bound (CRLB) for this problem is studied for data-aided (DA) synchronization (i.e., known symbol sequence transmission) over a time-selective Rayleigh fading (i.e., Gaussian multiplicative noise) channel. Exact expressions for the bound are derived as well as simplified, approximate forms that enable derivation of a number of properties that describe the bound's dependence on key parameters such as signal-to-noise ratio (SNR), channel correlation, sampling rate, sequence length, and sequence choice. Comparison with the well-known slow fading (i.e., constant) channel bound is emphasized. Further simplifications are obtained for the special case of minimum phase keying (MSK), wherein it is shown how the bound may be used as a sequence design tool to optimize synchronization performance     

Low complexity estimation of carrier and sampling frequency offsets in burst‐mode OFDM systems

We study communications under slowly varying channels, and consider three cases of knowledge of the channel impulse response (CIR): full knowledge, no knowledge, and partial knowledge of the CIR. By partial knowledge, we refer to knowing only either the CIR magnitudes or the CIR phases. It is known that obtaining the exact joint maximum‐likelihood estimate (MLE) of the CFO and the SFO requires a two‐dimensional search. Here, we present a new estimation method which uses the Taylor expansion of the MLE cost function, combined with the best linear unbiased estimator, to obtain a method which does not require such a search. The computational complexity of the new method is evaluated. Numerical simulations demonstrate that the new method approaches the corresponding Cramér‐Rao bound for a wide range of signal‐to‐noise ratios, and has superior performance compared to all other existing methods for approximating the solution for the joint MLE, while maintaining a low computational complexity. Copyright © 2015 John Wiley & Sons, Ltd.     

Training-based time-delay estimation for CPM signals over time-selective fading channels

In this paper, we consider training-based symbol timing synchronization for continuous phase modulation over channels subject to flat, Rayleigh fading. A high signal-to-noise-ratio maximum-likelihood estimator based on a simplified channel correlation model is derived. The main objective is to reduce algorithm complexity to a single-dimensional search on the delay parameter, similar to that of the static-channel (slow fading) estimator. The asymptotic behavior of the algorithm is evaluated, and comparisons are made with the Cramer-Rao lower bound for the problem. Simulation results demonstrate highly improved performance over the conventional, static-channel delay estimator.