检索结果-内蒙古大学图书馆

4th International Conference on Advanced Communication Technologies and Networking (CommNet)

作者： Ayoub, Fouad Hilia, Mustapha El Bouanani, Faissal Chergui, Mohamed Ibrahimi, Khalil LaREAMI Lab Dept Comp Sci Kenitra Morocco Ibn Tofail Univ LaRI Lab Kenitra Morocco Mohammed V Univ Rabat Rabat Morocco LaREAMI Lab Dept Math Kenitra Morocco

ISBN: (纸本)9781665403061

In this paper, we investigate the impact of cyclic One-Step Majority-Logic Decodable (osmld) Product codes, when decoded with the Iterative Threshold decoding algorithm, proposed by [2]. We propose to evaluate Hybrid Automatic Repeat Request (HARQ) Protocols using these attractive codes. The idea behind this study is to prove the attracting ARQ/FEC scheme offered by the proposed codes, and to show that we can reach a good trade-off between error rates, the average throughput and complexity. Numerical results shows that the proposed scheme may be interesting to compete many concatenated schemes applied to HARQ protocols.

关键词： Hybrid ARQ LDPC codes osmld codes Product codes Iterative decoding Chase Combining

来源：评论

学校读者我要写书评

暂无评论

Mixed RF/FSO SWIPT-Based OSLMD Coded AF Cooperative Communication System: Performance Analysis

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING

引用

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING 2023年第1期7卷 84-100页

作者： Labghough, Souad Ayoub, Fouad El Bouanani, Faissal Belkasmi, Mostafa Qaraqe, Khalid A. Mohammed V Univ ENSIAS Coll Engn Rabat 10500 Morocco Dept Comp Sci CRMEF Kenitra Kenitra 14000 Morocco Texas A&M Univ Qatar Dept Elect & Comp Engn Doha Qatar

In this paper, the performance analysis of simultaneous wireless information and power transfer (SWIPT) using time switching (TS) protocol-based amplify-and-forward (AF) dual-hop mixed radio-frequency/free-space optic (RF/FSO) coded and uncoded communication system (CC and UC) is investigated. Specifically, we look at using the One-Step Majority-Logic Decodable (osmld) codes at the source and a majority logic decoding algorithm (MLGD) at the destination, jointly with the use of maximal-ratio combining and SWIPT/TS techniques at the relay. Furthermore, the RF link undergoes Nakagami-m model, while the second-hop is subject to Maalaga-M atmospheric turbulence with the effect of pointing errors. Closed-form and asymptotic formulations for the average bit error probability (ABEP) are obtained in terms of the system parameters for both CC and UC scenarios in addition of the average channel capacity analysis. Computer-based Monte Carlo simulations were used to numerically validate all of the obtained mathematical formulations. Expectedly, it is shown that significant coding gains are achieved using osmld codes in comparison with UC. In addition, above a specific threshold of energy efficiency, the system performance gets steady in the high signal-to-noise-ratio regime. Moreover, the decoding method used in this work has been shown to be suitable for the SWIPT/TS-assisted RF/FSO coded AF cooperative communication system where high performance alongside low computational complexity are required.

关键词： Average bit error probability Malaga-M channels Maximal-Ratio Combining (MRC) mixed RF/FSO system MLGD decoding Nakagami-m fading channels osmld codes

来源：评论

学校读者我要写书评

暂无评论

Construction of Cyclic One-Step Majority-Logic Decodable codes using Genetic Algorithms

Construction of Cyclic One-Step Majority-Logic Decodable Cod...

引用

International conference on wireless networks and mobile communications

作者： Yatribi, Anouar Ayoub, Fouad Belkasmi, Mostafa Mohammed V Univ SIME Lab TSE Team ENSIAS Rabat Morocco CRMEF LaREAMA Lab MTIC Team Kenitra Morocco

ISBN: (纸本)9781467382243

In [6], a construction of cyclic one-step majoritylogic decodable codes based on idempotent polynomials is given. However, the search for the feasible Parity-Check Idempotent runs through all possible combinations of cyclotomic cosets modulo n, satisfying some algebraic constraints, consequently, increasing the code length may result in very large dimension space search, and the search for the solution becomes more difficult. In this paper, we propose a Genetic Algorithm that aimes to construct new moderate and high lengths Binary Cyclic osmld codes, considered as LDPC codes, with high correction capacities. Our construction is very efficient and provide codes with high lenghts and high rates.

关键词： Channel coding cyclic LDPC codes osmld codes DS codes cyclotomic cosets parity-check idempotent genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Construction and Iterative Threshold Decoding for Low Rates Quasi-Cyclic One Step Majority Logic Decodable codes

Construction and Iterative Threshold Decoding for Low Rates ...

引用

International Conference on Advanced Communication Systems and Information Security (ACOSIS)

作者： Rkizat, Karim Lahmer, Mohammed Belkasmi, Mostafa Nouh, Said Mohammed V Univ ENSIAS Rabat Morocco Moulay Ismail Univ High Sch Technol Meknes Morocco Univ Hassan II Casablanca Fac Sci Ben Msik Casablanca Morocco

ISBN: (纸本)9781509062270

This paper investigates the construction and iterative threshold decoding of low rate Quasi-Cyclic One Step Majority logic codes based on combinatorial designs. These codes are constructed with two type of difference family: cyclic disjoint difference sets and cyclic disjoint difference family. They can be encoded with low complexity, and perform very well when decoded with the Iterative threshold decoding (ITD) algorithm. We present an amelioration of ITD algorithm for decoding these codes. This algorithm modification can be applicable for every code rate. The performances of this algorithm for decoding these codes on Additive White Gaussian Noise (AWGN) channel, is investigated.

关键词： Iterative threshold decoding Quasi-Cyclic codes osmld codes Majority logic decoding Difference family Difference set

来源：评论

学校读者我要写书评

暂无评论

Iterative Threshold Decoding of Quasi-Cyclic One Step Majority Logic Decodable codes 5

Iterative Threshold Decoding of Quasi-Cyclic One Step Majori...

引用

5th World Congress on Information and Communication Technologies (WICT)

作者： Rkizat, Karim Lahmer, Mohammed Belkasmi, Mostafa Mohammed V Rabat Univ Labo SIME Team TSE ENSIAS Rabat Morocco Moulay Ismail Univ High Sch Technol Meknes Morocco

ISBN: (纸本)9781467387125

This paper presents a new class of Quasi-Cyclic One Step Majority logic codes of 1/2 rate constructed from perfect difference set. Theses codes can be encoded with low complexity, and perform very well when decoded with the Iterative threshold decoding algorithm. Much of these codes is a subfamily of the LDPC codes and can be decoded using belief propagation algorithm. A comparison between our results and those for LDPC code in terms of BER performance are presented.

关键词： Iterative threshold decoding Quasi-Cyclic codes osmld codes Majority logic decoding

来源：评论

学校读者我要写书评

暂无评论

Non-Binary Cyclic Majority-Logic Decodable codes: an Algebraic Construction by using Genetic Algorithms

Non-Binary Cyclic Majority-Logic Decodable codes: an Algebra...

引用

International Conference on Advanced Communication Systems and Information Security (ACOSIS)

作者： Yatribi, Anouar Belkasmi, Mostafa Ayoub, Fouad M'rabet, Zakaria Mohammed V Univ ENSIAS SIME Lab TSE Team Rabat Morocco CRMEF LaREAMA Lab MTIC Team Kenitra Morocco

ISBN: (纸本)9781509062270

In this paper, the construction of non binary cyclic One-Step Majority-Logic decoding codes from the dual domain and idempotents is investigated. This had led us to propose a new design algorithm based on Genetic Algorithms, as an extension to previous works on the binary field. With the proposed algorithm, we were able to obtain long new non-binary cyclic osmld codes with high coding rates and good correction capacities. In fact, two powerful properties of the algebraic construction are provided, firstly, the designed codes have their minimal distances and dimensions calculated analyticaly, secondly, they can be decoded with a low-complexity majority-voting decoding scheme.

关键词： osmld codes finite fields cyclotomic cosets idempotents Mattson-Solomon non-binary LDPC codes algebraic code design Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Gradient-descent decoding of one-step majority-logic decodable codes

引用

PHYSICAL COMMUNICATION 2020年 39卷 100999-100999页

作者： Yatribi, Anouar Belkasmi, Mostafa Ayoub, Fouad Mohammed V Univ Rabat ENSIAS ICES Team Rabat Morocco CRMEF K LaREAMI Lab ERIATC Team Kenitra Morocco

In this paper, a new low-complexity gradient-descent based iterative majority-logic decoder (GD-MLGD) is proposed for decoding One-Step Majority-Logic Decodable (osmld) codes. We give a formulation of the decoding problem of binary osmld codes, as a maximization problem of a derivable objective function. The optimization problem is solved using a pseudo gradient-descent algorithm, which performs iteratively an update towards the optimal estimated codeword been transmitted, based on the first-order partial derivatives of each variable calculated in the previous iteration. The proposed decoding scheme achieves a fast convergence to an optimum codeword compared to other decoding techniques reviewed in this paper, at the cost of lower computational complexity. The quantized version (QGD-MLGD) is also proposed in order to further reduce the computational complexity. Simulation results show that the proposed decoding algorithms outperform all the existing majority-logic decoding schemes, and also various gradient-descent based bit-flipping algorithms, and performs nearly close to the belief propagation sum-product (BP-SP) decoding algorithm of LDPC codes, especially for high code lengths, providing an efficient trade-off between performance and decoding complexity. Moreover, the proposed quantized algorithm has shown to perform better than all the existing decoding techniques. The proposed decoding algorithms have shown to be suitable for ultra reliable, low latency and energy-constrained communication systems where both high performances and low-complexity are required. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Iterative majority-logic decoding osmld codes Difference-set codes Finite geometry LDPC codes Gradient-descent decoding Maximum likelihood decoding Decoding complexity AWGN channels

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：