Search

Your search keyword '"Mheich, Zeina"' showing total 20 results
Start Over Author "Mheich, Zeina" Publication Year Range Last 10 years
20 results on '"Mheich, Zeina"'

1. Power-Imbalanced Low-Density Signatures (LDS) From Eisenstein Numbers

Author

Liu, Zilong, Xiao, Pei, and Mheich, Zeina

Subjects
Computer Science - Information Theory, Electrical Engineering and Systems Science - Signal Processing
Abstract

As a special case of sparse code multiple access (SCMA), low-density signatures based code-division multiple access (LDS-CDMA) was widely believed to have worse error rate performance compared to SCMA. With the aid of Eisenstein numbers, we present a novel class of LDS which can achieve error rate performances comparable to that of SCMA in Rayleigh fading channels and better performances in Gaussian channels. This is achieved by designing power-imbalanced LDS such that variation of user powers can be seen both in every chip window and the entire sequence window. As LDS-CDMA is more flexible in terms of its backwards compatibility, our proposed LDS are a promising sequence candidate for dynamic machine-type networks serving a wide range of communication devices.

Published
2019

2. Optimized Rate-Adaptive Protograph-Based LDPC Codes for Source Coding with Side Information

Author

Ye, Fangping, Dupraz, Elsa, Mheich, Zeina, and Amis, Karine

Subjects
Computer Science - Information Theory
Abstract

This paper considers the problem of source coding with side information at the decoder, also called Slepian-Wolf source coding scheme. In practical applications of this coding scheme, the statistical relation between the source and the side information can vary from one data transmission to another, and there is a need to adapt the coding rate depending on the current statistical relation. In this paper, we propose a novel rate-adaptive code construction based on LDPC codes for the Slepian-Wolf source coding scheme. The proposed code design method allows to optimize the code degree distributions at all the considered rates, while minimizing the amount of short cycles in the parity check matrices at all rates. Simulation results show that the proposed method greatly reduces the source coding rate compared to the standard LDPCA solution., Comment: 25 pages, 7 figures, submitted to IEEE Transactions on Communications

Published
2018

3. Code-Aware Power Allocation for Irregular LDPC Codes

Author

Mheich, Zeina, Savin, Valentin, Akan, Ozgur, Series editor, Cao, Jiannong, Series editor, Coulson, Geoffrey, Series editor, Dressler, Falko, Series editor, Ferrari, Domenico, Series editor, Gerla, Mario, Series editor, Kobayashi, Hisashi, Series editor, Palazzo, Sergio, Series editor, Sahni, Sartaj, Series editor, Shen, Xuemin (Sherman), Series editor, Stan, Mircea, Series editor, Xiaohua, Jia, Series editor, Zomaya, Albert, Series editor, Bellavista, Paolo, Series editor, Noguet, Dominique, editor, Moessner, Klaus, editor, and Palicot, Jacques, editor

Published
2016
Full Text
View/download PDF

9. Construction de Codes LDPC Compatibles en Rendement pour le Codage de Sources avec Information Adjacente

Author

Ye, Fangping, Dupraz, Elsa, Mheich, Zeina, Amis Cavalec, Karine, Département Signal et Communications (IMT Atlantique - SC), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), Institut Mines-Télécom [Paris] (IMT)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL), Lab-STICC_IMTA_CACS_COM, Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-Institut Mines-Télécom [Paris] (IMT)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), and University of Surrey, United Kingdom (University of Surrey, United Kingdom)

Subjects
[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Abstract

National audience; Dans cette communication, nous nous intéressons au problème de codage de sources avec information adjacente au décodeur. Nous considérons le cas où le modèle statistique entre la source et l'information adjacente peut varier d'une transmission à l'autre. Pour construire un schéma de codage pratique pour ce problème, on peut utiliser des codes de type Low Density Parity Check (LDPC) compatibles en rendement. Nous proposons ici une nouvelle méthode de construction de codes LDPC compatibles en rendement pour le codage de sources avec information adjacente. Notre construction permet de réduire le nombre de cycles courts dans tous les codes utilisés aux différents débits, et montre ainsi un gain en performance appréciable par rapport aux solutions existantes.

Published
2019

20. Achievable Secrecy Rates for the Broadcast Channel With Confidential Message and Finite Constellation Inputs.

Author

Mheich, Zeina, Alberge, Florence, and Duhamel, Pierre

Subjects
*BROADCAST channels, *TELECOMMUNICATION channels, *GAUSSIAN processes, *TIME-sharing computer systems, *DISTRIBUTION (Probability theory)
Abstract

This paper considers the Broadcast Channel with Confidential Message (BCCM) where the sender attempts to send altogether a common message to two receivers and a confidential message to one of them. The achievable rate regions are derived for the power-constrained Gaussian BCCM with finite input alphabet using various transmission strategies. Namely, time sharing, superposition modulation and superposition coding are used as broadcast strategies. For superposition modulation and superposition coding, the maximal achievable rate regions are obtained by maximizing over both constellation symbol positions and the joint probability distribution. The maximization of the secrecy rate for wiretap channels is also studied as a particular case of the BCCM problem. We compare the considered transmission strategies in terms of percentage gains in achievable rates. We concentrate on the impact of the finite alphabet constraint on achievable rates, and show that this constraint may change well known results obtained in the Gaussian case. We show also that the secrecy constraint can change the shape of the achievable rate region in superposition modulation used in some standards when symbols are equiprobable. On a more practical side, it is shown that a performance close to the optimum can be obtained by strategies with reduced complexity. [ABSTRACT FROM AUTHOR]

Published
2015
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results