Abstract: Discrete cosine transform (DCT) and inverse DCT (IDCT) have been widely used in many image processing systems. In this paper, a novel linear-array of DCT and IDCT is derived from the data flow of subband decompositions representing the factorized coefficient matrices in the matrix formulation of the recursive algorithm. For increasing the throughput as well as decreasing the hardware ...

The linear Vlasov-Poisson system for homogeneous, stable equilibria is solved by means of a novel integral transform that is a generalization of the Hilbert transform. The integral transform provides a means for describing the dynamics of the continuous spectrum that is well-known to occur in this system. The results are interpreted in the context of Hamiltonian systems theory, where it is show...

with the increase of communication and financial transaction through internet, on-line signature verification is an accepted biometric technology for access control and plays a significant role in authenticity and authorization in modernized society. therefore, fast and precise algorithms for the signature verification are very attractive. the goal of this paper is modeling of velocity signal t...

there are a variety of electrocardiogram (ecg) based methods to detect myocardial infarction (mi) patients. this study used the signal averaged electrocardiogram (saecg) and its wavelet coefficient as an index to detect mi. orthogonal leads signals from 50 acute myocardial infarction (ami) and 50 healthy subjects were selected from the national metrology institute of germany (ptb diagnostic dat...

Notions of externally and internally positive singular discrete-time linear systems are introduced. It is shown that a singular discrete-time linear system is externally positive if and only if its impulse response matrix is non-negative. Sufficient conditions are established under which a single-output singular discrete-time system with matrices in canonical forms is internally positive. It is...

The problems of unified efficient computations of the discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), and their inverse transforms are considered. In particular, a new scheme employing the time-recursive approach to compute these transforms is presented. Using such approach, unified parallel lattice structures that can dually generate the DCT an...

An arithmetical function f is said to be even (mod r) if f (n) = f ((n, r)) for all n ∈ Z + , where (n, r) is the greatest common divisor of n and r. We adopt a linear algebraic approach to show that the Discrete Fourier Transform of an even function (mod r) can be written in terms of Ramanujan's sum and may thus be referred to as the Discrete Ramanujan-Fourier Transform.

Discrete subfactors include a particular class of infinite index and all finite ones. A discrete subfactor is called local when it braided fulfills commutativity condition motivated by the study inclusion Quantum Field Theories in algebraic Haag–Kastler setting. In Bischoff et al. (J Funct Anal 281(1):109004, 2021), we proved that every irreducible arises as fixed point under action canonical c...