The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The Bit-Flipping (BF) algorithm is considered as a hard decoding method for LDPC codes. It is much simpler than the probabilistic methods like Sum Product Algorithm (SPA), and can be efficiently implemented by electronic circuits. In this paper, we propose a new Bit Flipping algorithm for Low-Density Parity-Check codes (LDPC) called Single Bit-Flipping (SBF). Compared to the Gallager Bit-Flipping...
The compact genetic algorithm cGA is used in this paper to design an efficient soft-decision decoding algorithm, especially for the cyclic codes, because the cGA dramatically reduces the population's size and rapidly converges to the optimal solution compared to classical genetic algorithms. Our main contribution is to exploit the cyclic property of cyclic linear codes to reduce the complexity of...
The standard compact Genetic Algorithm uses competition between two individuals for which we calculate the objective function and the winner will be the one who gives the best value of this function. This work presents a new approach of compact Genetic Algorithm that uses more than just two vectors of competition; it introduces tournament selection with larger size using mutation. We apply this algorithm...
Selection pressure controls the selection of individuals from one population to the next. It gives individuals of higher quality, higher probability of being used to create the next generation, and so for the algorithm to focus on promising regions in the search space. This paper introduces higher selection pressure to soft-decision decoding based on compact Genetic Algorithms(cGAD), and shows the...
Hybrid ARQ is defined as the joint use of a retransmission protocol ARQ and forward error coding (FEC) at the transmitter and/or receiver. We will focus on the HARQ-type-II protocols, namely type-II-CC (Chase Combining) characterized by a storage and combination of erroneous packets, and the type-II-IR (Incremental Redundancy) which provides an Incremental Redundancy strategy that helps to increase...
This paper proposes a new STBC MIMO detector based on Genetic Algorithms (GA) that can approach the performances of an optimal detector based on the maximum likekihood dtector (MLD). This detector is a hybridization between the GA and a linear detector such as ZF or MMSE detector. The optimization of the parameters of the GA can significantly improve performances. Our detector was compared with other...
In this paper, we present a new hard-decision decoding technique based on Genetic Algorithms, which is applicable to the more general case where the only known structure is given by the parity-check matrix H. The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding...
Genetic algorithms have been used successfully for solving different combinatorial optimization problems. We give here an efficient algorithm for the search of good double-circulant codes. The algorithm presented is intended to generate a double-circulant code with maximum minimum distance for each length. Some results are presented and validated by exact method, others promising results are also...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.