FKFarbod Kayhan

Farbod Kayhan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Farbod Kayhan has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Constellation Design for Transmission over Nonlinear Satellite Channels

    by Farbod Kayhan, Guido Montorsi

    In this paper we use a variation of simulated annealing algorithm for optimizing two-dimensional constellations with 32 signals. The main objective is to maximize the symmetric pragmatic capacity under the peak-power constraint. The method allows the joint optimization of constellation and binary labeling. We also investigate the performance of the optimized constellation over nonlinear satellite channel under additive white Gaussian noise. We consider the performance over systems with and without pre-distorters. In both cases the optimized constellations perform considerably better than the conventional Amplitude Phase Shift Keying (APSK) modulations, used in the current digital video broadcasting standard (DVB-S2) on satellite channels. Based on our optimized constellations, we also propose a new labeling for the 4+12+16-APSK constellation of the DVB-S2 standard which is Gray over all rings.

  • Open Access

    Constellation Design for Channels Affected by Phase Noise

    by Farbod Kayhan, Guido Montorsi

    In this paper we optimize constellation sets to be used for channels affected by phase noise. The main objective is to maximize the achievable mutual information of the constellation under a given power constraint. The mutual information and pragmatic mutual information of a given constellation is calculated approximately assuming that both the channel and phase noise are white. Then a simulated annealing algorithm is used to jointly optimize the constellation and the binary labeling. The performance of optimized constellations is compared with conventional constellations showing considerable gains in all system scenarios.

  • Open Access

    Efficient LDPC Codes over GF(q) for Lossy Data Compression

    by Alfredo Braunstein, Farbod Kayhan, Riccardo Zecchina

    In this paper we consider the lossy compression of a binary symmetric source. We present a scheme that provides a low complexity lossy compressor with near optimal empirical performance. The proposed scheme is based on b-reduced ultra-sparse LDPC codes over GF(q). Encoding is performed by the Reinforced Belief Propagation algorithm, a variant of Belief Propagation. The computational complexity at the encoder is O(.n.q.log q), where is the average degree of the check nodes. For our code ensemble, decoding can be performed iteratively following the inverse steps of the leaf removal algorithm. For a sparse parity-check matrix the number of needed operations is O(n).