Human values are the most important concepts that the interest of society has to relay on these conceptual values. Any society will not be stabilized unless adheres to the right principles and values, all nations need such principles and values to stabilize. If any society doesn’t implement the human values that monotheistic religions urges equality between human, the far the society from the religious principles, the less there would be valence between human. The valence is urgent necessity in the current time. The far people get away from values and principles, the more they lose their freedom and dignity, therefore individual has to live with dignity and respect through the adherence to these values and principles. Apparently, equal

This work presents the simulation of a Low density Parity Check (LDPC) coding scheme with
multiuserMulti-Carrier Code Division Multiple Access (MC-CDMA) system over Additive White
Gaussian Noise (AWGN) channel and multipath fading channels. The decoding technique used in
the simulation was iterative decoding since it gives maximum efficiency with ten iterations.
Modulation schemes that used are Phase Shift Keying (BPSK, QPSK and 16 PSK), along with the
Orthogonal Frequency Division Multiplexing (OFDM). A 12 pilot carrier were used in the estimator
to compensate channel effect. The channel model used is Long Term Evolution (LTE) channel with
Technical Specification TS 25.101v2.10 and 5 MHz bandwidth including the chan

MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix.   In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over  of length  and 28 have been found.

This work presents a comparison between the Convolutional Encoding CE, Parallel Turbo code and Low density Parity Check (LDPC) coding schemes with a MultiUser Single Output MUSO Multi-Carrier Code Division Multiple Access (MC-CDMA) system over multipath fading channels. The decoding technique used in the simulation was iterative decoding since it gives maximum efficiency at higher iterations. Modulation schemes used is Quadrature Amplitude Modulation QAM. An 8 pilot carrier were
used to compensate channel effect with Least Square Estimation method. The channel model used is Long Term Evolution (LTE) channel with Technical Specification TS 25.101v2.10 and 5 MHz bandwidth bandwidth including the channels of indoor to outdoor/ pedestrian

Several attempts have been made to modify the quasi-Newton condition in order to obtain rapid convergence with complete properties (symmetric and positive definite) of the inverse of  Hessian matrix (second derivative of the objective function). There are many unconstrained optimization methods that do not generate positive definiteness of the inverse of Hessian matrix. One of those methods is the symmetric rank 1( H-version) update (SR1 update), where this update satisfies the quasi-Newton condition and the symmetric property of inverse of Hessian matrix, but does not preserve the positive definite property of the inverse of Hessian matrix where the initial inverse of Hessian matrix is positive definiteness. The positive definite prope

Although G6PD deficiency is the most common genetically determined blood disorder among Iraqis, its molecular basis has only recently been studied among the Kurds in North Iraq, while studies focusing on Arabs in other parts of Iraq are still absent.

This paper discusses the problem of decoding codeword in Reed- Muller Codes. We will use the Hadamard matrices as a method to decode codeword in Reed- Muller codes.In addition Reed- Muller Codes are defined and encoding matrices are discussed. Finally, a method of decoding is explained and an example is given to clarify this method, as well as, this method is compared with the classical method which is called Hamming distance.

This paper describes a number of new interleaving strategies based on the golden section. The new interleavers are called golden relative prime interleavers, golden interleavers, and dithered golden interleavers. The latter two approaches involve sorting a real-valued vector derived from the golden section. Random and so-called “spread” interleavers are also considered. Turbo-code performance results are presented and compared for the various interleaving strategies. Of the interleavers considered, the dithered golden interleaver typically provides the best performance, especially for low code rates and large block sizes. The golden relative prime interleaver is shown to work surprisingly well for high puncture rates. These interleav