By Topic

Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Grigoryan, A.M. ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; Agaian, S.S.

In this paper, an effective column(row)-wise algorithm for computing the two-dimensional discrete Hadamard transform (2-D DHAT) of size 2r×2r, r>1, by using the paired algorithm of the one-dimensional DHAT, is considered. A new class of so-called discrete paired transforms, which split the 2r-point DHAT, r>1, into a set of smaller 2r-i-point transforms, i=1: n, is introduced. Based on such splitting, the algorithm for computing the 2-D DHAT requires on average no more than 12 operations of additions per sample

Published in:

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on  (Volume:47 ,  Issue: 12 )