In this paper different channel coding and interleaving schemes in DS/CDMA system over multipath fading channel were used. Two types of serially concatenated coding were presented. The first one composed of Reed-Solomon as outer code, convolutional code as inner code and the interleaver between the outer and inner codes and the second consist of convolutional code as outer code, interleaved in the middle and differential code as an inner code. Bit error rate performance of different schemes in multipath fading channel was analyzed and compared. Rack receiver was used in DS/CDMA receiver to combine multipath components in order to enhance the signal to noise ratio at the receiver.

In this paper, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial. By this method the state and the adjoint variables are approximated by Boubaker polynomial with unknown coefficients, thus an optimal control problem is transformed to algebraic equations which can be solved easily, and then the numerical value of the performance index is obtained. Also the operational matrices of differentiation and integration have been deduced for the same polynomial to help solving the problems easier. A numerical example was given to show the applicability and efficiency of the method. Some characteristics of this polynomial which can be used for solvin

A method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.

Compressing the speech reduces the data storage requirements, leading to reducing the time of transmitting the digitized speech over long-haul links like internet. To obtain best performance in speech compression, wavelet transforms require filters that combine a number of desirable properties, such as orthogonality and symmetry.The MCT bases functions are derived from GHM bases function using 2D linear convolution .The fast computation algorithm methods introduced here added desirable features to the current transform. We further assess the performance of the MCT in speech compression application. This paper discusses the effect of using DWT and MCT (one and two dimension) on speech compression. DWT and MCT performances in terms of comp

The demand for electronic -passport photo ( frontal facial) images has grown rapidly. It now extends to Electronic Government (E-Gov) applications such as social benefits driver's license, e-passport, and e-visa . With the COVID 19 (coronavirus disease ), facial (formal) images are becoming more widely used and spreading quickly, and are being used to verify an individual's identity, but unfortunately that comes with insignificant details of constant background which leads to huge byte consumption that affects storage space and transmission, where the optimal solution that aims to curtail data size using compression techniques that based on exploiting image redundancy(s) efficiently.

  In this paper we introduce a new class of degree of best algebraic approximation polynomial Α,, for unbounded functions in weighted space Lp,α(X), 1 ∞ .We shall prove direct and converse theorems for best algebraic approximation in terms modulus of smoothness in weighted space

In this paper we use non-polynomial spline functions to develop numerical methods to approximate the solution of 2nd kind Volterra integral equations. Numerical examples are presented to illustrate the applications of these method, and to compare the computed results with other known methods.

A non-polynomial spline (NPS) is an approximation method that relies on the triangular and polynomial parts, so the method has infinite derivatives of the triangular part of the NPS to compensate for the loss of smoothness inherited by the polynomial. In this paper, we propose polynomial-free linear and quadratic spline types to solve fuzzy Volterra integral equations (FVIE) of the 2nd kind with the weakly singular kernel (FVIEWSK) and Abel's type kernel. The linear type algorithm gives four parameters to form a linear spline. In comparison, the quadratic type algorithm gives five parameters to create a quadratic spline, which is more of a credit for the exact solution. These algorithms process kernel singularities with a simple techniqu

In this paper, we will focus to one of the recent applications of PU-algebras in the coding theory, namely the construction of codes by soft sets PU-valued functions. First, we shall introduce the notion of soft sets PU-valued functions on PU-algebra and investigate some of its related properties.Moreover, the codes generated by a soft sets PU-valued function are constructed and several examples are given. Furthermore, example with graphs of binary block code constructed from a soft sets PU-valued function is constructed.