A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc

Future wireless systems aim to provide higher transmission data rates, improved spectral efficiency and greater capacity. In this paper a spectral efficient two dimensional (2-D) parallel code division multiple access (CDMA) system is proposed for generating and transmitting (2-D CDMA) symbols through 2-D Inter-Symbol Interference (ISI) channel to increase the transmission speed. The 3D-Hadamard matrix is used to generate the 2-D spreading codes required to spread the two-dimensional data for each user row wise and column wise. The quadrature amplitude modulation (QAM) is used as a data mapping technique due to the increased spectral efficiency offered. The new structure simulated using MATLAB and a comparison of performance for ser

Abstract

 The objective of image fusion is to merge multiple sources of images together in such a way that the final representation contains higher amount of useful information than any input one.. In this paper, a weighted average fusion method is proposed. It depends on using weights that are extracted from source images using counterlet transform. The extraction method is done by making the approximated transformed coefficients equal to zero, then taking the inverse counterlet transform to get the details of the images to be fused. The performance of the proposed algorithm has been verified on several grey scale and color test  images, and compared with some present methods.

The Hartley transform generalizes to the fractional Hartley transform (FRHT) which gives various uses in different fields of image encryption. Unfortunately, the available literature of fractional Hartley transform is unable to provide its inversion theorem. So accordingly original function cannot retrieve directly, which restrict its applications. The intension of this paper is to propose inversion theorem of fractional Hartley transform to overcome this drawback. Moreover, some properties of fractional Hartley transform are discussed in this paper.

The need for a flexible and cost effective biometric security system is the inspired of this paper. Face recognition is a good contactless biometric and it is suitable and applicable for Wireless Sensor Network (WSN). Image processing and image communication is a challenges task in WSN due to the heavy processing and communication that reduce the life time of the network. This paper proposed a face recognition algorithm on WSN depending on the principles of the unique algorithm that hold the capacity of the network to the sink node and compress the communication data to 89.5%. An efficient hybrid method is introduced based upon the advantage of Zak transform to offprint the farthest different features of the face and Eigen face method to

In this work, watershed transform method was implemented to detect and extract tumors and abnormalities in MRI brain skull stripped images. An adaptive technique has been proposed to improve the performance of this method.Watershed transform algorithm based on clustering techniques: K-Means and FCM were implemented to reduce the oversegmentation problem. The K-Means and FCM clustered images were utilized as input images to the watershed algorithm as well as of the original image. The relative surface area of the extracted tumor region was calculated for each application. The results showed that watershed trnsform algorithm succeedeed to detect and extract the brain tumor regions very well according to the consult of a specialist doctor a

Offline Arabic handwritten recognition lies in a major field of challenge due to the changing styles of writing from one individual to another. It is difficult to recognize the Arabic handwritten because of the same appearance of the different characters.  In this paper a proposed method for Offline Arabic handwritten recognition. The   proposed method for recognition hand-written Arabic word without segmentation to sub letters based on feature extraction scale invariant feature transform (SIFT) and   support vector machines (SVMs) to enhance the recognition accuracy. The proposed method  experimented using (AHDB) database. The experiment result  show  (99.08) recognition  rate.

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

        In this paper, new transform with fundamental properties are presented. The new transform has many interesting properties and applications which make it rival to other transforms.

Furthermore, we generalize all existing differentiation, integration, and convolution theorems in the existing literature. New results and new shifting theorems are introduced. Finally, comprehensive list of this transforms of functions will be providing.