The Field Programmable Gate Array (FPGA) approach is the most recent category, which takes the place in the implementation of most of the Digital Signal Processing (DSP) applications. It had proved the capability to handle such problems and supports all the necessary needs like scalability, speed, size, cost, and efficiency.

In this paper a new proposed circuit design is implemented for the evaluation of the coefficients of the two-dimensional Wavelet Transform (WT) and Wavelet Packet Transform (WPT) using FPGA is provided.

In this implementation the evaluations of the WT & WPT coefficients are depending upon filter tree decomposition using the 2-D discrete convolution algorithm. This implementation w

        The secure data transmission over internet is achieved using Steganography. It is the art and science of concealing information in unremarkable cover media so as not to arouse an observer’s suspicion. In this paper the color cover image is divided into equally four parts, for each part select one channel from each part( Red, or Green, or  Blue), choosing one of these channel depending on the high color ratio in that part. The chosen part is decomposing into four parts {LL, HL, LH, HH} by using discrete wavelet transform. The hiding image is divided into four part n*n then apply DCT on each part. Finally the four DCT coefficient parts embedding in four high frequency sub-bands {HH} in

     The hiding of information has become of great importance in recent times. With dissemination through the internet, and communication through satellites, information needs to be secure. Therefore, a new algorithm is proposed that enables secret messages to be embedded inside satellite images, wherein images of any size or format can be hidden, using a system’s image compression techniques. This operation is executed in three main steps: first phase – the original image is converted into a raster image; second phase– steganography, in which a binary secret message is hidden inside a raster image, using a 4×4 array as the secret key; and third phase– compre

In this paper, a new analytical method is introduced to find the general solution of linear partial differential equations. In this method, each Laplace transform (LT) and Sumudu transform (ST) is used independently along with canonical coordinates. The strength of this method is that it is easy to implement and does not require initial conditions.

In this paper we have presented a comparison between two novel integral transformations that are of great importance in the solution of differential equations. These two transformations are the complex Sadik transform and the KAJ transform. An uncompressed forced oscillator, which is an important application, served as the basis for comparison. The application was solved and exact solutions were obtained. Therefore, in this paper, the exact solution was found based on two different integral transforms: the first integral transform complex Sadik and the second integral transform KAJ. And these exact solutions obtained from these two integral transforms were new methods with simple algebraic calculations and applied to different problems.

        In this paper, double Sumudu and double Elzaki transforms methods are used to compute the numerical solutions for some types of fractional order partial differential equations with constant coefficients and explaining the efficiently of the method by illustrating some numerical examples that are computed by using  Mathcad 15.and graphic in Matlab R2015a.

NeighShrink is an efficient image denoising algorithm based on the discrete wavelet
transform (DWT). Its disadvantage is to use a suboptimal universal threshold and identical
neighbouring window size in all wavelet subbands. Dengwen and Wengang proposed an
improved method, which can determine an optimal threshold and neighbouring window size
for every subband by the Stein’s unbiased risk estimate (SURE). Its denoising performance is
considerably superior to NeighShrink and also outperforms SURE-LET, which is an up-todate
denoising algorithm based on the SURE. In this paper different wavelet transform
families are used with this improved method, the results show that Haar wavelet has the
lowest performance among

Time series analysis is the statistical approach used to analyze a series of data. Time series is the most popular statistical method for forecasting, which is widely used in several statistical and economic applications. The wavelet transform is a powerful mathematical technique that converts an analyzed signal into a time-frequency representation. The wavelet transform method provides signal information in both the time domain and frequency domain. The aims of this study are to propose a wavelet function by derivation of a quotient from two different Fibonacci coefficient polynomials, as well as a comparison between ARIMA and wavelet-ARIMA. The time series data for daily wind speed is used for this study. From the obtained results, the

     Storing and transferring the images data are raised in recent years due to requisiteness of transmission bandwidth for considerable storage capacity. Data compression method is proposed and applied in an attempt to convert data files into smaller files. The proposed and applied method is based on the Wavelet Difference Reduction (WDR) as considered the most efficient image coding method in recent years. Compression are done for three different Wavelet based Image techniques using WDR process. These techniques are implemented with different types of wavelet codecs. These are Daub2+2,2 Integer Wavelet transform, Daub5/3 integer to integer wavelet transform, and Daub9/7 Wavelet transform with level four. The used mu