This paper proposes a dedicated hardware architecture for the Low-Frequency Non-Separable Transform (LFNST) of Versatile Video Coding (H.266/VVC) standard. The VVC defines two stages transformation, where first stage uses traditional transform types (e.g. DCT-II, DCT-VII and DST-VII), while secondary applies LFNST. LFNST is used to coefficients that were transformed by DCT-II in primary transfo...

Electrocardiogram (ECG) data compression algorithm is needed to reduce the amount of data to be transmitted, stored and analyzed, without losing the clinical information content. This work investigates a set of ECG data compression schemes to compare their performances in compressing ECG signals. These schemes are based on transform methods such as discrete cosine transform (DCT), fast fourier ...

This paper presents stable, radix-2, completely recursive discrete cosine transform algorithms DCT-I and DCT-III solely based on DCT-I, DCT-II, DCT-III, and DCT-IV having sparse and orthogonal factors. Error bounds for computing the completely recursive DCT-I, DCT-II, DCT-III, and DCT-IV algorithms having sparse and orthogonal factors are addressed. Signal flow graphs are demonstrated based on ...

Two new lapped transforms are introduced: the LBT (lapped biorthogonal transform) and the HLBT (hierarchical lapped biorthogonal transform). The LBT has the same computational complexity of the LOT (lapped orthogonal transform), with much less blocking artifacts. The HLBT has a significantly lower computational complexity than the LOT, essentially no blocking artifacts, and less ringing artifac...

In this paper, the design and development of a new fully parallel architecture for the computation of the threedimensional discrete cosine transform (3D DCT) is presented. It can be used for the computation of either the forward or the inverse 3D DCT and is suitable for real-time processing of 2D or multi-view video codecs. The computation of the 3D DCT is carried out using the row-column-frame...

This paper presents a general framework for maximally decimated modulated filter banks. The theory covers the known classes of cosine modulation and relates them to complexmodulated filter banks. The prototype filters have arbitrary lengths, and the overall delay of the filter bank is arbitrary, within fundamental limits. Necessary and sufficient conditions for perfect reconstruction (PR) are d...

The eecient implementation of the discrete cosine tansform is discussed in this paper. The architecture, that is used, is a systolic processor array consisting of orthonormal rotations. The angles of these rotations are denoted by ij. With respect to a simple VLSI implementation an approximation of the DCT is realized. The approximation is obtained by using approximate (orthogonal) rotations. I...

Telemedicine is well known application where enormous amount of medical data need to be transferred securely over network and manipulate effectively. Security of digital data, especially medical images, becomes important for many reasons such as confidentiality, authentication and integrity. Digital watermarking has emerged as a advanced technology to enhance the security of digital images. The...

A set of DCT domain properties for shifting and scaling by real amounts, and taking linear operations such as differentiation is described. The DCT coefficients of a sampled signal are subjected to a linear transform, which returns the DCT coefficients of the shifted, scaled and/or differentiated signal. The properties are derived by considering the inverse discrete transform as a cosine series...

The discrete cosine transform (DCT) has a variety of applications in image and speech processing. The idea of the subband{DFT (SB{DFT) [1], [2] is applied in [3] to the DCT. In this paper the basic idea of the SB{DCT is discussed which is based on subband decomposition of the input sequence. Approximation is done by discarding the computations of bands of little energy. The complexity of this f...