A novel blind robust image watermarking in DCT domain using inter-block coefficient correlation

C Das, S Panigrahi, VK Sharma… - AEU-International Journal …, 2014 - Elsevier
This paper presents a novel blind watermarking algorithm in DCT domain using the
correlation between two DCT coefficients of adjacent blocks in the same position. One DCT …

A Low Complex and Scalable Reconfigurable Simulation for Orthogonal Approximation using DCT

MA Sreema, N Muthukumaran - 2021 2nd International …, 2021 - ieeexplore.ieee.org
Guess of Discrete Cosine Transform (DCT) is valuable for diminishing its computational
intricacy without critical effect on its coding execution. This paper presents a summed up …

A generalized algorithm and reconfigurable architecture for efficient and scalable orthogonal approximation of DCT

M Jridi, A Alfalou, PK Meher - IEEE Transactions on Circuits and …, 2014 - ieeexplore.ieee.org
Approximation of discrete cosine transform (DCT) is useful for reducing its computational
complexity without significant impact on its coding performance. Most of the existing …

Low-power VLSI architectures for DCT\/DWT: precision vs approximation for HD video, biomedical, and smart antenna applications

A Madanayake, RJ Cintra, V Dimitrov… - IEEE Circuits and …, 2015 - ieeexplore.ieee.org
The DCT and the DWT are used in a number of emerging DSP applications, such as, HD
video compression, biomedical imaging, and smart antenna beamformers for wireless …

High throughput DA-based DCT with high accuracy error-compensated adder tree

YH Chen, TY Chang, CY Li - IEEE Transactions on Very Large …, 2010 - ieeexplore.ieee.org
In this brief, by operating the shifting and addition in parallel, an error-compensated adder-
tree (ECAT) is proposed to deal with the truncation errors and to achieve low-error and high …

A Row-Parallel 88 2-D DCT Architecture Using Algebraic Integer-Based Exact Computation

A Madanayake, RJ Cintra, D Onen… - IEEE transactions on …, 2011 - ieeexplore.ieee.org
An algebraic integer (AI)-based time-multiplexed row-parallel architecture and two final
reconstruction step (FRS) algorithms are proposed for the implementation of bivariate AI …

Hardware-efficient realization of prime-length DCT based on distributed arithmetic

J **e, PK Meher, J He - IEEE Transactions on Computers, 2012 - ieeexplore.ieee.org
This paper presents an efficient decomposition scheme for hardware-efficient realization of
discrete cosine transform (DCT) based on distributed arithmetic. We have proposed an …

Reduced memory, low complexity embedded image compression algorithm using hierarchical listless discrete Tchebichef transform

RK Senapati, UC Pati, KK Mahapatra - IET Image Processing, 2014 - Wiley Online Library
Listless set partitioning embedded block (LSK) and set partitioning embedded block
(SPECK) are known for their low complexity and simple implementation. However, the …

A high-speed 2-D transform architecture with unique kernel for multi-standard video applications

CY Huang, LF Chen, YK Lai - 2008 IEEE International …, 2008 - ieeexplore.ieee.org
In this paper, a high-speed two-dimensional (2-D) transform architecture with unique kernel
for multi-standard video applications is proposed. On the basis of the new distributed …

A high performance video transform engine by using space-time scheduling strategy

YH Chen, TY Chang - IEEE transactions on very large scale …, 2011 - ieeexplore.ieee.org
In this paper, a spatial and time scheduling strategy, called the space-time scheduling (STS)
strategy, that achieves high image resolutions in real-time systems is proposed. The …