The LDI matrix is introduced in its full and shortened forms. As an analogy of the Pascal matrix for the bilinear transform, the LDI matrix serves to transform the coefficients of the transfer functions of continuousand discrete-time linear circuits which are connected by the LDI (Lossless Discrete Integration) transform. The basic properties of the LDI matrix are presented and a procedure of i...

The discrete fractional Fourier transform (DFRFT) is the generalization of discrete Fourier transform. Many types of DFRFT have been derived and are useful for signal processing applications. In this paper, we will introduce a new type of DFRFT, which are unitary, reversible, and flexible; in addition, the closed-form analytic expression can be obtained. It works in performance similar to the c...

An important problem in communication engineering is the energy concentration problem, that is the problem of finding a signal bandlimited to [−σ, σ] with maximum energy concentration in the interval [−τ, τ ], 0 < τ, in the time domain, or equivalently, finding a signal that is time limited to the interval [−τ, τ ] with maximum energy concentration in [−σ, σ] in the frequency domain. This probl...

In this study, base on traditional lapped transform’s properties, inherit from some of the special characteristic properties of discrete cosine transform, trigonometric identities and the structure of linear phase filter banks. We present some theoretic properties in the generalized structure of linear phase paraunitary filter bank and build some examples corresponding to these properties. Thes...

In medical imaging, the Radon transform, used for tomographic reconstruction, recovers a N-Dimensional image from a set of acquired (N-1)D projections. However, it implies approximations in discrete domain. Beside this transform, Mojette transform has been developped as a discrete and exact transform. However, its construction is incompatible with physical X-Rays properties. In this paper, afte...

A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...

| Some applications of the Discrete Fourier Transform (DFT) in coding and in cryptography are described. The DFT over general commutative rings is introduced and the condition for its existence given. Blahut's Theorem, which relates the DFT to linear complexity, is shown to hold unchanged in general commutative rings. I. The (Usual) Discrete Fourier Transform Let be a primitive N th root of uni...

The Hartley transform, a real-valued alternative to the complex Fourier transform, is presented as an efficient tool for the analysis and simulation of earthquake accelerograms. This paper is introduced a novel method based on discrete Hartley transform (DHT) and radial basis function (RBF) neural network for generation of artificial earthquake accelerograms from specific target spectrums. Acce...