Low-Density-Parity-Check (LDPC) codes are a cornerstone for achieving robust error correction capabilities in 5G New Radio applications, significantly improving the reliability of data transmission across noisy and unpredictable wireless channels. Since an evaluation and discussion of the performance with channel coding is significantly absent in two-dimensional Index Modulation (IM)-Differential Chaos Shift Keying (DCSK) schemes. Therefore, in this study, the 5G new radio LDPC codes based generalized joint subcarrier-time index modulation DCSK system (5G NR-LDPC-GJSTIM-DCSK) is proposed, where 5G NR-LDPC codes are used as channel coding. The aim is to improve the system’s performance specifically across AWGN (additive white gauss

The poor hole cleaning efficiency could causes many problems such as high torque, drag, poor hydraulics and pipe stuck. These inherent problems result in an avoidable high operation cost which this study tried to address.  In this study, the effect of cutting density on hole cleaning efficiency in deviated and horizontal wells was investigated. Experiments were conducted using 40 feet (12 m) long of flow loop made from iron and PVC. However, the test section was made from PVC with (5.1m) long and (4” ID) for outer pipe and (2” OD) inner pipe. The cutting transport ratio (CTR) was determined from weight measurements for each test. Cutting Transport Ratio has been investigated for effects of the following parameters; flow rate, cu

Key generation for data cryptography is vital in wireless communications security. This key must be generated in a random way so that can not be regenerated by a third party other than the intended receiver. The random nature of the wireless channel is utilized to generate the encryption key. However, the randomness of wireless channels deteriorated over time due to channel aging which casing security threats, particularly for spatially correlated channels. In this paper, the effect of channel aging on the ciphering key generations is addressed. A proposed method to randomize the encryption key each coherence time is developed which decreases the correlation between keys generated at consecutive coherence times. When compared to the

Evolutionary algorithms are better than heuristic algorithms at finding protein complexes in protein-protein interaction networks (PPINs). Many of these algorithms depend on their standard frameworks, which are based on topology. Further, many of these algorithms have been exclusively examined on networks with only reliable interaction data. The main objective of this paper is to extend the design of the canonical and topological-based evolutionary algorithms suggested in the literature to cope with noisy PPINs. The design of the evolutionary algorithm is extended based on the functional domain of the proteins rather than on the topological domain of the PPIN. The gene ontology annotation in each molecular function, biological proce

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).